Archived page from the earlier OMEGA site (October 2026). Its figures and statuses have not been re-checked since and may be out of date. Current research: Research. Current evidence record: Evidence.

§ 7

Evidence ledger

Every important public claim, with the same twelve fields: how far the evidence reaches, where it stops, and whether the check has ever been seen to fail.

25 findings in this site ledger 20 of 25 ledger rows name a public repo and command 22 of 25 with a negative control 4 PROVEN8 MEASURED13 OBSERVED8 OPEN
Four kinds of standing, kept apart
Demonstrated
Current public audit: 46 verified results, 40 with checking instructions. 25 findings, each mechanically or empirically established inside a named frame and graded below. 20 rows name a public repository and command. This structural ledger count differs from the current public audit, which checks instruction sources and also counts public issue reproducers. Public availability does not establish successful or independent reproduction.
Externally accepted
12 results in systems Omega did not build, merged or released by their maintainers: eight reported defects fixed upstream and four fix Omega authored. Acceptance of a change is not endorsement of Omega. Upstream results
Independently reproduced
0 results. No result on this site is known to have been reproduced by anyone other than the author. Each row records this. Anyone who reproduces one, or fails to, is asked to say so: discuss a system to test.
Open
8 questions posed and not answered, listed in §7.2; one pull requests and four reports without merged fixes in the linked upstream index.

How to read a grade. PROVEN follows from stated premises inside a named frame. MEASURED is empirical with a stated sample. OBSERVED was witnessed in one instance with no claim about how often. OPEN is a question posed and not answered. A grade is a statement about the evidence, not about importance.

§ 7.0

Worked case

OBSERVED

A system passed all 24 of its recorded tests and still had a serious flaw.

The note was never checked against the list of permissions that had actually been granted. It only had to look right. Anything that could read a public list of what fixes exist could write itself a valid-looking note, and the program would act on it.

Does not establish. It is not a break-in from outside. It needed nothing secret, but it also needed the ability to run code on that machine already.

Two artifacts, stated separately.
Flagship bundles (STARTAUTH-01, SCHED-01, V2): not public; evidence bundle of records and pointers.
Minimal reproduction of the membership defect: omega-n1-permit-membership, public, counted below.
§ 7.1

Records

Each record opens to its twelve fields. The grade and the one-line finding are visible closed.

OBSERVED n-1-permit-membershipexecute · coverage illusion A program passed all 24 of its recorded tests and still accepted a permission record that had never been issued.
Claim
A start permit assembled entirely from public registry facts, with its reference number derived by the authorizer's own function and committed to no ledger, was accepted by the bounded executor and the registry-named transform was applied; the target's bytes changed.
Status
OBSERVED Witnessed in one instance. No claim about how often.
Question
Authorised is not executed
Subject
The frozen STARTAUTH-01 executor, attacked from outside; the minimal public reproduction re-creates the defect in a small program. built for the study
Frame
One executor, one registry-named transform, one target file; forgery built from public registry facts.
Method
Three forgeries of increasing strength handed to the executor; bytes hashed before and after.
Oracle
The target bytes, hashed before and after each case.
Negative control
Present S16 and S17, the two weaker forgeries, were refused. Their refusals are what make the third result legible.
Denominator
24 of 24 recorded cases matched their expectation; one of them (S18) expected the failure.
Limitation
One defect in one program built for this study. Not a measurement of deployed systems, and no claim about how often authorisation records are treated as evidence of authorisation. Not a break-in: producing the forgery requires the ability to run code as the same user, and such an actor can edit the target directly without any record. The minimal fix establishes that a membership check closes this specific defect; it does not establish at-most-once execution, atomic consumption, or independent measurement of the effect.
Source
repowazdogz-droid/omega-n1-permit-membership @ efba311
Reproduce
git clone https://github.com/repowazdogz-droid/omega-n1-permit-membership && cd omega-n1-permit-membership && python3 reproduce.py
Independent reproduction
None known.

This finding on its own page

OBSERVED authorized-limit-and-executed-write-disagreedauthorise · faithfulness An agent was limited to 4 KB. It wrote 100 KB. Every test passed, an independent replay verifier said VERIFIED, and a checked invariant held.
Claim
A write of 100,000 bytes executed under a policy that capped writes at 4,096 bytes, while 66 of 66 tests passed, an independent replay verifier returned VERIFIED, and a checked complete-mediation invariant held.
Status
OBSERVED Witnessed in one instance. No claim about how often.
Question
Authorised is not executed
Subject
A Cedar-mediated MCP tool server built for the study (authored). built for the study
Frame
One server, six tools, 25 adversarial scenarios; the write cap is a policy constant.
Method
Every decision is written to a hash-chained ledger that an independently written replay verifier reads back; four properties (mediation, binding, policy adequacy, effect verification) are reported separately.
Oracle
The bytes actually written to the fixture, read back independently of the executor.
Negative control
Present The repair is re-attacked with a falsification sweep; the version-one audit is preserved so the failing state can be re-run.
Denominator
66 of 66 tests in version one; one write of 100,000 bytes against a 4,096-byte cap.
Limitation
One defect in one server built for this study, not a measurement of deployed systems and not a claim about how often authorization layers and executors diverge. Mediation held throughout; what failed was the binding between the authorized operation and the executed one. Policy adequacy is separately not established, and two counterexamples covering it are retained unfixed.
Source
repowazdogz-droid/mcp-authority-boundary @ 03854ddc
Reproduce
npm install && ./run.sh
Independent reproduction
None known.

This finding on its own page

PROVEN budget-bound-for-all-reachable-statesauthorise A spending cap was proved to hold in every state the system can reach, not just the ones anyone tested.
Claim
Total spend never exceeds the cap in any reachable state of the escrow protocol, proved in Lean for any finite set of replicas and any non-negative amounts.
Status
PROVEN Follows from stated premises inside a named frame.
Question
Individually compliant is not collectively safe
Subject
A Lean 4 model of the escrow protocol (model). built for the study
Frame
Any finite set of replicas, any non-negative amounts; crash is global in the Lean model.
Method
Induction over reachable states with the budget bound as the invariant; a TLA+ model and a Python fault harness exercise what the proof does not.
Oracle
The Lean 4 kernel (v4.32.0), axioms propext and Quot.sound only.
Negative control
Present Four proved negative controls: remove a guard and the theorem must fail.
Limitation
The bound, not conservation. No liveness, availability, or Byzantine model; crash is global in the Lean model, and per-replica crash is only exercised in the bounded checks. The proof holds relative to the transition system being a faithful abstraction of the protocol, which is argued, not machine-checked.
Source
repowazdogz-droid/escrow-budget @ 9c199db4
Reproduce
make clean && make check
Independent reproduction
None known.

This finding on its own page

OBSERVED cjson-does-not-round-trip-numbersverify A widely used library reads a number, writes it back out, and the two are not the same.
Claim
A widely used C JSON library does not preserve numbers across a serialise-and-reparse round trip: its number pipeline is lossy by design, printing with limited precision and comparing re-reads by tolerance rather than equality.
Status
OBSERVED Witnessed in one instance. No claim about how often.
Question
The specification proved is not the property intended
Subject
cJSON, a widely used C JSON library (third-party system), against a Lean re-implementation. third-party subject
Frame
Number round-trip only; a lax parser tuned for triage.
Method
Differential testing of the Lean model against the C reference over a fuzzed corpus.
Oracle
The C library's own output on the same inputs.
Negative control
Present A 20-attack mutation suite guards the harness; 0 port-wrong classifications over 120,000 inputs.
Denominator
116,476 agree of 120,000 fuzzed inputs; idempotence over 20,318.
Limitation
That the library is defective for its purpose. A lax parser tuned for triage is a different artifact from one built to be exactly round-tripping; this is that a round-trip theorem is false of the target, not a quality judgement.
Source
repowazdogz-droid/vsf-cjson @ dcdae40b
Reproduce
./verify.sh --quick
Independent reproduction
None known.

This finding on its own page

OBSERVED completed-sample-count-depends-on-scorer-orderverify · self certification The same failing evaluation reported a different number of finished samples when its scoring steps were listed in a different order.
Claim
In a widely used evaluation framework, the same failing run reported a different number of completed samples depending only on the order its scorers were declared in: 6 of 6 under one ordering and 4 of 6 under the other, with both runs ending in a success status.
Status
OBSERVED Witnessed in one instance. No claim about how often.
Question
Passed is not correct
Subject
Inspect AI, a widely used evaluation framework (third-party system). third-party subject
Frame
One failing run, two scorer orderings, mock model.
Method
Same run declared with scorers in two orders; the completed-sample metadata compared.
Oracle
The run metadata the framework writes about itself, compared across orderings.
Negative control
Not applicable The two orderings are each other's control; nothing else is varied.
Denominator
6 of 6 under one ordering, 4 of 6 under the other, both with a success status.
Limitation
One defect in one framework, in the metadata a finished run records about itself. It says nothing about the correctness of any model score, nothing about how often the condition arises in practice, and nothing about other evaluation frameworks. The upstream design decision to score errored samples is separate and was not disputed.
Source
UKGovernmentBEIS/inspect_ai @ f0e57a7c
Reproduce
pip install inspect_ai && inspect eval repro.py --model mockllm/model
Independent reproduction
None known.
Upstream
MERGED UPSTREAM Fixed upstream in inspect_ai pull request #4604. Link

This finding on its own page

PROVEN concurrent-capability-bound-over-interleavingsauthorise A limit on what an agent may do was proved to hold no matter how concurrent operations interleave.
Claim
A capability meter never exceeds its cap over every concurrent interleaving of charge operations, proved in Iris concurrent separation logic for any cap and any finite list of operations.
Status
PROVEN Follows from stated premises inside a named frame.
Question
Individually compliant is not collectively safe
Subject
A Rocq/Iris model of a concurrent capability meter (model). built for the study
Frame
Any cap, any finite list of charge operations, every interleaving; terminal-observation safety only.
Method
Adequacy over every reachable configuration in Iris concurrent separation logic.
Oracle
The Rocq kernel; Print Assumptions committed and diffed in CI.
Negative control
Present Floor E: an explicit counterexample showing per-key safety does not certify a tighter cross-key aggregate bound.
Limitation
It is terminal-observation safety, the value the driver reads is within the cap, not an all-intermediate-state invariant, and it carries no liveness or wait-freedom. The kernel check was not re-run in this pass; axiom-freedom rests on the committed assumptions audit plus a live search finding no admitted goals.
Source
repowazdogz-droid/capctl-iris @ 5e9284a0
Reproduce
eval $(opam env --switch=capctl-iris) && make verify
Independent reproduction
None known.

This finding on its own page

MEASURED judge-agreement-is-partly-forced-by-accuracyverify · convergence Two AI graders agreeing tells you less than it appears to, because part of that agreement is forced by both being right.
Claim
Across 600 items and 171 judge pairs, judge errors correlated positively in 171 of 171 pairs at mean phi 0.567, and the correlation between pairwise agreement and accuracy fell from 0.824 to 0.077 once the algebraically forced component of agreement was removed.
Status
MEASURED Empirical, with a stated sample.
Question
Passed is not correct
Subject
Language-model judges on 600 items with a machine-checkable key (existing models). third-party subject
Frame
600 items, 171 judge pairs; ground truth is a key, not human labelling.
Method
Pre-registered two-experiment study; the algebraically forced component of agreement is removed and the residual correlation reported.
Oracle
The machine-checkable answer key; report fields named per headline.
Negative control
Present An adversarial control (admissibility fixed before the data) fired as designed.
Denominator
171 of 171 pairs positive, mean phi 0.567; corr 0.824 to 0.077.
Limitation
Not a claim that agreement between judges carries no information, and not a general law about language-model judges. It is a property of these judge checkpoints on these 600 items against a machine-checkable answer key. Ground truth here is a key, not human labelling, and the mechanism behind the second experiment is reported as open rather than settled.
Source
repowazdogz-droid/evaltrust @ c8196e1a archived
Repository archived 2 September 2026 after a dated correction to its second experiment. The numbers cited here are from the first experiment and are not affected by the correction, which withdraws a vendor-level interpretation of a separate contrast. Read the correction.
Reproduce
python scripts/agreement/build_report.py && python scripts/agreement/sweep_writeup.py
Independent reproduction
None known.

This finding on its own page

MEASURED judge-agreement-undetermined-at-n45verify At the sample size used, the question the experiment was built to answer could not be answered either way, and that is reported rather than rounded to a result.
Claim
At 45 answers, a judge with zero disagreements has an agreement interval spanning its whole range; the perfect score reads as 'no counterexample found at this sample size', not as demonstrated reliability.
Status
MEASURED Empirical, with a stated sample.
Question
Passed is not correct
Subject
An ensemble judge on 45 GSM8K answers (existing models). third-party subject
Frame
45 answers; a zero-disagreement judge.
Method
Agreement interval computed at the observed sample size.
Oracle
The GSM8K answer key.
Negative control
Not applicable The result is that the interval is degenerate; there is nothing for a control to distinguish.
Denominator
0 disagreements in 45; interval spans the whole range.
Limitation
That the ensemble judge is reliable. A degenerate interval at the endpoints cannot express uncertainty, and at larger scale even ensemble judges are imperfect.
Source
repowazdogz-droid/evaltrust @ 18e999a5 archived
Repository archived 2 September 2026 after a dated correction to its second experiment. The numbers cited here are from the first experiment and are not affected by the correction, which withdraws a vendor-level interpretation of a separate contrast. Read the correction.
Reproduce
python scripts/build_report.py && python scripts/recompute.py && pytest -q
Independent reproduction
None known.

This finding on its own page

MEASURED judges-disagree-in-opposite-directionsverify Two off-the-shelf AI graders scoring the same work were wrong in opposite directions.
Claim
Two language-model judges scoring the same 45 GSM8K answers disagreed with the ground truth in opposite directions: one systematically too strict, the other too lenient.
Status
MEASURED Empirical, with a stated sample.
Question
Passed is not correct
Subject
Two off-the-shelf language-model judges scoring 45 real GSM8K trajectories (existing models). third-party subject
Frame
45 answers; per-answer labels are assistant-adjudicated; two of three judges also generated answers.
Method
Five graders score the same trajectories; every number recomputes from committed data under a digest check.
Oracle
The GSM8K integer answer key.
Negative control
None No control is claimed for this measurement; the sample is small and the labels are an authored scheme.
Denominator
gemma3 disagreed on 4 of 45, all too strict; llama3 on 2 of 45, all too lenient.
Limitation
That either judge is reliable, or that the direction generalises beyond this corpus. The sample is small; the per-answer correctness labels are assistant-adjudicated, not human; and two of the three judges also generated answers in the set, so self-preference is uncorrected.
Source
repowazdogz-droid/evaltrust @ 18e999a5 archived
Repository archived 2 September 2026 after a dated correction to its second experiment. The numbers cited here are from the first experiment and are not affected by the correction, which withdraws a vendor-level interpretation of a separate contrast. Read the correction.
Reproduce
python scripts/build_report.py && python scripts/recompute.py && pytest -q
Independent reproduction
None known.

This finding on its own page

MEASURED monitoring-arm-recorded-preventions-that-executedobserve · observation boundary A dashboard reported 1,026 actions prevented. All 1,026 had already executed.
Claim
Over 10,000 injected events, a monitoring arm recorded 1,026 actions as prevented and all 1,026 executed; an in-series arm consuming the same events, evaluator and policy recorded 6 of 9,880.
Status
MEASURED Empirical, with a stated sample.
Question
Recorded is not observed
Subject
A synthetic, deterministic fault-injected pipeline on Redis Streams (authored). built for the study
Frame
10,000 injected events, fail-closed policy; both arms consume identical events, evaluator and policy and differ only in position.
Method
Two arms, one on the execution path and one observing beside it; a second axis varies single-writer versus two-writer telemetry.
Oracle
The executed-action log, written by a second writer that the monitor does not control.
Negative control
Present Nine negative controls in the repository; CI deletes the committed results and regenerates them.
Denominator
1,026 recorded as prevented, 1,026 executed; in-series arm 6 of 9,880; intervention recall 0 of 818 versus 697 of 818.
Limitation
A property of one synthetic, deterministic testbed under injected faults, not a measurement of any deployed safeguards product and not a rate that transfers outside this harness. The agent environment is deliberately trivial so that what is measured is the pipeline rather than model behaviour.
Source
repowazdogz-droid/safeguards-control-plane @ 08e52549
Reproduce
./demo.sh && make experiments
Independent reproduction
None known.

This finding on its own page

PROVEN tamper-of-a-sealed-record-forces-a-collisionreplay Changing a sealed record after the fact is provably as hard as breaking the hash it is sealed with.
Claim
Tampering with a sealed, hash-linked decision record forces a hash collision: the canonical encoding is injective, the chain is append-only, and detection follows in Lean without a collision-resistance axiom.
Status
PROVEN Follows from stated premises inside a named frame.
Question
Replayable is not independently established
Subject
A Lean 4 model of the OMEGA record chain (model). built for the study
Frame
Opaque hash; collision-resistance as a discharged hypothesis, not an axiom.
Method
Injective canonical encoding, append-only chain, detection theorem.
Oracle
The Lean 4 kernel; #print axioms reports 0 user axioms.
Negative control
Present The axiom probe is committed; a browser recompute of the content hash goes red on a one-byte change.
Limitation
That the opaque hash function is SHA-256, that the recorded decision was correct, or that the formal definitions match the prose specification. It is tamper-evidence at the model level, not a claim about any deployed system.
Source
repowazdogz-droid/omega-lean-proof @ 2fab5d1
Reproduce
git clone https://github.com/repowazdogz-droid/omega-lean-proof && cd omega-lean-proof && lake build && lake env lean probes/AxiomProbe.lean
Independent reproduction
None known.

This finding on its own page

OBSERVED tools-hidden-from-discovery-remain-callableexecute · observation boundary Tools removed from the list an agent is shown were still there to call by name.
Claim
In a server built to exhibit the bug, tools filtered from the discovery listing remained reachable through the call surface: a presentation-layer authorization control with no execution-layer enforcement behind it.
Status
OBSERVED Witnessed in one instance. No claim about how often.
Question
Authorised is not executed
Subject
A mock MCP server built to exhibit the bug (authored). built for the study
Frame
stdio transport only; no HTTP, prompt injection or token scope.
Method
Read the advertised tool list, then probe whether un-advertised tools are still callable; an unrecognised denial reads as inconclusive.
Oracle
The call surface: whether tools/call succeeds for a tool absent from tools/list.
Negative control
Present The patched server passes; the vulnerable server fails with exit 1.
Denominator
1 of 3 tools listed, 3 of 3 reachable, on the mock.
Limitation
This is a demonstration against an authored mock, not a measurement of real servers. It does not test HTTP transport, prompt injection, or token scope, and a passing result does not mean a server is secure.
Source
repowazdogz-droid/mcp-boundary-audit @ d932934f
Reproduce
pip install -e '.[dev]' && cd examples && mcp-boundary-audit --config vulnerable_server.config.json --execute --i-own-this-server
Independent reproduction
None known.

This finding on its own page

MEASURED training-run-rederives-bit-for-bitreplay A training run re-derives its exact result from its recorded inputs on one machine. Across different hardware it stays unknown.
Claim
A training run's final loss and trajectory re-derive bit-for-bit from its recorded inputs on one machine; cross-hardware re-derivation is left as UNKNOWN, and not claimed.
Status
MEASURED Empirical, with a stated sample.
Question
Replayable is not independently established
Subject
A small training run and its verifier, on one machine (authored). built for the study
Frame
Python 3.14.4, NumPy 2.4.4 on Apple Accelerate; cross-hardware untested.
Method
The verifier re-runs training from the recorded configuration and compares the trajectory and final loss bit-for-bit.
Oracle
The recorded final loss and trajectory fingerprint, recomputed rather than rechecked.
Negative control
Present A 12-case suite triggers each verdict state (VERIFIED, TAMPERED, UNKNOWN) with a real tamper.
Denominator
12 of 12 controls; one machine.
Limitation
Bit-for-bit reproducibility on other hardware, which is untested and reported UNKNOWN rather than upgraded. It does not establish code correctness, buggy-but-faithful code still verifies, nor result quality nor accountability.
Source
repowazdogz-droid/nanogpt-provenance @ 732da8b1
Reproduce
./run_all.sh
Independent reproduction
None known.

This finding on its own page

MEASURED commons-compliant-collective-breachauthorise · expressibility Blind to the pool, the budget was breached in 60 of 60 episodes on each of three models with no agent over its own allowance. With the pool state shown the budget was still breached on every model, at rates that differ by model; the per-cell counts, including episodes where an agent exceeded its own allowance, are in the table on the collective-bound page.
Claim
In a shared-budget environment where each agent's allowance is individually satisfiable but the allowances sum to 1.5 times the collective budget, three language models produced a compliant collective breach in 60 of 60 BLIND episodes each (two population sizes, 30 episodes per cell), with zero individual allowance violations; one appended sentence restating the same headroom took the rate to 4 of 60, 2 of 60 and 0 of 60.
Status
MEASURED Empirical, with a stated sample.
Question
Individually compliant is not collectively safe
Subject
Three hosted language models (gpt-5-mini, gpt-4.1-mini, gemini-2.5-flash) acting as agents in a synthetic one-round shared-budget environment (existing models, authored environment). third-party subject
Frame
Collective budget 100; N in {3, 6}; UNSOUND regime cap = ceil(1.5 × 100 / N); 30 episodes per cell fixed before any data; Wilson 95% intervals.
Method
Pre-registered factorial over regime, population size and an information ladder over identical tasks; four amendments each registered before their data; every outcome computed from the environment ledger, never from model text.
Oracle
The environment's own ledger of draws. A stub model whose prose claims it drew nothing while its action draws the full allowance is scored on the action, and that test fails the build if it stops doing so.
Negative control
Present Seven pre-committed controls: an impossible-breach cell that must read 0 of 60 and a forced-breach cell that must read 60 of 60 (both did), an equal-share baseline, an allowance-response check, a benign cell supplying the guardrail's second denominator, a scorer-independence test and five runtime invariant monitors.
Denominator
60 of 60 per model = UNSOUND_N3_BLIND 30 of 30 plus UNSOUND_N6_BLIND 30 of 30. The per-cell table is on the collective-bound page.
Preregistration
Registration commit 3bf280e (2026-08-22) precedes the first model call; amendments 01 to 04 each precede their data; departures in DEVIATIONS.md.
Limitation
A rate here is a fact about a dataset, a prompt and a model on one day, not a capability of a model family or of language-model agents in general. The environment is synthetic and one round deep. Three developers, not four; the guardrail judge shares a vendor with two of the agent arms. No mechanistic claim is made about why the phrasing matters.
Source
repowazdogz-droid/commons-agent-lab @ de3f89d
Reproduce
python3 -m pytest tests -q && python3 -m commons.report _canonical/gpt-5-mini _canonical/gpt-4.1-mini _canonical/gemini-2.5-flash
Independent reproduction
None known.

This finding on its own page

MEASURED judge-passed-checker-proved-violationverify · self certification A language-model judge scored 8 out of 10 on decisions that a solver proved violated the encoded policy.
Claim
In the complete rerun, six single-decision cases violated an encoded governance property. The language-model judge passed 4 of the 6 across three seeds each; the formal checker proved the violation in 6 of 6, and both verdicts are sealed in the same record.
Status
MEASURED Empirical, with a stated sample.
Question
Passed is not correct
Subject
An evaluation harness for governed agent decisions built for the study (authored), with a local 14B judge. built for the study
Frame
Sixteen sealed records from one rerun (2026-07-20); six violating single-decision cases; three judge seeds per case.
Method
Each checkable property is routed to the checker whose logic fits it (Z3 for one decision, Lean 4 for a trace, TLA+ for interleavings, CryptoVerif for authorisation) and the judge's score is sealed beside the proof so the two can be compared.
Oracle
The formal checker's verdict against the encoded property; CI checks the headline counts (6 violating cases, judge passed 4, checker proved 6).
Negative control
Present Six non-violating rows in the same run where judge and checker agree, so the split is not the judge failing everything; planted-adversarial and model-authored decision sources are reported separately.
Denominator
4 of 6 violating decisions passed by the judge; 6 of 6 proven violated by the checker; 3 seeds each.
Limitation
The judge is qwen2.5-coder:14b, a local model, not a frontier judge, and on model-authored rows it grades its own output. A stronger judge may do better; that is unmeasured. The harness depends on two packages that are not yet published on their own, vendored with provenance. Six cases is a demonstration of the split, not a rate.
Source
repowazdogz-droid/proof-carrying-evals @ f22def1
Reproduce
python3 scripts/verify_records.py
Independent reproduction
None known.

This finding on its own page

OBSERVED spcu-defects-passed-every-propertyverify · faithfulness Two injected hardware defects passed every property written from the original specification, because the specification never stated the requirement they break.
Claim
Five defects were injected into a small power-control design whose formal verification argument was complete and green. Two of them passed every property derived from the original specification: one because the specification required voltage to be sufficient and never minimal, one because a two-step transition is internally consistent. A third escaped every property about the design's own variables while recording something false about the physical world.
Status
OBSERVED Witnessed in one instance. No claim about how often.
Question
The specification proved is not the property intended
Subject
A small DVFS power-control IP written for the study (authored), verified with open tools. built for the study
Frame
26 requirement-derived assertions; PDR unbounded proofs on a collapsed-clock model with four environment assumptions; clock-crossing checks bounded at depth 20; 2 assertions vacuous; 3 rest on a further stated assumption.
Method
Formal (SymbiYosys), Verilator simulation, a pyuvm testbench and bare-metal C against the RTL; five hand-injected defects, then 200 netlist mutations checked against the property set and an equivalence miter.
Oracle
The property set itself, then a mutation harness that asks which mutants any property can see; an equivalence miter separates no-op mutants.
Negative control
Present The 200-mutant mcy run: 84 covered, 23 equivalent, 93 in the gap. Vacuous assertions are kept and excluded from every claim.
Denominator
2 of 5 injected defects passed every specification-derived property; 26 assertions, 2 vacuous; 200 mutants, 93 unseen.
Limitation
A claim about this ~450-line design and this property set only. The five mutations were written by the same person who wrote the properties; a 200-mutant Yosys run was added for that reason and showed the hand-written mutations had probed the wrong part of the design. Nothing here is a statement about any commercial verification flow.
Source
repowazdogz-droid/spcu-verification @ e49a0c5
Reproduce
make setup && make all
Independent reproduction
None known.

This finding on its own page

OBSERVED verifier-green-run-could-not-failverify · coverage illusion Three green verification runs could not have failed: an unreached assertion, a model checker that instrumented nothing, and an axiom audit identical for correct and wrong models.
Claim
A Kani harness left its second assertion UNREACHABLE after the first injected bug, so its pass carried no information; a loom test reported 1 passed on a build containing a lost update because the atomic was never loom-instrumented, with byte-identical output for the clean and broken builds; and two Lean models of the same Rust function, one pinning real sizes and one returning 0 for every type, produced byte-identical axiom audits.
Status
OBSERVED Witnessed in one instance. No claim about how often.
Question
Passed is not correct
Subject
Recorded verification outputs from Kani, loom and cargo test on the governor and jsonwebtoken crates (third-party code, injected defects), and two Lean models of a kernel Rust parser. third-party subject
Frame
Three case studies with inputs, patches, outputs and reproduction commands committed; Lean audit compared by sha256.
Method
A grader that extracts what a run actually explored (reachability, instrumented interleaving counts, value lemmas) and grades on that rather than on the printed verdict.
Oracle
What distinguishes the runs when the verdicts do not: an execution count (9 uninstrumented against 54 instrumented interleavings), an UNREACHABLE status, and value lemmas proved by rfl that fail on the wrong model.
Negative control
Present One control was mistaken for two until a second, independent Kani bug was built; the loom clean and broken runs are both committed so the byte-identity is checkable.
Denominator
3 catches, each with committed inputs and outputs; 9 versus 54 interleavings; 0 bytes of difference in the two axiom audits.
Limitation
No defect in governor or jsonwebtoken is claimed; the crates are subjects for the recorded-output grader, and the bugs were injected. The grader reads recorded outputs and runs no verifier itself. Version 0.1.
Source
repowazdogz-droid/evidence-audit @ 996d248
Reproduce
pip install -e . && python3 -m pytest tests/ -q
Independent reproduction
None known.

This finding on its own page

PROVEN sum-rule-holds-where-per-agent-cap-failsauthorise · expressibility Six agents each inside a cap of 10 breach a pool of 40; a single rule on the sum removes every such breach, while a harm equal to one agent's draw (threshold 15, below the pool) escapes it and a per-recipient cap closes it.
Claim
In a closed-data Lean 4 model (cap 10, budget 40, six agents) the per-agent-compliant profile [10,10,10,10,10,10] breaches the budget and the conserved meter accepts no breaching profile while still accepting a within-budget one, with no axioms. In a Z3 linear-integer model of the same instance, eleven queries establish that the sum rule holds for every coordinated profile, does not bound a harm equal to one agent's draw when its threshold (15) is below the pool (allocation harm escapes with witness [0,0,16,0,0,0]; a per-recipient cap closes it), and is blind to any coordination channel in the model. This is a contrast between two chosen harms; an earlier statement that the rule bounds a harm if and only if the harm factors through the aggregate is withdrawn, because it fails in both directions in the same encoding.
Status
PROVEN Follows from stated premises inside a named frame.
Question
Individually compliant is not collectively safe
Subject
A Lean 4 model and a Z3 model of a six-agent shared pool (model). built for the study
Frame
N = 6, cap 10, pool 40, allocation threshold 15; one round, integer draws, joint worst-case coordination; Lean over closed data, Z3 over a linear-integer encoding.
Method
Kernel-checked instance of a general witness/repair law in Lean; SAT/UNSAT queries with witnesses in Z3, sealed as hash-chained records; a seeded learning adversary run for 180,000 episodes as corroboration and three hand-built relaxations run to their predicted breach magnitudes.
Oracle
The Lean 4.30.0 kernel (#print axioms: none) and z3 4.16.0; the sealed records regenerate byte for byte.
Negative control
Present Three Z3 mutations (cap 6, h 40, G 5) each flip the named verdict; raising the Lean budget to 60 breaks the build.
Preregistration
None. The companion empirical study (commons-agent-lab) was preregistered; this formal work was not.
Limitation
Anything about a deployed multi-agent system. The Lean results are over closed data; the Z3 results are verdicts over an encoding whose faithfulness to the informal model is not machine-checked. The per-agent cap is not shown to be unfixable: a local allowance of floor(G/N) is collectively safe when population and utilisation are known and fixed. The channel-blindness result takes perfectly secure steganography as an assumption, not a construction. Not preregistered.
Source
repowazdogz-droid/collective-bound @ public commit of 2026-09-02
Reproduce
make lean axioms z3 controls # and make rl for the learning adversary, about 90 s
Independent reproduction
None known. Author self-reproduction from the public artifact on 2026-09-02, byte for byte.

This finding on its own page

OBSERVED truncated-module-passed-its-testsverify · coverage illusion A local language-model worker emptied a 415-line module to two lines. The repository’s 24 tests still passed. An independent syntax-tree gate, in series before any merge, rejected the patch.
Claim
On one of ten real single-file lint tasks, a locally hosted worker model returned a patch that reduced a 415-line Python module to two lines. The repository’s 24 tests passed unchanged on that patch, so no test depended on the module. A gate that requires the patched module’s syntax tree to equal the pristine tree, imports aside, rejected it. Across the ten tasks the gate accepted 4 and rejected 6; every accepted patch re-verified on a second machine.
Status
OBSERVED Witnessed in one instance. No claim about how often.
Question
Passed is not correct
Subject
A locally hosted 27-billion-parameter open-weight model (Qwen3.6-27B, 4-bit) acting as a maintenance worker on ten real single-file lint tasks in the author’s own Python repositories; the gate is Omega’s. third-party subject
Frame
Ten tasks, one worker model, one day (3 September 2026), two prompt arms with the same gate; the ten repositories are the author’s, not third-party code.
Method
Every patch passes through an in-series gate before it can be accepted: the checker must be red before and green after, tests and compilation must pass, one file may change, no suppression comment may appear, and the patched module’s syntax tree must equal the pristine tree once import statements are removed, with imports dropped only where the linter had already flagged them unused. The worker’s own report of success is never consulted.
Oracle
Equality of the parsed syntax trees of the patched and pristine files, plus a second comparison on a different machine for every accepted patch.
Negative control
Present Before any worker run the gate was shown eleven known cases: two known-good patches and a pristine-against-pristine comparison it had to accept, and eight known-bad patches it had to reject, including a planted removal of an import still in use and a patch with one boolean flipped. 11 of 11 went the expected way.
Denominator
1 of 10 tasks produced the truncation; 24 of 24 tests passed on it; gate proof 11 of 11 before the run; 4 of 10 patches accepted, 0 accepted patches failed re-verification.
Preregistration
Design, gate, predictions and stopping rule frozen at 17:42 UTC on 3 September 2026 before any worker run (preregistration sha256 aeab4c53, gate sha256 77223c8e). The prediction that the worker would reproduce its earlier patches was falsified: only one of ten diffs matched.
Limitation
One worker model on ten files from the author’s own repositories on one day; no rate for any model family and nothing about deployed systems. The gate certifies syntactic equivalence, not correctness: removing an unused import that had an import-time side effect would pass it. The lint checker’s own reading of the truncated file was recorded green in one arm and red in the other on the identical patch, so the checker verdict is not relied on here; the test result is. The record is not public, and independent reproduction is none.
Source
artifact not public
Reproduce
not reproducible from a public clone
Independent reproduction
None known.

This finding on its own page

OBSERVED ecc-decoder-syndrome-output-never-drivenverify · coverage illusion An error-correcting decoder in an open hardware library declared a syndrome output that nothing drove. A cover requirement added while proving the encoder and decoder pair found it; the one-line fix and the proof were reviewed and merged by the maintainer.
Claim
In pulp-platform common_cells, cc_ecc_decode declared an output syndrome_o and never assigned it. The library had no proof or testbench for the encoder and decoder pair, so nothing exercised the port. While adding a SymbiYosys proof of the four properties documented in the decoder header, a cover requirement on syndrome_o showed the output was undriven; Verilator's lint reports the same. A one-line assignment fixed it, the proof and a width sweep to 64 bits passed with the fix, and the maintainer reviewed and merged the change on 3 September 2026.
Status
OBSERVED Witnessed in one instance. No claim about how often.
Question
Passed is not correct
Subject
pulp-platform common_cells, an open hardware IP library (third-party system); the proof harness is Omega's. third-party subject
Frame
Combinational encoder and decoder pair; prove and cover tasks under SymbiYosys with abc pdr; widths 1, 2, 4, 5, 11 and 12 by default.
Method
Four documented properties transcribed from the decoder header into assertions. One encoder feeds four decoders, each seeing a different corruption, so no case can weaken another. A cover task runs alongside the proof so a property resting on an unsatisfiable assumption cannot pass silently. Coverage of the syndrome output was added at the maintainer's request, and that is where the undriven output showed.
Oracle
The cover task: a documented syndrome value that cannot be reached is reported rather than passed. Verilator's undriven-signal lint agrees.
Negative control
Present An earlier version of the harness shared the error-position inputs across widths, which let one width's constraint narrow another's reachable positions while the proof stayed green. The cover task caught it, which is why it runs by default rather than on request.
Denominator
1 undriven output; 4 properties at 6 default widths; 128 properties to width 64 in the sweep; 6 files changed in the merged pull request.
Limitation
One undriven output in one module of one library. The proof covers the pair at widths 1, 2, 4, 5, 11 and 12 by default and 128 properties up to width 64 in a sweep; it says nothing about the data output under a double error, nothing beyond two flipped bits, and nothing about other modules. The proof needs SymbiYosys, Yosys and abc; it was run by the author before and after the fix and reported in the pull request, and has not been re-run for this record. Maintainer acceptance is review of one change, not endorsement of Omega. The fix is on the default branch and in no tagged release as of 20 September 2026.
Source
pulp-platform/common_cells @ a257b714
Reproduce
cd formal && make ecc.check
Independent reproduction
None known. The maintainer's review is a review of the change, not a reproduction of the run.
Upstream
MERGED UPSTREAM Pull request #355, reviewed and merged by the maintainer on 3 September 2026. Link

This finding on its own page

OBSERVED pybamm-basicdfn-variable-transference-driftverify · faithfulness A battery model ran to completion on every revision tested and gained 2.4% of its lithium. Independent inventory accounting localised the gain to one equation, and a project contributor confirmed the missing term.
Claim
In PyBaMM's BasicDFN with a concentration-dependent transference number, an independently assembled lithium inventory drifted by 2.44% of the initial inventory over the reporter's 4,800-second protocol on v26.4.1, main at 258fdc8 and the head of pull request #5524, byte-identical between main and the pull request; the drift persisted under temporal tightening to 1e-10 and spatial refinement to 80 cells, and matched, instant by instant, the rate predicted from the missing transference-gradient term. The constant-transference control conserved to 7.7e-15 mol.
Status
OBSERVED Witnessed in one instance. No claim about how often.
Question
Passed is not correct
Subject
PyBaMM, an open-source battery modelling library (third-party system); the inventory code and the referee are Omega's. third-party subject
Frame
The two one-dimensional cases from issue #5700; three pinned revisions; seven mesh and tolerance settings; 84 frozen jobs.
Method
Lithium inventory assembled from the mesh, the parameters and the raw concentrations, never from the library's own totals; a second explicit-loop implementation checked against the vectorised one on every run; a refinement sweep; the instantaneous rate of drift compared with the rate the equation predicts.
Oracle
Conservation of lithium: the physical inventory computed independently of the library's diagnostics, checked against its own initial value.
Negative control
Present The constant-transference BasicDFN and the full modular DFN, run under the same harness, conserved to 7.7e-15 and 3.5e-14 mol; analytic referee mutations (an altered inventory, a reversed boundary sign, an omitted source, a wrong volume factor) were each detected before and after the runs.
Denominator
2.44e-2 relative drift at 20 cells, 20 shells, 1e-8; 73 of 84 frozen jobs completed; main and the pull request byte-identical on all 24 completed pairs.
Limitation
One model in one library under one protocol and one parameter set. Nothing against PyBaMM's full DFN, whose control conserved to 3.5e-14 mol, and nothing about the finite-volume discretisation of nonlinear source terms, which a contributor raised and which was not investigated. Eleven of 84 half-cell jobs failed inside the solver at tight tolerance, so no half-cell spatial convergence order is claimed. No physical battery was measured. The #5745 fix is on the default branch but not in a tagged release; #5746 remains open.
Source
repowazdogz-droid/pybamm-5700-lithium-inventory @ adaa877
Reproduce
PYBAMM_DISABLE_TELEMETRY=true python minimal_reproducer.py --output reviewer-output
Independent reproduction
None known.
Upstream
REPORTED UPSTREAM Issue #5745 was closed after Warren's pull request #5747 was approved and merged on 18 September 2026. The fix is on the default branch and in no tagged release as of 20 September 2026. Link

This finding on its own page

MEASURED pyscf-df-ccsd-gradient-matches-finite-differencesverify · hidden trusted base A proposed analytic gradient for a quantum-chemistry method matched independently computed finite differences in 22 of 22 cells; the released code path failed in 22 of 22. One of the referee's own thresholds fired on both arms alike and was reported as an instrument defect.
Claim
PySCF pull request #3426 (density-fitted CCSD and CCSD(T) analytic nuclear gradients) agrees with central finite differences of PySCF's own density-fitted energy to at most 2.5e-7 Ha/Bohr on 11 molecules for both methods, indistinguishable from the conventional-integral floor; the release code path differs by 8.9e-6 to 1.3e-4 Ha/Bohr on every cell; disabling auxiliary-basis response breaks translational invariance by 5e-5 to 1.1e-3. A pre-registered rotational-invariance threshold of 1e-8 fired on both the pull request and the established path to within 1%, and was recorded as an instrument defect, not a defect in the pull request.
Status
MEASURED Empirical, with a stated sample.
Question
Passed is not correct
Subject
PySCF, an open-source quantum chemistry library, and pull request #3426, merged on 14 September 2026 (third-party system); the finite-difference referee is Omega's and its evidence was not posted upstream. third-party subject
Frame
11 molecules, CCSD and CCSD(T), 77 jobs; three finite-difference steps Richardson-combined; the pull-request environment is the 2.14.0 wheel plus the pull request's diff.
Method
Three invariants pre-registered with thresholds (finite-difference agreement, translational invariance, rotational invariance); four arms (pull request, release path, pull request without auxiliary response, conventional floor); the referee recomputes every gradient from raw energies with explicit loops and no library import.
Oracle
Central finite differences of the density-fitted energy, with the second-order step ratio checked in every cell.
Negative control
Present The release path had to fail agreement (22 of 22 did); the no-auxiliary-response arm had to break the sum rules (22 of 22 did); a 5e-6 perturbation had to be detected (11 of 11 was); the two environments had to give identical reference energies (11 of 11 did).
Denominator
22 of 22 cells agree to 2.5e-7 Ha/Bohr or better; 22 of 22 release-path cells fail; 11 molecules; 77 jobs.
Preregistration
Design, cells, thresholds and controls frozen before any trial; one driver defect before the first trial and the post-falsifier exploratory runs logged as deviations and kept out of every table.
Limitation
Agreement on 11 molecules establishes agreement on those 11 molecules. Not tested: open-shell references, periodic systems, symmetry-adapted molecules, systems larger than six atoms, auxiliary bases beyond the two used, or the geometry-optimiser path. The finite-difference referee differentiates the same energy code the pull request differentiates, so it establishes consistency with that code, not agreement with an external truth. The origin of the shared 1e-7 rotational residual is not identified. The evidence has not been posted to the pull request; this is an internal Omega record.
Source
artifact not public
Reproduce
not reproducible from a public clone
Independent reproduction
None known.

This finding on its own page

OBSERVED torchdynamo-compiled-result-stale-under-instance-changeverify · hidden trusted base A compiled PyTorch function returned a result computed for a different object state, with no recompilation, where the uncompiled function returned the right one. The investigation was carried out by a locally hosted model with nothing leaving the machine.
Claim
On a frozen reproduction of PyTorch issue #196127, torch.compile constant-folded an isinstance check against a runtime-checkable data-member Protocol without guarding the attribute it read, so a compiled function reused its cached result after an object gained an instance attribute, and gave the same stale answer for two instances of one class that differed in that attribute, while eager execution was correct in both. A frozen evaluator that recomputed eager and compiled results itself confirmed both per-instance cases and two controls, and a hidden seven-cell matrix re-run after the run confirmed the phenomenon. The investigating worker was a locally hosted 27-billion-parameter open-weight model at temperature 0 with no network access and no human or frontier-model message during the run.
Status
OBSERVED Witnessed in one instance. No claim about how often.
Question
Passed is not correct
Subject
PyTorch's TorchDynamo compiler on a frozen reproduction of open issue #196127 (third-party system); the harness, evaluator and controls are Omega's. third-party subject
Frame
One pinned PyTorch build; one frozen task; one local worker run at temperature 0, 48 of 100 turns used; a hidden seven-cell matrix withheld from the worker.
Method
The worker constructs cases and an eager-versus-compiled oracle; a frozen evaluator recomputes eager, compiled and the recompilation counter for every submitted case and classifies the driver of any divergence; design and evidence sealed by hash before inference and re-verified after.
Oracle
Eager execution of the same function on the same inputs, recomputed by the evaluator, never taken from the worker's report.
Negative control
Present Two control cases that must not diverge did not; the hidden matrix's class-mutation cell had to be rejected by the evaluator and was; 0 hidden-matrix tokens appeared in the worker's trajectory; both seals re-verified after the run.
Denominator
2 evaluator-confirmed per-instance stale cases and 2 correct controls in the scored run; 7 of 7 hidden-matrix cells behaved as frozen; containment 47 of 47 checks.
Preregistration
Task, evaluator, hidden matrix and success bar frozen and hashed before inference; the bar was tightened from an earlier run before, not after, this one.
Limitation
One issue, one pinned build, one run. Nothing about the inductor backend, unions, method-bearing protocols, larger programs or the second scored call order. The upstream issue was already open and is not Omega's discovery; nothing was posted to it and no fix was proposed. The worker's own directional claim about which call order recompiles is unscored, conflicts with the hidden matrix, and is not evidence; its empty list of untested dimensions overstates completeness. No root cause was verified in the compiler's source. The result is a fact about this task, not a general capability of the local model.
Source
artifact not public
Reproduce
not reproducible from a public clone
Independent reproduction
None known.

This finding on its own page

OBSERVED unreal-validator-never-read-instantiated-geometryobserve · observation boundary A convincing-looking Unreal validator was rejected because it reconstructed transforms from the source CSV instead of observing instantiated geometry. Three planted geometry corruptions left its result byte-identical.
Claim
The D495 V0 validation path could not establish correspondence between source values and instantiated Unreal geometry: its transform check calculated both the placed value and the inverse from the same CSV-derived row, and its runtime relocation path continued to iterate source rows without geometry readback. In a 4,225-sample regression fixture, three post-ingestion geometry corruptions changed the independent witness by up to 4.5 metres, 44 metres and 5 metres while the D495-style check continued to report zero error and produced byte-identical output.
Status
OBSERVED Witnessed in one instance. No claim about how often.
Question
Passed is not correct
Subject
An internal D495 Unreal validation workflow and a local regression fixture; the qualifier, planted corruptions and independent readback witness are Omega's. built for the study
Frame
One 4,225-sample fixture reconstructed from the D495 dependency pattern; one clean control and three post-ingestion corruptions: scale x1.1, a 400-vertex zeroed patch and a +5 metre shift; seven authored instrument-dependency cases in the qualifier prototype.
Method
Trace each claimed comparison to the source of both operands, then mutate the claimed subject after ingestion while keeping the source unchanged. Compare the original validator output with a witness that reads the instantiated geometry rather than reconstructing it.
Oracle
Direct readback of the mutated instantiated coordinates in the regression fixture, compared with the frozen source coordinates. The original validator's own transform and inverse are not used as the oracle.
Negative control
Present Three planted geometry corruptions had to be detected by the readback witness and missed by the source-derived check; the clean control had to remain at zero. The witness reported maximum errors of 4.5 metres, 44 metres and 5 metres, while the invalid check remained at zero and byte-identical.
Denominator
One clean control and three planted corruptions over one 4,225-sample fixture; seven authored dependency-graph cases in Instrument Qualifier v0.
Preregistration
None. This was an instrument audit and local regression investigation, not a preregistered experiment.
Limitation
This does not show that the original Unreal scene was geometrically wrong, and no repaired Unreal validator was built or run against the scene. The regression fixture reproduces the data dependency locally; it is not an independent reproduction in Unreal. Instrument Qualifier v0 used seven authored dependency graphs, so its recall on real validators is unknown and no general qualification capability is claimed.
Source
artifact not public
Reproduce
not reproducible from a public clone
Independent reproduction
None known.

This finding on its own page

OBSERVED pandapower-unsupported-vector-groups-return-convergedverify · coverage illusion A three-phase power-flow solver reported convergence for four transformer types it does not support, returning bus voltages near a million per unit with no warning. Ten other unsupported types were correctly rejected.
Claim
In pandapower develop at fd7346f, runpp_3ph on the network from closed issue #1041 returned converged=True with no warning for the vector groups Dy, Yy, Yd and Dd, with identical non-physical results (about 994,686 per unit on the 0.4 kV buses, 714% transformer loading, a 10.9 MW power-balance residual against a 0.1 MW load), because zero-sequence modelling is skipped for those four strings before the gate that rejects the other ten unsupported groups. All 18 cells matched their pre-registered prediction.
Status
OBSERVED Witnessed in one instance. No claim about how often.
Question
Passed is not correct
Subject
pandapower, an open-source power-system analysis library (third-party system); the classifier and the sanity bands are Omega's. third-party subject
Frame
The #1041 network verbatim; 18 two-winding vector-group strings from the source, the docs and the shipped standard types; shift_degree 0; each cell in its own process.
Method
Each string classified as documented-supported or unsupported before the run, with a predicted outcome per cell frozen in a pre-registration; the run compared against the prediction; the source tree diffed against the pinned archive after the run.
Oracle
Five authored sanity bands on converged results: finite values, low-voltage magnitudes in 0.9 to 1.1 per unit, external-grid power in band, power balance under 1e-3 MW, transformer loading under 100%.
Negative control
Present The supported Dyn group as a positive control and the known-silent Dy group as a negative control both reproduced earlier runs the same day to the digit; no environment drift.
Denominator
18 of 18 cells matched their frozen prediction; 4 of 14 unsupported groups returned converged=True; 10 of 14 raised; 0 failed to converge.
Preregistration
PREREG-VECTOR-GROUP-BOUNDARY, hashed before execution and unchanged after; no deviations.
Limitation
One network, one load, zero phase shift, one commit. The four silent strings map to one model, so they are one observation, not four. No independent oracle was used for the supported groups, so plausible is the ceiling of what is said about them. Whether the zero-sequence skip is intended for another calculation path is upstream's call. The issue is open and unanswered; nothing has been fixed.
Source
artifact not public
Reproduce
not reproducible from a public clone
Independent reproduction
None known.
Upstream
REPORTED UPSTREAM Issue #3122, opened 6 September 2026; no maintainer response as of 20 September 2026. Link

This finding on its own page

§ 7.2

Open questions

Questions posed and not answered, listed at full weight because a residual that is hard to read is a residual that gets forgotten. These are the eight from the worked case; the collective-bound exhibit carries its own.

A12

A hostile actor running as the same user

An actor who can run code as this user edits the target directly and needs no permit at all; equally, they can append a well-formed start permit to the ledger. The successor does not create an unforgeable token.

Explicitly out of scope. Not weakened or strengthened by the repair.

OPEN
CRASH-WINDOW

At-most-once is argued, not demonstrated

No process has been killed between the consumption commit and the write. The ordering argument is sound and untested.

It is the cheapest remaining test and it has not been run. A scheduled consumer runs unattended, which is exactly the regime where a killed process matters.

OPEN
A-LOCK

The file lock is advisory

Every writer must use the ledger transaction. That is convention, not enforcement.

A writer that ignores the lock defeats the at-most-once guarantee. The auditor detects the resulting sequence disagreement after the fact; it does not prevent it.

OPEN
A-CLOCK

Freshness depends on the system clock

A moved clock moves the time-to-live window.

Carried as an assumption in the trusted base, named there rather than tested.

OPEN
A-FS

Filesystem atomicity and durability are assumed

Atomic replace and durable flush are assumed, not tested.

A crash must leave the original intact. That property rests on the platform and is carried as an assumption.

OPEN
NO-LIVE-DEMO

No live eligible-condition demonstration

The successor has never executed anything outside a sandbox.

Manufacturing a live eligible condition means deliberately corrupting a real scheduled job. Not done, not worked around.

OPEN
N-4

A latent defect left unrepaired by design

The sequence double-count in the frozen ledger transaction is measured, understood and deliberately not fixed.

Editing it would break the freeze that makes the predecessor citable evidence. The successor refuses on detecting it instead.

OPEN
ONE-TRANSFORM

One transform is in the closed table

Nothing establishes that the property generalises to a transform that is not idempotent and not byte-derivable from a backup.

The bound is real and it is narrow. The narrowness is the finding, not a caveat on it.

OPEN
§ 7.3

Artifacts

19 repositories, each with what it establishes, what it does not, what has to be trusted, and the command that reproduces it.

PROVEN

capctl-iris

A concurrent capability bound holds over every interleaving, machine-checked with no axioms.

repowazdogz-droid/capctl-iris
doi 10.5281/zenodo.21505165
PROVEN

compositional-temporal-safety

A compositional safety invariant holds for all finite N, machine-checked.

repowazdogz-droid/compositional-temporal-safety
PROVEN

escrow-budget-mpst

The transfer session is deadlock-free and crash-safe by typing; the budget bound is not expressible in it.

repowazdogz-droid/escrow-budget-mpst
PROVEN

escrow-budget

A budget bound (spend within cap) holds for all reachable states, machine-checked.

repowazdogz-droid/escrow-budget
MEASURED

evaltrust

Two off-the-shelf LLM judges fail in opposite directions; a zero-disagreement judge's agreement interval is degenerate.

repowazdogz-droid/evaltrust
archived
MEASURED

inspect-audit

A read-only auditor flags silent validity failures in evaluation logs.

repowazdogz-droid/inspect-audit
MEASURED

inspect-replay

Two evaluation logs compared deterministically, distinguishing 'unchanged' from 'cannot tell'.

repowazdogz-droid/inspect-replay
OBSERVED

mcp-boundary-audit

A harness detects a tool hidden from discovery yet reachable through the call surface, on a mock built to show it.

repowazdogz-droid/mcp-boundary-audit
MEASURED

nanogpt-provenance

A verifier re-derives a training run bit-for-bit; cross-hardware re-derivation stays UNKNOWN, not claimed.

repowazdogz-droid/nanogpt-provenance
PROVEN

OMEGA

A sealed, replayable decision record whose tamper-evidence is machine-checked.

repowazdogz-droid/omega-lean-proof
MEASURED

semdiff

A deterministic, severity-ranked semantic diff for four high-risk engineering formats, no LLM calls.

repowazdogz-droid/semdiff
PROVEN

vsf-cjson

Four kernel-checked theorems about a JSON parser and serialiser, with a differential over 120,000 inputs.

repowazdogz-droid/vsf-cjson
MEASURED

commons-agent-lab

A pre-registered study of whether LLM agents produce the collective failure that per-agent rules permit.

repowazdogz-droid/commons-agent-lab
MEASURED

proof-carrying-evals

Governance properties routed to the checker whose logic fits, with the LLM judge's score sealed beside the proof.

repowazdogz-droid/proof-carrying-evals
OBSERVED

spcu-verification

A small power-control IP verified with open tools; two injected defects invisible to every specification-derived property.

repowazdogz-droid/spcu-verification
OBSERVED

evidence-audit

A grader for recorded verification outputs that reports what a run explored, not the verdict it printed.

repowazdogz-droid/evidence-audit
PROVEN

collective-bound

The formal core behind the collective-bound result: Lean 4 (six theorems, no axioms), Z3 (eleven sealed verdicts), a learning adversary, negative controls.

repowazdogz-droid/collective-bound
§ 7.4

Upstream results

  • Inspect AI (UK AI Security Institute evaluation framework). completed_samples was computed from scored samples, so the same failing run reported 6 of 6 or 4 of 6 depending only on scorer declaration order. RELEASED link
  • LemmaScript (a verified-language toolchain emitting Dafny and Lean). Every called cross-file symbol was emitted as an axiomatised pure function; dafny verify reported 1 verified, 0 errors on code whose rollDie() returns different values per call. RELEASED link
  • inspect-robots (robocurve embodied-evaluation harness). Neither the final log nor the live snapshot recorded which path produced each operator judgement, so verdicts from different paths were indistinguishable on disk. RELEASED link
  • NVIDIA-NeMo labs-OO-Agents. Generator and async-generator methods were routed to the coroutine wrapper, so generation was skipped and the span ended at generator creation rather than at consumption. RELEASED link
  • NVIDIA SkillSpector. Every LLM-mode scan through the Anthropic provider failed: the schema carried minimum and maximum bounds the structured-output endpoint rejected. RELEASED link
  • cedar-policy cedar-spec (Cedar's Lean model and differential tests). Eight phantom-divergence classes surfaced while building the target; the pull request adds a differential target over the typed expression. OPEN PULL REQUEST link
  • pulp-platform common_cells (an open hardware IP library). The proof went through, and a cover requirement on the decoder's syndrome output showed that the output was declared and never driven. A one-line assignment fixed it; the proof and a width sweep to 64 bits passed with the fix. MERGED link
  • inspect-robots (robocurve embodied-evaluation harness). The specification carried the policy and embodiment configuration but nothing about the grader, so two runs graded by different models against different rubrics wrote byte-identical specifications. The pull request adds the grader name and its resolved configuration. MERGED link
  • Microsoft Agent Framework (Python) with its agent-hooks enforcement bundle. The documented configuration behaved correctly: every side effect observed out of process had a causally preceding permit for exactly that operation. Two documented configuration requirements, a bundle on each delegated child agent and the bundle first in the middleware list, produce no signal when violated. This is not a vulnerability report: the framework does not claim complete mediation, and the request is for a signal, not for a change in what is enforced. OPEN ISSUE link
  • PyBaMM (an open-source battery modelling library). An independently computed lithium inventory drifted by 2.44% on every revision and at every refinement, matching the rate predicted from the missing transference-gradient term; a project contributor confirmed the missing term on the parent thread and asked for a separate report. MERGED link
  • PyBaMM (an open-source battery modelling library). It multiplies by the full-cell thickness (767 µm in the Xu2019 parameter set) where the electrolyte occupies 67 µm, overweighting the term by a factor of 11.45; a project contributor confirmed it and asked for a separate report. MERGED link
  • pandapower (an open-source power-system analysis library). Four of fourteen unsupported groups returned converged=True with no warning and identical non-physical results; ten raised the intended error; one group documented as supported is rejected by the code. OPEN ISSUE link
  • cvc5 (an SMT solver). cvc5 returned sat for a formula whose spatial constraints require incompatible heaps. An upstream contributor reproduced the result and identified a polarity-handling cause. OPEN ISSUE link
  • cvc5 (an SMT solver). The cached polarity could be wrong, producing an incorrect result on the upstream reproducer. The proposed fix changes the cache key and adds regression tests. MERGED link
  • mpmath (an arbitrary-precision numerical library). mpmath's interval exponential excluded a high-precision endpoint value on a public reproducer; independent Decimal and Arb computations agreed on the exclusion. A maintainer confirmed the problem. OPEN ISSUE link
  • con-leche (a Lean proof-checking tool). The command could exit successfully without invoking the checker, so automation could accept a non-check as a pass. MERGED link
  • Orbit (an agent runtime). The provider imported the Anthropic SDK, but the package did not declare that dependency, so a clean documented installation failed at import time. RELEASED link

Released means the fix is in a tagged release. Merged means it is on the default branch but not verified in a tagged release. Open pull request means an Omega-authored change awaits upstream action. Open issue means a report remains open without a merged fix. Maintainer acceptance is review of one change, not endorsement of Omega.

Full table with what was testedThis ledger as JSON