Bitcoin puzzle transaction ~32 BTC prize to who solves it

[Bulista]

This is the address #25:

KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7siAXycwkwRQg
15JhYXn6Mx3oF4Y7PcTAv2wVVAuCFFQNiP
33185509

Nobody knows yet any others?

[1714155480]

1714155480

[1714155480]

1714155480

[HugoTheSpider]

Here are all keys from #1 to #40:

Bits	Hex	Decimal	Binary	As raw text	Log(2)
1	0000000001	1	░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█		0
2	0000000003	3	░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░██		1.5849625007212
3	0000000007	7	░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░███		2.8073549220576
4	0000000008	8	░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█░░░		3
5	0000000015	21	░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█░█░█		4.3923174227788
6	0000000031	49	░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░██░░░█	1	5.6147098441152
7	000000004C	76	░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█░░██░░	L	6.2479275134436
8	00000000E0	224	░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░███░░░░░	à	7.8073549220576
9	00000001D3	467	░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░███░█░░██	Ó	8.8672787397097
10	0000000202	514	░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█░░░░░░░█░		9.0056245491939
11	0000000483	1155	░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█░░█░░░░░██	ƒ	10.173677136303
12	0000000A7B	2683	░░░░░░░░░░░░░░░░░░░░░░░░░░░░█░█░░████░██	{	11.389631339261
13	0000001460	5216	░░░░░░░░░░░░░░░░░░░░░░░░░░░█░█░░░██░░░░░	`	12.348728154231
14	0000002930	10544	░░░░░░░░░░░░░░░░░░░░░░░░░░█░█░░█░░██░░░░	)0	13.364134655008
15	00000068F3	26867	░░░░░░░░░░░░░░░░░░░░░░░░░██░█░░░████░░██	hó	14.713547616913
16	000000C936	51510	░░░░░░░░░░░░░░░░░░░░░░░░██░░█░░█░░██░██░	É6	15.652564919611
17	000001764F	95823	░░░░░░░░░░░░░░░░░░░░░░░█░███░██░░█░░████	vO	16.548084361224
18	000003080D	198669	░░░░░░░░░░░░░░░░░░░░░░██░░░░█░░░░░░░██░█		17.600007248708
19	000005749F	357535	░░░░░░░░░░░░░░░░░░░░░█░█░███░█░░█░░█████	tŸ	18.447724952285
20	00000D2C55	863317	░░░░░░░░░░░░░░░░░░░░██░█░░█░██░░░█░█░█░█	,U	19.719530872026
21	00001BA534	1811764	░░░░░░░░░░░░░░░░░░░██░███░█░░█░█░░██░█░░	¥4	20.788963611792
22	00002DE40F	3007503	░░░░░░░░░░░░░░░░░░█░██░████░░█░░░░░░████	-ä	21.520134745822
23	0000556E52	5598802	░░░░░░░░░░░░░░░░░█░█░█░█░██░███░░█░█░░█░	UnR	22.416686729788
24	0000DC2A04	14428676	░░░░░░░░░░░░░░░░██░███░░░░█░█░█░░░░░░█░░	Ü*	23.782435585948
25	0001FA5EE5	33185509	░░░░░░░░░░░░░░░██████░█░░█░████░███░░█░█	ú^å	24.984050066697
26	000340326E	54538862	░░░░░░░░░░░░░░██░█░░░░░░░░██░░█░░██░███░	@2n	25.700781261713
27	0006AC3875	111949941	░░░░░░░░░░░░░██░█░█░██░░░░███░░░░███░█░█	¬8u	26.738278526959
28	000D916CE8	227634408	░░░░░░░░░░░░██░██░░█░░░█░██░██░░███░█░░░	‘lè	27.762143403295
29	0017E2551E	400708894	░░░░░░░░░░░█░██████░░░█░░█░█░█░█░░░████░	âU	28.577979290797
30	003D94CD64	1033162084	░░░░░░░░░░████░██░░█░█░░██░░██░█░██░░█░░	=”Íd	29.944419458082
31	007D4FE747	2102388551	░░░░░░░░░█████░█░█░░███████░░███░█░░░███	}OçG	30.969382178281
32	00B862A62E	3093472814	░░░░░░░░█░███░░░░██░░░█░█░█░░██░░░█░███░	¸b¦.	31.526580209328
33	01A96CA8D8	7137437912	░░░░░░░██░█░█░░█░██░██░░█░█░█░░░██░██░░░	©l¨Ø	32.732759144628
34	034A65911D	14133072157	░░░░░░██░█░░█░█░░██░░█░██░░█░░░█░░░███░█	Je‘	33.718356052473
35	04AED21170	20112871792	░░░░░█░░█░█░███░██░█░░█░░░░█░░░█░███░░░░	®Ò p	34.227400038686
36	09DE820A7C	42387769980	░░░░█░░███░████░█░░░░░█░░░░░█░█░░█████░░	Þ‚ |	35.302929017097
37	1757756A93	100251560595	░░░█░███░█░█░███░███░█░█░██░█░█░█░░█░░██	Wuj“	36.544833738747
38	22382FACD0	146971536592	░░█░░░█░░░███░░░░░█░█████░█░██░░██░█░░░░	"8/¬Ð	37.096745824716
39	4B5F8303E9	323724968937	░█░░█░██░█░██████░░░░░██░░░░░░█████░█░░█	K_ƒ é	38.235977688802
40	E9AE4933D6	1003651412950	███░█░░██░█░███░░█░░█░░█░░██░░████░█░██░	é®I3Ö	39.868395419757

[bob123]

I don't know why but I'm smelling a big scam. Because a newbie that offer more than 12 000€ to solve a following of numbers this is strange...

Pls read the posts first before spamming for sig campaign

[Bulista]

Here are all keys from #1 to #40:
-snip-

Very good! Thanks

What does the column Log(2) mean exactly? What are the calculations behind it?

[Robertt]

I'm horrible at this stuff, just curious..
How did you find the private key for the first address?
Maybe once I figure that out I can give this a shot

[HugoTheSpider]

What does the column Log(2) mean exactly? What are the calculations behind it?

Log(2) = Logarithm to the base 2 of the decimal value.

How did you find the private key for the first address?

Brute force

[Robertt]

Very good! Thanks

What does the column Log(2) mean exactly? What are the calculations behind it?

Log(2) = Logarithm to the base 2 of the decimal value.

How did you find the private key for the first address?

Brute force

So could I just use vanitygen & type in
vanitygen.exe -t 50 -v [address]?
Or is there different else to do

[HugoTheSpider]

So could I just use vanitygen & type in
vanitygen.exe -t 50 -v [address]?
Or is there different else to do

Vanitygen doesn't support this way of address generation but you can create your own customized program by copying some code off vanitygen.

It doesn't make sense to use the CPU version anymore if you plan to brute force the keys above 2⁵⁰.

[Bulista]

So could I just use vanitygen & type in
vanitygen.exe -t 50 -v [address]?
Or is there different else to do

Vanitygen doesn't support this way of address generation but you can create your own customized program by copying some code off vanitygen.

It doesn't make sense to use the CPU version anymore if you plan to brute force the keys above 2⁵⁰.

Your results are from CPU or GPU?

What's your performance?

[Robertt]

Well damn I can't code so there goes that option
If I was smart enough to do this I would, looks fun

[HugoTheSpider]

Your results are from CPU or GPU?

What's your performance?

I was involved in the challenge and earned some BTC. I speedhacked the code in the mealtime at work straight after I saw the puzzle back in January 2015 and started it on some server remotely. The first version could do about 100,000 keys/s using a CPU. After some improvements I boosted the rate to 700,000 keys/s on a single computer. Later I ran it on many computers and checked million of keys/s. Luckly I could recycle the code later in the August 2015 puzzle at https://bitcointalk.org/index.php?topic=1144807.0
I had no time to learn how to code on a GPU.

[Bulista]

Your results are from CPU or GPU?

What's your performance?

I was involved in the challenge and earned some BTC. I speedhacked the code in the mealtime at work straight after I saw the puzzle back in January 2015 and started it on some server remotely. The first version could do about 100,000 keys/s using a CPU. After some improvements I boosted the rate to 700,000 keys/s on a single computer. Later I ran it on many computers and checked million of keys/s. Luckly I could recycle the code later in the August 2015 puzzle at https://bitcointalk.org/index.php?topic=1144807.0
I had no time to learn how to code on a GPU.

Pretty good performance. I'm at 10,000 keys/s, pretty slow, so I will get nowhere for values > #40 without trying to improve code or coding for GPU.

Anyhow, I think even with GPU we won't go too far...

Do you know anything about who created this 32 BTC puzzle?

[HugoTheSpider]

Pretty good performance. I'm at 10,000 keys/s, pretty slow, so I will get nowhere for values > #40 without trying to improve code or coding for GPU.

Anyhow, I think even with GPU we won't go too far...

Do you know anything about who created this 32 BTC puzzle?

A GPU cracker would take at most ~a year for solving the next 2⁵¹ address at 35,000,000 keys/s. I guess it will be cracked too in future, but for fun and not for money.

I don't know who made this pizzle.

[Bulista]

Pretty good performance. I'm at 10,000 keys/s, pretty slow, so I will get nowhere for values > #40 without trying to improve code or coding for GPU.

Anyhow, I think even with GPU we won't go too far...

Do you know anything about who created this 32 BTC puzzle?

A GPU cracker would take at most a year for solving the next 2⁵¹ address at 35,000,000 keys/s. I guess it will be cracked too in future, but for fun and not for money.

I don't know who made this pizzle.

Exactly.

One thing I was wondering is if it is possible somehow to tweak some ASIC miner out there to turn it into a cracker?

I have no idea if such thing is possible as I never used any ASIC miner.

[shorena]

Pretty good performance. I'm at 10,000 keys/s, pretty slow, so I will get nowhere for values > #40 without trying to improve code or coding for GPU.

Anyhow, I think even with GPU we won't go too far...

Do you know anything about who created this 32 BTC puzzle?

A GPU cracker would take at most a year for solving the next 2⁵¹ address at 35,000,000 keys/s. I guess it will be cracked too in future, but for fun and not for money.

I don't know who made this pizzle.

Exactly.

One thing I was wondering is if it is possible somehow to tweak some ASIC miner out there to turn it into a cracker?

I have no idea if such thing is possible as I never used any ASIC miner.

Miners can only do sha256d. What is needed here is pubkey(ECDSA privkey) and ripemd160(sha256(0x04pubkeyxpubkeyy)). Everything else can be ignored if we compare to the ripemd160 hash. Its certainly possible to design an ASIC for this and it might even be profitable for someone to do so in the future.

[BurtW]

It seems to me that you guys should not be using the ECC scalar multiplication function at all, just a very fast, totally optimized "increment by G" function:

Code:

Initialization:

Set BitcoinAddresses[256] = the list of bitcoin addresses from the transaction, binary form without the checksum 
Set BitcoinAddressIndex = 0;
Set PrivateKey = 1; 
Set PublicKey = G;

Loop Until BitcoinAddressIndex == 256: // == "forever"

Call Convert PublicKey to BitcoinAddress [but just to the binary form, do not encode or calculate the checksum]

If BitcoinAddress == BitcoinAddresses[BitcoinAddressIndex] Then

    Log BitcoinAddressIndex, PrivateKey, PublicKey, BitcoinAddress

    Create transaction and claim Bitcoins if any available at BitcoinAddress

Endif

++PrivateKey;

Call Increment PublicKey by G // Highly optimized, very specialized function to just compute PublicKey = PublicKey + G

EndLoop

This algorithm, when optimized, and split up so that many loops could be done in parallel, is as fast as it can be done.

Note on the PublicKey to BitcoinAddress conversion function:

You only need to do the first 3 of the 9 steps in this process.

1 - Take the PublicKey and format it properly (add the 1 byte of 0x04, change to compressed form if needed)
2 - Perform SHA-256 hashing on the result
3 - Perform RIPEMD-160 hashing on the result of SHA-256

This result can be compared directly to the BitcoinAddresses[] array assuming you have stored the 256 Bitcoin addresses in the proper binary form.

Not sure a miner would help as it only does one of the steps in the PublicKey to BitcoinAddress conversion.

Of course an FPGA could be programmed to do this.  And, of course, if you had the resources an ASIC could be made to do this.

Final note on the BitcoinAddresses[] array values:

To get the proper values for this array simply undo the last 6 steps of the PublicKey to BitcoinAddress function for each of the 256 Bitcoin addresses in the transaction:

1 - Decode the base58 string to a binary byte array
2 - Strip off the 4 checksum bytes from the tail
3 - Strip off the version byte (0x00) from the front
4 - Store the result in the array

[BurtW]

Here are all keys from #1 to #40:

Very nicely done.  I especially like the graphical binary form and the log2 is also informative.

Thanks for this.

Are you currently trying to discover the values above 40?

[BurtW]

We should form a cooperative and search the private key space for the next correct value in much the same way GIMPS (http://www.mersenne.org/) searches for prime numbers.

Everyone that wants to participate would run a client in the background on their computer.

There would be a central server which would dole out search spaces of one billion or trillion consecutive private keys (whatever makes sense as a chunk size) to the connected clients and the clients would grind through their assigned search spaces using my suggested (increment by G) algorithm.

When a client was done with its assignment it would request another chunk of private key space from the server.

If a client did find the correct private key then the winner would keep the 0.051 BTC.

we could do something with the BTC, suggestions are:

split it among all clients proportional to work done [but method to prove work would need to be figured out]
donate it to charity
open to other suggestions

[amaclin]

We should form a cooperative and search the private key...

Most dump idea ever.
You made my day.

[HugoTheSpider]

It seems to me that you guys should not be using the ECC scalar multiplication function at all, just a very fast, totally optimized "increment by G" function:

I was already utilizing the point addition function instead of point multiplication.

Are you currently trying to discover the values above 40?

No. Currently I don't try to discover any values above 2⁴⁰.
I'll continue the search if:

• I learn how to code on GPU one day
• I gain access to many computers equipped with a powerfull GPU