Search content
Sort by
Showing 20 of 84 results by ssxb
lets guess
P1 is Even
P2 is Odd
post your guess and lets get answer in private key from creator
it was first what i checked. It is not correlated (
Enjoy your time
@brainless remember me
as far as I know with calculation, you guys cant determine but here is silly answer if you guys start mapping it from center of curve to each side (positive & negative side / or call it even or odd) perhaps in age of Altron you will know what point is that ~ i mean positive or negative
example
curve centers :
0300000000000000000000003b78ce563f89a0ed9414f5aa28ad0d96d6795f9c63
0200000000000000000000003b78ce563f89a0ed9414f5aa28ad0d96d6795f9c63
now if you start mapping points, you will get
....
025699b93fc6e1bd29e09a328d657a607b4155b61a6b5fcbedd7c12df7c67df8f5
03c62c910e502cb615a27c58512b6cc2c94f5742f76cb3d12ec993400a3695d413
0300000000000000000000003b78ce563f89a0ed9414f5aa28ad0d96d6795f9c63
0200000000000000000000003b78ce563f89a0ed9414f5aa28ad0d96d6795f9c63
02c62c910e502cb615a27c58512b6cc2c94f5742f76cb3d12ec993400a3695d413
035699b93fc6e1bd29e09a328d657a607b4155b61a6b5fcbedd7c12df7c67df8f5
....
like this points will shrink back toward their min or max value with filling of 02 or 03
until
0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798
....
0300000000000000000000003b78ce563f89a0ed9414f5aa28ad0d96d6795f9c63
0200000000000000000000003b78ce563f89a0ed9414f5aa28ad0d96d6795f9c63
....
0379be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798
and only known way to know which point is on which side is "non" hahaha.
chill and happy brute force while calling your luck.
Hi,
Please , can you write a little tutorial on usage?
did you look at readme.md on github?Please , can you write a little tutorial on usage?
first of all set -t parametr as 256 or 512
next set -b equil to SM count of your card
next set -p start from 128
then set -w as max as possible to your gpu memory, check -htsz params
-w 31 -htsz 29 need around 64GB of RAM to generate all arrays
-w 30 -htsz 28 need around 32GB of RAM to generate all arrays
-w 29 -htsz 28
-w 28 -htsz 27
-w 27 -htsz 25
if you will have free gpu memory you can increase -p or -b or -t (all params multiple of 2)
some great work from your side , appreciate
just a quick question, do you have any plan to enhanced it for 120bit or more to perform better than JLK?
I'm testing with the divisor keys on a smaller range, but its not solving the key with keyhunt. does it work the same with xpoint mode?
you need to adjust K and N as smaller range will be not solved if power of K and N is more than range count or if number of keys will be more or less than power of your hardware.
remember tweak is seriously needed while keeping K and N according to your hardware power as well as adjust K and N according to number of keys you will load in software ~ do the test again and again and again
@Etar 
i seriously believing that there will some way to use power of GPU cores and process all BSGS inside computer memory perhaps this will give some crazy power which never been discovered or there will be bottle neck but you can confirm it when you will build such program.
assume if you have power of keyhunt and than you will make bloom in SSD [7000+ read write speed gen4]
RAM bpfile elements bpfile size bloom size
8 GB 1000000000 32 GB 5.02 GB
32 GB 5000000000 160 GB 25.11 GB
128 GB 22000000000 704 GB 110.47 GB
500 GB 90000000000 2.9 TB 451.92 GB
based on above table you can increase speed if you will utilize both bloom+bp https://github.com/iceland2k14/bsgs
so CPU cores are less powerful than cuda and i was thinking [not sure possible or not] if we load all bp in RAM and use some bloom in GPU memory perhaps their will be some dramatic speed boost
i seriously believing that there will some way to use power of GPU cores and process all BSGS inside computer memory perhaps this will give some crazy power which never been discovered or there will be bottle neck but you can confirm it when you will build such program.
assume if you have power of keyhunt and than you will make bloom in SSD [7000+ read write speed gen4]
RAM bpfile elements bpfile size bloom size
8 GB 1000000000 32 GB 5.02 GB
32 GB 5000000000 160 GB 25.11 GB
128 GB 22000000000 704 GB 110.47 GB
500 GB 90000000000 2.9 TB 451.92 GB
based on above table you can increase speed if you will utilize both bloom+bp https://github.com/iceland2k14/bsgs
so CPU cores are less powerful than cuda and i was thinking [not sure possible or not] if we load all bp in RAM and use some bloom in GPU memory perhaps their will be some dramatic speed boost
Quote
you got big mouth but less sense and knowledge Grin
i hate to tell you that grow up your knowledge & perhaps things will get more clear.
1 > 80 key not 80 keys [single key] [random mode with 4.7 Ekeys/sec] [4300000000000000000 keys/sec] [3BACAB37B62E0000 keys/sec][ whole 65 range in 1 sec]. now compare with bsgscuda
with reference key in range 49dccfd96dc5df56487436f5a1b18c4f5d34f65ddb48cb5e0000000000000000:49dccfd96dc5df56487436f5a1b18c4f5d34f65ddb48cb5effffffffffffffff. let me guess 3080 took with full
optimization around 17 second but keyhunt took just 1 second. even i have to reduce k and n value to reduce speed for this Grin.
2 > do your research and than find how many keys you will get while doing 120 to 2^40 divisor [lol]. if you will load 2 keys, you will make keyhunt speed half and what about billion keys . speed will be just like your mind
processing to understand my answer.
Your English reading or comprehension is less sense and knowledge.i hate to tell you that grow up your knowledge & perhaps things will get more clear.
1 > 80 key not 80 keys [single key] [random mode with 4.7 Ekeys/sec] [4300000000000000000 keys/sec] [3BACAB37B62E0000 keys/sec][ whole 65 range in 1 sec]. now compare with bsgscuda
with reference key in range 49dccfd96dc5df56487436f5a1b18c4f5d34f65ddb48cb5e0000000000000000:49dccfd96dc5df56487436f5a1b18c4f5d34f65ddb48cb5effffffffffffffff. let me guess 3080 took with full
optimization around 17 second but keyhunt took just 1 second. even i have to reduce k and n value to reduce speed for this Grin.
2 > do your research and than find how many keys you will get while doing 120 to 2^40 divisor [lol]. if you will load 2 keys, you will make keyhunt speed half and what about billion keys . speed will be just like your mind
processing to understand my answer.
I never said anything about 80 keys...you are saying you found 80 key, I took that as a single key in an 80 bit range, not 80 keys because you did not pluralize the word key. So with that, I merely said instead of trying to get someone to reprogram BSGS Cuda for multi key, run keyhunt, since it already supports multi key and if you think it is faster, then break up 120 key into however many keys you want to, 2^5, 2^20, 2^40, or however many you want to and let that program eat. I said 2^40 specifically because you said an 80 key in a blink of an eye; so 2^120/2^40 = 2^80; if you found one 80 key in a blink of an eye, maybe you find the 120 key in 80 bit range in 2 blinks of an eye.
BSGS Cuda, can find 65 bit key in less than a second, it all depends on your hardware.
you say
Quote
if you will load 2 keys, you will make keyhunt speed half
the same will happen to BSGS Cuda; so I am not sure what your point is really. maybe you find the 120 key in 80 bit range in 2 blinks of an eye.
ok learn basic knowledge of divisor bro , if you will do 32 times, only one key will be from 5 bit down range on unknown position other all will from uper bit ranges on exact same distance from their references values.
now if you will do 2^40, you will have 1208925819614629174706176 reference values in 256 bit range and only one of key will be in 40bit range other all keys will from uper bits on exact distance from their respectively reference values.
now how the hell you can work with such large number of keys and the line you said that get the 2^40 is aggressive comment without knowing my intention.
my intention is that i already did divisor of 32 and loaded keys in Keyhunt and running it right now and i know how much speed and power i am getting from that , but i just dont know power of BSGScuda if i will load 32 keys parallel in that. so i asked Etar that if he can make such possibility who knows BSGS will out performed keyhunt.
now come to the point in above post Etar said that my program is good until 80 bit and above that use JL kangaroo so i was comparing it with BSGS of alberto but i found that CPU based BSGS is more powerful than 3080 if you have good specification hardware but same time BSGScuda is better than keyhunt[CPU] if you dont have enough power of CPU and memory.
1 > 80 key not 80 keys [single key] [random mode with 4.7 Ekeys/sec] [4300000000000000000 keys/sec] [3BACAB37B62E0000 keys/sec][ whole 65 range in 1 sec]. now compare with bsgscuda
with reference key in range 49dccfd96dc5df56487436f5a1b18c4f5d34f65ddb48cb5e0000000000000000:49dccfd96dc5df56487436f5a1b18c4f5d34f65ddb48cb5effffffffffffffff. let me guess 3080 took with full
optimization around 17 second but keyhunt took just 1 second. even i have to reduce k and n value to reduce speed for this
.2 > do your research and than find how many keys you will get while doing 120 to 2^40 divisor [lol]. if you will load 2 keys, you will make keyhunt speed half and what about billion keys . speed will be just like your mind
processing to understand my answer.
I don`t have 3080 card but i think speed will be around 1400Mkeys x BabyArraySize
windows10 eat 20% of GPU memory so 3080 should have 8192 free memory, so we can use -w 30
Totaly 1400mkeys = 2^30.38 and baby array x2 = 2^31 and full perfomance = 2^61.38 and to check full 2^64 need 6.14s
Only Kangaroo can solve keys faster then bsgs or keyhunt or whatever.
Bsgs cuda created only because i didn`t find bsgs for gpu (maybe it useless app i don`t know)
i am not arguing on your math but if you have time and hardware please just try to do research on keyhunt [CPU+memory ] and by the way i appreciate your programing skills toward cuda its really impressive and wish some day you will enhanced it more to overcome 120 and by the way i know one guy who is running it with 9+Ekeys/sec [yoyodapro].
and just to let you know i figure out way to reduce [120bit] key until 90bit with 186384565 keys & guaranteed 15 keys are in range. but with divisor you can get only get 1 key out of 1073741824 if you want to reach 90bit.
i loaded all keys in keyhunt and i am trying my luck but on other side i was hoping if we can figure it out how to load multi keys with cudabsgs . so i will keep busy my 3080 for that as that one is just sitting idle now.
well can you please tune it for parallel search for pubs , i undertand speed will drop but its still worth to try .. can you?
Possible to make pseudo-parallelism (this means finding the keys sequentially at each giant step). But the speed will drop in multiples of the number of search keys.
For ex. with search 1 public key your speed is 1000mkeys/s. if you setup 10 keys the speed will drop to 100mkey/s, with 1000keys speed drop to 1mkeys/s
By the way the search time for 16 keys will be exactly the same, either in a sequential search or in a pseudo-parallel.
Got it but just as example if you do 32 divisor and load 32 keys , assume if key is on position 1~ lucky you. but if the key is on position 30 program will hang with full range scan for key 1 and than will be back to second (my guess ~ didn't test your program) one perhaps after this century
but one thing that i noticed Alberto keyhunt [updated recently] is way too faster than BSGScuda [although both have different way]. i solved 80 key with blink of eye but that one need serious K and N optimization ~ do the wrong K and N you will never reach the goal. i am not sure if you guys have a chance to test that one Alberto KEYHUNT you will find it interesting.
but dark fact is keyhunt is ram eating bug
so if have less ram (minimum 128gb) no point to compare it with BSGScuda perhaps in that case BSGScuda will do way better than Keyhunt. and if you are going for this:
Quote
Got it but just as example if you do 32 divisor and load 32 keys , assume if key is on position 1~ lucky you
then just do your 32 divisor and let it search each pubkey for 1 minute; maybe lucky you.you got big mouth but less sense and knowledge
i hate to tell you that grow up your knowledge & perhaps things will get more clear.
1 > 80 key not 80 keys [single key] [random mode with 4.7 Ekeys/sec] [4300000000000000000 keys/sec] [3BACAB37B62E0000 keys/sec][ whole 65 range in 1 sec]. now compare with bsgscuda
with reference key in range 49dccfd96dc5df56487436f5a1b18c4f5d34f65ddb48cb5e0000000000000000:49dccfd96dc5df56487436f5a1b18c4f5d34f65ddb48cb5effffffffffffffff. let me guess 3080 took with full
optimization around 17 second but keyhunt took just 1 second. even i have to reduce k and n value to reduce speed for this
.2 > do your research and than find how many keys you will get while doing 120 to 2^40 divisor [lol]. if you will load 2 keys, you will make keyhunt speed half and what about billion keys . speed will be just like your mind
processing to understand my answer.
This is the maximum that I can squeeze out of my 2080ti card:
16 pubkeys from JLP example solved in 1m 23s
first for GPU without xpoint position, only xpoint 32bit + size htsz, totaly 32+29 = 61bit per xpoint
Second for host usage with xpoint position
Utilized 9008Mb of GPU memory.
Hi Etar what settings have you used to get that, and could you recommend what to use for a 3080?16 pubkeys from JLP example solved in 1m 23s
Code:
NewFINDpubkey= (2375c86aa2a807fd50e4b1a2a65820244e704b8eabc8eb4dc0517393aff0c647, fad56264ae29d620205a68792091b64ae262bba359f8d013ce904d595e790ccf)
***************************
GPU#0 Cnt:0000000000000000000000000000000000000000000000000000000000000001
GPU#0 Cnt:0000000000000000000000000000000000000000000000003388000000000001 823MKey/s x1073741824 2^29.69 x2^31=2^60.69
GPU#0 Cnt:0000000000000000000000000000000000000000000000006754000000000001 826MKey/s x1073741824 2^29.69 x2^31=2^60.69
***********GPU#0************
KEY!!>49dccfd96dc5df56487436f5a1b18c4f5d34f65ddb48cb5e7ad38337c7f173c7
Pub: 55b95bef84a6045a505d015ef15e136e0a31cc2aa00fa4bca62e5df215ee981b3b4d6bce33718dc6cf59f28b550648d7e8b2796ac36f25ff0c01f8bc42a16fd9
****************************
Found in 5 seconds
GPU#0 job finished
Working time 00:01:23s
Total time 00:06:00s
Used two hashtables:***************************
GPU#0 Cnt:0000000000000000000000000000000000000000000000000000000000000001
GPU#0 Cnt:0000000000000000000000000000000000000000000000003388000000000001 823MKey/s x1073741824 2^29.69 x2^31=2^60.69
GPU#0 Cnt:0000000000000000000000000000000000000000000000006754000000000001 826MKey/s x1073741824 2^29.69 x2^31=2^60.69
***********GPU#0************
KEY!!>49dccfd96dc5df56487436f5a1b18c4f5d34f65ddb48cb5e7ad38337c7f173c7
Pub: 55b95bef84a6045a505d015ef15e136e0a31cc2aa00fa4bca62e5df215ee981b3b4d6bce33718dc6cf59f28b550648d7e8b2796ac36f25ff0c01f8bc42a16fd9
****************************
Found in 5 seconds
GPU#0 job finished
Working time 00:01:23s
Total time 00:06:00s
first for GPU without xpoint position, only xpoint 32bit + size htsz, totaly 32+29 = 61bit per xpoint
Second for host usage with xpoint position
Utilized 9008Mb of GPU memory.
Thanks Relic
i will post mine 3080 setting later today ~ once i will be back at home
well can you please tune it for parallel search for pubs , i undertand speed will drop but its still worth to try .. can you?
Possible to make pseudo-parallelism (this means finding the keys sequentially at each giant step). But the speed will drop in multiples of the number of search keys.
For ex. with search 1 public key your speed is 1000mkeys/s. if you setup 10 keys the speed will drop to 100mkey/s, with 1000keys speed drop to 1mkeys/s
By the way the search time for 16 keys will be exactly the same, either in a sequential search or in a pseudo-parallel.
Got it but just as example if you do 32 divisor and load 32 keys , assume if key is on position 1~ lucky you. but if the key is on position 30 program will hang with full range scan for key 1 and than will be back to second (my guess ~ didn't test your program) one perhaps after this century
but one thing that i noticed Alberto keyhunt [updated recently] is way too faster than BSGScuda [although both have different way]. i solved 80 key with blink of eye but that one need serious K and N optimization ~ do the wrong K and N you will never reach the goal. i am not sure if you guys have a chance to test that one Alberto KEYHUNT you will find it interesting.
but dark fact is keyhunt is ram eating bug
so if have less ram (minimum 128gb) no point to compare it with BSGScuda perhaps in that case BSGScuda will do way better than Keyhunt. This is the maximum that I can squeeze out of my 2080ti card:
16 pubkeys from JLP example solved in 1m 23s
first for GPU without xpoint position, only xpoint 32bit + size htsz, totaly 32+29 = 61bit per xpoint
Second for host usage with xpoint position
Utilized 9008Mb of GPU memory.
16 pubkeys from JLP example solved in 1m 23s
Code:
NewFINDpubkey= (2375c86aa2a807fd50e4b1a2a65820244e704b8eabc8eb4dc0517393aff0c647, fad56264ae29d620205a68792091b64ae262bba359f8d013ce904d595e790ccf)
***************************
GPU#0 Cnt:0000000000000000000000000000000000000000000000000000000000000001
GPU#0 Cnt:0000000000000000000000000000000000000000000000003388000000000001 823MKey/s x1073741824 2^29.69 x2^31=2^60.69
GPU#0 Cnt:0000000000000000000000000000000000000000000000006754000000000001 826MKey/s x1073741824 2^29.69 x2^31=2^60.69
***********GPU#0************
KEY!!>49dccfd96dc5df56487436f5a1b18c4f5d34f65ddb48cb5e7ad38337c7f173c7
Pub: 55b95bef84a6045a505d015ef15e136e0a31cc2aa00fa4bca62e5df215ee981b3b4d6bce33718dc6cf59f28b550648d7e8b2796ac36f25ff0c01f8bc42a16fd9
****************************
Found in 5 seconds
GPU#0 job finished
Working time 00:01:23s
Total time 00:06:00s
Used two hashtables:***************************
GPU#0 Cnt:0000000000000000000000000000000000000000000000000000000000000001
GPU#0 Cnt:0000000000000000000000000000000000000000000000003388000000000001 823MKey/s x1073741824 2^29.69 x2^31=2^60.69
GPU#0 Cnt:0000000000000000000000000000000000000000000000006754000000000001 826MKey/s x1073741824 2^29.69 x2^31=2^60.69
***********GPU#0************
KEY!!>49dccfd96dc5df56487436f5a1b18c4f5d34f65ddb48cb5e7ad38337c7f173c7
Pub: 55b95bef84a6045a505d015ef15e136e0a31cc2aa00fa4bca62e5df215ee981b3b4d6bce33718dc6cf59f28b550648d7e8b2796ac36f25ff0c01f8bc42a16fd9
****************************
Found in 5 seconds
GPU#0 job finished
Working time 00:01:23s
Total time 00:06:00s
first for GPU without xpoint position, only xpoint 32bit + size htsz, totaly 32+29 = 61bit per xpoint
Second for host usage with xpoint position
Utilized 9008Mb of GPU memory.
i optimized parameters and the key
"59A3BFDAD718C9D3FAC7C187F1139F0815AC5D923910D516E186AFDA28B221DC994327554CED887 AAE5D211A2407CDD025CFC3779ECB9C9D7F2F1A1DDF3E9FF8"
i solved in 17 seconds
well can you please tune it for parallel search for pubs , i undertand speed will drop but its still worth to try .. can you?
Shor's algorithm can be used to break elliptic curve cryptography by computing discrete logarithms on a hypothetical quantum computer. The latest quantum resource estimates for breaking a curve with a 256-bit modulus (128-bit security level) are 2330 qubits and 126 billion Toffoli gates.
Link to resource?
https://en.wikipedia.org/wiki/Elliptic-curve_cryptography
look for Quantum computing attacks in the end
Deny it again if you can.
Shor's algorithm can be used to break elliptic curve cryptography by computing discrete logarithms on a hypothetical quantum computer. The latest quantum resource estimates for breaking a curve with a 256-bit modulus (128-bit security level) are 2330 qubits and 126 billion Toffoli gates. In comparison, using Shor's algorithm to break the RSA algorithm requires 4098 qubits and 5.2 trillion Toffoli gates for a 2048-bit RSA key, suggesting that ECC is an easier target for quantum computers than RSA. All of these figures vastly exceed any quantum computer that has ever been built, and estimates place the creation of such computers at a decade or more away.
Supersingular Isogeny Diffie–Hellman Key Exchange provides a post-quantum secure form of elliptic curve cryptography by using isogenies to implement Diffie–Hellman key exchanges. This key exchange uses much of the same field arithmetic as existing elliptic curve cryptography and requires computational and transmission overhead similar to many currently used public key systems.
In August 2015, the NSA announced that it planned to transition "in the not distant future" to a new cipher suite that is resistant to quantum attacks. "Unfortunately, the growth of elliptic curve use has bumped up against the fact of continued progress in the research on quantum computing, necessitating a re-evaluation of our cryptographic strategy."
Shor's algorithm can be used to break elliptic curve cryptography by computing discrete logarithms on a hypothetical quantum computer. The latest quantum resource estimates for breaking a curve with a 256-bit modulus (128-bit security level) are 2330 qubits and 126 billion Toffoli gates. In comparison, using Shor's algorithm to break the RSA algorithm requires 4098 qubits and 5.2 trillion Toffoli gates for a 2048-bit RSA key, suggesting that ECC is an easier target for quantum computers than RSA. All of these figures vastly exceed any quantum computer that has ever been built, and estimates place the creation of such computers at a decade or more away.
Supersingular Isogeny Diffie–Hellman Key Exchange provides a post-quantum secure form of elliptic curve cryptography by using isogenies to implement Diffie–Hellman key exchanges. This key exchange uses much of the same field arithmetic as existing elliptic curve cryptography and requires computational and transmission overhead similar to many currently used public key systems.
In August 2015, the NSA announced that it planned to transition "in the not distant future" to a new cipher suite that is resistant to quantum attacks. "Unfortunately, the growth of elliptic curve use has bumped up against the fact of continued progress in the research on quantum computing, necessitating a re-evaluation of our cryptographic strategy."
Would you please stop spamming ssxb?
Super annoying.
spamming? lol...if merely saying/doing what he has said/done to others is "spamming" then I guess the meat is in the can...so be fair and tell him not to "spam" others. My first reply to ssxb is labeled spamming lol...Super annoying.
you and a.a have no idea what you guys are doing , in fun i reveal some real engineering shit but no one picked the point , i guess enough is enough i will go other way ~ chill the soda out
Quote
Only problem is, that you are only getting one in the lower bruteforcable range and then can jump from that one and can determine the other 32 private keys.
Prime example...your statement is not true as to what I am saying/doing.I am not jumping from any key to another key...there is no magic jumping.
I can take the pubkeys generated, and search a different range, not the "lower bruteforcable range", and find the priv key to the original pub key. All pub keys created after dividing can be found in a same sized range. And my tests so far, I am actually finding 2 pubs per range that leads me back to original pub key's priv key.
in case you are wondering , i can subtract 120 and can give you billions of keys from same range which will lead you back to orignal key. dont know why you guys are repeating all old stuffs.
enough fun from my side so i am serious right now on this. believe me or not you guys are working only on 2 methods but there are so many hidden ways to jump forward/back to orignal key.
but one issue is there just one issue. those all methods all failing because all public keys are repeating the relationship on 1 key distance. what i am talking only those guys will know who had a experience with such jumps or reverse engineering. my project is still under extensive experiments and i have strong believe i will reach to target soon and will share a tip with you guys as well.
#Soda
dont forget you need to burn the universe as fuel to break this BTC keep in mind guys target is bigger than you are expecting. so do a part of yours and hope to get it. but who knows this all conversation knowledge will give some clue to our grand son's specifically brainless grand son as i am not leaving much suspense in my conversations as treasure to my grand son otherwise who know he will come and beat a shit out from my grave
Quote
Only problem is, that you are only getting one in the lower bruteforcable range and then can jump from that one and can determine the other 32 private keys.
Prime example...your statement is not true as to what I am saying/doing.I am not jumping from any key to another key...there is no magic jumping.
I can take the pubkeys generated, and search a different range, not the "lower bruteforcable range", and find the priv key to the original pub key. All pub keys created after dividing can be found in a same sized range. And my tests so far, I am actually finding 2 pubs per range that leads me back to original pub key's priv key.
in case you are wondering , i can subtract 120 and can give you billions of keys from same range which will lead you back to orignal key. dont know why you guys are repeating all old stuffs.
enough fun from my side so i am serious right now on this. believe me or not you guys are working only on 2 methods but there are so many hidden ways to jump forward/back to orignal key.
but one issue is there just one issue. those all methods all failing because all public keys are repeating the relationship on 1 key distance. what i am talking only those guys will know who had a experience with such jumps or reverse engineering. my project is still under extensive experiments and i have strong believe i will reach to target soon and will share a tip with you guys as well.
#Soda
30240 came from astro
360 days in year
7 day in week
12 month in year
360 x 7 x 12 = 30240
Full ver
2520
360 x 7 = 2520
For complete numerology 30240 will work
2520 will make u stuck in some part of calc
360 days in year
7 day in week
12 month in year
360 x 7 x 12 = 30240
Full ver
2520
360 x 7 = 2520
For complete numerology 30240 will work
2520 will make u stuck in some part of calc
2 447 7572 564114
3 596 9536 752152
4 631 10096 1128228
6 894 14304 1504304
8 1192 15144 2256456
12 1262 20192 3008608
16 1788 28608 4512912
24 1893 30288 6017216
32 2384 40384 9025824
48 2524 60576 18051648
64 3576 94019
96 3786 121152
149 4768 188038
192 5048 282057
298 7152 376076
30288 what other guys call 30240 as i call this shit a 30288
WTF ?
dude you are going against your magic numbers , somebody please hand over me tomato ketchup i will assume it soda and drink it today
where the hell i left my .75 btc? sorry i forgot
so talk about idea guys
here is idea , brainless make a fire here and instead of drinking soda i throw all my soda to extinguish this shit but all in vein ~ now when i am out from all soda cans . my mind start working again and got a idea
why the hell i should not ask brainless to share a script which he is using to reduce the shit out of keys.
brainless : could you please be so kind and share your genius script so i can see what u did in this summer.
as i cant see a working logic here and i have to sale that script to a.a to buy a soda cans
here is idea , brainless make a fire here and instead of drinking soda i throw all my soda to extinguish this shit but all in vein ~ now when i am out from all soda cans . my mind start working again and got a idea
why the hell i should not ask brainless to share a script which he is using to reduce the shit out of keys.
brainless : could you please be so kind and share your genius script so i can see what u did in this summer.
as i cant see a working logic here and i have to sale that script to a.a to buy a soda cans
30240 came from astro
360 days in year
7 day in week
12 month in year
360 x 7 x 12 = 30240
Full ver
2520
360 x 7 = 2520
For complete numerology 30240 will work
2520 will make u stuck in some part of calc
360 days in year
7 day in week
12 month in year
360 x 7 x 12 = 30240
Full ver
2520
360 x 7 = 2520
For complete numerology 30240 will work
2520 will make u stuck in some part of calc
come to papa
@WP
I take a 255 bit pubkey, divide it by 33. Now I only have to search the 2^255/33 ~ 2^252 range to find the key. What a reduction.
@ssxb
Well but what is the new knowledge?
I take a 255 bit pubkey, divide it by 33. Now I only have to search the 2^255/33 ~ 2^252 range to find the key. What a reduction.
@ssxb
Well but what is the new knowledge?
Well but what is the new knowledge?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
hope you get the point ~
congratulation to me today i learnt how to generate numbers in series from 1 to 32 with python. such a genius (wile-e-coyote)
now i am telling you guys dont follow me you can hardly program this. (My brainless theory)
i am drinking soda right now and watching screen (no red wine as i am Muslim 
) 32 keys are in front of me telling me that we are relative to each other and no matter from where you will jump toward us we will be always on distance of 1 with each other. if you knows the private keys you will find these keys are lying but hell yaa man when you work blindly on public keys without knowing private keys. you will know they are having relation on curve but not on 1 key distance from each other. fck math is beautiful . curse you elliptic curve sorry glass slipped from my hand i need to clean the table 
) 32 keys are in front of me telling me that we are relative to each other and no matter from where you will jump toward us we will be always on distance of 1 with each other. if you knows the private keys you will find these keys are lying but hell yaa man when you work blindly on public keys without knowing private keys. you will know they are having relation on curve but not on 1 key distance from each other. fck math is beautiful . curse you elliptic curve sorry glass slipped from my hand i need to clean the table