 Show Posts
|
|
Pages: « 1 [2]
|
Can someone tell what exact happens in bsgs and kangaroo. In layman terms and by giving some examples. If possible please explain by example of any 10 bit 20 bit key so it can be understood easily. Like if i take a 64 bit known pub key and starts my bsgs or kangaroo , then what happens inside it. I understood that it uses pubkey + n*G to calculate anoher pubkey and if value of prv key related to this new pubkey is known then prv key for the input key can be calculated. but how that helps. We still have to go through billions of keys and keypairs. How it generated those keypairs first. Secondly how it can be so fast to search for 64 bit in some seconds. Its still a large space. Confused ...
Did you read description explain on JeanLucPons Kangaroo at github already? try read for understand https://github.com/JeanLucPons/KangarooThats the first thing i do always. If it goes out of my knowledge only then i ask it. I even had gone through bsgs by jean and others. Everyone uses different techniques for step calculation , jean uses floor sqrt and speed comes to 1Mks , some other uses other method to guess number of steps and covering large spaces with billion and trillion keys per sec but failed to compete with jean bsgs because they took too much time in generating the point file itself. Ofcourse kangaroo is still fastest. My question was related to how the baby step and giant step work in layman terms. I had read the code where it took some baby steps and matches it with the precomputed part , if doesnt match then take giant step Nd so on. But still its not understadable for me. If this can be explained using some examepl then it would be better for the whole community. I believe most people here dont understand much technical things except some people. I read posts from freedragon , brainless and they are inspiring and help me understand many things. |
|
|
|
|
Is it possible to use this modified version to write all generated keypairs to some file rather than to compare. Or any fast method to write keypairs pvk:pubkey . I had read on different posts that its possible to generate 15 billion of keypairs in under a minute. Is it true ? If yes then is this jut generation or writing to disk is also possible at this speed.
|
|
|
|
|
Hi ,
Glad to see this project here on bitcointalk . I am using it from last many days and its quite impressive . I found it via iceland2k14 comments on his bsgs repo. Anyways i have some questions for you.
1. What exactly are BP points and AMP points in your code. How are they calculated. Any specific formulae.
2. Where can i find BP file and Amp file after it gets calculated in your program. I am not able to locate any 1920 MB BP file generated for -k 30 im the directory.
3. -a how to make this file of precalculated amp points.
4. A question not related to this tool , i am supposing that this tool is calculating different key pairs at different spaces in a range. And matches the pubkey generated with the input pubkey - keyspace*G , my question is that since its comparing one single key from a keyspace of trillion keys then the output that its showing like 30 trillion keys scanned means that it actually matched 30 precalculated results from 30 trillion private keys. Right ? Or it is 30 trillions keys are converted to 30 trillion pub keys and matched in 30 second.
And what are K factor related to M , what is M here.
Thanks in advance.
|
|
|
|
|
Can someone tell what exact happens in bsgs and kangaroo. In layman terms and by giving some examples. If possible please explain by example of any 10 bit 20 bit key so it can be understood easily. Like if i take a 64 bit known pub key and starts my bsgs or kangaroo , then what happens inside it. I understood that it uses pubkey + n*G to calculate anoher pubkey and if value of prv key related to this new pubkey is known then prv key for the input key can be calculated. but how that helps. We still have to go through billions of keys and keypairs. How it generated those keypairs first. Secondly how it can be so fast to search for 64 bit in some seconds. Its still a large space. Confused ...
|
|
|
|
Can i get a link to your code and if it generates just pvk or addresses as well. How long time did it take to generate 1 million keys?
Around 2 hours holly shit, then your code must be horrible. generating 1 million private keys should not take more than a minute or so. and that's just if you use CPU not GPU, with a GPU it can be a lot higher than that. and that is based on my code written in C# which is a managed language and slow, yours seem to be in C so it shouldn't take about 30 seconds! Generating 2 same Bitcoin address is possible, but for that you must be very very very lucky.
lol, it is impossible and you are wasting your time. |
|
|
|
Thanks for your comments. I understand that it goes upto hash160 function only but public keys are generated at very starting stages so writing private keys and public keys is possible. Is there any implementation of same in python or c or any low level language like brainflayer had. So it can be modified accordingly. Brainflayer speed for incremental private keys is less than 500k/s . Or if anyone knows any such private key public key database already built for some keyspace . Hi guys ,
Can this tool or any modification of this be modified to write all private keys and respective uncompressed private keys and addresses) in range 1 to 56BC75E2D630FFFFF as a csv file . Since it generates 700 to xxxx million keys /s in some of its versions , so it will take many years on a single machine. But still looking for solutions. Writing regular outputs will consume too much time
So better it will save several millions or billions in some sort of memory operation and then write them once , till then next batch will find its space in memory to be written again.
If I understand you correctly, you are saying that Bitcrack should write the address of each private key it finds to a file? How would that speed up key searching? Bitcrack doesn't even encode addresses anyway (it only decodes them to RIPEMD160 hash at the beginning of a search) so modifying it to make an address out of every address it finds will slow it down. I agree with write to file make bitcrack slowly both technic open file and write file each key or collector on memory and write one same work slow (write to file use low memory and write one use large memory too) if you need write to file on this case it no need to use bitcrack just use any python script write to file it fast same your want both random and running number I try already like python write file private key 1 million per 4 minute (up to harddisk or SSD storage) if you want to collect private key is use a log of storage to keep it too. plan text file is very small but when have billions trillion line use some space 64 billion private key data use 4TB disk, how many you need to keep most decide to scan and let it go |
|
|
|
|
Hi guys ,
Can this tool or any modification of this be modified to write all private keys and respective uncompressed private keys and addresses) in range 1 to 56BC75E2D630FFFFF as a csv file . Since it generates 700 to xxxx million keys /s in some of its versions , so it will take many years on a single machine. But still looking for solutions. Writing regular outputs will consume too much time
So better it will save several millions or billions in some sort of memory operation and then write them once , till then next batch will find its space in memory to be written again.
|
|
|
|
Sir , Can you please share link to python script that u mentioned. What is the value of the "G - basis point" ? Thanks!
Actually G is the Point of ECDSA secp256k1 curve in HEX: Gx = 79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798 Gy = 483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8 in DEC: Gx = 55066263022277343669578718895168534326250603453777594175500187360389116729240 Gy = 32670510020758816978083085130507043184471273380659243275938904335757337482424 Visually G point is 47.55% on X ordinate and 28.21% on Y ordinate (considering that maximum X and Y values are modul value which is close to 2^256), so approx. Gx is 47.55 * 2^256 and Gy is 28.21% * 2^256I want to understand how you found the solution for the below equation. Do you use some script? Thanks! Q + 13000000*G = 024154b506ab766f42fbe37f699976f84db89f4f2f6bed98325c1a0b6e326dd4e4 + 034d11d3fef403710f1332ae54d99d12e383e9ad1a87d3972ab737b0dffe359be7 = 02464e23afad4a987d1d7c93ffe1d2d1cd196b0c1999b76bf1225e229fd7a1e770 It is not simple addition and multiplication. It is scalar addition. For multiplication also the scalar addition is used. You should learn the scalar addition and multiplication in order to understan this. Read the basics of scalar addition and multiplication here: https://medium.com/@blairlmarshall/how-does-ecdsa-work-in-bitcoin-7819d201a3ecI made the calcualtion not manually of course, I used Python script for this (scalar multiplication and addition). The resulting Point is always has x and y coordinates, but in the showed formula above I used compressed format (prefix 02/03 concatenated with x coordinate). There are 2 wayes to show the point - in compressed format (like was done by me) writing only x coordinate, ot in uncompressed format started with prefix 04 and concatenated with both x and y coordinates. So, you should learn scalar addition of ECDSA points in order to understand that formula. Also you should be familiar with compressed/uncompressed format of public keys. And do not forget that private key is a number, but public key is a point. Additing one point to another poin you receive a third point. Multiplying point by a number you receive a point. In ECDSA bitcoin curve you receive the public key of the address as the multiplication of the basis point (G) by a private key (number). If you do not like to learn and understand all these things by yourself and need a script, write the script parameters and for small bounty I can write it for you. |
|
|
|
Can you please check your PM Sir. How do y'all know how many bits a public key is?
It is not possible to know the private key bit length from the public key , I have question for you if you can explain to me please !! how brainless can find that those address are 100bits ? let think that he take the 110 address and try to add negative hex numbres to reduce the bit ,right !! but even that how he can be sure that the numbre that he add make address from 110bit to 100bit !!? that is really weird the only thing that we know is 2^n = 2^(n-1) + 2^(n-2) .....+ 2^(n-n+1) + 2 !! but if we have "n" =in range 110 and 111 that make impossible to know of even predict the bit of wallet. if you have any idea please. thanks dear bro do you like test and proof that my 110bit pubk to 100 bit pubk, mean 10 bit down  PM for take test thankx |
|
|
|
Exact answer that i was looking for. So cant an actual company working for a real project can raise funds via ico. Ico should mean decentralized in terms that anyone around the world can actually invest in a real company without gov boundations. Not that just fork a coin or create a token on ethereum and you are good to go to scam a lot of people. the word ICO comes from the word IPO which is Initial public offering where the company in stock market starts selling its share initially on the market. the difference is that the company doing IPO is an actual company that is legit, registered and has employees and everything! in an ICO it is done by some kid trying to make some money by scamming people and all you need is minimal programming knowledge to copy paste some code. and it has only been used for raising funds. everything else (gaming , gambling , ecommerce , exchange,...) are just an excuse to make it look legit.
|
|
|
|
So why dont the buyers of that coin gets profit from margins of the project like happens in IPO. I think it is meant only for new coins or blockchains, because like its meaning, Initial Coin Offering. It is a project proposal that then need to sell their coins to fully develop their project. I have never seen already established coin and still on the ICO.
|
|
|
|
What type of coins or i prefer it to be called as a bond or contract should be preferred in this situation. And does it need to be tradeable on large exchanges even if it is not meant for that purpose. How can one distribute the profit to the investors / holders in this case as the bond is not listed on some exchange and distributing profit in form of bonds or coins is useless if its not tradeable. I want it to be tradeable on just one marketplace so that the price remains non volatile even if btc or other crypto goes up or down and price gets determined by project success . ICO stands for Initial Coin Offering so which is a term related to the crypto currency field but when you say you can follow this to any other field yes we can if there are people who are ready to invest on your project.And this thing is already happen in this world but not in the term ICO when it comes to any other field than ICO so we need a word to term then we can find where these are involved.
|
|
|
|
|
Hello ,
I saw and read many ico whitepapers and almost all are related to either launch of a new coin or for some project that is blockchain technology based , be it gaming , gambling , ecommerce , exchange or anything. Cant we use ico for funding real life projects like for funding startups , ventures or for creating a new app , starting a new website or hotel etc. The IPO does same and its value goes up when the company earns profit and via trading too , whereas it counts just trading in ICO or in most of ICO. Looking for your views on this.
|
|
|
|
|
Hello ,
I am looking for some old wallet.dat file from 2009 -2010 for understanding some technical things and difference between the changes as of now. Can someone provide me or possibly private keys of some wallet files of that time with some trannsactions and obviously zero final balance.
Thanks in advance.
|
|
|
|
|
What are withdrawal and spending limits of these accounts. I am interested and sent a mail to you.
|
|
|
|
|
