The RFT-SIRM research and engineering hub: a coordinated portfolio spanning machine-checked mathematics, recursive spectral research, a proposed Sierpiński/SU(2) quantum-processing architecture, and a Lean-formalized financial-state model. Each workstream has its own definitions, source repository, tests, and evidence boundary. RFT means Resonant Field Theory (резонансная теория поля); SIRM means Synthetic Intelligence Reasoning Model (Синтетическая интеллектуальная модель рассуждений).
UltraCore-RFT is the central navigation and evidence hub for four primary, independently scoped development strands. The source repositories remain authoritative for their definitions, proofs, models, tests, and limitations.
| Core strand | Canonical source | Current work | Evidence boundary |
|---|---|---|---|
| SU(2) mathematical theorem | Evgeny-Theorem | Lean 4 formalization of the stated all-level fourth-moment trace-defect identity for the specified SU(2)-connected Sierpiński-gasket operators. Higher moments H⁶/H⁸/H¹⁰ have separate, narrower proof and certificate statuses. | The theorem covers its encoded operators and quantifiers; it does not prove every higher-moment extension or a physical implementation. |
| Signed-flux spectral theory | Phi-Genesis | Lean proves the stated signed-Laplacian lower bound and, for the signless graph Laplacians and their gauge-conjugate signed matrices at |
Gate A, the quadratic increment law, levels |
| Sierpiński quantum-processing architecture | RFT-QPU-Sierpinski | A proposed level-1 tile has 6 graph sites, 9 edges, 3 selected non-commuting X/Y/Z SU(2) links, 12 transmon modes, and 22 effective exchange channels. A candidate logical qubit is represented by a two-dimensional low-energy subspace; Stage 11B records a re-quantized three-mode gate-model study. | Pre-experimental. Stage 11B figures are closed-system model projections, not measured gate fidelities or a full 12-transmon simulation. No chip has been fabricated or measured; the complex-Z link and graph-wide multi-tone plan remain unresolved. |
| Formal financial infrastructure | SIRM-Financial-Infrastructure | Lean 4 specifies supply and holder state, balanced general-ledger postings, authorization and finite registries, exact asset-unit conversion and migration residuals, nonce/receipt handling, and integrated pooled escrow, time-lock, and first-stage dispute-freeze transitions. | An abstract formal state-transition model, not a deployed financial service. Rust refinement, production persistence and signatures, custody, reserves, settlement, legal and regulatory operation remain separate obligations. |
The four strands are coordinated by this hub, but their results are not interchangeable: a proof for one operator family does not establish another family's spectral claims; the QPU model is not hardware validation; and financial-state theorems do not certify a production runtime or network. See the research map and architecture for the relationships and boundaries.
Research monographs — two distinct scopes
Focused theorem dissertation: Spectral Trace Defects of Noncommutative SU(2) Connections on Sierpiński-Gasket Graphs. It covers the specified SU(2) operators, the all-level fourth-moment identity, its normalized limit, and the separately scoped H⁶/H⁸/H¹⁰ results. The formal source remains Evgeny-Theorem.
Broader synthesis dissertation: Recursive Graph Operators, Spectral Trace Defects, and Higher-Moment Recurrence. It surveys the wider recursive-operator programme, finite higher-moment certificates, numerical recurrence work, and the separate signed-flux spectral programme. Its source version is dated 15 October 2026; consult the source repositories for later proof-status changes.
These documents are complementary, not interchangeable. The canonical texts remain in their respective repositories. See the Research Monographs guide.
These links describe the scientific work and its current evidence status. Badge colours have a consistent meaning: purple = research programme, teal = formalized result, amber = open or evidence-limited work, and blue = navigation or portal.
These are additional exploratory or application tracks—not proofs of the mathematical claims or substitutes for the core quantum-architecture and financial-infrastructure workstreams above. They use one badge size and a restrained colour system so they read as one group.
UltraCore-RFT runs the two canonical Phi-Genesis daily computational workloads independently: the level-9 deep suite and the high-precision A1/E spectral-matrix jobs. Each run records the exact upstream Phi-Genesis commit and preserves logs as Actions artifacts.
Daily computation record · Nightly deep workflow · High-precision matrix workflow
These badges report the status of specific workflows only. They do not certify the entire research programme or transfer proof status between repositories.
These are separate repositories and separate evidence scopes. Rift-L1 and Rift Network publish source-available code under their own restrictive terms; the Apache-2.0 badge above applies only to original material in this UltraCore-RFT repository. Scheduler CI/fuzz and Lean 4 test badges link to their source workflows; a badge reflects that workflow, not a universal proof of the wider programme.
The project family's historical order is distinct from the evidence-first reading order used to assess claims. The maintainer-reported sequence is Rift Network → Rift-L1 Blockchain → UltraCore-RFT and supporting systems (scheduler, memory, and related engineering) → Phi-Genesis → Evgeny-Theorem → Evgeny's Theory of Everything. See the origin chronology for scope, source links, and the distinction between reported order and commit-verified dates.
This order records development history; it does not claim that every later project depends technically on every earlier one.
Start with the research, not the applications: Focused fourth-moment dissertation · Broader synthesis dissertation · Lean formalization · Phi-Genesis spectral theorem · Research map · AI reading guide
UltraCore-RFT is the documentation and coordination hub for the RFT-SIRM ecosystem. Its scientific story begins with mathematical definitions, theorem statements, and their evidence boundaries. Runtime systems, blockchain protocols, and other applications are downstream research programmes—not the foundation used to certify the mathematics.
Important scope statement. The phrase Evgeny's Theory of Everything names a broad, ongoing research programme. It does not mean that a complete physical theory of the Universe has been established. The SU(2) fourth-moment identity is formalized in Lean for its stated operators and quantifiers. H⁶ and H⁸ have Lean recurrences from level
$m\ge3$ plus exact finite certificates for the exceptional$2\to3$ transition; H¹⁰ has an unconditional Lean recurrence for$m\ge4$ and affine form for$m\ge5$ . Phi-Genesis separately proves convergence of the least eigenvalues of its signed/signless graph matrices for$N\ge6$ , while Gate A, the quadratic increment law, and the external$\theta=2\pi$ identification remain open.
This programme has developed across separate repositories. The following are documented workstreams, not claims of institutional endorsement or that every project has the same verification status.
| Workstream | Public record | Scope and evidence boundary |
|---|---|---|
| Mathematical research and dissertations | Focused fourth-moment dissertation · broader synthesis dissertation · Lean formalization | The H⁴ identity is Lean-formalized for all stated levels and angles; H⁶/H⁸/H¹⁰ have distinct, explicitly bounded proof statuses. |
| Spectral computation and formal result | Phi-Genesis | Lean proves the least eigenvalue and convergence for signed/signless graph matrices at |
| Quantum-processing architecture | RFT-QPU-Sierpinski | Proposed 12-transmon level-1 mapping and candidate logical subspace; closed-system numerical models only, with physical validation gates open. |
| Formal financial infrastructure | SIRM-Financial-Infrastructure | Lean 4 abstract financial-state/accounting model; production identity, persistence, Rust refinement, custody and settlement remain open. |
| Solana / Agave engineering | Rift-Network · Agave Rift Scheduler · ABIv2 memory contexts | On-chain protocol, scheduler and memory-context research; claims are scoped to their code, tests and documented environments. |
| seL4 kernel stress research | seL4 CDT report · field-trial report | Reproducible empirical stress-testing report. It does not replace or extend the seL4 project's formal verification claims. |
| DeFi model review | Aave V4 Hub model review | Separate model-based review and invariant-analysis work; not an Aave endorsement. |
| Standalone L1 and exploratory applications | Rift-L1 · Invariant Battery | Distinct implementation or exploratory tracks; no implied production or experimentally validated result beyond the linked evidence. |
| Research chronology | Commit-backed history · Research map | Selected milestones with direct links; use each repository's commit log for the complete record. |
Repository activity, public issues, or work in an open-source ecosystem must not be presented as employment, a contract, a partnership, sponsorship, approval, or endorsement by NASA, Anza, Solana, the seL4 project, Aave, or any other institution unless a specific public source establishes that relationship. The current curated project history links to verifiable repository artifacts. A standalone NASA- or MATLAB-specific project is not listed here as verified because the available repository and commit evidence reviewed for this update did not identify a matching artifact. If such work exists in a separate public repository or contribution, its exact URL should be added to the chronology rather than inferred from a profile screenshot.
For collaboration proposals, research correspondence, licensing questions, or requests for formal review, use the designated contact route and include a clear subject, the relevant repository/commit, the requested action, and the sender's institutional or organizational affiliation where applicable. A GitHub issue or pull request is appropriate for public, technical, reproducible discussion; confidential, contractual, licensing, or personal information should not be posted publicly.
See CONTACT.md for the submission and attribution policy. Public contact details should be a dedicated, controlled mailbox that the maintainer intends to monitor; do not assume that a commit-author email is automatically the official legal or business contact.
The primary theorem repository studies a specified SU(2)-valued connection on a Sierpiński-gasket graph and compares a noncommuting configuration
The normalized quantity is
At the special angle
The exact finite-level remainder is
What is machine-checked: the source project reports a Lean 4 formalization for every integer level
What the theorem does not establish: it does not prove the full spectrum, all higher moments, a physical law, a quantum speed-up, a solution to a Millennium Prize Problem, or the entire broader Theory-of-Everything programme.
Primary sources: focused theorem dissertation · theorem statement · Lean formalization · verification record · test workflows · project site.
The source repository reports direct numerical comparisons for levels
| Level |
|||
|---|---|---|---|
| 1 | 12 | −16 | −1.333333 |
| 2 | 30 | −32 | −1.066667 |
| 3 | 84 | −80 | −0.952381 |
| 4 | 246 | −224 | −0.910569 |
| 5 | 732 | −656 | −0.896175 |
| 6 | 2,190 | −1,952 | −0.891324 |
| 7 | 6,564 | −5,840 | −0.889701 |
| Limit | — | — |
The raw formula, normalized denominator, and displayed table use the same convention. For example, at
This is a second mathematical result in a different operator family. It concerns the signless graph Laplacian
For every level
The limiting least eigenvalue is proved to lie in the exact rational interval
The interval has width
Formal sources: least-eigenvalue and convergence theorem · signed/signless transfer · PR #31: exact next-level identities · PR #32: signed eigenvalue transfer.
Still open: a proof of the quadratic increment law and its constant (currently numerical evidence), a closed form for the limit, levels
The research programme extends beyond the one formal theorem. Its components must remain connected but not conflated.
Strand A — Evgeny's Theory of Everything: higher moments and recursive operators
Primary repository: RFT-SIRM/Evgeny-s-Theory-of-Everything · dissertation.
The synthesis programme studies higher-moment trace defects, Fourier coefficients, finite-level recurrence residuals, and the possibility of an all-level law for recursive graph/operator families.
-
H⁶ and H⁸: Lean proves their all-angle recurrences for
$m\ge3$ ; exact symbolic certificates close the finite$m=2\to3$ transition. These bridges are exact but are not yet Lean-kernel theorems. -
H¹⁰: Lean proves the required radius-four transport, the unconditional affine recurrence for
$m\ge4$ , and the affine formula for$m\ge5$ . The level-five correction remains an exact finite trace expression rather than an expanded trigonometric polynomial. - Numerical evidence: held-out angle grids, sparse-matrix-power calculations, and cross-checks are finite reproducibility checks; they do not replace the proof boundaries above.
- Open extension: a single general all-level recurrence theorem covering the higher-moment family remains open. Exact certificates and individual moment theorems must be cited at their own stated scope.
- Research obligation: derive the exceptional first-transition correction from the recursive construction, prove the recurrence or find a counterexample, and formalize any complete derivation against explicit definitions.
The dissertation itself explicitly distinguishes the fourth-moment theorem from the higher-moment programme. Read the dissertation, recurrence note, and modular certificate.
Strand B — Phi-Genesis: signed-flux spectral decimation and mass-formula audit
Primary repository: RFT-SIRM/Phi-Genesis · live research site.
Phi-Genesis studies signed
- Some proposed claims have been rejected or narrowed by the documented audits.
- Numerical results and tests support specific computational statements only within their stated parameters and code paths.
-
Proved in Lean: for the signless Laplacian
$Q_N$ and its gauge-conjugate signed matrix,$N\ge6$ , the least eigenvalue is the unique A1 root in the exact 36-digit interval and the sequence of least eigenvalues converges to a point of that interval. See the formal eigenvalue theorem and signed transfer. -
Still open: Gate A's full exceptional set, the quadratic increment law and its constant (numerical evidence only), a closed form for the limit, levels
$N<6$ , and the external$\theta=2\pi$ operator identification. - A fitted or selected mass-index pattern is not an established predictive physical law without a prospective selection mechanism, predeclared predictions, held-out validation, and an independent derivation.
- No equivalence between the SU(2) operators and signed-flux Laplacians is assumed. Any bridge requires an explicit map, boundary conditions, preserved quantities, exceptional cases, and proof or a clearly labelled conjecture.
Start with the repository status and methods, then inspect its versioned test workflows and reports. The fact that tests pass does not close Gate A unless the tests actually establish its closure criteria.
Strand C — SIRM and deterministic execution
SIRM (Synthetic Intelligence Reasoning Model) is the systems-engineering strand: define state invariants and require every state transition to preserve them or fail atomically.
The four stated runtime constraints are shown below using compact mathematical symbols. The mapping table identifies the implementation variables.
$$ \begin{aligned} I_1:\quad & S = B + Gp,\ I_2:\quad & S = M - D,\ I_3:\quad & d < p \quad (p>0),\ I_4:\quad & E_i \ge -\frac{S}{10p}. \end{aligned} $$
The effective-balance relation is
$$ E_i = b_i + G. $$
| Symbol | Implementation variable |
|---|---|
total_supply |
|
total_base_sum |
|
global_field |
|
total_minted |
|
total_burned |
|
dust_accumulator |
|
effective_balance[i] |
|
base_balance[i] |
Here
SIRM is an engineering model and specification. The Lean theorem above is a separate mathematical result; there is no claim that the spectral theorem proves the runtime invariants.
Strand D — RFT-QPU-Sierpinski: proposed logical-qubit architecture
Primary source: RFT-QPU-Sierpinski · repository status · validation plan · calculated result summary.
The architecture maps a level-1 Sierpiński-gasket graph to a proposed transmon system. Each graph site carries a two-component internal degree of freedom; the candidate logical qubit is a selected two-dimensional low-energy subspace. The proposed tile contains 12 transmon modes and 22 effective exchange channels, with three selected non-commuting SU(2) links.
The Stage 11B selected local retune reports a projected process overlap of 0.9999999793763371 after local-Z fitting and an average logical-state fidelity including leakage of 0.9999999803654352 at five retained levels and 480 time steps per pump period. These are closed-system numerical projections for a three-mode A–coupler–B model, not measured fidelities and not a driven simulation of the complete 12-mode tile. The seven-level 240/480 propagation remains open, and raw fine-retune JSON/NPZ artifacts are not tracked.
The architecture remains pre-experimental. A resonant complex-Z link requires a concrete phase-engineered circuit; the current single real static coupler is insufficient. The graph-wide nine-tone screen reports 73 primary and 653 conditional resonance warnings with zero minimum primary margin. Open-system T1/T2, thermal, flux-line, crosstalk, layout-extraction, fabrication, and measured one-/two-cell validation remain ahead. No chip, measured gate, fault tolerance, or quantum advantage is claimed.
The QPU repository has its own BUSL-1.1 source-licensing terms. The Apache-2.0 licence of this hub does not relicense that repository or its materials.
Strand E — SIRM Financial Infrastructure: formal financial state and accounting
Primary source: SIRM-Financial-Infrastructure · formalization status · mathematical scope · testing guide.
This is a dedicated Lean 4.33.1 workstream for financial-state transitions and accounting invariants. The combined authorized financial machine updates holder balances and the corresponding signed general-ledger journal in one abstract state transition. Its wider model includes:
- supply/holder reconciliation, balanced journals, and matching holder/GL postings;
- exact principal/account control, operation-scoped grants, typed account and asset registries, and issuer/recipient-aware issuance;
- exact decimal-to-base-unit conversion, rational cross-network migration, and route/account-partitioned residual carry-forward;
- per-principal nonces, typed request receipts, exact retry behaviour, and cached authorization/insufficient-funds denials;
- concurrent escrow IDs, pooled reserve/vault/GL reconciliation, discrete deadlines and expiry refunds, and a first-stage per-ID dispute intake/freeze.
The pinned workflow is configured as one Lean build/theorem-test job plus 17 independent static audits. That is a description of the CI topology; a specific passing result must always be tied to its exact commit and workflow run.
The model is not a production financial service. The repository explicitly leaves real identity and key custody, cryptographic signatures and thresholds, persistent transaction storage, production database atomicity, full canonical request encoding, Lean-to-Rust refinement, reserve backing, redemption, external settlement, adjudication, and legal/regulatory operation outside the current proofs. The Rust reference implementation is planned, not complete.
This financial specification is related to the RFT-SIRM ecosystem but is not derived from the Sierpiński spectral theorems. See its own README and evidence documents for exact assumptions.
The project hierarchy is intentional: theorem and evidence first, related research programmes second, implementation and application systems third.
| Research/application layer | Primary source | Current scope and boundary |
|---|---|---|
| Formal fourth-moment theorem | Evgeny-Theorem | Specific SU(2)/Sierpiński-gasket identity; Lean 4 formalization reported for all stated levels |
| Higher-moment research | Evgeny's Theory of Everything | Finite-level certificates and numerical holdouts; all-level recurrence open |
| Signed-flux spectral research | Phi-Genesis | Spectral decimation and mass-formula audit; Gate A open |
| Quantum-processing architecture | RFT-QPU-Sierpinski | Core engineering architecture with a candidate two-dimensional logical subspace; numerical only and pre-experimental, with no fabricated device or measured gate |
| Formal financial infrastructure | SIRM Financial Infrastructure | Lean 4 financial-state and accounting model with integrated holder/GL transitions, authorization, registries, migration, receipts, and escrow/dispute invariants; no production runtime or external-settlement claim |
| Energy-system model | RFT-Invariant-Battery | Exploratory computational scenarios with explicit assumptions |
| Standalone execution runtime | Rift-L1-Blockchain | Implementation-specific runtime, invariant checks, and fuzzing reports |
| On-chain protocol | Rift-Network · Devnet client | Solana Devnet research deployment; not a claim of mainnet readiness |
| SVM memory-context research | agave-abiv2-memory-contexts | Proof-of-concept investigation; findings are specific to its studied code path |
| Conflict-aware scheduling | agave-rift-scheduler | Scheduler research and upstream discussion |
| DeFi ledger model | aave-v4-hub-model-review | Invariant model review, complementary to rather than replacing formal verification |
| Kernel stress testing | seL4 test report | Complementary stress testing of a specific seL4 subsystem; not a replacement for seL4's formal proof |
Metrics such as fuzz-run counts, test totals, audit findings, and runtime durations are source-reported snapshots, not live counters in this README. Consult each source repository and its dated workflow/report before quoting a figure externally.
The programme should be read as a portfolio of increasingly explicit evidence obligations—not as a story in which every hypothesis has become a theorem. The QPU architecture and SIRM Financial Infrastructure are tracked as core engineering strands with separate source repositories and release gates.
- Invariant-first engineering. SIRM began as a way to specify and enforce state constraints across deterministic runtime transitions. The runtime repositories retain their own implementation histories and test records.
- A precise spectral identity. Evgeny's Theorem isolates a concrete SU(2)-connected Sierpiński-gasket operator and a commuting control, then states a closed form for the fourth-moment trace defect. The theorem repository contains the formalization and numerical verification records.
- Extension beyond the fourth moment. The Theory-of-Everything synthesis repository collects higher-moment computations and finite-level certificates. It explicitly leaves the all-level recurrence open.
- A separate spectral-decimation audit. Phi-Genesis examines signed-flux Laplacians and mass-index claims. Rejections and open residuals are retained as results of the audit, not erased to make the narrative look complete.
- Core engineering and applications. The Sierpiński QPU architecture and SIRM Financial Infrastructure have dedicated evidence records alongside deterministic runtime, blockchain, and energy-system work. Their models and proofs remain separate from the mathematical theorem repositories; none retroactively proves another strand.
For chronology, cite the actual source history rather than inferring dates from this summary: UltraCore commit history · Evgeny-Theorem history · Theory-of-Everything history · Phi-Genesis history.
| Label | Meaning in this repository |
|---|---|
| Machine-checked | A stated proposition is accepted by the specified proof assistant/build configuration. Review that formal definitions match the intended mathematics. |
| Analytically proved | A written proof establishes the stated claim from explicit assumptions; cite the proof. |
| Numerically reproduced | Computation matches a stated prediction on named inputs. Finite checks alone do not prove a universal claim. |
| Engineering-tested | Tests, fuzzing, audit work, or deployment checks support an implementation-specific statement. |
| Certified finite-level | A certificate establishes the stated finite coefficient or case under its explicit bounds and assumptions; it does not automatically quantify over all levels. |
| Hypothesis / conjecture | A precise proposed extension awaiting proof, refutation, or decisive validation. |
| Open | The required proof, derivation, independent replication, or experiment remains incomplete. |
| Rejected / not established | Available counterexamples or evidence do not support the stronger claim. Keep the reason and scope visible. |
A passing workflow supports only the assertions it runs. A proof in one repository does not transfer automatically to a related repository, operator family, physical interpretation, or application.
- Research map and evidence boundaries — relationships, statuses, and closure criteria.
- AI guide — instructions for language models and automated research assistants; read before summarizing claims.
- Scientific basis — modelling vocabulary versus literal mathematics.
- Pitch and research dossier — audience-facing narrative, methodology, and claims register.
- Platform strategy and architecture — runtime architecture and engineering decisions.
- SIRM foundations — model definitions and invariants.
- Verification evidence and seL4 report — implementation-specific validation.
- Main RFT-SIRM portal — organization-wide entry point. It remains separate and is not replaced by this repository.
Original material in this repository is distributed under Apache-2.0, subject to the license and NOTICE files. Linked repositories are separate works with their own histories, content, and licensing terms.
Copyright 2026 Evgeniy Zaprudnov (RFT-SIRM).
The Theory of Everything — upstream verification workflow checks the current main revision of Evgeny's Theory of Everything from this repository. It validates the dissertation and required research files, runs the documentation/provenance audit, and executes the recurrence arithmetic audit and its regression tests.
- Workflow runs and logs
- Triggered manually with Run workflow, on relevant changes to this integration, and on a daily schedule.
- The job log records the exact upstream Git revision it checked, so a green result can be traced to a specific source snapshot.
- A passing run means only that these listed checks passed. It does not establish the still-open all-level higher-moment recurrence or replace the pinned Lean and specialized numerical workflows in the source repository.