Bitcoin puzzle transaction ~32 BTC prize to who solves it

[citb0in]

I don know anout DP, for good DP generation I think take a look for puzle privkeys are normal random,so if your generator generates no privkeys what have 50/50 0 and 1 they waste time....
---cut---

Unequal bits scrypt what calculate no normal disrtributed numbers
---cut---

I modify scrypt, so, not normal in 2^20 buts is mach many:
---cut---

puzzle transactions especially in 50/50, but some of them 49

my scryot for you, darlings: ))

[...]
---cut---

Please stop making (mass) consecutive posts. You’ve been warned multiple times already to avoid this behavior. Use the edit function to merge your posts and ensure this doesn't happen again in the future. If this continues, further action will be taken.

[insimulation]

Can someone please give a technical explanation of how they find (how this similarity search works) private key after someone already finds the private key and starts a transaction? I know mining means finding a part of private key and these private keys are in a narrow window. But there are too many pools, so I would expect to 1 or 2 approvals "quickly". Even if my transaction got let say 1 approval are they allowed to cancel the transaction when they have private key?

Is it a naive approach to create a bot to make ~60 transactions 0.1 BTC each?

[kTimesG]

Can someone please give a technical explanation of how they find (how this similarity search works) private key after someone already finds the private key and starts a transaction? I know mining means finding a part of private key and these private keys are in a narrow window. But there are too many pools, so I would expect to 1 or 2 approvals "quickly". Even if my transaction got let say 1 approval are they allowed to cancel the transaction when they have private key?

Is it a naive approach to create a bot to make ~60 transactions 0.1 BTC each?

This was discussed to death dozens of times, why don't you read the last pages of the thread?

Once the private key is found it is inevitable to have to make its public key, well... public when you create the transaction, so that the signature can be verified. It doesn't matter if you create 1 output or 100 outputs. Since the public key gets, well... public, everyone will know it. Knowing the public key of a "small" private key (< 100 bits, less or more depending on current technology) allows to find the corresponding private key in anywhere between less than a second and 10 minutes, before your original transaction gets confirmed in a mined block. Knowing the private key allows for creating a new valid (signed via the private key) overriding transaction, with a higher fee, which replaces your transaction, irrelevant of how it looked like or of its content, flags, etc.

[madogss]

Number of numbers with unequal bits: 431910
Number of numbers with equal bits: 92378
Number of numbers differing by 1 bit: 0
Number of numbers differing by 2 bits: 167960
Number of numbers differing by 3 bits: 0
Number of numbers differing by 4 bits: 125970
Number of numbers differing by 5 bits: 0
Maximum deviation from 50/50: 20

[Program finished]

so in your search ranges not 2^20-2^19  = 524288, but 92378 calculations )) 5 times smaller, yes ?))

priv of puz 2^19-2^20 is 11010010110001010101 so, my darlings , you are soend 75 percent of yor time for free then you brute all range

I wonder how you convert the 92378 calculations to a valid search range? and do you have any plan to make it in a more efficient language so it could possibly be run using higher bit ranges.   

[COBRAS]

Number of numbers with unequal bits: 431910
Number of numbers with equal bits: 92378
Number of numbers differing by 1 bit: 0
Number of numbers differing by 2 bits: 167960
Number of numbers differing by 3 bits: 0
Number of numbers differing by 4 bits: 125970
Number of numbers differing by 5 bits: 0
Maximum deviation from 50/50: 20

[Program finished]

so in your search ranges not 2^20-2^19  = 524288, but 92378 calculations )) 5 times smaller, yes ?))

priv of puz 2^19-2^20 is 11010010110001010101 so, my darlings , you are soend 75 percent of yor time for free then you brute all range

I wonder how you convert the 92378 calculations to a valid search range? and do you have any plan to make it in a more efficient language so it could possibly be run using higher bit ranges.  

I not search range, try research how many bits 0 and zero in range, and how many 0 and 1 in https://privatekeys.pw/puzzles/bitcoin-puzzle-tx

after, remove not valid generations. Yes, calculate all ranges not needs as for me, for other guy's I don know

[COBRAS]

Number of numbers with unequal bits: 431910
Number of numbers with equal bits: 92378
Number of numbers differing by 1 bit: 0
Number of numbers differing by 2 bits: 167960
Number of numbers differing by 3 bits: 0
Number of numbers differing by 4 bits: 125970
Number of numbers differing by 5 bits: 0
Maximum deviation from 50/50: 20

[Program finished]

so in your search ranges not 2^20-2^19  = 524288, but 92378 calculations )) 5 times smaller, yes ?))

priv of puz 2^19-2^20 is 11010010110001010101 so, my darlings , you are soend 75 percent of yor time for free then you brute all range

I wonder how you convert the 92378 calculations to a valid search range? and do you have any plan to make it in a more efficient language so it could possibly be run using higher bit ranges.  

not range, random generator do 92378, not fool range

[gygy]

If it is not a secret how many keys have you checked total, per sec?

I started 4 month ago with an obsolete GPU and it only runs when I am home and I feel like that. I have checked 576_006_654_001_152 keys with about 150 MKeys/sec speed.

I know these are rookie numbers.