|
Thanks you DannyHamilton to help explain that overflow incident
incident can happen because code not check number of input right?
if it happen just over not overflow , like over 50 bitcoin , and no body found it until over 200 block , this case how to cancel it
do we need to hard fork chain
|
|
|
|
|
some question
This overflow incident happen by accident from bug of code bitcoin core or happen by human do this (hacker) or other way do by some wrong script/app wallet sent data to wrong?
Thanks
|
|
|
|
create millions of Bitcoin addresses for real use if HD wallet can support over millions address, I think it easy to use create individual private key over 1 million you need to keep it save all it is risk to lost some address if missing if for you use personal it easy and no problem I try at https://iancoleman.io/bip39/type starting from index 900,000,000 it generate next address |
|
|
|
last night I test run kangaroo python script version all night with puzzle #120 it is not work good I try with puzzle #50 test 100 time, key can be found many way Puzzle #50
611140496167764
0x22bd43c2e9354
the public key x-value (Hex):
f46f41027bbf44fafd6b059091b900dad41e6845b2241dc3254c7cdd3c5a16c6
110560903758971929709743161563183868968201998016819862389797221564458485814982
the public key y-value (Hex):
eb3dfcc04c320b55c529291478550be6072977c0c86603fb2e4f5283631064fb
106403041512432555215316396882584033752066537554388330180776939978150437217531
the public key (Hex):
04f46f41027bbf44fafd6b059091b900dad41e6845b2241dc3254c7cdd3c5a16c6eb3dfcc04c320b55c529291478550be6072977c0c86603fb2e4f5283631064fb
---------------
611140496167764
0x22bd43c2e9354
Collision Point (got more than in list)
a513f54f69ddf470f5abdcf769cbb6a067248d7da73197f82e07f7083eb06000 954702022026005
a513f54f69ddf470f5abdcf769cbb6a067248d7da73197f82e07f7083eb06000 343561525858241
de8298b6c0bc42029d1dceed0213ba24200d654f1ce527958555822d71f97000 1130704657170423
de8298b6c0bc42029d1dceed0213ba24200d654f1ce527958555822d71f97000 519564161002659
2bad5cd5bd5dbbfeb816a8101eb34fb64dd361388fc01162d295c3f22c819000 915124390258892
2bad5cd5bd5dbbfeb816a8101eb34fb64dd361388fc01162d295c3f22c819000 303983894091128
a8783a3787f85a8d7cec689ce70737a8da2f18a1f29543e90857910c2fdbf000 1112872798694686
a8783a3787f85a8d7cec689ce70737a8da2f18a1f29543e90857910c2fdbf000 501732302526922
8d4176027265833a19df3466b064280ad9d0487678288e1d839c0ddb90845000 857201922923546
8d4176027265833a19df3466b064280ad9d0487678288e1d839c0ddb90845000 246061426755782
b3d841d0386e6c481c151d7f218742a1c1dd4aa3ddde2a11b372926014318000 1121753485244822
b3d841d0386e6c481c151d7f218742a1c1dd4aa3ddde2a11b372926014318000 510612989077058
b3612a3e023187101fb27e0451408ea901782b07a5fc7c9f92be1f59c53d4000 1143734884281847
b3612a3e023187101fb27e0451408ea901782b07a5fc7c9f92be1f59c53d4000 532594388114083
6385520e7d0e95f03e1faf35b527d7c34476766a263a95a5b348bab526a2b000 890376348188409
6385520e7d0e95f03e1faf35b527d7c34476766a263a95a5b348bab526a2b000 279235852020645
df33e7c810e21fa26713f197679585028022b1904ec317b8281b05485152f000 1029465726095329
df33e7c810e21fa26713f197679585028022b1904ec317b8281b05485152f000 418325229927565
a6bef9a34f910573109512484fa6a979c3468df1705f264b5e21847bc70eb000 891792468051792
a6bef9a34f910573109512484fa6a979c3468df1705f264b5e21847bc70eb000 280651971884028
32db7b5f10b4c377b05354b34ca20a19f1ff9d6c73ed726e1ed33441ed0ee000 1170795663880908
32db7b5f10b4c377b05354b34ca20a19f1ff9d6c73ed726e1ed33441ed0ee000 559655167713144
c364f41146a5fef0df1c6ad295fc59158384834350e1f36e0f24719458f1d000 999241629315917
c364f41146a5fef0df1c6ad295fc59158384834350e1f36e0f24719458f1d000 388101133148153
eda7cd9b77865f998591069f115aac6cf77d3235f9c5ade22f9c044aac83a000 941328104653673
eda7cd9b77865f998591069f115aac6cf77d3235f9c5ade22f9c044aac83a000 330187608485909
bd41897bfe042ffd93c4f8284071446d8a1f47a090aefe3fe86280b209c5a000 872146232585324
bd41897bfe042ffd93c4f8284071446d8a1f47a090aefe3fe86280b209c5a000 261005736417560
b3e8568bc4eadbd87d609527d64c441241fa07bdef4e2505c4f2550585a6c000 1080535219841359
b3e8568bc4eadbd87d609527d64c441241fa07bdef4e2505c4f2550585a6c000 469394723673595
18cd29207cd04c383cf7e1a5a269539e1225b056b04a6c3bf9ca8ce18724f000 1034230412665596
18cd29207cd04c383cf7e1a5a269539e1225b056b04a6c3bf9ca8ce18724f000 423089916497832
5bb0e319c598a2543c6f96fd5c5c8f2e77ec11a2eaa188b01c5dde7bacd94000 1089872296205828
5bb0e319c598a2543c6f96fd5c5c8f2e77ec11a2eaa188b01c5dde7bacd94000 478731800038064
26374708cf690c5d95c3b0ee4e60c56760ab839d8478cff8cdc7caf54427d000 1021159839899856
26374708cf690c5d95c3b0ee4e60c56760ab839d8478cff8cdc7caf54427d000 410019343732092
5b962037e8698befb9606a0d7899c9b21e0a7e75c4dd73998dc4fa7f500b9000 886149821630225
5b962037e8698befb9606a0d7899c9b21e0a7e75c4dd73998dc4fa7f500b9000 275009325462461
What meaning each point relate with public key? but puzzle #120 python can not run well and python can not solve |
|
|
|
256 card x Tesla V100 32GB is close to or around 300 billion keys per second. I'm going after a 256 bit key with cpu now.
Can 256 card x Tesla V100 32GB try with 64 bit puzzle #64 still can not crack in one day. and still can not crack 120 bit puzzle #120 by kangaroo need to discover other algorithms more |
|
|
|
|
What performance maximum bitcrack can do on there card?
GeForce RTX 3070
GeForce RTX 3080
GeForce RTX 3090
or
GeForce RTX 30xx
and if price on market is over price most out of stock, if buy GeForce RTX 2080 x 2 double card is ok or not (if can find tow)
most sold out all (or sale with computer build-in)
GeForce RTX 30xx sold out
GeForce RTX 20xx sold out
GeForce RTX 10xx sold out
GeForce RTX 1080 ti x 4 card ok or not (very old card/ if can find / may be second hand)
I looking for card support with can do machine learning (high cuda core) main use not for bitcrack
bitcrack just hobby
|
|
|
|
can someone explain what the exact use case is?
- search for private keys in a list of thousands of public key addresses?
No, BitCrack can not using public key address to find private key - search for a private key of a specific btc address ?
Yes, BitCrack can do (up to you CPU/GPU scan) - search for private keys of a btc puzzle?
Yes, BitCrack can (up to you CPU/GPU scan) this one is same with 2 - other use cases?
recovery bitcoin if you lost but still have some information like range for key scan lost bitcoin (if know closeup range or know position) |
|
|
|
Range is too high and too wide for a reason...Billions of dollars in wallets/private keys. If it was too narrow of a range, no one would use Bitcoin.
It's all relative to your GPU/CPU power. You can't have one GTX 1050 and expect to find keys in 120 bit range over night, or over a decade. But if you have many GPUs, then you have a chance to find keys after time, depending on your GPU power.
challenge is too big for 256 bit it is can not possible find challenge what maximum we can do on records, will be stuck with 120 bit forever same 256 bit or not? if can do 120 may be can use up to 140 bit or some 2-3 level, do far from 160 bit I think all random method is stuck on too high range, next method may be concern about calculate or mix last records is 256 card x Tesla V100 32GB right, How many power for GPU need to solve I try kangaroo cpu only is difference with GPU over 12-15 time, kangaroo require to use with GPU |
|
|
|
you must use %s , not %d
Improve and optimize the project "Kangaroo , VanitySearch " , maybe requires several years of learn VC++
Thank you Yes, I need to learn C++ more kangaroo is powerful random search I think kangaroo need to modify to haves new feature can find key or some tools like GPS find zone ok key and use kangaroo scan, now range is too high too wide range other way is new one algorithm power more than kangaroo |
|
|
|
like sample
GetBase16() result = P.x.: 59EF0C8304BB2FDB2C0F18B262EBDBCB992D0B4CB7AE92358C22406740862D78
GetBase10() result = P.x.: -1235795984
Base10 should be = 40678206325600170710078198845059231036639843417349082810943540381348337692024
Int privKey;
privKey.SetBase16("00000000000000000000000000000000000000000000000000000000000000FF");
printf("A: %s \n", privKey.GetBase10().c_str());
privKey.SetBase16("59ef0c8304bb2fdb2c0f18b262ebdbcb992d0b4cb7ae92358c22406740862d78");
printf("B: %s \n", privKey.GetBase10().c_str());
privKey.SetBase16("FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141");
printf("spec256k1 MAX value: %s \n", privKey.GetBase10().c_str());
=====output Decimal:=====
A: 255
B: 40678206325600170710078198845059231036639843417349082810943540381348337692024
spec256k1 MAX value: 115792089237316195423570985008687907852837564279074904382605163141518161494337
Thanks but, I still not understand code I use code from jacky19790729 I print like this printf("\nP.x %064s\n" , P.x.GetBase16().c_str() ); and I change 16 to 10 printf("\nP.x %d\n" , P.x.GetBase10().c_str() ); result = P.x.: 59EF0C8304BB2FDB2C0F18B262EBDBCB992D0B4CB7AE92358C22406740862D78 result = P.x.: -1235795984 for this I convert from hex to decimal by manual 40678206325600170710078198845059231036639843417349082810943540381348337692024 https://www.rapidtables.com/convert/number/hex-to-decimal.htmlwhy GetBase10() not convert hex to decimal that mean I use wrong code (sorry I am not programmer) |
|
|
|
|
how to use function GetBase10() on kangaroo
I copy GetBase16() and change to GetBase10()
I using GetBase10() with display %d but it is show wring
GetBase10() convert to decimal right?
( and GetBase16() convert to hex)
I compare by print out next line
like sample
GetBase16() result = P.x.: 59EF0C8304BB2FDB2C0F18B262EBDBCB992D0B4CB7AE92358C22406740862D78
GetBase10() result = P.x.: -1235795984
Base10 should be = 40678206325600170710078198845059231036639843417349082810943540381348337692024
|
|
|
|
Is this bolded number and point corresponding to G? Because this will make the problem easier to understand. I'm not really sure what you're trying to do when you say "oscillator". I'm assuming you took the modular inverse G*(10G) -1 to get the 0.1 result? (And not just did straight up division of the 10 by the 1  ) I don't really see the point of using G/10 as the generator point for Kangaroo but it's technically possible if you edit the jump table. I think lostbitcoin need to be show python modify code to can easy compare with C++ code, what want to do |
|
|
|
Wait those spaces in between shouldn't be there, I meant for it to be zero-padded, can you change the code to this? ::printf("Point X: %016X%016X%016X%016X \n", P.x.bits64[3], P.x.bits64[2], P.x.bits64[1], P.x.bits64[0]);
::printf("Point Y: %016X%016X%016X%016X \n", P.y.bits64[3], P.y.bits64[2], P.y.bits64[1], P.y.bits64[0]);Thank you very much last code compare with old one, am I do correct? if correct I will remove all old code that wrong  |
|
|
|
I'm using Kangaroo 2.2
Windows version
Kangaroo 2.2 using C++ language Visual Studio 2019 Community Edition (Free) https://visualstudio.microsoft.com/downloads/compile using project file Kangaroo.sln on folder VC_CUDA102 require to install CUDA version 10.2 I am not programmer it is hard to modify it a lot Kangaroo 2.2 only can work with 120 bit puzzle python it easy to modify but it very very slow and limited with 50 bit puzzle |
|
|
|
Don't do it like that, print it like this using 16-character padding for the hex numbers (they are 64-bit): ::printf("Point X: %16X%16X%16X%16X \n", P.x.bits64[3], P.x.bits64[2], P.x.bits64[1], P.x.bits64[0]);
::printf("Point Y: %16X%16X%16X%16X \n", P.y.bits64[3], P.y.bits64[2], P.y.bits64[1], P.y.bits64[0]); Thank you very much code it is works compare with my test print directly this is 64 bit number right , how can decode to decimal  |
|
|
|
@fx Also: if can get collision point from save.work file by kangaroo.exe may be help to easy to set DP to match with
example
puzzle #40
ec9d5049bd4509aa41e1f5c312de1900d3eac4adba0692a41286b2497e520000 1110317004752
ec9d5049bd4509aa41e1f5c312de1900d3eac4adba0692a41286b2497e520000 106665591802 The Kangaroo.exe and the kangaroo python script you have been running will not match. Notice in your python script the zeros are at the end, they are "trailing". Kangaroo.exe uses leading zeros. Plus, if you use a range, Kangaroo.exe subtracts start range and reduces search by 1 bit. The two will never match unless you do some deep programming modification in one of the programs. EDIT: and the Kangaroo.exe only saves the least (last) bits of the points, where your python script saves the entire point. old python script I use http://bitchain.pl/100btc/pollard_kangaroo.txtand https://github.com/Telariust/pollard-kangaroo/blob/master/pollard-kangaroo-multi.pyfor modify python just code on output display but for process and algorithm I am not modify keep work from original Can you help to modify save function to save full data purpose for read and learning not for use continue works? How can I do make it save full point |
|
|
|
image I try to print P value out but fould like this may be is binary file need to be convert to hex or decimal
You are printing the P value directly, this will make binary output since it's a class, you have to print each of P.x and P.y separately, and each of those is split into 4 64-bit parts called P.x.bits64[0 1 2 3] which all need to be printed with a separate printf() format character. yes, I print directly I don't know C++ command to convert to binary (like 1010101) or convert to hex I try only ::printf("Point: %02X \n", P); (it worsk) look like every value is store and works in binary pk P keyToSearchNeg all is binary (when print directly will get Alien language) |
|
|
|
To my understanding I believe it contains records with each entry (they're in binary if I remember correctly) having the positions of the tame and wild kangaroos, and possibly the number of kangaroos present. I'm not entirely sure, I have to check again.
your correct may be is binary I try to print P Value after check pk and found Point P = secp->ComputePublicKey(&pk); if(P.equals(keyToSearch)) { if(P.equals(keyToSearchNeg)) { P is point of collision point right image I try to print P value out but fould like this may be is binary file need to be convert to hex or decimal  |
|
|
|
|
Show Posts
