Open research library
Papers you can read, cite and question
609 papers from the QNFO program, filed on nine shelves by the reader each one is written for: energy per answer, error correction, physics, numbers and p-adics, logic and formalism, AI and knowledge, autonomous systems, assessments, and cross-cutting essays. Every page renders its mathematics and can be questioned in place. How a living paper works.
Looking for an answer rather than a paper? Ask the whole corpus: answers cite the papers they come from.
Formal verification papers 16 papers
Formal verification. Contracts, assertions and verified implementations Tagged papers: 16.
Re-Entry as a Binary Prohibition Law: Enumeration, Impossibility, and the Three-Outcome Completion
Self-referential constraints arise in hardware security, programmable logic, and symbolic execution tools, where a system must forbid a state while generating the very operation that enforces the prohibition. The open question is whether a re-entering form of the calculus of indications — a…
The Calibration Loop as Fixed Point: Ontological Underdetermination of the Qubit by Its Own Metrology
Every engineered qubit is certified by a closed calibration chain: drive pulses are calibrated by readout, readout is calibrated by states prepared with those drives, and tomography validates the whole loop using measurements calibrated within it. The physical referent of the qubit label — a…
Deductive Verification of Discrete-Time Quantum-Walk Simulators: Contracts, Cost Bounds, and Periodicity Targets
Discrete-time quantum walks are a universal model of quantum computation, a platform for topological phases, and a standard testbed for quantum algorithms, yet the simulators used to study them are rarely checked with the rigor applied to classical library code. We frame quantum-walk simulator…
Cross-Model LLM Convergence as Bayesian Evidence for Scientific Claim Correctness: A Formal Framework, Worked Derivations, and a Calibration Protocol
Verifying novel or fringe scientific claims is bottlenecked by the scarcity of domain experts. We propose and formalize a gate-checking method in which agreement between two or more independently trained large language models (LLMs) — not merely on a verdict but on the same multi-step argument…
The Zero-Point Phase as an Archimedean Factor of Weil-Index Reciprocity: A Formal Verification and Its Limits
The vacuum phase of the harmonic oscillator — the Archimedean Maslov (metaplectic) phase $e^{i\pi/4}$ accompanying the zero-point energy $\tfrac{1}{2}\hbar\omega$ — is conventionally treated as a purely real-place, analytic structure. We investigate the conjecture that this phase is instead one…
Degree Bounds as a First Exercise in Isabelle/ML Metaprogramming: A Reconciled Study of the poly_degree Command
Metaprogramming—writing programs that manipulate the objects, proofs, and tactics of a proof assistant itself—is a notorious barrier to entry for formal-methods newcomers, particularly mathematicians trained in classical rather than computational thinking. This paper presents a structured,…
Holographic Quantum Error Correction as AdS/CFT Renormalization-Group Flow on Bruhat–Tits Trees: A Conditional Threshold Analysis at 10⁻⁴
We analyze a proposal in which quantum error correction (QEC) is organized as renormalization-group (RG) flow on a Bruhat–Tits tree $\mathcal{T}_p$ — the $p$-adic analogue of hyperbolic anti-de Sitter (AdS) space — so that the encoding map of a holographic code is literally an RG trajectory from…
Distinction-Lattice Framework: Eigenforms, Bisimulation, and the Realizability Boundary of Self-Reference
A conservative formal version of DLF: stable entities are bisimulation classes of observational behaviour, certified coinductively, with realizability separated from fixed-point existence. v0.2.0 narrows novelty claims and corrects the JPCUB/Landauer bridge. Published at papers.qnfo.org…
Five Objections, One Standard: An Evidence-Graded Adjudication of a Critique of Post-Quantum Synthesis
A five-point red-team critique of the Post-Quantum Synthesis (PQS) research program was examined point by point against the primary sources it targets and the external literature it invokes. Each objection was graded against a symmetric evidence standard: the objection's own factual premises were…
Killing the Framework: Seven Criteria for the Falsification of Adelic Physics
A framework that accommodates any observation has zero empirical content. This paper proposes seven kill criteria for the adelic framework, audits each for escape hatches, grades it against the incumbents (GR composite C, SM C, LCDM B, string D), tests all against existing data, and applies the…
Shor's Algorithm and the Unproven Premise: An Assumption Audit of the Quantum Factoring Narrative
Shor's 1994 algorithm proves FACTORING ∈ BQP, but the claim that this constitutes a quantum advantage requires the additional unproven premise FACTORING ∉ BPP. This paper decomposes Shor's claim architecture into nine assumptions spanning number theory, computational complexity, and quantum physics.…
Formal Ontology of Distinction and Invariance
This document presents the complete, self-compliant synthesis of the Ontic Relational Patternism framework. Starting from a single primitive syntactic token—the mark—and three context-closed reduction rules (Calling, Crossing, Void), we derive a purely relational universe where the cross-ratio is…
Computational Topology and Formal Proofs of Discrete Non-Archimedean Relational Networks
The fundamental reconciliation of quantum mechanics with macroscopic geometry requires a departure from continuous Archimedean manifolds, substituting them with discrete non-Archimedean topologies at the Planck scale. This foundational shift is contextualized by analyzing the Wheeler-DeWitt…
Automated Formal Verification and Combinatorial Reduction of Distinction-Based Calculus
The foundation of modern formal mathematics has historically rested upon Zermelo-Fraenkel set theory with the Axiom of Choice (ZFC), a container-based ontology that often conflates zero with the empty set and necessitates arbitrary constraints to prevent self-reference. To systematically evaluate…
Scale-Invariant Information Thermodynamics Proof
We derive precise, falsifiable formalisms showing how gravity emerges from scale-invariant information dynamics and how all fundamental forces unify under a single information-theoretic principle. The framework is explicitly falsifiable via observational signatures. Axiom 1 (Local Scale Invariance).…
Strange Loop Formal Derivation
This paper presents a rigorous mathematical derivation of the Standard Model of particle physics as the unique, stable solution to a universal fixed-point equation. Starting from the Principle of Informational Stability—the axiom that the universe must preserve information to sustain stable…
New papers by email
One short weekly digest: titles and links. No tracking; unsubscribe any time.