rocket_2019

This kind of thinking usually tries to link public keys with private keys based on their evenness or oddness, but it’s flawed. Try generating a bunch of keys and see if you can find any correlation; I doubt you will.

Not sure about a direct 1:1 mapping. But I noticed when b=0x0, it creates a simple loop that maps from public key to private key. I haven't found a way to map points from b=0x7 to b=0x0 yet.

Yeah, I’m guessing they’re placeholders or something. Like this github link I found, it shows some brute-force stuff for P2SH.

I think a lot of these were probably just experiments gone wrong or coding mistakes. Script evaluation adds a layer of security that can be bypassed, but it’s tricky.

First, you gotta evaluate the redeem script. If it’s valid, you can complete the signature script to finalize everything. For instance, if you see 0a, that tells you there should be 10 bytes, but if there aren’t, then…

There are loads of P2SH addresses with non-zero balances, but they look like they were created using some bizarre redeem scripts. Any ideas on how to actually make transactions from these addresses? I tried sending from…

I got something similar a python script that simulates this. It generates random signatures with a 128-bit leak, then assumes they’re real transactions and uses LLL reduction to uncover the PrivateKey.

+1, definitely more to explore here.

How do these factors relate to the number of 0s and 1s in the private key in binary? Like, if the number of zeros minus the number of ones is 6, does that make it more likely to be a key?

For puzzle 65, I generated 400 random private keys between puzzles 64 and 65. The pattern you mentioned appears about 1 in 10 times, so I doubt this is a reliable shortcut to finding private keys.

Anyone tried looking at the BTC Puzzle? I think we should simplify it using a probabilistic approach. Like, if we analyze the keys we've found, most aren’t even prime.

That's cool! So every Y has 3 corresponding X values, right? And if you check G for those points, you get a lot of connections. Pretty neat how this can apply to the usual secp256k1 that Bitcoin uses.

He was so convinced he'd get rich quick, but without risk management, that just leads to ruin.

Most traders lose because they dive in blind. They pray for profits but usually end up losing everything.

You’re hitting a limit because your script is hardcoded for 3 signatures. If leakage bits drop below 128, you’ll need more signatures as you go higher. Check out the generalized Matrix form reduction and the…

Trying what you posted and getting results.

That's exactly what I need! I'll give it a run once I verify the script. What should I use for the goal/prefix variables?

If you have "MyString" and want it on the address, you could base58decode_check("MyStringChecksum"), tweak the bytes for length and checksum, then base58encode_check those bytes to get your address. I just need to see…

For basic stuff, you can implement a simple version, you know?

Predictable? How do you figure? The math distance between R1 and R2 doesn’t really show the actual distance between their nonces. Here’s an example: R1 = 0xa03aba6c1d66b0adff5f523b05ae59226b75a3c89c5755728d4278b4d02dec0…