Open research library
Papers you can read, cite and question
612 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.
AI & knowledge papers 3 papers
Metascientists, research offices and AI-oversight researchers. What a claim is worth. Ignorance audits, epistemic repair and legibility, calibration and confidence, what an AI-assisted result actually establishes, consilience across fields, and research integrity as a measurable property.
Ultrametric. Non-Archimedean geometry: tree metrics, strong triangle inequality, hierarchical distance Tagged papers: 69.
Joint Bruhat–Tits Tree Product as a Testable Cross‑Domain Structure for Standard‑Model Mass Ratios, Quantum‑Error‑Correction Lattices, and Efimov Scaling
The Standard‑Model mass spectrum, Gottesman–Kitaev–Preskill (GKP) lattice spacings, and Efimov discrete‑scaling factor are each treated as empirical inputs, limiting predictive power. A conjectured universal geometry—the diagonal embedding of the product of Bruhat–Tits trees…
The Consilience of the QNFO Keyword Taxonomy: Ultrametric Structure as a Testable Compression Prior
The QNFO research program spans seven domains and maintains a canonical keyword taxonomy of 335 terms. This paper subjects the program's consilience claim to a computational audit of that vocabulary. The taxonomy is strictly partitional: 334 of 335 keywords occur in exactly one program, none in…
Proof-of-Concept for Auditable Attention using Ultrametric Tree Distances
The dominance of high-dimensional Euclidean vector spaces in contemporary transformer architectures has precipitated an interpretability crisis, as continuous geometric embeddings can obscure the causal mechanisms of semantic attention. This paper presents a formal proof-of-concept for a…
New papers by email
One short weekly digest: titles and links. No tracking; unsubscribe any time.