Probably owner get fear from script...Seems that 120puzzle, 125 puzzle and 130 puzzle BTC are sit on 3Emiwzxme7Mrj4d89uqohXNncnRM15YESs.
Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 54. (Read 245102 times)
1Prestige1zSYorBdz94KA2UbJW3hYLTn4 has been emptied half hour ago Probably owner get fear from script...
Seems that 120puzzle, 125 puzzle and 130 puzzle BTC are sit on 3Emiwzxme7Mrj4d89uqohXNncnRM15YESs.
Probably owner get fear from script...Seems that 120puzzle, 125 puzzle and 130 puzzle BTC are sit on 3Emiwzxme7Mrj4d89uqohXNncnRM15YESs.
Solvers of BTC puzzle #120, #125 and #130 are one and the same person.
What advantage do you intend to gain by knowing the private key from previously cracked puzzles? Apart from some useless statistics like “the key is at 12.83% of the corresponding bit range” and funny stuff like that
if one day I found/solve one of those i will provide the evidence, method and details about it and more important the fucking private key.
Me too. If not through this username, then through another one. The biggest stupidity is not having a private key here for puzzles above 100. I would also donate to the developer if I solve the puzzle through his program. In the event that my bot takes the prize - the first address gets 50%....I would NEVER think of killing the winner.
i think that puzzle130 solved by albertobsd
Why suddenly there is a lot of new account and relative new accounts that come here and write all kind of stuff?
Sadly I wasn't that person who solve or claim any of those puzzles. I want to be that lucky guy, seriously if one day I found/solve one of those i will provide the evidence, method and details about it and more important the fucking private key.
Anyone can generate those vanity addresses it is just matter of time, there is a tool called vanitysearch
Even my keyhunt has that option wanna try?
Code:
./keyhunt -v 1Prestige1 -m vanity -R -e -t 8 -b256 -l compress -s 10
Just let it run for some time to get one... do you want to get one of those faster?, search for options for GPU
Congrats to the winner of puzzle 130
i think that puzzle130 solved by albertobsd transfered adress very similar with his adress (1Prestige1zSYorBdz94KA2UbJW3hYLTn4).
1Coffee1
1Prestige1
transfered adress very similar with his adress (1Prestige1zSYorBdz94KA2UbJW3hYLTn4). 1Coffee1
1Prestige1
Since everyone is posting predictions I thought I should join, here's a some of my predictions out of a list of about 50
0x7898c85ed821ac000, 0x5dcc2a10e0fdc0000, 0x6985af52fd1d78000, 0x5dcc2a10e0fdc0000, 0x767b27a987fd24000, 0x53cebf0e1a0210000, 0x5a548e1d345100000, 0x5d613edf1fa218000, 0x4e2683b0e20fa8000, 0x5142d372b085ac000, 0x666e266e88a670000,
and here are 3 that I got tinkering with other peoples prediction code
0x4E9B1DC6EDA600000, 0x488C1D2EC14570000, 0x52663CCAB1E1C0000
0x7898c85ed821ac000, 0x5dcc2a10e0fdc0000, 0x6985af52fd1d78000, 0x5dcc2a10e0fdc0000, 0x767b27a987fd24000, 0x53cebf0e1a0210000, 0x5a548e1d345100000, 0x5d613edf1fa218000, 0x4e2683b0e20fa8000, 0x5142d372b085ac000, 0x666e266e88a670000,
and here are 3 that I got tinkering with other peoples prediction code
0x4E9B1DC6EDA600000, 0x488C1D2EC14570000, 0x52663CCAB1E1C0000
there is your prediction about 130 and 135 ?
Since everyone is posting predictions I thought I should join, here's a some of my predictions out of a list of about 50
0x7898c85ed821ac000, 0x5dcc2a10e0fdc0000, 0x6985af52fd1d78000, 0x5dcc2a10e0fdc0000, 0x767b27a987fd24000, 0x53cebf0e1a0210000, 0x5a548e1d345100000, 0x5d613edf1fa218000, 0x4e2683b0e20fa8000, 0x5142d372b085ac000, 0x666e266e88a670000,
and here are 3 that I got tinkering with other peoples prediction code
0x4E9B1DC6EDA600000, 0x488C1D2EC14570000, 0x52663CCAB1E1C0000
0x7898c85ed821ac000, 0x5dcc2a10e0fdc0000, 0x6985af52fd1d78000, 0x5dcc2a10e0fdc0000, 0x767b27a987fd24000, 0x53cebf0e1a0210000, 0x5a548e1d345100000, 0x5d613edf1fa218000, 0x4e2683b0e20fa8000, 0x5142d372b085ac000, 0x666e266e88a670000,
and here are 3 that I got tinkering with other peoples prediction code
0x4E9B1DC6EDA600000, 0x488C1D2EC14570000, 0x52663CCAB1E1C0000
don't waste your time to Digarans' substraction crazyness.
Are you jealous and daydream to get those wallet ?, but in reality you cannot do it ? so you blame yourself and people who's have right about their opinion ? childish, period.
yous look like dogs, you only know how to bark and you don't solve anything! lol
don't waste your time to Digarans' substraction crazyness.
you only need a db with approximately 100m keys to reduce the 130 puzzle to 100 bits.
Care to explain why would one reduce a 2**65 problem to a 2**100 problem?
you only need a db with approximately 100m keys to reduce the 130 puzzle to 100 bits.
exactly 2^30 pubkeys need for get 2^100 from 2^130
for i <= 2^30:
pubkey100bit= (pub130bit - i)/2^30# one of resukt will be 2^100
Puzzle 130: 1361129467683753853853498429727072845823, approximately 2^26 are needed. We always subtract from the top, 136112946 (saving work), considering that the minimum range is 680564733841876926926749214863536422911. We need 136112946 - 68056473 = 68056473 subtractions.
you talk about total operations from top to result, or full range from top of 2^30 to 2^29 ?
In way from top to result, crack 1 substraction = 1 brute , sach scheme?
if the range of the puzzle is
1361129467683753853853498429727072845823
680564733841876926926749214863536422911
you don't need to subtract 1 2**30 times only
you just need to
subtract
1000000000000000000000000000000000
68056473 times.
and you would be left with this:
7683753853853498429727072845823
you only need a db with approximately 100m keys to reduce the 130 puzzle to 100 bits.
exactly 2^30 pubkeys need for get 2^100 from 2^130
for i <= 2^30:
pubkey100bit= (pub130bit - i)/2^30# one of resukt will be 2^100
Puzzle 130: 1361129467683753853853498429727072845823, approximately 2^26 are needed. We always subtract from the top, 136112946 (saving work), considering that the minimum range is 680564733841876926926749214863536422911. We need 136112946 - 68056473 = 68056473 subtractions.
you talk about total operations from top to result, or full range from top of 2^30 to 2^29 ?
In way from top to result, crack 1 substraction = 1 brute , sach scheme?
you only need a db with approximately 100m keys to reduce the 130 puzzle to 100 bits.
exactly 2^30 pubkeys need for get 2^100 from 2^130
for i <= 2^30:
pubkey100bit= (pub130bit - i)/2^30# one of resukt will be 2^100
Puzzle 130: 1361129467683753853853498429727072845823, approximately 2^26 are needed. We always subtract from the top, 136112946 (saving work), considering that the minimum range is 680564733841876926926749214863536422911. We need 136112946 - 68056473 = 68056473 subtractions.
you only need a db with approximately 100m keys to reduce the 130 puzzle to 100 bits.
exactly 2^30 pubkeys need for get 2^100 from 2^130
for i <= 2^30:
pubkey100bit= (pub130bit - i)/2^30# one of resukt will be 2^100
you only need a db with approximately 100m keys to reduce the 130 puzzle to 100 bits.
[...snipped...]
Thanks for explaining it but i dont get what is the number 95823 from your first line
Code:
old_key = 4563 -- was from "95823/21"
95823 was from 1764F on 17 bit puzzle, divide 17 bit into 21 bit.
"How many multiples are there from 95823 to 2097151?"
95823/2097151 = 21 = 4563.
hi i think this is user zielar https://bitcointalksearch.org/user/zielar-1020539 taking 120 125 130 he works in a company where there are many gpus i think the company doesn't know that he is using their equipment
Companies that use a large number of GPUs, especially at the scale of 20,000 or more
1.Google
2.Amazon (AWS)
3.NVIDIA
4.Meta (Facebook)
5.Tesla: Tesla Dojo
6.Cryptocurrency Mining Farms
In which company do you think it is possible to solve puzzle 130 unnoticed from the list above?
Calculate the far distance when the decimal is multiplied by 1.05
1811511 * 1.05 = 1902086.55 (depends on your settings).
1902086.55 results are rounded to 1902087
so the search is 1811511 to 1902087
1811511 * 1.05 = 1902086.55 (depends on your settings).
1902086.55 results are rounded to 1902087
so the search is 1811511 to 1902087
How do you determine the exact range to multiply by 1.05 in a puzzle that does not have a solved private key?
it's simple, if you do multipler with large value, it's gonna be exceed, 1.01 - 1.05 it's quietly large.
Jump to: