a positive test proves Ze does what the requirement demands and a negative one proves it refuses what the requirement forbids
DRAFT-ABRAITIS-IDR-ADDPATH-PATHS-LIMIT - Scalability Considerations for ADD-PATH with PATHS-LIMIT
Every requirement this repository extracted from DRAFT-ABRAITIS-IDR-ADDPATH-PATHS-LIMIT, the tests bound to it, and what a reader has verified about them. This summary is enrolled and gated by ./le rfc check.
Overview
Positive
what Ze has
the requirement admits no counter-case, so one polarity plus a recorded reason is the whole proof available for it
one direction is tested, the other is neither tested nor excused, and nothing states which
scoped tests exist; the remaining obligation is unmet or unproven, with zero whole-requirement credit
no test carries the requirement id, whether or not a gap states why
a red was observed once under a recorded procedure, and the unit, the claim and the producer it rested on still hash to what was recorded. The break is not re-run. A test pair is not a proof until one has been observed
Neutral
measures that are neither good news nor bad
MUST-level requirements the gate HOLDS. A population, not a result: the shares beside it are what says how Ze stands
an obligation that does not bind Ze. A {not-applicable} annotation says it never bound; a {feature-declined} annotation says its condition is an optional feature Ze does not offer, and quotes the RFC sentence that makes it optional. Scope, not coverage: it stays in the denominator every share on this page is taken over
a {not-applicable} annotation says the obligation does not bind Ze, so no test is owed for it. It stays in the denominator every share here is taken over
a {lower-layer} annotation says a layer under Ze performs the behavior, on state Ze installs into that layer, and names the producer that installs it. The obligation binds Ze and is met; Ze proves none of it, because its own boundary carries no value the behavior reads
a {feature-declined} annotation says the obligation is conditional on a feature the RFC makes optional and Ze does not offer, and it quotes the sentence that makes it optional. The condition is false, so nothing is owed and nothing is missing. It stays in the denominator every share here is taken over
Negative
what Ze owes
1 weak, wrong or unimplemented, 0 no longer current. Each is named below under its own requirement id
The 8 shares marked as a part above are the whole of the 4 gated MUSTs: they add to 100%. Proven by a recorded break is a share of TAGGED UNITS, a different population, so it is not one of them.
How to read the colors
A color names what the measure MEANS, not how well Ze scores on it. Green is a good outcome at any value, red is a bad one, and neither a population nor a scope count is an outcome, so both take no color. The number under the label is what says how far Ze has got.
| Card | Tone here | Why that color |
|---|---|---|
| Gated MUSTs | neutral | no color: a population is a scale, and a larger one is neither good news nor bad. It is the accounting total |
| Out of scope | neutral | no color: an obligation that never bound Ze is neither an achievement nor a failure, and counting it either way would be a claim |
| Tested both ways | ok | green at every value: a test pair is the outcome this gate exists to produce, and the share under the label is what says how far Ze has got |
| One polarity plus reason | ok | green at every value: where no counter-case exists, one polarity IS the complete answer, and a recorded reason is what the gate demands beside it |
| One polarity, unexcused | ok | green at zero, RED above it: half a proof with no reason for the other half |
| Partial proof; remaining gap | ok | green at zero, RED above it: a tested clause cannot prove the whole requirement |
| No test at all | ok | green at zero, RED above it: a binding obligation nothing exercises is a claim with nothing behind it, whether or not a reason is stated |
| Not applicable | neutral | no color: an obligation that never bound Ze is neither an achievement nor a failure, and counting it either way would be a claim |
| Met below Ze | neutral | no color: an obligation met below Ze is neither a test Ze wrote nor work Ze owes, and the two green shares above are what says how much Ze proves itself |
| Optional feature declined | neutral | no color: an obligation whose condition Ze never meets is neither an achievement nor a failure. The absent FEATURE is disclosed on the RFC's own status row, as an implementation gap a later scope decision can revisit |
| Proven by a recorded break | ok | green at every value: an observed break is the outcome the discrimination gate exists to produce. The denominator is TAGGED UNITS, not obligations, so this share is not one of the parts above |
| Audit verdicts | bad | RED on the first weak, wrong or unimplemented verdict, amber while a verdict is no longer current or a gated MUST is unjudged, green when every one is judged sound and current |
At a glance
| Field | Value |
|---|---|
| Public status | Supported |
| Enrolment | Enrolled |
| Requirements | 7 |
| Gated MUST-level | 4 |
| Not applicable, so out of scope | 0 |
| Declared gaps | 0 |
| Declared gaps a test demonstrates | 0 |
| Gated with no test | 0 |
| Nightly-only evidence | 0 |
| Test tags | 23 |
| Tagged units | 23 |
| Recorded audit verdicts | 7 |
| Discrimination records | 11 |
| Summary | rfc/short/draft-abraitis-idr-addpath-paths-limit.md |
| Requirement shard | rfc/requirements/draft-abraitis-idr-addpath-paths-limit.md |
| RFC text | rfc/drafts/draft-abraitis-idr-addpath-paths-limit.txt |
Enrolment
Enrolled: BGP ADD-PATH Paths-Limit capability (code 76): four MUST-level requirements with positive and negative test carriers. For 3-1, coalescePathsLimit in internal/component/bgp/reactor/session_negotiate.go merges configuration and plugin declarations; TestBuildOpenCoalescesPathsLimit checks multiple families in one emitted instance and prevents repeated input instances from leaking into OPEN. For 3-2 and 3-3, core capability negotiation tests cover ADD-PATH present/absent and matching/unmatched families; for 3-4, TestParsePathsLimitDuplicateFirstWins covers retaining the first tuple and ignoring later duplicates. SHOULD-level zero handling (3-5) and session-wide sender enforcement (3-6) have separate parser, negotiation, and sender regression carriers.
What the public ledger says
Status: Supported
What the ledger says is covered
Receiver-advertised per-family path-count requests for ADD-PATH, with session-wide outbound enforcement across normal sends and forwarding, including the route-server fast path. The configuration knob states a request to the peer and does not bound what Ze accepts: a peer that ignores it is not policed.What the ledger says remains:
-Coverage
| Bucket | Count | What it counts |
|---|---|---|
| Positive and negative tests | 4 | one part of the gated population |
| Annotated (including scoped evidence) | 0 | one part of the gated population |
| One polarity only | 0 | one part of the gated population |
| No test and no annotation | 0 | one part of the gated population |
| Partial proof; remaining gap (subset of annotated; zero whole-requirement credit) | 0 | an overlay: each of these is also counted by the part it falls in |
| Evidence that runs nightly only | 0 | an overlay: each of these is also counted by the part it falls in |
| Derived from other rows | 0 | outside the gated population: each asserts nothing and derives its state from the rows it names, which the parts above already count |
| Gated MUST-level requirements | 4 | every gated MUST falls in exactly one bucket above |
Positive and negative tests (4): DRAFT-ABRAITIS-IDR-ADDPATH-PATHS-LIMIT-3-1, DRAFT-ABRAITIS-IDR-ADDPATH-PATHS-LIMIT-3-2, DRAFT-ABRAITIS-IDR-ADDPATH-PATHS-LIMIT-3-3, DRAFT-ABRAITIS-IDR-ADDPATH-PATHS-LIMIT-3-4
Requirements
| Requirement | Level | Section | Tests |
|---|---|---|---|
DRAFT-ABRAITIS-IDR-ADDPATH-PATHS-LIMIT-3-1 | A BGP speaker that wishes to indicate support for multiple AFI/SAFIs MUST do so by including the information in a single instance of the PATHS-LIMIT capability. (§3) | ||
| MUST | 3 - PATHS-LIMIT Capability | ||
DRAFT-ABRAITIS-IDR-ADDPATH-PATHS-LIMIT-3-2 | The PATHS-LIMIT capability MUST be ignored if the ADD-PATH capability is not present. (§3) | ||
| MUST | 3 - PATHS-LIMIT Capability | ||
DRAFT-ABRAITIS-IDR-ADDPATH-PATHS-LIMIT-3-3 | An AFI/SAFI tuple MUST be ignored if the same tuple was not received in the ADD-PATH capability. (§3) | ||
| MUST | 3 - PATHS-LIMIT Capability | ||
DRAFT-ABRAITIS-IDR-ADDPATH-PATHS-LIMIT-3-4 | If more than one tuple is received for the same AFI/SAFI pair, only the first tuple should be considered. All others MUST be ignored. (§3) | ||
| MUST | 3 - PATHS-LIMIT Capability | ||
DRAFT-ABRAITIS-IDR-ADDPATH-PATHS-LIMIT-3-5 | If the received Paths Limit is zero (0), the tuple SHOULD be ignored. (§3) | ||
| SHOULD | 3 - PATHS-LIMIT Capability | ||
DRAFT-ABRAITIS-IDR-ADDPATH-PATHS-LIMIT-3-6 | A sender advertising multiple paths for the same prefix SHOULD send only the specified maximum number of paths indicated in the PATHS-LIMIT capability. (§3) | ||
| SHOULD | 3 - PATHS-LIMIT Capability | ||
DRAFT-ABRAITIS-IDR-ADDPATH-PATHS-LIMIT-3-7 | An implementation SHOULD provide a configuration knob to specify the maximum number of paths to accept from a sender. (§3) | ||
| SHOULD | 3 - PATHS-LIMIT Capability | ||
Gaps and untested MUSTs
DRAFT-ABRAITIS-IDR-ADDPATH-PATHS-LIMIT declares no gap, and every gated MUST it carries has a test bound to it.
Proof state
A tagged unit reads unproven where no discrimination record exists for it: nothing in this tree has been observed to break it, so the claim its tag makes is unproven.
DRAFT-ABRAITIS-IDR-ADDPATH-PATHS-LIMIT-3-1
A BGP speaker that wishes to indicate support for multiple AFI/SAFIs MUST do so by including the information in a single instance of the PATHS-LIMIT capability. (§3)
Audit verdict: enforced (the tests do what the requirement demands), fresh. Re-judged on 2026-09-11 against the draft text and both carriers, after the config-parser carrier's claim was reworded. Section 3: "A BGP speaker that wishes to indicate support for multiple AFI/SAFIs MUST do so by including the information in a single instance of the PATHS-LIMIT capability." TestBuildOpenCoalescesPathsLimit is what proves it. It drives buildOpen, the one producer of ze's OPEN, with four PATHS-LIMIT inputs: an empty configured instance, a configured ipv4/unicast tuple, and two raw code-76 plugin payloads carrying a duplicate and a zero tuple. It re-parses the encoded OPEN and makes two distinct assertions, not one wearing two hats. The negative is the draft's own violation shape offered as input, several instances in and require.Len(limits, 1) out. The positive is that the information for both families travels inside that one instance, pinned as exactly [ipv4/unicast 4, ipv4/multicast 3]. buildOpen runs twice in the loop, so a second OPEN over the same caller-owned capabilities cannot leak a second instance either. The read-back drops the plugin's ipv6/unicast limit-0 tuple under 3-5, which is why the expectation names two families and not three; the instance-count assertion is untouched by that skip, so no neighbouring rule decides this one. coalescePathsLimit (internal/component/bgp/reactor/session_negotiate.go) is the enforcing function and buildOpen calls it on every OPEN. Both polarities carry a discrimination record over it: "merged == nil" -> true emits four instances and reds the negative, "seen[f]" -> true empties the merged instance and reds the positive. TestParsePeerCapabilityPathsLimitSingleInstance is a subordinate positive one hop short of the wire, and its reworded claim now matches its body: it reads the capability list parsePeerFromTree BUILDS, asserts one *capability.PathsLimit holding both configured families, and never encodes or parses an OPEN. It adds no proof of this requirement, because the regression it prevents cannot reach a peer: a parser emitting one instance per family is merged back into one by coalescePathsLimit before any OPEN is encoded, and the other readers of ps.Capabilities (configuredCapabilities, read in reactor.go and reactor_api.go) take Multiprotocol families and ConfigProvider values rather than PATHS-LIMIT framing. It stays tagged as a true config-path regression guard whose claim no longer over-states it. Whether a redundant carrier is worth keeping is an owner decision, not an audit finding. Re-read 2026-09-24 against Section 3 ("A BGP speaker that wishes to indicate support for multiple AFI/SAFIs MUST do so by including the information in a single instance of the PATHS-LIMIT capability."): the only change to TestBuildOpenCoalescesPathsLimit was the rename SetPluginCapabilityGetter to setPluginCapabilityGetter. The inputs, the require.Len(limits, 1) negative and the exact two-entry positive are unchanged, and coalescePathsLimit is untouched, so the verdict stands. Re-judged 2026-09-27 by QF-2 after the row was replaced by the verbatim §3 sentence; the obligation is the one the note above judged, and the tagged units are unchanged. Enforced stands.
| Polarity | Test | Kind and tier | Proof state |
|---|---|---|---|
| negative | TestBuildOpenCoalescesPathsLimit |
unit/verify | mutant, verified |
| positive | TestParsePeerCapabilityPathsLimitSingleInstance |
unit/verify | unproven |
| positive | TestBuildOpenCoalescesPathsLimit |
unit/verify | mutant, verified |
DRAFT-ABRAITIS-IDR-ADDPATH-PATHS-LIMIT-3-2
The PATHS-LIMIT capability MUST be ignored if the ADD-PATH capability is not present. (§3)
Audit verdict: enforced (the tests do what the requirement demands), fresh. Re-judged on 2026-09-20 by an independent reader, after Negotiate's signature moved from (local, remote []Capability, localASN, peerASN uint32) to (local, remote []Capability, identity PeerIdentity). Inside each unit named here the change is one line, the call shape, and every assertion is byte-identical (git diff HEAD over internal/core/bgp/capability/negotiated_test.go). The new shape cannot move what these cases prove: Negotiate reads identity only where it stores LocalASN and PeerASN on the Negotiated, and where buildSubComponents copies the struct into n.Identity. No branch in Negotiate, and none in negotiatePathsLimitDirection, reads Internal or either AS number, so the iBGP verdict the struct now carries has no path to the PATHS-LIMIT maps. The identity each call passes is self-consistent too: 65001 against 65002 with Internal left false is an external session, which is what the two positional AS numbers meant before. Section 3: "The PATHS-LIMIT capability MUST be ignored if the ADD-PATH capability is not present." TestNegotiatePathsLimit is the positive: ADD-PATH both-mode for ipv4/unicast on both sides, and the two directions are pinned on exact, distinct values, the remote's 10 in PathsLimitSend and the local's 5 in PathsLimitRecv, so a direction swap and a floor reading each fail it. TestNegotiatePathsLimitNoAddPath is the negative: the same two PATHS-LIMIT capabilities with no ADD-PATH on either side, and both maps must stay at zero. The producing branch is "n.addPath[f]&direction == 0" in negotiatePathsLimitDirection (internal/core/bgp/capability/negotiated.go); remove it and the negative reads 10 and 5, so the assertion discriminates. The negative buffer holds Multiprotocol and PathsLimit only, so no neighbouring rule decides it. Ze is stricter than the sentence, because it requires the negotiated DIRECTION and not the bare presence of ADD-PATH. A limit on paths the session will never carry changes nothing on the wire, so the stricter reading implements the requirement rather than falling short of it. No discrimination record: both tags predate HEAD and the gate grandfathers them. 2026-09-26 RE-AUDIT, stale-requirement: the checklist line lost its quotation marks and gained the sentence's full stop, so it is now a verbatim span of Section 3 of rfc/drafts/draft-abraitis-idr-addpath-paths-limit.txt. The obligation is the sentence this note already quotes, and the tagged units are byte-identical (TestNegotiatePathsLimitNoAddPath re-read this pass: both PATHS-LIMIT maps must stay zero with no ADD-PATH). Verdict unchanged.
| Polarity | Test | Kind and tier | Proof state |
|---|---|---|---|
| negative | TestNegotiatePathsLimitNoAddPath |
unit/verify | unproven |
| positive | TestNegotiatePathsLimit |
unit/verify | unproven |
DRAFT-ABRAITIS-IDR-ADDPATH-PATHS-LIMIT-3-3
An AFI/SAFI tuple MUST be ignored if the same tuple was not received in the ADD-PATH capability. (§3)
Audit verdict: enforced (the tests do what the requirement demands), fresh. Re-judged on 2026-09-20 by an independent reader, after Negotiate's signature moved from (local, remote []Capability, localASN, peerASN uint32) to (local, remote []Capability, identity PeerIdentity). Inside each unit named here the change is one line, the call shape, and every assertion is byte-identical (git diff HEAD over internal/core/bgp/capability/negotiated_test.go). The new shape cannot move what these cases prove: Negotiate reads identity only where it stores LocalASN and PeerASN on the Negotiated, and where buildSubComponents copies the struct into n.Identity. No branch in Negotiate, and none in negotiatePathsLimitDirection, reads Internal or either AS number, so the iBGP verdict the struct now carries has no path to the PATHS-LIMIT maps. The identity each call passes is self-consistent too: 65001 against 65002 with Internal left false is an external session, which is what the two positional AS numbers meant before. Section 3: "An AFI/SAFI tuple MUST be ignored if the same tuple was not received in the ADD-PATH capability." TestNegotiatePathsLimitPartialAddPath carries both polarities on two distinct assertions, not one assertion wearing two hats: ipv4/unicast is present in ADD-PATH, so its tuple applies in both directions and is pinned at 10 and 5, and ipv6/unicast is absent from ADD-PATH while its PATHS-LIMIT tuple sits in the same capability, so both directions must stay zero. The buffer isolates this rule: both sides advertise Multiprotocol for ipv6/unicast, so ipv6 is a negotiated family and the only thing that can drop its tuple is the ADD-PATH check. Were ipv6 missing from Multiprotocol, the family intersection would decide the case and the test would prove nothing here. Same producing branch as 3-2, evaluated per family; remove it and ipv6 reads 8 and 3. No discrimination record: the tags predate HEAD. 2026-09-26 RE-AUDIT, stale-requirement: the checklist line lost its quotation marks and gained the sentence's full stop, so it is now a verbatim span of Section 3 of rfc/drafts/draft-abraitis-idr-addpath-paths-limit.txt. The obligation is the sentence this note already quotes, and the tagged units are byte-identical (TestNegotiatePathsLimitNoAddPath re-read this pass: both PATHS-LIMIT maps must stay zero with no ADD-PATH). Verdict unchanged.
| Polarity | Test | Kind and tier | Proof state |
|---|---|---|---|
| negative | TestNegotiatePathsLimitPartialAddPath |
unit/verify | unproven |
| positive | TestNegotiatePathsLimitPartialAddPath |
unit/verify | unproven |
DRAFT-ABRAITIS-IDR-ADDPATH-PATHS-LIMIT-3-4
If more than one tuple is received for the same AFI/SAFI pair, only the first tuple should be considered. All others MUST be ignored. (§3)
Audit verdict: enforced (the tests do what the requirement demands), fresh. TestParsePathsLimitDuplicateFirstWins parses two ipv4/unicast tuples, limit 10 then limit 20, and requires one entry whose limit is 10. The positive is the kept value and the negative is the count, which are separate assertions over the same buffer. Removing the "seen[f]" guard in parsePathsLimit (internal/core/bgp/capability/capability.go) yields two entries, so the count assertion discriminates. No discrimination record: the tags predate HEAD. Re-judged 2026-09-27 by QF-2 after the row was replaced by the verbatim §3 sentence; the obligation is the one the note above judged, and the tagged units are unchanged. The quote adds the sentence's lowercase 'should' for the first-tuple half; TestParsePathsLimitDuplicateFirstWins asserts one entry with limit 10 from tuples 10 then 20, so keeping the second or both goes red. Enforced stands.
| Polarity | Test | Kind and tier | Proof state |
|---|---|---|---|
| negative | TestParsePathsLimitDuplicateFirstWins |
unit/verify | unproven |
| positive | TestParsePathsLimitDuplicateFirstWins |
unit/verify | unproven |
DRAFT-ABRAITIS-IDR-ADDPATH-PATHS-LIMIT-3-5
If the received Paths Limit is zero (0), the tuple SHOULD be ignored. (§3)
Audit verdict: enforced (the tests do what the requirement demands), fresh. Re-judged on 2026-09-20 by an independent reader, after Negotiate's signature moved from (local, remote []Capability, localASN, peerASN uint32) to (local, remote []Capability, identity PeerIdentity). Inside each unit named here the change is one line, the call shape, and every assertion is byte-identical (git diff HEAD over internal/core/bgp/capability/negotiated_test.go). The new shape cannot move what these cases prove: Negotiate reads identity only where it stores LocalASN and PeerASN on the Negotiated, and where buildSubComponents copies the struct into n.Identity. No branch in Negotiate, and none in negotiatePathsLimitDirection, reads Internal or either AS number, so the iBGP verdict the struct now carries has no path to the PATHS-LIMIT maps. The identity each call passes is self-consistent too: 65001 against 65002 with Internal left false is an external session, which is what the two positional AS numbers meant before. Section 3: "If the received Paths Limit is zero (0), the tuple SHOULD be ignored." The two parser carriers were re-read and are unchanged in the tree. parsePathsLimit marks a family seen BEFORE it skips a zero limit, which the draft requires: the first tuple is the one considered, and "All others MUST be ignored", so a first tuple of zero leaves that family with no limit whatever a later duplicate says. TestParsePathsLimitSkipZero pins the plain skip on exact entries, one entry holding ipv6 with 5, and TestParsePathsLimitZeroFirst pins that interplay on the exact entry slice, ipv4/unicast absent even though a later duplicate advertises 10. TestNegotiatePathsLimitDuplicateEntries runs one set of tuples through the direct API and through the wire parser and requires both negotiated maps to equal exactly {ipv6: 7}, with an explicit NotContains on ipv4. That assertion is a genuine 3-5 negative and not a 3-4 one in disguise: the ipv4 tuple that arrives FIRST is the zero, so an implementation that kept first-wins and dropped the zero skip would store ipv4 at 0 and the map equality would fail. All three units carry a discrimination record over "limit == 0" -> false in parsePathsLimit, under which each was observed red. Re-judged 2026-09-27 by QF-2 after the row was replaced by the verbatim §3 sentence; the obligation is the one the note above judged, and the tagged units are unchanged. Enforced stands.
| Polarity | Test | Kind and tier | Proof state |
|---|---|---|---|
| negative | TestParsePathsLimitSkipZero |
unit/verify | mutant, verified |
| negative | TestParsePathsLimitZeroFirst |
unit/verify | mutant, verified |
| negative | TestNegotiatePathsLimitDuplicateEntries |
unit/verify | unproven |
| positive | TestParsePathsLimitSkipZero |
unit/verify | mutant, verified |
| positive | TestNegotiatePathsLimitDuplicateEntries |
unit/verify | unproven |
DRAFT-ABRAITIS-IDR-ADDPATH-PATHS-LIMIT-3-6
A sender advertising multiple paths for the same prefix SHOULD send only the specified maximum number of paths indicated in the PATHS-LIMIT capability. (§3)
Audit verdict: enforced (the tests do what the requirement demands), fresh. draft-abraitis-idr-addpath-paths-limit-04 §3 states: 'A sender advertising multiple paths for the same prefix SHOULD send only the specified maximum number of paths indicated in the PATHS-LIMIT capability.' This is a per-prefix path COUNT, not a maximum numeric Path Identifier. Re-read the primary clause, summary and unannotated checklist row, all three tagged covers, and their producers. TestPathsLimitSessionAcrossUpdates negotiates limit 2 separately for IPv4 and IPv6 and reads emitted socket frames: announcements must be exactly [0,1,1,4], withdrawals exactly [99,0], and a subsequent all-withheld batch must emit no bytes. These assertions distinguish excess admissions, same-ID changed-MED replacement, an unknown withdrawal that must not free capacity, and a real withdrawal followed by admission. TestPathsLimitForwardWritersShareState exercises raw and re-encoded writers against one session budget and requires exactly [5,7], excluding same-prefix ID 6 while admitting a different prefix; identifiers above the numeric limit therefore demonstrably remain legal. paths-limit-live.ci independently advertises IPv4=1 and IPv6=2 against Ze's receive request of 9 and requires ordered exact wire frames, including different-prefix ID-99 sentinels, replacements, withdrawals and explicit retries. Its final OK marker is printed by pathsLimitLive only after all operator commands and the independent peer workflow succeed, not merely after reaching the producer. Source tracing confirms initPathsLimit uses negotiated outbound limits, pathsLimitSection counts admitted identifiers per family/prefix, and filterPathsLimit supplies the final bytes to the shared socket writer. In job-final-selective-and-vpn-bindings-7b4c75a2.log, the genuine selective guard mutations are killed at the exact [5,7] assertion: guard=true yields [], guard=false yields [5,6,7]. Those observations discriminate admission behavior; the separate whole-function halt can fail at initial EOR and establishes reachability only. The corrected CI comment now accurately describes the existing executable assertions. No partial or implementation-gap annotation is needed for this clause.
| Polarity | Test | Kind and tier | Proof state |
|---|---|---|---|
| negative | TestPathsLimitForwardWritersShareState |
unit/verify | mutant, verified |
| negative | TestPathsLimitSessionAcrossUpdates |
unit/verify | revert, verified |
| negative | paths-limit-live.ci |
functional/verify | revert, verified |
| positive | TestPathsLimitForwardWritersShareState |
unit/verify | mutant, verified |
| positive | TestPathsLimitSessionAcrossUpdates |
unit/verify | revert, verified |
| positive | paths-limit-live.ci |
functional/verify | revert, verified |
DRAFT-ABRAITIS-IDR-ADDPATH-PATHS-LIMIT-3-7
An implementation SHOULD provide a configuration knob to specify the maximum number of paths to accept from a sender. (§3)
Audit verdict: weak (the tests pass over code that does not enforce the requirement), fresh. The pair over TestConfiguredPathsLimitOpen is a strong test of half the sentence and nothing tests the other half. What it checks: the container knob `session > capability > add-path > limit`, the per-family override, and the interaction with disabled, refused and required families decide the tuples encoded in the OPEN, with an omitted limit advertising none and a disabled or refused family unable to carry an orphan tuple. parseAddPathFromTree (internal/component/bgp/reactor/config_capabilities.go) derives the tuples from addPath.Families, the same slice that reaches the wire. What nothing checks, because no code does it: the draft asks for a knob that specifies "the maximum number of paths to accept from a sender", and ze's knob states a number to the peer without bounding what ze accepts. EncodingCaps.PathsLimitRecv is read by internal/core/bgp/context/context.go, internal/component/bgp/format/json.go and internal/component/bgp/reactor/negotiated.go, all of which carry it into a negotiated context or into show output, and no reader drops a received path above it. A peer that ignores the request is not policed. The verdict is weak rather than enforced because the tag ties this body to the whole requirement, and the reading under which "accept" means local enforcement is not proven by anything. The absent behavior is disclosed on the summary's Support remaining row. No discrimination record was written, because the owner's open decision on building the receive side can reword this claim, and rewording stales a record. Re-judged 2026-09-27 by QF-2 after the row was replaced by the verbatim §3 sentence; the obligation is the one the note above judged, and the tagged units are unchanged. Weak stands: the receive-side clause, 'the maximum number of paths to accept from a sender', has no enforcing code and no assertion.
| Polarity | Test | Kind and tier | Proof state |
|---|---|---|---|
| negative | TestConfiguredPathsLimitOpen |
unit/verify | unproven |
| positive | TestParsePeerCapabilityPathsLimit |
unit/verify | unproven |
| positive | TestConfiguredPathsLimitOpen |
unit/verify | unproven |
Extraction sign-off
| Field | Value |
|---|---|
| Reviewer | ze-work agent, spec-rfcgate-6, draft-abraitis-idr-addpath-paths-limit |
| Signed off | 2026-08-31 |
| Register | rfc2119 |
| Source | rfc/drafts/draft-abraitis-idr-addpath-paths-limit.txt |
| Source fingerprint | 87330146d8f7b5c0 |
| Record | rfc/extraction/draft-abraitis-idr-addpath-paths-limit.json |
| Mapped sentences | 4 |
| Declined as scope | 0 |
| Relocated to a spec, which Ze OWES | 0 |
| Unclassified | 0 |
Sections
| Section | Name | Sites | Disposition | Reason |
|---|---|---|---|---|
front |
not stated | 0 | skipped (front-matter) | Title block, Abstract, Status of This Memo, Copyright Notice and Table of Contents. The Abstract restates section 1 and directs no speaker. |
1 |
Introduction | 0 | walked | Introduction. Indicative prose: ADD-PATH lets a speaker advertise several paths for one prefix, a large number of such paths can exhaust the receiver's memory, and this document defines a capability that tells the sender the receiver's ceiling. No sentence directs a speaker. |
2 |
Specification of Requirements | 0 | walked | Specification of Requirements. The BCP 14 key-words paragraph, which binds no speaker and states how to read the other sections. The derivation excludes it from the site inventory for that reason. |
3 |
PATHS-LIMIT Capability | 4 | walked | PATHS-LIMIT Capability. The document's only normative section: Capability Code 76, the 5-octet AFI/SAFI/Paths-Limit tuple, and four capitalised MUST-level sites mapped below to DRAFT-ABRAITIS-IDR-ADDPATH-PATHS-LIMIT-3-1 through -3-4. Its three remaining directives are advisory and carry no site: ignore a tuple whose Paths Limit is zero, send no more than the advertised maximum, and offer a configuration knob. Those are the unsourced ids below. Two indicative sentences state no obligation: the Paths Limit field description, and "If the PATHS-LIMIT capability is empty (i.e. the Capability Length field is set to 0), it means that the sender doesn't have any specific limits to communicate", which defines what an empty capability means rather than directing a speaker. |
4 |
IANA Considerations | 0 | skipped (iana) | IANA Considerations. Records capability number 76 in the BGP Capability Codes registry. Binds IANA, not a speaker. |
5 |
not stated | 0 | walked | Security Considerations, and with it the unnumbered Acknowledgements, References and Authors' Addresses blocks, which carry no section number and so stay in this body under the heading derivation. The security text states that PATHS-LIMIT mitigates some RFC 7911 concerns and that a rogue or misconfigured node can advertise a limit too low for the application. Its one direction, "Users of the PATHS-LIMIT Capability are encouraged to examine the behavior and potential impact", is an encouragement with no RFC 2119 keyword and binds no speaker. |
A |
Implementation Report | 0 | skipped (appendix-non-normative) | Implementation Report. An RFC 7942 note naming the FRRouting commit that implements the draft. It reports on another implementation and states no obligation. |
Excluded sentences
The walk over DRAFT-ABRAITIS-IDR-ADDPATH-PATHS-LIMIT declined no sentence: every site it found is mapped to a requirement.
Superseded
No document obsoletes DRAFT-ABRAITIS-IDR-ADDPATH-PATHS-LIMIT, so its obligations are stated where they were written.