Convergence Encyclopedia: The OIP Mapping

PART 8: THE OIP MAPPING

Map the entire encyclopedia onto the OIP protocol structure. OIP provides: typed voxel graph (717 capabilities), append-only ledger, receipts, replay/repair, clarity review loop. This section defines how the encyclopedia becomes machine-readable within that structure.

8.1 The Voxel Schema

Each encyclopedia node becomes an OIP voxel. A voxel is a typed object with facets — not a flat record but a queryable, linkable, auditable entity.

Complete Facet Schema (machine-readable JSON)

{

"voxel_id": "C01",

"claim": "Sustained order exists only by consuming a gradient; complex structure is dissipative structure.",

"domains": ["physics", "chemistry", "biology", "ecology", "economics"],

"patterns": ["gradient_consumption", "dissipative_order", "negative_entropy"],

"mechanism": "Non-equilibrium thermodynamics: a system open to energy/matter flow can maintain spatiotemporal order by exporting entropy to its surroundings.",

"scale": "molecular → biosphere",

"claim_tier": "T1",

"tier_weight": 3,

"sources": [

{

"author": "Prigogine, I.",

"work": "Dissipative Structures. Nobel Lecture in Chemistry.",

"year": 1977,

"doi": "10.XXX/YYYY",

"verification_status": "VERIFIED",

"verified_by": "manual_check_2025_01_16",

"citation_depth": 1.0

},

{

"author": "Schroedinger, E.",

"work": "What Is Life?",

"year": 1944,

"chapter": "Order, Order and Negative Entropy",

"doi": "10.XXX/YYYY",

"verification_status": "VERIFIED",

"verified_by": "manual_check_2025_01_16",

"citation_depth": 1.0

}

],

"dual": "Thermodynamic equilibrium (heat death) — maximum entropy, no gradients to consume.",

"falsifier": "Observation of a durable complex structure maintaining itself with zero energy/matter throughput and no entropy export.",

"rival_frame": "Local order is merely a transient, statistically expected fluctuation in a universe trending toward equilibrium. No directional bias exists.",

"critics": [

{

"name": "Boltzmann",

"objection": "Fluctuation hypothesis: order is the tail of a random distribution",

"response": "Fluctuation theorem (Evans 1993) shows transient order decays; sustained order requires gradient coupling"

}

],

"independence_check": "HIGH",

"independence_score": 1.0,

"independence_evidence": "Prigogine (chemical kinetics, Brussels); Schroedinger (quantum biology, Dublin); England (statistical mechanics, MIT). Three fields, three continents, three decades, no borrowing chain.",

"pattern_type": "energetic",

"maps_to_axiom": ["A2", "A4"],

"convergence_edges": ["C19", "C06"],

"disconfirming_edges": [],

"nogos_applicable": ["N01"],

"nogos_limitation": "N01: No-Free-Lunch limits the efficiency of gradient consumption but not the pattern itself",

"citation_verified": true,

"verified_by": "manual_check_2025_01_16",

"convergence_strength": 9.0,

"load_bearing": true,

"created": "2025-01-16T00:00:00Z",

"last_amended": "2025-01-16T00:00:00Z",

"amendment_history": [],

"confidence": "HIGH",

"receipt_hash": "sha256:abc123..."

}

Facet Definitions

Facet

Type

Required

Description

voxel_id

string

Yes

Short identifier (C01–C25, N01–N07, F01–F15)

claim

string

Yes

Core claim, one compressed sentence

domains[]

string[]

Yes

Where the pattern appears (min 2 distinct)

patterns[]

string[]

Yes

Recurring invariants instanced

mechanism

string

Yes

Physics/math/engine underneath

scale

string

Yes

Level: quantum → cosmic

claim_tier

enum

Yes

T0–T5

tier_weight

int

Yes

T0=4, T1=3, T2=2, T3=1, T4=0.5, T5=0

sources[]

object[]

Yes

Author, work, year, DOI, verification_status, citation_depth

dual

string

Yes

Inversion — state that voids the pattern

falsifier

string

Yes

Observation that would kill the mapping

rival_frame

string

Yes

Best competing explanation, strongest form

critics[]

object[]

No

Named critics with objections and responses

independence_check

enum

Yes

HIGH / MODERATE / LOW

independence_score

float

Yes

1.0 (HIGH), 0.5 (MODERATE), 0.2 (LOW)

independence_evidence

string

Yes

Why this independence score was assigned

pattern_type

enum

Yes

structural / mathematical / energetic / biological / social / metaphorical

maps_to_axiom[]

string[]

Yes

A0–A12 from Total Structure

convergence_edges[]

string[]

Yes

Voxel IDs this node recurs-with

disconfirming_edges[]

string[]

Yes

Voxel IDs this node contradicts

nogos_applicable[]

string[]

Yes

Which no-go theorems apply

nogos_limitation

string

Yes

How the no-go limits this node

citation_verified

bool

Yes

Whether all citations have been checked

verified_by

string

Yes

Who/what performed verification

convergence_strength

float

Yes

Computed from formula; ≥6.0 = load-bearing

load_bearing

bool

Yes

Derived: strength ≥6.0 AND tier ≤T2

created

ISO8601

Yes

Creation timestamp

last_amended

ISO8601

Yes

Last modification timestamp

amendment_history[]

object[]

Yes

List of amendments: what, when, by whom, receipt_hash

confidence

enum

Yes

HIGH / MODERATE / LOW / UNCERTAIN

receipt_hash

string

Yes

SHA-256 hash of the receipt for this voxel’s last state

Voxel Type Hierarchy

voxel/

├── node/ # Convergence pattern or no-go theorem

│ ├── pattern/ # C01–C25

│ ├── nogo/ # N01–N07

│ └── meta/ # Meta-nodes (Wigner Residue, Independence Graph)

├── edge/ # Relationships between nodes

│ ├── recurs-with/ # Same pattern, different domain

│ ├── contradicts/ # Tension relationship

│ ├── instantiates/ # Specific → general

│ └── limits/ # No-go → pattern limitation

├── research/ # Future pursuit items

│ └── direction/ # F01–F15

└── audit/ # Verification records

├── citation/ # Citation verification events

├── independence/ # Independence assessment events

└── amendment/ # Amendment records

8.2 The Edge Schema

Convergence is a graph, not a list. Edges carry typed, weighted, directed relationships.

Complete Edge Schema (machine-readable JSON)

{

"edge_id": "E01",

"edge_type": "recurs-with",

"source": "C01",

"target": "C19",

"type_label": "recurs-with",

"shared_pattern": "gradient_consumption",

"description": "Thermoeconomics (C19) is gradient dissipation (C01) applied to economic systems. Both describe sustained order through entropy export.",

"domain_distance": "physics → economics",

"derivation_independence": "HIGH",

"independence_evidence": "Prigogine derived dissipative structures from chemical kinetics; Georgescu-Roegen derived thermoeconomics from economic theory. No citation chain between them.",

"convergence_strength": 7.5,

"identity_or_evidence": "evidence",

"identity_claim": null,

"evidence_basis": "Both predict that sustained economic/physical order requires entropy export to surroundings. Both predict heat death as equilibrium state.",

"nogos_affected": ["N01"],

"nogo_impact": "N01 limits the efficiency of gradient consumption but does not prevent the pattern from holding",

"citation_support": [

"Prigogine 1977 → Schneider & Kay 1994",

"Georgescu-Roegen 1971 → Ayres 1998"

],

"verified": true,

"verified_by": "manual_check_2025_01_16",

"created": "2025-01-16T00:00:00Z",

"receipt_hash": "sha256:def456..."

}

Edge Type Definitions

Edge Type

Direction

Meaning

Example

recurs-with

Undirected

Same pattern, different domain

C01 ↔ C19 (dissipation ↔ thermoeconomics)

contradicts

Undirected

Tension relationship

C03 ↔ C04 (symmetry ↔ symmetry-breaking)

instantiates

Directed

Specific instance of general pattern

C01a (SGD) instantiates C01 (dissipation)

limits

Directed

No-go limits pattern

N01 → C15 (NFL limits optimization universalism)

derives-from

Directed

Intellectual inheritance

C06 (Shannon) ← C06 (Boltzmann) — LOW independence

enables

Directed

One pattern makes another possible

C20 (computation) enables C08 (recursion)

in-tension-with

Undirected

Competing interpretations

C21 (emergence) ↔ N05 (computational irreducibility)

Edge Weight Computation

Convergence_Edge_Weight(E) = pattern_similarity(E) × derivation_independence(E) × citation_quality(E) × nogo_discount(E)

Where:

pattern_similarity: 0–1, assessed by human expert or embedding similarity

derivation_independence: 1.0 (HIGH), 0.5 (MODERATE), 0.2 (LOW)

citation_quality: 0–1, based on citation depth and verification status

nogo_discount: 1.0 (no nogos), 0.7 (nogo partially limits), 0.3 (nogo severely limits), 0.0 (nogo kills edge)

An edge is LOAD-BEARING if weight ≥ 0.5 and both endpoints are load-bearing nodes.

8.3 The Receipt Pattern

The catalogue enforces its own proof rule through a recursive receipt structure. This is A11 (Receipt) operationalized.

The Proof Chain

Every claim → receipt (source)

Every receipt → verification (DOI or stable identifier)

Every verification → audit (clarity review loop)

Every audit → amendment (if falsified) or confirmation (if survives)

The amendment → new receipt → the recursion continues

Receipt Structure

{

"receipt_id": "R-C01-20250116-001",

"receipt_type": "citation_verification",

"parent_voxel": "C01",

"claim": "Prigogine (1977) Nobel Lecture established dissipative structures",

"proof": {

"type": "doi_resolution",

"doi": "10.XXX/YYYY",

"resolved_to": "Prigogine, I. (1977). Time, structure and fluctuations. Nobel Lecture.",

"resolver": "crossref_api",

"resolution_timestamp": "2025-01-16T12:00:00Z",

"match_status": "CONFIRMED"

},

"review": {

"reviewer": "clarity_review_loop",

"review_type": "automated_citation_check",

"result": "PASSED",

"findings": "DOI resolves to cited work; author, year, and title match",

"review_timestamp": "2025-01-16T12:05:00Z"

},

"audit": {

"audit_type": "spot_check",

"auditor": "human_verifier_1",

"result": "CONFIRMED",

"audit_timestamp": "2025-01-16T14:00:00Z"

},

"amendment": null,

"previous_receipt": null,

"receipt_hash": "sha256:f0a1b2...",

"ledger_index": 1547,

"ledger_timestamp": "2025-01-16T14:00:00Z"

}

The Amendment Receipt

When a claim is falsified or corrected, the amendment itself generates a receipt:

{

"receipt_id": "R-C01-20250116-002-AMENDMENT",

"receipt_type": "amendment",

"parent_voxel": "C01",

"parent_receipt": "R-C01-20250116-001",

"claim": "C04 source year corrected: Anderson 1963 (not 1958)",

"proof": {

"type": "primary_source_check",

"source_verified": "Anderson, P.W. (1963). Plasmons, gauge invariance and mass. Phys. Rev. 130, 439.",

"verification_method": "direct_pdf_extraction",

"match_status": "CORRECTED"

},

"review": {

"reviewer": "clarity_review_loop",

"review_type": "amendment_review",

"result": "APPROVED",

"findings": "Correction is accurate; original entry was wrong; amendment closes the error"

},

"audit": {

"audit_type": "amendment_audit",

"auditor": "human_verifier_2",

"result": "CONFIRMED",

"note": "Verified against primary source; correction is accurate"

},

"amendment": {

"field_changed": "sources[0].year",

"old_value": "1958",

"new_value": "1963",

"reason": "Original citation had wrong year; Anderson 1958 is a different paper (impurity states); Anderson 1963 is the symmetry-breaking paper",

"confidence": "CERTAIN"

},

"previous_receipt": "R-C01-20250116-001",

"receipt_hash": "sha256:c3d4e5...",

"ledger_index": 1548,

"ledger_timestamp": "2025-01-16T15:30:00Z"

}

The Recursive Property

Each receipt references its parent (the claim it proves or the receipt it amends). The chain terminates at: 1. Primary source receipts: DOI resolves to a published work 2. Mathematical proof receipts: A formal proof verified by a proof checker 3. Empirical observation receipts: Raw data with provenance chain

The chain is append-only: receipts are never deleted, only amended. The ledger (Pattern 06 at machine scale) guarantees that every state of every voxel is recoverable. This is the recursion (A12): the system revises itself while preserving complete history.

Receipt → Ledger Binding

Every receipt is appended to the OIP ledger with: - Sequential index (no gaps, no forks) - Timestamp (append-order, not wall-clock — no retroactive insertion) - Hash chain: receipt N contains hash(receipt N-1), creating an immutable linked structure - The ledger itself has a receipt: a meta-receipt attesting to the ledger’s integrity

Ledger Entry N:

index: N

timestamp: T_N

receipt_hash: SHA256(receipt_content_N)

previous_hash: SHA256(receipt_content_N-1)

content: {receipt JSON}

This is a Merkle chain, not a blockchain — no consensus mechanism, no proof of work. The binding is cryptographic (tamper-evident) and sequential (order-evident). A single custodian can maintain it; multiple operators can cross-verify.

8.4 The OIP Invocation Map

How each part of the encyclopedia is accessed through OIP invocations.

Node Lookup

GET /node/{id}

→ returns voxel with all facets populated

→ includes computed convergence_strength and load_bearing flag

→ includes amendment history

→ receipt_hash verifiable against ledger

Example: GET /node/C01

→ Full C01 voxel (gradient dissipation)

→ sources with verification_status

→ independence_check with evidence

→ nogos_applicable with limitation text

Edge Traversal

GET /node/{id}/edges?type={type}&min_strength={n}

→ returns all edges connected to voxel {id}

→ optional: filter by edge type

→ optional: filter by minimum convergence strength

→ edges include full weight computation breakdown

Example: GET /node/C01/edges?type=recurs-with&min_strength=5.0

→ Edges from C01 to C19 (thermoeconomics), C06 (information), etc.

→ Each edge includes independence_evidence

Convergence Query

GET /convergence?pattern={pattern}&min_strength={n}&domains={domains}

→ returns all Venn points: nodes where the same pattern appears in multiple domains

→ optional: filter by minimum convergence strength

→ optional: filter by domain set

→ results sorted by convergence_strength descending

Example: GET /convergence?pattern=gradient_consumption&min_strength=6.0

→ C01 (physics, chemistry, biology, ecology, economics)

→ C19 (thermoeconomics)

→ Ranked by computed strength

No-Go Check

GET /node/{id}/nogos

→ returns all no-go theorems that apply to voxel {id}

→ includes: how the no-go limits the node, the severity of the limitation

→ cross-references the constraint matrix (F10)

Example: GET /node/C15/nogos

→ N01 (No-Free-Lunch): severely limits — optimization universalism is impossible

→ N02 (Arrow): moderate — multi-objective convergence may be constrained

→ N03 (Gödel): low — optimization is computational, not formal-systemic

Tier Filter

GET /nodes?tier_max={T}&load_bearing={bool}&pattern_type={type}

→ returns all nodes meeting filter criteria

→ load_bearing=true returns only structurally critical nodes

→ pattern_type filters by category

Example: GET /nodes?tier_max=T2&load_bearing=true&pattern_type=energetic

→ C01 (gradient dissipation)

→ All energetic, load-bearing, T0–T2 nodes

School Lookup

GET /school/{name}

→ returns all pattern instances attributed to a school of thought

→ includes: which patterns they instantiate, convergence strength, independence score

→ cross-references Part 2–4 school mappings

Example: GET /school/cybernetics

→ C07 (feedback/homeostasis) — primary instantiation

→ C08 (recursion) — via von Neumann self-replicator

→ C12 (autopoiesis) — via Maturana/Varela

→ Independence flags: Macy cluster = LOW for C07

Future Pursuit Query

GET /research?horizon={h}&priority_max={n}&status={s}

→ returns future pursuit items matching criteria

→ status: pending / active / completed / blocked

Example: GET /research?horizon=immediate&priority_max=3

→ F01 (citation audit), F02 (independence graph), F03 (memory deep-dive)

Audit Trail

GET /audit/{voxel_id}

→ returns complete amendment history for a voxel

→ every change, who made it, when, with receipt hashes

→ the full proof chain from claim → receipt → audit → amendment

Example: GET /audit/C04

→ Original: Anderson 1958

→ Amendment: Anderson 1963

→ Both with receipt hashes, verifier IDs, timestamps

Meta-Queries

GET /stats

→ encyclopedia statistics: total nodes, load-bearing count,

average convergence strength, citation verification rate,

independence distribution, no-go coverage

GET /graph/summary

→ graph metrics: number of nodes, edges, connected components,

clustering coefficient, average path length, hub nodes

GET /convergence/score

→ overall convergence score: average strength of load-bearing nodes

weighted by independence and citation quality

trend over time (as amendments improve scores)

GET /wigner/residue

→ the Wigner Residue entry: what survives every deflation

classification of proposed answers with no-go constraints

the encyclopedia's founding gap, if any

Invocation Receipt

Every API call generates a receipt:

{

"invocation_id": "INV-20250116-001",

"endpoint": "GET /node/C01",

"parameters": {},

"response_hash": "sha256:resp789...",

"timestamp": "2025-01-16T16:00:00Z",

"latency_ms": 47,

"status": "200 OK",

"receipt_hash": "sha256:inv012..."

}

This is the machine-scale version of Pattern 07 (Feedback): every query generates a response, every response generates a receipt, every receipt is auditable. The invocation graph itself becomes data for convergence analysis: which nodes are queried most (hub patterns), which paths are traversed most (dominant convergence routes), where queries fail (knowledge gaps).

Part 8 Summary: The encyclopedia is fully mappable to OIP. Every node is a typed voxel with 28 facets. Every edge is a typed, weighted relationship with independence scoring. Every claim generates a receipt; every receipt is verified, audited, and amendable. The API provides 10 query patterns covering all access modes. The system is autopoietic: it produces the receipts that audit the system that produces it.

APPENDICES

---

Corpus map

• Previous: Convergence Encyclopedia: The Future Pursuit Map
• Next: Convergence Encyclopedia: Appendix A: Citation Audit Log
• Encyclopedia start: The Schema
• Kin corpora: Total Structure · Signature of the Grain