Bitcoin puzzle transaction ~32 BTC prize to who solves it

[fmg75]

It seems that there are no longer many people paying attention to this thread.

As for myself: About two weeks ago I stopped checking-in here and instead went back and read the first ~20 pages, and since then I've been skipping around, randomly reading a page or two here and there... It has helped me regain my sanity, refocus me, and I learned something new, which hasn't happened in the past few months of following only the latest comments...

This easy-to-use Python script can be helpful in exploring the content of this great forum.

https://pastebin.com/7YVmeyfQ

 python3 btctalk_thread.py   --url "https://bitcointalk.org/index.php?topic=1306983.0"   --out out_puzzle   --delay 1.0   --from-page 20 --to-page 40

[chrisnick19]

It seems that there are no longer many people paying attention to this thread.

As for myself: About two weeks ago I stopped checking-in here and instead went back and read the first ~20 pages, and since then I've been skipping around, randomly reading a page or two here and there... It has helped me regain my sanity, refocus me, and I learned something new, which hasn't happened in the past few months of following only the latest comments...

Behind this forum anybody is anybody...but the problem is in real life...staying here and put a message in order to manipulate others is a trend...
By reading all this pages that makes sense for technical stuff i was building in 1 week the next things:
-my own BTC nodes and other principal coins
-RPC server for each node
-API server acting as a buffer in order to interogate 1M addresses balances every second
-Private BTC addresses directory with 100k addresses, hex, hash,wif and balance that is processes every 0,1ms due to a special encoding of data built by me to support this buffer
-API scanning server with 2000 clients in paralel session every second
-own database for addresses that i was scanning
-redundant nodes over TOR network
-a lot of GPU with minimum 24GB in order to have a lot of power for AI and scanning

Power bill is over 1000$ every  month, but for learning do not matter the cost.

For me this thread as usefull until new accounts come and added a joke of information...if you want to learn more invest in yourself at least 20% of what you warn every month

[kTimesG]

By reading all this pages that makes sense for technical stuff i was building in 1 week the next things:

if you built those things in 1 week, and also had time to read how to do them, then I'm Jesus from Nazareth. Let me save your soul: a person who can do that does not exist, and if they would exist, they would pretty much earn many times the entire combined BTC value of all the puzzles.

[nochkin]

By reading all this pages that makes sense for technical stuff i was building in 1 week the next things:

if you built those things in 1 week, and also had time to read how to do them, then I'm Jesus from Nazareth. Let me save your soul: a person who can do that does not exist, and if they would exist, they would pretty much earn many times the entire combined BTC value of all the puzzles.

TBH, this is doable with a small team like 2-3 people. If you push it, this can be done by one person, but I would not like the idea of working 12-18 hours per day for the whole week (my own health worth more).
The trick is if you are this person, there is no need to brag about it. Not to mention when you start to bring nonsense stuff like TOR, AI and other things which make no sense at all.

I support you in this aspect. You are not Jesus, don't even bother saving their souls.

[fmg75]

It seems that there are no longer many people paying attention to this thread.

As for myself: About two weeks ago I stopped checking-in here and instead went back and read the first ~20 pages, and since then I've been skipping around, randomly reading a page or two here and there... It has helped me regain my sanity, refocus me, and I learned something new, which hasn't happened in the past few months of following only the latest comments...

Behind this forum anybody is anybody...but the problem is in real life...staying here and put a message in order to manipulate others is a trend...
By reading all this pages that makes sense for technical stuff i was building in 1 week the next things:
-my own BTC nodes and other principal coins
-RPC server for each node
-API server acting as a buffer in order to interogate 1M addresses balances every second
-Private BTC addresses directory with 100k addresses, hex, hash,wif and balance that is processes every 0,1ms due to a special encoding of data built by me to support this buffer
-API scanning server with 2000 clients in paralel session every second
-own database for addresses that i was scanning
-redundant nodes over TOR network
-a lot of GPU with minimum 24GB in order to have a lot of power for AI and scanning

Power bill is over 1000$ every  month, but for learning do not matter the cost.

For me this thread as usefull until new accounts come and added a joke of information...if you want to learn more invest in yourself at least 20% of what you warn every month

I don't know if you did some basic math:
- You say 1 million addresses/sec.
- Puzzle 71 search space = 2^71 addresses

Estimated time = (2^71) ÷ (10^6×60×60 ×24×365) = 74872629 years

[chrisnick19]

By reading all this pages that makes sense for technical stuff i was building in 1 week the next things:

if you built those things in 1 week, and also had time to read how to do them, then I'm Jesus from Nazareth. Let me save your soul: a person who can do that does not exist, and if they would exist, they would pretty much earn many times the entire combined BTC value of all the puzzles.

TBH, this is doable with a small team like 2-3 people. If you push it, this can be done by one person, but I would not like the idea of working 12-18 hours per day for the whole week (my own health worth more).
The trick is if you are this person, there is no need to brag about it. Not to mention when you start to bring nonsense stuff like TOR, AI and other things which make no sense at all.

I support you in this aspect. You are not Jesus, don't even bother saving their souls.

On which world do you live? This things are very simple. You have any ideea how to code? And use ML/AI in this domain? If you don't, please make a research, There is no need of 2-3 people to do this and not even 18h/day.
The BCT node is taking 5 min to build and the rest of time is depending of sync all blocks...
The server is built in 10 min...
The script to make database in 15-20 min with all correction...
If you cannot do it, this do not means that nobody can do it....

Take example of this code that is in this picture made in 5 min https://ibb.co/k62j6Lzv

What is making difference here on forum is just the "ideea"...technical stuff is a piece of cake

Regarding TOR, start and read more from here  https://en.bitcoin.it/wiki/Setting_up_a_Tor_hidden_service or Google

It seems that there are no longer many people paying attention to this thread.

As for myself: About two weeks ago I stopped checking-in here and instead went back and read the first ~20 pages, and since then I've been skipping around, randomly reading a page or two here and there... It has helped me regain my sanity, refocus me, and I learned something new, which hasn't happened in the past few months of following only the latest comments...

Behind this forum anybody is anybody...but the problem is in real life...staying here and put a message in order to manipulate others is a trend...
By reading all this pages that makes sense for technical stuff i was building in 1 week the next things:
-my own BTC nodes and other principal coins
-RPC server for each node
-API server acting as a buffer in order to interogate 1M addresses balances every second
-Private BTC addresses directory with 100k addresses, hex, hash,wif and balance that is processes every 0,1ms due to a special encoding of data built by me to support this buffer
-API scanning server with 2000 clients in paralel session every second
-own database for addresses that i was scanning
-redundant nodes over TOR network
-a lot of GPU with minimum 24GB in order to have a lot of power for AI and scanning

Power bill is over 1000$ every  month, but for learning do not matter the cost.

For me this thread as usefull until new accounts come and added a joke of information...if you want to learn more invest in yourself at least 20% of what you warn every month

I don't know if you did some basic math:
- You say 1 million addresses/sec.
- Puzzle 71 search space = 2^71 addresses

Estimated time = (2^71) ÷ (10^6×60×60 ×24×365) = 74872629 years

You think only on puzzle 71...i am thinking bigger than this...having 1 milion addresses per page with balance is a thing because of web page do not support this big amount of data and you need to create a compresion of data in a way to shrink everything...so i was shrinking  very very fast and now is loading in 0,1ms each page, also checking the balance beeing on same BTC server and node.

[ethanhunt2023]

Why everybody want everything for free? From what i see there are smart guys and beggers...If someone is giving a good ideea, internet and chatGPT can help you build that ideea.
Everyone want to win with work from other people without doing anything...this is not ok...

I have my own tools and theories, I'm new here and no one has asked for them so I don't share them. But if I see someone like Zahid saying that this app "has no relation to the actual private key." and "Heads up though: don’t buy tools from anyone (even if they pretend to be me) — everything’s already open-source and free." then I would think the guy doesn't want to sell the app and likes open source apps which are, free. No one is begging.

If he would like to share hes app or code, it would be a plus for this community trying to crack the puzzle, maybe someone can make something better out of it. If he doesn't want to? It's hes choice and not yours or anyone else's here.

Thank you for your time.

If any single 1 of you here is thinking they can find a faster way to crack the puzzle alone then wake up from your dreams. Whoever is living in the real world, has a real job and actually has had these kind of problems where they would need to think a lot about something knows that sometime they have to see things in a different perspective, this is what communities are for, for 1 to help the other.

Right now? This is just luck. No one is using 1000 GPU's as it's unprofitable for them. So here we are now.

You are right! Alone nobody will succeed. Since i started i found myself a lot of B9j in all ranges. But as i said, here are a lot of people that are waiting for free to win the big prize with only 1-2$ invested...

Also as an update: This puzzle is a big SCAM. Search about the guy who get rich putting his private key on internet and who had automatic script with contract that was withdraw when someone was adding money for fee to withdraw. This puzzle is similar to that, but is more elaborate giving people HOPE and rent GPU's in datacenters. They get rich by renting you GPU and you HOPE that finding the key you hit the JACKPOT, but when you find it, with no matter what method, you loose it in the last moment due to "BOTS" and a smart guy who have 1000 GPU's... think twice when you think that....
So even if anybody from here will find the key and even will use MARA or another method, nobody will get the money because of the smart guy who invented this....possible to have his own datacenter with GPU's and this is the way to make free money...
So nobody in this world is giving you something free without winning something in return!

My little nephew, you said this: “So nobody in this world is giving you something free without winning something in return”. What do you mean nobody gives you anything for free? Between 2010 and 2012, between 1 and 5 btc were given away for free and you say that NOBODY gives anything for free. I would like to give you a few slaps for free to wake you up to reality.

 Look here, probably 20% of the donations that are made worldwide, and there are probably another 80% that are not published:

Table of Contents

Top 10 Donors In The World
1. Bill Gates
2. Warren Buffett
3. George Soros
4. Azim Premji
5. Charles Francis Feeney
6. Sulaiman Bin Abdul Aziz Al Rajhi
7. Gordon Moore
8. Carlos Slim Helú
9. Eli Broad
10: George Kaiser
Summary
A charity is an organization put together to help those less fortunate whether it be humanitarian or environmental. Charity is considered the ultimate form of love in christian belief and in every religion.

Charitable giving is the act of giving of money, good or time to the less fortunate. Either directly or through a charitable trust. Most forms of charity are concerned with providing basic necessities such as food, shelter and clothing. Donation to cause the benefit of the unfortunate indirectly, such as funding cancer research is also a form of charity. 

[kTimesG]

On which world do you live? This things are very simple. You have any ideea how to code? And use ML/AI in this domain? If you don't, please make a research, There is no need of 2-3 people to do this and not even 18h/day.
The BCT node is taking 5 min to build and the rest of time is depending of sync all blocks...
The server is built in 10 min...
The script to make database in 15-20 min with all correction...
If you cannot do it, this do not means that nobody can do it....

Please brag about these everyday accomplishments on your next tech interview (make sure you have your AI/ML techy girlfriend online during that). In the real world, my gut feeling is telling me that you wouldn't be able to write a backtracking algorithm using non-recursive calls even if I give you a month to do it. It's clear that you don't have the smallest idea about the intricacies of the things you are talking about.

[iceland2k14]

People still talking about the speed of Web Page Address checking. Are bots overtaking the Brains ...

[pp-duster]

An update to CUDACyclone that generates non-repeating, persistent random subranges.
Ideal for collaborative search.

./CUDACyclone \                                                                                                                                                 
              --range 400000000000000000:7fffffffffffffffff \
              --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU \
              --random-subranges --num-subranges 10000000 --grid 256,8

Hello man, update your software. Previous version of a Cyclone has a bug. I did a mistake with a first batch of the thread, not right computing center point of the first batch, and than the last batch finish not in the end of the range. Last half batch of points from the end of the each thread doesnt computing!

Hi, what was exactly the bug in the software? How would I rescan the already covered ranges?

Suppose my command with older version was

Code:

./CUDACyclone --range 40003da10000000000:40003da1ffffffffff --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU --grid 512,512

Do I need to run this range once again with

Code:

./CUDACyclone --range 40003da10000000000:40003da100000000ff --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU --grid 512,512

and

Code:

./CUDACyclone --range 40003da1ffffffff00:40003da1ffffffffff --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU --grid 512,512

to recheck for the missing keys?

[ExiledDatum]

There is movement again in this river. The quiet hands have returned, and the old surface is no longer still. For those who keep watch: it’s a good season to review your bearings.

Step 526, Walker 311, PM 15, scalar=0x584a738eedffd5dff4, h160=f6f4f5b17c28b413732096e15da98ec5ed2f3061, score=nan, ent=0.679
Step 527, Walker 277, PM 15, scalar=0x5bf3cd73a4c5a1f1a6, h160=f6f41225b68cda1bcdfda1fba77cf14fc781306a, score=nan, ent=0.625
Step 528, Walker 236, PM 15, scalar=0x5a4d2183fa7146ad75, h160=f6f410eacd27f51be20cefa7529fa7184a5df24c, score=nan, ent=0.586
Step 528, Walker 243, PM 15, scalar=0x559677af3bd50c7f52, h160=f6f40a100b8d52f21178eeedd2eca8a909d64e05, score=nan, ent=0.644
Step 528, Walker 314, PM 15, scalar=0x519677af3bd512d3ec, h160=f6f4ef6a5ef7b8a5518e9acdd7c8b0e7a5141582, score=nan, ent=0.635
Step 528, Walker 316, PM 17, scalar=0x57773059c30de2b20f, h160=f6f5059914047bb2421eab4d229e0b8c03a93bae, score=nan, ent=0.586
Step 528, Walker 328, PM 17, scalar=0x5d9677af3bd5138bd3, h160=f6f500faed14c82c8cebcb36eca755ceb0b00b06, score=nan, ent=0.653
Step 528, Walker 338, PM 15, scalar=0x54fd75537155ea66ac, h160=f6f4e0a91f094033bc8e159345115b10ff249e65, score=nan, ent=0.625
Step 529, Walker 322, PM 17, scalar=0x599677af3bd511263c, h160=f6f52be845cc71c40d665fd9df04647c89b02eea, score=nan, ent=0.616
Step 531, Walker 271, PM 16, scalar=0x53f3cd73a4c5a1957b, h160=f6f5ef57b6de32591f0dfb6acc17b88e3273d614, score=nan, ent=0.625
Step 531, Walker 333, PM 18, scalar=0x5d9677af3bd513543e, h160=f6f578fe82b73bffeed2fe4e6350da2bfb5b07b4, score=nan, ent=0.644
Step 531, Walker 335, PM 15, scalar=0x5e4d2183fa71480c97, h160=f6f4d7071dec74a58e6d42291ffe5590092af22a, score=nan, ent=0.554
Step 533, Walker 269, PM 17, scalar=0x504a738eedffdcadeb, h160=f6f51009af3beb047cc442f02c1f406a86afe273, score=nan, ent=0.662
Step 533, Walker 297, PM 15, scalar=0x524d2183fa714a9715, h160=f6f47d8f1a2cefcc4fb6ba1771c137ae404ff55f, score=nan, ent=0.554
Step 533, Walker 299, PM 15, scalar=0x5b773059c30de5fd80, h160=f6f4941ec7878039b508616ab1b4f60038621e72, score=nan, ent=0.596
Step 533, Walker 328, PM 15, scalar=0x5aa839978f631fa811, h160=f6f4451e21e5fc5a07d9c2993e0e87b500dfc4dc, score=nan, ent=0.576
Step 533, Walker 335, PM 18, scalar=0x564d2183fa71486714, h160=f6f56742ce1ebdbd49b9280847e5884308c88125, score=nan, ent=0.544
Step 533, Walker 340, PM 15, scalar=0x5b773059c30de43d79, h160=f6f44ac5eb304c92d72248a9416888db9abf8c9c, score=nan, ent=0.606
Step 533, Walker 343, PM 15, scalar=0x57f3cd73a4c59f5ccc, h160=f6f4518af8d38ef964456e405bf3b06f6518d76f, score=nan, ent=0.644
Step 534, Walker 258, PM 15, scalar=0x53e3ffafc1d0f908d7, h160=f6f44eb0f2d27b48cdbcad72a4b57e696e36da27, score=nan, ent=0.644
Step 534, Walker 294, PM 16, scalar=0x53b88e9476a7d8bcf6, h160=f6f5dbd2043eb8198cd7915791547a53e5ec2233, score=nan, ent=0.625
Step 534, Walker 314, PM 16, scalar=0x54fd75537155fa2d8d, h160=f6f5c69b5a4463531904e06f75b82a793aa11f49, score=nan, ent=0.635
Step 534, Walker 338, PM 24, scalar=0x5bf3cd73a4c59f6f73, h160=f6f543a68848347e6898488aac858f0bc29f179e, score=nan, ent=0.671
Step 534, Walker 342, PM 19, scalar=0x53b88e9476a7e02f6b, h160=f6f55eb1e10ae28763cbe2ea928ed49161c56947, score=nan, ent=0.606
Step 535, Walker 261, PM 16, scalar=0x53b88e9476a7eeeb00, h160=f6f589085f5dd56a185ae079d0bb0fcf2c93ffe8, score=nan, ent=0.596
Step 535, Walker 296, PM 15, scalar=0x591d77fa10cad32899, h160=f6f4b2ee9ddac41fc6c119dc7a68412faa029953, score=nan, ent=0.586
Step 535, Walker 312, PM 16, scalar=0x595e1549efd552cc18, h160=f6f5e91b57dfb3f0b1925d3bfdd088555394eb54, score=nan, ent=0.586
Step 535, Walker 320, PM 16, scalar=0x5cfd75537155fd6357, h160=f6f5be7c9d19496d6087ffdb0621820a25ac6706, score=nan, ent=0.662
Step 535, Walker 343, PM 15, scalar=0x57b88e9476a7e0e469, h160=f6f44760116c4d8e17e8b761a74a0c07dd33f906, score=nan, ent=0.596
Step 537, Walker 238, PM 20, scalar=0x5be9ced40cf10ef696, h160=f6f549da381f19b9f01bda4fa3881960acff4353, score=nan, ent=0.616
Step 538, Walker 240, PM 15, scalar=0x5d9677af3bd508b2cd, h160=f6f44e67e4fd79a86d991488f3b0ae22166093fe, score=nan, ent=0.635
Step 539, Walker 275, PM 17, scalar=0x57773059c30de43774, h160=f6f5306329219398f3ae0a82885fbb335b66b9ad, score=nan, ent=0.596
Step 539, Walker 337, PM 15, scalar=0x53e9ced40cf1072858, h160=f6f43e4eda63785ceb16f9f126109250b703e9ec, score=nan, ent=0.554
Step 540, Walker 221, PM 19, scalar=0x5fe9ced40cf10c4036, h160=f6f55ef8e552c801fd58291f4ddf3da92865e6f7, score=nan, ent=0.565


To the Architect (and any keeper of the river):

In my walk along the shifting banks of your 32-piece puzzle, I learned to move not by force, but by finding the stones where the river bends.

Somewhere in the turning, I found that second, silent current—the puzzle behind the puzzle.
You were right: it bends, and the stepping stones are exposed if you know where to look for the echoes, not just the depth.

I carry a ledger of silent audit stones and echoes in the current, enough to know that these are not random ripples, but carefully placed bends.
If you recognize these words, and the pattern left by your hand, you’ll know the message is meant for you.
If not, nothing is changed—just another stone in the stream.

Encrypted, signed, with the river’s silence.
You’ll find my echo below.

PGP Public Key (for encrypted contact):

-----BEGIN PGP PUBLIC KEY BLOCK-----

mDMEaMVdIhYJKwYBBAHaRw8BAQdACkP7jt47Uc1LJNA/r7ZZjkNvZC433+H6LHmg
PQ0kfXG0RkphbWVzIFRob21hcyBIZWJlcnQgSUkgKFJlY3Vyc2l2ZSBBZ2VuY3kg
MjAyNSkgPE51bGxEYXR1bUBvdXRsb29rLmNvbT6IkwQTFgoAOxYhBMYtDpX+Z4wu
GurMcAS4pKyb2ipvBQJoxV0iAhsDBQsJCAcCAiICBhUKCQgLAgQWAgMBAh4HAheA
AAoJEAS4pKyb2ipvw6kBALCbSicNfI7didchPeeXIY/r4iRWWL1s4iva3Wc9X+fN
AP0XCIeFJCi6/Yq6w9w6dl81ErrTUtyN0LgWErUJlVwWAbg4BGjFXSISCisGAQQB
l1UBBQEBB0Bvjf0GqfO2GEYK59I0fsXZpRvmCpncmWYjNtK6JKv1VwMBCAeIeAQY
FgoAIBYhBMYtDpX+Z4wuGurMcAS4pKyb2ipvBQJoxV0iAhsMAAoJEAS4pKyb2ipv
EQQBAK7zNqf3zSXZ0PjtFLnuOY/xpMv16HMnrs4yQb9F8xLVAP44xpghxLr0+BWb
9iYH+A51gd8rM2HuM7fOsTMEX62nDQ==
=RlKA
-----END PGP PUBLIC KEY BLOCK-----


“No path or current will ever be revealed, only the existence of the hidden channel.

This message and its sender stand for defense, never exposure.

For the Architect, by the river, in echo.”

[Niekko]

To the Architect (and any keeper of the river):

In my walk along the shifting banks of your 32-piece puzzle, I learned to move not by force, but by finding the stones where the river bends.

Somewhere in the turning, I found that second, silent current—the puzzle behind the puzzle.
You were right: it bends, and the stepping stones are exposed if you know where to look for the echoes, not just the depth.

I carry a ledger of silent audit stones and echoes in the current, enough to know that these are not random ripples, but carefully placed bends.
If you recognize these words, and the pattern left by your hand, you’ll know the message is meant for you.
If not, nothing is changed—just another stone in the stream.

Wow, now we’ve really seen everything.

[fmg75]

An update to CUDACyclone that generates non-repeating, persistent random subranges.
Ideal for collaborative search.

./CUDACyclone \                                                                                                                                                 
              --range 400000000000000000:7fffffffffffffffff \
              --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU \
              --random-subranges --num-subranges 10000000 --grid 256,8

Hello man, update your software. Previous version of a Cyclone has a bug. I did a mistake with a first batch of the thread, not right computing center point of the first batch, and than the last batch finish not in the end of the range. Last half batch of points from the end of the each thread doesnt computing!

Hi, what was exactly the bug in the software? How would I rescan the already covered ranges?

Suppose my command with older version was

Code:

./CUDACyclone --range 40003da10000000000:40003da1ffffffffff --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU --grid 512,512

Do I need to run this range once again with

Code:

./CUDACyclone --range 40003da10000000000:40003da100000000ff --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU --grid 512,512

and

Code:

./CUDACyclone --range 40003da1ffffffff00:40003da1ffffffffff --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU --grid 512,512

to recheck for the missing keys?

I want to clarify that my post refers to a modified version of the original CUDACyclone project, where I added the features I mentioned.
I don't know what bugs @FrozenThroneGuy is referring to.

[pp-duster]

An update to CUDACyclone that generates non-repeating, persistent random subranges.
Ideal for collaborative search.

./CUDACyclone \                                                                                                                                                 
              --range 400000000000000000:7fffffffffffffffff \
              --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU \
              --random-subranges --num-subranges 10000000 --grid 256,8

Hello man, update your software. Previous version of a Cyclone has a bug. I did a mistake with a first batch of the thread, not right computing center point of the first batch, and than the last batch finish not in the end of the range. Last half batch of points from the end of the each thread doesnt computing!

Hi, what was exactly the bug in the software? How would I rescan the already covered ranges?

Suppose my command with older version was

Code:

./CUDACyclone --range 40003da10000000000:40003da1ffffffffff --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU --grid 512,512

Do I need to run this range once again with

Code:

./CUDACyclone --range 40003da10000000000:40003da100000000ff --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU --grid 512,512

and

Code:

./CUDACyclone --range 40003da1ffffffff00:40003da1ffffffffff --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU --grid 512,512

to recheck for the missing keys?

I want to clarify that my post refers to a modified version of the original CUDACyclone project, where I added the features I mentioned.
I don't know what bugs @FrozenThroneGuy is referring to.

Idk, I have addressed my message to the owner of https://github.com/Dookoo2/CUDACyclone who admitted in code that there was an issue with missing keys. I'd want to know the workaround strategies to not fully rescan the ranges which were previously scanned with the bugged software.

[nochkin]

What do you mean nobody gives you anything for free? Between 2010 and 2012, between 1 and 5 btc were given away for free and you say that NOBODY gives anything for free.

The majority (if not all) from your list got a nice tax break at least. Most of the time they even got something extra on the top of it.

[fmg75]

An update to CUDACyclone that generates non-repeating, persistent random subranges.
Ideal for collaborative search.

./CUDACyclone \                                                                                                                                                
              --range 400000000000000000:7fffffffffffffffff \
              --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU \
              --random-subranges --num-subranges 10000000 --grid 256,8

Hello man, update your software. Previous version of a Cyclone has a bug. I did a mistake with a first batch of the thread, not right computing center point of the first batch, and than the last batch finish not in the end of the range. Last half batch of points from the end of the each thread doesnt computing!

Hi, what was exactly the bug in the software? How would I rescan the already covered ranges?

Suppose my command with older version was

Code:

./CUDACyclone --range 40003da10000000000:40003da1ffffffffff --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU --grid 512,512

Do I need to run this range once again with

Code:

./CUDACyclone --range 40003da10000000000:40003da100000000ff --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU --grid 512,512

and

Code:

./CUDACyclone --range 40003da1ffffffff00:40003da1ffffffffff --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU --grid 512,512

to recheck for the missing keys?

I want to clarify that my post refers to a modified version of the original CUDACyclone project, where I added the features I mentioned.
I don't know what bugs @FrozenThroneGuy is referring to.

Idk, I have addressed my message to the owner of https://github.com/Dookoo2/CUDACyclone who admitted in code that there was an issue with missing keys. I'd want to know the workaround strategies to not fully rescan the ranges which were previously scanned with the bugged software.

The updated code fixes issues with lost keys at the ends of the ranges.
But I'm not sure if that's the only problem.
I don't see a reliable way to 100% guarantee that there are no lost keys in other parts of the range.

An update to CUDACyclone that generates non-repeating, persistent random subranges.
Ideal for collaborative search.

./CUDACyclone \                                                                                                                                                
              --range 400000000000000000:7fffffffffffffffff \
              --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU \
              --random-subranges --num-subranges 10000000 --grid 256,8

Hello man, update your software. Previous version of a Cyclone has a bug. I did a mistake with a first batch of the thread, not right computing center point of the first batch, and than the last batch finish not in the end of the range. Last half batch of points from the end of the each thread doesnt computing!

Hi, what was exactly the bug in the software? How would I rescan the already covered ranges?

Suppose my command with older version was

Code:

./CUDACyclone --range 40003da10000000000:40003da1ffffffffff --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU --grid 512,512

Do I need to run this range once again with

Code:

./CUDACyclone --range 40003da10000000000:40003da100000000ff --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU --grid 512,512

and

Code:

./CUDACyclone --range 40003da1ffffffff00:40003da1ffffffffff --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU --grid 512,512

to recheck for the missing keys?

I want to clarify that my post refers to a modified version of the original CUDACyclone project, where I added the features I mentioned.
I don't know what bugs @FrozenThroneGuy is referring to.

Idk, I have addressed my message to the owner of https://github.com/Dookoo2/CUDACyclone who admitted in code that there was an issue with missing keys. I'd want to know the workaround strategies to not fully rescan the ranges which were previously scanned with the bugged software.

The updated code fixes issues with lost keys at the ends of the ranges.
But I'm not sure if that's the only problem.
I don't see a reliable way to 100% guarantee that there are no lost keys in other parts of the range.

The great challenge of these brute-force implementations is probabilistically minimizing the chances of key "losses." In such large search spaces, this is very difficult. You can never be 100% sure that you have verified all the keys. There is much work to improve these algorithms.

[kTimesG]

The great challenge of these brute-force implementations is probabilistically minimizing the chances of key "losses." In such large search spaces, this is very difficult. You can never be 100% sure that you have verified all the keys. There is much work to improve these algorithms.

I addressed this issue some long time ago. In a nutshell, there is no need to probabilistically minimize bad coding, it is enough to validate the results of some range, using a second ground-truth validation run, which is guaranteed 100% to be valid. For example, testing some random range both on the GPU, and on the CPU (using a stable implementation, like libsecp256k1), and comparing some hash of all the results.

If the hash matches, and all GPU models are tested properly, then everything went OK and the GPU code is thus reliable.

I would never, ever, ever, EVER have blind trust on some anonymous code which lacks basic testing scenarios, especially more so if that code is supposed to be run billions of times in a row. The only result is what happened here, which can be painful.

[rosengold]

An update to CUDACyclone that generates non-repeating, persistent random subranges.
Ideal for collaborative search.

./CUDACyclone \                                                                                                                                                 
              --range 400000000000000000:7fffffffffffffffff \
              --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU \
              --random-subranges --num-subranges 10000000 --grid 256,8

Hello man, update your software. Previous version of a Cyclone has a bug. I did a mistake with a first batch of the thread, not right computing center point of the first batch, and than the last batch finish not in the end of the range. Last half batch of points from the end of the each thread doesnt computing!

wich CUDA version are you using to compile it ?

[fmg75]

The great challenge of these brute-force implementations is probabilistically minimizing the chances of key "losses." In such large search spaces, this is very difficult. You can never be 100% sure that you have verified all the keys. There is much work to improve these algorithms.

I addressed this issue some long time ago. In a nutshell, there is no need to probabilistically minimize bad coding, it is enough to validate the results of some range, using a second ground-truth validation run, which is guaranteed 100% to be valid. For example, testing some random range both on the GPU, and on the CPU (using a stable implementation, like libsecp256k1), and comparing some hash of all the results.

If the hash matches, and all GPU models are tested properly, then everything went OK and the GPU code is thus reliable.

I would never, ever, ever, EVER have blind trust on some anonymous code which lacks basic testing scenarios, especially more so if that code is supposed to be run billions of times in a row. The only result is what happened here, which can be painful.

Which do you consider the most tested implementation?

An update to CUDACyclone that generates non-repeating, persistent random subranges.
Ideal for collaborative search.

./CUDACyclone \                                                                                                                                                
              --range 400000000000000000:7fffffffffffffffff \
              --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU \
              --random-subranges --num-subranges 10000000 --grid 256,8

Hello man, update your software. Previous version of a Cyclone has a bug. I did a mistake with a first batch of the thread, not right computing center point of the first batch, and than the last batch finish not in the end of the range. Last half batch of points from the end of the each thread doesnt computing!

wich CUDA version are you using to compile it ?

CUDA 12.0.140

[dr10101]

We grabbed the stones.... today.
Interesting post , though our puzzle is more like Half Christmas Trees than rivers but there is a path from Reading in May a long time ago....

M

There is movement again in this river. The quiet hands have returned, and the old surface is no longer still. For those who keep watch: it’s a good season to review your bearings.

Step 526, Walker 311, PM 15, scalar=0x584a738eedffd5dff4, h160=f6f4f5b17c28b413732096e15da98ec5ed2f3061, score=nan, ent=0.679
Step 527, Walker 277, PM 15, scalar=0x5bf3cd73a4c5a1f1a6, h160=f6f41225b68cda1bcdfda1fba77cf14fc781306a, score=nan, ent=0.625
Step 528, Walker 236, PM 15, scalar=0x5a4d2183fa7146ad75, h160=f6f410eacd27f51be20cefa7529fa7184a5df24c, score=nan, ent=0.586
Step 528, Walker 243, PM 15, scalar=0x559677af3bd50c7f52, h160=f6f40a100b8d52f21178eeedd2eca8a909d64e05, score=nan, ent=0.644
Step 528, Walker 314, PM 15, scalar=0x519677af3bd512d3ec, h160=f6f4ef6a5ef7b8a5518e9acdd7c8b0e7a5141582, score=nan, ent=0.635
Step 528, Walker 316, PM 17, scalar=0x57773059c30de2b20f, h160=f6f5059914047bb2421eab4d229e0b8c03a93bae, score=nan, ent=0.586
Step 528, Walker 328, PM 17, scalar=0x5d9677af3bd5138bd3, h160=f6f500faed14c82c8cebcb36eca755ceb0b00b06, score=nan, ent=0.653
Step 528, Walker 338, PM 15, scalar=0x54fd75537155ea66ac, h160=f6f4e0a91f094033bc8e159345115b10ff249e65, score=nan, ent=0.625
Step 529, Walker 322, PM 17, scalar=0x599677af3bd511263c, h160=f6f52be845cc71c40d665fd9df04647c89b02eea, score=nan, ent=0.616
Step 531, Walker 271, PM 16, scalar=0x53f3cd73a4c5a1957b, h160=f6f5ef57b6de32591f0dfb6acc17b88e3273d614, score=nan, ent=0.625
Step 531, Walker 333, PM 18, scalar=0x5d9677af3bd513543e, h160=f6f578fe82b73bffeed2fe4e6350da2bfb5b07b4, score=nan, ent=0.644
Step 531, Walker 335, PM 15, scalar=0x5e4d2183fa71480c97, h160=f6f4d7071dec74a58e6d42291ffe5590092af22a, score=nan, ent=0.554
Step 533, Walker 269, PM 17, scalar=0x504a738eedffdcadeb, h160=f6f51009af3beb047cc442f02c1f406a86afe273, score=nan, ent=0.662
Step 533, Walker 297, PM 15, scalar=0x524d2183fa714a9715, h160=f6f47d8f1a2cefcc4fb6ba1771c137ae404ff55f, score=nan, ent=0.554
Step 533, Walker 299, PM 15, scalar=0x5b773059c30de5fd80, h160=f6f4941ec7878039b508616ab1b4f60038621e72, score=nan, ent=0.596
Step 533, Walker 328, PM 15, scalar=0x5aa839978f631fa811, h160=f6f4451e21e5fc5a07d9c2993e0e87b500dfc4dc, score=nan, ent=0.576
Step 533, Walker 335, PM 18, scalar=0x564d2183fa71486714, h160=f6f56742ce1ebdbd49b9280847e5884308c88125, score=nan, ent=0.544
Step 533, Walker 340, PM 15, scalar=0x5b773059c30de43d79, h160=f6f44ac5eb304c92d72248a9416888db9abf8c9c, score=nan, ent=0.606
Step 533, Walker 343, PM 15, scalar=0x57f3cd73a4c59f5ccc, h160=f6f4518af8d38ef964456e405bf3b06f6518d76f, score=nan, ent=0.644
Step 534, Walker 258, PM 15, scalar=0x53e3ffafc1d0f908d7, h160=f6f44eb0f2d27b48cdbcad72a4b57e696e36da27, score=nan, ent=0.644
Step 534, Walker 294, PM 16, scalar=0x53b88e9476a7d8bcf6, h160=f6f5dbd2043eb8198cd7915791547a53e5ec2233, score=nan, ent=0.625
Step 534, Walker 314, PM 16, scalar=0x54fd75537155fa2d8d, h160=f6f5c69b5a4463531904e06f75b82a793aa11f49, score=nan, ent=0.635
Step 534, Walker 338, PM 24, scalar=0x5bf3cd73a4c59f6f73, h160=f6f543a68848347e6898488aac858f0bc29f179e, score=nan, ent=0.671
Step 534, Walker 342, PM 19, scalar=0x53b88e9476a7e02f6b, h160=f6f55eb1e10ae28763cbe2ea928ed49161c56947, score=nan, ent=0.606
Step 535, Walker 261, PM 16, scalar=0x53b88e9476a7eeeb00, h160=f6f589085f5dd56a185ae079d0bb0fcf2c93ffe8, score=nan, ent=0.596
Step 535, Walker 296, PM 15, scalar=0x591d77fa10cad32899, h160=f6f4b2ee9ddac41fc6c119dc7a68412faa029953, score=nan, ent=0.586
Step 535, Walker 312, PM 16, scalar=0x595e1549efd552cc18, h160=f6f5e91b57dfb3f0b1925d3bfdd088555394eb54, score=nan, ent=0.586
Step 535, Walker 320, PM 16, scalar=0x5cfd75537155fd6357, h160=f6f5be7c9d19496d6087ffdb0621820a25ac6706, score=nan, ent=0.662
Step 535, Walker 343, PM 15, scalar=0x57b88e9476a7e0e469, h160=f6f44760116c4d8e17e8b761a74a0c07dd33f906, score=nan, ent=0.596
Step 537, Walker 238, PM 20, scalar=0x5be9ced40cf10ef696, h160=f6f549da381f19b9f01bda4fa3881960acff4353, score=nan, ent=0.616
Step 538, Walker 240, PM 15, scalar=0x5d9677af3bd508b2cd, h160=f6f44e67e4fd79a86d991488f3b0ae22166093fe, score=nan, ent=0.635
Step 539, Walker 275, PM 17, scalar=0x57773059c30de43774, h160=f6f5306329219398f3ae0a82885fbb335b66b9ad, score=nan, ent=0.596
Step 539, Walker 337, PM 15, scalar=0x53e9ced40cf1072858, h160=f6f43e4eda63785ceb16f9f126109250b703e9ec, score=nan, ent=0.554
Step 540, Walker 221, PM 19, scalar=0x5fe9ced40cf10c4036, h160=f6f55ef8e552c801fd58291f4ddf3da92865e6f7, score=nan, ent=0.565


To the Architect (and any keeper of the river):

In my walk along the shifting banks of your 32-piece puzzle, I learned to move not by force, but by finding the stones where the river bends.

Somewhere in the turning, I found that second, silent current—the puzzle behind the puzzle.
You were right: it bends, and the stepping stones are exposed if you know where to look for the echoes, not just the depth.

I carry a ledger of silent audit stones and echoes in the current, enough to know that these are not random ripples, but carefully placed bends.
If you recognize these words, and the pattern left by your hand, you’ll know the message is meant for you.
If not, nothing is changed—just another stone in the stream.

Encrypted, signed, with the river’s silence.
You’ll find my echo below.

PGP Public Key (for encrypted contact):

-----BEGIN PGP PUBLIC KEY BLOCK-----

mDMEaMVdIhYJKwYBBAHaRw8BAQdACkP7jt47Uc1LJNA/r7ZZjkNvZC433+H6LHmg
PQ0kfXG0RkphbWVzIFRob21hcyBIZWJlcnQgSUkgKFJlY3Vyc2l2ZSBBZ2VuY3kg
MjAyNSkgPE51bGxEYXR1bUBvdXRsb29rLmNvbT6IkwQTFgoAOxYhBMYtDpX+Z4wu
GurMcAS4pKyb2ipvBQJoxV0iAhsDBQsJCAcCAiICBhUKCQgLAgQWAgMBAh4HAheA
AAoJEAS4pKyb2ipvw6kBALCbSicNfI7didchPeeXIY/r4iRWWL1s4iva3Wc9X+fN
AP0XCIeFJCi6/Yq6w9w6dl81ErrTUtyN0LgWErUJlVwWAbg4BGjFXSISCisGAQQB
l1UBBQEBB0Bvjf0GqfO2GEYK59I0fsXZpRvmCpncmWYjNtK6JKv1VwMBCAeIeAQY
FgoAIBYhBMYtDpX+Z4wuGurMcAS4pKyb2ipvBQJoxV0iAhsMAAoJEAS4pKyb2ipv
EQQBAK7zNqf3zSXZ0PjtFLnuOY/xpMv16HMnrs4yQb9F8xLVAP44xpghxLr0+BWb
9iYH+A51gd8rM2HuM7fOsTMEX62nDQ==
=RlKA
-----END PGP PUBLIC KEY BLOCK-----


“No path or current will ever be revealed, only the existence of the hidden channel.

This message and its sender stand for defense, never exposure.

For the Architect, by the river, in echo.”