Bitcoin Forum
June 16, 2024, 11:41:18 AM *
News: Voting for pizza day contest
 
   Home   Help Search Login Register More  
Pages: « 1 2 [3] 4 »  All
  Print  
Author Topic: Baby Step Giant Step Combined Efforts to Find 1.2 Bitcoin  (Read 1840 times)
This is a self-moderated topic. If you do not want to be moderated by the person who started this topic, create a new topic. (2 posts by 1+ user deleted.)
WanderingPhilospher (OP)
Full Member
***
Offline Offline

Activity: 1078
Merit: 219

Shooters Shoot...


View Profile
March 06, 2021, 04:56:25 AM
 #41

Everyone, I updated the github page. I published a new release.

https://github.com/WanderingPhilosopher/BSGS/releases/tag/V2.0

The only difference in this version and Jean Luc's original version is that my version will save a text file containing the public and private keys.  So it's back to searching the 120 bit range since the pub key shift seemed to cause confusion and now you can search your own range and pubkeys with this version. I plan on uploading a python script and batch file that will auto generate a random range and the batch file to search that random range.  The python script will also create a ranges checked file so that we can still share which ranges we have checked; so still can be a combined effort.

I also deleted all of the old exe files and batch files off the main page.  Python and batch starting script will be released soon...
WanderingPhilospher (OP)
Full Member
***
Offline Offline

Activity: 1078
Merit: 219

Shooters Shoot...


View Profile
March 06, 2021, 05:34:56 AM
 #42

Here is the python script to automate the process (save it as Starter.py to run the automated process):

Code:
[code]
#Amateur Coding by the Wandering Philosopher
import binascii, hashlib, sys, codecs, multiprocessing, time, random, os, subprocess
from datetime import datetime
random.seed(datetime.now())
import os
arq1 = open('input.txt', 'w')
arq2 = open('Ranges_SearchedUpdate.txt', 'a')
y = ("FFFFFFFFFFFFFF")
Y1 = int(y, 16)

for x in range(1):
    
    startrange  = 0xC001000FFFFFFFFFFFFFFFFFFFFFFF
    endrangexxx = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF
    rgen = random.randrange(startrange, endrangexxx)
    rgenz = hex(rgen + Y1).rstrip("L").lstrip("0x").upper()
    arq1.write("4000000" + '\n' + hex(rgen).rstrip("L").lstrip("0x") + '\n' + rgenz + '\n' + "02ceb6cbbcdbdf5ef7150682150f4ce2c6f4807b349827dcdbdd1f2efa885a2630")
    arq2.write(hex(rgen).rstrip("L").lstrip("0x").upper() + '\n' + rgenz + '\n')
arq1.close()

And here is the batch file I use to start the automation:
Code:
:while1
start /wait /min Starter.py
start /wait /min BSGS.exe -t 4 input.txt

goto :while1

I have it set up to randomly generate a 56 bit range and then the BSGS checks it. Using 4 threads, it takes me under 2 minutes to run the range. If you plan on sharing/contributing the ranges you've scanned, please leave it at 56 bits (leave the y and Y1 alone in the python script). Also, if you want this to run with zero chances of missing the key, do not tinker with -t 0 or the baby step size of "4000000" . If you just want to use it for your own personal use, tweak any and everything. Enjoy![/code]
fxsniper
Member
**
Offline Offline

Activity: 406
Merit: 45


View Profile
March 06, 2021, 07:00:08 AM
 #43

Some problem with Baby Step Giant Step

There is no issue with Baby Step Giant Step. If you are searching smaller ranges or different ranges than what mine is programmed to do, use Jean Luc's version.

BSGS is great at finding keys in smaller ranges, extremely fast and with 100% guarantee if the key is in specified range or not. If you run a smaller range and don't find a key that you know is in that range, then your setting may be off.

If you get a warning, like this one (Warning, range is not a multiple of nbThread) when running BSGS, you may or may not find the key. Your settings have to be right. I can get that warning if I run a range of 1 to FFFFFFFFFF, but running range 0 to FFFFFFFFFF, I do not get that warning. I always make sure my ranges are of FFFFFFFFFF, FFFFFFFFFFF, or FFFFFFFFFFFF in size.

The baby step size also correlates to how much RAM you will use, so don't exceed what your PC has.

Also, if you run a big range, above 64 bits, BSGS will take time. If you look at Jean Luc's test, it was taking him 15 to 30 minutes to find keys in a 64 bit range, if you go above 64 bit, that time will increase, especially if using a small baby step setting.

I designed my program to be automated, meaning it automatically calculates correct settings, creates the input file, and generates a random range (one where the #120 can be found); and prints out key information if found. Mine is no better or faster than Jean Luc's, it's the same minus the items just mentioned.

Thank

I have problem with use BSGS JeanLucPons version
open program very long time to can find key

but you BSGS version (on bath file set version) work faster and can find key success
I try with in.txt new one file you version still work fine
but JeanLucPons not work fast , I try set baby step to both small side and large size still run problem , some time program fond key but before work open it very long time
test both small range and large rang
fxsniper
Member
**
Offline Offline

Activity: 406
Merit: 45


View Profile
March 06, 2021, 09:15:16 AM
 #44


I think I found problem

1. Setting baby step to low and too high
2. range too high

if baby step too low BSGS.exe  work slow  (I set 100 and try 1000 very slow)
if baby step too high BSGS.exe  work slow  (I set 1000000000 very slow)

range low BSGS.exe will work fast
range very high BSGS.exe will work slow

rand 1 to FFFFFFFFFFF  (low work fast)
rand 1 to FFFFFFFFFFFFFFFF  (too high work slow)
rand 8000000000000000 to  ffffffffffffffff (too high work slow)
rand 800000000000000000000000000000...ffffffffffffffffffffffffffffff (too high work slow)

I now sure may be need to calculate  range/babystep
to not high will work fast

I am not sure
request WanderingPhilospher help to calculate table of setting
or give file setting sample many file for ready to use testing


recommend using python scripts help to split rang and run  BSGS.exe
may be help better


Here if you try to use

Try using this test setting

How fast you pc/laptop run BSGS.exe 


Setting baba step = 1000000
Set rank = 1 to  fffffffffff


Command
BSGS.exe   test.txt
file = test.txt


Code:
1000000
1
fffffffffff
0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798
02f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9
025cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc
022f01e5e15cca351daff3843fb70f3c2f0a1bdd05e5af888a67784ef3e10a2a01
02352bbf4a4cdd12564f93fa332ce333301d9ad40271f8107181340aef25be59d5
03f2dac991cc4ce4b9ea44887e5c7c0bce58c80074ab9d4dbaeb28531b7739f530
0296516a8f65774275278d0d7420a88df0ac44bd64c7bae07c3fe397c5b3300b23
0308bc89c2f919ed158885c35600844d49890905c79b357322609c45706ce6b514
0243601d61c836387485e9514ab5c8924dd2cfd466af34ac95002727e1659d60f7
03a7a4c30291ac1db24b4ab00c442aa832f7794b5a0959bec6e8d7fee802289dcd
038b05b0603abd75b0c57489e451f811e1afe54a8715045cdf4888333f3ebc6e8b
038b00fcbfc1a203f44bf123fc7f4c91c10a85c8eae9187f9d22242b4600ce781c
03aadaaab1db8d5d450b511789c37e7cfeb0eb8b3e61a57a34166c5edc9a4b869d
03b4f1de58b8b41afe9fd4e5ffbdafaeab86c5db4769c15d6e6011ae7351e54759
02fea58ffcf49566f6e9e9350cf5bca2861312f422966e8db16094beb14dc3df2c
029d8c5d35231d75eb87fd2c5f05f65281ed9573dc41853288c62ee94eb2590b7a
033f688bae8321b8e02b7e6c0a55c2515fb25ab97d85fda842449f7bfa04e128c3
020ce4a3291b19d2e1a7bf73ee87d30a6bdbc72b20771e7dfff40d0db755cd4af1
0385663c8b2f90659e1ccab201694f4f8ec24b3749cfe5030c7c3646a709408e19
033c4a45cbd643ff97d77f41ea37e843648d50fd894b864b0d52febc62f6454f7c
031a746c78f72754e0be046186df8a20cdce5c79b2eda76013c647af08d306e49e
023ed96b524db5ff4fe007ce730366052b7c511dc566227d929070b9ce917abb43
03f82710361b8b81bdedb16994f30c80db522450a93e8e87eeb07f7903cf28d04b
036ea839d22847ee1dce3bfc5b11f6cf785b0682db58c35b63d1342eb221c3490c
03057fbea3a2623382628dde556b2a0698e32428d3cd225f3bd034dca82dd7455a
024e4f50a2a3eccdb368988ae37cd4b611697b26b29696e42e06d71368b4f3840f
031a864bae3922f351f1b57cfdd827c25b7e093cb9c88a72c1cd893d9f90f44ece
03e9e661838a96a65331637e2a3e948dc0756e5009e7cb5c36664d9b72dd18c0a7
026caad634382d34691e3bef43ed4a124d8909a8a3362f91f1d20abaaf7e917b36
030d282cf2ff536d2c42f105d0b8588821a915dc3f9a05bd98bb23af67a2e92a5b
0387dc70db1806cd9a9a76637412ec11dd998be666584849b3185f7f9313c8fd28
0209c58240e50e3ba3f833c82655e8725c037a2294e14cf5d73a5df8d56159de69
03a355aa5e2e09dd44bb46a4722e9336e9e3ee4ee4e7b7a0cf5785b283bf2ab579
033cdd9d6d97cbfe7c26f902faf6a435780fe652e159ec953650ec7b1004082790
02f6a8148a62320e149cb15c544fe8a25ab483a0095d2280d03b8a00a7feada13d
02b3e772216695845fa9dda419fb5daca28154d8aa59ea302f05e916635e47b9f6
027d2c03c3ef0aec70f2c7e1e75454a5dfdd0e1adea670c1b3a4643c48ad0f1255
03c060e1e3771cbeccb38e119c2414702f3f5181a89652538851d2e3886bdd70c6
022d77cd1467019a6bf28f7375d0949ce30e6b5815c2758b98a74c2700bc006543
03a2efa402fd5268400c77c20e574ba86409ededee7c4020e4b9f0edbee53de0d4
03b357e68437da273dcf995a474a524439faad86fc9effc300183f714b0903468b
03eec88385be9da803a0d6579798d977a5d0c7f80917dab49cb73c9e3927142cb6
02a631f9ba0f28511614904df80d7f97a4f43f02249c8909dac92276ccf0bcdaed
025e466e97ed0e7910d3d90ceb0332df48ddf67d456b9e7303b50a3d89de357336
026ecabd2d22fdb737be21975ce9a694e108eb94f3649c586cc7461c8abf5da71a
03fd5487722d2576cb6d7081426b66a3e2986c1ce8358d479063fb5f2bb6dd5849
023a12bd3caf0b0f77bf4eea8e7a40dbe27932bf80b19ac72f5f5a64925a594196
0291bee5cf4b14c291c650732faa166040e4c18a14731f9a930c1e87d3ec12debb
02591d682c3da4a2a698633bf5751738b67c343285ebdc3492645cb44658911484
03f46f41027bbf44fafd6b059091b900dad41e6845b2241dc3254c7cdd3c5a16c6
028c6c67bef9e9eebe6a513272e50c230f0f91ed560c37bc9b033241ff6c3be78f
0374c33bd548ef02667d61341892134fcf216640bc2201ae61928cd0874f6314a7
020faaf5f3afe58300a335874c80681cf66933e2a7aeb28387c0d28bb048bc6349
034af4b81f8c450c2c870ce1df184aff1297e5fcd54944d98d81e1a545ffb22596
0385a30d8413af4f8f9e6312400f2d194fe14f02e719b24c3f83bf1fd233a8f963
033f2db2074e3217b3e5ee305301eeebb1160c4fa1e993ee280112f6348637999a
02a521a07e98f78b03fc1e039bc3a51408cd73119b5eb116e583fe57dc8db07aea
0311569442e870326ceec0de24eb5478c19e146ecd9d15e4666440f2f638875f42
0241267d2d7ee1a8e76f8d1546d0d30aefb2892d231cee0dde7776daf9f8021485
0348e843dc5b1bd246e6309b4924b81543d02b16c8083df973a89ce2c7eb89a10d
0249a43860d115143c35c09454863d6f82a95e47c1162fb9b2ebe0186eb26f453f
03231a67e424caf7d01a00d5cd49b0464942255b8e48766f96602bdfa4ea14fea8
0365ec2994b8cc0a20d40dd69edfe55ca32a54bcbbaa6b0ddcff36049301a54579
0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b
0290e6900a58d33393bc1097b5aed31f2e4e7cbd3e5466af958665bc0121248483
03726b574f193e374686d8e12bc6e4142adeb06770e0a2856f5e4ad89f66044755
037e1238f7b1ce757df94faa9a2eb261bf0aeb9f84dbf81212104e78931c2a19dc
0329c4574a4fd8c810b7e42a4b398882b381bcd85e40c6883712912d167c83e73a
035c38bd9ae4b10e8a250857006f3cfd98ab15a6196d9f4dfd25bc7ecc77d788d5
02967a5905d6f3b420959a02789f96ab4c3223a2c4d2762f817b7895c5bc88a045
03d2063d40402f030d4cc71331468827aa41a8a09bd6fd801ba77fb64f8e67e617
03bcf7ce887ffca5e62c9cabbdb7ffa71dc183c52c04ff4ee5ee82e0c55c39d77b
0309976ba5570966bf889196b7fdf5a0f9a1e9ab340556ec29f8bb60599616167d
0248d313b0398d4923cdca73b8cfa6532b91b96703902fc8b32fd438a3b7cd7f55
02ceb6cbbcdbdf5ef7150682150f4ce2c6f4807b349827dcdbdd1f2efa885a2630
0233709eb11e0d4439a729f21c2c443dedb727528229713f0065721ba8fa46f00e
03633cbe3ec02b9401c5effa144c5b4d22f87940259634858fc7e59b1c09937852
02145d2611c823a396ef6712ce0f712f09b9b4f3135e3e0aa3230fb9b6d08d1e16
031f6a332d3c5c4f2de2378c012f429cd109ba07d69690c6c701b6bb87860d6640
03afdda497369e219a2c1c369954a930e4d3740968e5e4352475bcffce3140dae5
03137807790ea7dc6e97901c2bc87411f45ed74a5629315c4e4b03a0a102250c49
035cd1854cae45391ca4ec428cc7e6c7d9984424b954209a8eea197b9e364c05f6
02e0a8b039282faf6fe0fd769cfbc4b6b4cf8758ba68220eac420e32b91ddfa673
fxsniper
Member
**
Offline Offline

Activity: 406
Merit: 45


View Profile
March 06, 2021, 03:24:49 PM
 #45

some problem
BSGS.exe use a lot of RAM (memory) and harddisk (SSD still high writing)

I think should have table for calculate for user
like 8GB, 16GB, 32GB should be use limited how much each

I setup too high my memory 32GB still full and SSD hdd work 100% with writing something (may be swap memory)

good if have
table for babystep and wide range
and table for memory (ram) for fast work on memory without write to disk

I don't know how BSGS.exe works
but for fast work setting for limited and fit to can work only in memory is better.

WanderingPhilospher (OP)
Full Member
***
Offline Offline

Activity: 1078
Merit: 219

Shooters Shoot...


View Profile
March 06, 2021, 03:58:44 PM
 #46

Quote
Here if you try to use

Try using this test setting

How fast you pc/laptop run BSGS.exe


Setting baba step = 1000000
Set rank = 1 to  fffffffffff
It took 12 seconds to run your test.

The settings I gave in older BSGS and the ones I gave in the new python script have been tried and tested and work best for the 56 bit random ranges. Yes, if you use a high baby step then it will take a long time to actually build the baby steps in RAM; if it is too low then it will either miss keys or it will take a long time for your giant steps to work through the range.

As stated, the BSGS is great at working through smaller ranges very quick and efficiently. Kangaroo is better at bigger ranges. But when one is working through random ranges, such as this thread was started upon, it's better to use BSGS because it tells you with 100% certainty if the key is in the range you are searching whereas kangaroo you will have to run over the expected group operations and even then it's still not 100% certain that key wasn't in the range searched.
fxsniper
Member
**
Offline Offline

Activity: 406
Merit: 45


View Profile
March 08, 2021, 09:01:31 AM
 #47

Reference script BSGS
https://github.com/iceland2k14/bsgs
https://github.com/iceland2k14/bsgs/blob/main/bsgs_v4_gmp.py


I modify to hide message PVK not found.
and print S value is show X,Y and hex_line

What is hex_line value?

script generate large file baby_steps table for calculate
found key when meet hex_line on baby_steps table

I read baby step from
https://asecuritysite.com/encryption/baby

scripts make 1073741824 list babystep for multiply right
and when calculate use run with babystep

I think both script and BSGS.exe do the same right
https://github.com/JeanLucPons/BSGS
create large table hash table (25bit hash) to store the baby steps. 2^30 baby steps is about 9GB

still learning
not yet clear understand

now I try to looking way to reduce keyspace for search because high bits it is too much large area to search
if can fine right keyspace  may be helpful to working search
bigvito19
Full Member
***
Offline Offline

Activity: 706
Merit: 111


View Profile
March 08, 2021, 07:15:04 PM
Last edit: March 08, 2021, 08:40:05 PM by bigvito19
 #48


now I try to looking way to reduce keyspace for search because high bits it is too much large area to search
if can fine right keyspace  may be helpful to working search


Do you think you can try to look for a way to reduce keyspace search for kangaroo too?
fxsniper
Member
**
Offline Offline

Activity: 406
Merit: 45


View Profile
March 16, 2021, 12:21:25 AM
 #49


Do you think you can try to look for a way to reduce keyspace search for kangaroo too?


Unfortunately I am not programmer I can not code on C++

All tools is develop very good but still can work with low range low keyspace  and very large key space are still use time a lot

Do you think want to waiting a long time or scan all keyspace

I don't want to waiting more, I think should find the way predict or pick small key space and use tools for scan  may be better do scan all every thing

Baby Step Giant Step can found key on

at high range , wide keyspace BSGS still not work good, waiting a long time  (personal kangaroo feel work better)
compare ranking
1. Kangaroo
2. BitCrack
3. Baby Step Giant Step

WanderingPhilospher (OP)
Full Member
***
Offline Offline

Activity: 1078
Merit: 219

Shooters Shoot...


View Profile
March 16, 2021, 02:37:38 AM
 #50


Do you think you can try to look for a way to reduce keyspace search for kangaroo too?


Unfortunately I am not programmer I can not code on C++

All tools is develop very good but still can work with low range low keyspace  and very large key space are still use time a lot

Do you think want to waiting a long time or scan all keyspace

I don't want to waiting more, I think should find the way predict or pick small key space and use tools for scan  may be better do scan all every thing

Baby Step Giant Step can found key on

at high range , wide keyspace BSGS still not work good, waiting a long time  (personal kangaroo feel work better)
compare ranking
1. Kangaroo
2. BitCrack
3. Baby Step Giant Step


BSGS gets through a smaller range faster and with 100% certainty that a key is or is not in the range.  Kangaroo can get through same range fast, but may keep going and going if key not found; BSGS stops and you know if key is there or not.

Bitcrack is designed to do something totally different. It is a mere brute force attack. So yes, if you do not know the public key, then you have to use a program like Bitcrack. But if you know the public key, Kangaroo and BSGS are 1 million times faster/better x Pi, than Bitcrack.

You can't really rank Kanga and BSGS with Bitcrack, they are different animals.
Pub key known and range above 64 bits, use kangaroo...64 and below, use BSGS.
Pub key not known, use Bitcrack or some other type of brute force program.

The only way to reduce keyspace is if pubkey is known, then you can do some basic ECDLP math to shrink the search range.
WanderingPhilospher (OP)
Full Member
***
Offline Offline

Activity: 1078
Merit: 219

Shooters Shoot...


View Profile
March 25, 2021, 06:28:22 PM
 #51

In trying to find some old source code for a project I ran across some #120 ranges searched.

How to use this?  The ranges listed have been searched through for the #120 key and the key was not in the range.  I am only adding the ones starting with 8 because the list would be 8 times as big. So any range listed below has also been ran in the 9, A, B ,C, D, E, F ranges as well.

The list has been sorted so you can determine the ranges by looking at the top range (that is the start range) and the next range (that is the end range).

I have more ranges that I have searched and will upload/update the above list once found.

Link (list was to big to post here):

https://github.com/WanderingPhilosopher/BSGS/blob/main/Ranges_Searched1a.txt
mcmatrix
Newbie
*
Offline Offline

Activity: 6
Merit: 0


View Profile
March 26, 2021, 11:29:48 AM
 #52

I need some help with this. I would like to participate but when I go to github all I see is the exe ,  a readme and the ranges searched txt.   Is there supposed to some bat files?   how do I go about running the program to search for the keys?
WanderingPhilospher (OP)
Full Member
***
Offline Offline

Activity: 1078
Merit: 219

Shooters Shoot...


View Profile
March 26, 2021, 09:50:26 PM
 #53

I need some help with this. I would like to participate but when I go to github all I see is the exe ,  a readme and the ranges searched txt.   Is there supposed to some bat files?   how do I go about running the program to search for the keys?
If you are using Windows I can post a python and bat script here to help you get started.
mcmatrix
Newbie
*
Offline Offline

Activity: 6
Merit: 0


View Profile
March 27, 2021, 01:27:04 AM
 #54

Hi,  yes I am using windows
WanderingPhilospher (OP)
Full Member
***
Offline Offline

Activity: 1078
Merit: 219

Shooters Shoot...


View Profile
March 28, 2021, 03:01:59 AM
 #55

Hi,  yes I am using windows

https://bitcointalk.org/index.php?topic=5304368.msg56500576#msg56500576
mcmatrix
Newbie
*
Offline Offline

Activity: 6
Merit: 0


View Profile
March 30, 2021, 07:14:56 PM
 #56

I was reading the python.  I'm an old programmer but not a python programmer.   What is the input.txt file? 
WanderingPhilospher (OP)
Full Member
***
Offline Offline

Activity: 1078
Merit: 219

Shooters Shoot...


View Profile
March 31, 2021, 02:44:41 AM
 #57

I was reading the python.  I'm an old programmer but not a python programmer.   What is the input.txt file? 
The input file contains, in line order:
the amount of memory to be used to fill baby steps
start range
end range
pubkey1
pubkey2
etc
etc
fxsniper
Member
**
Offline Offline

Activity: 406
Merit: 45


View Profile
April 08, 2021, 01:25:25 PM
 #58


I want to know How Baby Step Giant Step work and How Baby Step Giant Step calculate

https://github.com/JeanLucPons/BSGS

Did BSGS calculate private key by jump with Baby Step Giant Step algorithm?
I mean number 2**119 to 2**120
or
Did BSGS with point x (ECC) like kangaroo?

 
fxsniper
Member
**
Offline Offline

Activity: 406
Merit: 45


View Profile
April 09, 2021, 11:35:26 AM
 #59


What about this article?

https://sefiks.com/2018/02/27/counting-points-on-elliptic-curves-over-finite-field/

What function for Baby Step Giant Step works on article?
btc-room101
Member
**
Offline Offline

Activity: 182
Merit: 30


View Profile WWW
April 25, 2021, 10:49:47 AM
 #60

I was reading the python.  I'm an old programmer but not a python programmer.   What is the input.txt file? 
The input file contains, in line order:
the amount of memory to be used to fill baby steps
start range
end range
pubkey1
pubkey2
etc
etc

This is a super waste of time. The best-of-the-best of anything on GITHUB is jean-luc 'Kangaroo', but even that you must be within the search range of 2^40, but then on that range of a real-space of 2^256, your not even in right galaxy 1/2^216

You get one-at-a-time search hashes in python, what are you doing 100 keys/sec??

You have to program in C/C++, you have to know how to program GPU's;

BTC key-space is 2^256, that is 10^77, that is the number of electrons in the known universe; One at a time you could not even be looking in the right galaxy for your lost electron.

The way its done is to parallel search of all keys at once, all 300M bitcoin addresses, that way on every search cycle your looking all at once in one nano-second is this priv-key, is this hash in the bloom-filter abstracting 300M keys, yes or no. If it is, then you print out that key, and you have found a private-key to a real bitcoin address.

Running on RTX-3070 cards, I'm seeing 2500M keys/sec, but because I'm comparing 300M on each cycle, its really 100B keys/sec, even then with the birthday problem 2^128, I figure the odd's of hitting a high-value address is 1,000 days, I run a mining rack of 4 RTX-3070's, and I'm doing over 10,000M cycles/sec ( times 300M ). WHen I say 1,000 days. Which is once every 3 years.

Just a few years ago with GTX-1070 cards I was doing 200M keys/sec, with 4gb bloom-filters( 100M) bitcoin addresses.

There are only about 10k high-value addresses on bitcoin

There were at one time 1,000's of public-keys with high-value, but post 2013-ish they hashed the public-key, so their no longer available, note "Kangaroo' only works if you have a public-key. Note that the only priv-keys ever found were toy problems where they gave you an priv-key that was close to the 2^40 range

...

There are two ways you can hack, crack, or bust Bitcoin.

1.) Is by math, that means you know the public-key, you search for it; The fastest technique on earth to date is pollard-rho/lambda, aka now called kangaroo, but it only works on toy problems, the current is around 2^110

There are other ways to hack a public-key, such as endomorphisms, and pairing;  You can google these subjects; "ECDLP discrete log problem pariring/endomorphisms" read the papers.

I know this stuff is working, because two years ago here were 1,000's of BTC public-keys still with high-value ( pristine ), today there are less than 900, they get hacked about 10 / month; I spend about 1/2 my time on this activity so I'm up on what's being done

2.) The other way is hack is brute force, or just search the entire 2^256 space randomly; Which is what I'm talking about above with GPU test 10,000M priv-keys/sec, and look to see if the hashed address is in the 300M ( 64gb bloom ), if you get a hit, you still need to do a binary-search using 'xxd & sort -u', and binchk ( see original brainflayer for binchk ), that is 100% instant verification, the bloom-filter will always have some false positive, even 300M addresses in a 64gb bloom will find false postivies, the final binary-search lets you know that you a good key for sure.

...

If you say I don't know C/C++, or I can't program a GPU, then you really shouldn't even be playing this game.

If you don't have $10's of 1,000's of dollars for AMD 64thread-ripper cpus, and dozens of 4TB ram-drives, you shouldn't be in this game, your cpus must have 128GB of ram, and of course these days the RTX graphics cards are unavailable for any price

My feeling is the next generation graphics, will find keys in 100 days, as I'm seeing this stuff get faster 10x every 1-2 years, but you need to stay on top of the latest gen

...

Baby-step-giant-step is for toy problems, so people can learn about point-counting and simple elliptic-curve arithmetic

If you don't have the equivalent of a masters in math, then you will have a hard time exploring the type #1 hacking above, if you don't have lots of money, and cpu-gpu you'll have a hard time doing #2, and of course you must be able to do C/C++, and program gpus; the off the shelf stuff on GITHUB is 99% worthless; Like they say, if it worked they wouldn't be giving it away for free.

...

Some say "how often do you find keys", I would say once in a while 0.001 here, 0.05 there, I just put the private key into an CSV file, and then run checks to see if the money is still there in all cases, 1-2 years its gone, I have no long term keys that still have money

On checking adresses you must host a Bitcoin-NODE, and electrum-wallet server, so you can do your own checking, you can't be contacting the internet; So that's more computers.

I have GPU cards for years, been doing ML for years so I just redeployed stuff to bitcoin hacking, and of course you can mine, which is very profitable these days on ETH

Even little GTX-1060 cards, now 3gb is worthless on ETH, but I can use on algo #2 above and each card does 200M keys/sec ( * 300M); Just giving this so you can see difference,

...

I have no doubt that the last of the last public-keys will be hacked, I think most promising is pairing, finding a 'smart attack' prime close to the BTC prime, but of order N==P, then you convert that Elliptic-Curve maps directly to the finite-field; Very difficult to find these magic primes ( but it can be done ), but even here with the last of the last 900 public-keys of high value, we're able to search 900 at once, as well on each cycle, toss in a full 300M bloom-compare, so you can do a twofer 1&2 above.

WRT to targeting specific BTC address, so the ant-pool addresses that hold 10's of 1,000's of BTC, I think this would be impossible; Quantum Computers don't exist they're fictional at this point in time.

Can the NSA crack BTC? Yes I think so, this is where endomorphisms come in there are 1,000's; There is a backdoor to SECP256k1, otherwise NSA wouldn't have made it public.

The problem is how much time can person spend on this stuff, each area is like its own research; If it were easy to hack then you would be solving the ECDLP problem, which is worthy of a fields medal in math, lots of brilliant people work on this stuff, its like the Fermats Last Theorem

...

For you guys that want to do this stuff, I suggest if you don't the resources, just team up, and each do what they can do, don't try to go it alone, and I have attempted here to explain the state of art, and how difficult it right now,

This said, finding good keys every 1,000 days, if you have a mining farm, you could be finding good keys everyday, which is why I think 'inflection' has already passed, that hacking is more profitable than mining.

Lastly, for those that say Hacking BTC is bad, Nietzche said "That which kills bitcoin, makes it stronger", had BITCOIN-org made btc stronger and private years ago none of this would be possible

BITCOIN is designed become worthless in time, just like CBDC in China. Solution, hack the BITCOIN source pull out SHA256, and SECp256k1, an use SHA512, and a 1024 bit elliptic-curve that is un-breakable for the next 20+ years.
Pages: « 1 2 [3] 4 »  All
  Print  
 
Jump to:  

Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!