bro, how did you get the private key with the address 13ZB1HQBWNN3AG9GNS2VCRAT8PQJDJVDR, or did you happen to have it?If you compare it with the address #66 of the puzzle, then they have the same prefixes at the beginning of the address, also in the hash160. If you compare by range that this one and that one, both are in the #66 range. Maybe kalos15btc is right about something?!.

1 - Convert the private key from hex to bytes
00000000000000000000000000000000000000000000000354d62e5f7a0d2eb2
b'\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x03T\xd6._z\r.\xb2'

2 - Create a signing key from the private key bytes using the SECP256k1 elliptic curve
<ecdsa.keys.SigningKey object at 0x000002D447E14400>

3 - Get the corresponding public key
02b21a6b1590b145841a0dabbe71ea01e29ed60f0e468cff36445a9c92eb3a6375
VerifyingKey.from_string(b'\x02\xb2\x1ak\x15\x90\xb1E\x84\x1a\r\xab\xbeq\xea\x01\xe2\x9e\xd6\x0f\x0eF\x8c\xff6DZ\x9c\x92\xeb:cu', SECP256k1, sha1)

4 - Serialize the public key in compressed format (33 bytes)
b'\x02\xb2\x1ak\x15\x90\xb1E\x84\x1a\r\xab\xbeq\xea\x01\xe2\x9e\xd6\x0f\x0eF\x8c\xff6DZ\x9c\x92\xeb:cu'
02b21a6b1590b145841a0dabbe71ea01e29ed60f0e468cff36445a9c92eb3a6375

5 - Calculate the SHA-256 hash of the public key
b'\t\xb4\x87?D\'I\xef>\x86\xc7\x1d\x92\x86\xb1"\xa9\xdd\xf9v%\xa0\x03X\x88\xfb\x96%F\x0e\'\x16'
09b4873f442749ef3e86c71d9286b122a9ddf97625a0035888fb9625460e2716

6 - Calculate the RIPEMD-160 hash of the SHA-256 hash
<ripemd160 HASH object @ 0x000002D4477BF690>
b' \xd4Zjv%3BR\xc81\x8a\x87\xed053\xc1\xc7\xbb'
20d45a6a7625334252c8318a87ed303533c1c7bb

7 - Add the version byte (0x00 for mainnet) to the RIPEMD-160 hash
b'\x00'

8 - Extended RIPEMD-160 Hash
b'\x00 \xd4Zjv%3BR\xc81\x8a\x87\xed053\xc1\xc7\xbb'
0020d45a6a7625334252c8318a87ed303533c1c7bb

9 - Calculate the double SHA-256 checksum
b'\x01\x02l\xf90\xf6N\x8f\xeb\xca\xc8\xc2\x15\xd9Q\xb8i))\xb0\xce:\xb1\xba\x9e\xa4\xa1\x07_\x05\xe2\xa2'
b'\x01\x02l\xf9'

10 - Checksum: 01026cf9

11 - Append the checksum to the extended RIPEMD-160 hash
b'\x00 \xd4Zjv%3BR\xc81\x8a\x87\xed053\xc1\xc7\xbb\x01\x02l\xf9'
0020d45a6a7625334252c8318a87ed303533c1c7bb01026cf9

12 - Address (with checksum)
0020d45a6a7625334252c8318a87ed303533c1c7bb01026cf9

13 - Convert the bytes to a base58-encoded Bitcoin address
13zb1hQbWVnN3ag9GNS2vCraT8PQJDjVdr

---

provide an alternative, more straightforward method, if available instead of this ?

up, anyone interessing its same 11 digits hash160 so who can scan this range 116 and split the 13 btc ?

if i have a satoshi each time that i see that question...

Sadly there is no way to determine if a point in the curve is odd or even, also there is no way to determine if bit in any position is 1 o 0 that would totally break ECDSA

I already try a lot of things to try to anwser that question, but none of them works and actually i really give up that way, my recomendation is not lose time in that topic (Unless you are full cryptographer with wide knowledge in that field)

Welcome to the club by the way.

So any update on the progress of finding this key?
 First offset = 03982a5a42895a5cfe4b9b98e49f9389ebf9b3bf91c2289f1c5db3d944f46ec710
Half of above =
0291001b0dc6e5a2628cb4698eb00a6fb7dbd276dc2b214795f2fe52e61243aa9b
Half of 130?
0337374e00a32eaf009e9946035c0e69085627b60a844637d2b958dd83bcfa4383
The following is the subtracted key from #130
Second offset =
03d99bb89e8db75d20b882f13f8086fb39221858fa211de0346c926a93ae259b3a
Half of above?
03a3dc00bf5f7e7eec691569c7f67a15d3cdbb3a9994c9a5ec1430cffdb622cf9f

Now subtract half of first offset from half of #130 to get half of second offset.

Second offset is known, we need to work on first offset's half, use -1 divide by 2 script to reduce 18 bits from it, you'll have millions of new offsets and one of them is the target, now divide the #130 range by 2, subtract 18 bits from it and use the new range as your search range, input those millions offset keys and search the range.

Don't just try blind searching.😉

Modified the quote.
WP taught me subtraction/addition, I learned division from garlonicon's posts.
Please don't take credit for things you haven't done. Thanks for kind words.!

Download and run this java calculator, it's very slow and heavy but it's good for manual calculations which is why you can only do manual calc with it.
https://github.com/MrMaxweII/Secp256k1-Calculator

Select scalar on both sides, and place private keys in hex format, then select * , + , - , ÷ , and see for yourself what would be the result.

What you should consider when dividing an odd key, dividing any odd key by 2 will always give you .5 ( point 5, half ), anything on the left side of the point . Is your actuall result no matter if you are dividing by 2 or any other number, but for example we use 2, and anything on the right side of the point . Is a 2^255 + key, we don't want that, so we subtract that from our result to get the actual answer.

3 divided by 2 = 1.>5 <  this 5 here means half of n, so if we subtract it from 1.5, we will get 1, our actual result.

Now lets make it a bit difficult, let us divide 7 by 3 = 2.33333333333333333333333333333333333333333333333333333333333333333333333333333 3333333333333333333333333333333333333333333333333333333333333333333333333333333 3333333333333333333333333333333333333333333

Now to get the n/33333........... more 333333..... etc, no need to do any complicated calculation, we just divide 7 by 3 mod n to quickly get the result, then we subtract it from the result to get our key.

---

Never mind all the above, I have something to twist your minds, take the following key and double, divide, do many other things with it to get really confused about how EC works. 😂

Introducing to you 2^256 of secp256k1


Try multiplying it by 2, 3, 4, 5 etc as well as dividing it, this little sucker is hiding it's half under the ground!

Look forward to explanations! Good luck bro!

---

Tell me how to make each pub write from a new line, and not all in one line?

Hey guys, instead of wasting your eye sight on long and useless base58 WIFs which literally represent 0s in hexadecimal, let me share a little secret regarding public keys.

Here is how you can find half of your public key, it's not straight forward method but I bet many of you didn't know about it.

First we need to extract 1 and half of our public key then we can subtract our p which is 1 from it's 1.5 to get it's 0.5 half. Though we could just divide it by 2 without all this trouble, this is a hint to make you dive deeper in to this vast ocean of numbers and equations.

Target  pub:

Target priv:

Our multiplier inverse or not doesn't matter, +n will give you +n result and vice versa.

Scalar : aka n/2+1 half n +1 or 1 and half of n.

If you multiply our target pub with scalar above, you will get this :
Pub2 :

Priv :

Now if we subtract target from pub2, we will get :

Pub3, half of target :

Priv :

We didn't even use division, *chop chop and good luck diving.😅


* = hurry! Get to work.

Hey guys, instead of wasting your eye sight on long and useless base58 WIFs which literally represent 0s in hexadecimal, let me share a little secret regarding public keys.

Here is how you can find half of your public key, it's not straight forward method but I bet many of you didn't know about it.

First we need to extract 1 and half of our public key then we can subtract our p which is 1 from it's 1.5 to get it's 0.5 half. Though we could just divide it by 2 without all this trouble, this is a hint to make you dive deeper in to this vast ocean of numbers and equations.

Target  pub:

Target priv:

Our multiplier inverse or not doesn't matter, +n will give you +n result and vice versa.

Scalar : aka n/2+1 half n +1 or 1 and half of n.

If you multiply our target pub with scalar above, you will get this :
Pub2 :

Priv :

Now if we subtract target from pub2, we will get :

Pub3, half of target :

Priv :

We didn't even use division, *chop chop and good luck diving.😅


* = hurry! Get to work.