Bitcoin puzzle transaction ~32 BTC prize to who solves it

[WanderingPhilospher]

Isn't it more efficient to search less pub keys over more steps? In other words, doesn't the process to convert the pub key to a comparable value take longer than it takes to generate the next baby step? I limited my search to 1000 keys based on this thought.

What is the fastest way to search multiple pubkeys? bsgs or kangaroo?? How many pubkeys can I search at one time?

Tried up to 160,000 pubs on keyhunt BSGS before.

How many private keys did you find successfully?

 Zero, Null, Zilch, None, Nil

Welcome to Bitcoin.

I think it’s 6 one way, half a dozen the other.

Running one pub key gets you X speed. Running multiple pub keys at once gets you X/# of pubkeys speed.
Ultimately, #125 is too large of a range, whether you run 1 pub or 1000 pubs. But it can help you narrow down ranges IMO

[Lolo54]

unfortunately no magic for puzzles without pubkey for the moment there is only brute force but even for 66 it's bigger than ocean! For those with pubkey on the other hand, a whole bunch of arithmetic ideas can be found, it remains to find the right one to restrict the range which is enormous and then use kangaroo or bsgs

[curiousNoone]

Rounded up 66 puzzle is 36.8934881474191 keys

That is 36.8934881474191 sextillion.


My question

what is or is there a record for the most amount of keys tried in a second via brute forcing ?

I have a script ive worked on for about a month its my own outside the box thinking.
Testing the script achieved what i want it to do.

It will 100% work however like everyone else we are not immortal and time is certainly not on anyones side brute forcing btc.

so thats where im stuck at.

i need 1 billion keys a second tried lol

it will still take time but for puzzle 66 it would take 1 billion keys per second, it would take approximately 37,000 seconds to try37 quintillion keys.

That is equivalent to about 10.28 hours.

One can dream eh.

Anyway if you reply please answer my question on what/if a record exsists.

[WanderingPhilospher]

Rounded up 66 puzzle is 36.8934881474191 keys

That is 36.8934881474191 sextillion.


My question

what is or is there a record for the most amount of keys tried in a second via brute forcing ?

I have a script ive worked on for about a month its my own outside the box thinking.
Testing the script achieved what i want it to do.

It will 100% work however like everyone else we are not immortal and time is certainly not on anyones side brute forcing btc.

so thats where im stuck at.

i need 1 billion keys a second tried lol

it will still take time but for puzzle 66 it would take 1 billion keys per second, it would take approximately 37,000 seconds to try37 quintillion keys.

That is equivalent to about 10.28 hours.

One can dream eh.

Anyway if you reply please answer my question on what/if a record exsists.

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.

[curiousNoone]

Rounded up 66 puzzle is 36.8934881474191 keys

That is 36.8934881474191 sextillion.


My question

what is or is there a record for the most amount of keys tried in a second via brute forcing ?

I have a script ive worked on for about a month its my own outside the box thinking.
Testing the script achieved what i want it to do.

It will 100% work however like everyone else we are not immortal and time is certainly not on anyones side brute forcing btc.

so thats where im stuck at.

i need 1 billion keys a second tried lol

it will still take time but for puzzle 66 it would take 1 billion keys per second, it would take approximately 37,000 seconds to try37 quintillion keys.

That is equivalent to about 10.28 hours.

One can dream eh.

Anyway if you reply please answer my question on what/if a record exsists.

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.

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

[Lolo54]

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

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

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

[Kamoheapohea]

Can some moderator finally close either this thread or "== Bitcoin challenge transaction: ~100 BTC total bounty to solvers! ==UPDATED==" (https://bitcointalk.org/index.php?topic=5218972.0)

It's 100% the same topic.

[Evillo]

Can some moderator finally close either this thread or "== Bitcoin challenge transaction: ~100 BTC total bounty to solvers! ==UPDATED==" (https://bitcointalk.org/index.php?topic=5218972.0)

It's 100% the same topic.

Why are you concerned, are you the database?

[Evillo]

Rounded up 66 puzzle is 36.8934881474191 keys

That is 36.8934881474191 sextillion.


My question

what is or is there a record for the most amount of keys tried in a second via brute forcing ?

I have a script ive worked on for about a month its my own outside the box thinking.
Testing the script achieved what i want it to do.

It will 100% work however like everyone else we are not immortal and time is certainly not on anyones side brute forcing btc.

so thats where im stuck at.

i need 1 billion keys a second tried lol

it will still take time but for puzzle 66 it would take 1 billion keys per second, it would take approximately 37,000 seconds to try37 quintillion keys.

That is equivalent to about 10.28 hours.

One can dream eh.

Anyway if you reply please answer my question on what/if a record exsists.

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.

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

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🤞

[lordfrs]

Rounded up 66 puzzle is 36.8934881474191 keys

That is 36.8934881474191 sextillion.


My question

what is or is there a record for the most amount of keys tried in a second via brute forcing ?

I have a script ive worked on for about a month its my own outside the box thinking.
Testing the script achieved what i want it to do.

It will 100% work however like everyone else we are not immortal and time is certainly not on anyones side brute forcing btc.

so thats where im stuck at.

i need 1 billion keys a second tried lol

it will still take time but for puzzle 66 it would take 1 billion keys per second, it would take approximately 37,000 seconds to try37 quintillion keys.

That is equivalent to about 10.28 hours.

One can dream eh.

Anyway if you reply please answer my question on what/if a record exsists.

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.

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

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🤞

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

[hhhhugi]

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.

[lordfrs]

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.

what's your system? gpu ? cpu?

[Evillo]

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 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 😍

[Evillo]

Isn't it more efficient to search less pub keys over more steps? In other words, doesn't the process to convert the pub key to a comparable value take longer than it takes to generate the next baby step? I limited my search to 1000 keys based on this thought.

What is the fastest way to search multiple pubkeys? bsgs or kangaroo?? How many pubkeys can I search at one time?

Tried up to 160,000 pubs on keyhunt BSGS before.

How many private keys did you find successfully?

 Zero, Null, Zilch, None, Nil

Welcome to Bitcoin.

I think it’s 6 one way, half a dozen the other.

Running one pub key gets you X speed. Running multiple pub keys at once gets you X/# of pubkeys speed.
Ultimately, #125 is too large of a range, whether you run 1 pub or 1000 pubs. But it can help you narrow down ranges IMO

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.

[WanderingPhilospher]

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 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 😍

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.

[Tepan]

02c584e2cb49a5aabd9ceb1e5128cecd0a7ca96628e76b1491950f021a4852d8ec ?
figure this out guys

[Evillo]

02c584e2cb49a5aabd9ceb1e5128cecd0a7ca96628e76b1491950f021a4852d8ec ?
figure this out guys

What seems to be the problem?

[Andzhig]

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()

[curiousNoone]

Rounded up 66 puzzle is 36.8934881474191 keys

That is 36.8934881474191 sextillion.


My question

what is or is there a record for the most amount of keys tried in a second via brute forcing ?

I have a script ive worked on for about a month its my own outside the box thinking.
Testing the script achieved what i want it to do.

It will 100% work however like everyone else we are not immortal and time is certainly not on anyones side brute forcing btc.

so thats where im stuck at.

i need 1 billion keys a second tried lol

it will still take time but for puzzle 66 it would take 1 billion keys per second, it would take approximately 37,000 seconds to try37 quintillion keys.

That is equivalent to about 10.28 hours.

One can dream eh.

Anyway if you reply please answer my question on what/if a record exsists.

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.

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

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🤞

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.

 

[Evillo]

Rounded up 66 puzzle is 36.8934881474191 keys

That is 36.8934881474191 sextillion.


My question

what is or is there a record for the most amount of keys tried in a second via brute forcing ?

I have a script ive worked on for about a month its my own outside the box thinking.
Testing the script achieved what i want it to do.

It will 100% work however like everyone else we are not immortal and time is certainly not on anyones side brute forcing btc.

so thats where im stuck at.

i need 1 billion keys a second tried lol

it will still take time but for puzzle 66 it would take 1 billion keys per second, it would take approximately 37,000 seconds to try37 quintillion keys.

That is equivalent to about 10.28 hours.

One can dream eh.

Anyway if you reply please answer my question on what/if a record exsists.

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.

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

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🤞

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.

 

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.