Version: 2.0.0 Status: Canonical License: CC BY 4.0
Ra-Canonical v2.0: This document has been updated for the 32-bit Ra-Canonical format. See spec/RPP-CANONICAL-v2.md for address specification.
RPP (Rotational Packet Protocol) is an open semantic addressing architecture that encodes meaning, consent, and lifecycle directly into the address itself.
Traditional memory and storage systems ask: "Where do I put this?" RPP asks: "Where does this belong?"
RPP turns storage from "where bytes live" into "how meaning flows" — without breaking what already works.
Every RPP address is a 32-bit Ra-Canonical coordinate encoding:
- Theta (5 bits): 27 Repitans / semantic sector
- Phi (3 bits): 6 RAC access sensitivity levels
- Harmonic (3 bits): 5 Omega coherence tiers
- Radius (8 bits): Intensity scalar (Ankh-normalized)
- Reserved (13 bits): CRC or future use
No lookup tables required. The address is the classification.
RPP is a semantic control plane, not a data plane.
- Existing filesystems, databases, and object stores remain
- RPP adds routing, consent, and lifecycle awareness
- Zero-migration integration path
- Storage stays dumb and durable; RPP stays smart and light
Access is not binary (allowed/denied). It is:
- State-aware: Depends on current coherence level
- Consent-gated: Revocable, contextual, non-transferable
- Graceful: Degrades rather than crashes
The 32-bit Ra-Canonical address format is designed for:
- FPGA register packing (full 32-bit alignment)
- SPI transfer efficiency (4 bytes)
- MRAM addressability
- Deterministic routing
- CRC-13 integrity checking
Software emulation and hardware execution produce identical results.
| Non-Goal | Explanation |
|---|---|
| A new filesystem | RPP overlays existing storage |
| A database | RPP routes to databases, not replaces them |
| A blockchain | No consensus mechanism, no distributed ledger |
| An AI model | RPP routes AI outputs, not generates them |
| A security product | RPP enables consent; it is not a firewall |
| Patentable | This architecture is intentionally open and unpatentable |
RPP is designed around:
| Principle | Implementation |
|---|---|
| Consent | Access requires explicit, revocable authorization |
| Agency | Users control their meaning space |
| Non-coercion | No punitive mechanisms; only reflection |
| Transparency | Address semantics are fully auditable |
| Openness | The architecture is public and unenclosable |
This is not a marketing position. It is an architectural invariant.
We explicitly reject patent protection because:
- Prior-art defense: Public specification prevents later enclosure
- Adoption speed: Open infrastructure spreads faster than proprietary
- Philosophical coherence: A consent-based system cannot be coercively owned
- Plural futures: Multiple implementations strengthen the standard
Open source is not charity. It is strategy aligned with values.
RPP succeeds when:
- The 32-bit Ra-Canonical addressing spec is stable and widely understood
- Multiple independent implementations exist
- Integration with existing systems requires no migration
- The architecture can outlive its original authors
- No single entity can capture or enclose the standard
- Steward, not owner: Maintainers hold the center of gravity
- Calm over clever: Boring stability beats exciting fragmentation
- Explicit over implicit: All decisions documented
- Forkable: If governance fails, the spec survives
| Document | Purpose |
|---|---|
| RPP-CANONICAL-v2.md | Canonical 32-bit Ra-Canonical addressing specification |
| SPEC.md | Legacy 28-bit specification (deprecated) |
| SEMANTICS.md | Meaning model and geometric interpretation |
| RESOLVER.md | Bridge/adapter architecture |
| GOVERNANCE.md | Decision-making process |
| LICENSE | Apache 2.0 (code) / CC BY 4.0 (docs) |
This document is intentionally brief. Clarity is the goal.