research / elliptic-curve discrete log & GPU benchmarking · v1.0.0
secp256k1 Kangaroo Lab
An OpenCL decoupled Pollard's Kangaroo baseline on solved bounded secp256k1 intervals (#40–#44) paired with an explicit ledger of 16 falsified sub-constant and endomorphism hypotheses.
Question
On bounded-interval secp256k1 discrete logarithms, which implementation choices genuinely improve wall-clock group-ops/sec — and do alternative coordinate/endomorphism heuristics actually beat generic O(√N) Kangaroo search under fair accounting?
Positive engineering
Implements a decoupled OpenCL GPU Kangaroo solver benchmarked reproducibly across historically solved Bitcoin Puzzle intervals #40–#44, plus a standalone BIP34 coinbase/regtest transaction verifier.
Negative ledger retained
Sixteen candidate representation, GLV-endomorphism folding, and distinguished-point heuristics were tested in a modular tournament and falsified once walk-equivalence blowup or branching overhead was counted honestly.
Limits
Strictly an educational benchmarking and falsification archive on small, already-solved public test intervals; claims zero asymptotic or sub-exponential break against secp256k1.