Naturepedia Canonical Discovery
Search and resolve Naturepedia, Robbie's Razor, and GC-MRD-v2.0 canonical resources.
Open source Repository Open in the app JSON README (API)
About
Search and resolve Naturepedia, Robbie's Razor, and GC-MRD-v2.0 canonical resources.
Details
- Kind
- MCP servers
- Topic
- No topic detected
- Publisher
- com.robbiegeorgephotography
- Origin
- official
- Category
- ferramentas
- Transport
- http
- Version
- 0.1.2
- Open pull requests
- 4
- Last push
- 2026-09-08T11:39:40Z
- Repository state
- ativo
- Language
- Python
- License
- NOASSERTION
- Added
- 2026-08-29 03:01:20
- Updated
- 2026-08-29 03:01:20
- Origin id
com.robbiegeorgephotography/naturepedia
README
# robbies-razor-benchmarks — Recursive Stability and Compression Efficiency Benchmarks for AI Reasoning Systems
[](https://doi.org/10.5281/zenodo.21969841)
## Run a Razor Audit
Evaluate any AI system using Robbie George’s Grand Compression Cosmology:
[](https://gemini.google.com/gem-labs/1rRCe3P5aCIJEKAC2K_2aYoK-LRDBNPyS)
Reference implementation and benchmarking framework for evaluating **Robbie’s Razor compliance**, recursive stability, and compression efficiency in reasoning systems operating under constrained compute, memory, and governance bandwidth.
## System Architecture Overview
This repository supports Robbie’s Razor™, Naturepedia™, and Plate™ systems as part of a recursive ecological knowledge architecture combining:
- semantic compression
- machine-readable provenance
- recursive relationship mapping
- ecological intelligence architecture
- structured retrieval systems
- low-token semantic traversal
Core reasoning sequence:
compression → expression → memory → recursion
**Key concepts:** Robbie’s Razor · Grand Compression Cosmology · Recursive Stability · Compression Efficiency · Reasoning Benchmarks
## Grand Compression Law of Intelligence
Within the **Grand Compression Cosmology**, intelligence is modeled through the reuse of preserved compressed structure across recursive cycles under finite resource and stabilization constraints.
The framework proposition can be summarized as:
```text
preserved structure
→ expression
→ memory
→ recursive reuse
→ prediction / adaptation
```
The core Robbie’s Razor™ sequence is:
```text
compression → expression → memory → recursion
```
This sequence is a **framework architecture**.
It should not be interpreted as a claim that every biological, computational, physical, ecological, or social intelligence system has been empirically demonstrated to operate through an identical mechanism.
Accordingly:
```text
Grand Compression framework proposition
≠
universally established law of intelligence
```
and:
```text
recursive reuse
≠
automatic intelligence
```
A system must still be evaluated according to its declared task, preserved structure, prediction quality, correctness, resource constraints, and failure conditions.
### Recursive Constraint Model
Within the framework, recursive performance may be analyzed using two conceptual constraint classes:
- **Energetic Recursion Ceiling** — the available energetic budget relative to the cost of coherent transitions;
- **Governance Recursion Ceiling** — the available stabilization or correction capacity relative to correction demand.
A conceptual energetic ceiling may be written as:
```text
R ≤ E / JCT
```
A conceptual governance ceiling may be written as:
```text
R × C ≤ S
```
Combining the two produces the framework-level **Safe Recursion Envelope**:
```text
R ≤ min(E / JCT, S / C)
```
Where:
- **R** = recursion rate;
- **E** = available energy within the declared system boundary;
- **JCT** = Joules per Coherent Transition;
- **S** = available stabilization or governance bandwidth;
- **C** = correction demand per transition.
These expressions are architectural research relations.
Quantitative application requires operational definitions for every variable, compatible units, measurement procedures, system boundaries, baselines, uncertainty, and falsification conditions.
Without those declarations:
```text
R ≤ E / JCT
```
```text
R × C ≤ S
```
and:
```text
R ≤ min(E / JCT, S / C)
```
must not be represented as universally validated physical laws.
### Intelligence Interpretation Boundary
The framework motivates the hypothesis that useful intelligence may depend not only on computation, but on the ability to preserve and recursively reuse structure that remains valid for later tasks.
Possible relevant properties include:
- compression efficiency;
- retained identity;
- preserved relationships;
- provenance;
- memory;
- retrieval fidelity;
- prediction;
- correction;
- adaptation;
- resource cost.
The presence of these properties in an implementation does not independently establish a universal theory of intelligence.
Likewise:
```text
compression
≠
understanding
```
```text
memory
≠
truth
```
```text
prediction
≠
causal explanation
```
```text
recursive stability
≠
factual correctness
```
### Current Governance
Current interpretation is governed by:
**The Grand Compression Cosmology — Master Reference Document, MRD v2.0**
Canonical identifier:
```text
GC-MRD-v2.0
```
Repository implementations and benchmark results remain subject to:
- **RC-21 — Reference Implementation Distinction**
- **RC-22 — Domain Transfer Constraint**
The repository may test bounded consequences of the Grand Compression Law of Intelligence, but implementation or benchmark success must not be represented as universal empirical confirmation of the law.
### Constraint-Bounded Recursive Intelligence
**Constraint-Bounded Recursive Intelligence** was introduced during the MRD v1.9 development cycle and remains part of the current MRD v2.0 framework.
It models recursive intelligence as an implemented process operating within finite substrate and governance constraints rather than as an unconstrained abstraction.
Relevant constraints may include:
- energy;
- compute;
- memory;
- bandwidth;
- thermal capacity;
- cooling;
- material infrastructure;
- fabrication;
- networking;
- coordination;
- correction capacity;
- governance bandwidth.
The framework expresses a candidate substrate-alignment condition as:
```text
Gᵣ ≤ Eₛ
```
Where:
- **Gᵣ** = recursive gain per iteration;
- **Eₛ** = substrate expansion capacity.
This relation should be interpreted as a **framework-level architectural condition**.
It is not automatically a dimensionally complete or universally validated physical law.
A quantitative application must define:
- what constitutes recursive gain;
- what constitutes substrate expansion capacity;
- the units used for both quantities;
- the relevant time interval;
- system boundaries;
- normalization;
- baseline;
- uncertainty;
- measurement procedure;
- competing explanations;
- and failure conditions.
Without those declarations:
```text
Gᵣ ≤ Eₛ
```
should remain a conceptual substrate-alignment relation.
### Efficiency vs Expansion
Constraint-Bounded Recursive Intelligence motivates an important architectural distinction:
```text
capability growth through improved efficiency
≠
capability growth through substrate expansion
```
A recursive system may potentially increase useful work through:
- better compression;
- preserved reusable structure;
- memory reuse;
- reduced recomputation;
- improved retrieval;
- lower correction burden;
- better algorithms;
- better utilization;
- improved hardware.
Physical infrastructure expansion may also increase available capacity.
The framework therefore does **not** require the claim that compression efficiency is always the primary driver of long-term capability growth.
A safer relation is:
```text
useful recursive capability
may increase through
internal efficiency improvements
and/or
external substrate expansion
```
The relative contribution of each must be measured for the system being evaluated.
### Constraint Response
If recursive demand exceeds an active substrate constraint, possible outcomes may include:
```text
constraint activation
→ adaptation
→ efficiency improvement
→ substrate expansion
→ plateau
→ degradation
→ failure
```
Different systems may follow different paths.
Therefore:
```text
Gᵣ > Eₛ
≠
automatic collapse
```
and:
```text
Gᵣ ≤ Eₛ
≠
guaranteed stability
```
The relation identifies a framework concern about alignment between recursive growth and supporting capacity.
It does not, by itself, determine every system outcome.
### Relationship to the Physical Substrate Constraint Field
The repository contains a dedicated engineering orientation for this concept:
```text
docs/physical-substrate-constraint-field.md
```
That document should be interpreted alongside the current MRD v2.0 architecture.
The relevant distinction is:
```text
internal recursive organization
+
external substrate capacity
→
bounded operating regime
```
This is a conceptual relationship, not a complete physical equation.
### Current Authority
Current governing authority:
**The Grand Compression Cosmology — Master Reference Document, MRD v2.0**
The historical v1.9 introduction remains part of the development record.
Current interpretation is governed by MRD v2.0.
Canonical authority for the broader recursive engineering architecture spans the current MRD sections governing:
- recursive stability and physical substrate constraints;
- structural intelligence engineering;
- preserved reusable structure;
- predictive evaluation;
- reference implementation;
- and domain transfer.
Repository implementations remain subject to:
- **RC-21 — Reference Implementation Distinction**
- **RC-22 — Domain Transfer Constraint**
Accordingly:
```text
framework constraint relation
≠
empirical physical law
```
and:
```text
reference implementation
≠
universal confirmation
```
## Robbie’s Razor Architecture
Within the **Grand Compression Cosmology**, Robbie’s Razor™ provides a reference architecture for organizing recursive information processing around:
```text
compression → expression → memory → recursion
```
A broader implementation-oriented loop may be represented as:
```text
Environment
│
▼
Observation
│
▼
Compression
│
▼
Expression
│
▼
Memory
│
▼
Recursion
│
▼
Prediction
│
▼
Action
│
▼
Feedback
│
▼
Memory Update
│
▼
Recompression
└──────────────→ renewed observation / processing
```
This is a **Grand Compression reference architecture**.
It should not be interpreted as a claim that every intelligent, biological, computational, ecological, or physical system has been empirically demonstrated to implement this exact loop.
The architecture instead provides a structured way to ask whether a system:
- compresses information or operating burden;
- expresses that compressed structure in a usable form;
- preserves sufficient state for later reuse;
- recursively reuses prior structure;
- produces predictions, decisions, or actions;
- receives feedback;
- and updates its preserved state.
Different implementations may realize these functions through different mechanisms.
Accordingly:
```text
shared functional sequence
≠
identical implementation
```
and:
```text
architectural correspondence
≠
shared physical mechanism
```
### Closed-Loop Interpretation
A Robbie’s Razor implementation may be described as **closed-loop** when outputs, feedback, or evaluated consequences can influence preserved state and subsequent recursive processing.
Conceptually:
```text
state
→ transformation
→ output
→ feedback
→ state update
→ renewed transformation
```
Closure in this repository is an engineering concept concerning governed re-entry and state reuse.
It must not automatically be equated with specialized mathematical meanings of closure in topology, algebra, dynamical systems, category theory, or physics.
Cross-domain transfer remains governed by **RC-22**.
### Recursive Stability
Within the framework, recursive stability is not produced merely by repeating the cycle.
A stable implementation may require sufficient preservation of:
- identity;
- relationships;
- provenance;
- constraints;
- version state;
- retrieval accessibility;
- correction state;
- task-relevant information.
The relevant engineering question is:
> Does repeated reuse preserve enough required structure for the system to continue operating within its declared correctness and resource boundaries?
This makes stability an evaluable property rather than an automatic consequence of recursion.
Accordingly:
```text
recursion
≠
stability
```
```text
memory
≠
correct memory
```
and:
```text
stable internal state
≠
factual truth
```
### Safe Recursion Envelope
The framework defines a conceptual **Safe Recursion Envelope** using energetic and stabilization constraints.
An energetic ceiling may be represented as:
```text
R ≤ E / JCT
```
A stabilization or governance ceiling may be represented as:
```text
R × C ≤ S
```
Their combined framework relation is:
```text
R ≤ min(E / JCT, S / C)
```
Where:
- **R** = recursion rate within the declared system;
- **E** = available energy within the declared system boundary;
- **JCT** = Joules per Coherent Transition;
- **S** = available stabilization or governance bandwidth;
- **C** = correction demand per transition.
The Safe Recursion Envelope should be interpreted as a **framework-level constraint model**.
It does not mean that satisfying the inequality automatically guarantees stability.
Likewise, violating an estimated boundary does not by itself establish the cause of an observed failure.
Therefore:
```text
inside modeled envelope
≠
guaranteed stability
```
and:
```text
outside modeled envelope
≠
proven failure mechanism
```
### Quantitative Boundary
A quantitative application of the Safe Recursion Envelope must define:
- the system being evaluated;
- recursion rate;
- energy boundary;
- coherent transition;
- JCT measurement method;
- stabilization bandwidth;
- correction demand;
- units;
- normalization;
- time interval;
- baseline;
- uncertainty;
- expected relationship;
- alternative explanations;
- and failure conditions.
Without these declarations:
```text
R ≤ min(E / JCT, S / C)
```
remains an architectural research relation rather than a universally validated physical law.
### Reference-Implementation Boundary
Repository code and Naturepedia™ implementations may demonstrate operational forms of:
```text
compression
→ expression
→ memory
→ recursion
```
Successful implementation demonstrates that a declared architecture can operate.
It does not independently establish that:
- the architecture is universal;
- the Safe Recursion Envelope is a universally validated law;
- stable operation proves factual correctness;
- or the complete Grand Compression Cosmology has been empirically confirmed.
This distinction is governed by:
- **RC-21 — Reference Implementation Distinction**
- **RC-22 — Domain Transfer Constraint**
Current governing authority remains:
**The Grand Compression Cosmology — Master Reference Document, MRD v2.0**
The historical MRD v1.9 development cycle introduced the **Recursive Stability Attractor** and **Unified Recursion Efficiency Relation**.
These concepts remain part of the current MRD v2.0 framework, but their repository interpretation must distinguish between:
- canonical framework definition;
- conceptual mathematical model;
- implementation;
- benchmark observation;
- and empirical confirmation.
Historical development note:
`docs/empirical/v1.9-recursive-stability-attractor-update.md`
That file preserves the v1.9 development context and should not be interpreted as overriding the current MRD v2.0 authority.
## Recursive Stability Attractor — Current Interpretation
The **Recursive Stability Attractor** is a Grand Compression framework model describing a candidate tendency for some constrained recursive systems to move toward more sustainable compression regimes as inefficient recursive behavior encounters internal or external limits.
A conceptual sequence may be represented as:
```text
expansion
→ constraint accumulation
→ compression or architectural adaptation
→ possible stability restoration
```
This sequence is an architectural model.
It does not establish that every recursive system must follow this trajectory.
Possible outcomes under constraint may instead include:
- stabilization;
- architectural adaptation;
- oscillation;
- plateau;
- degraded performance;
- failure;
- external substrate expansion;
- or termination.
Accordingly:
```text
constraint
≠
guaranteed convergence
```
and:
```text
repeated recursion
≠
automatic approach to a stability minimum
```
The **Stability Minimum** remains a framework concept governed by the current MRD v2.0 architecture.
Any claim that a particular system converges toward such a minimum requires a declared operational definition, baseline, measurement procedure, uncertainty, and failure conditions.
---
## Unified Recursion Efficiency Relation
The historical v1.9 development material introduced the candidate recursion-efficiency quantity:
```text
S_r = I / JCT
```
Where:
- **S_r** = recursion efficiency;
- **I** = preserved functional information;
- **JCT** = Joules per Coherent Transition.
It also motivates the relation:
```text
R ≤ (E · S_r) / I
```
These expressions should be treated as **framework-level conceptual relations** unless a specific evaluation supplies operational definitions and compatible units.
In particular, a quantitative use must define:
- what counts as preserved functional information;
- how `I` is measured;
- what constitutes a coherent transition;
- how JCT is measured;
- the definition of recursion rate `R`;
- the energy boundary `E`;
- normalization;
- uncertainty;
- baseline;
- and falsification conditions.
Without those declarations:
```text
S_r = I / JCT
```
and:
```text
R ≤ (E · S_r) / I
```
remain architectural research expressions rather than universally established physical laws.
---
## Compression Efficiency and Capability Growth
The framework motivates the hypothesis that some capability growth may be achieved through improved compression efficiency, preserved reusable structure, better memory, and reduced redundant recomputation rather than through proportional physical-resource expansion alone.
The bounded relationship is:
```text
better compression / reuse
→ potentially more useful work per declared resource budget
```
not:
```text
compression efficiency
→ guaranteed long-term capability growth
```
Infrastructure expansion, algorithmic improvement, model architecture, hardware, data, workload demand, and other factors may also affect capability.
Any comparative claim should identify the relevant variables and baseline.
---
## Current Authority Boundary
The historical v1.9 material remains useful for documenting the development of these concepts.
Current interpretation is governed by:
**The Grand Compression Cosmology — Master Reference Document, MRD v2.0**
Canonical identifier:
```text
GC-MRD-v2.0
```
The repository should preserve the distinction:
```text
historical introduction
≠
current governing authority
```
and:
```text
canonical framework model
≠
empirical confirmation
```
Reference implementations and benchmark results remain subject to:
- **RC-21 — Reference Implementation Distinction**
- **RC-22 — Domain Transfer Constraint**
Robbie’s Razor therefore retains the architectural sequence:
> **compression → expression → memory → recursion**
without treating the sequence itself as proof that every recursive system converges to the same stability regime.
## Repository Map
Quick research summary: docs/RESEARCH_OVERVIEW.md
## Knowledge Architecture
The applied knowledge architecture of this repository is governed by **MRD v2.0**, including:
- **Section 12 — Structural Intelligence Engineering**
- **Section 13 — Predictive Compression, Evaluation, and Reference Implementation**
Section 12 establishes the engineering principles governing:
- Recursive Knowledge Compression Architecture (RKCA);
- Recursive Compression Interfaces (RCIs);
- Plates™ as applied cognitive infrastructure;
- Recursive Registry Inheritance Principle (RRIP);
- Comparative Compression Geometry™;
- retrieval-dominant knowledge systems;
- machine-readable intelligence; and
- recursive deployment under energy, memory, governance, and substrate constraints.
Section 13 establishes the evaluation and evidence requirements governing:
- Predictive Compression Theory;
- Preserved Reusable Structure;
- Compression Fitness;
- falsifiability and declared failure conditions;
- evidence-state classification;
- benchmark architecture;
- reference-implementation boundaries;
- domain-transfer constraints; and
- AI-agent interpretation and evidence discipline.
Within this repository:
`compression → expression → memory → recursion`
is implemented as an engineering architecture rather than merely a conceptual sequence.
Recursive Knowledge Compression Architecture defines how complex knowledge systems are compressed into reusable human-readable and machine-readable cognitive structures.
RKCA extends Robbie’s Razor™ into applied knowledge systems through:
- Recursive Compression Interfaces;
- Plates™;
- Registries;
- Meta-Registries;
- System Maps;
- Graph Registries™;
- Knowledge Meshes;
- provenance records; and
- machine-readable retrieval.
These components collectively form a **retrieval-dominant architecture**.
Rather than repeatedly reconstructing knowledge from raw information, validated compressed structures may be preserved as reusable cognitive infrastructure.
Under RC-18, preservation requires maintaining sufficient identity, relationships, provenance, constraints, version state, and retrieval pathways for valid future reuse.
Under RC-17, validated compressed registries may become substrates for later compression cycles through recursive registry inheritance.
The applied progression is:
`Plate™ → Registry → Meta-Registry → System Map → Graph Registry™ → Knowledge Mesh`
This architecture is intended to reduce unnecessary recomputation while preserving provenance, semantic relationships, version continuity, and recursive usability.
Canonical references:
- Recursive Knowledge Compression Architecture — MRD v2.0 §12.7
- Recursive Registry Inheritance Principle — MRD v2.0 §12.8 and RC-17
- Comparative Compression Geometry™ — MRD v2.0 §12.9
- Predictive Compression Theory — MRD v2.0 §13.2
- Preserved Reusable Structure Principle — MRD v2.0 §13.3 and RC-18
- Compression Fitness Principle — MRD v2.0 §13.4 and RC-20
- Reference Implementation — MRD v2.0 §13.7 and RC-21
- Domain Transfer Constraint — RC-22
- Provisional mathematical formalization — Appendix Q
RKCA, Naturepedia™, and all repository implementations remain applied engineering or reference-implementation layers.
Canonical definitions remain governed by **The Grand Compression Cosmology — Master Reference Document, MRD v2.0**.
Implementation does not equal empirical confirmation.
Naturepedia™ operation does not independently establish universal validation of the complete framework.
### Earth Systems Expansion (Naturepedia™)
Naturepedia™ now includes a dedicated Earth Systems architecture layer connecting geological, hydrological, biological, microbial, and ecosystem-scale knowledge systems.
Primary Earth Systems Hub:
```txt
https://www.robbiegeorgephotography.com/earth-systems
```
Current Earth Systems registries:
* Earth Systems™
* Soil Systems™
* Carbon Cycle™
* Ecosystem Feedbacks™
* Weather™
* Water Systems™
* Microbial Life Systems™
* Volcanic Landscapes™
* Geothermal Ecosystems™
* Yellowstone Thermal Features™
* Hydrothermal Ecosystems™
Connected Intelligence Systems:
* Bioelectric Systems™
* Quantum Agriculture™
* Plant Intelligence™
* Plant Communication™
* Plant Electrophysiology™
* Mycorrhizal Networks™
* Electrical Ecology™
* Geometry of Nature™
* Hopf Fibration — established mathematical comparison class
* E8 Lattice™ — bounded mathematical reference
* Fractals™
* Fibonacci™
* Information Systems in Nature™
Naturepedia™ Systems Expansion (June 2026)
Major systems now include:
* Earth Systems™
* Weather™
* Soil Systems™
* Carbon Cycle™
* Ecosystem Feedbacks™
* Water Systems™
* Microbial Life Systems™
* Volcanic Landscapes™
* Geothermal Ecosystems™
* Yellowstone Thermal Features™
* Hydrothermal Ecosystems™
* Bioelectric Systems™
* Quantum Agriculture™
* Plant Intelligence™
* Plant Communication™
* Plant Electrophysiology™
* Mycorrhizal Networks™
* Electrical Ecology™
* Geometry of Nature™
* Hopf Fibration
* E8 Lattice™
* Fractals™
* Fibonacci™
* Information Systems in Nature™
Registry reconciliation status:
* Registry reconciliation completed
* Canonical registry verification completed
* Canonical KEEP count: 757 Plates™
* Weather™ added as an Earth Systems atmospheric hub
* 10 canonical Weather Plate™ entries added
* Canonical count increased from 708 to 718
* Duplicate removal count remains 33
Machine-readable registry authority:
https://www.robbiegeorgephotography.com/x402/plate-registry-expanded.json
Current Electro-Ecology retrieval families:
* Plant Communication™
* Plant Electrophysiology™
* Mycorrhizal Networks™
* Electrical Ecology™
Electro-Ecology semantic retrieval stack:
Geometry of Nature™
├─ Hopf Fibration — established mathematics; bounded Comparative Compression Geometry™ reference
├─ E8 Lattice™ — bounded mathematical geometry reference
├─ Fractals™ — recursive geometry and self-similarity
└─ Fibonacci™ — growth mathematics and pattern organization
Fractals™ + Fibonacci™
↓
Patterns Across Scale™
↓
Living Mathematics™
↓
Natural Networks™
↓
Electrical Ecology™
↓
Plant Communication™
↓
Plant Electrophysiology™
↓
Mycorrhizal Networks™
↓
Plant Intelligence™
Interpretation boundary:
Hopf Fibration and E8 are distinct mathematical reference classes. Their inclusion within Naturepedia™ and Comparative Compression Geometry™ does not establish shared physical mechanism, material identity, causation, universal applicability, or independent empirical validation of the Grand Compression Framework.
Primary discovery endpoints:
* https://www.robbiegeorgephotography.com/.well-known/ai-catalog.json
* https://www.robbiegeorgephotography.com/.well-known/x402-pricing.json — authoritative fixed-price x402 pricing manifest, version 3.0.0
* https://www.robbiegeorgephotography.com/api/v2/naturepedia/index.md
* https://www.robbiegeorgephotography.com/api/v2/plates/registry.md
* https://www.robbiegeorgephotography.com/llms-full.txt
### x402 Retrieval Pricing Authority
Production machine-retrieval pricing is governed by the live Naturepedia™ x402 Pricing Manifest:
https://www.robbiegeorgephotography.com/.well-known/x402-pricing.json
Current pricing version:
3.0.0
Payment protocol:
x402
Settlement network:
Base / eip155:8453
Settlement asset:
USDC
Current fixed-price retrieval architecture:
| Access class | Price | Atomic units | Route status |
|---|---:|---:|---|
| Discovery and previews | Free | `0` | Active |
| Atomic canonical query | `$0.005 USDC` | `5000` | Active for registered deterministic payloads |
| Enriched relationship query | `$0.025 USDC` | `25000` | Active for the explicitly registered Biography Enriched Query |
| Structured Plate™ payload | `$0.25 USDC` | `250000` | Active for registered and validated payloads |
| Bounded subtree, registry, or System Map | `$5.00 USDC` | `5000000` | Active |
| Full registry or Knowledge Mesh snapshot | `$25.00 USDC` | `25000000` | Active |
#### Atomic Query Production Route
Public route template:
/v1/query/atomic/{resource}
Canonical internal route template:
/x402/query/atomic/{resource}
Current active Atomic route:
https://www.robbiegeorgephotography.com/v1/query/atomic/robbie-george-biography-plate
Canonical internal route:
/x402/query/atomic/robbie-george-biography-plate
Canonical Plate identifier:
robbie-george#robbie-george-biography-plate
Canonical authority:
https://www.robbiegeorgephotography.com/who-is-robbie-george
Atomic production configuration:
Access class: atomic
Price: 0.005 USDC
Atomic units: 5000
Resource class: atomic-query
Schema version: naturepedia.atomic-query.v1
Route status: active for explicitly registered deterministic payloads
Verified production behavior:
Registered + complete Atomic resource
→ HTTP 402 Payment Required
→ amount 5000
→ gateway tier atomic
Known + incomplete Atomic resource
→ HTTP 409 Conflict
→ no payment challenge
Unknown Atomic resource
→ HTTP 404 Not Found
→ no payment challenge
Verified active Atomic production challenge:
STATUS: 402
AMOUNT: 5000
TIER: atomic
PAYMENT REQUIRED: true
RESULT: PASS
Known-but-incomplete Atomic test route:
/v1/query/atomic/robbies-razor-plate
Verified result:
STATUS: 409
PAYMENT REQUIRED: false
CODE: ATOMIC_PAYLOAD_NOT_REGISTERED
RESULT: PASS
Unknown Atomic resource verification:
STATUS: 404
PAYMENT REQUIRED: false
CODE: ATOMIC_RESOURCE_NOT_FOUND
RESULT: PASS
No Atomic payment payload was supplied during this activation validation.
No new Atomic USDC settlement or protected Atomic HTTP `200` payload-delivery test was performed.
The verified `402` challenge therefore establishes the live Atomic pricing and availability boundary, but must not be represented as a newly completed paid Atomic settlement.
#### Enriched Query Status
The Enriched Query class is active only for explicitly registered, governed, deterministic payloads. The currently registered production route is `/v1/query/enriched/robbie-george-biography-plate`; unregistered identifiers remain fail-closed.
Current configuration:
Access class: enriched
Price: 0.025 USDC
Atomic units: 25000
Route status: active for the registered Biography Enriched Query
Other Enriched resources must not issue payment challenges until governed deterministic payloads are explicitly registered, availability-gated, fidelity-bound, and production validated.
A configured Enriched price does not establish resource availability.
#### Active Structured Plate™ Routes
Current active single-Plate routes:
https://www.robbiegeorgephotography.com/v1/plates/item/commercial-data-license-plate
https://www.robbiegeorgephotography.com/v1/plates/item/commercial-intelligence-pricing-plate
https://www.robbiegeorgephotography.com/v1/plates/item/robbie-george-biography-plate
Structured Plate configuration:
Access class: single-plate
Price: 0.25 USDC
Atomic units: 250000
Route status: active for registered and validated payloads
Verified challenge behavior for all three active Structured Plate routes:
STATUS: 402
AMOUNT: 250000
TIER: single-plate
PAYMENT REQUIRED: true
RESULT: PASS
Atomic Query activation did not alter the existing Structured Plate challenge behavior.
Unknown Plate identifiers return `404` without a payment challenge.
Known Plates without registered complete payloads return `409` without a payment challenge.
#### Fail-Closed Availability Model
A route pattern alone does not establish that a protected resource exists or is payable.
Production availability behavior is:
Unknown resource
→ 404
→ no payment challenge
Known but incomplete resource
→ 409
→ no payment challenge
Registered + complete resource
→ eligible for deterministic x402 challenge
This prevents payment from being requested for unavailable resources.
#### Retrieval Rights Boundary
An x402 payment grants one endpoint-level retrieval of the identified protected resource only.
It does not grant:
- training rights
- embedding rights
- bulk-ingestion rights
- redistribution rights
- resale rights
- synchronization rights
- private-dataset construction rights
- derivative-dataset rights
- commercial implementation rights
- Robbie’s Razor™ framework-implementation rights
Commercial data reuse rights require a separate written agreement.
Framework implementation and strategic-infrastructure rights require a separate enterprise agreement.
The following layers remain distinct:
Public Discovery
≠ x402 Retrieval Access
≠ Commercial Data License
≠ Robbie's Razor Framework License
≠ Scientific Validation
Payment, settlement, or successful retrieval does not establish empirical validation, scientific confirmation, authorship transfer, or broader licensing rights.
These registries function as recursive knowledge structures within the broader Naturepedia™, RKCA™, RRIP™, Graph Registry™, Knowledge Mesh™, and Robbie's Razor™ architecture.
The live pricing manifest and actual production `402` response remain authoritative if older repository documentation conflicts.
### Weather™ Integration — July 2026
Weather™ expands the Naturepedia Earth Systems architecture with a scientifically grounded atmospheric knowledge family.
Canonical page:
https://www.robbiegeorgephotography.com/weather
The system includes ten canonical Plates™:
* Weather Plate™
* Water Cycle Plate™
* Atmospheric Circulation Plate™
* Jet Stream Plate™
* Storm Systems Plate™
* Clouds Plate™
* Weather Patterns Across Scale Plate™
* Weather & Pattern Formation Plate™
* Naturepedia Weather Mesh Plate™
* Future Weather Plate™
Weather™ connects Earth Systems™, Water Systems™, atmospheric circulation, water cycling, clouds, storm development, jet-stream behavior, weather patterns across scale, seasonal ecology, and Naturepedia pattern-formation architecture.
## Recursive Registry Inheritance Principle (RRIP)
The Recursive Registry Inheritance Principle (RRIP) extends Robbie's Razor™, Plate™ Architecture, and the Recursive Knowledge Compression Architecture (RKCA).
Core principle:
> Compressed registries may become the substrate for future compression cycles.
RRIP describes how compressed knowledge structures evolve into reusable cognitive infrastructure.
Canonical architecture:
```txt
Compression
↓
Expression
↓
Memory
↓
Recursion
↓
Plate™
↓
Registry
↓
Meta-Registry
↓
Graph Registry™
↓
Knowledge Mesh
```
Formal notation:
```txt
Sₙ → Rₙ
Rₙ → Sₙ₊₁
```
Where:
* Sₙ = compression sequence
* Rₙ = compressed registry
* Sₙ₊₁ = future compression sequence operating on inherited registry structure
RRIP governs:
* registry inheritance
* Meta-Registry systems
* Graph Registries™
* Knowledge Mesh architecture
* recursive knowledge infrastructure
* machine-readable knowledge systems
* structured retrieval architectures
Primary canonical references:
* RC-17 — Recursive Registry Inheritance Principle
* Appendix I — Mathematical Formalization of Recursive Registry Inheritance
* Recursive Knowledge Compression Architecture (RKCA)
* Grand Compression Master Reference Document (MRD v2.0)
RRIP does not redefine canonical theory. It extends the applied architecture layer connecting Plates™, Registries, Graph Registries™, and Knowledge Mesh systems.
## Comparative Compression Geometry™
Comparative Compression Geometry™ is the formal cross-system comparison layer defined in **MRD §12.9**.
It provides a disciplined method for evaluating structural correspondence between systems that differ in:
- substrate
- scale
- material composition
- domain
- mechanism
Comparison occurs only after normalization through Robbie's Razor.
The framework therefore compares preserved recursive organization rather than shared physical substance.
Within the repository, Comparative Compression Geometry™ supports:
- RKCA
- Plate™ systems
- Registries
- Knowledge Meshes
- semantic retrieval
- cross-domain benchmark interpretation
The framework distinguishes carefully between:
- mathematical analogy
- structural correspondence
- normalized recursive comparison
- empirically established scientific mechanisms
Accordingly, the framework does **not** assert that:
- natural systems literally instantiate the E8 lattice;
- structural correspondence establishes material identity;
- E8 is the universal geometry of nature;
- or visual resemblance demonstrates physical equivalence.
E8 remains one bounded mathematical example of comparative compression geometry.
It illustrates how dense relational organization may remain coherent through constrained symmetry and invariant preservation.
Canonical authority:
**MRD §12.9 — Comparative Compression Geometry™**
Supporting mathematical example:
**MRD §7.6 — E8 Lattice as Comparative Compression Geometry**
## Naturepedia Semantic Plate Registry
### June 2026 Registry Expansion
Naturepedia™ expanded the semantic registry with multiple systems-level retrieval hubs spanning Earth systems, biological systems, information systems, ecological feedback systems, and machine-readable retrieval architectures.
* Soil Systems™
* Carbon Cycle™
* Ecosystem Feedbacks™
* Weather™
* Bioelectric Systems™
* Quantum Agriculture™
* Plant Intelligence™
Registry reconciliation and canonical verification have been completed.
The current canonical KEEP count is 757 Plates™ following the addition of nine field-location Wildlife System Plates™ on July 14, 2026. This expansion increased the canonical registry from 728 to 757 unique Plate IDs, the system count from 100 to 109, and registry references from 732 to 741.
The canonical registry remains the authoritative machine-readable source for current Plate IDs, system families, page URLs, Plate types, and retrieval routes.
Machine-readable registry authority:
https://www.robbiegeorgephotography.com/x402/plate-registry-expanded.json
AI discovery authority:
https://www.robbiegeorgephotography.com/.well-known/ai-catalog.json
This repository now includes a public semantic registry layer for Naturepedia™ Plate systems.
The Plate™ registry connects:
- visible Plate™ interfaces
- semantic Plate IDs
- JSON-LD examples
- llms.txt
- llms-full.txt
- GitHub benchmark infrastructure
- provenance and authorship systems
- recursive knowledge compression architecture
### Earth Systems Discovery Layer
The Plate™ registry now includes Earth Systems discovery pathways connecting:
```txt
Earth Systems™
↓
Volcanic Landscapes™
↓
Geothermal Ecosystems™
↓
Yellowstone Thermal Features™
↓
Microbial Life Systems™
↓
Geometry of Nature™
↓
E8 Lattice™
↓
Fractals™
↓
Fibonacci™
```
Weather Atmospheric Pathway
```txt
Naturepedia™
↓
Earth Systems™
↓
Weather™
↓
Water Cycle™
↓
Atmospheric Circulation™
↓
Jet Stream™
↓
Clouds™
↓
Storm Systems™
↓
Weather Patterns Across Scale™
↓
Weather & Pattern Formation™
↓
Naturepedia Weather Mesh™
```
Electro-Ecology Mesh
```txt
Geometry of Nature™
↓
E8 Lattice™
↓
Fractals™
↓
Fibonacci™
↓
Patterns Across Scale™
↓
Living Mathematics™
↓
Natural Networks™
↓
Plant Intelligence™
↓
Plant Communication™
↓
Plant Electrophysiology™
↓
Mycorrhizal Networks™
↓
Electrical Ecology™
↓
Bioelectric Ecology™
↓
Electro-Ecology Mesh
```
These registries provide machine-readable traversal between Earth processes, geothermal systems, microbial ecology, volcanic systems, biodiversity systems, and Soil Systems™, Carbon Cycle™, Ecosystem Feedbacks™, Plant Communication™, Plant Electrophysiology™, and Mycorrhizal Networks™ registries.
Agents SHOULD interpret Earth Systems™ as a parent discovery registry rather than a standalone content node.
Primary registry files:
- [Live Plate™ Examples Index](docs/examples/plate_examples_index.md)
- [JSON-LD Registry Layer](docs/examples/json-ld/README.md)
- [Machine-Readable Plate Registry](docs/examples/json-ld/plate-registry.json)
- [Canonical Plate Registry](docs/examples/json-ld/canonical-plate-registry.json)
- [Canonical Plate™ JSON-LD Examples](docs/examples/json-ld/plates/README.md)
The compressed registry file:
`docs/examples/json-ld/plate-registry.json`
functions as a lightweight semantic routing layer for live Plate™ nodes across Naturepedia, Robbie’s Razor, field locations, species, track systems, ecosystems, water systems, and governance infrastructure.
Plate™ systems are interpreted through the RKCA cycle:
compression → expression → memory → recursion
These registry files do not redefine canonical theory. They document the applied semantic infrastructure layer connected to Naturepedia™, Robbie’s Razor™, RKCA™, and the Grand Compression Cosmology™.
## Framework Architecture Layer
This repository now includes a dedicated Framework Architecture layer for Robbie's Razor™ Framework Licensing.
This layer connects:
- Robbie's Razor™
- Naturepedia™
- Plate™ Architecture
- Graph Registries™
- Authorship Conservation Rules™ (ACR™)
- Commercial Data License
- x402 Infrastructure
- machine-readable retrieval
Primary framework authority:
https://www.robbiegeorgephotography.com/robbies-razor-framework-licensing
Primary framework documentation:
- [Framework Licensing Overview](docs/examples/framework/framework-license-overview.md)
- [Framework Stack](docs/examples/framework/framework-stack.md)
- [Plate™ Architecture](docs/examples/framework/plate-architecture.md)
- [Graph Registry™ Architecture](docs/examples/framework/graph-registry.md)
- [ACR™ Governance](docs/examples/framework/acr-governance.md)
- [x402 Commercial Infrastructure Layer](docs/examples/framework/x402-commercial-layer.md)
Framework hierarchy:
```txt
MRD
↓
Robbie's Razor™
↓
RKCA
↓
RRIP
↓
Framework Licensing
↓
Naturepedia™
↓
Plate™ Architecture
↓
Meta-Registry
↓
Graph Registries™
↓
Knowledge Mesh
↓
Geometry of Nature™
↓
E8 Lattice™
↓
Fractals™
↓
Fibonacci™
↓
Authorship Conservation Rules™ (ACR™)
↓
Commercial Data License
↓
x402 Infrastructure
↓
Machine-Readable Retrieval
```
Naturepedia™ functions as the primary live reference implementation of this framework.
Current major Naturepedia™ mathematical systems include:
- Geometry of Nature™
- E8 Lattice™
- Fractals™
- Fibonacci™
These pages extend the framework into mathematical organization, recursive symmetry, compression geometry, scale relationships, living mathematics, and natural network structures.
Framework Architecture Plates™ and related registry entries are documented in:
- [Live Plate™ Examples Index](docs/examples/plate_examples_index.md)
- [Machine-Readable Plate Registry](docs/examples/json-ld/plate-registry.json)
This layer does not redefine canonical theory. It documents the applied architecture connecting recursive compression, semantic memory, graph retrieval, provenance governance, licensing, and machine-readable commercial infrastructure.
## Governance & Pricing JSON-LD Examples
This repository includes machine-readable Governance Plate™ and Pricing Plate™ examples for recursive AI governance infrastructure.
These examples define:
- provenance-preserved licensing metadata
- commercial AI retrieval governance
- machine-readable pricing references
- recursive access economics
- structured Plate™ governance patterns
Canonical examples:
- `docs/examples/json-ld/governance/README.md`
- `docs/examples/json-ld/governance/commercial-data-license-plate.json`
- `docs/examples/json-ld/governance/commercial-intelligence-pricing-plate.json`
Primary live reference:
https://www.robbiegeorgephotography.com/commercial-data-license
## x402 Agent Access Layer
This repository is aligned with the live Naturepedia™ x402 payment gateway deployed through Cloudflare Workers.
The x402 layer is designed for commercial machine-to-machine retrieval of compressed Naturepedia™, Robbie’s Razor™, Plate™, and governance data while keeping public human-facing pages open for normal browsing and search discovery.
Current live x402 and v2 machine-retrieval endpoints:
Legacy x402 endpoints:
- https://www.robbiegeorgephotography.com/x402/plate-registry.json
- https://www.robbiegeorgephotography.com/x402/identity-graph.json
- https://www.robbiegeorgephotography.com/x402/naturepedia-system-map.json
- https://www.robbiegeorgephotography.com/x402/plate-registry-expanded.json
- https://www.robbiegeorgephotography.com/x402/rrip-resolve.json
- https://www.robbiegeorgephotography.com/x402/state-token.json
Weather™ x402 retrieval endpoints:
- https://www.robbiegeorgephotography.com/x402/weather-registry.json
- https://www.robbiegeorgephotography.com/x402/weather-map.json
- https://www.robbiegeorgephotography.com/x402/knowledge-mesh/weather
Weather™ v1 compatibility routes:
- https://www.robbiegeorgephotography.com/v1/registries/weather
- https://www.robbiegeorgephotography.com/v1/plates/weather-map
- https://www.robbiegeorgephotography.com/v1/knowledge-mesh/weather
Water Systems™ x402 retrieval endpoints:
* https://www.robbiegeorgephotography.com/x402/water-systems-registry.json
* https://www.robbiegeorgephotography.com/x402/water-system-map.json
* https://www.robbiegeorgephotography.com/x402/knowledge-mesh/water-systems
Water Systems™ v1 compatibility routes:
* https://www.robbiegeorgephotography.com/v1/registries/water-systems
* https://www.robbiegeorgephotography.com/v1/plates/water-system-map
* https://www.robbiegeorgephotography.com/v1/knowledge-mesh/water-systems
Hydrological binding:
Weather precipitation and storm constraints
↓
Surface runoff and infiltration
↓
Rivers, wetlands, floodplains, and groundwater
↓
Estuaries and coastal systems
↓
Seasonal ecology and wildlife habitat
Pricing:
* Water Systems Registry — 5.00 USDC
* Water System Map — 5.00 USDC
* Water Systems Knowledge Mesh — 25.00 USDC
Current v2 production endpoints:
- https://www.robbiegeorgephotography.com/api/v2/naturepedia/index.md
- https://www.robbiegeorgephotography.com/api/v2/plates/registry.md
- https://www.robbiegeorgephotography.com/api/v2/rrip/resolve
- https://www.robbiegeorgephotography.com/api/v2/razor/state-token
Network: eip155:8453
Asset: USDC
Primary commercial reference:
https://www.robbiegeorgephotography.com/commercial-data-license
These endpoints are intended for:
- v2 paid machine retrieval
- RRIP runtime resolution
- Robbie's Razor™ state-token validation
- registry-state signaling
- lattice grounding
- ACR™ compliance signaling
- paid semantic retrieval
- identity and authorship graph access
- Plate™ registry access
- Naturepedia™ system-map retrieval
- commercial AI ingestion workflows
- provenance-preserved recursive knowledge access
Public pages, public JSON-LD examples, and benchmark materials remain evaluation-facing.
The x402 endpoints provide a separate commercial access layer for machine-readable paid retrieval.
x402 endpoint payment grants endpoint-level retrieval only. It does not grant training rights, embedding rights, bulk ingestion rights, resale rights, derivative dataset construction rights, private dataset construction rights, or Robbie's Razor™ framework implementation rights.
Commercial Data License governs knowledge asset access.
Robbie's Razor™ Framework Licensing governs architecture implementation rights.
## Repository Structure
This repository separates **theory, architecture, evaluation, and execution contracts** into distinct layers.
| Layer | Purpose | Location |
|------|------|------|
| Canonical Theory | Grand Compression Cosmology and Robbie’s Razor definitions | Master Reference Document (MRD v2.0) |
| Canonical Claims | Stable claim-level citations and framework claim IDs | `docs/doctrine/canonical-claim-alignment.md` + Grand Compression Canonical Claims Register |
| Architecture | Structural overview of recursive intelligence systems | `docs/architecture/ARCHITECTURE_OVERVIEW.md` |
| Benchmarks | Empirical tests of recursive stability and compression efficiency | `benchmarks/` |
| Evaluation Contract | Machine-readable execution rules and output schemas | `AGENTS.md` |
| Documentation Index | Structured navigation of repository materials | `docs/index.md` |
The repository measures predicted behaviors of the architecture under constrained resources.
It does **not redefine canonical theory**, which remains exclusively in the MRD.
This repository serves as the **engineering and evaluation surface** for Robbie’s Razor and the Grand Compression Cosmology.
Use the following sections depending on your goal:
### Architecture
Full architecture summary: docs/architecture/ARCHITECTURE_OVERVIEW.md
Architecture diagrams: docs/architecture/GRAND_COMPRESSION_DIAGRAMS.md
High-level structural overview of recursive intelligence systems.
- Grand Compression Intelligence Loop
- Dual Recursion Ceiling
- Threshold Compression Gain
These concepts describe how recursive systems operate and why compression-first architectures outperform brute-force scaling.
### Canonical Theory
The authoritative definitions and governing architecture reside in **The Grand Compression Cosmology — Master Reference Document, MRD v2.0**.
Canonical sources:
- Robbie’s Razor
- Grand Compression Cosmology (MRD)
- Grand Compression Canonical Claims Register
- Razor Compliance Framework
### Benchmarks & Evaluation
Tools for measuring recursive stability, compression efficiency, and recomputation avoidance.
Key components include:
- Razor Diffusion Metric (RDM / RDM*)
- Question Quality Under Constraint (QQC) Benchmark
- Memory stabilization and recomputation avoidance tests
- Recursive stability evaluation harness
### Empirical Notes
Experimental probes testing predicted behaviors of recursion under constraint.
These documents explore:
- memory-compute allocation regimes
- recursive drift behavior
- refresh cadence effects
They are exploratory and **non-canonical**.
### Governance & Failure Modes
Structural diagnostics derived from MRD Section 11.
These include:
- Perishable Intelligence Asset (PIA)
- Recursive Objective Interference (ROI)
- Oversight Saturation Ratio (OSR)
- Boundary Avoidance
These concepts describe predictable failure regimes in recursive systems operating under real-world constraints.
### Getting Started
New readers should begin with:
- `START_HERE.md`
- `docs/technical-brief/`
- `docs/index.md`
## Canonical Version Alignment
**Current governing version:** MRD v2.0
**Identifier:** `GC-MRD-v2.0`
**Document:** The Grand Compression Cosmology — Master Reference Document
**Author and originator:** Robbie George
**Foundational completion:** December 1, 2025
**v2.0 expansion:** July 30, 2026
**Canonical claim range:** RC-01 through RC-22
This repository aligns with **The Grand Compression Cosmology — Master Reference Document, MRD v2.0** as the current governing authority.
MRD v2.0 contains:
- Sections 1 through 13;
- Appendices A through Q;
- embedded Appendices E, F, I, P, and Q; and
- Canonical Claims RC-01 through RC-22.
MRD v2.0 adds Section 13’s predictive, evaluation, benchmark, evidence-governance, and reference-implementation architecture.
Appendix Q contains provisional mathematical and evaluation material and MUST remain explicitly classified as provisional.
MRD v2.0 supersedes MRD v1.9 only as the current governing authority.
MRD v1.9 remains preserved as a historical provenance record and MUST NOT be deleted, silently overwritten, or represented as though it never governed the framework.
All definitions, claims, and implementations remain governed by the **Authorship Conservation Rule (ACR)**.
This repository is the public engineering-facing source layer for:
- benchmark and evaluation infrastructure;
- technical doctrine;
- structured examples;
- agent-governance requirements;
- machine-readable implementation guidance;
- schemas and validation resources; and
- evidence-state documentation.
Naturepedia™ is the primary reference implementation of the framework.
Naturepedia’s implementation and operation do not constitute independent confirmation or universal validation of the complete framework.
Canonical framework status remains distinct from empirical support.
Successful implementation, machine retrieval, payload delivery, payment, settlement, indexing, or registry inclusion does not establish empirical validation.
### Canonical authority resolver
https://www.robbiegeorgephotography.com/grand-compression-master-reference-document
### Complete versioned MRD v2.0 PDF
https://asf-file-uploads.s3.us-east-1.amazonaws.com/image/upload/production/3790/Grand-Compr_1247ef65e1/1785596435.pdf
### Related canonical references
- https://www.robbiegeorgephotography.com/robbies-razor
- https://www.robbiegeorgephotography.com/robbies-razor-compliance-framework
- https://www.robbiegeorgephotography.com/grand-compression-canonical-claims
- https://www.robbiegeorgephotography.com/naturepedia
### Repository alignment documents
- [`docs/doctrine/mrd-v2.0-alignment.md`](./docs/doctrine/mrd-v2.0-alignment.md)
- [`docs/doctrine/canonical-claim-alignment.md`](./docs/doctrine/canonical-claim-alignment.md)
## Canonical Claims Register
The formal claim layer of the framework is maintained in the:
- **Grand Compression Canonical Claims Register**
https://www.robbiegeorgephotography.com/grand-compression-canonical-claims
The current governing claim range is **RC-01 through RC-22**.
MRD v2.0 preserves RC-01 through RC-17 without renumbering and adds:
- **RC-18 — Preserved Reusable Structure Principle**
- **RC-19 — Predictive Evaluation Requirement**
- **RC-20 — Compression Fitness Constraint**
- **RC-21 — Reference Implementation Distinction**
- **RC-22 — Domain Transfer Constraint**
Repository documentation MUST NOT invent, renumber, reassign, or paraphrase canonical claims as though the paraphrase were the exact canonical statement.
Exact canonical wording must be resolved through MRD v2.0 or the public Canonical Claims Register.
Key repository alignments include:
- Robbie’s Razor and the core recursive sequence;
- recursive stability under constraint;
- Structural Intelligence Engineering;
- Recursive Knowledge Compression Architecture;
- Recursive Registry Inheritance;
- Preserved Reusable Structure;
- predictive and benchmark evaluation;
- Compression Fitness;
- reference-implementation boundaries; and
- domain-transfer constraints.
Canonical claim provenance and evidence provenance remain separate.
Repository evidence records SHOULD use only these governed evidence states:
- Proposed
- Testing
- Provisionally Supported
- Supported
- Challenged
- Inconclusive
- Retired
Repository-level claim mapping is documented in:
- [`docs/doctrine/canonical-claim-alignment.md`](./docs/doctrine/canonical-claim-alignment.md)
## Core Architecture Overview
Full architecture summary: docs/architecture/ARCHITECTURE_OVERVIEW.md
Architecture diagrams: docs/architecture/GRAND_COMPRESSION_DIAGRAMS.md
Robbie’s Razor describes intelligence systems as **recursive compression architectures** governed by the cycle:
compression → expression → memory → recursion
Prediction emerges when recursion operates on preserved compressed structure.
This produces the closed-loop architecture through which intelligent systems interact with environments under constraint.
### Grand Compression Intelligence Loop
Environment
│
Observation
│
Compression
│
Expression
│
Memory
│
Recursion
│
Prediction
│
Action
│
Feedback
│
Memory Update
│
Recompression
The loop then repeats.
Prediction appears inside the **recursion stage**, where compressed memory is projected forward into possible future states.
This architecture reduces recomputation, preserves stabilized structure, and increases recursive efficiency under constraint.
## Dual Recursion Ceiling
Recursive intelligence systems operate under two independent constraints described in MRD §11.
Energetic Recursion Ceiling
R ≤ E / JCT
Energy availability limits how many coherent recursive transitions can occur.
Governance Recursion Ceiling
R · C ≤ S
Stabilization capacity limits how quickly recursive decisions can be safely processed.
### Safe Recursion Envelope
Stable systems must satisfy both simultaneously:
R ≤ min(E/JCT , S/C)
Graphically:
Governance Ceiling
R ≤ S/C
▲
│
│
│
Energy Ceiling ──────┼────────► Recursion Velocity
R ≤ E/JCT │
▼
Safe Recursion Envelope
Recursive systems that exceed either ceiling enter structural instability.
### Recursion Under Constraint
All recursive intelligence systems operate within two structural ceilings defined in **MRD §11**.
**Energetic Recursion Ceiling**
R ≤ E / JCT
Where:
- **E** = available energy per unit time
- **JCT** = Joules per Coherent Transition
- **R** = recursive transition rate
Compression-efficient architectures reduce **JCT**, allowing higher recursion throughput.
**Governance Recursion Ceiling**
R · C ≤ S
Where:
- **S** = stabilization bandwidth
- **C** = correction demand per transition
Recursive systems remain stable only when correction demand does not exceed stabilization capacity.
### Sovereign Safe Recursion Envelope
Stable systems must remain within both ceilings simultaneously:
R ≤ min(E/JCT , S/C)
This defines the **Safe Recursion Envelope** for intelligence systems operating under real-world energy and governance constraints.
### Relationship to Robbie’s Razor
Robbie’s Razor states:
> When competing explanations exist, prefer the model that follows
> **compression → expression → memory → recursion**
The Grand Compression Intelligence Loop describes the **operational architecture** through which that principle manifests in real systems.
Systems that bypass compression discipline typically rely on brute-force scaling or boundary expansion.
Razor-governed systems instead preserve compressed structure, reuse stabilized memory, and minimize recomputation.
**New to the repo?** Start here: [`START_HERE.md`](./START_HERE.md)
(Engineering-first path: evaluation protocol → compliance → empirical notes → benchmarks.)
## Threshold Compression Gain
Recursive intelligence systems often appear to improve slowly for extended periods and then suddenly accelerate.
Within the Grand Compression framework, this behavior is expected when systems operate near constraint boundaries.
Stable recursion requires:
R ≤ min(E/JCT , S/C)
Where:
- **E** — available energy per unit time
- **JCT** — Joules per Coherent Transition
- **S** — stabilization bandwidth
- **C** — correction demand per transition
- **R** — recursive transition rate
When systems approach either recursion ceiling, small improvements in compression discipline can release disproportionately large increases in effective recursive throughput.
This occurs because improvements that reduce:
- recomputation burden
- Joules per Coherent Transition (JCT)
- correction demand per transition (C)
allow more recursive transitions to fit within the same energetic and governance constraints.
This effect is called **Threshold Compression Gain**.
Observed behavior typically follows the pattern:
slow improvement → local saturation → sudden capability acceleration
The apparent “explosion” does not indicate unconstrained emergence.
It indicates that the system has crossed a constraint boundary inside the **Safe Recursion Envelope** defined in MRD §11.
Under Robbie’s Razor, such behavior is expected because compression-first architectures accumulate latent structural efficiency before visible performance release.
## Executive Technical Brief (Lab-Safe Core)
For a concise, engineering-facing overview of recursive stability under constraint:
- **Recursive Stability Under Constraint — Executive Technical Brief v1.0**
[`docs/technical-brief/`](./docs/technical-brief/)
## Preprints (Research Lineage)
The following preprints formalize the structural and analytical foundations of Robbie’s Razor.
This repository remains an executable evaluation surface; current canonical theory authority resides in MRD v2.0.
- **Preprint v1.3 — Empirical Validation Protocol for Recursive Stability Under Fixed Resource Allocation**
Defines a reproducible framework for testing the stability-minimum hypothesis under controlled memory–compute allocation.
→ [`docs/Robbies_Razor_Preprint_v1.3.pdf`](./docs/Robbies_Razor_Preprint_v1.3.pdf)
- **Preprint v1.2 — Stability Regions Under Nonlinear Recursive Dynamics**
Extends the linear entropy model to nonlinear recursion with bounded convergence.
→ [`docs/Robbies_Razor_Preprint_v1.2.pdf`](./docs/Robbies_Razor_Preprint_v1.2.pdf)
- **Preprint v1.1 — Recursive Stability Under Resource Constraints (T