Author here.
I implemented a solver that handles Hamiltonian Path (N=63) using strictly bitwise operations and CPU register logic.
The claim: It solves sparse/hard instances (N=63, density 0.25) in ~116ms on a Snapdragon 8 Gen 2.
The method:
Zero-RAM: Everything fits in a uint64_t. I treat the CPU as a pool of logic gates, bypassing cache latency entirely.
Entropy as Fuel: It deliberately exploits hardware race conditions (thermal jitter) to escape local minima.
Prime Heuristic: Uses prime factorization for structural pruning.
I know this sounds like a "P=NP" claim from a crank, but I'm just an engineer presenting empirical results on standard silicon. The code is open, the math is in the repo.
One request: Since the logic is purely constrained to 64-bit registers... does anyone have a dev kit for a Nintendo 64 lying around? I’m genuinely curious if Mario’s console can solve NP-Hard problems faster than a modern supercomputer using RAM.
Feedback and reproduction on x86/ARM (or N64) is welcome.
Show HN: Exact Hamiltonian Path solver (N=63) in 0.11s on mobile ARM (No RAM) | Heykuki News