Program for searching addresses bitcoin and ethereum based on files with a list

[WanderingPhilospher]

firstly.
if you knew how search algo's work. they never actually search through all 100m
secondly the search is not 1m *500m
its more like 500m GPU processes+1mill CPU search cycles
meaning more like 501mill

after all it does not do 500m. look at first file record. do 500m look at second file record
its 500m then look at upto 1m file records.
so 500m+1m is more accurate based on your numbers

anyway now we are just knitpicking numbers when the whole point is.. goodluck asking your 1000th generation descendants to carry on the project

by that point all the current 80m UTXO would have been spent. lost or converted to new UTXO using a different algo

but keep it up. only a few millenia to go

That is not how this program works, I'm not talking about any search algo.

The program checks for matches, each time a key is converted. Period.

So in your mind, how does a program work that checks 2,000,000,000 to 3,000,000,000 keys per second for 1 key work?

[1714932442]

1714932442

[1714932442]

1714932442

[1714932442]

1714932442

[1714932442]

1714932442

[franky1]

firstly.
if you knew how search algo's work. they never actually search through all 1m
secondly the search is not 1m *500m
its more like 500m GPU processes+1mill CPU search cycles
meaning more like 501mill

That is not how this program works, I'm not talking about any search algo.

The program checks for matches, each time a key is converted. Period.

So in your mind, how does a program work that checks 2,000,000,000 to 3,000,000,000 keys per second for 1 key work?

well it seems you are doing things the most inefficient way possible.
lets help you save some processes
instead of having a single file of UTXO's and their balance .. where the record is not organised and not indexed...
you could organise them into folder A subfolder AA
                                           folder A subfolder AA
                                           ..           ..
                                           folder 9 subfolder 99
where it organises the utxo into their first 2 hex bits
then instead of having to search all 1mill records. it can just search the file with the same 2 leading hex
meaning only ~3900 searches

you can also then delve into indexes and pointers so that it can then find and specific record without needing to read the whole file of 3900 records. saving you even more search time

if you organise your UTXO database each key creation is 1 UTXO search. at the very most.
there are other ways to decrease this too.. by organising by the first 6 leading hex and disqualifying any results that dont fit thus not even need to search

there is even ways to batch search


as for the math.
you are now being pedantic and knitpicky. whilst missing the point
so one final time

pick any large number your brain can conceive as what you want to pretend that your GPU can handle...
but be semi realistic to the real world
and then realise you will still be seeking your descendants a millenia+ in time to help continue the project

..
but if you want to make an argument about how much your GPU has a hard-on and how asics are limp..
you will lose.
so just accept it and move on

edit to reply to below
goodluck continuing your fantasy of 61000 terrahashes on a GPU.. seems your multiplication is misplaced by atleast 3-6 significant figures

if an asic can do 110terrehash of double sha
and you say your GPU can do 61000 terrahash of ECDSA+sha+ripemd160
then you really cant grasp the numbers

no GPU is hundred of times faster at just the sha part compared to an asic
after all its you that is saying that your GPU can do 61000 terrahashs of single sha operations.

as for your post your numbers change
first its 500m then its 2 or 3 billion..

and 2billion keys you say vanity gen does....
thats 2gigahash.. meaning 0.002 terrahash.... definitely not 61000 terrahash
1,000=1 khash (0.000,000,001 thash)
1,000,000=1 mhash(0.000,001 thash)
1,000,000,000= 1 ghash(0.001 thash)

one last time your GPU using vanitygen does 2Ghash = 0.002 Thash
having to then search records means less than 0.002 thash

[WanderingPhilospher]

firstly.
if you knew how search algo's work. they never actually search through all 1m
secondly the search is not 1m *500m
its more like 500m GPU processes+1mill CPU search cycles
meaning more like 501mill

That is not how this program works, I'm not talking about any search algo.

The program checks for matches, each time a key is converted. Period.

So in your mind, how does a program work that checks 2,000,000,000 to 3,000,000,000 keys per second for 1 key work?

well it seems you are doing things the most inefficient way possible.
lets help you save some processes
instead of having a single file of UTXO's and their balance randomly
you could organise them into folder A subfolder AA
                                           folder A subfolder AA
                                           ..           ..
                                           folder 9 subfolder 99
where it organises the utxo into their first 2 hex bits
then instead of having to search all 1mill records. it can just search the file with the same 2 leading hex
meaning only ~3900 searches

you can also then delve into indexes and pointers so that it can then find and specific record without needing to read the whole file

as for the math.
you are now being pedantic and knitpicky. whilst missing the point
so one final time
pick any large number your brain can concieve as what you want to pretend that your GPU can handle...
and you will still be seeking your decendants a millenia+ in time to help continue the project

..
but if you want to make an argument about how much your GPU has a hard on and how asics are limp..
you will lose. that too
so just accept it and move on

Haha....again, I never said anything about asics. Check my post in this thread, there really ain't no bitch about it. Period. Zero said against asics.

You do not know how the program works. It stores so it doesn't reread each key visited.

Also, I am not searching for any utxo and a balance.  The test I ran revolved around 1 pubkey and 39 million relatives of that 1 pubkey. It was just a test, a benchmark before trying to get into bloom filter/storing input file elsewhere.

so one final time, pick any math or there lack of that your brain can or cannot conceive and let that be your way of thinking.

I'll refer you to my post, in case you can't scroll up or down or use page buttons:

With one GPU (RTX 2070), with a limited test run, I can get 61864.26 TH/s, or 62 Petahashes per second.  That means that every second my GPU can search and compare that many h160 combos.

I get your point, it's still a long time and a lot of haystacks.

Notice how I even agreed with you about a lot of haystacks...a long time.

but if you want to make an argument about how I said gpus are dominant over asics, you will lose that too. so just accept that and move on.