The Consilience of the QNFO Keyword Taxonomy: Ultrametric Structure as a Testable Compression Prior

In the paper's words

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 three or more.

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

1. The taxonomy contains no keyword shared by three or more programs; 99.7 percent of its keywords are program-local.

   from 1. Introduction

2. The coincidence of the load-bearing core with a bridge vocabulary is tested with a one-sided Fisher exact test on the 2 x 2 contingency table (bridge vs non-bridge by load-bearing vs local).

   from 3. Methods

3. Bound vocabulary sits in INM (10 keywords) and nowhere else.

   from 4.2 Layer 2 — the bridge families are concentrated, not shared

4. Family Programs containing >= 1 family keyword Keywords per program valuation UMP UMP 21 hierarchy SLB, RES, DEM SLB 2, RES 2, DEM 4 distinction SLB SLB 14 bound INM INM 10 Table 2.

   from 4.2 Layer 2 — the bridge families are concentrated, not shared

How it is done

1. First, the method is transferable: any multi-domain research organization that claims unity of structure can audit its own vocabulary the same way, with the same script, and the result is a number, not a narrative.

   from 1. Introduction

2. It is organized into seven program sections — UMP (ultrametric physics), SLB (laws of form), INM (infomatics), CFE (paradigm engineering), RES (consilience research), PLT (QWAV platform), DEM (interactive demos) — each with thematic subsections (core, geometry, methods, applications), followed by three cross-cutting themes (agentic AI, the 4-D distribution protocol, and measurement stratigraphy) and a set of search-query templates.

   from 2. The keyword taxonomy as data

3. The audit has four layers, all deterministic and all executed by a single script ( artifacts/verification/rq5_keyword_load.py , pure Python standard library, no randomness, no external dependencies).

   from 3. Methods

4. Bound vocabulary sits in INM (10 keywords) and nowhere else.

   from 4.2 Layer 2 — the bridge families are concentrated, not shared

What would falsify it

1. The RQ2 result (Section 4.6) is the direct empirical instance: raw-hash p-adic prefixes do not identify consilience links better than cosine at matched pair counts on either corpus, exactly as this limitation predicts.

   from 9. Limitations and open problems

2. Section 5's disconfirmation criterion for H2 is deliberately written to require that derivation rather than permit it to be assumed.

   from 9. Limitations and open problems

3. The paper states the revised claim, three falsifiable hypotheses with disconfirmation criteria, and three practitioner-facing deliverables, and it binds the strong form of the program to a 2028 decision point.

   from Abstract

Where the claim stops

1. This audit does not resolve the choice; it records it.

   from 9. Limitations and open problems

2. The RQ2 result (Section 4.6) is the direct empirical instance: raw-hash p-adic prefixes do not identify consilience links better than cosine at matched pair counts on either corpus, exactly as this limitation predicts.

   from 9. Limitations and open problems

3. Section 5's disconfirmation criterion for H2 is deliberately written to require that derivation rather than permit it to be assumed.

   from 9. Limitations and open problems

Where to read

1. Abstract215 words · 1 min
2. 1. Introduction403 words · 2 min
3. 2. The keyword taxonomy as data290 words · 1 min
4. 3. Methods315 words · 1 min
5. 4. Results1,150 words · 5 min
6. 5. The revised claim and its disconfirmation criteria340 words · 1 min
7. 6. Practitioner deliverables222 words · 1 min
8. 7. Where the premises end158 words · 1 min
9. 8. Related work289 words · 1 min
10. 9. Limitations and open problems373 words · 2 min
11. 10. Reproducibility191 words · 1 min