-snip- If your two points are: 043EF30130654689A64C864D6DD38760481C55FC525E2C6C7084E2D2D3D4D51BE9F7D86B288C09DDB5311F292285168000E43E4B62201BD8DE23A391DAA8E00CE8
046A6E1DC6F203F7FDD97965892301E5FB995A37318C410543835F0EDCD3456C492A072B9898B93E9EB05F9AD86A97546D83B579BF6EFD3482F93BACA13784496B Then adding them together gives you the following point: 0415CB9594EE936BD14B98139460879BEE6F33B0F7C0CCB293825794D985F595BEAAAD772A2EC81AB6013775E9EDB274EFE2E133E65E58949AC7F25429FB1BB152 If you want to break that in to an x and y coordinate and convert to decimal as you have done, then the coordinates are: x = 9858272149801355672780957992190489068105775500642985285161445958802893804990
y = 77199671246421658177371783275117138254582110578372826724463426751083822428498 if we convert back into hexprvkey as per your addition abc def abc+def = 18AB but what i am looking addition like example in hex prvkeys based on x,y points abc def abc+def = abcdef |
|
|
|
|
if
Ax = 28472748655393009267694063518808149386163109418078082138878164433505686461417 #3ef30130654689a64c864d6dd38760481c55fc525e2c6c7084e2d2d3d4d51be9
Ay = 112103652146063681709271542430359369857619412145509508700963842184555907779816 #f7d86b288c09ddb5311f292285168000e43e4b62201bd8de23a391daa8e00ce8
Bx = 48139720641152563685347991770512702742210610129134046538275528729266911276105 #6a6e1dc6f203f7fdd97965892301e5fb995a37318c410543835f0edcd3456c49
By = 19009808459039115948789087270292949097337312255656245874893769987807919753579 #2a072b9898b93e9eb05f9ad86a97546d83b579bf6efd3482f93baca13784496b
what result will be back from your formula ?
x: 9858272149801355672780957992190489068105775500642985285161445958802893804990
y: 77199671246421658177371783275117138254582110578372826724463426751083822428498
or
x: 8584546547439194144767466770313806210515315127328165539072185327841223593332
y: 36720222448510784205200470825713773455378994828752011866054770511274779895577
|
|
|
|
your formula if write in python, will help me to understand, kindly write python script, thankx
def point_add(Ax, Ay, Bx, By):
"""Point addition of points (Ax, Ay) and (Bx, By)"""
lambda = (By - Ay)/(Bx - Ax)
Cx = lambda**2 - Ax - Bx
Cy = lambda*(Ax - Cx) - Ay
return Cx, Cy # Point (Cx, Cy) = (Ax, Ay) + (Bx, By) Note that you will have to unserialize your hex numbers into integers before you can pass them here. The integer type in Python (unlike in other languages) is infinite-precision. File "main.py", line 33 lambda = (By - Ay)/(Bx - Ax) ^ SyntaxError: invalid syntax |
|
|
|
The formulas in that post are for compressing an X,Y pair into an x- coordinate, and has nothing to do with point addition. I have already given the formula for that in my first post, and that's what I'm going to assume you used to derive your answer: x: 12faae608bd6562562b8f85564664cd1fdcd667f6b24b2b221ef86b9231f4d74
y: 512ee8cd9b34331afd05ccb8d81d1393c150c73ec5695845b731f7e6e0086719
your formula if write in python, will help me to understand, kindly write python script, thankx |
|
|
|
|
P + G = PG
hex prvkey is abc
x: 3ef30130654689a64c864d6dd38760481c55fc525e2c6c7084e2d2d3d4d51be9
y: f7d86b288c09ddb5311f292285168000e43e4b62201bd8de23a391daa8e00ce8
hex prvkey is def
x: 6a6e1dc6f203f7fdd97965892301e5fb995a37318c410543835f0edcd3456c49
y: 2a072b9898b93e9eb05f9ad86a97546d83b579bf6efd3482f93baca13784496b
result = hex prvkey is abcdef:
x: 12faae608bd6562562b8f85564664cd1fdcd667f6b24b2b221ef86b9231f4d74
y: 512ee8cd9b34331afd05ccb8d81d1393c150c73ec5695845b731f7e6e0086719
|
|
|
|
|
abc
023ef30130654689a64c864d6dd38760481c55fc525e2c6c7084e2d2d3d4d51be9
043ef30130654689a64c864d6dd38760481c55fc525e2c6c7084e2d2d3d4d51be9f7d86b288c09d db5311f292285168000e43e4b62201bd8de23a391daa8e00ce8
def
036a6e1dc6f203f7fdd97965892301e5fb995a37318c410543835f0edcd3456c49
046a6e1dc6f203f7fdd97965892301e5fb995a37318c410543835f0edcd3456c492a072b9898b93 e9eb05f9ad86a97546d83b579bf6efd3482f93baca13784496b
abcdef
0312faae608bd6562562b8f85564664cd1fdcd667f6b24b2b221ef86b9231f4d74
0412faae608bd6562562b8f85564664cd1fdcd667f6b24b2b221ef86b9231f4d74512ee8cd9b343 31afd05ccb8d81d1393c150c73ec5695845b731f7e6e0086719
here abc is 1 point, and 2nd point is def
if we can join or merge like abc add to def
where result would be abcdef point
abc+def = 18AB
one new func could be inside
like abc+def = abcdef
like point +point = pp ( line extended) ( not 2p)
point 1
point 2
a =1+2 = 3
more advance looking func
point 1
point 2
a =1+2 = 12
any ecc expert, can explain about this addition apply?
maybe it will called Point concatenate
|
|
|
|
bro you know how this series genrated and what logic used behind this formula.
1
11
111
1000
10101
110001
1001100
11100000
not really I'm not very experienced in Python .. are these the keys which were found for this puzzle? if yes please let me know. geenrate use crunch with two digit 0 and 1 and length as your required |
|
|
|
some error on all bitcrack all version include original may be only me error only happen on my laptop when run script batch file and bitcrack struck with scan not finish bitcrack should be open scan and close by fast but when feel while minute bitcrack will be scan and not finish and continue run non stop start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qL.txt --keyspace 8b9052780c6a8800:8b9072780c6a9000 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qL.txt --keyspace 98b9b228d0d42800:98b9d228d0d42800 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qL.txt --keyspace 9e4b41ba17b24800:9e4b61ba17b24800 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qL.txt --keyspace a4f4e25630790000:a4f5025630790000 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qL.txt --keyspace af55ec59c335c800:af560c59c335c800 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qL.txt --keyspace b19d5e1486268800:b19d7e1486268800 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qL.txt --keyspace b3801ec84da91000:b3803ec84da91000 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qL.txt --keyspace b78a6e102a66c000:b78a8e102a66c800 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qL.txt --keyspace c1e9922ae9ebc000:c1e9b22ae9ebc000 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qL.txt --keyspace d26e02d90c69b000:d26e22d90c69b000 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qL.txt --keyspace d41c489a82d93000:d41c689a82d93000 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qL.txt --keyspace d7034c8d37df7800:d7036c8d37df8000 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qL.txt --keyspace d8f5407ad846b000:d8f5607ad846b000 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qL.txt --keyspace e92d8770f9568800:e92da770f9569000 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qL.txt --keyspace ea1a4c66dcc11800:ea1a6c66dcc12000 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qL.txt --keyspace f99cadfb599ed000:f99ccdfb599ed000 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qL.txt --keyspace fc0791825367b800:fc07b1825367c000 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qLJnxb7CHZ.txt --keyspace 8b9062780c5b45c0:8b9062780c79d240 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qLJnxb7CHZ.txt --keyspace 98b9c228d0c4e5c0:98b9c228d0e36a40 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qLJnxb7CHZ.txt --keyspace 9e4b51ba17a305c0:9e4b51ba17c18a40 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qLJnxb7CHZ.txt --keyspace a4f4f2563069bdc0:a4f4f25630884240 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qLJnxb7CHZ.txt --keyspace af55fc59c32685c0:af55fc59c3450a40 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qLJnxb7CHZ.txt --keyspace b19d6e14861745c0:b19d6e148635ca40 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qLJnxb7CHZ.txt --keyspace b3802ec84d99cdc0:b3802ec84db85240 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qLJnxb7CHZ.txt --keyspace b78a7e102a577dc0:b78a7e102a760a40 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qLJnxb7CHZ.txt --keyspace c1e9a22ae9dc7dc0:c1e9a22ae9fb0240 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qLJnxb7CHZ.txt --keyspace d26e12d90c5a6dc0:d26e12d90c78f240 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qLJnxb7CHZ.txt --keyspace d41c589a82c9edc0:d41c589a82e87240 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qLJnxb7CHZ.txt --keyspace d7035c8d37d035c0:d7035c8d37eec240 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qLJnxb7CHZ.txt --keyspace d7035c8d37d035c0:d8f5507ad855f240 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qLJnxb7CHZ.txt --keyspace d8f5507ad8376dc0:e92d9770f965d240 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qLJnxb7CHZ.txt --keyspace ea1a5c66dcb1d5c0:ea1a5c66dcd06240 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qLJnxb7CHZ.txt --keyspace f99cbdfb598f8dc0:f99cbdfb59ae1240 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
start /wait cuBitCrack.exe --device 0 -c -u -o 16jY7qLJnxb7CHZ.txt --keyspace fc07a182535875c0:fc07a18253770240 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
mistake in your command, puzzle address already confirmed its compressed address, you are useing command for search compressed and uncompressed, -c -u, it will eat your speed start /wait cuBitCrack.exe --device 0 -c -u remove -u from you command for better speed |
|
|
|
Great job! I will try this on my T4, so compute 75 (it's taking some time to compile as usual). [EDIT - I just did, unfortunately that idiot misaligned address error is still there but since I sorta found what is being misaligned I think it's just a matter of making a couple of 32-bit pointer arrays 64-bit.] I also noticed you fixed the bug that made clBitCrack skip way too many points than it should - I remember there was someone here complaining that the search finished too quickly. You should probably change the COMPUTE_CAP variable in the Makefile though - It's still at the default 30 although it will not compile on that compute cap. I can give you a bash script that autodetects the CUDA version using the deviceQuery example program. I'm using it in my Makefile for another project (custom Kangaroo) that I haven't released yet.
Wait an idea just hit me. All of the 256bit numbers are stored in 32-bit bits so if all of that gets upgraded to 64-bits then we will have just doubled the speed of this program while also destroying the misaligned access error (because I suspect that Volta/Turing/Ampere will no longer align array elements across 32-bits, only 64 or 128). all fork including orginal ver of bitcrack have bug, result address wrong print follow ./cuBitCrack -b 7 -t 512 -p 1156 11HWBme5fYis2SZ5PXLL5qEj9L3vxUVtZ -o new0321.txt -c -u [2021-03-21.00:38:24] [Info] Compression: both [2021-03-21.00:38:24] [Info] Starting at: 0000000000000000000000000000000000000000000000000000000000000001 [2021-03-21.00:38:24] [Info] Ending at: FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364140 [2021-03-21.00:38:24] [Info] Counting by: 0000000000000000000000000000000000000000000000000000000000000001 [2021-03-21.00:38:24] [Info] Initializing GeForce GTX 460 [2021-03-21.00:38:24] [Info] Generating 4,143,104 starting points (158.0MB) [2021-03-21.00:38:25] [Info] 10.0% [2021-03-21.00:38:25] [Info] 20.0% [2021-03-21.00:38:25] [Info] 30.0% [2021-03-21.00:38:25] [Info] 40.0% [2021-03-21.00:38:26] [Info] 50.0% [2021-03-21.00:38:26] [Info] 60.0% [2021-03-21.00:38:26] [Info] 70.0% [2021-03-21.00:38:26] [Info] 80.0% [2021-03-21.00:38:26] [Info] 90.0% [2021-03-21.00:38:26] [Info] 100.0% [2021-03-21.00:38:26] [Info] Done [2021-03-21.00:38:26] [Info] Found key for address '1HWBme5fYis2SZ5PXLL5qEj9L3vxUVtZ'. Written to 'new0321.txt' [2021-03-21.00:38:26] [Info] No targets remaining original address for search, and reult print next 11HWBme5fYis2SZ5PXLL5qEj9L3vxUVtZ and reult print next 1HWBme5fYis2SZ5PXLL5qEj9L3vxUVtZ check these addresses same original addresses 111oGz8t35hUQunGAvhwkBTJuzXVMr3j 1111BxbRo6FeiBX8tegyzCk9jCnmBe7SE 111HfAJagjbBRw2N9zfQVucXoPi2znNjr 11HWBme5fYis2SZ5PXLL5qEj9L3vxUVtZ 11Af6ENu11SZiw3tCoXVGE5JxjmTAhjFr result 1oGz8t35hUQunGAvhwkBTJuzXVMr3j 1BxbRo6FeiBX8tegyzCk9jCnmBe7SE 1HfAJagjbBRw2N9zfQVucXoPi2znNjr 1HWBme5fYis2SZ5PXLL5qEj9L3vxUVtZ 1Af6ENu11SZiw3tCoXVGE5JxjmTAhjFr |
|
|
|
Can possible brute force public key hash to public key?
Its is double hashed (sha256 and ripemd160), so that is impossible in practice, even if an algorithm for finding collisions in one of the hashes will be invented. Thank I think for address not show public key (full) use bitcrack brute force directly may be easy than address => bitcrack ==> private key public key ==> Pollard-kangaroo ==> private key public key hash ==> public key ==> Pollard-kangaroo ==> private key problem bitcrack don't know scope of keyspace if can possible get public key hash to public key may be can use kangaroo other option fine more use bitcrack random public key => ripemd160 => public key address => bitcrack ==> private key public key ==> Pollard-kangaroo ==> private key public key hash ==> public key ==> Pollard-kangaroo ==> private key address/public key ==> brainless ==> private key |
|
|
|
thankx God, found he is live and maybe busy in dome project, as his listed bitcoin address in his profile bc1qthrhmdmfawq6w4lzmjrce3reuxt06pvvnhpkj6 used on 5th feb 2021, receive and send indicate he is live and getting his money for his work/assignments |
|
|
|
good evening to all enthusiasts.
I found many versions and modifications of this project. In addition to the original branch from the respected brichard19, I found a branch with a random search. Should I use it? the better or worse it is.
in the original branch, everything is simple (start + step + step + N step)
random points are generated in the branch. but I don’t understand after the generation, the search proceeds further by random choice or also (random point + step + step + N step)
Are you talking about the points being chosen by an RNG? I am not totally sure how long does the process of generating random numbers takes because I haven't measured it, but I'd say it could take a noticeable percentage of the time it takes to check a private key. I still feel like pregenerating a bunch of keyspace ranges beforehand and passing those to bitcrack serially is a better approach at randomization than generating a random number 2^X times per second (X is an arbitrary number proportional to the speed of your GPU). Anyway it would be nice if you linked that version of Bitcrack you're talking about so we can take a look at it's commit history to see what it changed. He is probably talking about Pica's version with random feature. Many say it had some bugs in it. I neve used it. My version generates millions of random starting points, in the bit range you desire, and then counts sequentially, from each of those random starting points. So if you only want to look in the 8F00000000000000 range, it will generate millions of starting points all starting with 8F, and then compute sequentially. It doesn't take long to generate the points, no longer than generating Kangaroos. It's fast at finding keys in any 2^48 range, but above that, It's better to just search sequentially starting with one key. IMO. So if we took #64 puzzle, and assigned people the front 2^16 range, example 8F00, and another person 8F01, and another person 8F02, etc. all the way to 8FFF, then we only need 256 people to check the 8F range quickly. Now, once that range is done, start with another one like 80, 81, 82, 83, C0, C1, etc. Who's in?! lol  we have talked before for bitcrack modification, you modified, you tested with me, and said you lost codes, and no plan to share with me and community, maybe you afraid, some one could pick 64 puzzle and other puzzle, maybe you have your own interest |
|
|
|
What speed did you see with 3070? Source code available on github, to compile for Windows? 3070 with 45 256 2096 - 1845Mkeys/s Ive tried to make the same modifications to the VS project files and it wont compile for me. Also i am not familiar enough with VS to begin with. what code did you modify? I can create windows if you tell me what you modified... I changed in the makefile # CUDA variables COMPUTE_CAP=75 NVCC=nvcc NVCCFLAGS=-std=c++11 -gencode=arch=compute_${COMPUTE_CAP},code=\"sm_${COMPUTE_CAP}\" -Xptxas="-v" -Xcompiler "${CXXFLAGS}" CUDA_HOME=/usr/local/cuda-11.2 CUDA_LIB=${CUDA_HOME}/lib64 CUDA_INCLUDE=${CUDA_HOME}/include CUDA_MATH=$(CUR_DIR)/cudaMath # OpenCL variables OPENCL_LIB=${CUDA_LIB} OPENCL_INCLUDE=${CUDA_INCLUDE} OPENCL_VERSION=112 Ive tried modifying the .props to change <CUDA_INCLUDE>C:\Program Files\NVIDIA GPU Computing Toolkit\CUDA\v10.1\include</CUDA_INCLUDE>
<CUDA_LIB>C:\Program Files\NVIDIA GPU Computing Toolkit\CUDA\v10.1\lib\x64</CUDA_LIB>
<OPENCL_INCLUDE>C:\Program Files\NVIDIA GPU Computing Toolkit\CUDA\v10.1\include</OPENCL_INCLUDE>
<OPENCL_LIB>C:\Program Files\NVIDIA GPU Computing Toolkit\CUDA\v10.1\lib\x64</OPENCL_LIB> [/color] to <CUDA_INCLUDE>C:\Program Files\NVIDIA GPU Computing Toolkit\CUDA\v11.2\include</CUDA_INCLUDE>
<CUDA_LIB>C:\Program Files\NVIDIA GPU Computing Toolkit\CUDA\v11.2\lib\x64</CUDA_LIB>
<OPENCL_INCLUDE>C:\Program Files\NVIDIA GPU Computing Toolkit\CUDA\v11.2\include</OPENCL_INCLUDE>
<OPENCL_LIB>C:\Program Files\NVIDIA GPU Computing Toolkit\CUDA\v11.2\lib\x64</OPENCL_LIB> [/color] Then building the CudaKeyFinder and KeyFinder in VS2019 (Release x64) but it will not work for me, I am most likely doing something wrong. P.S. When running on linux the most up to date cuda drivers had no problems running on my 2080, 2080ti, and 3070. there is most likely just a problem with the last release and the compute capability with cuBitCrack from brichard19. here no only cuda ver problem, cuda 11 is ok, problem is about your gcc and g++ versions, simple install other gcc and g++ ver from 4.8 to 8.0, ( version 4.8, 5.0, 5.4, 6, 7, 7.2,  and next dont fix default, simple install, and then change Makefile # C++ options CXX=g++ CXXFLAGS=-O2 -std=c++11 # CUDA variables COMPUTE_CAP=30 NVCC=nvcc now chnage only line CXX=g++ to CXX=g++-4.8 and then run run Make cuda, if no error, then change CXX=g++ to CXX=g++-5.0 and same run setup make if error then try with next g++ ver like above commands, some where your program will isntall and run success update here your works |
|
|
|
What speed did you see with 3070? Source code available on github, to compile for Windows? 3070 with 45 256 2096 - 1845Mkeys/s Ive tried to make the same modifications to the VS project files and it wont compile for me. Also i am not familiar enough with VS to begin with. what code did you modify? I can create windows if you tell me what you modified... I changed in the makefile # CUDA variables COMPUTE_CAP=75 NVCC=nvcc NVCCFLAGS=-std=c++11 -gencode=arch=compute_${COMPUTE_CAP},code=\"sm_${COMPUTE_CAP}\" -Xptxas="-v" -Xcompiler "${CXXFLAGS}" CUDA_HOME=/usr/local/cuda-11.2 CUDA_LIB=${CUDA_HOME}/lib64 CUDA_INCLUDE=${CUDA_HOME}/include CUDA_MATH=$(CUR_DIR)/cudaMath # OpenCL variables OPENCL_LIB=${CUDA_LIB} OPENCL_INCLUDE=${CUDA_INCLUDE} OPENCL_VERSION=112 Ive tried modifying the .props to change <CUDA_INCLUDE>C:\Program Files\NVIDIA GPU Computing Toolkit\CUDA\v10.1\include</CUDA_INCLUDE>
<CUDA_LIB>C:\Program Files\NVIDIA GPU Computing Toolkit\CUDA\v10.1\lib\x64</CUDA_LIB>
<OPENCL_INCLUDE>C:\Program Files\NVIDIA GPU Computing Toolkit\CUDA\v10.1\include</OPENCL_INCLUDE>
<OPENCL_LIB>C:\Program Files\NVIDIA GPU Computing Toolkit\CUDA\v10.1\lib\x64</OPENCL_LIB> [/color] to <CUDA_INCLUDE>C:\Program Files\NVIDIA GPU Computing Toolkit\CUDA\v11.2\include</CUDA_INCLUDE>
<CUDA_LIB>C:\Program Files\NVIDIA GPU Computing Toolkit\CUDA\v11.2\lib\x64</CUDA_LIB>
<OPENCL_INCLUDE>C:\Program Files\NVIDIA GPU Computing Toolkit\CUDA\v11.2\include</OPENCL_INCLUDE>
<OPENCL_LIB>C:\Program Files\NVIDIA GPU Computing Toolkit\CUDA\v11.2\lib\x64</OPENCL_LIB> [/color] Then building the CudaKeyFinder and KeyFinder in VS2019 (Release x64) but it will not work for me, I am most likely doing something wrong. P.S. When running on linux the most up to date cuda drivers had no problems running on my 2080, 2080ti, and 3070. there is most likely just a problem with the last release and the compute capability with cuBitCrack from brichard19. correct your line NVCCFLAGS=-std=c++11 -gencode=arch=compute_${COMPUTE_CAP},code=sm_${COMPUTE_CAP} -Xptxas="-v" -Xcompiler "${CXXFLAGS}" |
|
|
|
|
you discussion about sort and remove duplicate , and make list available raw and sorted
my system is i3-6100 processor with 16gb ddr4 ram, and i am managing there all sort and remove duplicate from raw 19gb file within 1 hour, on work daily data is just few min job
let me explain
simple do
sort raw.txt >> sorted.txt
split -l 50000000 sorted ( it will split filesstarting with name xaa next xab....)
next is remove duplicate by perl for fast and aprox can load 3gb file, but we make it more fast by selecting 50m lines
perl -ne'print unless $_{$_}++' xaa > part1.txt
2nd file
perl -ne'print unless $_{$_}++' xab > part2.txt
last you have compelete all files within 1 hour
now combine all file
cat part*.txt >> full-sorted.txt
or like sorted ( selected all part1.txt... part10.txt )
cat part1.txt part2.txt part3.txt >> full-sorted.txt
stage 2
2nd group you can continuous onword 21 dec 2020, all daily update files, combine, sort and remove duplicate
you name it new-group.txt
command is
join new-group.txt full-sorted.txt >> filter1.txt
here filter.txt is common on 2 files(new-group.txt and full-sorted.txt)
now need remove filter.txt from newgroup.txt for get pure only new addresses
awk 'FNR==NR{ a[$1]; next } !($1 in a)' filter.txt new-group.txt >> pure-new-addresses.txt
stage 3
if you still need all in one file
combine pure-new-address.txt and full-sorted.txt
cat pure-new-address.txt full-sorted.txt >> pre-full-sorted.txt
sort pre-full-sorted.txt >> new-full-addresses
its recomemnded leave 1 file as last created on 21 dec 2020
start 2nd file onword, perform only stage 2, you will have only new addresses which is no apear in first 19gb file
hope i try to explain all points, and will help you and community , any further info, ask me , love to provide info what ever i have
|
|
|
|
Due to another VPS that decided to run off with my prepayment (Lol: for 2 weeks), this data is currently unavailable. I'm not sure yet where to move, if it takes too long I'll upload the data elsewhere (but in that case without regular backups). Update: I've uploaded the latest version to a temporary location: blockdata.loyce.club/alladdresses/. daily updates also need to be post there, if possible, Thankx |
|
|
|
|
Jeanluc not apear from
Last Active: October 31, 2020, 10:19:32 AM
any one have in contact with him, live not infected covid19, all ok with him,
from june most GPU developer are goes offline, like BitCrack, Alek-76, Telaurist, other same worked on forked, all offline from long time, no more GPU based developments,
any comments ?
|
|
|
|
|
Show Posts
