BMBrennan McCloud

Independent assurance audit · Revision 2

A proof can be timeless.Verification cannot.

OpenAI's ten machine-checked advances are backed by unusually strong proof artifacts. This audit found one materially different validation boundary, one missing provenance layer, and one claim from our first release that needed to be corrected.

10announced advances
12formal result bundles
38named theorem targets
0proof holes in the solutions

This is not a claim that any result is false. It is an audit of what the public release proves, what it asks us to trust, and what evidence would make that trust portable.

00 / EXECUTIVE FINDING

The proof evidence is strong. The assurance case is incomplete.

Formal verification closes the proof layer. It does not automatically settle the statement's intended meaning, the definition bodies a challenge allows a solver to fill, or which checker versions produced the acceptance claim.

THE LINE WORTH REMEMBERING

Formal verification does not remove trust. It relocates and concentrates it.

The remaining trust surface may be small in volume, but it controls what the machine-checked artifact means and whether the verification event can be reproduced later.

11 / 12

bundles use theorem-hole comparator boundaries only.

1 / 12

includes four definition holes and therefore requires a different review path.

12 / 12

request the independent nanoda checker in their public configurations.

99.8% / 0.2%

We are retiring our own most shareable metric.

It compared proof-file bytes with statement-file bytes. Bytes are not units of confidence, effort, or consequence. The better insight is that a tiny human trust surface can determine the meaning of millions of machine-checked characters.

01 / THE ASSURANCE STACK

“Verified” is a stack, not a switch.

The proof is one layer in a larger assurance case. Overall confidence is bounded by the weakest consequential layer, not averaged across all of them.

Audit finding A · Different assurance path

One result bundle crosses a different validation boundary.

The GapCVP comparator configuration lists four theorem targets and four definition holes. That makes its validation path structurally different from the other eleven bundles.

Comparator checks that each filled definition has the expected name, type, universe, safety level, permitted axioms, and kernel acceptance. Its own documentation also says definition-hole solutions must always receive an additional verifier because their bodies can satisfy the interface without satisfying the challenge's intended meaning.

No evidence here says the GapCVP result is wrong. The finding is narrower and more useful: the release should expose the extra definition-body review as a first-class part of its assurance case.

H_GapCVP comparator boundary

"theorem_names": [
  ... 4 theorem targets
],

"definition_names": [
  "gapCVP400Promise",
  "binaryNearestCodewordPromise",
  "binarySyndromeDecodingPromise",
  "finitePGapCVPPromise"
],

"enable_nanoda": true
Comparator establishes

Interface match, allowed axioms, kernel acceptance, and external-checker execution.

Additional review establishes

That the filled definition bodies represent the intended computational problems.

Inspect the source evidence
02 / VERIFICATION FRESHNESS

A proof may be timeless. Its verification event is not.

“This checked” is a claim about a particular proof artifact, challenge, dependency graph, kernel, external checker, sandbox, and moment in time.

July 13Lean 4.32.0 is released. The public repository pins this toolchain.
July 28Lean 4.32.2 fixes a kernel soundness issue that could affect Comparator. The release recommends current nanoda too.
August 1OpenAI announces the ten advances and formal proof release.
August 2The public repository's currently visible commit is created.

The missing object is a versioned assurance manifest.

Every public “verified” claim should be accompanied by a portable, signed record of the exact artifacts and validation environment that produced it.

Proof artifactcommit + content hash
Trusted challengecommit + content hash
Lean kernelversion + binary hash
External checkername + version + hash
Dependencieslockfile + environment
Validation eventtimestamp + outputs + signer

This audit does not claim the released proofs exploit the July bug. All twelve public configurations request nanoda. The point is that enable_nanoda: true is an instruction, not a durable attestation of which nanoda binary actually ran.

Download this audit's manifest ↗
03 / SEMANTIC FAITHFULNESS

Meaning is not untestable. It is outside the proof certificate.

Our first release drew the line too sharply. A checker cannot infer private intent from a proof alone. But independent source statements and counterfactual probes can test many forms of semantic drift.

Typecheck

Does the statement parse and inhabit the formal language?

Provability

Can a valid proof be constructed for that formal statement?

Counterfactual probes

Does the formalization behave correctly when meaning-bearing conditions change?

Domain acceptance

Does an accountable expert or organization accept it as the intended claim?

89.6%

A 2026 preprint reports that bidirectional provability fingerprints plus counterfactual probes detected 89.6% of controlled statement drift at a 3.0% false-positive rate across 2,183 natural-language/Lean pairs. That is promising evidence, not a final replacement for expert acceptance.

The corrected claim: semantic faithfulness cannot be certified from the proof artifact alone. It can be instrumented when an independent source specification exists, while final reliance remains an accountable decision.

04 / ENTERPRISE TRANSLATION

The same boundary appears when an AI agent acts inside a company.

An agent can prove it followed a workflow and still pursue the wrong intent, rely on stale evidence, or stop before the real-world outcome occurred. Consequential actions need a portable assurance record.

Proposed operating artifact

AI Action Assurance Record

Not a transcript. Not a compliance badge. A compact, inspectable record of what the system was authorized to do, what evidence it used, what changed, how the outcome was verified, which validator ran, and who owned the exception.

AAR / 1.0

Build a sample record

DRAFT
01
02
03
04
05
06
07
08
The downloaded file stays in your browser. No form data is sent anywhere.
Operations

Did the real-world outcome occur, or did the workflow merely end?

Risk

Which policy, evidence, and validator version governed the action?

Audit

Who approved the exception, and what was changed?

Procurement

What inspectable evidence arrives with every consequential action?

This proposed record is not a standard or a claim of NIST endorsement. It is a practical artifact designed to complement lifecycle governance, documentation, and testing/evaluation/verification/validation practices.

05 / EVIDENCE MATRIX

Twelve bundles. Thirty-eight theorem targets. One different interface.

The public release is stronger than a folder of proofs: it publishes trusted challenge files, explicit permitted axioms, and independent-checker configuration. The matrix below shows the boundary for each bundle.

BundleTheoremsComparator boundaryNanoda
A · Sphere packing4Theorem holesON
B · Binary codes6Theorem holesON
B · Spherical codes4Theorem holesON
C · Permanent2Theorem holesON
D · Non-sofic group1Theorem holesON
E · Connes rigidity2Theorem holesON
F · Ehrhart inequality4Theorem holesON
G · Quantum repetition2Theorem holesON
H · GapCVP44 definition holesON
I · Ramsey4Theorem holesON
J · Compactness3Theorem holesON
J · Two-degenerate2Theorem holesON

Terminology matters: the four GapCVP definition holes are in the trusted comparator challenge interface. They are not sorry holes in the released solution, whose manifest reports a sorry count of zero.

06 / METHOD + LIMITS

A stronger claim is a narrower claim with better receipts.

This revision separates what the public artifacts establish from what would require mathematical peer review, independent reproduction, or additional organizational acceptance.

What this audit did

  • Parsed the public formalization manifest and all twelve comparator configurations.
  • Counted thirty-eight named theorem targets and identified every definition-hole boundary.
  • Inspected the GapCVP trusted challenge definitions and the Comparator guarantees attached to them.
  • Compared the pinned Lean toolchain with contemporaneous kernel release notes.
  • Reviewed current work on semantic faithfulness and translated the assurance pattern into an enterprise action record.

What this audit did not do

  • It did not peer-review the underlying mathematical arguments.
  • It did not independently rebuild all twelve result bundles.
  • It found no evidence that a proof is false or that the July kernel bug was exploited.
  • It does not treat the 2026 faithfulness preprint as settled consensus.
  • It does not claim the Action Assurance Record is a formal standard.
01OpenAI · ten-proofs repositoryPrimary release artifact
02Lean Comparator documentationDefinition-hole guarantees
03Lean · Validating a ProofGold standard and remaining issues
04Lean 4.32.2 release notesComparator-relevant soundness fix
05The Faithfulness Gap2026 preprint
06NIST AI Resource CenterAI RMF and TEVV resources

The proof is machine-checkable.The assurance case should be inspectable.

That is the more defensible research claim, and the more useful operating principle for any company giving AI systems real authority.