Skip to content
Public template

About

quantum computer content-addressed in trinities double-entry ledger runnable on any 64bit hardware.

Topics

Resources

Security policy

Stars

3 stars

Watchers

0 watching

Forks

Latest commit

 

History

2,055 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

erpax

Source-available multi-tenant ERP & double-entry accounting on Payload CMS v4 + Cloudflare (D1 + R2 + Workers via OpenNext) — content-addressed, tamper-evident, standards-bound

Rouschev, Tsvetan

Deploy to Cloudflare DOI

figure value source
version 1.0.26 package.json
payload 4.0.0-beta.9 package.json
next ^16.4.1 package.json
node ^24.22.3 || >=26.13.1 package.json
collections 186 src/payload-types.ts
migrations 17 src/migrations
Lean files 47 src/utilities/verify/lean
theorems 366 src/utilities/verify/lean/inventory.generated.json
axiom-free 270 src/utilities/verify/lean/inventory.generated.json
license CC-BY-NC-ND-4.0 package.json

Proofs

Kernel report sealed 2026-11-16: 366 theorems, 270 axiom-free, 96 on Lean's three standard axioms, 0 stubbed, 47 files, sources f4450a8284eeea5a.

file the file says Clay theorems axiom-free kernel
Affect.lean Affect — feeling, thought and emotion as a trinity, and the two groups it can mean. none 21 21 accepted
Algorithm.lean Algorithm — four textbook algorithms at the size where the kernel can check every amplitude. none 5 5 accepted
Arrival.lean Arrival — a push has landed exactly when something judged it, nothing failed, and nothing of this push is still running. none 9 9 accepted
Automate.lean Automate — a refinement loop's guarantees hold BY CONSTRUCTION, or they do not hold. none 9 2 accepted
Clifford.lean Clifford — H, S and CNOT act on Pauli strings exactly as the tableau rules say. none 3 3 accepted
Clone.lean Clone — quantum information cannot be copied: no linear map clones both |0⟩, |1⟩ and |+⟩. none 2 1 accepted
Coil.lean Coil — coins in trinities; one rotation each way covers every cross. none 8 8 accepted
Contrast.lean Contrast — every colour admits a legible foreground, and the reason is one multiplication. none 7 3 accepted
Correct.lean Correct — error correction as syndrome arithmetic: each single error names itself. none 6 3 accepted
Cost.lean Cost — the tamper margin, stated against NIST's ladder instead of a folk rule. none 13 11 accepted
Cross.lean Cross — the corpus's claims, composed. A theorem that holds only inside its own file proves a fragment; what a reader needs is that the fragments CHAIN. none 8 7 accepted
Direction.lean Direction — the six ways to move inside an address, and the one constraint that governs all of them. none 17 13 accepted
Edge.lean Edge — which request the Worker stops before the app runs, and which it only counts. none 6 6 accepted
Embed.lean Embed — when a document is embedded again, and when an AI charge is admitted. none 6 6 accepted
Energy.lean Energy — why the conserved energy cannot bound the peak velocity. navier-stokes meta 2 2 accepted
Entangle.lean Entangle — the Bell and GHZ states from their circuits, and the CHSH bound they break. none 4 4 accepted
Erpax.lean Erpax.lean — the session's laws, stated so the kernel can refuse them. none 12 10 accepted
Foundation.lean Foundation — what each of Lean's three axioms means, certified by the kernel. none 3 0 accepted
Ftl.lean Ftl — the corpus's strongest claim, given the proof it was missing. none 12 3 accepted
Gap.lean Gap — why a symmetry that survives rescaling cannot force a mass gap. yang-mills meta 3 3 accepted
Gate.lean Gate — the standard gates as exact matrices, and their unitarity as kernel-decided theorems. none 17 17 accepted
Harmonic.lean Harmonic.lean — when does an involution leave a harmonic element? riemann meta 12 12 accepted
Hexbit.lean Hexbit — the two cross formulas that replace the hexit loops, and the bounds that make them exact. none 6 6 accepted
Involute.lean Involute — a lead is tagged by its involution, and the codomain is exactly three. none 7 7 accepted
Landauer.lean Landauer — the heat a computation must shed is the bits it erases, times k·T·ln 2. none 5 3 accepted
Lattice.lean Lattice — why the Hodge type condition cannot stand in for rationality. hodge meta 3 3 accepted
Main.lean Main — the system claim, reduced to what the three models actually guarantee. none 4 0 accepted
Mirror.lean duality/mirror — the two-sided coin, stated so the kernel can refuse it. none 11 11 accepted
Observer.lean Observer — what the turning leaves still, and what a self-model must leave out. none 12 12 accepted
Orchestrate.lean Orchestrate — decomposition and convergence, stated about the functions that produce them. none 6 2 accepted
Order.lean Order — a root addresses a SET or a SEQUENCE, and the two are never interchangeable. none 5 5 accepted
Path.lean Path — the corpus says "the path IS the message". This file proves the three properties that claim actually rests on, and refuses the one it does not. none 11 7 accepted
Perfect.lean Perfect — why trivial homology cannot recognise the 3-sphere. poincare meta 3 3 accepted
Planck.lean Planck — the three combinations, and what each one is made of. none 16 14 accepted
Prefix.lean Prefix — why finitely many coefficients cannot fix the order of vanishing. bsd meta 2 2 accepted
Prompt.lean Prompt — a prompt is a program: each word a step, the prompt its words run in order. none 9 9 accepted
Receipt.lean Receipt — WHEN a sealed verdict is cheaper than the answer, and when it is not. none 8 3 accepted
Register.lean Register — an exact-amplitude register, and why the Bell state is a theorem here. none 11 11 accepted
Release.lean Release — a green landing is released exactly when four facts hold, and at most once a day. none 6 6 accepted
Route.lean Route — a gate between uncoupled qubits, routed through SWAPs, computes the same function. none 3 0 accepted
Search.lean Search — why measuring small instances cannot separate polynomial from exponential cost. pnp meta 3 3 accepted
Spacetime.lean Spacetime — the decidable core of special relativity, and the one theorem in it that a distributed ledger actually needs. none 13 0 accepted
Stream.lean Stream — the payloadless wire shape, and the one property a reader may rely on. none 6 2 accepted
Symmetry.lean Symmetry — what an involution of the zeta zeros can and cannot say about the critical line. riemann meta 9 0 accepted
Teleport.lean Teleport — one shared Bell pair exchanges a qubit for two classical bits, both ways. none 4 4 accepted
Uuid.lean Uuid — the v8 layout is a partition, and the sixteen program bits round-trip in both directions. none 10 5 accepted
Wave.lean Wave — the ledger's guarantees are properties of the OPERATIONS, not hopes about the data. none 8 3 accepted
Affect.lean · 21 theorems
Algorithm.lean · 5 theorems
Arrival.lean · 9 theorems
Automate.lean · 9 theorems
Clifford.lean · 3 theorems
Clone.lean · 2 theorems
Coil.lean · 8 theorems
Contrast.lean · 7 theorems
Correct.lean · 6 theorems
Cost.lean · 13 theorems
Cross.lean · 8 theorems
Direction.lean · 17 theorems
Edge.lean · 6 theorems
Embed.lean · 6 theorems
Energy.lean · 2 theorems
Entangle.lean · 4 theorems
Erpax.lean · 12 theorems
Foundation.lean · 3 theorems
Ftl.lean · 12 theorems
Gap.lean · 3 theorems
Gate.lean · 17 theorems
Harmonic.lean · 12 theorems
Hexbit.lean · 6 theorems
Involute.lean · 7 theorems
Landauer.lean · 5 theorems
Lattice.lean · 3 theorems
Main.lean · 4 theorems
Mirror.lean · 11 theorems
Observer.lean · 12 theorems
Orchestrate.lean · 6 theorems
Order.lean · 5 theorems
Path.lean · 11 theorems
Perfect.lean · 3 theorems
Planck.lean · 16 theorems
Prefix.lean · 2 theorems
Prompt.lean · 9 theorems
Receipt.lean · 8 theorems
Register.lean · 11 theorems
Release.lean · 6 theorems
Route.lean · 3 theorems
Search.lean · 3 theorems
Spacetime.lean · 13 theorems
Stream.lean · 6 theorems
Symmetry.lean · 9 theorems
Teleport.lean · 4 theorems
Uuid.lean · 10 theorems
Wave.lean · 8 theorems

Clay

problem witness kind theorems stubbed the file says
P vs NP Search.lean meta 3 0 Search — why measuring small instances cannot separate polynomial from exponential cost.
Riemann Hypothesis Harmonic.lean meta 12 0 Harmonic.lean — when does an involution leave a harmonic element?
Riemann Hypothesis Symmetry.lean meta 9 0 Symmetry — what an involution of the zeta zeros can and cannot say about the critical line.
Navier–Stokes Energy.lean meta 2 0 Energy — why the conserved energy cannot bound the peak velocity.
Yang–Mills Gap.lean meta 3 0 Gap — why a symmetry that survives rescaling cannot force a mass gap.
Hodge Lattice.lean meta 3 0 Lattice — why the Hodge type condition cannot stand in for rationality.
Birch–Swinnerton-Dyer Prefix.lean meta 2 0 Prefix — why finitely many coefficients cannot fix the order of vanishing.
Poincaré Perfect.lean meta 3 0 Perfect — why trivial homology cannot recognise the 3-sphere.

settled: none (claySettled)

Kernel report sealed 2026-11-16: 366 theorems, 270 axiom-free, 96 on Lean's three standard axioms, 0 stubbed, 47 files, sources f4450a8284eeea5a.

Commands

pnpm erpax · pnpm dev · pnpm devsafe · pnpm build · pnpm build:next · pnpm build:next:webpack · pnpm postbuild · pnpm preview · pnpm payload · pnpm generate:types · pnpm generate:importmap · pnpm generate:repo · pnpm payload:migrate:create · pnpm lint · pnpm typecheck · pnpm test · pnpm test:etrima · pnpm seed:etrima · pnpm test:e2e · pnpm deploy · pnpm deploy:database · pnpm deploy:app · pnpm seed · pnpm standards:refresh · pnpm standards:check · pnpm prepare

References

date authors title to
2026-08-04 Rouschev, Tsvetan All Seven Clay Millennium Problems Sealed via Universal σ-Involution
2026-08-04 Rouschev, Tsvetan Quantum Proofs of the Clay Millennium Problems v1.0
2026-08-04 Rouschev, Tsvetan Quantum Proofs of the Clay Millennium Problems Clay Mathematics Institute
1988 Merkle, Ralph C. A Digital Signature Based on a Conventional Encryption Function
1991 Haber, Stuart; Stornetta, W. Scott How to time-stamp a digital document
2013 Internet Engineering Task Force RFC 6962 — Certificate Transparency
2024 Internet Engineering Task Force RFC 9562 — Universally Unique IDentifiers (UUIDs)
2020 Internet Engineering Task Force RFC 8785 — JSON Canonicalization Scheme (JCS)
2023 International Organization for Standardization ISO/IEC 25010:2023 — Systems and software Quality Requirements and Evaluation (SQuaRE): product quality model
2018 International Organization for Standardization ISO 19011:2018 — Guidelines for auditing management systems
2006 Ministry of Finance of the Republic of Bulgaria Наредба № Н-18 — Bulgarian fiscal-device and SUPTO regulation

License

CC-BY-NC-ND-4.0 · license@erpax.com

About

quantum computer content-addressed in trinities double-entry ledger runnable on any 64bit hardware.

Topics

Resources

Security policy

Stars

3 stars

Watchers

0 watching

Forks

Releases

Sponsor this project

Packages

Used by

Contributors

Languages