Search content
Sort by

Showing 7 of 7 results by CatalanaBTC
Post
Topic
Board Development & Technical Discussion
Re: BitCrack - A tool for brute-forcing private keys
by
CatalanaBTC
on 02/10/2023, 09:32:04 UTC
I realize that the combination or possible hex numbers are very large, but of all the btc addresses created, 100% are 256 bits? until the first btc addresses created? A few weeks ago I saw someone talking about trying to crack a 2015 satoshi wallet or something similar with a lot of btc having only the pubkey, assuming it was less than 256 bits, right? I'm not confused about this


Regarding the bip39 seeds, if I restored 1 million bip 39 phrases of 12 words, and another million bip 39 phrases of 24 words (I am not referring to creating a new wallet, but to restore and use 12 random words from the bip39 and expect to find 1 used address) would there be the same chances of finding 1 address with at least 1 transaction as through hex and btc? That is, if there are 2048 words, and I only base it on bip39 phrases of 12 words, there are a total of 12,980,005,607,406,348,644,160,768,000 possible combinations in total, let's say that only 50% are valid and the rest are not, it is still a huge number, but a lot smaller than that of btc, also with the words bip39, there are possibilities of obtaining more than 1 transaction in eth bnb or matic, from hex of btc only 1 network is checked, that of btc

Likewise, BTC is a huge number.

0% = 000000000000000000000000000000000000000000000000000000000000001

0.00005% = 000008b18610932ab6b2906ea3dfeaa8da073a862d7e0d7ffffffffffffffffc4

0.001% = 0000a7c5ac471b4784230fcf80dc33721d52f8aac2ffe738776930d94f9175a8


It really is a more than astronomical number.


So, hahaha the chances of getting puzzle 66 through random mode and GPU, and the chances of getting 130 through kangaroo or bsgs, between the two which has more chances?
Post
Topic
Board Development & Technical Discussion
Re: BitCrack - A tool for brute-forcing private keys
by
CatalanaBTC
on 01/10/2023, 21:57:40 UTC
I understand... I'll think twice about that idea again... Hahaha



Changing the subject radically, to try to try your luck with puzzle 66 and puzzle 130 since 125 was opened, are you trying to use these codes, do not modify main or anything, any improvement that you can make or do you do wrong?


VBCr.exe -begr 20000000000000000 -endr 3ffffffffffffffff -t 6 -dis 4 -r 30000 -drk 1 -i addresses.txt -m 1 -o key.txt -gpu

cuBitCrack.exe -b 96 -t 512 -p 1024 --keyspace 26000000000000000:2ffffffffffffffffff -i addresses.txt -o FOUNDKEY.txt

BSGS
40000000
20000000000000000000000000000000000
3ffffffffffffffffffffffffffffffffff
03633cbe3ec02b9401c5effa144c5b4d22f87940259634858fc7e59b1c09937852


 And another question, from the 1st bitcoin address created to the last, both compressed and decompressed, are 100% of those addresses 100% 256 bits?

There are bitcoin addresses with more than 1 transaction 22,285,749,153

and there are 10,527,367,033 that start with 1 (Compressed and decompressed).
The rest start with bc1 and 3

Let's say I get 10,000 random hex keys per second, if I convert each hex key to its respective address (Compressed, decompressed, bc1 and 3)
What is the chance of getting 1 match against puzzle 66 or 130 using bsgs or kangaroo?
Post
Topic
Board Project Development
Re: VanBitCracken - a program to use for 32 BTC challenge (supports RTX 30xx cards)
by
CatalanaBTC
on 01/10/2023, 15:29:51 UTC

I would like to know if I can modify the exe file from either bitcrack, VanBitCracken or VBCr to perform my search or is there another program?
This tool is not open source, even if it was you couldn't modify exe file, first you need to modify the source code and recompile it to make a new exe. This dev is no longer among us unfortunately, he left these woods a couple of month ago.

At first I was just like you, I thought I could hit a key by "chance" until I got to know about public keys, if you are interested in hunting for puzzles, join us in a futile search for them.😂

Ps, I hope you are not going to post the same thing in every brute force related topic.😉  welcome and happy hunting.

Pss, check my python museum on this same board, I have the ultimate cracking scripts.🙃



Holaa de nuevo jajaja
No publicare en mas posts, solo lo publique en el post anterior que justo ahora te respondi y en este, los dos post donde vi que podia obtener respuestas precisas Smiley

Revisare tu muro en un rato y te comentare si encontre algo interesante, aunque seguro que si

Gracias !! Tendre en cuenta tu ayuda y aunque no tengo muchos conocimientos sobre estas cosas y estoy aprendiendo, aqui tienes una amiga para charlar y intentar ayudarnos en lo que necesites
 

Post
Topic
Board Development & Technical Discussion
Re: BitCrack - A tool for brute-forcing private keys
by
CatalanaBTC
on 01/10/2023, 15:21:59 UTC
BTC.TXT IS 19 GB AND has 1 btc address in each line)
Snip.....
First of all, don't empty all our addresses when you brute force them all.🤣
Second, why would you want to search for both address types? Searching for uncompressed addresses reduces your speed by 45%, and I don't think any txt file could handle 19GB of text, I mean for windows is 2GB max, larger than that, it won't open, maybe that's the problem. You better to use keyhunt with all ever used public keys, just any key.
Note that to achieve same speed, you can't use python, best is C++. Anyways I like your enthusiasm thinking it can hit a key, maybe you should try....  wait, how can all the addresses with balance occupy 19GB?  How many are there? Can't you make it 2GB to see if it works or not?


and one last question
What's that? Here the post ended what happened?😅




Hello ! Thank you for answering me first of all, and Hahaha, with a lot of luck, I will be able to obtain 1 or 2 private keys from the BTC.TXT addresses, and in btc.txt all the addresses there are compressed and decompressed, I don't know which ones are decompressed and which ones are compressed

Another thing, in the 19GB, there are all the addresses that have ever received a balance, not those that contain a balance, that would be around 50% or 60% less, I want to focus the search on all the addresses that have ever received btc and that begin with 1 regardless of whether they are compressed or decompressed, to check what the probability would be that someone would find an address already used

But with that 45% data I will then try to specify in btcC.txt, all the compressed bitcoin addresses and thus the file will weigh less, and the speed will increase by not having decompressed addresses


I don't know how to use C++, only python node and some already created programs such as bitcrack VBCr and VanBitCrackenS1, work perfectly and find matches, but as long as the text file weighs less than 2 GB.

I forgot the last question but thank you so much for answering.
Post
Topic
Board Service Discussion (Altcoins)
Topic OP
Check the balance of 1 million ethereum/BNB/MATIC addresses
by
CatalanaBTC
on 01/10/2023, 13:31:01 UTC
Hola ! Espero que todos estes bien

Tenia una duda, lo mas seguro que esto ya alguien haya comentado o mencionado el tema pero no he encontrado nada

Tengo un archivo de texto con 1 millon de direcciones de ethereum 1 en cada linea

Quisiera saber si alguna de esas direcciones, Ha tenido mas de 1 transaccion en la red de ETH BNB O MATIC o Si alguna de las direcciones, tiene un saldo superior a 0 en ETH BNB O MATIC , lo que mas rapido funcione
 
Actualmente uso api de blockchain , moralis y ethscan , pero al comprobar 100.000 o 150.000 direcciones, el script se para, y al no guardarse, he de acceder al archivo de texto manualmente selecionar la ultima linea escaneada y borrar desde esa linea hasta la primera para no comprobar otra vez las mismas direcciones

Tambien he probado desde javascript un codigo que comprueba aqui las direcciones : https://blockscan.com/address/0x98f39d0f8c67885071cc99c5af1d4cacbcc89b0c?t=tx
 donde va 0x98f39d0f8c67885071cc99c5af1d4cacbcc89b0c prueba las direcciones de ethereum.txt
Si el resultado es : Your search - {0} did not match any tx hash. - significa que esa direccion TIENE 0 TRANSACCIONES
Si el resultado es diferente , significa que esa direccion tiene mas de 1 transaccion , ese codigo tambien funciona correctamente pero al ser por http , cada 1000 wallets comprobadas hay que esperar un minuto para seguir comprobando mas y es muyyy lento


Cualquier ayuda es agradecida !! 
Post
Topic
Board Development & Technical Discussion
Re: BitCrack - A tool for brute-forcing private keys
by
CatalanaBTC
on 01/10/2023, 13:17:47 UTC
Good afternoon, I hope everything is well.

My idea is the following:

I have a BTC.txt file, which has all addresses with a balance greater than 0 starting with 1 (both compressed and uncompressed) (BTC.TXT IS 19 GB AND has 1 btc address in each line)

I want to run bitcrack, VanBitCracken or VBCr which work perfectly, but when I put -i btc.txt, in bitcrack it stays loading for about 6 hours and is removed, and in VanBitCracken and VBCr it doesn't seem to read it directly

I would like to know if I can modify the exe file from either bitcrack, VanBitCracken or VBCr to perform my search or is there another program?


PS: Create a code in python that more or less does the following:

Creates a random 32 byte hex key, then converts it to its respective WIF key both compressed and decompressed, then checks if the compressed and decompressed address of that address matches any address in btc.txt, if so it saves it to found. txt, if it does not find anything it will continue searching until it finds a match OR until it stops the program. What I mean is that in python I have achieved my goal and I would like to do the same but with my gpu

This is the result of my python file WITHOUT GPU and using 4 processors out of 16:

Generated: 20400000 (SHA-256 - HEX)
Last generated key in hexadecimal: 13d0f03fab9c75a97fa6492b8b832b0ce7b11b8cc30f25e8eb1164b9fbc57ded
Compressed Bitcoin address: 1LZfGfy88QjBVkB3DTqpjFwonStb93Bed4
Decompressed Bitcoin address: 1DUXqLAJch8pncVKf63HZBefaKT3b81p5E
Generation rate: 4497.490059165694 keys per second

Generated: 20500000 (SHA-256 - HEX)
Last key generated in hexadecimal: f55599ce4720d4061894e644b99e190ffebb758c7780572e43651e9d622c2f69
Compressed Bitcoin address: 1Nr4BuyWgxS6Bmd4WzUZrkRFZHM6FQcqXp
Decompressed Bitcoin address: 1FgYyC5RAQwr8AUqHH7CP7Sx52avAJYtb
Generation rate: 4572.502992815531 keys per second



PD: I am aware of the difficulty and luck it takes to get 1 match that is very very very unlikely, but I know what I want and that is it Smiley

PD2: If necessary, I could search O randomly OR sequentially, for example I would put from 20% to 40% of the total range, I would scan that range randomly and sequentially for a few days or weeks, and then I would go to the range 40% 60% and so and one last question
Post
Topic
Board Project Development
VanBitCracken - a program to use for 32 BTC challenge (supports RTX 30xx cards)
by
CatalanaBTC
on 01/10/2023, 13:11:23 UTC
Good afternoon, I hope everything is well.

My idea is the following:

I have a BTC.txt file, which has all addresses with a balance greater than 0 starting with 1 (both compressed and uncompressed) (BTC.TXT IS 19 GB AND has 1 btc address in each line)

I want to run bitcrack, VanBitCracken or VBCr which work perfectly, but when I put -i btc.txt, in bitcrack it stays loading for about 6 hours and is removed, and in VanBitCracken and VBCr it doesn't seem to read it directly

I would like to know if I can modify the exe file from either bitcrack, VanBitCracken or VBCr to perform my search or is there another program?


PS: Create a code in python that more or less does the following:

Creates a random 32 byte hex key, then converts it to its respective WIF key both compressed and decompressed, then checks if the compressed and decompressed address of that address matches any address in btc.txt, if so it saves it to found. txt, if it does not find anything it will continue searching until it finds a match OR until it stops the program. What I mean is that in python I have achieved my goal and I would like to do the same but with my gpu

This is the result of my python file WITHOUT GPU and using 4 processors out of 16:

Generated: 20400000 (SHA-256 - HEX)
Last generated key in hexadecimal: 13d0f03fab9c75a97fa6492b8b832b0ce7b11b8cc30f25e8eb1164b9fbc57ded
Compressed Bitcoin address: 1LZfGfy88QjBVkB3DTqpjFwonStb93Bed4
Decompressed Bitcoin address: 1DUXqLAJch8pncVKf63HZBefaKT3b81p5E
Generation rate: 4497.490059165694 keys per second

Generated: 20500000 (SHA-256 - HEX)
Last key generated in hexadecimal: f55599ce4720d4061894e644b99e190ffebb758c7780572e43651e9d622c2f69
Compressed Bitcoin address: 1Nr4BuyWgxS6Bmd4WzUZrkRFZHM6FQcqXp
Decompressed Bitcoin address: 1FgYyC5RAQwr8AUqHH7CP7Sx52avAJYtb
Generation rate: 4572.502992815531 keys per second



PS: I am aware of the difficulty and luck it takes to get 1 match that is very very very unlikely, but I know what I want and that is it Smiley