| Internet-Draft | PRP Architecture | August 2026 |
| Alves | Expires 23 February 2027 | [Page] |
This document describes the architecture of the Participant Relationship Protocol (PRP). PRP treats a relationship, rather than an address, route, transport connection, or identity alone, as the primary persistent context in which communication is authorized and continuity is evaluated. It separates relationships from the replaceable identities, sessions, trajectories, routes, paths, adjacencies, transports, and carriers that realize communication.¶
PRP is independent of IP and of any other particular network-layer protocol. IP-based and non-IP carriers are optional realizations of the same relationship-centric architecture.¶
The document defines terminology, architectural invariants, layering boundaries, security and privacy requirements, and criteria for evaluating relationship-centric protocol designs. It intentionally does not define a wire format, cryptographic suite, routing algorithm, carrier technology, deployment architecture, or IANA registry.¶
This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79.¶
Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet-Drafts is at https://datatracker.ietf.org/drafts/current/.¶
Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress."¶
This Internet-Draft will expire on 23 February 2027.¶
Copyright (c) 2026 IETF Trust and the persons identified as the document authors. All rights reserved.¶
This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (https://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document.¶
Internet communication is commonly described through addresses, routes, transport state, and application endpoints. Those objects are necessary realization mechanisms, but none of them alone expresses the durable authorization and continuity context between communicating participants. Addresses can change, paths can fail, transport sessions can be rekeyed, and carrier attachments can disappear while the reason and authorization for communication remain.¶
PRP introduces the relationship as an explicit architectural object. A relationship records the rules under which participants recognize continuity, constrain identity, authorize communication, and replace realization mechanisms. Reachability can make communication technically possible, but it does not create or expand relationship authority.¶
The foundational statement of PRP is:¶
Communication becomes possible because a relationship already exists.¶
This is an architectural ordering rather than a claim that packets can be exchanged before reachability exists. Paths, transports, and carriers move information, while routes select scoped forwarding outcomes. The relationship determines why an exchange belongs to a continuing authorized context and which realization mechanisms are acceptable for that context.¶
This document is intended for protocol designers, implementers, researchers, and reviewers evaluating relationship-centric networking. It is published for informational purposes through the Independent Submission Stream and does not represent IETF consensus or specify an Internet Standard.¶
The key words MUST, MUST NOT, REQUIRED, SHALL, SHALL NOT, SHOULD, SHOULD NOT, RECOMMENDED, NOT RECOMMENDED, MAY, and OPTIONAL in this document are to be interpreted as described in BCP 14 [RFC2119] [RFC8174] when, and only when, they appear in all capitals, as shown here.¶
This document defines:¶
This document does not define packet or record layouts, cryptographic algorithms, numeric registries, session-establishment messages, routing or discovery algorithms, carrier bindings, application object models, deployment mechanisms, or administrative interfaces. Separate specifications may define those subjects provided they preserve the invariants in this document.¶
An address-centric communication sequence is often summarized as:¶
address -> route -> transport -> communication¶
PRP instead places the relationship and its continuity rules before the realization mechanisms:¶
relationship -> continuity and authorization
^
|
trajectory / route decisions / transport / carrier
¶
The relationship does not replace the lower-layer mechanisms. It supplies the persistent context against which their use, replacement, and failure are evaluated. A realization can therefore move between addresses, paths, sessions, or carriers without silently creating a new relationship, provided continuity is authenticated under relationship policy.¶
A protocol realization can distinguish several non-substitutable reference classes:¶
A content identifier has no private key, cannot prove possession, and does not assert an owner, author, provider, or semantic meaning. Availability of matching bytes is a separate and revocable claim. Specific encodings and algorithms for these classes are outside this architecture.¶
A conforming design MUST identify the relationship context whose communication it realizes. It MUST NOT define relationship continuity solely as continued possession of a locator, route, carrier attachment, or ephemeral session handle.¶
Relationships, identities, sessions, trajectories, routes, paths, adjacencies, and carriers have distinct lifetimes. A conforming design MUST define transitions among them without silently equating one object with another.¶
Operational selectors are local unless another authenticated scope is explicitly defined. Local selectors MUST NOT be interpreted as global addresses or identities. An intermediary can rewrite local forwarding selectors while preserving end-to-end relationship semantics.¶
A conforming design SHOULD support replacement of a failed or obsolete realization mechanism without replacing the relationship when continuity can be authenticated. When continuity cannot be authenticated, the design MUST fail or establish a new relationship according to explicit policy. It MUST NOT silently reset replay, ordering, identity, or authorization state while claiming continuity.¶
A conforming protocol suite MUST permit two participants possessing sufficient local relationship information and a compatible carrier to communicate without consulting a mandatory global naming, routing, identity, governance, or ledger service. A profile can depend on external services, but that dependency is a property of the profile and not a universal architectural requirement.¶
The PRP architecture MUST NOT require IPv4, IPv6, or any other particular network-layer protocol as a universal prerequisite. A conforming realization can operate over any compatible carrier capable of moving protocol units between adjacent participants.¶
A profile MAY require IP or another network technology. That dependency is a property of the profile, not of PRP itself. When an IP-based profile is used, IP addresses and routing are scoped realization mechanisms and MUST NOT become participant identity, relationship continuity, or authorization.¶
Services operate above these concerns. A protocol can combine layers in one component, message, or cryptographic transcript, but it MUST retain their semantic boundaries.¶
A function belongs to the architectural core only when every valid deployment requires it, it cannot be supplied as an optional service, and omitting it would invalidate the relationship-centric model.¶
This section is non-normative. It illustrates the distinction between a relationship and its realizations without prescribing messages or implementation components.¶
This sequence does not require a globally resolvable participant name. A selected profile can require a self-certifying identity, a provisioned trust anchor, a pseudonymous continuity key, or another explicitly specified mechanism.¶
This section is non-normative. The examples illustrate consequences of the architecture and do not prescribe protocol mechanisms or deployment models.¶
Two participants communicate while one moves between carrier attachments and receives different locators. Paths and transport state can be replaced, but the relationship need not be recreated. The replacement is accepted only when the selected profile authenticates continuity and preserves the relationship's authorization constraints.¶
Participants can retain a relationship while no valid trajectory, path, or compatible carrier is available. Later reachability supplies a new opportunity to communicate; it does not by itself restore authority. Communication resumes only after continuity is established under the relationship policy.¶
A relationship can constrain a participant to a scoped or pseudonymous identity without requiring a globally resolvable name or civil identity. The scope, acceptable identity evidence, and authorized actions remain explicit properties of that relationship. The absence of a global name does not imply anonymity or prevent correlation.¶
Discovery produces candidates or information used to realize a relationship. It does not establish identity, trust, continuity, or authorization unless a separate authenticated procedure explicitly says so.¶
Routing constructs and maintains trajectories through scoped directional route decisions. A relationship can be direct or transit one or more forwarding participants. Transit does not grant an intermediary authority over endpoint identity or application authorization.¶
Aggregation is an optional scaling and privacy mechanism. Direct relationships remain architecturally valid. An aggregation profile MUST specify what an aggregator learns, which statements it authenticates, and which decisions remain reserved to endpoints. It MUST preserve the independent relationship, identity, continuity, and authorization boundaries defined by this architecture.¶
PRP is independent of the Internet Protocol. It does not require IPv4, IPv6, or any other particular network-layer protocol. A PRP realization can operate over any compatible carrier capable of moving protocol units between adjacent participants.¶
An IP-based profile can use IP addresses, routing, and transport protocols as optional realization mechanisms. IPv6 continues to provide packet delivery as described in [RFC8200] when such a profile uses it. This does not make IP an architectural prerequisite, and possession of an IP address does not establish participant identity, relationship continuity, or authorization.¶
Transport protocols already separate some connection state from a particular path. For example, QUIC supports connection migration [RFC9000]. That continuity is transport-specific; PRP defines a relationship context that can outlive and authorize replacement of the complete transport session.¶
Other architectures separate endpoint identity from routing location. The Host Identity Protocol [RFC7401] introduces a host identity namespace, while the LISP architecture [RFC9299] separates endpoint identifiers from routing locators. PRP does not replace those mechanisms. It distinguishes both identity and locator from the relationship that determines continuity and authorization, and a PRP profile can use such mechanisms as realizations.¶
The architecture therefore does not claim that identity-locator separation, path migration, or authenticated sessions are new individually. Its contribution is the explicit relationship object and the invariants that prevent those replaceable mechanisms from becoming implicit sources of persistent authority.¶
Relationship primacy does not itself provide cryptographic security. Every protocol profile MUST specify authenticated principals and transcript scope, confidentiality and integrity properties, replay domains, authorization inputs, selector and generation scopes, key and state lifetimes, exhaustion and amplification bounds, downgrade protection, and failure behavior.¶
A carrier-security claim does not imply end-to-end security. Adjacent authentication does not imply service authorization. A self-certifying identifier demonstrates control of key material but does not establish an external civil identity or authorize arbitrary services.¶
Continuity creates valuable long-lived state and is therefore a target for fixation, rollback, replay, and confused-deputy attacks. A replacement realization MUST be bound to the exact relationship, participants, direction, generation, and authorization policy required by its profile. State from one scope MUST NOT be admitted into another merely because identifiers or byte lengths coincide.¶
Unknown or malformed security-critical values MUST fail closed unless a specification defines a safe extension rule. Loss of continuity evidence MUST NOT be repaired by silently accepting reachability, a local handle, or unauthenticated forwarding state as equivalent authority.¶
Persistent relationships can increase the impact of compromised trust material. Profiles must define revocation, recovery, key replacement, and the point at which continuity can no longer be safely claimed. Denial-of-service protections must bound retained state, verification work, retries, referrals, and fanout per authenticated authority.¶
Relationship-centric operation does not inherently provide anonymity, unlinkability, traffic-flow confidentiality, resistance to correlation, or availability. A stable relationship context can itself become a correlation surface even when routes, addresses, and session keys change.¶
Profiles MUST state which relationship identifiers, participant references, timing signals, path changes, and service metadata are visible to carriers, intermediaries, discovery services, and peers. Operational selectors should have the narrowest practical scope and lifetime. Implementations should avoid exposing durable relationship state where an ephemeral correlation is sufficient.¶
Padding, batching, multipath, private discovery, aliases, and cover traffic can reduce particular observations, but each requires separate analysis. No deployment should infer privacy properties merely from the absence of globally meaningful addresses or civil identities.¶
Relationship, trajectory, route-decision, path, session, and carrier state should be observable as distinct objects so that operators do not mistake path availability for relationship authorization. Diagnostics should identify scope and generation while avoiding disclosure of long-lived trust material or globally correlatable identifiers.¶
Implementations need explicit bounds for relationship state, candidate trajectories and paths, route decisions, concurrent sessions, retained replay information, and recovery attempts. Replacement should normally be make-before-break when the selected profiles can authenticate continuity, but an implementation must prefer loss of availability over an unauthorized continuity claim.¶
Interoperability depends on protocol profiles that instantiate this architecture. Architectural conformance alone does not imply wire compatibility.¶
Extensions MUST preserve the invariants in this document. An extension that requires globally stable locators, equates routes with identity, or makes optional governance a universal prerequisite is not architecturally conforming.¶
Protocol versions and profiles MUST define explicit selection and failure behavior. Negotiation MUST NOT silently weaken authenticated properties or reinterpret assigned values. Migration SHOULD preserve relationship continuity through an authenticated make-before-break procedure when both profiles permit it.¶
A design conforms to this architecture only if it:¶
Conformance to this architecture does not imply conformance to a particular wire protocol, discovery mechanism, routing protocol, carrier binding, or service profile.¶
This document has no IANA actions.¶
The author thanks the contributors and implementers whose independent protocol work exposed the architectural distinctions documented here. Specific reviewers will be acknowledged in subsequent revisions.¶