mirror of
https://github.com/allaunthefox/Research-Stack.git
synced 2026-07-31 03:05:21 +00:00
allaun
684898e842
- verify_goormaghtigh.py: Python verification engine with repunit structure checks, bounded/extended enumeration (exactly 2 collisions), Ramanujan-Nagell verification, Baker bound classical precheck - baker_circuit.json: Quandella photonic Grover search circuit for Baker bound estimation - GoormaghtighEnumeration.lean: merged ramanujan_nagell axiom, goormaghtigh_x2_n3 theorem (proved from Ramanujan-Nagell), goormaghtigh_complete (master theorem using BMS bounds + native_decide), set-equality & density corollaries. Zero sorries. 8 sections. Build: 8599 jobs, 0 errors (lake build)
48 lines
No EOL
1 KiB
JSON
48 lines
No EOL
1 KiB
JSON
{
|
|
"name": "goormaghtigh_baker_verification",
|
|
"description": "Quantum search for Baker bound violations in the Goormaghtigh collision problem",
|
|
"registers": {
|
|
"x": {
|
|
"bits": 7,
|
|
"range": [
|
|
2,
|
|
90
|
|
],
|
|
"description": "base 1"
|
|
},
|
|
"m": {
|
|
"bits": 4,
|
|
"range": [
|
|
3,
|
|
13
|
|
],
|
|
"description": "exponent 1"
|
|
},
|
|
"y": {
|
|
"bits": 7,
|
|
"range": [
|
|
2,
|
|
90
|
|
],
|
|
"description": "base 2"
|
|
},
|
|
"n": {
|
|
"bits": 4,
|
|
"range": [
|
|
3,
|
|
13
|
|
],
|
|
"description": "exponent 2"
|
|
}
|
|
},
|
|
"total_qubits": 22,
|
|
"oracle": {
|
|
"type": "baker_bound_check",
|
|
"constant_C": 18.0,
|
|
"threshold": "B^{-C} where B = max(m,n)"
|
|
},
|
|
"amplification_rounds": 768,
|
|
"expected_violations": 0,
|
|
"classical_precheck": true,
|
|
"note": "Classical precheck already verifies no violations exist in [2,90]x[3,13]. The quantum circuit provides additional confidence via amplitude amplification over the full space."
|
|
} |