A something I discovered during research, perhaps this will rejuvenate interest in those who have decided
to abandon ship due to giving up on being able to unravel what you think was not designed to be unraveled.
32 byte contatenated string of initialing puzzle keys in order + parity identifier
137815314ce01d3202483a7b1460293068f3c9361764f3080d5749fd2c551ba5> 3 <
<<flip string >>
35ab155c2df9475d0803f4671639c3f8603920641b7a3842023d10ec413518731
hold parity bit
>3< 5ab155c2df9475d0803f4671639c3f8603920641b7a3842023d10ec413518731
>>>> convert 32 byte remainder to decimal
41021480205174593636323558138598051275269767297359076988813286963270156126001
<< flip decimal value >>
10062165107236968231888967095379276796257215089583185532363639547150208412014
<<<< revert flipped decimal value to hex
163efbcf0cc9fea9116ae0969223b518ad99ba334dbbea810097f4039195296e
prepend parity as byte
>03< 163efbcf0cc9fea9116ae0969223b518ad99ba334dbbea810097f4039195296e
03163efbcf0cc9fea9116ae0969223b518ad99ba334dbbea810097f4039195296e
*valid pub key *
Short answer: there is no mysticism in the reversals. The only cryptographic meaning is in the final string: text 03 163efbcf0cc9fea9116ae0969223b518ad99ba334dbbea810097f4039195296e That is a standard compressed SECP256k1 public key in the format: text 02/03 + 32-byte X coordinate What is happening 03 at the start is not the character '3'. It is the byte 0x03. In a compressed SECP256k1 public key, the first byte encodes the parity of the Y coordinate: 02 = Y is even 03 = Y is odd The remaining 32 bytes are the X coordinate of a point on the elliptic curve: text y² = x³ + 7 mod p where: text p = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F For 03 + X to be a valid public key: X < p X³ + 7 mod p must be a quadratic residue, so a square root Y exists the parity of that Y must match the prefix: for 03, Y must be odd If those conditions hold, then 03 + X is indeed a valid compressed public key. Why your transformations produce this All the steps before the final line are just reversible re-encodings: add 3 reverse the string remove 3 convert hex to decimal reverse the decimal digits convert decimal back to hex prepend 03 These are not cryptographic operations. They are only character permutations and base conversions. They do not create validity. They only move a number between different representations. If the original 32-byte string was obtained from a real public key by inverse transformations, then the result will naturally be a public key again. That is a tautology: you took the key apart and reassembled it. If the original string was random, then the probability that the resulting X coordinate is valid is roughly 1/2 for SECP256k1. About half of all X values in the valid range correspond to a point on the curve. So this is not a miracle and not especially rare. Why 3 and not 2? Because for this particular point, the Y coordinate is odd. If it were even, the prefix would be 02, and the final byte would be 0x02. Conclusion It happens exactly this way because: the final string is a standard compressed SECP256k1 public key; the 03 prefix encodes an odd Y coordinate; the 32 bytes after it are an X coordinate that lies on the curve; the hex and decimal reversals are just obfuscation/packaging, not a mathematical law. There is no hidden meaning in reversing the decimal digits. It is simply a way to repackage the number so that, after the reverse procedure, you get a valid public key. |
|
|
|
  I created a dashboard (python app to connect to solver server). What do you think? There is one problem: the solver server consumes all resources via the PCI bridge connecting it to the host. As a result, under heavy load, Wi-Fi and other devices connected through the same bridge start malfunctioning. The GPU is also connected to this bridge, so it "eats up" all the bandwidth. But that is an extreme case where the hardware is pushed to the limit. P.S.: also exist pool server for solver servers  P.S.1: The pool/solver server is still undergoing optimization, so it is closed to public access. Once the work is complete, the entire source code will be available on GitHub. |
|
|
|
Nice job!  |
|
|
|
hi, buddy! how much points U can check at one sec with own programs? i'v got 115m/s (at cold start) to 104-108m/s at work state with 1650ti (4gb, notebook).  for 140bits. whats 'bout Ur algo? [15:51:34] [+] [C 21,706 / 2,596,148,429,267,413,814,265,248,164,610,048] [11,653,320,015,872 / 696,898,287,454,081,973,172,991,196,020,261,297,061,888 prob] S: 104591380.9 pr/s, E: 1d 06:56:57, ETA: 3.390e+26 y, exp-ETA: 1.353e+17 y, progress: 0.0000%
 It is possible. Regarding implementing and testing the results of customized elliptic curve parameters, you can play around with this:
sure. it's like child playing game.! |
|
|
|
That is, there would be no discrete logarithm problem. of'coz. ECDLP and div(G, d) different casuality. What about not using AI to communicate with other people? Otherwise, what do you need for, as a the strip between me and the AI? As already understood above, you don’t understand what you’re talking about. C:\2>solver_kav0m_v6-3.exe 145
[+] Loaded puzzle 145 from key_list.py
[!] Memory budget clamps table M: 500000000 -> 246771126 (pinned in auto_m6_P145.txt)
total bits: 145
range bits: 124
table scalars M: 246,771,126
base threads: 2097152
probes to scan: 5,248,241,427,689,071,100,347,925,727,234,088,107,000,201,216
expected probes: 7.681e+34
[+] Resuming search from saved counter: 7,121
[!] Initializing GPU secp256k1...
Initializing secp256k1 for GPU...
secp256k1 constants initialized on GPU
Initializing precomputed table for base point G...
Table size: 256 entries (0.02 MB)
Precomputed table initialized successfully in global memory
secp256k1 GPU initialization complete!
=== GPU Device Information ===
Device Name: NVIDIA GeForce GTX 1650 Ti
Compute Capability: 7.5
CUDA Driver Version: 13.3
CUDA Runtime Version: 13.3
Total Global Memory: 4.00 GB
Shared Memory per Block: 48.00 KB
Max Threads per Block: 1024
Max Block Dimensions: 1024 x 1024 x 64
Max Grid Dimensions: 2147483647 x 65535 x 65535
Warp Size: 32
Number of Multiprocessors: 16
Memory Bus Width: 128 bits
Free Memory at startup: 3.21 GB
Total Memory (system view): 4.00 GB
===============================
[!] Allocating GPU memory...
[+] Loading table cache: chk6_P145_step246771126.dat
[!] Building sorted index (CUB radix sort on GPU)...
[+] index built in 8.7 s (246771126 entries)
[+] Loading bloom filter: blm6_P145_step246771126.dat
[+] Tables built: 246771126 entries (3.03 GB keys+idx+bloom). Free VRAM: 0.18 GB
[19:11:18] [+] [3,824,131,506,176 / 22,300,745,198,530,623,141,535,718,272,648,361,505,980,416] S: 108604118.3 pr/s, E: 09:46:51, ETA: 2.241e+19 y, progress: 0.0000%
[19:11:27] [+] [3,825,205,248,000 / 22,300,745,198,530,623,141,535,718,272,648,361,505,980,416] S: 108606131.1 pr/s, E: 09:47:00, ETA: 2.241e+19 y, progress: 0.0000%
forgot AI. its just a 108606131.1 probes/s at low video card. and its not over....speeeedup are waiting. |
|
|
|
That is, there would be no discrete logarithm problem. of'coz. ECDLP and div(G, d) different casuality. |
|
|
|
multiplying by the inverse scalar (...) pretty much do the same job exactly! |
|
|
|
Cause if not you'll be chasing your tail like everyone else not a tail but a noose. |
|
|
|
...
You are very much mistaken about the small PK range. Small ranges are the same for all cryptocurrencies — ETH, CMK, QBC, etc. It is just a coincidence. High ranges same too, but coincidence is apsend. |
|
|
|
So RetiredCoder also retired. I wonder who is going to solve now the Remaining stuff he rightly retired because trying to solve from 140 to 160 currently would cost more in power than the potential gain. just a random chance. get right seed and get 140 at second. |
|
|
|
Maybe i...
912 million values in ~120 ms ≈ 7.6 billion values/s on a GTX 1650 Ti; O(1) memory usage (no delta—the 2 MB represents driver overhead for the module). hm... it's looks very fast? Puz72, RC, Kg, what U think? (140 bit at test) [15:55:15] [+] [42] S: 132371.0 chk/s, E: 00:00:31, ETA: 1.335e+35 y
[15:55:20] [+] [49] S: 132203.8 chk/s, E: 00:00:37, ETA: 1.336e+35 y
[15:55:23] [!] Interrupted by Ctrl+C, progress saved
[+] Resume counter: 52
each "chk" is a 57_000_000 points combo + 114_000_000 checks, all oper at one second (pure ptx/cuda, like RC do asm). anyway "1.336e+35 y" it's a huge time. However, to detect a collision, the algorithm requires a specific combination (only 0.000024% is needed to find a solution): total bits: 40
range bits: 23
total iterations: 4,194,304
range step: 5,497,558
steps count: 100,000
total checks: 419,430,400,000
[!] Initializing GPU secp256k1...
=== GPU Device Information ===
Device Name: NVIDIA GeForce GTX 1650 Ti
Compute Capability: 7.5
CUDA Driver Version: 13.3
CUDA Runtime Version: 13.3
Total Global Memory: 4.00 GB
Shared Memory per Block: 48.00 KB
Max Threads per Block: 1024
Max Block Dimensions: 1024 x 1024 x 64
Max Grid Dimensions: 2147483647 x 65535 x 65535
Warp Size: 32
Number of Multiprocessors: 16
Memory Bus Width: 128 bits
Free Memory at startup: 3.21 GB
Total Memory (system view): 4.00 GB
===============================
[!] Allocating GPU memory...
[+] Loading normalized base points: basepoints_norm_P40_step100000.dat
[+] Loading check map: checkmap_P40_step100000.dat
[+] Loading bloom filter: bloom_P40_step100000.dat
[+] All table caches present and valid
[!] Starting search from beginning...
[19:28:22] [+] [0] S: 0.0 chk/s, E: 00:00:00, ETA: ---
FOUND COLLISION:
RESULT: 1,003,651,412,950
SEARCH TIME: 00:00:01
base_point_start: 453,894,881,154
range_result: 2,318,083
check_diff: 1,600,175
control: 1,003,651,412,950
CONTROL DIFF: 0
counter: 1
total_iterations: 4,194,304
total_checks: 419,430,400,000
checks_done: 100,000
progress_percent: 0.000024% |
|
|
|
135 | 0000000000000000000000000000006d9392a16883f90903d5f78da57af07eb2 | 16RGFo6hjq9ym6Pj7N5H7L1NR1rVPJyw2v | 43556142965880123323311949751266331066367 | 02145d2611c823a396ef6712ce0f712f09b9b4f3135e3e0aa3230fb9b6d08d1e16 | 2026-07-28
no mistake? Mini-puzzle #7 closed.
#135 pk is: 0000000000000000000000000000006D9392A16883F90903D5F78DA57AF07EB2
Python 3.11.8 (tags/v3.11.8:db85d51, Feb 6 2024, 22:03:32) [MSC v.1937 64 bit (AMD64)] on win32
Type "help", "copyright", "credits" or "license" for more information.
>>> 0x0000000000000000000000000000006D9392A16883F90903D5F78DA57AF07EB2
37286935858852539926448623437930621337266
ps: 43556142965880123323311949751266331066367 its a 0x7fffffffffffffffffffffffffffffffff |
|
|
|
How are 77 bits cracked in seconds?!
i have huge PTX optimized own app, but i'm shocked... total bits: 135
range bits: 109
total iterations: 324,518,553,658,426,726,783,156,020,576,256
range step: 382,071,429,525,264,239,678,174,997,818,125
steps count: 57,000,000
total checks: 18,497,557,558,530,323,426,639,893,172,846,592,000,000
[!] Initializing GPU secp256k1...
Initializing secp256k1 for GPU...
secp256k1 constants initialized on GPU
Initializing precomputed table for base point G...
Table size: 256 entries (0.02 MB)
Precomputed table initialized successfully in global memory
secp256k1 GPU initialization complete!
=== GPU Device Information ===
Device Name: NVIDIA GeForce GTX 1650 Ti
Compute Capability: 7.5
CUDA Driver Version: 13.3
CUDA Runtime Version: 13.3
Total Global Memory: 4.00 GB
Shared Memory per Block: 48.00 KB
Max Threads per Block: 1024
Max Block Dimensions: 1024 x 1024 x 64
Max Grid Dimensions: 2147483647 x 65535 x 65535
Warp Size: 32
Number of Multiprocessors: 16
Memory Bus Width: 128 bits
Free Memory at startup: 3.21 GB
Total Memory (system view): 4.00 GB
===============================
[!] Allocating GPU memory...
[+] Base points loaded: basepoints_P135_step57000000.dat (57000000 entries)
[+] Check points loaded: checkpoints_P135_step57000000.dat (114000000 entries)
[+] Check map loaded: checkmap_P135_step57000000.dat (114000000 entries)
[+] Bloom filter loaded: bloom_P135_step57000000.dat (2185393344 bits, 13 hashes)
[!] Resuming from counter: 6,498,279,296
[!] Previous elapsed: 22:12:01
[!] Starting search...
[+] [8,318,960,000] S: 4638390344643.7 it/s, TE: 1d 04:23:49, E: 06:11:48, ETA: 126456304624308436992y
|
|
|
|
C:\_CuBubNix>wsl
user@DESKTOP-4A3SFP6:/mnt/c/_CuBubNix$ ./solver_kav0m -f 75
total bits: 75
range bits: 48
total iterations: 140,737,488,355,328
range step: 245,317,739,369,851
steps count: 77,000,000
total checks: 10,836,786,603,360,256,000,000
[!] Initializing GPU secp256k1...
Initializing secp256k1 for GPU...
secp256k1 constants initialized on GPU
Initializing precomputed table for base point G...
Table size: 256 entries (0.02 MB)
Processing batch: 2 to 256 (size: 254)
Computed 256 entries (100.0%)
Actual entries computed: 256 out of 256
Precomputed table initialized successfully in global memory
secp256k1 GPU initialization complete!
[!] Allocating GPU memory...
[!] Generating 77000000 base points...
[+] base points saved: basepoints_P75_step77000000.dat
[!] Generating 154000000 check points...
[+] checkpoints saved: checkpoints_P75_step77000000.dat
[+] Check points done in 223.12 s
[!] Building sorted check map (154000000 entries)...
[+] check map saved: checkmap_P75_step77000000.dat
[+] Check map built: 154000000 entries
[!] Creating bloom filter...
[+] Creating Bloom filter: 154000000 items, 2952198016 bits, 13 hashes, 369024752 bytes
[+] Bloom filter: 369024752 bytes
[+] bloom saved: bloom_P75_step77000000.dat
[!] Starting fresh
[!] Starting search...
[+] [284,800] S: 4384147563670.5 it/s, TE: 00:00:05, E: 00:00:05, ETA: 78y 4m 18d 22:19:09
[+] [582,912] S: 4487179977492.4 it/s, TE: 00:00:10, E: 00:00:10, ETA: 76y 7m 2d 00:37:06
[+] [882,560] S: 4529273222593.1 it/s, TE: 00:00:15, E: 00:00:15, ETA: 75y 10m 17d 06:01:10
[+] [1,180,800] S: 4544816919025.3 it/s, TE: 00:00:20, E: 00:00:20, ETA: 75y 7m 12d 12:58:35
[+] [1,481,856] S: 4562944268013.4 it/s, TE: 00:00:25, E: 00:00:25, ETA: 75y 3m 22d 21:40:21
[+] [1,787,392] S: 4586559085856.6 it/s, TE: 00:00:30, E: 00:00:30, ETA: 74y 11m 6d 09:01:25
[+] [2,092,160] S: 4601821799443.2 it/s, TE: 00:00:35, E: 00:00:35, ETA: 74y 8m 5d 16:15:00
[+] [2,397,184] S: 4613541927680.0 it/s, TE: 00:00:40, E: 00:00:40, ETA: 74y 5m 26d 10:29:49
[+] [2,701,312] S: 4621228818237.6 it/s, TE: 00:00:45, E: 00:00:45, ETA: 74y 4m 11d 05:10:42
[+] [3,005,184] S: 4626953023530.4 it/s, TE: 00:00:50, E: 00:00:50, ETA: 74y 3m 7d 15:18:54
[+] [3,310,464] S: 4633610024738.0 it/s, TE: 00:00:55, E: 00:00:55, ETA: 74y 1m 28d 16:38:07
[+] [3,616,896] S: 4640613488240.3 it/s, TE: 00:01:00, E: 00:01:00, ETA: 74y 17d 20:12:19
[+] [3,924,608] S: 4648118837239.4 it/s, TE: 00:01:05, E: 00:01:05, ETA: 73y 11m 9d 04:47:42
[+] [4,231,936] S: 4654095772874.0 it/s, TE: 00:01:10, E: 00:01:10, ETA: 73y 10m 4d 13:05:55
[+] [4,538,112] S: 4658143282004.4 it/s, TE: 00:01:15, E: 00:01:15, ETA: 73y 9m 11d 03:05:44
[+] [4,844,032] S: 4661454706113.2 it/s, TE: 00:01:20, E: 00:01:20, ETA: 73y 8m 22d 00:01:28
[+] [5,152,768] S: 4666893327847.9 it/s, TE: 00:01:25, E: 00:01:25, ETA: 73y 7m 20d 15:28:10
[+] [5,460,992] S: 4671219832224.0 it/s, TE: 00:01:30, E: 00:01:30, ETA: 73y 6m 25d 18:03:06
[+] [5,767,808] S: 4673999019513.5 it/s, TE: 00:01:35, E: 00:01:35, ETA: 73y 6m 9d 18:52:32
[+] [6,074,752] S: 4676591312679.1 it/s, TE: 00:01:40, E: 00:01:40, ETA: 73y 5m 24d 21:52:39
[+] [6,382,336] S: 4679429787516.5 it/s, TE: 00:01:45, E: 00:01:45, ETA: 73y 5m 8d 15:25:49
[+] [6,688,768] S: 4681210115712.4 it/s, TE: 00:01:50, E: 00:01:50, ETA: 73y 4m 28d 10:46:41
How are 77 bits cracked in seconds?! |
|
|
|
shortcuts or other tricks in ECDSA. It's possible, i'm sure. John Pollard once proposed a solution in 1978. However, the first cubic equations related to elliptic curves appear in the work "Arithmetic" by the ancient Greek mathematician Diophantus of Alexandria in the 3rd century CE. It's just that no one has found a solution yet. Maybe we should wait a few centuries? Nobody knows. Those who don't want something look for an excuse.
Those who want something look for an opportunity. |
|
|
|
Found something interesting... named " KAV problem". 37/ 2 = 1093,5 (constant) y 2=x 3+ 7 (Mordell's curve)  Its a constant for whole numbers. Some correlation with Collatz problem. So why were the values 2, 3, 7 chosen for curve? (rhetorical) And why simple math go to this value, without any comparisons with even/odd (requires proof as new theorem, like Collatz problem was checked for 3*10 20). ps: 1093,5*G, its a point: x: 370b26f6e52f0e27166e3eb07c0f2d4d9a8a435cbb6281e67279927bbf764712 y: 4d89d638d217c8a0ee49d96d0ea2cee6ec240c161b7dbb728697b911f61ff262 |
|
|
|
What is your problem? Did you try to decrypt it without permission?
Only the creator can read it. Don't waste your time
post another message with same cipher but with know PK (45 for example). hard to recognize crypto method. |
|
|
|
Private key of 71 is
6*****************
It's absurd. PK is a binary 0/1 value. |
|
|
|
|
Show Posts
