how are you subtracting 80000.... from 037e.... and getting 033aeb....
edit: I guess you meant 80000...from the priv key
037e.... - 80000....*G = 033aeb.... (7e1238f7b1ce757df94faa9a2eb261bf0aeb9f84dbf81212104e78931c2a19dc, 65c7118f1c29cb92d28ce0dfd0dc58144fe5572effebc7fee54c4fce3333a6b2) - (769bc75842bff58edc8366ecd78f8950ee4ab2e81359d90f9921fa3d2c4561be,4bf817362fe783bac8dce4cef73f5d4741a177767b7873add5920bffb0d9685f)= 3aeb4f818ca91912a3e50d1b3db196696f82713bae00ba2b53c09a23f1d284a085b2197137256de f6c05a0f105e1b1eee9c10d23b7a4911040a23e891ebb3dc9 Sorry, I'm still not tracking. Where is *G in the above? 037e.... - (80000....*G) = 033aeb.... hex: 80000000000000000000 dec: 604462909807314587353088 pubkey: 03769bc75842bff58edc8366ecd78f8950ee4ab2e81359d90f9921fa3d2c4561be let me clear you more if pubkey in 80 bit, he is doing minus 79bit, and thinking next key will be in 79 bit, but its not exact, its probability next could be in 79 bit, or 78 bit, depand on 80 bit key location, which you all dont know, location mean 80bit start, middle, or in near last area of under 80 bit, you love to play try it again and again btw staudy my 8 month old post and my exact down bit proof here https://bitcointalk.org/index.php?topic=5244940.msg54531996#msg54531996just trying to understand the math a little better. pub - start range * G(generator point) = new pub key in his first example (pub)7e1238f7b1ce757df94faa9a2eb261bf0aeb9f84dbf81212104e78931c2a19dc - (start range) 80000000000000000000 * G = (pub) 3aeb.... real: (pub) 7e1238f7b1ce757df94faa9a2eb261bf0aeb9f84dbf81212104e78931c2a19dc G = 1 or in point pubkey is 0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798 hex 80000000000000000000 = pub 03769bc75842bff58edc8366ecd78f8950ee4ab2e81359d90f9921fa3d2c4561be now play in 2 forms Real - G(pub)*hex = Real - hex(pub) = point to point minus clear  ?? |
|
|
|
how are you subtracting 80000.... from 037e.... and getting 033aeb....
edit: I guess you meant 80000...from the priv key
037e.... - 80000....*G = 033aeb.... (7e1238f7b1ce757df94faa9a2eb261bf0aeb9f84dbf81212104e78931c2a19dc, 65c7118f1c29cb92d28ce0dfd0dc58144fe5572effebc7fee54c4fce3333a6b2) - (769bc75842bff58edc8366ecd78f8950ee4ab2e81359d90f9921fa3d2c4561be,4bf817362fe783bac8dce4cef73f5d4741a177767b7873add5920bffb0d9685f)= 3aeb4f818ca91912a3e50d1b3db196696f82713bae00ba2b53c09a23f1d284a085b2197137256de f6c05a0f105e1b1eee9c10d23b7a4911040a23e891ebb3dc9 Sorry, I'm still not tracking. Where is *G in the above? 037e.... - (80000....*G) = 033aeb.... hex: 80000000000000000000 dec: 604462909807314587353088 pubkey: 03769bc75842bff58edc8366ecd78f8950ee4ab2e81359d90f9921fa3d2c4561be let me clear you more if pubkey in 80 bit, he is doing minus 79bit, and thinking next key will be in 79 bit, but its not exact, its probability next could be in 79 bit, or 78 bit, depand on 80 bit key location, which you all dont know, location mean 80bit start, middle, or in near last area of under 80 bit, you love to play try it again and again btw staudy my 8 month old post and my exact down bit proof here https://bitcointalk.org/index.php?topic=5244940.msg54531996#msg54531996 |
|
|
|
how are you subtracting 80000.... from 037e.... and getting 033aeb....
edit: I guess you meant 80000...from the priv key
037e.... - 80000....*G = 033aeb.... (7e1238f7b1ce757df94faa9a2eb261bf0aeb9f84dbf81212104e78931c2a19dc, 65c7118f1c29cb92d28ce0dfd0dc58144fe5572effebc7fee54c4fce3333a6b2) - (769bc75842bff58edc8366ecd78f8950ee4ab2e81359d90f9921fa3d2c4561be,4bf817362fe783bac8dce4cef73f5d4741a177767b7873add5920bffb0d9685f)= 3aeb4f818ca91912a3e50d1b3db196696f82713bae00ba2b53c09a23f1d284a085b2197137256de f6c05a0f105e1b1eee9c10d23b7a4911040a23e891ebb3dc9 Sorry, I'm still not tracking. Where is *G in the above? 037e.... - (80000....*G) = 033aeb.... hex: 80000000000000000000 dec: 604462909807314587353088 pubkey: 03769bc75842bff58edc8366ecd78f8950ee4ab2e81359d90f9921fa3d2c4561be |
|
|
|
-snip-
interesting solution, but it won’t work if only public keys are known, let's say there is a public key theoretically with private key 1, how to divide the public key by 10 to get public key with 0.1 without knowing the private keys?
i think that not all points have private key, maybe i am wrong For example simple 7/5 it is (3ef1f322847965ee7f8d745af562e6507568fea5316b199f7349a2717021661d,b9a20bc3783777d2681f64d92740817f95b2c169c5db92ce0bab00efb36c0d74) i don`t know if this result have private key.. (n+7)/5 give the same result as for ex. (n+3)/5 = 0x33333333333333333333333333333332f222f8faefdb533f265d461c29a47374 but 0x33333333333333333333333333333332f222f8faefdb533f265d461c29a47374 for (n+3)/5 is correct. becouse if 1 have the same x-coordinate as n-1 so there only 2^255 points with unique x-coordinate. So there can be around 2^255 points that not have private key.(maybe  ) private key : CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCBC88BE3EBBF6D4CFC99751870A691CDCf pub k : 023ef1f322847965ee7f8d745af562e6507568fea5316b199f7349a2717021661d 92633671389852956338856788006950326282270051423259923506084130513214529195471 |
|
|
|
-snip-
interesting solution, but it won’t work if only public keys are known, let's say there is a public key theoretically with private key 1, how to divide the public key by 10 to get public key with 0.1 without knowing the private keys?
i think that not all points have private key, maybe i am wrong For example simple 7/5 it is (3ef1f322847965ee7f8d745af562e6507568fea5316b199f7349a2717021661d,b9a20bc3783777d2681f64d92740817f95b2c169c5db92ce0bab00efb36c0d74) i don`t know if this result have private key.. (n+7)/5 give the same result as for ex. (n+3)/5 = 0x33333333333333333333333333333332f222f8faefdb533f265d461c29a47374 but 0x33333333333333333333333333333332f222f8faefdb533f265d461c29a47374 for (n+3)/5 is correct. becouse if 1 have the same x-coordinate as n-1 so there only 2^255 points with unique x-coordinate. So there can be around 2^255 points that not have private key.(maybe ) each and every point have privatekey |
|
|
|
Try calculate real for 0.1 or 0.001 or 0.0000000000000000000000001  for 0.1 a = 1/3 b = a/2 result = 0.1 |
|
|
|
Interesting thing this elliptic curve.. I didn’t think that there are even fractional points on the curve For ex. if 7/2=3.5 (5cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc,6aebca40ba255960a3178d6d861a54dba813d0b813fde7b5a5082628087264da)
/2=
(592152c398d6c719636a03a6dad64246a5a6814aa62c156b0ce5332f6759b031,72dd2e1d26c233337760c49122a1df67d0aa792b453f97bd29765c83b47ba01d)
and if double this point it will be again 7
(592152c398d6c719636a03a6dad64246a5a6814aa62c156b0ce5332f6759b031,72dd2e1d26c233337760c49122a1df67d0aa792b453f97bd29765c83b47ba01d)
+
(592152c398d6c719636a03a6dad64246a5a6814aa62c156b0ce5332f6759b031,72dd2e1d26c233337760c49122a1df67d0aa792b453f97bd29765c83b47ba01d)
=
(5cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc,6aebca40ba255960a3178d6d861a54dba813d0b813fde7b5a5082628087264da)
3.5 would be in real figure 57896044618658097711785492504343953926418782139537452191302581570759080747172 hex: 7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF5D576E7357A4501DDFE92F46681B20A4 pubkey: 04592152c398d6c719636a03a6dad64246a5a6814aa62c156b0ce5332f6759b03172dd2e1d26c23 3337760c49122a1df67d0aa792b453f97bd29765c83b47ba01d its common practice both odd and even fractional points are exist, you only need to calc it, as i can do it |
|
|
|
Interesting thing this elliptic curve.. I didn’t think that there are even fractional points on the curve For ex. if 7/2=3.5 (5cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc,6aebca40ba255960a3178d6d861a54dba813d0b813fde7b5a5082628087264da)
/2=
(592152c398d6c719636a03a6dad64246a5a6814aa62c156b0ce5332f6759b031,72dd2e1d26c233337760c49122a1df67d0aa792b453f97bd29765c83b47ba01d)
and if double this point it will be again 7
(592152c398d6c719636a03a6dad64246a5a6814aa62c156b0ce5332f6759b031,72dd2e1d26c233337760c49122a1df67d0aa792b453f97bd29765c83b47ba01d)
+
(592152c398d6c719636a03a6dad64246a5a6814aa62c156b0ce5332f6759b031,72dd2e1d26c233337760c49122a1df67d0aa792b453f97bd29765c83b47ba01d)
=
(5cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc,6aebca40ba255960a3178d6d861a54dba813d0b813fde7b5a5082628087264da)
3.5 would be in real figure 57896044618658097711785492504343953926418782139537452191302581570759080747172 hex: 7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF5D576E7357A4501DDFE92F46681B20A4 pubkey: 04592152c398d6c719636a03a6dad64246a5a6814aa62c156b0ce5332f6759b03172dd2e1d26c23 3337760c49122a1df67d0aa792b453f97bd29765c83b47ba01d its common practice |
|
|
|
Congrats to zielar for solving #110 Hope you will solve #115 And more  Create multipubkey ver, it would be better then 1000 GPU's but know you are now under contract and you cant do it, anyway enjoy you GPU pools testing |
|
|
|
I am sure #115, #120 and #125 will go to zielar and no pool can compete. gg.
I disagree. I spent much time to explain in the readme, in this topics or in the code the way to choose best parameters and trap to avoid. Zielar has also to win his life and cannot spend full time to solve these puzzles. It is far from sure that Zielar will win all the races. Anyway, I'm working on the 1.9 in order to integrate mods from PatataFritas and support of -ws for clients. Edit: You have no idea who Zielar is actually. He is a very competent person in his domain, I must say that from time to time I pain to follow him ! Pls Correct, about Race there is no Race, as no one have big gpu pools, and developer saying he have some secret setting and contract with winner, so definatly there is no race, that match was fixed next time guys make bets on fixed match and definatlly you all will win, |
|
|
|
there is more then 35 company asic devices, min 10 company ASIC/FPGA devices and developer fee you can pay to developer for your personal needs, thats best solution You can start go to this 35 companys )))) Your post is a joke I think... 2 most senior developer explain all facts and figure about your Q in details, and you still unable to understand, i think they are trying to educate but joker love to listen jokes only |
|
|
|
there is more then 35 company asic devices, min 10 company ASIC/FPGA devices and developer fee you can pay to developer for your personal needs, thats best solution |
|
|
|
As said by MrFreeDragon this kind of ASIC is dedicated to hashing only and Kangaroo has nothing to do with hashing. To my knowledge no ASIC exist for ECDSA calculation...
Think about ASIC's please buddy ! OpenCL is utopia, I'm sorry for your time and effort. it's better then to bring the CUDA version to perfection. Jean Luc and bitcrack No Asic please, its just waste a time do more on dp research, as just before bitcrack suggested dp settings for 115, there is lot of work pending on dp settings based on bit ranges etc again NO Asic please |
|
|
|
ASIC means Application-Specific Integrated Circuit which means that you have to build a dedicated electronic component to do the job, you probably want to say FPGA ?
I have only a little experience with FPGA programming and powerful development boards are rather expensive, maybe I can try to get one from my job, I don't know but this is not yet planned...
Yes Buddy !https://www.aliexpress.com/popular/asic-bitcoin-miner.html Buddy Bitcoin ASIC miner old used core a 1 25Th/s !!!! https://www.aliexpress.com/item/33042353113.html?spm=a2g0o.detail.1000023.4.3c6e4056Fsb9L6This is a equipment is more adecwate for Kangatoo task i think. Kangaaroo needed a PETA and Terra hash per second not mega or giga. What you think about this ? ? ? Bro without ASIC support progect will have not ggod future I think. Because keys 150 Buyts not awaliable for GPU, no one have a 100 or 200 GPUs. I think it is better to use the maximum available power and this power is not provided by the GPU but ASIC's Br Maybe BitCrack help you for asic design systems, ask BitCrack about this |
|
|
|
ASIC means Application-Specific Integrated Circuit which means that you have to build a dedicated electronic component to do the job, you probably want to say FPGA ?
I have only a little experience with FPGA programming and powerful development boards are rather expensive, maybe I can try to get one from my job, I don't know but this is not yet planned...
Yes Buddy !https://www.aliexpress.com/popular/asic-bitcoin-miner.html Buddy Bitcoin ASIC miner old used core a 1 25Th/s !!!! https://www.aliexpress.com/item/33042353113.html?spm=a2g0o.detail.1000023.4.3c6e4056Fsb9L6This is a equipment is more adecwate for Kangatoo task i think. Kangaaroo needed a PETA and Terra hash per second not mega or giga. What you think about this ? ? ? Bro without ASIC support progect will have not ggod future I think. Because keys 150 Buyts not awaliable for GPU, no one have a 100 or 200 GPUs. I think it is better to use the maximum available power and this power is not provided by the GPU but ASIC's Br Jean luc and zeiler will arrange more then 2000 GPU's, they have source, COBRAS just enjoy all development, and test it as its available |
|
|
|
To Jean Luc if checking 64 bit, and save.work file 1 gb and found in 6 min ./kangaroo -winfo save.work Kangaroo v1.5 Loading: save.work Version : 0 DP bits : 8 Start : 0 Stop : FFFFFFFFFFFFFFF Key : 034B7DBF84F4AF9B9E5B9C15EEDE9C671FF5194FAF5290CE61DF4D2396A9FF22F0 Count : 8657043456 2^33.011 Time : 05:44 DP Size : 518.0/654.0MB DP Count : 16908283 2^24.011 HT Max : 105 [@ 035B51] HT Min : 31 [@ 03A140] HT Avg : 64.50 HT SDev : 8.02 Kangaroos : 4194304 2^22.000 ------- if some tool change pubkey inside save.work, and this save work recalculate within all his record, how much time its take to find changed pubkey for same 64 bit |
|
|
|
after finding 110 puzzle, forum seems silent, no further discussion related to dp, split, client server, chit chat, all goes to home as show ended, and winner goes for celebrate, and dev also goes to rest with family, hope near to finding puzzle 115, all crowed gather again at cinema for next show end |
|
|
|
Congrates to winner giving you new thinking level for 115, from my previous research, some friends here tested but hard for them to believe earlier, just for information check my 2048 pubkeys list https://anonfiles.com/a750taA8n6/100bit_txt dated November 09, 2019, 06:35:23 PM refrence https://bitcointalk.org/index.php?topic=1306983.msg53030914#msg53030914privatekey 110 hex: 35c0d7234df7deb0f20cf7062444 hex: 00000000000000000000000000000000000035c0d7234df7deb0f20cf7062444 dec: 1090246098153987172547740458951748 / 1024 dec: 1064693455228503098191152791945.06640625 hex: D7035C8D37DF7AC3C833DC189 pubkey: 03bb788bea10bedfc4f32aee0f542fc9a0749b5db72a8b094cbbad9fde366f6fa4 hex: D7035C8D37DF7AC3C833DC188 pubkey: 02f2c172df4c4553891bd3c5e8a668a8fd5f5a46d0bc6b109649507180011301ac check my created 100 bit 02f2...301ac and 03bb788... 6fa4 listed in 2048 corresponding keys to 110 puzzle |
|
|
|
what i do not understand why zielar is not solve key yet..
with him power he can already done 4*sqrt(n) simply.
I left the race because I feel like something is wrong here.
there is no negative no positive, there is reverse point in other zone, it is not important zone is connect each other, like pubkey for x is same as ffff....4140 but y is difrent till 128 bit range zone, if you see at last of 128 bit range, last key you match reverse in fff...128bit minus zone, very next key you cant match it in next zone, but i can calc where that key zone will be exist, for detail of experiment i will write with examples later |
|
|
|
Anybody can explain why tame DP shifted to zero? For test i use pubkey 04e6dabff2705a80acc23ae121956873c4ff9fd31cb0faca522c33624e23657e04125c04d29ea83 874332ea8aef3b3467f22665a4970df415be756bcdf5675e569 range ffff...fffffffffffff -dp 4 when i look to hashtable i see this x: 5311104a8554e94684e07e9d8c0d112f d: 0000000000000000000589fd3365a64e Before i was think that programm add begin range to tame DP, but i see now that there no addiding. becouse when 0000000000000000000589fd3365a64e * G get 6b4599cecd305b927a266d311d800005311104a8554e94684e07e9d8c0d112f and this is our x In this case i have a question for what distance for ex.2AA need if range start from ffff ok, when we will start range from for ex. 2^109 in that case all distance before will be useless? becouse they are will produce x-coordinates that is before range 2^109. I do not understand this moment.. Because the Tame Kangaroos are dependent only on the interval size, while the Wild Kangaroos are dependent on the interval size and the public key. We want to keep the algorithm as generic as possible, and also the ability to reuse the Tame Kangaroos for multiple key searches. As relating to the Wild Kangaroos, [working_public_key] = [(original_public_key) - (beginning_range)*(secp256k1_generator_point)]. [distinguished_point] = [(+-traveled_distance)*(secp256k1_generator_point)] + [working_public key] You will need to add back the (beginning_range) when there’s a collision to solve for the (original_public_key). " and also the ability to reuse the Tame Kangaroos for multiple key searches. " can we aspect multi pubkeys support coming, maybe yes or maybe no, its all depand dev thinking, maybe he prefer to work a lot more calc for client/server, or maybe he he think add this func and then optimize all thing togather |
|
|
|
|
Show Posts
