Dash Puzzle [0.35 DASH to Solver]

[rosengold]

Not Mine, Saw on Reddit:

--- Dash Decoded - Welcome To Level One ---

0.35 dash on this page, take it, it’s yours!

The key is split into two. The first part is 7qcSjq5t2ehUDzHWuN6nVWBspJ

And the second part is in the above image.

Has someone already taken it? - check the balance here:

https://chainz.cryptoid.info/dash/address.dws?Xdecodek64og3suP7iAwWnWpwuTkmgpFtB.htm

--- How To Claim ---

Go to https://paper.dash.org/

Go to “Wallet Details” and enter the private key. The corresponding public key will be Xdecodek64og3suP7iAwWnWpwuTkmgpFtB

Use a wallet (such as Dash Wallet by Hash Engineering) to sweep the private key!

Happy decoding!

#DashDecoded

[Vitamin_52]

Can I get 0.35 Dash for these puzzles? Tried your instruction nothing happened. Write in detail what you need to lead and where. Would throw a screenshot

[NeuroticFish]

Can I get 0.35 Dash for these puzzles? Tried your instruction nothing happened. Write in detail what you need to lead and where. Would throw a screenshot

If you can solve the puzzle, you should be able to get the 0.35 DASH yourself, since the solution of the puzzle is the private key of the wallet.
No other solution is valid and if you would have had reading you would have known that it's not OP who made the puzzle.

[ivaf]

I can’t understand - is there a key in this puzzle? Or do I just need to substitute values and iterate over combinations?

[Coin_trader]

I can’t understand - is there a key in this puzzle? Or do I just need to substitute values and iterate over combinations?

Yep. The other half of the key is on the puzzle above. You need a generator app to decode that. Doing it manually might take you a day to decode it. I check the addresd and still no decode it.

[BigBoy89]

I can’t understand - is there a key in this puzzle? Or do I just need to substitute values and iterate over combinations?

Yep. The other half of the key is on the puzzle above. You need a generator app to decode that. Doing it manually might take you a day to decode it. I check the addresd and still no decode it.

I don't have time to finish it now, as I have a better-paid job to do.

Simple recursive Google search + https://stackoverflow.com/questions/4331092/finding-all-combinations-of-javascript-array-values

But be my guess and play with it

Code:

// Rewrite console.log to save AND to file.
var fs_cons = require('fs');
var util_cons = require('util');
var log_file_cons = fs_cons.createWriteStream(__dirname + '/_DASH_Priv_Key.txt', {flags : 'w'});
var log_stdout_cons = process.stdout;

console.log = function(d = '') { //
  log_file_cons.write(util_cons.format(d) + '\r\n');
  log_stdout_cons.write(util_cons.format(d) + '\r\n');
};



// recursion
function* reccc_hash(head, ...tail) {
  let remainder = tail.length ? reccc_hash(...tail) : [[]];
  for (let r of remainder) for (let h of head) yield [h, ...r];
}

const s1  = ['L', 'k', '5', 'm', '9'];
const s2 = ['8', 'b', '8', 'a', 'm'];
const s3  = ['p', 'F', '1', 'E', 'W'];
const s4  = ['z', 'G', '0', '6', 'a'];
const s5  = ['u', 'X', '8', 'X', '4'];
const s6  = ['M', 'i', '9', '5', 'e'];
const s7  = ['M', '2', '4', 'p', 'q'];
const s8  = ['z', 'O', 'C', 'o', 'Z'];
const s9  = ['g', 'k', '2', 'C', '7'];

console.log(...reccc_hash(s1, s2, s3, s4, s5));    

// Output needs to be properly formatted and then run as 

// console.log(...cartesian(s6, s7, s8, s9));    

// FInally concatenate 7qcSjq5t2ehUDzHWuN6nVWBspJ + 1st results + 2nd results >>> Import into a wallet

[lobat999]

I can’t understand - is there a key in this puzzle? Or do I just need to substitute values and iterate over combinations?

Yep. The other half of the key is on the puzzle above. You need a generator app to decode that. Doing it manually might take you a day to decode it. I check the addresd and still no decode it.

I don't have time to finish it now, as I have a better-paid job to do.

Simple recursive Google search + https://stackoverflow.com/questions/4331092/finding-all-combinations-of-javascript-array-values

But be my guess and play with it

Code:

// Rewrite console.log to save AND to file.
var fs_cons = require('fs');
var util_cons = require('util');
var log_file_cons = fs_cons.createWriteStream(__dirname + '/_DASH_Priv_Key.txt', {flags : 'w'});
var log_stdout_cons = process.stdout;

console.log = function(d = '') { //
  log_file_cons.write(util_cons.format(d) + '\r\n');
  log_stdout_cons.write(util_cons.format(d) + '\r\n');
};



// recursion
function* reccc_hash(head, ...tail) {
  let remainder = tail.length ? reccc_hash(...tail) : [[]];
  for (let r of remainder) for (let h of head) yield [h, ...r];
}

const s1  = ['L', 'k', '5', 'm', '9'];
const s2 = ['8', 'b', '8', 'a', 'm'];
const s3  = ['p', 'F', '1', 'E', 'W'];
const s4  = ['z', 'G', '0', '6', 'a'];
const s5  = ['u', 'X', '8', 'X', '4'];
const s6  = ['M', 'i', '9', '5', 'e'];
const s7  = ['M', '2', '4', 'p', 'q'];
const s8  = ['z', 'O', 'C', 'o', 'Z'];
const s9  = ['g', 'k', '2', 'C', '7'];

console.log(...reccc_hash(s1, s2, s3, s4, s5));    

// Output needs to be properly formatted and then run as 

// console.log(...cartesian(s6, s7, s8, s9));    

// FInally concatenate 7qcSjq5t2ehUDzHWuN6nVWBspJ + 1st results + 2nd results >>> Import into a wallet

Great! Thanks for this idea which sounds logical but I guess I need to port this code and test it using Python which I'm now beginning to learn and could play and tinker this and see if it works! Even though I may not be the one to solve this first, I would gladly take this as a challenge to better hone myself.

[BigBoy89]

I can’t understand - is there a key in this puzzle? Or do I just need to substitute values and iterate over combinations?

Yep. The other half of the key is on the puzzle above. You need a generator app to decode that. Doing it manually might take you a day to decode it. I check the addresd and still no decode it.

I don't have time to finish it now, as I have a better-paid job to do.

Simple recursive Google search + https://stackoverflow.com/questions/4331092/finding-all-combinations-of-javascript-array-values

But be my guess and play with it

Code:

// Rewrite console.log to save AND to file.
var fs_cons = require('fs');
var util_cons = require('util');
var log_file_cons = fs_cons.createWriteStream(__dirname + '/_DASH_Priv_Key.txt', {flags : 'w'});
var log_stdout_cons = process.stdout;

console.log = function(d = '') { //
  log_file_cons.write(util_cons.format(d) + '\r\n');
  log_stdout_cons.write(util_cons.format(d) + '\r\n');
};



// recursion
function* reccc_hash(head, ...tail) {
  let remainder = tail.length ? reccc_hash(...tail) : [[]];
  for (let r of remainder) for (let h of head) yield [h, ...r];
}

const s1  = ['L', 'k', '5', 'm', '9'];
const s2 = ['8', 'b', '8', 'a', 'm'];
const s3  = ['p', 'F', '1', 'E', 'W'];
const s4  = ['z', 'G', '0', '6', 'a'];
const s5  = ['u', 'X', '8', 'X', '4'];
const s6  = ['M', 'i', '9', '5', 'e'];
const s7  = ['M', '2', '4', 'p', 'q'];
const s8  = ['z', 'O', 'C', 'o', 'Z'];
const s9  = ['g', 'k', '2', 'C', '7'];

console.log(...reccc_hash(s1, s2, s3, s4, s5));    

// Output needs to be properly formatted and then run as 

// console.log(...cartesian(s6, s7, s8, s9));    

// FInally concatenate 7qcSjq5t2ehUDzHWuN6nVWBspJ + 1st results + 2nd results >>> Import into a wallet

Great! Thanks for this idea which sounds logical but I guess I need to port this code and test it using Python which I'm now beginning to learn and could play and tinker this and see if it works! Even though I may not be the one to solve this first, I would gladly take this as a challenge to better hone myself.

Here are two tutorials on how to port it in Python:

https://www.programiz.com/python-programming/recursion

https://realpython.com/python-thinking-recursively/

Or just use the example and change parameters from numbers to string.

[lobat999]

I don't have time to finish it now, as I have a better-paid job to do.

Simple recursive Google search + https://stackoverflow.com/questions/4331092/finding-all-combinations-of-javascript-array-values

But be my guess and play with it

Code:

// Rewrite console.log to save AND to file.
var fs_cons = require('fs');
var util_cons = require('util');
var log_file_cons = fs_cons.createWriteStream(__dirname + '/_DASH_Priv_Key.txt', {flags : 'w'});
var log_stdout_cons = process.stdout;

console.log = function(d = '') { //
  log_file_cons.write(util_cons.format(d) + '\r\n');
  log_stdout_cons.write(util_cons.format(d) + '\r\n');
};



// recursion
function* reccc_hash(head, ...tail) {
  let remainder = tail.length ? reccc_hash(...tail) : [[]];
  for (let r of remainder) for (let h of head) yield [h, ...r];
}

const s1  = ['L', 'k', '5', 'm', '9'];
const s2 = ['8', 'b', '8', 'a', 'm'];
const s3  = ['p', 'F', '1', 'E', 'W'];
const s4  = ['z', 'G', '0', '6', 'a'];
const s5  = ['u', 'X', '8', 'X', '4'];
const s6  = ['M', 'i', '9', '5', 'e'];
const s7  = ['M', '2', '4', 'p', 'q'];
const s8  = ['z', 'O', 'C', 'o', 'Z'];
const s9  = ['g', 'k', '2', 'C', '7'];

console.log(...reccc_hash(s1, s2, s3, s4, s5));    

// Output needs to be properly formatted and then run as 

// console.log(...cartesian(s6, s7, s8, s9));    

// FInally concatenate 7qcSjq5t2ehUDzHWuN6nVWBspJ + 1st results + 2nd results >>> Import into a wallet

Great! Thanks for this idea which sounds logical but I guess I need to port this code and test it using Python which I'm now beginning to learn and could play and tinker this and see if it works! Even though I may not be the one to solve this first, I would gladly take this as a challenge to better hone myself.

Here are two tutorials on how to port it in Python:

https://www.programiz.com/python-programming/recursion

https://realpython.com/python-thinking-recursively/

Or just use the example and change parameters from numbers to string.

Great! Thank you for these resources and I really want to hone my coding skills and your example would be of great help to me. Btw, have you figured out already the answer to this puzzle?

[BigBoy89]

Nope, I didn't have time than to take a glance and see a recursive solution.
If the 'leafs' are not in the right order (e.g. left to right), you will need to do another recursion - with different orders.

But if you don't solve it, I guess I will do it during the weekend when I'm off work.
OP or somebody else put another 0.35 and now the 'bounty' is 0.7 DASH. Worth an hour of my time

https://chainz.cryptoid.info/dash/address.dws?Xdecodek64og3suP7iAwWnWpwuTkmgpFtB.htm

[lobat999]

Nope, I didn't have time than to take a glance and see a recursive solution.
If the 'leafs' are not in the right order (e.g. left to right), you will need to do another recursion - with different orders.

But if you don't solve it, I guess I will do it during the weekend when I'm off work.
OP or somebody else put another 0.35 and now the 'bounty' is 0.7 DASH. Worth an hour of my time

https://chainz.cryptoid.info/dash/address.dws?Xdecodek64og3suP7iAwWnWpwuTkmgpFtB.htm

I'm just starting to learn Python as a hobby and love to do it in my spare time. Anyway I'll take it as an exercise but if you will do solve it, and if you may allow, I would love to see the code and maybe learn from it.