Bitcoin puzzle transaction ~32 BTC prize to who solves it

[nomachine]

It is working. I tried with -t {1..24} and observed

Code:

=== FOUND MATCH! ===

each time.

Imagine how fast this would be if he weren’t fishing. He doesn’t care. This is just entertainment for him when he’s full of money. 

Your opinion on trust or my personal finances is irrelevant. The script's performance speaks for itself. Otherwise, unsolicited speculation about my motives or resources is just noise. . Contribute code or move on.

[b0dre]

It is working. I tried with -t {1..24} and observed

Code:

=== FOUND MATCH! ===

each time.

Imagine how fast this would be if he weren’t fishing. He doesn’t care. This is just entertainment for him when he’s full of money. 

Your opinion on trust or my personal finances is irrelevant. The script's performance speaks for itself. Otherwise, unsolicited speculation about my motives or resources is just noise. . Contribute code or move on.

Don't waste your time on people like him.

[Bram24732]

OK, I have to finally admit it.

I had it wrong with the way I was viewing things. I had some spare time (I don't do fishing yet) so I played around with the possibility that maybe, just maybe, prefixes might indeed be useful to accelerate the brute-force.

I can't believe how ashamed I feel, inside out, after managing to speed up a plain old scan search by 800% on average, by using prefixes as a good hint to stop all the GPU instances currently running and reset all the offsets and ranges based on the new informations.

So now my baby is purring out results at an astonishing speed, check this out. If you don't trust that my cracking grid spits out correct keys, you can check them one by one. I'm gonna let you figure out just how many hashes are usually needed to find a 32-bit minimum prefix match, but boy, look at that bad ass speed!!!



To apologize for my fuck-up, I'm gonna share a few nice results I managed to grab recently, feel free to use them as you wish!

Code:

0xc4cf15366c5d3e412 1MVDYgVaSeWVxvT8vVRkujyHHoboXcUm6 0372222bf4e46bc20bb3d591f4350f4ccc5ae740040f948d0cce00cb5aef1c96ef
0xa59fc4663314c8c13 1MVDYgVaSCGMAW6FeE9jJJbrv2877Qh4C 035a1a8b0f903340a2e80df22b733e81d0f97c4252739879079d68803371cf72b7
0xa7cf01ad011bf227a 1MVDYgVaTTjBZ4ZPCJv4UYWYSt6792kds 025df7a3396982755ee35189402dda5aaf532c5bbd30f6e584486565929390b3e2
0x8f549725db946b1b8 1MVDYgVa89Q7rBWZaXcTf1UVPJ9BwDCX8 02c8befe745333183bb1ec263134f788fb768f6202053568f65c9c1506a17030e4
0x9468c372a5ce48cd5 1MVDYgVaDCnqjuvMjDSfS1nURGMR8cmuf 03d2a7ad2697e57153d31e4437830df14958dbe52b2dd89674c7e9a5cdf44b7763
0xa6e64129243ee31dc 1MVDYgVaCH57TSAQwoWMqX9Ztz8iNkpzW 0284e277b768a2a0e6d32ba9714ec4fe7d626a80d748c8ff457827f021235682d9
0xb1575cd28d49e82fb 1MVDYgVa7ZsJYQ8SFaXMSfoFJJgtgTtRY 02f03c02369c57339aaed65e1fb691ec3e6ff2bc1e80b15dddaf8e017d6f2761cb
0xc4e3650fd1b15ac18 1MVDYgVaHi8Q8rDmFYxkUkRq9vZpx5fE2 02fa68270c520d74351183b369b09001294f3b9796f1dfae78af15c28a70cb0436
0x8c7450c9a20a70e8d 1MVDYgVa3WmZ7XQK9PvzTBp6GvX96vdhy 03c535511fb1bf74b8433a626734446d8e68509e077b5ca08d09eb01060d1fb6ea
0x98ed1dd57d11bdcc4 1MVDYgVa34juD8zJFk88379qUjXju4ekQ 039a9caa2bb588fedcdfb6c44856f4e73d3044101b37f4cda51e48417ae49fe567
0xe7a0def14aea45067 1MVDYgVZvxTgAhh499DjDcG9YRaSdrAqD 036d6132ccf2e0fdef4bf35e595083930ce2e59fbfd04ad45e172c7994ec131f4e
0xe7c83c2c99506fc88 1MVDYgVa2qshGvVjSTi9MwkSHL1iUm2bU 030aa97b1220ee84638da8f4de8a93a77186f9d0cf54c5091aa39108360aed5770
0xea306846e30c25532 1MVDYgVa2soVBDM8U7vz2PS5Bwwsyvrfm 0320f88f4db86ad51678ee34cc7edf4f33f07b6059499d4eecb7636fdcfd7cedb4
0xf68a81d6a691ec69a 1MVDYgVa5UZv1JpqTMg3bi3oMM9CGJ8D2 03fda232afac8f6c9c79e428fbea4f69d390d33565716e3e0c9f2663709ff4fd24
0x9292254947908c82c 1MVDYgVaX8s2T7LS7Z9jHtHp3VW4d8dFS 037f4d46b12147ca48496a3ccba5a4a1984e67c3fefc4076472722412b2ec6a0a7
0x9ec5992003a4dadc6 1MVDYgVaaysSySK4bbDTKDkX5bsF8VojK 03fdf0c21b3272960296190a9ed54d5cf8e610de7fa24b777b2d1896199f25aa3c
0xa1d1d432e5556bab8 1MVDYgVawZkXLui2q5bH5wfPch1c4sdbn 03e7666c3bf6f535006a4d5cd1029eb5056176f80a11ec7b5f3509bde018e85283
0xaae90eb0cccb66062 1MVDYgVafTYPwaMyoratNAKSoxqWHGNGW 02a440bd241721eadfae0adfc39cc5f01a7961496e9911f17d13e7efb1f047f359
0xb45e67b553064938d 1MVDYgVaa6EGxVvwSnpbxQo3tJukg1uvb 03df9139f5820da4f3c23816d51417da7fc7a08d2b041c8931dd05c26348dcca16
0xc1715aa75c9addff4 1MVDYgVaaKfVGv1sSsfszDjwv77ciwK2C 02bacfd7ace256c8fef2f44fe1d9e9d1e0163e4fb5730eec7613213a0e9577e024
0xc5a3ea3ae2fb3f2e0 1MVDYgVaWC9o4SGj9yr4p17CH7QQSQnmR 029b6833144031ed7e27e3e01ac5adb893cf736ed4a47c9c64c00e6edb6c908fbb
0xcc74ef889d8fb4df8 1MVDYgVanb37tvZL7eXLhit7v9TYuB6Qd 034401be05aaaaf37790aa9f0cb28f8fb2c6be86962c9bad286bcd075c130244ab
0xd4b5b95d9059b0b6a 1MVDYgVb4dqSk9horLK28Yp9CLJgsFhyp 03e39346f8ec02ea5d7d1d15eab91b4fcd751c9c8c18b1ba039cf089a7c32a1769
0xdd48d47cad650d43f 1MVDYgVaeGi2w6xMy519XmjzjFBHbu11D 034994afee63f045733415827d62c4ac821b765bd0eaef6a3a446a478d2d1ea013
0xebf74596a5782a3f3 1MVDYgVb985cANsV7MGUtoYmquC6HogNK 022da6acacc2bf7884dca91b1d535a32799c51cdb7935eae5528a796a834000110
0x80f9a22915619799e 1MVDYgVbczqnMaRQXaXPHKYxGaWKR2VSB 027a32f73fd72476a37ad99513a0aa4994244df5dd97ef4307f39e028ed210d973
0x8286daab06e728065 1MVDYgVcVb59KJCp5D7toEQw91xVoZEk7 027e9d74c0230e30154523e586c78463e7269088913f85e0b76e8f8afb571a43cf
0x830a6dc8e7b186ef4 1MVDYgVbttrNR2iepzfYNvSWVXjzKm3ab 039743581b5a91c059d238b12c4f6175e8fffd12b015832ef71a22ca117d31864e
0x856808a6e195d6ee0 1MVDYgVcLfodUcRARmu3MJdGoBNb2G7QP 0205d67026caef7c016079ce06b98ef3e8bc21440445c557cd8c78c605d736be6c
0x8834d28549e657a6b 1MVDYgVbMndK6gonHeSv8KN4hJKZivtFi 02e86eb277b13a0ef3af813b3cfe977bcca40eaa9f9f0194c96b0ee2e8060e3fcb
0x8b8788ee35ab6f688 1MVDYgVceaSaWk4igpMBBDdXAu2NhPmFX 023b418523b3f8f03b4e4fee46a123ed501ee3e09605f37d0f77678e5cf52dc6ff
0x8d6c43786e61ca0f0 1MVDYgVcWwJ4g6Ru5iRSamGrW9RcuRRCP 020239984c4ff3aca947ddfbb8578eb38db6b4ad8c95f244aabeedf9ee354241ca
0x8f165aab5ef06ad88 1MVDYgVbizW2eYrMVF1x31XedFHNkpsy3 03254ef919d0faa4e32f346410c213c34d9aa600b383e7f72b6e71b4a5f370ee28
0x9a113c6c3562cb270 1MVDYgVbH35pfnuxAaw1QMypNfBrAw5h6 03909b672b3ced7a23a57612d4c13e7c054d4b7eaf76d4037c86f8738b07217f05
0x9c499b345e951c47b 1MVDYgVcaXHFuyNfSGCndHyxfnX1FQ7da 02803c366fc2762596dd2d9850d2d0f904eb306c51f7218306905da648d054ee68
0x9cebd9be1e8635286 1MVDYgVbvJfWvuvcHxGJrmUerPhE4SDro 03a24b1b62952342acef9f2a3d441a24e48e2a159bd9c9767f3b48cb9aaeef55a1
0xa082bf833dd4c729d 1MVDYgVbxhHJSWbFPmpRLBARecQkCULXi 03815a9cf5dc7de202cfd8c9ea0c4063f79dfb89e7780e97f0444a96eced6fe74e
0xa3511b31aa3c7f8a5 1MVDYgVcKYEoNovpX53wWsZZ44cKSvEnG 02788bcf6d9ae17b54e2a7eada5f5f9f0addfbf7d5290d11046cfcdbd582d8bb1c
0xa63215a737a6c13e6 1MVDYgVc6KrA1GensbpNG78ruFtFHi3Y4 02add55320bd62949d5ec2996b3d7e6e82227867ee3af5b3759ca4fdb699c16665
0xa7a74438ca8603bc7 1MVDYgVbczLHJFQyjWH2CCpoTkjdg6He8 02ee6d5228700b1d3c436c28c509f42c85a94cef5d1df8ceb4cb0b199046b71614
0xaf2cf75aaf7d2cfe4 1MVDYgVcJKCkCboRWSuNwdPf8jW4qW3Jq 020a249ab92368fb166be1a77415916b4b324238cd2cb8f2a6ea9521dd306036d1
0xb175e5d7b5149348e 1MVDYgVcGruUyjSyH7Ct5c7S9dgLk3dhh 0306a1b8a294dbfb66b8f634623278daf89df43065bfb01c3264cb0dd9ca012360
0xb2054f604e6fe93e5 1MVDYgVcZw3jnuMQVrgBnVr1capW3QLyo 03d61fc6547389a4ba5b2dc5409cd9ae56247b685b932aaf796f72b81f7af27af0
0xb3f858dfe2c3abc32 1MVDYgVbaNnRKk4866xubVCQthZHNMucR 024291bb32c33666a7fbf6a577d67bb26f54b61b39f2134cb8fe23a0cb20029135
0xb66df5467aa2f5c89 1MVDYgVbeuM7fxzwT6DwbBeEetBwZHnay 03755b0ccab1973d2355eae5095a6006e108560b5dd823903dbdfe672f5f66b07c
0xb8108f1c949edf349 1MVDYgVcNS5rwbw6Ae9P87GBrSUwYNe59 034099eb475e157e01fda361460c44879f2042b24605529c46c96d0303fe75808c
0xb958b8feb47fc3344 1MVDYgVc3jQwGFmXRqE8Brcnt162agbeu 03cf85ea9de786c828d46603491d0d10e1e5624224f737b530657ad27e88a5c439
0xbff333ada94e53a57 1MVDYgVbQVwMuZZ7Fk55mzN9aPVv3HkAE 027103fc06daa9a7ba536353506e560275e45c3d211bccc03cec593fd851bd4daf
0xc251183d8a7cca7a5 1MVDYgVbNrnHEejxuN8E4ACPSV9z9QQj2 038ab193e66457c09257838e2af39a5094b7fc6abd5d6e19b31872fe1b597227b5
0xc2e7c6fd21e66e389 1MVDYgVcZfSJkZ6id2mceBkV7cGXkKqTk 032a6113d7b44a15e46a59843023564471768ca676f02d2e7218f8b976d9da40a8
0xc44afc2001582cd79 1MVDYgVbSHGvy6mdtrQDfh2UoQSyYG9oK 02c3e9d2842fdc53c274b12cb4c9bd1ba0960a341adf4ae76fe2641ce55aa5f618
0xccc7129a330cf2b54 1MVDYgVbbAtBJA7bw8DHj7FUToUU22zZ8 032d5866e989321533d1d8a50296199860a5d1e798568f65336d698892f6a25b48
0xd05c6446a36f37ec7 1MVDYgVbgjPUrteB3ifNLLHepREf1Lfye 039536215bb7ee81ae278c369bd8458289c69df948db918e4c81ae2cfd0721fbb5
0xd173007057baea098 1MVDYgVbbhTssLoUCE1AXWPnFXnquoKzE 02f2933969f86a5841d3a7ac42ba5032d9b31d13096b7e1a8235bf92f3778bec76
0xd9b49644827b2a5d0 1MVDYgVbgA1fkKNECFuTjms4ZJv8JZRcu 025bd8fbbd1b6e9fe530f4c33335358a4c1ab07d77c79d9ba75a65923f097ad41a
0xde34dae79f4c7b982 1MVDYgVcKDLrcgB9WSmb4z3ifmDhiSPiP 02d13c2fec303aed19f586246d73c567db1967307ae580fc778e8bb574e879f50f
0xe59da4cd15b851643 1MVDYgVbF5RLm7sRYk6Epeqj2NwwE9g1P 02bd84576f7c4eb9acedc1ba26f47a8d374b2ff09bba18416faab7ef0cfb5721c6
0xe76651e59864e8ffd 1MVDYgVcTnxhgWxmjdzJCr4o2bTFfWEqo 021f269ae7f3bedc8223e2abb2c66defe76f70448d4052039564d3f20e6cd3aa4e
0xedb056f19b3b7e978 1MVDYgVbMKv6FWAoqU1UmRpPMiDYLpTZK 0290b437276ccd7361b79af0219526f892d345db15b91ce2edf4ade83e2b8e71ff
0xeef3d5de8f60848aa 1MVDYgVc7L3DpYSDcNudjdAXXn7fR45He 02584494f02759351078e8b6efd65ef50264d5b363e053aba6fd177a1236bba189
0xef03db9594d46948d 1MVDYgVbdBLfdiEK1mGy6xXPTfauSzTWg 0271eace4829ea972516eb3f4d3c59a2ad78531b994d8f320b8c8c57e5045fbf73
0xf2f5d60eda10e663b 1MVDYgVbNjRsQbLXQBK4o1BeuZtYyPVWH 026fd6bcaea1558618c38865971d088774c74d3eee1130c52f09df8365b7e31217
0xf68a76a1a957e717e 1MVDYgVcLJFT935gCXxMd4qzZUNGLD7BD 03cfabfdcc89b1c242b860e1023154be7c74d40a85bcfbc612e71882219626d266
0xf7aa3c2801c4622fe 1MVDYgVbGn8hAwUqjv9ZoRRjiB32odVmK 03f04749db897868f0257e1196581d58dd04a880f0a22dc7de955d5743c87b2d31
0xf7c1e9abfde5064ed 1MVDYgVc3hZPHSoxi4C7d8iBQZU8HgiAT 02b30a7b233b3630989dfb9dfb112024b182a451622d5daf9e48682c3996fe237c
0xfbce787b31400e3cd 1MVDYgVbgmHjzXLoTunHtBwqNWKTna8PL 03a5ffe4a8df77dd6afe16e5b7314ed33c64e8897538fceacf7a9f571833874586
0xfe9057e046e196507 1MVDYgVcDS1m8CA2YPkNmNZQq9c8t9f1q 03ae326fb4b2ec9dd7c0915b1add7cb179964e2457661f4b17017ad1f2c3b4b93c
0xff420fc4fe6aa1203 1MVDYgVcGpfkqV7iQXDZb6b55XUVunS5w 03f13e24b4e57de088972d4f9cbd3ca20be80c4e501d561278e70fb0e1b2b375b2
0x88b3e0b282f83009e 1MVDYgVesrxeMuyEHb7zxW3Nb3KjqbfyJ 029824b2d17445069bf9ea7fdb221871cbf4d5069bacc50865e64b4abe4b2a949e
0x8ad59bb29c80889ef 1MVDYgVfM2BvwiofJmYPqL5T5XM7kHWhM 03bb9075fab9e1c28e25e13dd9ded85f22eb4ae2ee883ce331e2182d6c95fa5001
0x8e86c364e15b88007 1MVDYgVcpNBXMhwDW8xgtDQ657NcRNXWM 02e2e6d3ff30c09a8a237b38faaa44b0952ec316df6078cff7a6ef614d1839c94d
0x9103f91ff55f4952f 1MVDYgVfLc65da7jfMyEtuWjDkpiRkN6a 02c0a826f58c00453aca375fbd8d8fbf14931a471a456dc240252db35bb4a54b2d
0x91ab23bdc6bcb328c 1MVDYgVf9X8h4gBMAW2viqGtCPN4Gfmr5 02ed86c4404ce74e42d51de34bcbec1f2b127b8f5141cb789a591fef4b40ce6c91
0x96217b861e12b9b96 1MVDYgVeHQUG1xnGLLRxxaWRqiVx7dtsR 034e97834e9c111136850c6be561b7699be6c17e4a1d8e8b15b158a1eb2f913927
0x975a8968afa93141c 1MVDYgVejxoD691FhZkqwLNsXr3HY6avJ 0204e53e5acf48770a435f1e2d0256f9a8d601cd5094d114778943ab7c4301f1a1
0x977964d6f60cbf2d9 1MVDYgVeC1LEcpdfyVYLhYGC8TPv4VHLV 0331ef8a350a2f20dbdc5c9865e2c1768570002986b4c019496c155c1fa8495b0b
0x996239a0da4cb78a8 1MVDYgVeNZHw9uKhohqfJcJxsXte1dRPG 0241e8d4f4f6b31c31697bf629b2a6f1e291eb34f64b63f2b336085cb1d329e842
0x9d5e6590c5f78ddba 1MVDYgVdadL4qMR1hLyyBa4j8fSM6XkMT 021ae1c43beffefb7e478ec8a2a836b4fb906c7e9ecaf895cd81209a10b54d405c
0x9ff9be752cdfa2884 1MVDYgVdRVv8Ur1dmTpTYdukoTLiraWEo 03df2947a14fbf5564b6e0d6a62680a4248d1788f129d11627f0256fc38ad6e75f
0xa40f0213ddd965953 1MVDYgVebshZjmkWveyyho1sHdpb7USwT 03ac8a1d88ef0c64748fda3026bffc0dbcdd1ca7ed478897ead019eaa492753963
0xa68ecf0c25de252fa 1MVDYgVe12BZLd6MGMRRj7NvwEBsqWebs 02691283c48cc6596c765e72f2c20644f2e3029af89bd0ee6061c84f8015980ec7
0xa8d65f7191dd7cdf9 1MVDYgVeTXvxqG11yTSqyFgtv1rj1D8mT 027e903254caf038a9f8721f13fe42233f267e18133394c324fca95f000646308d
0xab4cac702f0c684e2 1MVDYgVdNQJDutD82NjnD9FJPAFE8guF6 020f223ccfe720f8eb62a869924dc7d3b0ee5d63e80bf86cbb24794aeacd7e688d
0xb0031e137c7b1ff41 1MVDYgVdGYyCpCJFifrbgpqTMEYuteqaH 02d45d1fca587f39c086e32b3e657ae58df5b06437a2cda79c66509106d86f72bb
0xb58061c36fa6cf575 1MVDYgVdjy5S3fTjUHX1s22p22vzpNStm 02a380f59310e64a976452e01c46ac290386a75c7a6a991918ac6874edf2f291e3
0xb8444d33a3e90c4b1 1MVDYgVeEgyAMGB1YuGFQR2qx8Qa6pvgt 03678802cba2fd295ea4462ed3fa223f1bae68b0ba5ce1d5ab7bfa59bd0a090ccc
0xbeb19a4daa70f9a54 1MVDYgVdw2MEbxZMQ3dhtSvL3D2oV8BaJ 03efee90fc03b215ff99412da65b0bc0c4fc70c78eff517cd550c007a6a59d00c4
0xc511c38570914087c 1MVDYgVfMrPwCs3LknHLB3U2mjxtWqW48 023149928889168c4ed1e2229ace1b21b5597b4ed4e1e853bee5d4222d3e987d97
0xc5e006698355486cb 1MVDYgVeiCmNE29eh6MmpmExEcXY7eud8 026fe5da0b489869b92886b7fcb42377dc3025a383b54cd89a818ce04529b63874
0xc7bc8515d67c43583 1MVDYgVf9NzyUA73pURaJdYqwmH21kj8Q 03e1d9fc8f75c782fe218cfb6f356113ebc107ea3cc66ef76b3b0c608b68c6ab0d
0xcabdfaa08f2b4955b 1MVDYgVd9iurd9VaRScV1QWPWkj1mTnwh 03bc014236158a450adce0e88f83dbd7d8a97decd21fe7eeb8a4c7b46f409bd53b
0xd4614e77972dd6143 1MVDYgVfTSEs49AFFUNq6EzVzu1Wb5QhB 0373e3ccb526a3dad4540044ba3555ef498f646e530f8f0d78223d77ffab9a8198
0xd6019f357ffaacb54 1MVDYgVds11pn5Z43NYBfpkGG6V2jAWpB 021e58051d89e0ed871f0a1aaa505373ecc31d43a42ee168210a02e246dfeefc24
0xd9c90b9aadd3e0d8d 1MVDYgVdbNLwHuDWSBXP2vbEx3XnqvrUe 0229484889768d3d4ef89c623d6adeed29442c94dfaff85322c67a429d1c882123
0xdaf8d0f952dc74197 1MVDYgVeYoCFXKE2yLaheoUqqcwdYTKhB 02ba45511a67af6eb2c5b098535425f5721376d10419524762190fd43a15c43ca1
0xdcc6a7d71026def78 1MVDYgVfYMC38QzPuq3pzsS7Z1LHGx5qE 03d9529aea733d3e2d2ed6dedcacb8e82382a0a9037f8521f0fd1181a9a88d1433
0xdd536a767df5c5b74 1MVDYgVe3iSXRqFjXmrCT1DyHJrSZWUDj 029d276ca9bebe25198cf152917e17fd99d9e7e605dd4953e401567ad18c022a17
0xdea515860ae23ad0a 1MVDYgVcsDpz5UoYStrFuWUZbS2FnR9oU 0336345c8359e65c72da464ccf4577b8a535ff4d221fdd846055b2af7c317ad69c
0xdf1cde6807737aecb 1MVDYgVfKYNgjcN2Bj6beC1NyukssuTAm 03e03c34047e1f87b78431bbd3637130facc0ad7b935a0ecfc7e9dd524bcd57973
0xe0c3cef16d85eb043 1MVDYgVcgMxmYSiDXjjzA7utJ82rCDmHY 02a97ca2c620bec36478be7ba97b1157c0a95da7176217af08f0bafa13c1c3e405

... 220k more

But now I have another problem: I have so many prefixes, that computing the next ranges to scan takes a longer time than actually scanning the ranges. This mad spiral requires some GPUs to do the computation of the offsets for the GPU computation (of the offsets of the next GPU computation, because too many prefixes...), what do you think??

I'm gonna start swapping some sweet ranges soon with ya guys, tune up your telegrams if you've got your match-9 or longer address prefixes nicely lined up!

kTimesG
nomachine
bibilgin
Bram24732

I have read in the forum about this method with prefixes but still I cannot understand how on earth can be faster than bruteforcing.
Given the following Hash functions, the avalanche effect, how can this work?
Can any (or better all of you) give a concise answer to the rest of us to understand the following?

1. how can it be faster than brute-forcing?
2. what is the mathematical explanation of this?
3. if using '-f/--flips: Override default flip count' or the default, as long as it is not 1, then doesn't it miss some hashes?

Please give a full explanation in one post each to have it here for anybody who is trying to learn.
Thanks

You might want to check the date of the post

[Akito S. M. Hosana]

You might want to check the date of the post

You don't have to check the calendar for this topic at all. Almost every day feels like April Fools' Day.

[AlanJohnson]

You might want to check the date of the post

You don't have to check the calendar for this topic at all. Almost every day feels like April Fools' Day.

I wonder how the 67 was solved. Was it someone very lucky or with access to insane computing power.

Maybe some kind of botnet cracking keys...

[nomachine]

You might want to check the date of the post

You don't have to check the calendar for this topic at all. Almost every day feels like April Fools' Day.

I wonder how the 67 was solved. Was it someone very lucky or with access to insane computing power.

Maybe some kind of botnet cracking keys...

=======================================
== Mutagen Puzzle Solver by Denevron ==
=======================================
Starting puzzle: 66 (66-bit)
Target HASH160: 20d45a6a76...94335db8a5
Base Key: 0x2A32ED54F2B4E35EE
Flip count: 6 (override, default was 35)
Total Flips: 90858768
Using: 12 threads
Progress: 11.006092%
Processed: 10000000
Speed: 33.49 Mkeys/s
Elapsed Time: 00:00:02
=======================================
=========== SOLUTION FOUND ============
=======================================
Private key: 0x2832ED74F2B5E35EE
Checked 19165236 combinations
Bit flips: 6
Time: 4.68 seconds (00:00:04)
Speed: 20.20 Mkeys/s
Solution saved to puzzle_66_solution.txt

At least I know that if you have the correct base key for the right bit flip, Mutagen is proven to work—from Puzzle 66 to Puzzle 128. But you have to guess exactly which one it is. 

[Akito S. M. Hosana]

You might want to check the date of the post

You don't have to check the calendar for this topic at all. Almost every day feels like April Fools' Day.

I wonder how the 67 was solved. Was it someone very lucky or with access to insane computing power.

Maybe some kind of botnet cracking keys...

=======================================
== Mutagen Puzzle Solver by Denevron ==
=======================================
Starting puzzle: 66 (66-bit)
Target HASH160: 20d45a6a76...94335db8a5
Base Key: 0x2A32ED54F2B4E35EE
Flip count: 6 (override, default was 35)
Total Flips: 90858768
Using: 12 threads
Progress: 11.006092%
Processed: 10000000
Speed: 33.49 Mkeys/s
Elapsed Time: 00:00:02
=======================================
=========== SOLUTION FOUND ============
=======================================
Private key: 0x2832ED74F2B5E35EE
Checked 19165236 combinations
Bit flips: 6
Time: 4.68 seconds (00:00:04)
Speed: 20.20 Mkeys/s
Solution saved to puzzle_66_solution.txt

At least I know that if you have the correct base key for the right bit flip, Mutagen is proven to work—from Puzzle 66 to Puzzle 128. But you have to guess exactly which one it is. 

You’ve got the winning combo—base key + bit flip = Mutagen magic!
But uh-oh… the real gamble? Guessing which one unlocks Puzzle 66 → 128.
Pull the lever! (Or just brute-force like a crypto cowboy.) 

[Denevron]

You might want to check the date of the post

You don't have to check the calendar for this topic at all. Almost every day feels like April Fools' Day.

I wonder how the 67 was solved. Was it someone very lucky or with access to insane computing power.

Maybe some kind of botnet cracking keys...

=======================================
== Mutagen Puzzle Solver by Denevron ==
=======================================
Starting puzzle: 66 (66-bit)
Target HASH160: 20d45a6a76...94335db8a5
Base Key: 0x2A32ED54F2B4E35EE
Flip count: 6 (override, default was 35)
Total Flips: 90858768
Using: 12 threads
Progress: 11.006092%
Processed: 10000000
Speed: 33.49 Mkeys/s
Elapsed Time: 00:00:02
=======================================
=========== SOLUTION FOUND ============
=======================================
Private key: 0x2832ED74F2B5E35EE
Checked 19165236 combinations
Bit flips: 6
Time: 4.68 seconds (00:00:04)
Speed: 20.20 Mkeys/s
Solution saved to puzzle_66_solution.txt

At least I know that if you have the correct base key for the right bit flip, Mutagen is proven to work—from Puzzle 66 to Puzzle 128. But you have to guess exactly which one it is. 

 
That's right, if you change the base key, you can still find a match after two flips. 

[Dom1nic]

~

I can't tell if someone hacked kTimesG's account or if it was a sort of April fools joke lol.
Especially this part "(of the offsets of the next GPU computation, because too many prefixes...)"

IMO, way overthinking it, if this was a for real post lol.

32-bit minimum prefix match...I have probably 3 million of these but quit collecting them and went to a minimum of 40+ bits. I probably have 200k of those. But I am not running, stopping, recalculating, and all that jazz. All of mine plug into a db, with padding (your "offset") and now I am just searching the "gaps", the keys in between, 100% range search.

It'll be interesting to see how close I was to solving, once we know the private key. So somebody needs to hurry up and find the private key so I can see lol. Hurry up Bram lol!

Interesting! I'll send you a PM.

[Bram24732]

You might want to check the date of the post

You don't have to check the calendar for this topic at all. Almost every day feels like April Fools' Day.

I wonder how the 67 was solved. Was it someone very lucky or with access to insane computing power.

Maybe some kind of botnet cracking keys...

Definitely not luck

[AlanJohnson]

Shame I have only i5-3570k...  And mutagen won't work on it ...

[Denevron]

Shame I have only i5-3570k...  And mutagen won't work on it ...

for your processor you need to make a version without avx256)

You might want to check the date of the post

You don't have to check the calendar for this topic at all. Almost every day feels like April Fools' Day.

I wonder how the 67 was solved. Was it someone very lucky or with access to insane computing power.

Maybe some kind of botnet cracking keys...

=======================================
== Mutagen Puzzle Solver by Denevron ==
=======================================
Starting puzzle: 66 (66-bit)
Target HASH160: 20d45a6a76...94335db8a5
Base Key: 0x2A32ED54F2B4E35EE
Flip count: 6 (override, default was 35)
Total Flips: 90858768
Using: 12 threads
Progress: 11.006092%
Processed: 10000000
Speed: 33.49 Mkeys/s
Elapsed Time: 00:00:02
=======================================
=========== SOLUTION FOUND ============
=======================================
Private key: 0x2832ED74F2B5E35EE
Checked 19165236 combinations
Bit flips: 6
Time: 4.68 seconds (00:00:04)
Speed: 20.20 Mkeys/s
Solution saved to puzzle_66_solution.txt

At least I know that if you have the correct base key for the right bit flip, Mutagen is proven to work—from Puzzle 66 to Puzzle 128. But you have to guess exactly which one it is.  

Here is a version with better speed)

https://github.com/MikeWazovksy/Mutagen

Code:

=======================================
== Mutagen Puzzle Solver by Denevron ==
=======================================
Starting puzzle: 68 (68-bit)
Target HASH160: e0b8a2baee...7451fc8cfc
Base Key: 0x730FC235C1942C1AE
Flip count: 10 (override, default was 34)
Total Flips: 290752384208
Using: 26 threads
Progress: 99.922523%
Processed: 290527117312
Speed: 97.11 Mkeys/ss
Elapsed Time: 00:49:51


=======================================
========= SEARCH COMPLETED ===========
=======================================
No solution found.
Checked 290759114752 combinations
Total possible: 290752384208
Completion: 100.002315%
Time: 2994.03 seconds (00:49:54)
Speed: 97.11 Mkeys/s

[Denevron]

You might want to check the date of the post

You don't have to check the calendar for this topic at all. Almost every day feels like April Fools' Day.

I wonder how the 67 was solved. Was it someone very lucky or with access to insane computing power.

Maybe some kind of botnet cracking keys...

At least I know that if you have the correct base key for the right bit flip, Mutagen is proven to work—from Puzzle 66 to Puzzle 128. But you have to guess exactly which one it is. 

Here is a version with better speed)

https://github.com/MikeWazovksy/Mutagen

=======================================
== Mutagen Puzzle Solver by Denevron ==
=======================================
Starting puzzle: 30 (30-bit)
Target HASH160: d39c470466...c257d68a08
Base Key: 0x17E2551E
Flip count: 16
Total Flips: 145422675
Using: 8 threads

Progress: 81.659364%
Processed: 120061952
Speed: 11.36 Mkeys/s
Elapsed Time: 00:00:10


=======================================
========= SEARCH COMPLETED ===========
=======================================
No solution found.
Checked 147324928 combinations
Total possible: 145422675
Completion: 101.308086%
Time: 13.55 seconds (00:00:13)
Speed: 10.87 Mkeys/s

I'll fix it now, I tested it and it found everything)

[Geshma]

change the base key to 2A32ED54F2B4E35EE (Dec)

[b0dre]

change the base key to 2A32ED54F2B4E35EE (Dec)

  Thanks, My bad 

[tmar777]

You might want to check the date of the post

You don't have to check the calendar for this topic at all. Almost every day feels like April Fools' Day.

I wonder how the 67 was solved. Was it someone very lucky or with access to insane computing power.

Maybe some kind of botnet cracking keys...

=======================================
== Mutagen Puzzle Solver by Denevron ==
=======================================
Starting puzzle: 66 (66-bit)
Target HASH160: 20d45a6a76...94335db8a5
Base Key: 0x2A32ED54F2B4E35EE
Flip count: 6 (override, default was 35)
Total Flips: 90858768
Using: 12 threads
Progress: 11.006092%
Processed: 10000000
Speed: 33.49 Mkeys/s
Elapsed Time: 00:00:02
=======================================
=========== SOLUTION FOUND ============
=======================================
Private key: 0x2832ED74F2B5E35EE
Checked 19165236 combinations
Bit flips: 6
Time: 4.68 seconds (00:00:04)
Speed: 20.20 Mkeys/s
Solution saved to puzzle_66_solution.txt

At least I know that if you have the correct base key for the right bit flip, Mutagen is proven to work—from Puzzle 66 to Puzzle 128. But you have to guess exactly which one it is. 

1. I still cannot understand how and why this work...can you elaborate on this please?
2. what do you mean by "At least I know that if you have the correct base key for the right bit flip?

thanks

[AlanJohnson]

Shame I have only i5-3570k...  And mutagen won't work on it ...

for your processor you need to make a version without avx256)

I don't get it ...   I have to rewerite the code or just change some flags before compiling ?

BTW 3570k   has  AVX  but not AVX2

[nomachine]

1. I still cannot understand how and why this work...can you elaborate on this please?
2. what do you mean by "At least I know that if you have the correct base key for the right bit flip?
thanks

Python code:

Code:

xor_masks = {
    67: 0b1100111100000011110111001010001111100110101111010011111001010001,
    66: 0b10111110011010001001010001011000011010100101000011100101000010001,
    65: 0b101011111000111010011101100101011111010010011011001011110011000,
    64: 0b100011111010111000001101100001001111011011101110110100101011,
    63: 0b1100110001101000010000001001010011001100001001011111110111,
    62: 0b100111000010101010111110000101001001111011100101010000010001,
    61: 0b110000110110100101011100100010111101000010011011011011111001,
    60: 0b111111100001011110011111011010110010011000010001000001,
    59: 0b10110110100100110100010001111000001101010100101110110000,
    58: 0b100111001100010100100011110101101111001110110010111011110,
    57: 0b10100110110100011011011111000011010100010100111100011,
    56: 0b1100010111001110100100111000101001110110000000000100000,
    55: 0b10101010000011110000001100100100110000001111011101011,
    54: 0b11100100100000100100100101010010100101110000010111100,
    53: 0b111111110000111011100011011100000011100110110010011,
    52: 0b1000001010001111010011011001101000110000111000011,
    51: 0b101011111000111101011110010111111111011000101011,
    50: 0b1110101000010101111000011110100010110110010101011,
    49: 0b100010111110100010010100111111101010000010110010,
    48: 0b10100100001100100101000001100011100010001100100,
    47: 0b100110010100111101111010010101100001101000101,
    46: 0b100010011111001111100011101110010101010111011,
    45: 0b11011101000000110101111010111100001111111010,
    44: 0b11111110101001100101001011100101001110000,
    43: 0b10100001011000100110110000011101001101110,
    42: 0b10101110111011110001110100111001001110000,
    41: 0b1010110001111001011001010011001110100100,
    40: 0b1011001010001101101101100110000101001,
    39: 0b11010010100000011111001111110000010110,
    38: 0b1110111000111110100000101001100101111,
    37: 0b100010101000100010101001010101101100,
    36: 0b11000100001011111011111010110000011,
    35: 0b1101010001001011011110111010001111,
    34: 0b10110101100110100110111011100010,
    33: 0b1010110100100110101011100100111,
    32: 0b1000111100111010101100111010001,
    31: 0b10101100000001100010111000,
    30: 0b10011010110011001010011011,
    29: 0b1000000111011010101011100001,
    28: 0b10011011101001001100010111,
    27: 0b1010100111100011110001010,
    26: 0b101111111100110110010001,
    25: 0b1011010000100011010,
    24: 0b1000111101010111111011,
    23: 0b1010101001000110101101,
    22: 0b100100001101111110000,
    21: 0b1000101101011001011,
    20: 0b101101001110101010,
    19: 0b101000101101100000,
    18: 0b1111011111110010,
    17: 0b1000100110110000,
    16: 0b11011011001001,
    15: 0b1011100001100,
    14: 0b1011011001111,
    13: 0b101110011111,
    12: 0b10110000100,
    11: 0b1101111100,
    10: 0b111111101,
    9: 0b101100,
    8: 0b11111,
    7: 0b110011,
    6: 0b1110,
    5: 0b1010,
    4: 0b111,
    3: 0b0,
    2: 0b0,
    1: 0b0
}

def generate_private_keys():
    print("Puzzle | Private Key")
    print("-------------------")
    for puzzle in range(1, 68):
        if puzzle in xor_masks:
            puzzle_end = 2**puzzle - 1
            private_key = puzzle_end ^ xor_masks[puzzle]
            print(f"{puzzle:6} | {private_key}")
        else:
            print(f"{puzzle:6} | (Missing XOR mask)")

generate_private_keys()

Is it clearer now? If not, then nothing. 

[Akito S. M. Hosana]

1. I still cannot understand how and why this work...can you elaborate on this please?
2. what do you mean by "At least I know that if you have the correct base key for the right bit flip?
thanks

Python code:

Code:

xor_masks = {
    67: 0b1100111100000011110111001010001111100110101111010011111001010001,
    66: 0b10111110011010001001010001011000011010100101000011100101000010001,
    65: 0b101011111000111010011101100101011111010010011011001011110011000,
    64: 0b100011111010111000001101100001001111011011101110110100101011,
    63: 0b1100110001101000010000001001010011001100001001011111110111,
    62: 0b100111000010101010111110000101001001111011100101010000010001,
    61: 0b110000110110100101011100100010111101000010011011011011111001,
    60: 0b111111100001011110011111011010110010011000010001000001,
    59: 0b10110110100100110100010001111000001101010100101110110000,
    58: 0b100111001100010100100011110101101111001110110010111011110,
    57: 0b10100110110100011011011111000011010100010100111100011,
    56: 0b1100010111001110100100111000101001110110000000000100000,
    55: 0b10101010000011110000001100100100110000001111011101011,
    54: 0b11100100100000100100100101010010100101110000010111100,
    53: 0b111111110000111011100011011100000011100110110010011,
    52: 0b1000001010001111010011011001101000110000111000011,
    51: 0b101011111000111101011110010111111111011000101011,
    50: 0b1110101000010101111000011110100010110110010101011,
    49: 0b100010111110100010010100111111101010000010110010,
    48: 0b10100100001100100101000001100011100010001100100,
    47: 0b100110010100111101111010010101100001101000101,
    46: 0b100010011111001111100011101110010101010111011,
    45: 0b11011101000000110101111010111100001111111010,
    44: 0b11111110101001100101001011100101001110000,
    43: 0b10100001011000100110110000011101001101110,
    42: 0b10101110111011110001110100111001001110000,
    41: 0b1010110001111001011001010011001110100100,
    40: 0b1011001010001101101101100110000101001,
    39: 0b11010010100000011111001111110000010110,
    38: 0b1110111000111110100000101001100101111,
    37: 0b100010101000100010101001010101101100,
    36: 0b11000100001011111011111010110000011,
    35: 0b1101010001001011011110111010001111,
    34: 0b10110101100110100110111011100010,
    33: 0b1010110100100110101011100100111,
    32: 0b1000111100111010101100111010001,
    31: 0b10101100000001100010111000,
    30: 0b10011010110011001010011011,
    29: 0b1000000111011010101011100001,
    28: 0b10011011101001001100010111,
    27: 0b1010100111100011110001010,
    26: 0b101111111100110110010001,
    25: 0b1011010000100011010,
    24: 0b1000111101010111111011,
    23: 0b1010101001000110101101,
    22: 0b100100001101111110000,
    21: 0b1000101101011001011,
    20: 0b101101001110101010,
    19: 0b101000101101100000,
    18: 0b1111011111110010,
    17: 0b1000100110110000,
    16: 0b11011011001001,
    15: 0b1011100001100,
    14: 0b1011011001111,
    13: 0b101110011111,
    12: 0b10110000100,
    11: 0b1101111100,
    10: 0b111111101,
    9: 0b101100,
    8: 0b11111,
    7: 0b110011,
    6: 0b1110,
    5: 0b1010,
    4: 0b111,
    3: 0b0,
    2: 0b0,
    1: 0b0
}

def generate_private_keys():
    print("Puzzle | Private Key")
    print("-------------------")
    for puzzle in range(1, 68):
        if puzzle in xor_masks:
            puzzle_end = 2**puzzle - 1
            private_key = puzzle_end ^ xor_masks[puzzle]
            print(f"{puzzle:6} | {private_key}")
        else:
            print(f"{puzzle:6} | (Missing XOR mask)")

generate_private_keys()

Is it clearer now? If not, then nothing.  

Is this some kind of voodoo magic? I just got all the private keys out of nowhere.  


You calculate a private key from the end of a puzzle's range ? How ? 

[pbies]

I DO IT FOR FUN!!!111

Code:

#!/usr/bin/env python3

from multiprocessing import Pool
import datetime
import ecdsa
import hashlib
import os
import random
import sys
import time
import secp256k1 as ice

def log(t):
	d = datetime.datetime.now().strftime("%Y-%m-%d %H:%M:%S")
	print(f'{d} {t}', flush=True, end='')
	l=open('log.txt','a')
	l.write(f'{d} {str(t)}')
	l.flush()
	l.close()

def go(pvk):
	h=ice.privatekey_to_h160(0, True, pvk) # type = 0 [p2pkh],  1 [p2sh],  2 [bech32] ; compressed?
	if h==target_hash:
		print()
		log(f'Found pvk: {hex(pvk)[2:]}  |  WIF: {ice.btc_pvk_to_wif(pvk, False)}\a\n')
		print('\a', end='', file=sys.stderr)

range_start = 0x80000000000000000
range_end   = 0xfffffffffffffffff
r           = 262144
target_hash = bytes.fromhex('e0b8a2baee1b77fc703455f39d51477451fc8cfc')
th = 24
cnt=10000
# seed=0

def main():
	try:
		os.system('cls||clear')
		print("Puzzle 68 random scanner")
		print("Scanning random addresses in an infinite loop. Press Ctrl+C to stop.\n")

		keys_checked = 0
		start_time = time.time()
		# random.seed(seed)

		while True:
			rnd = random.randint(range_start, range_end+1)

			rng = range(rnd, rnd+r)

			with Pool(processes=th) as p:
				for result in p.imap(go, rng):
					keys_checked += 1
					if keys_checked % cnt == 0:
						elapsed = time.time() - start_time
						rate = keys_checked / elapsed
						print(f"\rKeys checked: {keys_checked:,} | Rate: {rate:.2f} keys/sec | Range: {hex(rnd)[2:]}-{hex(rnd+r)[2:]}", end="", flush=True)

	except KeyboardInterrupt:
		print("\n\nScanning stopped by user.")
		print(f"Total keys checked: {keys_checked:,}")

if __name__ == "__main__":
	main()

~43200 keys/sec @ 24 threads with 9950X