Latest posts of: adaris

Bitcoin Forum

June 21, 2024, 10:08:44 AM

Welcome, Guest. Please login or register.

News: Latest Bitcoin Core release: 27.0 [Torrent]

Home

Help

Search

Login

Register

More

Show Posts
Pages: [1]

1

Bitcoin / Project Development / Re: Keyhunt - development requests - bug reports

on: February 28, 2024, 02:58:00 PM

Is it possible to adapt an ASIC miner to this program as a coprocessor because it has higher speed? Or perhaps use MicroRNG is a hardware (true) random number generator?

2

Bitcoin / Project Development / Re: Keyhunt - development requests - bug reports

on: January 15, 2022, 04:08:12 PM

Hello. please help me to calculate the probability of winning puzzle 120 in random mode if i have 20000000001 keysubtract speed 27000000/s what are the chances ? it is more than 0,0002% ?

3

Bitcoin / Project Development / Re: Keyhunt - development requests - bug reports

on: October 24, 2021, 07:15:54 PM

is it possible to add a mode -B danсe to xpoint mode?

4

Bitcoin / Project Development / Re: Keyhunt - development requests - bug reports

on: October 13, 2021, 12:37:34 PM

small calculation of how much RAM is needed to solve 120 puzzles -n 0x100000000000000000000000000000 -k 1 Bloom filter for 288230376151711744 elements = 1.21755226 exabytes ram if Bloom filter for 13967032320 elements = 59.5GB if I didn't mess anything up

5

Bitcoin / Project Development / Re: Keyhunt - development requests - bug reports

on: October 13, 2021, 09:56:34 AM

I have a question about the operating mode -M matrix screen It increases the chances of winning in random mode? this seems to be a bug because I can't see the speed counter in -M mode constantly jumps to the next line Quote ./keyhunt -m rmd160 -f tests/64.rmd -l compress -s 10 -b 64 -R -t 24 -M Quote Base key: b446a02fd6f5381f Base key: cae8a89843ee4ee8 Base key: 82fc18d395467fd4 I do not understand why the creation Bloom filter, became very slow almost 10 times slower. I used the -S key and -M. as I understand the key -S Bloom filter is created on disk/ from here creation Bloom filter the speed drops The previous version of the program directly created bloom in RAM And now it’s impossible?

6

Bitcoin / Development & Technical Discussion / Re: VanitySearch (Yet another address prefix finder)

on: February 17, 2021, 04:02:32 PM

And since I understood if I add a key -r 10 the algorithm begins to generate keys in a random 10Mkey/s and check with a list of existing addresses. it turns into a game who is more successful in this version of the universe Quote VanitySearch.exe -t 0 -gpu -gpuId 0 -g 24,128 -r 10 -i btc.txt -o output.txt [Loading input file 100.0%] VanitySearch v1.19 [Building lookup16 100.0%] [Building lookup32 100.0%] Search: 24381246 addresses (Lookup size 65536,[287,3141]) [Compressed] Start Wed Feb 17 17:57:44 2021 Base Key: Randomly changed every 10 Mkeys Number of CPU thread: 0 GPU: GPU #0 GeForce GT 1030 (3x128 cores) Grid(24x128) Warning, 41264 items lost Hint: Search with less prefixes, less threads (-g) or increase maxFound (-m) [9.28 Mkey/s][GPU 9.28 Mkey/s][Total 2^31.77][Prob 0.0%][50% in 3.46183e+33y][Found 0] I think this is better than generating one key and searching nearby in a small range of matches. my benchmark on GPU GeForce GT 1030 Quote C:\Users\adaris\Desktop\btc\VanitySearch>VanitySearch.exe -check GetBase10() Results OK Add() Results OK : 427.350 MegaAdd/sec Mult() Results OK : 31.716 MegaMult/sec Div() Results OK : 4.322 MegaDiv/sec R1=1000003D1 R2=1000007A2000E90A1 Field characteristic size: 256bits ModInv()/ModExp() Results OK ModInv() Edge cases Results OK .Avg = 6.13 ModInv() Results OK : 445.968 KiloInv/sec ModInv() cycles : 6503.24 ModSqrt() Results OK ! IntGroup.ModInv() Results OK : 5.641 MegaInv/sec ModMulK1() Results OK : 27.392 MegaMult/sec ModSquareK1() Results OK : 31.616 MegaSqr/sec ModInv() Cost : 141.8 S ModMulK1order() Results OK : 3.785 MegaMult/sec Check Generator :OK Check Double :OK Check Add :OK Check GenKey :OK Adress : 15t3Nt1zyMETkHbjJTTshxLnqPzQvAtdCe OK! Adress : 1BoatSLRHtKNngkdXEeobR76b53LETtpyT OK! Adress : 1Test6BNjSJC5qwYXsjwKVLvz7DpfLehy OK! Adress : 16S5PAsGZ8VFM1CRGGLqm37XHrp46f6CTn OK! Adress : 1Tst2RwMxZn9cYY5mQhCdJic3JJrK7Fq7 OK! Adress : 3CyQYcByvcWK8BkYJabBS82yDLNWt6rWSx OK! Adress : 31to1KQe67YjoDfYnwFJThsGeQcFhVDM5Q OK! Adress : bc1q6tqytpg06uhmtnhn9s4f35gkt8yya5a24dptmn OK! Check Calc PubKey (full) 1ViViGLEawN27xRzGrEhhYPQrZiTKvKLo :OK Check Calc PubKey (even) 385cR5DM96n1HvBDMzLHPYcw89fZAXULJP:OK Check Calc PubKey (odd) 18aPiLmTow7Xgu96msrDYvSSWweCvB9oBA:OK GPU: GPU #0 GeForce GT 1030 (3x128 cores) Grid(24x128) Seed: 1613577059 61.751 MegaKey/sec ComputeKeys() found 611 items , CPU check... GPU/CPU check OK

7

Bitcoin / Development & Technical Discussion / Re: VanitySearch (Yet another address prefix finder)

on: February 17, 2021, 12:54:13 PM

I cannot understand what exactly this command gives me. how exactly the search algorithm goes? Quote VanitySearch.exe -t 0 -gpu -gpuId 0 -g 24,128 -i all_btc_balance.txt -o output.txt He starts with a hex key? and ascending searches? Quote 0000000000000000000000000000000000000000000000000000000000000001 or randomly generates a hex key? and ascending searches? Quote 634C5BDB134FBFDD1D32D9E0922D664CA22A9339466D4621D26D3C9D838C2B7C

Pages: [1]

Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines