Curious as to the amount of gear has to run to do what you do.
Also Could a remote miner be added?
Ie I have a rig with 11x rtx a4500 cards and 1x rtx a5000 cards. could it pool to your setup?
I also have 2 rigs with 12x rtx a4000 cards
I know your state is nowhere near NJ but if the project could allow remote rigs to tie in you could do 10 or 12 custom vs 7
Its a yes no thing,
as mentioned here.
We can link miners everywhere/anywhere and grow the MK/S, as for now we cant check key count honesty. We can only determine based on what you input in this software.
We haven't decided if this handler tool will be open source or not. So far the only thing that is OS is the merge tool built off bitaddress.org
To clarify we can do certain difficulties for free in some instances that's up to 7 digits usually in under 5 mins
1Philipma1957's (case insensitive) Difficulty is 36446121614608900096 would take about 130 years with 12000 mk/s for one result that may not even be correct
if it Wasn't splitkey 130~ years on the first try. If you double the the key count, you can half the time estimate.
1Philipma (case insensitive) Difficulty is 3,220,618,963,203 we could get one result every 5 mins. ~ @12000 mk/p
for example just testing it to snag the difficulty
PubAddress: 1PhiLiPMAXUoMbCBqZCJbiVYzjAyQYF9zL
Priv (WIF): p2pkh:L2piDYLuwW4TrYVKtEVQ5kPsBuVFQDRzqeLgwFnUVqzQTV2CF1zV
Priv (HEX): 0xA7314E00BE8FDCCF7C5A7AA2F2BB5AB5672037018A25DEF960503B9D299177F9
got a hit with 1 of 3 machines with the software installed, (wasnt splitkey)
1Philipma19 (case insensitive) Difficulty is 1910834162192214300 putting out 1 result every 10 days or so,
(we go for master key not the others we check your pubkey vs our partialpriv in another headless html pruned version of
bitaddress.org)
So 10 digits is doable , this testing was done on one rig, we have 3 in test with 2 more to add , start tossing in 24 x a4000's and 11x a 4500's we could slim these estimates down a lot ,
Our plan for 9+ digits was to just rent 16x sxm4 lamda rigs,
We've debated releasing an opensource splitkey vanity handler for "Pooling" software does callback with key estimates and we provide discount based on the contributed keyspersecond.
Not case sensitive , but 1PHiLiPMA is going to be fastest route to find
Kinda like mining rig rentals with some slick workarounds for validations instead of full blown pools.
We would autoconfigure your arguments via cli wmic or smi ect and run your results against a database of card speeds that are logged in a database
We have to figure out this difficulty/pivot stuff for precise accuracy though.
If you wanted to run your speeds for me I could give you more accurate estimates based on what I know,
VanitySearch.exe already compiled. with that kind of gear you could surely get 1PhiLiPMA before you go to bed.
Our quotes are broken right now until I get help figuring out the the broken formula in the main post adding the extra *58 operation.
Our quote for 1PHiLiPMA says difficulty=294,545,08,795,143,700 but 1PHiLiPMA is really 51,529,903,411,245 So we have 1 *58 operation too many in the code above.