Search content
Sort by
Showing 20 of 26 results by ee1234ee
Can ASIC mining machines be used to run VanitySearch programs?
I heard that the computing power of ASIC mining machines is equivalent to thousands of GPUs. If you use it to run VanitySearch, it will be very fast.
Can the VanitySearch code be run on ASIC mining machines?
Can the VanitySearch code be run on ASIC mining machines?
Re: I want to find an improved version of VanitySearch, thank you！
more info here : https://bitcointalk.org/index.php?topic=5112311.0
JeanLucPons' VanitySearch version does not have random scanning function
it's a pity
I want to find an improved version of VanitySearch, thank you！
May I ask if there is an improved version based on VanitySearch that supports custom scanning range, custom random scanning mode, and GPU gridSize settings?
It's best to open source on GitHub, thank you
It's best to open source on GitHub, thank you
I downloaded Sparrow, first created a new wallet, and then selected to import it into the Software Wallet. There is a Master Private Key (BIP32) inside, but I found that it can only be imported here,
Private key in xprv/zprv format
May I ask how to import a WIF format private key? Thank you!
Can Slipstream ensure that the public key of the transaction is not leaked?
Slipstream needs to package the transaction area, which requires miners to mine, so miners can definitely obtain the public key. Is Slipstream mining using its own machine?
Does slipstream not allow others to mine to ensure that the public key of the transaction is not leaked?
Re: I would like to ask a question about the puzzles 67 and 68
This topic has been discussed here several times! You're just a dumb idiot trying to get attention, you useless worm.
You fool, if you don't want to answer, don't answer. My native language is not English, so I can't understand many posts, which is why I posted to ask.
May I ask how the solvers of puzzle # 67 and # 68 bypass the public memory pool to prevent transactions from being revoked by others?
Did they use their own machines to mine? Do they have that much computing power?
Which experts can explain the principles and processes in detail? thank you!
Did they use their own machines to mine? Do they have that much computing power?
Which experts can explain the principles and processes in detail? thank you!
Why use JeanLucPons/Kangaroo's program
On my 4060ti machine, the graphics card cannot run to full capacity, displaying 650MKey/s. The graphics card is constantly at a temperature of around 50 degrees Celsius, and the graphics card fan only rotates at 1200 rpm. It is obvious that the graphics card is not running to full capacity.
Does the program need optimization? Where is the reason?
On my 4060ti machine, the graphics card cannot run to full capacity, displaying 650MKey/s. The graphics card is constantly at a temperature of around 50 degrees Celsius, and the graphics card fan only rotates at 1200 rpm. It is obvious that the graphics card is not running to full capacity.
Does the program need optimization? Where is the reason?
Public Key (Hex): 0233c451545bd7be15ef5c62e20ba46d3517c0852536e7d2196777d2b3ad3b831d
Signature 1:
R1 = 0x61bff9a815528c2ef33a3096f650eac34a4a7eccb2b7266e221004245eaf1da9
S1 = 0x130f6d2470e1be99ecc6d64acb38ad4050d4a0a1c71194ac6671dad6b645b47
Z1 = 0xcfa395b2d3a9069352d8a7ba6ea6c673226cb1dc57daddcf8c97000fc5d17256
Signature 2:
R2 = 0xe80fcdf2163ed438c039bc2dfd93f501c65c66c1350a0a9de5c75664715a7e47
S2 = 0x5c2367293704914d3a7d3d5f917570a451864d3bc69e3cf6c91f5cda38a49cf4
Z2 = 0x5d9d720a8bd823ad5a6e37dbe6ffefcbbbbce95da518be3a0452bc1b2e74332a
Signature 3:
R3 = 0x6f3e2ade374268b985929a64f5ab10741caee3762eefc51c65ae185e44a329aa
S3 = 0x26889dd7054e89934f545d85c9ab6540606eef5a7c6027f8a79a6046c7e9363d
Z3 = 0xf768a0b46cef5816c1ac94a4efecf01390c58bc974b1e8fd45a75398313c6dad
The private key and random number are both less than 200 bits.
Can you calculate my private key? I want to try whether what you said is true or false.
Signature 1:
R1 = 0x61bff9a815528c2ef33a3096f650eac34a4a7eccb2b7266e221004245eaf1da9
S1 = 0x130f6d2470e1be99ecc6d64acb38ad4050d4a0a1c71194ac6671dad6b645b47
Z1 = 0xcfa395b2d3a9069352d8a7ba6ea6c673226cb1dc57daddcf8c97000fc5d17256
Signature 2:
R2 = 0xe80fcdf2163ed438c039bc2dfd93f501c65c66c1350a0a9de5c75664715a7e47
S2 = 0x5c2367293704914d3a7d3d5f917570a451864d3bc69e3cf6c91f5cda38a49cf4
Z2 = 0x5d9d720a8bd823ad5a6e37dbe6ffefcbbbbce95da518be3a0452bc1b2e74332a
Signature 3:
R3 = 0x6f3e2ade374268b985929a64f5ab10741caee3762eefc51c65ae185e44a329aa
S3 = 0x26889dd7054e89934f545d85c9ab6540606eef5a7c6027f8a79a6046c7e9363d
Z3 = 0xf768a0b46cef5816c1ac94a4efecf01390c58bc974b1e8fd45a75398313c6dad
The private key and random number are both less than 200 bits.
Can you calculate my private key? I want to try whether what you said is true or false.
Public Key (Hex): 0386747aa730e55346fe6609721350cd84a4f5d22308bcbffc25017c287f1f8b5c
Signature 1:
R1 = 0x471e9702f12cf6872696904e07496589009676aa4720b4c951b2e2253bd1968e
S1 = 0x5934656d4316e4a5b757a7017dde8fb5bf9d040ef9df0d4d8f90cc7d4355a8b2
Z1 = 0xcfa395b2d3a9069352d8a7ba6ea6c673226cb1dc57daddcf8c97000fc5d17256
k1 = 0xee39998957fc2aeaf7a995e16cf8757f9d697ad5 (Weak Nonce)
Signature 2:
R2 = 0xff391701e487807e0135f0b489d06aec6dbb80f726a768281369fa4bb8fa47f5
S2 = 0xb9ff0b62b77c0b3c9a296dba47eabbd2ef404423badc5168796aca550622eb9
Z2 = 0x5d9d720a8bd823ad5a6e37dbe6ffefcbbbbce95da518be3a0452bc1b2e74332a
k2 = 0xea2fdc05cb42d93af1683d4de96f2e18b80009bf (Weak Nonce)
Can you calculate my private key? I want to try whether what you said is true or false.
Signature 1:
R1 = 0x471e9702f12cf6872696904e07496589009676aa4720b4c951b2e2253bd1968e
S1 = 0x5934656d4316e4a5b757a7017dde8fb5bf9d040ef9df0d4d8f90cc7d4355a8b2
Z1 = 0xcfa395b2d3a9069352d8a7ba6ea6c673226cb1dc57daddcf8c97000fc5d17256
k1 = 0xee39998957fc2aeaf7a995e16cf8757f9d697ad5 (Weak Nonce)
Signature 2:
R2 = 0xff391701e487807e0135f0b489d06aec6dbb80f726a768281369fa4bb8fa47f5
S2 = 0xb9ff0b62b77c0b3c9a296dba47eabbd2ef404423badc5168796aca550622eb9
Z2 = 0x5d9d720a8bd823ad5a6e37dbe6ffefcbbbbce95da518be3a0452bc1b2e74332a
k2 = 0xea2fdc05cb42d93af1683d4de96f2e18b80009bf (Weak Nonce)
Can you calculate my private key? I want to try whether what you said is true or false.
Again,
Anyone can, since you provided the K (nonce) values. Please do note provide them.
Do provide however 10 signatures in the JSON format, as i said before. make sure the key and nonce are below 230 bits.
If you tell me K it's like you tell me the private key yourself.
Does your method have practical application?
Can you obtain the corresponding public key and K value of the other party from transaction information in the Bitcoin network?
Public Key (Hex): 0386747aa730e55346fe6609721350cd84a4f5d22308bcbffc25017c287f1f8b5c
Signature 1:
R1 = 0x471e9702f12cf6872696904e07496589009676aa4720b4c951b2e2253bd1968e
S1 = 0x5934656d4316e4a5b757a7017dde8fb5bf9d040ef9df0d4d8f90cc7d4355a8b2
Z1 = 0xcfa395b2d3a9069352d8a7ba6ea6c673226cb1dc57daddcf8c97000fc5d17256
k1 = 0xee39998957fc2aeaf7a995e16cf8757f9d697ad5 (Weak Nonce)
Signature 2:
R2 = 0xff391701e487807e0135f0b489d06aec6dbb80f726a768281369fa4bb8fa47f5
S2 = 0xb9ff0b62b77c0b3c9a296dba47eabbd2ef404423badc5168796aca550622eb9
Z2 = 0x5d9d720a8bd823ad5a6e37dbe6ffefcbbbbce95da518be3a0452bc1b2e74332a
k2 = 0xea2fdc05cb42d93af1683d4de96f2e18b80009bf (Weak Nonce)
Can you calculate my private key? I want to try whether what you said is true or false.
Signature 1:
R1 = 0x471e9702f12cf6872696904e07496589009676aa4720b4c951b2e2253bd1968e
S1 = 0x5934656d4316e4a5b757a7017dde8fb5bf9d040ef9df0d4d8f90cc7d4355a8b2
Z1 = 0xcfa395b2d3a9069352d8a7ba6ea6c673226cb1dc57daddcf8c97000fc5d17256
k1 = 0xee39998957fc2aeaf7a995e16cf8757f9d697ad5 (Weak Nonce)
Signature 2:
R2 = 0xff391701e487807e0135f0b489d06aec6dbb80f726a768281369fa4bb8fa47f5
S2 = 0xb9ff0b62b77c0b3c9a296dba47eabbd2ef404423badc5168796aca550622eb9
Z2 = 0x5d9d720a8bd823ad5a6e37dbe6ffefcbbbbce95da518be3a0452bc1b2e74332a
k2 = 0xea2fdc05cb42d93af1683d4de96f2e18b80009bf (Weak Nonce)
Can you calculate my private key? I want to try whether what you said is true or false.
Public Key (Hex): 03e153488f3e6faadec294c30f28b303e07a69040e6a37fecc12dcac33933badfe
Signature 1:
R1 = 0xe2402a7ab9ab808952d215df2d8d6343c1a508400c73d28feace49594ab10eac
S1 = 0xdd5ffdb2cf9954a1de317d25bb21532690536ce7b3e1f1037153cd83df42f62e
Z1 = 0x8055c4701f995b0c59c86e5c8a93706a7ea424035feec9a8641e8e5a763e7a20
k1 = 0x4e078897c8e158cd261ecf65b71f7d60c344db67 (Weak Nonce)
Signature 2:
R2 = 0x52c9ab07c20c0a41cd378f43697d24d8bbb64f5da78ab37c57178a3c6cc84eb5
S2 = 0xbccdc38ff63301cedeb60d03f4af2227f58948dcc1a19a2a15f6a3b5844bf1a0
Z2 = 0xa19d1f3d31d8896ac2626b0f466d0e416ceea61f0f5d935517ab416e08fc9806
k2 = 0x42f760690420321648b533873daa9038dd496066 (Weak Nonce)
Can you calculate my private key? I want to try whether what you said is true or false.
Signature 1:
R1 = 0xe2402a7ab9ab808952d215df2d8d6343c1a508400c73d28feace49594ab10eac
S1 = 0xdd5ffdb2cf9954a1de317d25bb21532690536ce7b3e1f1037153cd83df42f62e
Z1 = 0x8055c4701f995b0c59c86e5c8a93706a7ea424035feec9a8641e8e5a763e7a20
k1 = 0x4e078897c8e158cd261ecf65b71f7d60c344db67 (Weak Nonce)
Signature 2:
R2 = 0x52c9ab07c20c0a41cd378f43697d24d8bbb64f5da78ab37c57178a3c6cc84eb5
S2 = 0xbccdc38ff63301cedeb60d03f4af2227f58948dcc1a19a2a15f6a3b5844bf1a0
Z2 = 0xa19d1f3d31d8896ac2626b0f466d0e416ceea61f0f5d935517ab416e08fc9806
k2 = 0x42f760690420321648b533873daa9038dd496066 (Weak Nonce)
Can you calculate my private key? I want to try whether what you said is true or false.
About the Kangaroos algorithm for ECDLP, detailed paper and tutorial instruction
Where can I find detailed paper and tutorial instructions on the Kangaroos algorithm for ECDLP?
I haven't understood the detailed content of the algorithm yet. It seems that this algorithm is unrelated to the elliptic curve encryption (ECC) algorithm.
I would like to find some detailed information to learn. Thank you
I haven't understood the detailed content of the algorithm yet. It seems that this algorithm is unrelated to the elliptic curve encryption (ECC) algorithm.
I would like to find some detailed information to learn. Thank you
Nvidia has just launched a generative artificial intelligence (AI) supercomputer called the Jetson Orin Nano Super.
May I ask if your RCKangaroo program can run on this computer? I heard it can run 70 trillion times in one second, very fast.
Can we solve puzzle # 135 all at once?
May I ask if your RCKangaroo program can run on this computer? I heard it can run 70 trillion times in one second, very fast.
Can we solve puzzle # 135 all at once?
If one RTX4090 card can do it in +/- 249934 days (68 years). Then eighty RTX4090 cards can do it i in less than a year.
Who taught you mathematics?
249934 days=684 years
To solve the # 135 puzzle with RCKangaroo, it would take tens of thousands of years to use an RTX4090 for computation.
Mathematicians need to continue working hard to create algorithms that are better than the kangaroo algorithm in order to complete this task.
Mathematicians need to continue working hard to create algorithms that are better than the kangaroo algorithm in order to complete this task.
No, it's "cudaStreamSetAttribute".
Be careful with modifications if you don't know what you are doing exactly. The algorithm is not so straight as the classic one, for example, if you damage loop handling it will work for small ranges but fail for high ranges.
Discovered a problem
I didn't modify your source code, I ran it directly using the program you compiled
However, after running for a period of time, a large number of errors occurred.
DPs buffer overflow，some points lost, increase DP value!
DPs buffer overflow，some points lost, increase DP value!
DPs buffer overflow，some points lost, increase DP value!
At the beginning, it was normal, but the error message above kept appearing. May I ask why?
how to use it with RTX2070super, please, because I only have 2070, I am very interested in testing your work. I tried modifying the parameter settings but it failed.
As far as I remember these cards have only 64KB of shared memory.
Set JMP_CNT to 512 and change 17 to 16 in this line in KernelB:
u64* table = LDS + 8 * JMP_CNT + 17 * THREAD_X;
and recalculate LDS_SIZE_ constants.
I think it's enough, though may be I forgot something...
The main issue is not in compiling, but in optimizations, my code is not for 20xx and 30xx cards, so it won't work with good speed there.
That's why I don't want to support old cards: if I support them officially but not optimize you will blame me that they have bad speed.
But feel free to modify/optimize sources for your hardware
May I ask why, my 4060ti graphics card has a speed of just over 2000
CUDA devices: 1, CUDA driver/runtime: 12.6/12.5
GPU 0: NVIDIA GeForce RTX 4060 Ti, 16.00 GB, 34 CUs, cap 8.9, PCI 1, L2 size: 32768 KB
Total GPUs for work: 1
Solving point: Range 76 bits, DP 16, start...
SOTA method, estimated ops: 2^38.202, RAM for DPs: 0.367 GB. DP and GPU overheads not included!
Estimated DPs per kangaroo: 23.090.
GPU 0: allocated 1187 MB, 208896 kangaroos.
GPUs started...
MAIN: Speed: 2332 MKeys/s, Err: 0, DPs: 345K/4823K, Time: 0d:00h:00m, Est: 0d:00h:02m
MAIN: Speed: 2320 MKeys/s, Err: 0, DPs: 704K/4823K, Time: 0d:00h:00m, Est: 0d:00h:02m
Why use Kangaroo to solve the Bitcoin puzzle number 66 and calculate the private key using the public key? The speed is 566.5MK/S and the result can be obtained in only 41 seconds.
GPU: GPU #0 NVIDIA GeForce RTX 4060 Ti (34x0 cores) Grid(68x128) (92.0 MB used)
SolveKeyGPU Thread GPU#0: creating kangaroos...
SolveKeyGPU Thread GPU#0: 2^20.09 kangaroos [2.2s]
[566.51 MK/s][GPU 566.51 MK/s][Count 2^33.89][Dead 1][33s (Avg 22s)][0.9/1.2GB] MB]
Key# 0 [1S]Pub: 0x024EE2BE2D4E9F92D2F5A4A03058617DC45BEFE22938FEED5B7A6B7282DD74CBDD
Priv: 0x2832ED74F2B5E35EE
Done: Total time 41s
If VanitySearch is used to directly crack, the speed is 2080Mk/s, but it takes 1000 years to produce results? This speed is faster.
Random : Finding in a ranges
Global start: 0000000000000000000000000000000000000000000000020000000000000000 (66 bit)
Global end : 000000000000000000000000000000000000000000000003FFFFFFFFFFFFFFFF (66 bit)
Global range: 000000000000000000000000000000000000000000000001FFFFFFFFFFFFFFFF (65 bit)
[00:00:08] [CPU+GPU: 2080,21 Mk/s] [GPU: 2080,21 Mk/s] [T: 16,898,850,816] [F: 0]
GPU: GPU #0 NVIDIA GeForce RTX 4060 Ti (34x0 cores) Grid(68x128) (92.0 MB used)
SolveKeyGPU Thread GPU#0: creating kangaroos...
SolveKeyGPU Thread GPU#0: 2^20.09 kangaroos [2.2s]
[566.51 MK/s][GPU 566.51 MK/s][Count 2^33.89][Dead 1][33s (Avg 22s)][0.9/1.2GB] MB]
Key# 0 [1S]Pub: 0x024EE2BE2D4E9F92D2F5A4A03058617DC45BEFE22938FEED5B7A6B7282DD74CBDD
Priv: 0x2832ED74F2B5E35EE
Done: Total time 41s
If VanitySearch is used to directly crack, the speed is 2080Mk/s, but it takes 1000 years to produce results? This speed is faster.
Random : Finding in a ranges
Global start: 0000000000000000000000000000000000000000000000020000000000000000 (66 bit)
Global end : 000000000000000000000000000000000000000000000003FFFFFFFFFFFFFFFF (66 bit)
Global range: 000000000000000000000000000000000000000000000001FFFFFFFFFFFFFFFF (65 bit)
[00:00:08] [CPU+GPU: 2080,21 Mk/s] [GPU: 2080,21 Mk/s] [T: 16,898,850,816] [F: 0]