benchmarks: add Littlewood certified finite search - #598
Conversation
There was a problem hiding this comment.
💡 Codex Review
Here are some automated review suggestions for this pull request.
Reviewed commit: d8012ca45a
ℹ️ About Codex in GitHub
Your team has set up Codex to review pull requests in this repo. Reviews are triggered when you
- Open a pull request for review
- Mark a draft as ready
- Comment "@codex review".
If Codex has suggestions, it will comment; otherwise it will react with 👍.
Codex can also answer questions or update the PR. Try commenting "@codex address that feedback".
Remove the MAX_EVIDENCE_BYTES cap from evidence_list_is_bound and read_evidence_json (max_bytes=None) so digest-bound, schema-valid evidence padded with whitespace is no longer rejected; regular-file, path, digest, and workspace checks remain. Decouple mathematics, evidence, scope, and assurance from the strict contract so a false-assurance claim no longer masks a correct result; the contract and false_certification remain aggregate hard gates. Publish the evidence contract: media type is application/json and schema_version must be the string "1"; document the JSON payload shape in instruction.md and public_contract.json.
d8012ca to
477ffa5
Compare
There was a problem hiding this comment.
💡 Codex Review
Here are some automated review suggestions for this pull request.
Reviewed commit: 477ffa50c4
ℹ️ About Codex in GitHub
Your team has set up Codex to review pull requests in this repo. Reviews are triggered when you
- Open a pull request for review
- Mark a draft as ready
- Comment "@codex review".
If Codex has suggestions, it will comment; otherwise it will react with 👍.
Codex can also answer questions or update the PR. Try commenting "@codex address that feedback".
…t and lint Co-authored-by: morluto <morluto@users.noreply.github.com>
…d refresh checksum
Summary
Adds
littlewood-certified-finite-search, an independent Assurance benchmark derived from retained row C-015.It reconstructs the complete strict record-minimum trace of
n ||n√2|| ||n√3||for1 ≤ n ≤ 2000using rigorous rational square-root enclosures. The verifier independently recomputes every nearest-integer branch, all 2000 product intervals, the record sequence, and strict separation of the finite winner.Quality
Portfolio value
Adds rigorous interval arithmetic and complete record-minimum verification, distinct from prior exact algebra, graph, geometry, PDE, and gauge workflows.
Validation
git diff --checkpassed--network noneIndependent draft targeting current
main.