Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 215. (Read 230719 times)

The 'creator' created a wallet and increasingly changed the front bits to zero's
I wonder why there are still some who don't believe this?

One of the most interesting topics I've read in a while.. but what makes you think this was the way the creator used to generate the puzzles' sequence? There could be a million ways to be used for this?

The pubkey i found it's used to trans the Bitcoin to all puzzle with huge bitcoin last time, maybe we can search from that pubkey ? it's possible ?
just ask, because i need to figure out and learn, thx.

So basically you have the formula but need a trustworthy person to run it in their fast GPUs .. did i get that right?

If so dm me .. or if you want you can DM older members if that would make you more comfortable.

Exactly i have my own formula. Its completly thinking outside the box.
Like i said it works exactly how its intended and in testing it has been 100% successfull.

Next problem is how could i trust anyone with what i have when it could be poetenially dangerous i certainly aint a coder like most here.

I have been on the grind for the last week with this and one thing stops me speed and customization and i suppose trust i havent been completly transparent on everything tbh.

 

https://towardsdatascience.com/random-seeds-and-reproducibility-933da79446e3

And how does this random.seed() work?

set some value and then Mersenne twister...

Mersenne twister 19937 bit (624·32 (2^32 = 4294967296) — 31)

for example, we take 3 random

random.seed(blablabla)
random.randrange(1,10)
random.randrange(1,10)
random.randrange(1,10)

we get for each of the 3 in order from the vortex of the first three?

                                 1— 31
random.randrange(1,10) 1,4294967296 (624·2)
random.randrange(1,10) 1,4294967296 (624·3)
random.randrange(1,10) 1,4294967296 (624·4)

and if we take 624 random.randrange(1,10) period ends and a new one begins again

                                 1— 31            next period
random.randrange(1,10) 1,4294967296 (625)624·2
random.randrange(1,10) 1,4294967296 (626)624·3
random.randrange(1,10) 1,4294967296 (627)624·4

and if we have a large sample of random.randrange(36893488147419103232,73786976294838206464) he spends 1 period for 1 sample or 624 and a new one (then why are they not repeated 2^32?)

or he these 19937 bit takes it all at once

in other words, to complete all puzzles with 1 seed() we need to iterate over this seed() to iterate over all variations of this 2^19937 bit ((2^32)^624)?

and seed() itself doesn’t matter (with brute force) you don’t need old computers to run it randomly in order to pick up the date and time, etc. to create the same bitcoin address.


random.seed(1, 2^19937) and all pz

random.randrange(36893488147419103232,73786976294838206464) 66
...
random.randrange(21267647932558653966460912964485513216,42535295865117307932921825928971026432) 125
...
random.randrange(730750818665451459101842416358141509827966271488,1461501637330902918203684832716283019655932542976) 160

and the puzzles themselves need to be multiplied 2^160×2^159×2^158...×2^66

and if it turns out that there may be collisions here , If 2^19937 the most options to open all the puzzles at once through 1 seed()

What seems to be the problem?

02c584e2cb49a5aabd9ceb1e5128cecd0a7ca96628e76b1491950f021a4852d8ec ?
figure this out guys

BSGS cuda gets more speed, but that is with GPU.

I was getting 2^62.04 keys per second; but I know those with 3090s were getting more. I was limited on system RAM to 16GB.

Problem with running multiple pubs instead of only the puzzle pub, is that you can't (or should not) look for any range less than 2^240 .. because you know that these pubs are randomly generated and not masked with leading zeros. That's why it would be effective enough ( and more feasible) to only search for a puzzle pub key in its range.

I get 2 petakeys/s which is the biggest number I've ever reached in any cracking program. Uses 32 gb of ram .. imagine what you would get with 512 gigs 😍

what's your system? gpu ? cpu?

Keyhunt with bsgs is giving me 1 Exakeys/second speed. Its 1,000,000,000,000 Megakeys/s in 125 bit range which is quite impressive, Its almost identical to searching 66th puzzle with decent gpu. Correct me if i'm wrong.

I narrow the key, but every time I drop a bit, the probability of pubkey is twice the previous one.

What if you have 1b keys/sec? The only way this is going to help is if you find a formula that can narrow down your range at least 1000 times less .. other than that go run your devices and try your luck🤞

Why are you concerned, are you the database?

Can some moderator finally close either this thread or "== Bitcoin challenge transaction: ~100 BTC total bounty to solvers! ==UPDATED==" (https://bitcointalksearch.org/topic/bitcoin-challenge-transaction-1000-btc-total-bounty-to-solvers-updated-5218972)

It's 100% the same topic.

It would take a minimum speed of 5 TerraKeys/s to start being in the correct time frame for #66. Multiply by 2 the delay or speed for each key above without pubkey

it all depends on your hardware but let's say that with average hardware Bitcrack vanbitcracken keyhunt can do it without any problem or even much more but even if you could multiply by 2 or 3 their speed it will help you very very very little

I thought so let me go slap chatgpt

Edit maths does work out for what im doing    Please please point me to where these apps can do 1 billion a sec per key or any info

I think your math is off. Many programs already out can do over 1 billion keys per second, GPU of course.

1 billion keys per second would take you 1,169 years.