Participant Relationship Protocol

Archived criterion

F25-BL: Yes

Archived previous-definition assessment — revision 5.73. Retired in 5.82; excluded from the active matrix and counts. This historical verdict is not a current assessment.

Historical wake-traffic inventory (cutoff retired)

Rationale

Use the already selected provisioned leaf LAN of the Babel-routed ULA hierarchy, consistent with D01-BL. Babel continues to maintain routes between infrastructure routers; the ordinary leaf endpoint does not become a Babel speaker. Allow 14 bounded IPv6 control frames for address checks, MLD reports/query, router discovery and neighbor-cache repair, each at most 256 byte-times including Ethernet overhead. Two IPv6 datagrams each carrying 256 useful bytes cost 334 byte-times each. Total upper bound: 4,252, below the 65,536-byte F25 budget.

Assessment method

Constructive documentary endpoint byte bound

Source context

Existing leaf-role decision and primary IPv6/Babel specifications

Outstanding qualification

Configured Ethernet leaf with retained ULA, link-local address, numeric peer and router configuration; one prefix, two solicited-node groups, no source-list growth, MLD robustness two, no unrelated traffic. Leaf-facing LAN is not a Babel adjacency interface; Babel routing on inter-router links remains part of the selected stack. Infrastructure is available as required by F25, but its control traffic outside this endpoint interface is not charged. Allow fresh neighbor discovery and address checks; finish before additional periodic maintenance or retries. No DNS, DHCP, TCP, TLS or cryptographic peer authentication is introduced. This is documentary plausibility for the existing leaf role, not a bound for a sleeping Babel transit router, arbitrary topology, energy or runtime performance.

Public sources

Editorial evidence references

The following identifiers refer to research records not included in this public package; they are not public links.