Skip to content

feat: verify polynomial-coefficient recurrences - #902

Merged
morluto merged 6 commits into
mainfrom
agent/p-recursive-exact-verification
Aug 9, 2026
Merged

feat: verify polynomial-coefficient recurrences#902
morluto merged 6 commits into
mainfrom
agent/p-recursive-exact-verification

Conversation

@yuelgrace1810-ops

@yuelgrace1810-ops yuelgrace1810-ops commented Aug 9, 2026

Copy link
Copy Markdown
Collaborator

Summary

Adds bounded exact evaluation and independent verification for polynomial-coefficient linear recurrences.

  • adds combinatorics.recurrence.p_recursive.evaluate
  • derives the authorized combinatorics.recurrence.p_recursive.verify companion
  • represents each p_j(n) canonically in ascending rational powers
  • returns the complete replay prefix, complete ordered PREFIX projection, bound recurrence order, and every exact residual over the required consecutive range
  • rejects singular leading coefficients before execution or artifact writes
  • enforces recurrence order, polynomial degree, index, digit-growth, and artifact-size bounds
  • documents the finite assurance boundary

Closes #900.

Why

A held-out gpt-5.4-mini audit of Tong Niu's 2026 proof of Mathar's OEIS A176677 recurrence correctly refused Jacobian's constant-coefficient recurrence tool, then made an unsupported late arithmetic error and falsely reported that the recurrence failed at n=16. The new exact capability computes the correct final value a(16)=3949969 and independently verifies zero residuals over the declared finite range.

This does not prove a recurrence for all indices or derive it from an external theorem. Production remains COMPUTED; only the standard-library Fraction checker can return VERIFIED.

Validation

  • make check — 880 unit tests passed; Ruff, format, complexity, and mypy passed
  • make check-static — dependency, dead-code, architecture, typing, and package-build checks passed
  • focused result-contract lane — 10 passed
  • focused component checker lane — 10 passed
  • focused recurrence composition lanes — 25 passed
  • make docs-linkcheck and git diff --check — passed

Focused adversarial coverage includes omitted, duplicate, out-of-order, out-of-range, and boolean result records; a corrupted late candidate; an exact A176677 regression through n=16; and rejection when the leading coefficient polynomial vanishes at a required step.

@morluto
morluto marked this pull request as ready for review August 9, 2026 03:44

@chatgpt-codex-connector chatgpt-codex-connector Bot left a comment

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

💡 Codex Review

Here are some automated review suggestions for this pull request.

Reviewed commit: 553877483f

ℹ️ 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".

Comment thread src/jacobian/contracts/combinatorics.py

@chatgpt-codex-connector chatgpt-codex-connector Bot left a comment

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

💡 Codex Review

Here are some automated review suggestions for this pull request.

Reviewed commit: d3866c2c56

ℹ️ 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".

Comment thread src/jacobian/contracts/combinatorics.py
@morluto
morluto force-pushed the agent/p-recursive-exact-verification branch from d3866c2 to 6dccf52 Compare August 9, 2026 08:49

@chatgpt-codex-connector chatgpt-codex-connector Bot left a comment

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

💡 Codex Review

Here are some automated review suggestions for this pull request.

Reviewed commit: 6dccf52bc0

ℹ️ 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".

Comment thread src/jacobian_checkers/recurrence_series.py

@chatgpt-codex-connector chatgpt-codex-connector Bot left a comment

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

💡 Codex Review

Here are some automated review suggestions for this pull request.

Reviewed commit: b55b346f64

ℹ️ 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".

Comment thread src/jacobian/contracts/combinatorics.py
@morluto
morluto merged commit b9b01b3 into main Aug 9, 2026
39 checks passed
@morluto
morluto deleted the agent/p-recursive-exact-verification branch August 9, 2026 10:12
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

[Feature]: Add bounded exact verification for variable-coefficient recurrences

2 participants