How the ellipsoid
proofs were built.
The public development now includes the original ellipsoid results, an exponential PSD-rank bound and seven theorems on translated samples. This report explains the verification method and preserves the earlier account of how three proof workers used Rocq MCP.
Browse the theorem and library guide · Read the ellipsoid-fitting overview
A public development with explicit statements and checks.
The continuation is published in LLM4Rocq/ellipsoid_fitting_rocq. Its status and reading guide link the mathematical claims to frozen statements, saved proofs and assumption checks. The links below identify particular released commits; the October 2 measurements further down describe an earlier stage.
Phase 13: the checker repair
The release combines four application theorems with repaired source checks, identified compiler outputs, statement snapshots and resolved kernel names. The checking machinery is pinned to the repair commit. Read phase13.[10]
Phase 14: exponential PSD rank
Two theorems prove an exponential lower bound for positively shifted matching matrices, then the corollary for unshifted matrices and exact semidefinite lifts of the perfect matching polytope. Both use the three boolp axioms. Read the main statement.[11]
The shifted-sample extension
Seven theorems cover condition numbers, exclusion of quadrics, fitting error, symmetric mixtures, sparse shifts and sign mixtures. Their hypotheses differ; the statement files specify each case. Each uses seven classical axioms, excluding Classical_Prop.classic. Read the seven results.[12]
What changed in verification
Kernel checking establishes that a proof has its formal type. The surrounding checker must also establish that it checked the intended sources, statements and outputs. The phase 13 repair strengthened those connections: it reads Rocq source syntax, records compiler runs and output hashes, compares statements with their accepted versions, and checks resolved names. The annotated release records for phase13, phase14 and shifted report checks in two fresh clones and agreement on all 54 repaired-side regression tests.[10][11][12]
The limits remain part of the result. Universe constraints are not compared. The identity layer checks which names occur; frozen sources and characterizations protect the definitions behind those names. Reproducibility was exercised with one Docker image. Ten attack demonstrations establish acceptance of attack text by the old checker, not kernel acceptance of a false theorem; two other attacks have coverage records rather than reproductions. These qualifications are stated in the released repair account.
Source review and the note, through 25 October
The updated shifted-sample note cites the release and theorem files. A further documentation commit identifies the replacement of the planned direct singular-value-tail argument by a centered sample-covariance argument, and changes one displayed log d factor to log(p+1) to match the formal estimate. These are documentation changes after the shifted tag.[13]
What the additional source reviews establish
Retained project records dated 25 October describe a bounded independent second reading of the reserve argument, its S3–S5 applications and additional S6 proof steps. A completion read the upper half of S4. The reviewers reported no unresolved defect in a frozen statement or proof step. This summary concerns source review; it is not a new compiler run or a claim that every dependency was reread.
Earlier released results, existing library lemmas and explicitly listed helper proofs remained dependencies of that review. Two minor documentation findings were retained: a README row omitted the row-size condition used by a moment bound, and a source header described a statistic unused by the final route. The proofs supply the required condition. Commit 5893184e corrected both on 25 October 2026; it changed no Rocq statement or proof.[13]
Evidence boundary. The full second-reading report and raw review transcripts are not published with this page. This paragraph is a summary of retained project records, not a publicly inspectable review certificate. The public statement files, proof sources, checker code and release records are linked above. No controlled timing or model comparison was added in this later work.
The rest of this report preserves the September 30–October 2 case study. Its 648-module closure, 801 registered modules, eight-axiom allowance and tool-call totals belong to that period; they are not totals for the later public release.
The workers contributed proofs. Saved-source checks established their formal types.
Arthur, Marcol and Lancelot each produced results used in the final proof. The master divided the work, supplied dependencies, checked integrations and assembled the fixed statements. Rocq MCP was extensively used for interactive proof development. Saved-source compilation and independent kernel checks, not the agents’ reports or MCP success messages, established completion.[1][3]
Main clauses checked on October 2
All three were proved at their exact formal types, including the required measurability conclusions.
Modules in that proof closure
Five trusted dependencies and 643 solution modules. This includes substantial earlier work, not only the AWS workers’ output.
Observed native MCP calls
Across the three AWS workers before completion. These are tool invocations, not distinct theorems or successful proofs.
The evidence supports a useful division of labour and repeated use of interactive feedback. It does not establish how much faster the team was than one agent, whether MCP reduced total cost, or which model would have performed best. No controlled comparison was run.[4]
The original three clauses were proved.
The faithfulness question is separate.
The target is one formal theorem with three main clauses. For independent standard Gaussian points in dimension d, the sample density is n(d)/d2. The fitting equation is xiTSxi = d. The statements allow arbitrary sample-size sequences subject to the specified eventual density bounds.[2]
| Fixed statement | What the saved theorem states | Proof status |
|---|---|---|
| Sharp fitting transition | The probability of a positive-semidefinite fit tends to 1 below density 1/4 and to 0 above it. The fitting event is measurable. | Verified |
| Well-conditioned fits | For every α < 1/4, fixed constants 0 < λ− ≤ λ+ give fits with trace d and λ−I ≤ S ≤ λ+I, with probability tending to 1 whenever the limsup density is at most α. The constants precede the sample-size sequence. | Verified |
| Balanced positive-definite alternative | The probability that zero-sum weights make ∑i yixixiT positive definite tends to 0 below the threshold and to 1 above it. This event is measurable too. | Verified |
These are summaries of the fixed formal statements, not a new mathematical review of their agreement with the paper. No assertion is made here about the critical density exactly equal to 1/4.
Saved proofs and publication
The clean check completed at 13:55 UTC on 2 October: 648 source modules, no copied compiled objects, no proof holes and eight permitted classical axioms. All 801 registered analysis modules also build. PR #14 was merged at 14:35 UTC.
Human review and protocol acceptance
The statement/alignment review has no human sign-off in the inspected record. Trellis/comparator acceptance was not claimed. The draft metadata is therefore not evidence of missing saved proofs, and a GitHub merge is not a review signature.
For this report, a fresh read-only audit checked all 648 proof-source hashes, the six frozen-source hashes and the axiom contract against the merged tree. It found no mismatch. The merged tree equals the checked PR head. This audit did not rerun the full Rocq build.[1]
Fix the mathematical interface.
Let the proof decomposition evolve.
The most consequential decision was the change in review scope. The user wanted to review the main theorems and the definitions that give them meaning, rather than a long sequence of intermediate challenges.
On 30 September, the work was reorganized into one main-statement package with three clauses and a shared glossary. A separate session authored the statement; the final results and policy modules were written by the AWS master solver. Internal lemmas could be split, replaced and reassigned while the recorded main statement and its five trusted dependencies stayed unchanged.[2][6]
- 1Fix the targetMain clauses, Gaussian law, event definitions and quantifier order.
- 2Assign bounded workOne owner per module family, explicit dependencies and expected conclusions.
- 3Develop and saveInteractive goals, library searches, tactic trials and saved source proofs.
- 4Check integrationsCompile, inspect every result’s assumptions, then run the kernel checker.
- 5Check the exact targetRebuild the final closure and check theorem and policy against the fixed type.
The analytic side
Gaussian identities, smoothing, concentration and covariance comparison supplied probability estimates. Finite nets and orientation arguments then controlled whole families of matrix candidates. Library bridges made the concrete Gaussian product measure agree with the matrix and scalar representations used in the proofs.
The spectral side
Non-backtracking walks, meaning walks that do not immediately reverse an edge, supported moment and trace bounds. These were combined with recurrence-error control and Chebyshev polynomial estimates to obtain a positive lower spectral bound. That bound fed the construction of well-conditioned fits.
The final step moved from fixed positive densities to arbitrary sample-size sequences by checked padding and monotonicity reductions. This preserved the order “choose the spectral constants, then quantify over all sequences.” The fitting and balanced-alternative clauses were assembled from these limits and the already checked supercritical results.[3][8]
A crucial distinction: an intermediate theorem can pass an axiom audit while still taking an unproved mathematical premise as an argument. The journals kept those premises visible. Completion was declared only after the actual probability laws supplied them and the final theorem matched the fixed statement.
A small final proof can depend on a large development
The final saved proof is the composition below. The short expression is not a measure of the work: its verified dependency closure contains 648 modules.
Proof.
exact (paper_main_results_from_conditioned
paper_main_conditioned_limit).
Qed.The merged results module is analysis/PaperMainResults.v at commit df283b79 of LLM4Rocq/ellipsoid_rocq, a private repository.
Three workers, with distinct contributions.
Initially, AWS had the Codex master plus Arthur and Marcol. Lancelot joined later, making three proof workers plus one master. The Mac coordinator handled deployment, recovery and some supervision. The AWS logs also record two short setup/review helpers; they are not counted as mathematical workers here. The recorded AWS model identifiers were gpt-6-astra for the master and claude-opus-5-5 for the three workers. Earlier Cleps work used other model configurations.[4][6]
| Role | Observed contribution | Why it mattered |
|---|---|---|
| ArthurProbability and analysis | Gaussian smoothing and probability bridges; orientation families; vanishing remainder events; the actual lower spectral probability law and its fixed-density specialization. | Supplied a probability theorem needed by the final conditioned-fit reduction, not merely a conditional interface. Representative endpoint: PaperMainFixedLowerProbability. |
| MarcolGeometry and spectral estimates | PSD geometry and feature bounds; walk enumeration, non-backtracking moment and trace-event estimates; the conditioned-fit reduction from the lower spectral law. | Developed the difficult combinatorial/spectral branch and the construction connecting spectral control to fitting. Representative endpoints: PaperMainSquarefreeWalkNBRate and PaperMainConditionedFromLower. |
| LancelotLate proof support and review | Two Chebyshev-parameter modules with 10 and 13 audited results; reviews of the final composition and source/receipt consistency. | Supplied the scalar gap and small-error tolerance used in the actual lower-law proof. Its review also identified a concrete cast-conversion problem that was subsequently resolved. |
| Codex masterIntegration and proof work | Owned task allocation and dependency delivery, proved substantial analytic and assembly modules, rechecked worker contributions, and wrote the final results and policy. | Connected independently developed interfaces and established that all premises were discharged. This was a contributing mathematician/programmer role as well as a coordination role. |
Attribution follows assignments, worker reports and integration records, not Git author names or raw commit counts. Roles changed over time; this table summarizes their main contributions.[3]
A concrete collaboration in the final proof chain
Lancelot found a representation problem before final assembly.
One module expressed the scalar threshold as a cast of a natural-number product; another expressed it as a product of real numbers. Treating them as equal by computation at the concrete index could unfold a natural-number multiplication involving 3,145,740. Lancelot recommended a symbolic equality for arbitrary indices instead.
The final paper_main_squarefree_lower_tau lemma uses that algebraic bridge. The review records the issue as resolved in the integrated lower-probability module. This is a specific, traceable benefit of another agent reading the composition. It is not a measured saving in minutes.[5]
Assessment: all three workers were useful in the ordinary, observable sense: their work survived integration and was consumed by the proof. Parallel work was feasible because module ownership and interfaces were explicit. How much elapsed time it saved remains unmeasured.
Rocq MCP was a working instrument,
not just an installed dependency.
The server, rocq-mcp-evolve, exposed Rocq’s live proof state to the agents. They could open a theorem, inspect its goals, submit tactics, try alternatives, roll back and check a candidate proof. This gave direct feedback on each proposed proof step. The logs establish use, but they do not measure the incremental time saved over a compiler-only workflow.
Unique native MCP tool calls before the proof-completion receipt on 2 October at 13:58 UTC.
| Worker | Open | Step | Try | Check | Build | Rollback | Auto-close | State | Total |
|---|---|---|---|---|---|---|---|---|---|
| Arthur | 481 | 934 | 163 | 69 | 56 | 45 | 1 | 4 | 1,753 |
| Marcol | 441 | 1,132 | 50 | 80 | 381 | 29 | 1 | 3 | 2,117 |
| Lancelot | 7 | 10 | 1 | 3 | 9 | 3 | 2 | 1 | 36 |
| Total | 929 | 2,076 | 214 | 152 | 446 | 77 | 4 | 8 | 3,906 |
Counts come from three explicit primary Claude transcripts, deduplicated by tool-call ID. They include setup tests, retries and proof replay. One call can contain several tactics; repeated openings can target the same theorem. They exclude MCP requests sent through shell scripts, earlier Cleps work and later publication work. Lancelot joined much later, so totals are not a productivity ranking.[4]
The master used a private MCP connection through scripted orchestration, so it has no comparable native-tool count in this table. A separate receipt records successful MCP replay of both conditioned-limit theorems and the final paper_main_results theorem at 13:11 UTC. That receipt still said independent verification was pending, correctly: the final clean check came later.[7]
Where the server helped
- Rocq exposed the actual remaining goal after tactic attempts.
- Agents tried several alternatives and recovered previous states without rebuilding the entire library for every step.
- Whole-file diagnostics located elaboration and import failures.
- Library queries and short proof experiments informed saved source changes.
What it did not establish
- Interactive completion did not prove that the saved source was complete.
- A later theorem could open despite earlier failures admitted within the session.
- The historical notebook records a “no holes” build message for a file that still contained an admitted theorem.
- Import success on a trivial smoke file did not guarantee the correct project load path.
The effective combination was MCP plus independent checking. MCP supported exploration. CLI compilation checked saved files. Assumption audits and rocq check checked the resulting proof libraries. The final comparison checked both the theorem and the policy target against the fixed statement.[1][6]
A useful discrepancy between prescribed and observed practice: the instructions encouraged auto_close first on every new goal, but the counted native sessions contain only four such calls, against 929 opens. The observed workflow was mainly driven by step, try, check and build. This count does not include automation written inside tactics or invoked through shell transports.
A layered toolchain.
| Layer | Tools used | Function in this project |
|---|---|---|
| Mathematical foundations | Rocq Stdlib, MathComp and MathComp-Analysis | Real analysis, finite sums, matrices, measure and Gaussian probability. Existing project modules supplied substantial reusable calculus and comparison results. |
| Proof construction | Rocq MCP; ssreflect; Search/Check; algebraic and arithmetic tactics | Goal-directed development, theorem lookup and small experiments. Explicit bridges handled the MathComp Boolean-order / Stdlib proposition boundary. |
| Saved-proof verification | rocq compile, rocq check, Print Assumptions, project check scripts | Compilation, independent kernel checking, complete assumption audits and the final exact-target test. No result of the paper was permitted as an axiom. |
| Source and dependency management | Git branches and separate checkouts; source hashes; explicit _CoqProject entries | Separated ownership, preserved old work and checked the exact sources supplied to consumers. Copying compiled objects was avoided after a dependency-fingerprint mismatch exposed the risk. |
| Investigation and orchestration | Shell, Python scripts, rg/grep, JSON receipts and Markdown journals | Library searches, dependency inventories, automated audits and persistent state between long reasoning sessions. The master recorded 25 compaction events before completion. |
| Runtime and coordination | Docker, opam, AWS EC2, tmux, SSH and Session Manager | A common pinned compiler/library environment, private proof-server processes, durable agent sessions and remote access. They supported reliability; they were not mathematical proof engines. |
The primary transcripts contain 2,033 Arthur Bash calls, 1,656 Marcol Bash calls and 139 Lancelot Bash calls before the cutoff. The master made 2,522 orchestration calls named exec; each could run several commands. These units are not directly comparable. Shell text frequently mentions source search, compilation and Git, but those mentions are not separate executions.[4]
Recorded environment and reproducibility anchors
All AWS proof roles used the same pinned image: Rocq 9.1.1, OCaml 5.3.0, Stdlib 9.0.0, MathComp 2.6.0 and MathComp-Analysis 1.16.0. Each worker had a private checkout and MCP process. The VM had 16 vCPUs and approximately 61 GiB of usable RAM from its nominal 64 GiB allocation.[6][7]
Image: sha256:d28a2af774271dc1c3592aa423b064ae134a16bc22220ff5faf897b7aa9468fb
Proof commit: 212a24947ecc03bd0fe84fa63b65e2c1bf8ba273
Merged commit: df283b7951db565183b8cf3f1bf96b382f6592f8
The recorded clean source build used scripts/check_analysis.py on a source-only copy with --closure-only --jobs 2. Its fresh=false field describes the checker’s invocation mode, not copied objects. The verification record explicitly records zero copied compiled objects.
Coordination was real work.
Additional workers increased the number of independent proof lines, but also created dependency, memory and communication work. The journal contains concrete failures rather than a frictionless account of parallelism.
| Observed issue | What happened | Lesson for the next run |
|---|---|---|
| MCP environment mismatch | Earlier servers could not find the required MathComp imports. Later, Lancelot’s first smoke file selected a project load path inappropriate for its real analysis modules. A private reconnect fixed the latter; real imports and a 13-proof module were then checked. | Test a real project import at startup. Record compiler, package versions and effective load paths, not only a trivial theorem. |
| Long-lived server memory | The journal records a Marcol Docker out-of-memory failure at an 8 GiB cap and a nearby Arthur disconnection. The original workers’ MCP caps were raised to 16 GiB, while CLI runs stayed at 8 GiB. Lancelot later received a 12 GiB MCP cap. | Budget persistent server memory separately from short compiler jobs. More agents are not free simply because CPU capacity is idle. |
| Dependency readiness | Lancelot needed 202 existing dependency modules compiled locally. The serial build ran from the 11:28 assignment period until 12:08. It could work on a base-library scalar task while waiting. | Publish exact interfaces and prepare their compiled dependency closures before dispatch. Offer an independent first task when that preparation is still running. |
| Queued message was not delivered | The Mac coordinator queued Lancelot’s readiness around 09:21. The long-running master did not receive it until 11:25, after the user noticed. The same message was sent into the active run and explicitly acknowledged. | For time-sensitive coordination, require acknowledgement. A visible queued message is not proof of receipt. Codex’s “steer” and “queue” have different semantics. |
| Source registration and library conversion | A root build found a module omitted from its project file. Other failures involved stale compiled dependencies, mixed real-number notation and mismatched natural/real casts. | Keep one owner for registration and integration. Use explicit library bridges and build saved source before reporting success. |
| Recovery and publication overhead | Cleps became unavailable, so sources and branches were recovered and moved to AWS. Checkpoints were consolidated before proof work continued. Successful local work was not automatically published to GitHub. | Maintain source backups, distinguish available from integrated work, and report local verification separately from publication. |
The first three issues are supported by the AWS master and worker records; the communication delay and migration are also documented by the Mac coordinator. The message delay was about two hours, not a measurement of its effect on total completion time.[3][6][7][9]
The final day, in context
The review target changes to the three main statements. Earlier proof libraries and other branches remain available for reuse.
AWS takes over after recovery from Cleps. The master, Arthur and Marcol work on separate proof families under a common environment.
Lancelot receives its first mathematical assignment. Its first scalar module is checked by about 11:51; the second is reported checked at 12:18.
Lancelot delivers the composition review, including the cast-conversion finding. Lower-law and conditioned-limit integration continue.
The final theorem and policy are saved and kernel checked. The clean exact-type check is still pending, and the journals say so.
The clean 648-module check passes. Completion is recorded shortly afterward; the user merges the published result at 14:35.
This is the final development phase, not a claim that the whole paper was formalized from scratch in a day. It relied on an existing library and earlier human-directed and agent-generated work.
A successful case study,
not a controlled experiment.
Supported by the records
- All three workers produced retained, integrated proof contributions.
- At least one cross-agent review identified a specific issue resolved in the final source.
- MCP was used extensively by Arthur and Marcol, and concretely by Lancelot and the master.
- A shared environment and layered checks supported reproducible integration.
- The final merged sources match the recorded verified proof.
Not established here
- A speedup factor for three workers versus one.
- The marginal time or monetary saving due to MCP.
- A ranking of models or agents from unequal assignments.
- Total project cost, total human effort or a reliable all-session token bill.
- Human-verified faithfulness to the paper, or protocol acceptance.
Tool counts measure interaction, not mathematical progress. A difficult theorem can require many unsuccessful calls; a short assembly proof can depend on hundreds of earlier results. Module and commit counts are similarly unsuitable as stand-alone productivity measures.
Recommended method for a future formalization
Keep one stable main-statement package and a small human review surface. Use a proof-writing master with two substantial workers, adding a third when a concrete independent task is ready. Give each worker its own source tree and proof state. Prepare dependencies, require task acknowledgements, and budget memory before adding concurrency. Keep compiler and kernel checks separate from interactive diagnostics.
To evaluate efficiency rather than only completion, record task start/finish times, dependency waiting, failed attempts, model usage and integration time from the beginning. Compare matched bounded tasks with and without MCP, or with one versus several workers. Treat the present evidence as motivation for those experiments, not as their result.[9]
How the accounts were checked.
The original October 2 audit was read-only on AWS. It inspected completion records, selected saved proofs, journals and four explicitly identified primary session logs. It did not message the proof agents, change their work, or rerun the full compiler pipeline. This public copy presents the aggregate measurements and includes the source-hash check, merge receipt and kernel/audit log. The other historical receipts, transcript excerpts and measurement inputs remain in retained project records; they are not included in this package. Sources 1–9 concern that original account. Sources 10–13 identify the public continuation; this page update did not rerun its proofs.
- Final proof verification and source audit
Recorded proof verification (retained project record; not included in this public package), clean-check log (retained project record; not included in this public package), kernel/audit log, this report’s source-hash check, and merge receipt. The record reports no unexpected axioms, zero holes and exact theorem/target checks. Its proof-time regression results include 38 tests, 45 draft-review records and zero broken links. The library retains 22 historical lint warnings; “zero warnings” applies only to the final exact-type check.
- The fixed statement and its interpretation
In the private repository LLM4Rocq/ellipsoid_rocq, at the merged commit
df283b79:analysis/challenges/paper_main_results/Challenge.v, the challenge metadataanalysis/challenges/paper_main_results/challenge.jsonand the main definitionsanalysis/PaperMainDefinitions.v. The admitted statement placeholder is a specification, not part of the submitted solution closure. That repository is not public, so these files are named without links. - Task ownership, checked contributions and completion
AWS
MASTER_JOURNAL.md,arthur-report.md,marcol-report.md,lancelot-report.md, and the committed progress recordanalysis/reports/MAIN_PROOF_PROGRESS.md(private repository, commitdf283b79). Selected dated excerpts and source hashes were inspected in the source collection (retained project record; not included in this public package). Later completion records supersede earlier “pending” entries without erasing them. - Session-level usage audit
Aggregate counts and exact scope (retained project record; not included in this public package), reproduced by collect_usage.py (retained project record; not included in this public package). The cutoff is the completion receipt at 13:58:26 UTC. Calls are counted once per ID; no malformed lines or duplicate tool-call IDs occurred in the selected records. Guardian/helper transcripts, the Mac coordinator and Cleps are excluded. File hashes identify the inspected logs, but raw logs remain private on AWS.
PROOF COMPLETEtext is not counted as a distinct accepted theorem. - Lancelot’s bounded composition and artifact review
The L2 review identified the natural/real cast bridge; its later update marked it resolved. The L3 review independently checked the closure and final source/receipt consistency without claiming human review. See the audit excerpts (retained project record; not included in this public package) and the final lower-probability source
analysis/PaperMainSquarefreeLowerProbability.v(private repository, commitdf283b79). - Historical methods and operational record
The methods notebook
analysis/reports/AUTOFORMALIZATION_METHODS.md(private repository, commitdf283b79) and Mac coordinator journal document library bridges, MCP diagnostic limitations, recovery, environment setup and the message delay. Relevant passages were inspected in the source collection (retained project record; not included in this public package). They are dated observations, not current-status summaries. - Actual MCP proof evidence
Master’s final theorem replay (retained project record; not included in this public package) and Lancelot’s real-import and whole-module check after reconnect (retained project record; not included in this public package). These records support MCP use; final proof acceptance at the fixed type is established separately by source [1].
- The final composition in saved code
The modules
PaperMainConditionedLimit.v,PaperMainConditionedFromLower.v,PaperMainFixedLowerProbability.v,PaperMainResults.vandPaperMainPolicy.vinanalysis/of the private repository LLM4Rocq/ellipsoid_rocq, at the merged commitdf283b79. The commit identifies the merged bytes, not moving branch tips. - Official workflow documentation, not project-performance evidence
OpenAI’s subagent guidance describes independent tasks and the coordination cost of concurrent edits. Its steering and queueing documentation explains the message-delivery distinction. These sources informed terminology and recommendations; they do not prove any speedup in this run.
- Public phase 13 release and checker repair
Tag phase13 identifies
f16e6a263f8579f7f2a794537ee194d78842cafe. See its README, checker and repair commit. The tag message records the final fresh-clone and regression results; paths to retained evidence in that message do not imply that its raw logs are public. - Public phase 14 statements and proofs
Tag phase14 identifies
5f81a422a9b430f98a3ae8be97fdd9f2ae91e8f7. Compare the PSD-rank statement with its theorem, and the lift statement with its theorem. The rank bound has the form2^n <= r^Kfor sufficiently large evenn; the files give the precise quantifier order. - Public shifted-sample statements, proofs and checks
Tag shifted identifies
305747af48d4f75e26378888a8111d591145fa52. The README maps all seven statement files to the corresponding proof files. The identity checks apply each theorem at its frozen statement type. The release adds 23 library files and records checks in two fresh clones. - Public documentation changes on October 25
The release citations and the proof-route and logarithm correction change documentation only. They leave the shifted tag and its proof sources unchanged. The latter commit records the D2 source-review finding; the separate bounded second-reading report is retained in project records, not published with this page. A third commit, the row-size condition and the reindexing statistic, corrects one table row of
extension/README.mdand the header comment ofextension/Shifted/SparseDimensions.vafter that second reading. It changes no Rocq statement or proof.
Scope of the public evidence
The historical usage counts were computed from specifically identified session logs at the stated cutoff. Repeating that measurement requires the original private inputs, which are not distributed here. The public repository allows inspection of the released mathematical statements, proof sources and checker. This HTML is readable offline; external source links require an internet connection.