Not polyglot chaos. Polyglot jurisdiction. Each language has exactly one courtroom role and cannot cosplay as the whole justice system.
A raw scanner finding is a claim. A claim in a courtroom needs a judge, an actuary, a notary, a bailiff, and a clerk before it becomes admissible evidence. You wouldn't let the bailiff write the verdict. You wouldn't let the clerk price the loss. The same principle applies here.
Every SEC finding in this harness passes through seven jurisdictional checkpoints before it reaches the policy ledger. Each language owns its courtroom role absolutely. Lean doesn't price losses. Python doesn't prove theorems. Perl doesn't enforce policy. Rust doesn't argue logic. Each does exactly one thing, and does it definitively.
The result is not a polyglot mess — it is a seven-chamber trial where each chamber produces one artifact, and the OPA policy decides what evidence to admit. The DIAMOND waits at the end with the gavel, and it only drops when all seven chambers have spoken.
Evidence ADMIT vs Formal COMPLETE — two different bars, both required.
A finding can be admissible while the theorem is still under construction. OPA can admit the evidence without pretending Lean finished the homework.
| Finding | Evidence | Formal | Lean sorry | Stage | Live |
|---|---|---|---|---|---|
| SUB006 EigenLayer Cascade | ADMIT | WATCH | ×2 | S-6 | pemos.ca/sec-006 |
| SUB009 GMX FastPrice | ADMIT | WATCH | ×1 | S-6 | pemos.ca/sec-009 |
| SUB003 Wormhole Finality | ADMIT | WATCH | ×1 | S-6 | pemos.ca/sec-003 |
| SUB005 Aave Sequencer Oracle | ADMIT | COMPLETE | ×0 | S-5 | pemos.ca/sec-005 |
| SUB012 Ethena USDe Reserve | WATCH | WATCH | ×1 | S-4 | pending |
package eose.sec_harness
import future.keywords.if
import future.keywords.in
# ── Seven Lens Requirements ──────────────────────────────────────────────────
# A finding must pass all seven lenses before FORMAL COMPLETE.
# OPA can ADMIT evidence even when Lean sorry debt exists (split verdict).
default admit_evidence = false
default formal_complete = false
# EVIDENCE ADMIT: Python + Perl + Rust lenses complete
admit_evidence if {
input.lenses.python_loss_model == "complete"
input.lenses.perl_epoch_pin == "complete"
input.lenses.rust_scan == "complete"
input.bower >= 60
}
# FORMAL COMPLETE: all seven lenses + zero sorry debt
formal_complete if {
admit_evidence
input.lenses.lean_sorry_count == 0
input.lenses.fortran_cascade == "complete"
input.lenses.cobol_ledger == "complete"
input.lenses.lisp_proof_tree == "complete"
}
# DENY rules — each missing lens produces a specific violation
deny[msg] if {
input.lenses.lean_sorry_count > 0
msg := sprintf("LEAN_SORRY_DEBT: %d open sorries — formal proof incomplete", [input.lenses.lean_sorry_count])
}
deny[msg] if {
input.lenses.python_loss_model != "complete"
msg := "PYTHON_LENS_MISSING: loss model not run — cannot price TVL at risk"
}
deny[msg] if {
input.lenses.perl_epoch_pin != "complete"
msg := "PERL_LENS_MISSING: epoch pin absent — finding not notarized in γ₁ ledger"
}
deny[msg] if {
input.lenses.rust_scan != "complete"
msg := "RUST_LENS_MISSING: fleet scan not run — operator graph state unverified"
}
deny[msg] if {
input.lenses.fortran_cascade != "complete"
msg := "FORTRAN_LENS_MISSING: cascade simulation absent — worst-case propagation unknown"
}
deny[msg] if {
input.lenses.cobol_ledger != "complete"
msg := "COBOL_LENS_MISSING: evidence ledger not archived — audit trail incomplete"
}
deny[msg] if {
input.lenses.lisp_proof_tree != "complete"
msg := "LISP_LENS_MISSING: causal proof tree absent — explanation chain unresolved"
}
# KCF minimum — finding needs KCF ≥ 7 for bounty filing
deny[msg] if {
input.kcf < 7
msg := sprintf("KCF_BELOW_THRESHOLD: kcf=%d, minimum 7 required for bounty", [input.kcf])
}
# BOWER minimum — finding needs BOWER ≥ 60% for admission
deny[msg] if {
input.bower < 60
msg := sprintf("BOWER_BELOW_THRESHOLD: bower=%d%%, minimum 60%% required", [input.bower])
}
# Split verdict summary
verdict := "FORMAL_COMPLETE" if { formal_complete }
verdict := "EVIDENCE_ADMIT" if { admit_evidence; not formal_complete }
verdict := "EVIDENCE_WATCH" if { not admit_evidence }
# Sorry-aware: if ADMIT but sorry debt exists, tag it
sorry_aware_verdict := sprintf("%s_WITH_SORRY_DEBT(%d)", [verdict, input.lenses.lean_sorry_count]) if {
verdict == "EVIDENCE_ADMIT"
input.lenses.lean_sorry_count > 0
}
sorry_aware_verdict := verdict if {
input.lenses.lean_sorry_count == 0
}