bc1quzu29whwrdmlcup52hee6528w3gler8u2ha9xa

Puzzle 135 range size: 2¹³⁴

BSGS requirements:

1. Fast memory baby table: sqrt(N) items = 2⁶⁷ items
Item size: 256 bits in full; let's assume we only need the first 67 bits and ignore hash collision overhead

Total memory required: 2⁶⁷ * 67 bits = somewhere between 2⁷³ to 2⁷⁴ bits

The total amount of data stored on Earth in 2018 was 33 zettabytes. That is, 2⁷⁸ bits.

Estimates for 2025 are around 175 zettabytes. That s, all of the hard drives that exist on Earth have some total capacity of around 2⁸⁰ bits.

The amount of RAM is less than a fraction of all that (if you don't believe this, check any PC: what's the ratio between RAM and storage capacity?)

2. How many threads?

EC operations required at most: sqrt(N) for baby steps + sqrt(N) for giant steps = 2 * sqrt(N) steps

That is, 2⁶⁸ elliptic curve group operations.

A high-end CPU can do around 15 to 20 Mo/s per thread. However, we also need to check the table after every giant step. I will ignore this and assume it is a no-op (it's not).

Total threads needed to solve in one second: 2⁶⁸ 20.000.000 = 14,757,395,258,968

In summary:

RAM: 1 to 2 zettabytes
CPU threads: 14.8 trillion (for 1 second of total work)

Thanks for the info. but according to the link you gave, won't the publickey be exposed when I sign raw tx in my electrum? in this way, aren't we actually broadcasting the transaction? Also, I didn't see such a step in the new version electrum. the question I asked may seem simple and funny to you, but I am trying to understand how people like me who don't know much can achieve this.

You're not thinking like that, are you? Or do you believe that using a transaction on slipstream.mara.com justifies the entire process? Can some activity on Twitter really cover everything? Social media can sometimes amplify misinformation or speculation, so it’s crucial to cross-check information with reliable sources or on-chain data. It’s understandable why some people might think that way, especially when dealing with large sums of money or complex systems like Bitcoin. Sometimes, it’s better to go fishing than to chase conspiracies...  

If you sign, the publickey is not released. If you say PUBLISH, the transfer starts and the PUBLICKEY is released.

In the new versions, PUBLISH does not come out without SIGNING. I know that.

really feel helpless, i don't think that puzzles like this have anyone to solve or there is a conspiracy behind it

Question for someone smarter than me. I don't understand, I'm running KeyHunt-Cuda but the output shows 661.92 Mk/s but for the T: 15,032,385,536. only 15 million. can someone explain it because the original key hunt was display correctly. maybe its just me not understanding what the T stands for. I though it was threads processed which would be a single key processed. correct me if I'm wrong please.

PS C:\KeyHunt-Cuda-main> .\KeyHunt-Cuda.exe -t 0 -g --gpui 0 --gpux 512,512 -m address --coin BTC --range 730fc235c00000000:730fc235fffffffff 1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9

KeyHunt-Cuda v1.07

COMP MODE    : COMPRESSED
COIN TYPE    : BITCOIN
SEARCH MODE  : Single Address
DEVICE       : GPU
CPU THREAD   : 0
GPU IDS      : 0
GPU GRIDSIZE : 512x512
SSE          : YES
RKEY         : 0 Mkeys
MAX FOUND    : 65536
BTC ADDRESS  : 1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9
OUTPUT FILE  : Found.txt

Start Time   : Sat Feb 22 13:25:47 2025
Global start : 730FC235C00000000 (67 bit)
Global end   : 730FC235FFFFFFFFF (67 bit)
Global range : 3FFFFFFFF (34 bit)

GPU          : GPU #0 Tesla T4 (40x64 cores) Grid(512x512)

[00:00:20] [CPU+GPU: 661.98 Mk/s] [GPU: 661.98 Mk/s] [C: 78.125000 %] [R: 0] [T: 13,421,772,800 (34 bit)] [F: 0]
=================================================================================
PubAddress: 1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9
Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qbP2K5cm35XKMND1X1KW
Priv (HEX): 730FC235C1942C1AE
PubK (HEX): 0212209F5EC514A1580A2937BD833979D933199FC230E204C6CDC58872B7D46F75
=================================================================================
[00:00:22] [CPU+GPU: 661.92 Mk/s] [GPU: 661.92 Mk/s] [C: 87.500000 %] [R: 0] [T: 15,032,385,536 (34 bit)] [F: 1]

So, if I'm understanding it the last 3 places are cut off or will they continue to be cut off as the number grows. The reason why I'm asking is to keep track of my place. What would the correct syntax to output it to a file and would the file have it cut off or would it be correct in the file?

Hey, BTC67 winner here. What's the best way for me to contact RetiredCoder ?

IFUCyxSGddzbuAxOmhrLBQ+4Q606tFU81wRu8wWg30VxHNNDcKGlcHDJH4aRTnxFE6W8Xc6VPtVQxw+DSadYKlk=