Topic: VanitySearch (Yet another address prefix finder) - page 20. (Read 32072 times)

It would be a huge security risk to have it run sequentially. Imagine if I were to try to get bc1qw and since it runs sequentially, another person also gets the same bc1qw address.  It has a RNG to ensure the randomness.
Vanity gen brute forces using the given split public key. When it gets the correct solution, it'll produce your part public key and part private key. Give the private key combine with their part private key and the address will be as defined in the pattern.

But i thought the way VanitySearch works is similar to bitcrack (sequentially) and not random. Doesn't that mean if 10 people start working on the same string you provided that they would all go through the same exact process and duplication?

Also on a separate note. For argument's sake lets say we run this for nearly 150 years and our grandsons get a match. Isn't there still a high possibility that since you defined only partial public key that the results would not be the exact same key? e.g. you've been waiting 100+ years for 1qwertyuiopBBBBBBOOOOO but your grandson gets 1qwertyuiopBBBBBZZZZZ instead?

Something similar to what people are doing on this site http://www.ttdsales.com/64bit/login.php they are going after key #64 https://www.blockchain.com/btc/address/16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN

Split key generation could work. What you could do is to post your part public key and get people to help you find it and split the reward with whoever gets the correct solution. I don't think there is a verifiable way to validate contributed computing power, or at least none that I've seen.

This[1] was one of the first few vanity pools but I don't think it is pretty active nowadays.

[1] https://vanitypool.appspot.com/

Make it like a mining pool, get paid based on contributed computing power? Scedule a online search day/event, it would be a feat that's history book worthy too.
As long as we can get that time estimate down to less then a week or less ,
I cant help but think I've seen guys use fpga applications in remote situations while brute forcing keyphrases
I could be wrong it could be off base too.

*do a 10%(idk) dev fee for whoever writes it up and solution finder gets 10% , the rest get paid accordingly based on submitted hashpower? 

The data could be used to calculate scenarios

 I love the idea but I just did a quick estimate based on my RTX 2070 which gives a 50% probability in 177.7 years using VanitySearch.

 177.7years x 365.24days/year x 24hrs/day x 0.175Watts x 0.10 dollars/kWh = 27259.32 dollars

 and the 1.2 BTC prize is currently worth ~ 28240 dollars (from Preev.com)

 Even if we were lucky, splitting the prize would more than likely result in a loss;  I chose 0.10 $/kWh as n nice easy number to work with but my electricity is almost 0.20 $/kwhr and some are even higher.   The average American pays 13 cents per kWh (electricchoice.com/electricity-prices-by-state/) for electricity.

Sounds doable, considering there are pools on the Internet for finding prime numbers. In this case the nodes would connect to the server and when someone requests for a prefix generated, the elliptic curve stuff is split among all the workers without sending the actual intermediate keys anywhere (maybe a hash of the key if it's really required). That should solve privacy issues.

Or we could go the peer-to-peer route where each VanitySearch instance is its own server, and a node would use a distributed tracking service to find nodes to connect to in order to pool the elliptic curve stuff. And here there is no central server which can be compromised.

Downside to both of these is that people are not going to pool for free, so there has to be some financial incentive to join a prefix pool like the kind of reward you have.

mutual trust or remote console proofing

*I highly doubt there will be duplicates lol - odds are almost 0

** But you've sparked an idea ! What if we could submit worked keys to a live server that other workers are working too?  Or remote cluster our machines together to generate a single kps output?  You know make vanitypool a solve pool too.

AFAIK, VanitySearch can't connect systems together as nodes to divide the keys among for searching, it can only run an independent search when multiple systems are involved. So how are you going to make this work out without you and your prospective partner(s) searching a bunch of duplicate keys?

Anyone want to work 1qwertyuiop with me for a month or so and profit split?
I'll be running 2x v100s to solve.
Reward is 1.2BTC

Apparently JeanLucPons is busy with other things - which I quite understand.

Updated VanitySearch to support the latest NVIDIA architecture.
Please here is the link:

https://github.com/zielar2/VanitySearch

IMPORTANT! To compile you need the latest CUDA Toolkit, version 11.1!
I have already compiled that for all: https://github.com/zielar2/VanitySearch/releases/download/1.19.2/VanitySearch.exe

Let me know if it helped and show off your performance.
Please let me know any other users that all work or if you find any issues.

Hey JeanLuc
tried on linux got no compilation error even with CCAP=8.6    ...  windows is driving me nuts

on the illegal memory access issue when searching complete addresses..
does it help you to know that every gridsize x1 is working but every x2 x128 whatever is throwing that error?
i can take 83968x1 and it is working (slow but working) 1x1 working 1x2 error

cuda-memcheck.. same func call comp_keys_comp

GPU: GPU #0 GeForce RTX 3090 (82x0 cores) Grid(656x128)
========= Misaligned Shared or Local Address
=========     at 0x00008980 in comp_keys_comp(unsigned short*, unsigned int*, unsigned long*, unsigned int, unsigned int*)
=========     by thread (86,0,0) in block (300,0,0)


i'm still not good enough to degug that correctly

btw. when i start the release version 1.19

GPU: GPU #0 GeForce RTX 3090 (82x0 cores) Grid(656x128)

82x0 ? what does that mean? is there some division by 0 happening and thats why there are misaligned addresses?

i'm trying to compile the code with VisualStudio19 for CCAP 8.6 (cuda 11.1 rtx 3090)
i adjusted the path in vanitysearch.vcxproj
do i need to add compute_80,sm_80;compute_86,sm_86; to the CodeGeneration section? or change 'ReleaseSM30|x64'">compute_30,sm_30
(read somewhere that the linux driver hast not jet implementet sm86 so i didnt try on linux jet)

would there be any other changes nessecary since every cuda core can now compute two FP32 simultaniously (or one INT32 and one FP32)

anyway since i dont know much about cuda (is there some book or course anyone can recommend?) i get the generic MSB3721 error and dont know how to fix it.

looks like i need to do something with nvcc but havent a clou what
can anyone help?

Fehler   MSB3721   Der Befehl ""C:\Program Files\NVIDIA GPU Computing Toolkit\CUDA\v11.1\bin\nvcc.exe" -gencode=arch=compute_30,code=\"sm_30,compute_30\" --use-local-env -ccbin "C:\Program Files (x86)\Microsoft Visual Studio\2019\Community\VC\Tools\MSVC\14.28.29333\bin\HostX86\x64" -x cu   -I"C:\Program Files\NVIDIA GPU Computing Toolkit\CUDA\v11.1\include" -I"C:\Program Files\NVIDIA GPU Computing Toolkit\CUDA\v11.1\include"     --keep-dir x64\ReleaseSM30 -maxrregcount=0 --ptxas-options=-v --machine 64 --compile -cudart static     -DWITHGPU -D_CRT_SECURE_NO_WARNINGS -DWIN32 -DWIN64 -DNDEBUG -D_CONSOLE -D_MBCS -Xcompiler "/EHsc /W3 /nologo /O2 /Fdx64\ReleaseSM30\vc142.pdb /FS /Zi  /MD " -o x64\ReleaseSM30\GPUEngine.cu.obj "C:\Users\bx\Desktop\VS\119\VanitySearch-1.19\VanitySearch-1.19\GPU\GPUEngine.cu"" wurde mit Code 1 beendet.   VanitySearch   C:\Program Files (x86)\Microsoft Visual Studio\2019\Community\MSBuild\Microsoft\VC\v160\BuildCustomizations\CUDA 11.1.targets   785   

Edit:
looking in cuda 11.1 include paths it only goes up to sm61.. so i need that? i'm comfused.. obviously there is something i dont understand

Any Compiled version of VanitySearch which scan from starting and ending prefixes of particular address something like that,

16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
16jY7qLJnNtLkE51fgNsMqYAZ5i6LqURJm
Or
16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
16fphXLUnzwsBZwW4MpayMyZwFw8DjyXQN

Speaking for Windows, not sure about Linux, but to use multiple GPUs, use this command = -gpu -gpuId 0,1,2,3 (here, the 0,1,2,3 tells the program to use 4 GPUs). No there is no limit; I have used it with a 10 card rig.

complete command line, for GPU only:
VanitySearch -t 0 -gpu -gpuId 0,1,2,3,4,5,6,7,8,9 -o someoutputtextfile.txt 1SomePrefix (or use -i someinput.txt that contains multiple prefixes)

maybe there was similar question  already, sorry if I missed it so I ask anyway.

is it possible to use a GPU rig and if yes, then how?
let's say I have a number of GPU ready, what's my next step would be?
what do I have to specify in the command line?

it seems easy when I just have desktop with one CPU/GPU set bit what about the rig?

also is there a limit on GPUs or can one use as many as he want?

that address was used last 2019-06-22 08:07
and this address ref is
https://github.com/Telariust/VanitySearch-bitcrack/issues/10
https://github.com/Telariust/VanitySearch-bitcrack/issues/8

bc1qa5wkgaew2dkv56kfvj49j0av5nml45x9ek9hz6