PUBLIC BETAThe Penta-Ledger is currently operating in Public Beta (v0.9.4). All mathematical audits and open intake pipelines are active.
The Penta-LedgerBETA
Audit Methodology & TSEM Framework

Human-Led > Multidisciplinary > AI-accelerated

How The Penta-Ledger uses the Three-State Epistemic Minimum (TSEM), Dual-Engine Convergence, and sovereign human discernment to audit mathematics and science papers with unmatched precision.

Framework Version: Penta-Ledger v1.1View Review Specification →View FAQ →

1. The Three Foundational Pillars

The architectural triad that ensures uncompromised deductive rigor, epistemic honesty, and high-velocity discovery.

👨‍🔬
Pillar I

Human-Led Sovereign Judgement

The ultimate quality, intellectual validity, and epistemic classification of every review depends strictly on the judgement and discernment of the Lead Auditor.

While automated tooling generates extensive diagnostic signals, the final responsibility for deductive integrity, identifying unstated circular definitions, and weighing epistemic plausibility rests entirely with human domain experts.

Lead Auditors carry sovereign responsibility for signing off on each Logic Ledger gate (L₁ ... Lₙ) and assigning the definitive Epistemic State without automated abdication.

Standard: Every audit is signed off and defended by a named Lead Auditor role and review team.
🧩
Pillar II

Multidisciplinary Triangulation & The Jigsaw Principle

Even the most established disciplines have internal blind spots and undeclared assumptions that may bias their results. We adopt a Gödelian approach by acknowledging that no coherent system can fully demonstrate its own foundational consistency or prove all its core truths from within - and 'triangulating' everything within a paper against as many independent disciplines as possible to detect implicit axiomatic assumptions, domain bias and uncover empirical contradictions or counter-examples.

For problems that have remained unsolved for years, we assume that all the jigsaw pieces usually already exist, but that no single discipline holds all the pieces. To help us find the jigsaw pieces, we actively translate techniques, formalisms and heuristics from all areas of science including computer science, physics, astronomy, engineering, chemistry, biology, medicine, economics, financial markets, operational research, management science, neuroscience, behavioural science, experimental psychology and many more.

Standard: Gödelian multi-domain triangulation (translating formalisms across all scientific disciplines).
Pillar III

Frontier AI Acceleration & Dual Realism

Our auditors make aggressive use of the leading edge of technology tooling, automated reasoning, and disruptive AI innovations. We utilize AI as a high-velocity force multiplier for:

  • Exhaustive academic literature and prior-art searches across global preprint archives.
  • Adversarial hypothesis testing and automated counterexample construction.
  • High-dimensional parameter sweeps and discrete boundary stress-testing.
  • Lean 4 formalization scaffolding and AST syntax verification.

We have built a world-leading understanding of how AI tackles complex mathematical and scientific problems: we are neither naive to what AI can and cannot do, nor are we naive to what humans can and cannot do. AI discovers counter-examples and explores combinatorial edge-cases at machine scale; human Lead Auditors provide sovereign deductive discernment, domain context, and ultimate scientific accountability.

Standard: Machine exploration at scale + Human deductive verification at the boundary.
Foundational Core

2. The Three-State Epistemic Minimum (TSEM)

Why traditional binary logic fails high-stakes scientific reasoning, and how a permanent 3-state minimum (SP, SI, SU) protects truth from rhetorical overwriting.

The Three-State Epistemic Minimum (TSEM) is the foundational problem-solving framework that drives all Penta-Ledger audits. Unlike classical binary systems (1/0, True/False, Accept/Reject), TSEM establishes that a 2-state minimum is fundamentally inadequate for modeling scientific reality.

1. Defensibly Possible (SP)

Propositions logically consistent with verified axioms and backed by constructive or empirical evidence.

2. Provably Impossible (SI)

Propositions that explicitly violate established boundary constraints, conservation laws, or logical axioms.

3. Irreducibly Unknowable (SU)

Propositions that are fundamentally undecidable or lack an accessible verification path. Held in permanent quarantine against rhetorical overwriting.

⚙️ The Dual-Engine Convergence Process

TSEM refines SP and expands SI through alternating bottom-up and top-down passes until the search space collapses:

CONSTRUCTIVE ENGINE (Bottom-Up)

Tests positive candidate derivations through deterministic assembly, step-by-step logic gates, and Lean4 mechanization to determine "what it is."

ELIMINATIVE ENGINE (Top-Down)

Applies heuristics, empirical boundaries, and contradiction testing to prune falsified candidates directly into SI, generating hard negative constraints.

DimensionClassical Binary LogicThree-Way / Rough SetsThree-State Epistemic Minimum (TSEM)
Minimum Base2 States (True / False)3 States (Pos / Neg / Boundary)3 States (Possible / Impossible / Unknowable)
Status of 3rd StateNon-existent (forced choice)Temporary (shrinks with data)Permanent (quarantined partition)
Rhetorical ResilienceHighly vulnerable to forced dilemmasStatistical threshold focusImmunized against rhetorical overwriting
Convergence GoalAny satisfying assignment (SAT)Region assignmentExactly 1 provably consistent solution
Mathematical Optimum

Why Five? The Prime Anti-Aliasing Principle & The Goldilocks Base

Why is the platform named The Penta-Ledger and not the Tri-Ledger or Six-Ledger?

1. Why Not 2, 3, or 4?

Too coarse. We need enough independent states to cleanly distinguish the structural differences between 2, 3, and 4 without collapsing them.

2. Why Not 6? (Aliasing Trap)

6 is composite (2 × 3). Combinations of 2 & 3 (and 2 & 4) can alias and hide behind equivalences of 6. This is why CODE_FLAGGED is kept strictly as an overlay, not a 6th state!

3. Why Base 5? (The Optimum)

5 is Prime: No composite divisors to hide flawed combinations, minimal prime > 4, and perfectly matches human cognitive bandwidth without the overload of 7+.

3. The 4-Step Audit Workflow

How every submitted manuscript moves from cryptographic intake through TSEM triage to immutable ledger publication.

Step 1🔐

Intake, SHA-256 Hashing & Cryptographic Timestamping

Every submission is digested into an immutable SHA-256 hash fingerprint and timestamped via OpenTimestamps. Submitters receive a verifiable cryptographic proof-of-possession receipt to anchor intellectual priority without requiring identity disclosure.

Step 2🧱

TSEM Tri-State Partitioning & Barrier Triage

The manuscript problem space is partitioned into Defensibly Possible (S_P), Provably Impossible (S_I), or Irreducibly Unknowable (S_U). Auditors identify explicit axioms and cross-examine claims against known obstruction barriers (e.g. Parity, Relativization).

Step 3📑

Atomic Logic Ledger Construction (L₁ ... Lₙ)

The core deductive line is decomposed into an ordered sequence of discrete, auditable logic gates. Each gate is cross-referenced with exact manuscript page/equation citations, evaluating structural soundness, non-circularity, and inference validity.

Step 4⚖️

Dual-Engine Convergence & Code Audit Gate

Bottom-up constructive verification (Lean4) and top-down eliminative pruning converge on the final Epistemic State. Supporting scripts undergo AST analysis to flag mock routines, hardcoded lookup tables, or tautological mock axioms (CODE_FLAGGED).

4. The 5 Epistemic States (Granular Expansion)

The 5 canonical states of The Penta-Ledger are a precise, discipline-specific expansion of the Three-State Epistemic Minimum.

#1 UnknowableTSEM: S_U (Irreducibly Unknowable)
Canonical State: UNKNOWABLE

Based on what has been submitted, it's impossible to ever know if it is true or false.

The proposition involves inherently unobservable latent variables, non-constructive non-computable states, or formalizations where no finite measurement or deductive algorithm can ever determine truth value under the stated physical or mathematical framework.

Example: e.g. Pure metaphysical interpretations with zero observable physical or algebraic consequences.
#2 UndecidableTSEM: S_U (Irreducibly Unknowable)
Canonical State: UNDECIDABLE

Based on what has been submitted, it's possible to know that it's one of true or false but don't know which one.

The proposition is mathematically well-defined and known to possess an objective binary truth value, but is formally independent of the chosen axiomatic system (e.g. Gödel incompleteness, Continuum Hypothesis under ZFC) or exceeds algorithmic decidability bounds.

Example: e.g. General Diophantine decision problems over infinite integer domains without explicit register bounds.
#3 ImpossibleTSEM: S_I (Provably Impossible)
Canonical State: IMPOSSIBLE

Based on what has been submitted, it's logically impossible or provably false.

The manuscript contains an irreconcilable internal contradiction, violates a proven conservation law, or relies on mathematical premises that demonstrably imply 0 = 1 under its explicit axiomatic foundation.

Example: e.g. Macroscopic superluminal informational transfer violating microcausality and Lorentz invariance.
#4 PossibleTSEM: S_P (Defensibly Possible)
Canonical State: POSSIBLE

Based on what has been submitted, it is possible that it is true.

The theoretical framework, algebraic derivations, and definitions are logically coherent and contain no overt contradictions. The argument successfully clears baseline plausibility triage, but either lacks mechanized Lean4 verification or possesses unclosed boundary conditions.

Example: e.g. Coherent continuous modular extensions of the 3x+1 Collatz operator awaiting verified inductive closure.
#5 Provable (Validated)TSEM: S_P (Defensibly Possible)
Canonical State: PROVABLE

Based on what has been submitted, it can be proved that it is true and we have the Lean4 code that does so.

The proof has been fully formalized and mechanized into machine-checkable code (Lean 4, Coq, or Isabelle/HOL). All definitions, lemmas, and induction steps type-check without unproven mock axioms or ungrounded external assumptions.

Example: e.g. Fully mechanized bounded register decidability proofs verified by the Lean 4 kernel.
COMPUTATIONAL SAFEGUARD

The Independent Code Audit Gate (CODE_FLAGGED Overlay)

In modern scientific literature, manuscripts frequently accompany theoretical claims with Python numerical generators or Lean 4 / Coq mechanization scripts.

Our audit pipeline inspects codebases with automated Abstract Syntax Tree (AST) analyzers and human line-by-line verification. When a paper clears the theoretical plausibility gate of POSSIBLE (SP), but its supporting scripts contain deceptive computational practices:

  • Hardcoded static lookup tables: Pre-calculated dictionaries intercepting inputs instead of dynamic evaluation.
  • Tautological axioms in Lean4/Coq: Unproven mock axioms declared as lemmas that assume the final theorem circularity.
  • Silent catch-all fallbacks: Infinite loops or mock conditionals that unconditionally return True.

A conspicuous CODE_FLAGGED overlay is attached to the paper on the ledger, providing transparent code extracts and specific remediation requirements for the authors.