Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
55 commits
Select commit Hold shift + click to select a range
221c87c
chore(quest): claim quest/m2/cluster-routing/routes/session.md
kixelated Nov 6, 2026
b755d0e
feat(net): present each route's claims at a stream's whole interest
kixelated Nov 6, 2026
6225073
feat(net): one route node per origin, fed the routes it serves itself
kixelated Nov 6, 2026
97419fa
test(net): the route node serves claims through their route's stream
kixelated Nov 6, 2026
30a653f
feat(relay)!: remove cluster.id and refuse zero-cost links
kixelated Nov 6, 2026
8059e16
feat(net)!: lite-07 names a claim's route instead of its hop chain
kixelated Nov 6, 2026
d6ad5ba
feat(net)!: lite-07 announce streams route through the origin's node
kixelated Nov 6, 2026
dbadd77
fix(net): serve lite-07 claims through every feasible route
kixelated Nov 6, 2026
676345f
fix(net): a track that ended keeps its copy when its front ends
kixelated Nov 6, 2026
2923b4c
fix(net): only a grant this side issued scopes a lite-07 peer
kixelated Nov 6, 2026
f1732ec
test: library relays proxy, and lite-07 tests follow routes
kixelated Nov 6, 2026
67c4e65
chore(net): drop the route layer's dead-code allowance
kixelated Nov 6, 2026
917341a
fix(net): drop a lite-06 route carrying this node's route identity
kixelated Nov 6, 2026
28bb2b9
docs: lite-07 routes, proxy opt-in, and lite-06 translation
kixelated Nov 6, 2026
6662e4d
test(net): a lost next hop restarts an epochless route, and lite-07 c…
kixelated Nov 6, 2026
92cc680
test(net): a lite-07 route and its claims count against the announce cap
kixelated Nov 6, 2026
db9b5e3
chore(quest): narrow routes/session.md to bounded per-stream state
kixelated Nov 6, 2026
80fd341
Merge remote-tracking branch 'origin/main' into quest/m2/cluster-rout…
kixelated Nov 6, 2026
2c9c396
chore(net): allow route_hop unused without the async session
kixelated Nov 6, 2026
8ea5612
Merge remote-tracking branch 'origin/main' into feat/route-takeover-c…
kixelated Nov 6, 2026
a627b58
feat(net): lite-07 carries ANNOUNCE_TAKEOVER on Route IDs
kixelated Nov 6, 2026
b9f3078
test: skip native JS lite-07 lanes until js/net speaks the route layer
kixelated Nov 6, 2026
fb3cc76
Merge remote-tracking branch 'origin/main' into feat/route-takeover-c…
kixelated Nov 6, 2026
e896ae7
fix(net): lite-07 receive admits each claim by the limit, bounds pend…
kixelated Nov 6, 2026
0e32a18
fix(net): coalesce a lite-07 stream's unread route outputs per identity
kixelated Nov 6, 2026
06c02b0
Merge remote-tracking branch 'origin/main' into feat/route-takeover-c…
kixelated Nov 6, 2026
2329bb1
chore: leave MIGRATE.md to the release cut
kixelated Nov 6, 2026
6746f6e
refactor(net): name the outbox's merged changes for clippy
kixelated Nov 6, 2026
2d6790d
fix(net): ack routes ended unread at once, so a stalled outbox holds …
kixelated Nov 6, 2026
554fae6
fix(net): present a handle's mounts on lite-07
kixelated Nov 6, 2026
4689bbc
Merge remote-tracking branch 'origin/main' into feat/route-takeover-c…
kixelated Nov 6, 2026
8e03f17
test: retarget the drill mutations and allow the gated lite-07 intero…
pullfrog[bot] Nov 6, 2026
b7a7836
Merge branch 'base' into pr-8023
Nov 6, 2026
9c5b2b9
test(net): supply default node in legacy request helpers
Nov 6, 2026
4e1f0ec
Merge base and resolve route-session hop API conflicts
Nov 6, 2026
e067fe5
fix(net): build the route node without the fuzz feature, retarget a d…
kixelated Nov 7, 2026
c419bbc
Merge remote-tracking branch 'origin/main' into quest/m2/cluster-rout…
kixelated Nov 7, 2026
140af50
fix(net): lite-07 receive streams honor their limit, hold echo slots,…
kixelated Nov 7, 2026
f2e0311
fix(net): keep upstream-learned claims from lite-07 upstreams, answer…
kixelated Nov 7, 2026
7e0897d
style(net): format the new lite-07 tests
kixelated Nov 7, 2026
d5ed89f
test(drill): the lost-publisher mutation compiles against the routed …
kixelated Nov 7, 2026
9c828bc
Merge remote-tracking branch 'origin/main' into quest/m2/cluster-rout…
kixelated Nov 7, 2026
f51f529
fix(net): a coalesced Serve keeps its place behind a takeover
kixelated Nov 7, 2026
42f1afb
Merge remote-tracking branch 'origin/main' into quest/m2/cluster-rout…
kixelated Nov 7, 2026
1f5d053
fix(relay): a removed cluster ID names its removal at startup
kixelated Nov 7, 2026
467cacd
Merge remote-tracking branch 'origin/main' into quest/m2/cluster-rout…
kixelated Nov 7, 2026
70771b3
fix(net): a node that does not proxy keeps lite-06-learned claims to …
kixelated Nov 7, 2026
8a56b87
Merge remote-tracking branch 'origin/main' into quest/m2/cluster-rout…
kixelated Nov 7, 2026
a62431f
merge: preserve cached-track cleanup with base retry argument
Nov 7, 2026
b02bdff
fix(net): initialize routing node in base setup tests
Nov 7, 2026
a6ded82
Merge remote-tracking branch 'origin/main' into quest/m2/cluster-rout…
kixelated Nov 7, 2026
b327b8e
test(interop): skip the browser route key lane until JS speaks the ro…
kixelated Nov 7, 2026
b8494e1
Merge remote-tracking branch 'origin/main' into pr-8023
kixelated Nov 7, 2026
0b70a60
fix(net): bound the lite-07 ROUTE_REQUEST backlog by identity
kixelated Nov 7, 2026
2a7e718
fix(net): a lite-07 answer gives route outputs a turn beside replies
kixelated Nov 7, 2026
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
46 changes: 32 additions & 14 deletions doc/bin/relay/cluster.md
Original file line number Diff line number Diff line change
Expand Up @@ -13,8 +13,20 @@ upstream bandwidth.
Each broadcast carries the list of relays it passed through. That hop list
catches loops and picks the shortest route, and every relay breaks ties the
same way so the cluster converges instead of flapping. Both wire protocols
carry it: natively on moq-lite, and via the [cluster extension](/draft/moq-cluster)
on moq-transport.
carry it: natively on moq-lite up to moq-lite-06, and via the
[cluster extension](/draft/moq-cluster) on moq-transport.

moq-lite-07-wip carries no hop list. Each publishing node declares a random
routing identity, and relays run a distance-vector route to it, loop-free by
Babel's feasibility condition, so every claim of one origin shares that route.
The first relay a request reaches picks the origin node, by a hash of the path
and the node's identity that every relay computes alike, and names it on the
request so later hops follow their own route to that node. A relay running both
Comment thread
kixelated marked this conversation as resolved.
Resolved
versions translates: a moq-lite-06 peer's routes enter the route layer as the
relay's own claims, and lite-07 routes reach a moq-lite-06 peer as a hop list
that starts at their origin node. A relay drops a moq-lite-06 route whose hop
list names its own routing identity, since that is one of its claims coming
back.

A track from a moq-transport publisher keeps its Object IDs, object properties,
and END\_OF\_GROUP status objects across a moq-lite-07 link, since relays
Expand Down Expand Up @@ -94,8 +106,9 @@ max_hops = 6
```

The same setting is `--cluster-max-hops` or `MOQ_CLUSTER_MAX_HOPS`. It covers
moq-lite-03 through moq-lite-07-wip and moq-transport drafts 18 through 22 when
the MoQ Cluster extension is negotiated. A forwarded path counts this relay's
moq-lite-03 through moq-lite-06 and moq-transport drafts 18 through 22 when
the MoQ Cluster extension is negotiated. moq-lite-07-wip routes carry no hop
path, so it does not bound them. A forwarded path counts this relay's
own hop even when its peer appends it on receipt. Older versions and peers
without hop paths hide their depth, which this setting cannot bound.

Expand Down Expand Up @@ -153,9 +166,10 @@ connect = [{ url = "tls://core-a.internal:4443/", upstream = true }]
## Link costs

Add `?cost=N` to a peer URL to route by price instead of hop count. An unpriced
link costs 1, which reproduces plain hop counting. Each relay adds the price of
the link an announcement arrived on before forwarding it, so a route's cost is
the sum of what it crossed.
link costs 1, which reproduces plain hop counting, and 1 is also the minimum: a
cost of 0 is refused. Each relay adds the price of the link an announcement
arrived on before forwarding it, so a route's cost is the sum of what it
crossed.

Routing prefers the longest covering prefix, then a fully identified hop list
over one holding an anonymous hop (0), then the lowest cost, then the shortest
Expand All @@ -165,9 +179,15 @@ the same one for a given path. A publisher connected straight to the relay is
not hashed at its own path: its newest session wins, so a publisher that
restarts takes over from its lingering old session at once.

moq-lite-07-wip carries no hop list, so both hop-list steps drop out: the first
relay ranks the origin nodes announcing a path the same way otherwise, and
remaining ties hash the path with each node's routing identity. Later hops
follow their own route to the node it picked. Routes learned over an older
version rank as above.

```toml
[cluster]
connect = ["https://sibling.same-dc/?cost=0", "https://us-east.example.com/?cost=10"]
connect = ["https://sibling.same-dc/?cost=1", "https://us-east.example.com/?cost=10"]
```

The same policy reads as an object, the only form that accepts `token` and
Expand All @@ -176,7 +196,7 @@ The same policy reads as an object, the only form that accepts `token` and
```toml
[cluster]
connect = [
{ url = "https://sibling.same-dc/", cost = 0 },
{ url = "https://sibling.same-dc/", cost = 1 },
{ url = "https://us-east.example.com/", cost = 10, token = "PEER_JWT" },
]
```
Expand Down Expand Up @@ -253,11 +273,9 @@ decides which relays receive the cluster token.
## Identity

Each relay has a Hop ID: the value it adds to a route's hop list for loop
detection and shortest-path routing. It is random on every start, which is fine
for loop detection but makes a restarted relay look like a new node. Set
`cluster.id` to a stable non-zero 64-bit integer to pin it: below 2^53 if older
browser clients decode it, and below 2^62 to keep loop detection over moq-lite-06
and older links, which carry a larger id as 0.
detection and shortest-path routing. It is random on every start, so a
restarted relay is a new node to the rest of the mesh, and there is no setting
to pin it.

## Failure detection

Expand Down
1 change: 0 additions & 1 deletion doc/bin/relay/config.md
Original file line number Diff line number Diff line change
Expand Up @@ -305,7 +305,6 @@ See [Authentication](/bin/relay/auth).
connect = ["https://us-east.example.com/?cost=10"] # Peers to dial. ?cost prices the link, or use {url, cost, egress, token, upstream} objects.
node = "https://us-west.example.com/" # This relay's own URL.
token = "cluster.jwt" # JWT for dials without an inline ?jwt=.
id = 12345 # Stable Hop ID across restarts.
route_key = "route.key" # Route key; relays sharing the file fail over as one to scoped peers.
max_hops = 32 # Longest accepted/forwarded hop path (1 to 32).

Expand Down
1 change: 1 addition & 0 deletions doc/lib/rs/moq-net.md
Original file line number Diff line number Diff line change
Expand Up @@ -21,6 +21,7 @@ What you use it for, beyond what the concept page already describes:
- **Rank several CDNs.** Dial each with its own subscribe handle, `origin.clone().with_preference(origin::Preference::new(rank))` (higher wins; 0 is neutral and a negative rank demotes), all on one origin. Requests use the preferred link that has a route and fail over to the next; see [multiple CDNs](/concept/moq-lite#multiple-cdns).
- **Request one instance, or follow them all.** `consumer.request(path, None)` resolves the instance serving a path now, and fails `Unroutable` only once discovery has synced with no route for it. `consumer.follow(path, None)` hands out each publisher instance serving a path from `available()`: the first once announced, then each one that takes over, `None` once the path goes offline, and whatever serves it next, like JS `follow(path)`. `consumer.announced()` lists paths only as present or absent. A broadcast already resolved stays on the old instance until dropped or its route goes. See [identity and recovery](/concept/identity) to choose between following and holding one instance.
- **Discovery follows what you watch.** A client session asks the relay for announcements only under the prefixes its subscribe origin's readers watch, with `announced()`, `request`, or `follow`, stops asking about a prefix 2s after nothing at or beneath it is watched, and asks again on reconnect. A broadcast resolved through a discovered route keeps its path watched until dropped. `request` owns discovery of its path, so no separate watch is needed. A server session, or a client fed into an origin handle marked `with_link(origin::Link::Peer)` or `Link::Upstream`, asks for everything it may, so a relay discovers everything. An HTTP gateway (the moq-hls `Server`, the moq-webrtc WHEP router) watches its whole scope while it lives, so the paths its callers name never open a request each. moq-lite-03/04 sessions, whose announcements mark no initial set, still ask for everything.
- **Relay by opting into proxying.** On moq-lite-07 (`moq-lite-07-wip`, opt-in) a session sends its peer only the routes to its origin's own claims, so an application never becomes transit for anyone else. A relay built on the library marks the handle it publishes with `origin.clone().with_proxy(true)`, or one consumer with `consumer.with_proxy(true)`, to carry what it learned from other peers too; `moq-relay` does so for every session. Older versions advertise everything either way.
Comment thread
coderabbitai[bot] marked this conversation as resolved.
Resolved
- **Dial and accept sockets.** `socket::Endpoint::new(&origin, prefix, id)` is a server, a client, or both: its first dial announces a hidden client endpoint at `<prefix>/.client/<id>`, and its first accept a hidden server endpoint at `<prefix>/.server/<id>`, both used only to route sessions, so grants decide which roles it may take. A session speaks one of two protocols, each with its own dial and accept. `accept_tcp()` and `accept_track()` yield an `Incoming` dial to `accept` or `reject` (dropping it rejects). `dial_tcp(server)` and an accepted `tcp` dial yield a `socket::TcpStream`, a `group::Producer` and `group::Consumer` pair carrying one reliable, ordered byte pipe each way (finish is FIN, abort is RST, and `ready` paces the writer to the reader); `dial_track(server, info)` and an accepted `track` dial yield a `socket::TrackStream`, this side's `track::Producer` and a `track::Subscriber` of the peer's half, subscribed reliably and in order until the application updates it, one message per group. A dial resolves once the peer accepts, and an accept checks that the claimed dialer really dialed this endpoint, waiting for its endpoint while the dial stays open. Every hop needs moq-lite-07 or moq-transport: while the origin has an older moq-lite client session whose publish half doesn't opt into hidden broadcasts (`with_hidden(true)`), dials and accepts fail with `Unsupported`. A dial to a peer behind such a hop waits, as for a peer not online yet. Session tracks are never announced or listed. See [Sockets](/concept/socket).
- **One track per name.** Concurrent subscriptions share one request and producer. The application owns sequence numbers: the broadcast keeps nothing of an ended track, so a producer that replaces it starts at 0. A name always means the same content, so the replacement continues past its predecessor's groups with `create_group` at an explicit sequence. Readers of an aborted track resume onto the replacement when they read through an origin request, whose route always names an instance; otherwise their subscription ends with the error.
- **Authored tracks default to a zero `max_age`.** `track::Info::default()` sets `max_age` to `Some(Duration::ZERO)`, the live edge only; a publisher that wants readers to reach history sets a longer bound, or `with_max_age(None)` for no publisher limit. Media tracks from `hang::container::track_info` declare `hang::container::MAX_AGE` (30 seconds). `max_age` is how long a superseded group stays fresh, never the newest group; it frees no bytes, which the cache pool's expiry reclaims. Received metadata keeps absence as no limit, and an origin's `cache_duration` can only cap it lower.
Expand Down
6 changes: 4 additions & 2 deletions quest/m2/announce-takeover.md
Original file line number Diff line number Diff line change
Expand Up @@ -44,8 +44,10 @@ instance rule already covers the claim case and needs no wire message, so
this quest removes the predecessor machinery and grows to [XL].

- **Removing ANNOUNCE_TAKEOVER.** Delete the 0x5 message and its codec in
`rs/moq-net/src/lite/announce.rs`, `compress.rs`, `publisher.rs`,
`subscriber.rs` and `replay.rs`; the predecessor tracking in
`rs/moq-net/src/lite/announce.rs`, `compress.rs`, `publisher/routed.rs`,
`subscriber/routed.rs` and `replay.rs`; the route layer's claim lineage
(`Claim::continues` in `rs/moq-net/src/route/node.rs`, fed by `OwnClaims` in
`origin.rs`); the predecessor tracking in
`rs/moq-net/src/model/origin.rs` and `front.rs` (the `seen` stamps in
`OriginConsumerState` and `PendingFront::via`); relay forwarding in
`rs/moq-relay`; and `rs/moq-net/tests/integration/announce_takeover.rs`.
Expand Down
15 changes: 10 additions & 5 deletions quest/m2/cluster-routing/routes/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -20,13 +20,14 @@ claim whose withdrawal is already known.
5. ✅ Decided 2026-11-05 (maintainer, /quest-plan): **Floor regions have no order, and a repeated region is a violation.** A sorted order would need Rust's `Path` ordering reproduced exactly in JS. Decoding into a map rejects duplicates at the same cost. Superseded the same day by item 10, which removes regions.
6. ✅ Decided 2026-11-05 (maintainer, /quest-plan): **The Hop setup parameter and ANNOUNCE_OK's Hop ID are dropped from lite-07.** Their only roles were path-vector exclusion and the implicit trailing hop. ANNOUNCE_OK reserves no body for a route-key proof: [moq-dev/moq#7937](https://github.com/moq-dev/moq/pull/7937), accepted the same day, proves the route key once per session in SETUP. The live hop-based codec still switches in session integration, as choice 1 requires.
7. ✅ Decided 2026-11-05 (maintainer, /quest-plan): **An echo naming a Route ID that was never ended, or was already echoed, is a violation at the publisher.** The publisher can check this from its live and unacknowledged ids alone, with no growing state.
8. ✅ Decided 2026-11-05 (maintainer, /quest-plan): **ANNOUNCE_TAKEOVER keeps its shape, with a Route ID in place of hops, and its predecessor must be under the same route.** [quest/m2/announce-takeover.md](https://github.com/moq-dev/moq/blob/main/quest/m2/announce-takeover.md) deletes the message, so this keeps the change minimal.
8. ✅ Decided 2026-11-05 (maintainer, /quest-plan): **ANNOUNCE_TAKEOVER keeps its shape, with a Route ID in place of hops, and its predecessor must be under the same route.** [quest/m2/announce-takeover.md](https://github.com/moq-dev/moq/blob/main/quest/m2/announce-takeover.md) deletes the message, so this keeps the change minimal. Decided 2026-11-06 (maintainer, /quest-complete on [moq-dev/moq#8023](https://github.com/moq-dev/moq/pull/8023)), asked whether session integration ports the message or lets lite-07 answer a claim as a restart or start until announce-takeover lands: ✅ **port it**, so a job answering a claim stays a takeover across relays. Rejected: accepting the restart and start.
9. ✅ Decided 2026-11-05 (maintainer, /quest-plan): **Unknown announce types stay skipped by length on lite-06+**, as before. An unknown reply type is refused.
10. ✅ Decided 2026-11-05 (maintainer, /quest-plan): **ANNOUNCE_FLOOR is a marker, not a region list:** `{Route ID, Revision}`. It closes a batch and certifies the stream's claims for that route across the whole requested prefix as the origin's at that Revision. A publisher that cannot vouch for the whole requested prefix at one Revision still closes the batch, with a floor that certifies nothing, encoded per item 13. Regions, the replacing list, and the 65,535-byte overflow go away. Accepted cost: a relay with partial knowledge of an origin certifies nothing for that route, so a receiver lets its stale claims go only on ROUTE_END. Rejected: one region per message; a multipart atomic list.
11. ✅ Decided 2026-11-05 (maintainer, /quest-plan): **Clamped claims collapse to the best one.** When several of a route's claims cover a request's prefix (`live` at cost 10 and `live/a` at cost 1, request `live/a/x`), the publisher presents only the most specific, and when it is withdrawn moves the presented claim to the next covering one with ANNOUNCE_UPDATE or ANNOUNCE_RESTART instead of ending it. No wire change; one live claim per prefix per route holds, and a receiver merges claims at the prefix each stream presents them. Rejected: carrying each claim's ancestor depth.
12. ✅ Decided 2026-11-05 (maintainer, /quest-plan): **A floor certifies only what its own request shows.** A stream whose request did not set `Hidden` certifies nothing about hidden claims. No new wire field. Rejected: isolating differently filtered views.
13. ✅ Decided 2026-11-05 (maintainer): **ANNOUNCE_FLOOR encodes `Revision + 1`, with 0 meaning the floor certifies nothing,** the same offset as `Max Age`. Rust decodes it to `Option`. It replaces a Revision of 2^64-1 as the marker: a huge sentinel is a bad pattern and costs 9 bytes as a lite-07 varint. Rejected: a separate message; a boolean field.
14. ✅ Decided 2026-11-05 (maintainer: "use 0 as a sentinel, or make a new message type"; the agent picked the message): **A held route is ROUTE_HOLD (0xB), `{Route ID}`,** replacing a ROUTE_UPDATE with a Metric of 2^64-1. A metric of 0 is real (the origin's own route), so 0 cannot mark held, and offsetting every metric by one would still leave a held update's seqno and down-only bit meaningless and refused. The message carries only what a hold means, item 4's rule goes away, and a metric is now only bounded by overflow, so the wire refuses no metric. The 2^64-1 Seqno and Revision bounds stay: they are bounds, not markers, leaving room for a ROUTE_REQUEST's successor and for the floor's offset.
15. ✅ Decided 2026-11-06 (maintainer, /quest-complete on [moq-dev/moq#8023](https://github.com/moq-dev/moq/pull/8023)), asked whether to amend the handoff contract's "a sender that certifies anything for a route answers every stream" or keep it: ✅ **send a route on a stream only while it meets the stream's interest**, with a floor certifying the last withdrawal before the route ends. Withdrawals still END, and what a node keeps per stream it answers is bounded by the origins that stream reads, at a ROUTE_END round trip when an origin leaves an interest. Rejected: keep answering every stream and bound only by per-peer caps, which is simpler but carries the whole node table on every stream. [Route session integration](/quest/m2/cluster-routing/routes/session.md) implements it.


The route layer's core landed in
Expand Down Expand Up @@ -330,10 +331,14 @@ loss never reports an END:
delivered (`a_lost_scope_keeps_newer_knowledge_where_still_certified`).
Otherwise a wildcard above both was last learned through the lost floor and
is unknown at the kept floors' revision, so the view is rebuilt from the
neighbours' last views, a collection of that region. A sender that
certifies anything for a route answers every stream, even one whose
interest none of its regions meets, so its peer learns it certifies nothing
there rather than waiting (`a_disjoint_interest_is_answered_with_nothing`).
neighbours' last views, a collection of that region. A sender sends a
route on a stream only while the route meets the stream's interest (Plan
item 15): it starts the route before its first claim in or covering the
interest, and when the last such claim goes it sends a floor certifying the
withdrawal, then ends the route. A peer therefore holds no route, and
waits on no certifier, for an origin its interest does not meet. The router
still answers every stream until session integration scopes it
(`a_disjoint_interest_is_answered_with_nothing`).
A claim is available only through a certifier that is not held; another
scope's usable route cannot serve it. A certifier that has not answered yet
counts as serving, as for a new next hop whose announcements trail its
Expand Down
12 changes: 12 additions & 0 deletions quest/m2/cluster-routing/routes/js.md
Original file line number Diff line number Diff line change
Expand Up @@ -18,6 +18,18 @@ Decided 2026-10-27 (maintainer), from
the cheapest one; fix it with the route-selection rework here.
- Feed the availability API from [Announcement availability](/quest/m2/cluster-routing/routes/availability.md).
- Rust/JS interop covers the route messages, the floor marker, and the echo.
- Restore the native JS lite-07 lanes. Decided 2026-11-06 (maintainer,
/quest-complete on [moq-dev/moq#8023](https://github.com/moq-dev/moq/pull/8023)),
asked how to handle the in-tree lanes running JS on lite-07-wip once the
Rust side moved to the route wire: ✅ **skip them until this quest lands**,
so the nightly report stays meaningful. Rejected: leave them red; hold
#8023 for this quest. Every skip names this quest (`grep -rn routes/js.md
test rs`): `JS_LITE07_SKIP` in `test/interop/interop.sh` and `socket.sh`
(native JS grant printing, claims, track replacement, sockets, the browser
route key proof, the lite-07 compress and drop legs, the compressed catalog's lite-07 reader, and
`--versions moq-lite-07-wip` with JS clients), `lite_tracks_interop` in
`test/justfile`, and the lite-07 legs of `max_age_relay_javascript` and
`relay_fill_javascript`.

## Required

Expand Down
Loading
Loading