@woosh/meep-engine 3.46.0 → 3.47.0

package/src/engine/network/transport/Channel.js

@@ -1,336 +0,0 @@
-import { assert } from "../../../core/assert.js";
-import Signal from "../../../core/events/signal/Signal.js";
-import { ack_bitfield_build, ack_bitfield_for_each, } from "../core/sequence/ack_bitfield.js";
-import { seq16_advance, seq16_distance, seq16_greater_than, SEQ16_HALF_RANGE } from "../core/sequence/seq16.js";
-
-/**
- * Reliability-notification layer over a {@link Transport}.
- *
- * Adds a 9-byte header to every packet:
- * ```
- *   uint16:  outgoing_seq
- *   uint16:  ack_latest    (most recent seq received from peer; 0 when ack_present=0)
- *   uint32:  ack_bitfield  (the previous 32 seqs: bit i set => latest-1-i was received)
- *   uint8:   ack_present   (1 if this packet carries ack info; 0 if the sender has
- *                           received nothing yet)
- * ```
- *
- * The `ack_present` flag exists because a sender that has received nothing would
- * otherwise emit `(ack_latest=0, ack_bitfield=0)`, which is wire-indistinguishable
- * from "I have received exactly seq 0" and would spuriously ack the peer's
- * outstanding seq 0 — silently breaking the action-stream back-fill and the
- * reliable-command retransmit for that seq. The receiver skips all ack/loss
- * processing when `ack_present` is 0.
- *
- * The header gives positive acknowledgement of up to 33 packets per inbound
- * packet — robust enough that a single dropped ack-bearing packet typically
- * doesn't matter (a later one carries the same info).
- *
- * Channel does NOT retransmit. It surfaces:
- *   - `onPacketAcked(seq)` when a peer's ack indicates an outgoing packet arrived
- *   - `onPacketLost(seq)` when an outgoing packet falls outside the 33-seq ack
- *     window without ever being acked (peer has acked 32 newer packets, so this
- *     one is presumed lost)
- *   - `onPayload(bytes, length)` for the payload portion of received packets,
- *     with the header stripped
- *
- * Reliability-by-retransmission lives in a higher-level pipeline (separate file,
- * yet to build). Channel just provides the notification primitive.
- *
- * @author Alex Goldring
- * @copyright Company Named Limited (c) 2026
- */
-
-const HEADER_SIZE = 9;
-
-export class Channel {
-    #next_outgoing_seq;
-    #unacked_outgoing;
-    #latest_received_seq;
-    #received_seqs;
-    #send_buffer;
-    #send_view;
-    #lost_scratch;
-    #max_in_flight;
-
-
-    /**
-     * @param {{
-     *   transport: { send(bytes: Uint8Array, length: number): void, onReceive: Signal },
-     *   max_in_flight?: number,
-     * }} options
-     *   `max_in_flight` hard-caps the number of unacked outgoing seqs. It exists
-     *   to keep the in-flight span well below the seq16 half-range (32768): once
-     *   an unacked seq falls more than half-range behind the newest sent, the
-     *   signed `seq16_distance` used for loss detection wraps and the entry can
-     *   neither be acked nor declared lost — a permanent leak (and a downstream
-     *   `seq_to_pending` leak in the orchestrator). Capping in-flight makes
-     *   that lap impossible. Default 1024 ≫ any realistic in-flight window
-     *   (RTT × send-rate) yet ≪ 32768. Only reached under a sustained one-way
-     *   stall, where eviction-as-lost is the correct verdict anyway.
-     */
-    constructor({ transport, max_in_flight = 1024 }) {
-        assert.ok(transport && typeof transport.send === 'function', 'transport must implement send()');
-        assert.ok(transport.onReceive, 'transport must expose onReceive signal');
-        assert.isPositiveInteger(max_in_flight, 'max_in_flight');
-        assert.lessThan(max_in_flight, SEQ16_HALF_RANGE, 'max_in_flight must stay below the seq16 half-range');
-
-        /** @type {number} @private */
-        this.#max_in_flight = max_in_flight;
-
-        /**
-         * @type {{ send(bytes: Uint8Array, length: number): void, onReceive: Signal }}
-         */
-        this.transport = transport;
-        this.transport.onReceive.add(this.#handle_inbound, this);
-
-        /** @type {number} @private */
-        this.#next_outgoing_seq = 0;
-
-        /**
-         * Outgoing seqs waiting on ack from the peer.
-         * @type {Set<number>}
-         * @private
-         */
-        this.#unacked_outgoing = new Set();
-
-        /**
-         * Most recent seq we've received from the peer; -1 if none yet.
-         * @type {number}
-         * @private
-         */
-        this.#latest_received_seq = -1;
-
-        /**
-         * Seqs we have received. Used to build the ack bitfield piggyback.
-         * Pruned when entries fall outside the 64-seq window.
-         * @type {Set<number>}
-         * @private
-         */
-        this.#received_seqs = new Set();
-
-        /**
-         * Pre-allocated send buffer. Resized only if a payload exceeds capacity.
-         * @type {Uint8Array}
-         * @private
-         */
-        this.#send_buffer = new Uint8Array(1500);
-        /** @type {DataView} @private */
-        this.#send_view = new DataView(this.#send_buffer.buffer);
-
-        /**
-         * Scratch list for collecting "to be marked lost" outgoing seqs during
-         * an inbound handler (avoids modifying the Set while iterating).
-         * @type {number[]}
-         * @private
-         */
-        this.#lost_scratch = [];
-
-        /**
-         * Fired when an outgoing seq has been positively acknowledged by the peer.
-         * @type {Signal}
-         */
-        this.onPacketAcked = new Signal();
-
-        /**
-         * Fired when an outgoing seq has aged out of the ack window without being acked.
-         * @type {Signal}
-         */
-        this.onPacketLost = new Signal();
-
-        /**
-         * Fired when an inbound packet's payload is ready (header already stripped).
-         * Handler args: (payload: Uint8Array starting at offset 0, length: number).
-         * The Uint8Array is owned by the Channel and may be reused after the handler returns.
-         * @type {Signal}
-         */
-        this.onPayload = new Signal();
-    }
-
-    /**
-     * Wrap and send a payload. Returns the seq number assigned to it.
-     *
-     * @param {Uint8Array} payload
-     * @param {number} length payload length in bytes
-     * @returns {number} seq
-     */
-    send(payload, length) {
-        assert.isNonNegativeInteger(length, 'length');
-
-        const total_size = HEADER_SIZE + length;
-        if (total_size > this.#send_buffer.length) {
-            this.#send_buffer = new Uint8Array(Math.max(total_size, this.#send_buffer.length * 2));
-            this.#send_view = new DataView(this.#send_buffer.buffer);
-        }
-
-        const seq = this.#next_outgoing_seq;
-        this.#next_outgoing_seq = seq16_advance(seq);
-
-        const has_received = this.#latest_received_seq >= 0;
-        const ack_latest = has_received ? this.#latest_received_seq : 0;
-        const ack_bitfield = has_received
-            ? ack_bitfield_build(this.#latest_received_seq, s => this.#received_seqs.has(s))
-            : 0;
-
-        this.#send_view.setUint16(0, seq, true);
-        this.#send_view.setUint16(2, ack_latest, true);
-        this.#send_view.setUint32(4, ack_bitfield, true);
-        this.#send_view.setUint8(8, has_received ? 1 : 0);
-        if (length > 0) {
-            this.#send_buffer.set(payload.subarray(0, length), HEADER_SIZE);
-        }
-
-        this.transport.send(this.#send_buffer, total_size);
-        this.#unacked_outgoing.add(seq);
-
-        // Enforce the in-flight bound. `#unacked_outgoing` is a Set, so its
-        // iteration order is insertion order = send order = ascending seq; the
-        // first entry is therefore the oldest unacked. When we exceed the cap
-        // (only possible under a sustained one-way stall where acks have
-        // stopped advancing the window), evict the oldest as lost. This keeps
-        // the in-flight span below the seq16 half-range so loss detection can't
-        // alias, and frees the entry (and its orchestrator-side mapping, via
-        // the onPacketLost handler) instead of leaking it. In a stall the
-        // oldest is an action-stream packet, whose loss handler does not
-        // retransmit; reliable-command retransmits are independently bounded by
-        // ReliableCommandPipeline.max_unacked (≪ this cap), so this cannot loop.
-        if (this.#unacked_outgoing.size > this.#max_in_flight) {
-            const oldest = this.#unacked_outgoing.values().next().value;
-            this.#unacked_outgoing.delete(oldest);
-            this.onPacketLost.send1(oldest);
-        }
-
-        return seq;
-    }
-
-    /**
-     * Number of outgoing packets sent but not yet acked or marked lost.
-     * @returns {number}
-     */
-    unacked_count() {
-        return this.#unacked_outgoing.size;
-    }
-
-    /**
-     * Most recent seq received from the peer, or -1 if none yet.
-     * @returns {number}
-     */
-    latest_received_seq() {
-        return this.#latest_received_seq;
-    }
-
-    /**
-     * Test-only: seed the next outgoing seq number. Used to fast-forward
-     * the seq counter so the seq16 wraparound can be exercised in
-     * unit tests without sending 65k packets. Do not call from production.
-     * @param {number} seq
-     */
-    seed_outgoing_seq_for_testing(seq) {
-        this.#next_outgoing_seq = seq;
-    }
-
-    /**
-     * @param {Uint8Array} bytes
-     * @param {number} length
-     * @private
-     */
-    #handle_inbound(bytes, length) {
-        if (length < HEADER_SIZE) {
-            // Malformed: too short to contain a header. Drop silently.
-            return;
-        }
-
-        const view = new DataView(bytes.buffer, bytes.byteOffset, length);
-        const seq = view.getUint16(0, true);
-        const ack_latest = view.getUint16(2, true);
-        const ack_bitfield = view.getUint32(4, true);
-        const ack_present = view.getUint8(8);
-
-        // Record receipt of this seq.
-        if (this.#latest_received_seq < 0 || seq16_greater_than(seq, this.#latest_received_seq)) {
-            this.#latest_received_seq = seq;
-        }
-        this.#received_seqs.add(seq);
-        this.#prune_received_seqs();
-
-        // Process acks/loss only when the peer actually carries ack info. A peer
-        // that has received nothing sends ack_present=0 with (ack_latest=0,
-        // ack_bitfield=0); reading that as an ack would spuriously confirm our
-        // seq 0 (see the seq-0 ambiguity note in the class header).
-        if (ack_present === 1) {
-            this.#process_acks(ack_latest, ack_bitfield);
-        }
-
-        // Strip header and surface the payload.
-        const payload_length = length - HEADER_SIZE;
-        const payload = bytes.subarray(HEADER_SIZE, HEADER_SIZE + payload_length);
-        this.onPayload.send2(payload, payload_length);
-    }
-
-    /**
-     * Apply the ack header of an inbound packet: fire `onPacketAcked` for each
-     * newly-acknowledged outgoing seq, and `onPacketLost` for any unacked seq
-     * that has aged out of the 33-seq ack window. Only invoked when the inbound
-     * header sets `ack_present` (the peer has received at least one packet from
-     * us), so `ack_latest` is a genuine acknowledgement rather than the
-     * "nothing received yet" sentinel.
-     *
-     * @param {number} ack_latest
-     * @param {number} ack_bitfield
-     * @private
-     */
-    #process_acks(ack_latest, ack_bitfield) {
-        // Mark each acknowledged outgoing seq.
-        ack_bitfield_for_each(ack_latest, ack_bitfield, acked_seq => {
-            if (this.#unacked_outgoing.delete(acked_seq)) {
-                this.onPacketAcked.send1(acked_seq);
-            }
-        });
-
-        // Anything older than (ack_latest - 32) that is still unacked is presumed lost.
-        // Sanity: if `d` ever approaches half-range we're flying so many
-        // unacked packets that distance is about to wrap to negative and the
-        // loss-detection would silently break. Non-goal to support; assert.
-        this.#lost_scratch.length = 0;
-        for (const out_seq of this.#unacked_outgoing) {
-            const d = seq16_distance(out_seq, ack_latest);
-            assert.lessThan(d, SEQ16_HALF_RANGE / 2, `Channel: outgoing seq ${out_seq} is ${d} packets behind ack_latest ${ack_latest} — approaching seq16 half-range wraparound`);
-            if (d > 32) {
-                this.#lost_scratch.push(out_seq);
-            }
-        }
-        for (let i = 0; i < this.#lost_scratch.length; i++) {
-            const lost = this.#lost_scratch[i];
-            this.#unacked_outgoing.delete(lost);
-            this.onPacketLost.send1(lost);
-        }
-    }
-
-    /**
-     * Detach this Channel from its transport. The transport.onReceive subscription
-     * is removed so the Channel stops processing inbound bytes; the Channel's own
-     * Signals are left in place (callers usually hold no references to them after
-     * dispose, so they GC with the Channel). Required before discarding a Channel
-     * whose transport will be reused — otherwise the old Channel keeps consuming
-     * inbound packets in parallel with whatever replaces it.
-     */
-    dispose() {
-        this.transport.onReceive.remove(this.#handle_inbound, this);
-    }
-
-    /**
-     * Drop received-seq entries that are too old to matter for the next ack bitfield.
-     * Keeps a window slightly larger than the 33-seq bitfield to absorb out-of-order arrival.
-     * @private
-     */
-    #prune_received_seqs() {
-        const latest = this.#latest_received_seq;
-        if (latest < 0) return;
-        // Window: 64 seqs back. Anything farther can be dropped.
-        for (const s of this.#received_seqs) {
-            if (seq16_distance(s, latest) > 64) {
-                this.#received_seqs.delete(s);
-            }
-        }
-    }
-}

package/src/engine/network/transport/ReliableCommandPipeline.js

@@ -1,335 +0,0 @@
-import { assert } from "../../../core/assert.js";
-import { BinaryBuffer } from "../../../core/binary/BinaryBuffer.js";
-import Signal from "../../../core/events/signal/Signal.js";
-import { MalformedPacketError } from "../core/MalformedPacketError.js";
-import { MAX_CHANNEL_PAYLOAD_BYTES } from "./fragments/packet_size.js";
-
-/**
- * Largest reliable-command payload that fits in a single channel packet.
- *
- * A command's wire form is `uint8 packet_type + uintVar logical_seq + payload`.
- * The pipeline sends it through {@link Channel#send} directly — it does NOT
- * fragment — so the whole thing must fit one channel packet
- * ({@link MAX_CHANNEL_PAYLOAD_BYTES}). We reserve 11 bytes for the framing:
- * 1 packet-type byte + up to 10 bytes of `uintVar` for `logical_seq` (its
- * worst case; `logical_seq` grows over the session, so we budget the maximum
- * rather than the current value). Sending a larger payload on a UDP-style
- * transport would emit an over-MTU datagram that the network silently drops;
- * we reject it loudly instead.
- *
- * @type {number}
- */
-export const MAX_RELIABLE_COMMAND_PAYLOAD_BYTES = MAX_CHANNEL_PAYLOAD_BYTES - 11;
-
-/**
- * Reliable, at-least-once delivery layer over a {@link Channel}.
- *
- * Used for messages that must arrive: chat, lobby/room state changes,
- * level transitions, kick / disconnect notifications. Distinct from the
- * action-stream traffic the rest of the netcode uses, which is UDP-style
- * best-effort with per-frame back-fill compensating for losses.
- *
- * Wire layout (after the {@link Channel}'s 8-byte header and the
- * `packet_type` byte that {@link NetworkPeer}'s dispatcher consumes):
- *
- *   uintVar logical_seq    sender-assigned, monotonically increasing
- *   bytes   command_payload
- *
- * Reliability mechanism: each outgoing command goes out as one
- * Channel.send call. The returned channel-level seq is tracked in
- * `__unacked`. When the Channel later fires:
- *   - `onPacketAcked(seq)`: drop the entry — the command was delivered
- *     (the receiver de-duplicated by logical_seq, so a "duplicate" from
- *     a previous retransmit is harmless).
- *   - `onPacketLost(seq)`: the Channel's 33-packet ack window aged out
- *     this seq without seeing it acked. Re-send the same logical
- *     command on a fresh channel seq.
- *
- * Receiver side: a sliding-window de-dupe of recent `logical_seq` values.
- * Anything seen within the last `max_received_history` is silently
- * dropped; first-time arrivals fire `onCommand` with the payload bytes.
- *
- * Ordering: NOT guaranteed. Commands may arrive in any order. If you
- * need in-order delivery (level transitions before subsequent chat),
- * key payloads with a counter and reorder in the application handler.
- *
- * Lifecycle constraints:
- *   - `max_unacked` caps outstanding commands. Send throws when full
- *     (signals real backpressure — receiver gone or path is broken).
- *   - `max_received_history` caps the de-dupe set. A retransmit older
- *     than this window will be re-delivered as a duplicate to the
- *     application; not a problem in practice because the sender's
- *     `max_unacked` keeps the inflight set bounded too.
- *
- * Caveats:
- *   - Loss detection relies on the Channel's seq window, which advances
- *     when subsequent packets are sent. Under sustained no-traffic
- *     conditions a single lost reliable command may stay unacked
- *     indefinitely — by convention the action-stream's per-tick traffic
- *     keeps the window moving even when the application is otherwise
- *     idle. Real production code may want a timer-based retransmit
- *     fallback layered on top of this.
- *
- * @author Alex Goldring
- * @copyright Company Named Limited (c) 2026
- */
-export class ReliableCommandPipeline {
-    /**
-     * Monotonic counter for outgoing logical seqs. Receiver dedups on
-     * this value; sender retransmits use the SAME logical_seq with a
-     * new channel_seq.
-     * @type {number}
-     * @private
-     */
-    #next_send_seq = 0;
-    #unacked;
-    #received_seqs;
-    /**
-     * FIFO order of received logical_seqs, for pruning when
-     * `__received_seqs` exceeds `max_received_history`.
-     * @type {number[]}
-     * @private
-     */
-    #received_order = [];
-    #send_scratch;
-    #bound_acked;
-    #bound_lost;
-
-    /**
-     * @param {{
-     *   channel: import("./Channel.js").Channel,
-     *   packet_type: number,
-     *   max_unacked?: number,
-     *   max_received_history?: number,
-     *   max_retries?: number,
-     * }} options
-     */
-    constructor({
-        channel,
-        packet_type,
-        max_unacked = 64,
-        max_received_history = 64,
-        max_retries = 16,
-    }) {
-        assert.ok(channel && typeof channel.send === 'function', 'channel must be a Channel');
-        assert.isNonNegativeInteger(packet_type, 'packet_type');
-        assert.ok(packet_type <= 0xFF, 'packet_type must fit in a uint8');
-        assert.isPositiveInteger(max_unacked, 'max_unacked');
-        assert.isPositiveInteger(max_received_history, 'max_received_history');
-        assert.isPositiveInteger(max_retries, 'max_retries');
-
-        /** @type {import("./Channel.js").Channel} */
-        this.channel = channel;
-        /** @type {number} @readonly */
-        this.packet_type = packet_type;
-        /** @type {number} @readonly */
-        this.max_unacked = max_unacked;
-        /** @type {number} @readonly */
-        this.max_received_history = max_received_history;
-        /**
-         * Maximum retransmissions per logical command before it is dropped
-         * and {@link onCommandAbandoned} fires. Bounded so a permanently-
-         * black-holed peer can't pin retransmit traffic on the channel
-         * forever. The default (16) tolerates roughly half a second of
-         * sustained loss at typical channel cadences before giving up.
-         * @type {number} @readonly
-         */
-        this.max_retries = max_retries;
-
-        /**
-         * Outstanding commands keyed by their CURRENT channel_seq. On
-         * retransmit, the entry is moved to the new channel_seq.
-         * `retries` counts how many times this logical command has been
-         * resent; the entry is dropped when it exceeds `max_retries`.
-         * @type {Map<number, {logical_seq: number, payload: Uint8Array, retries: number}>}
-         * @private
-         */
-        this.#unacked = new Map();
-
-        /**
-         * Logical seqs received recently. Sliding window for dedup.
-         * @type {Set<number>}
-         * @private
-         */
-        this.#received_seqs = new Set();
-
-        /**
-         * Scratch buffer for assembling outgoing packets.
-         * @type {BinaryBuffer}
-         * @private
-         */
-        this.#send_scratch = new BinaryBuffer();
-        this.#send_scratch.setCapacity(1024);
-
-        /**
-         * Fired when a brand-new logical command arrives (not a duplicate).
-         * Args: `(buf, payload_offset, payload_length)`. The buffer is
-         * shared scratch; consumers must copy bytes if they need them to
-         * outlive the handler.
-         * @type {Signal}
-         */
-        this.onCommand = new Signal();
-
-        /**
-         * Fired when a sent command has been retransmitted `max_retries`
-         * times without an ack and is being given up on. Args:
-         * `(logical_seq)`. Subscribers typically surface this as a "command
-         * failed to deliver" event to the application, or treat it as a
-         * hard signal to tear down the session.
-         * @type {Signal}
-         */
-        this.onCommandAbandoned = new Signal();
-
-        // Channel reliability notifications.
-        this.#bound_acked = (seq) => this.#on_packet_acked(seq);
-        this.#bound_lost = (seq) => this.#on_packet_lost(seq);
-        channel.onPacketAcked.add(this.#bound_acked);
-        channel.onPacketLost.add(this.#bound_lost);
-    }
-
-    /**
-     * Send a logical command. Returns the assigned `logical_seq` (useful
-     * for application-level diagnostics; the receiver dedups internally
-     * regardless).
-     *
-     * @param {Uint8Array} payload
-     * @param {number} length
-     * @returns {number}
-     */
-    send(payload, length) {
-        assert.isNonNegativeInteger(length, 'length');
-        if (length > MAX_RELIABLE_COMMAND_PAYLOAD_BYTES) {
-            // The pipeline does not fragment; an over-MTU command would be sent
-            // as one oversized datagram that UDP-style transports silently drop.
-            // Fail loudly so the caller chunks at the application layer (or uses
-            // a stream transport) rather than losing the message on the wire.
-            throw new Error(
-                `ReliableCommandPipeline.send: payload of ${length} bytes exceeds the ` +
-                `${MAX_RELIABLE_COMMAND_PAYLOAD_BYTES}-byte single-packet limit; this layer does not ` +
-                `fragment — chunk the message at the application layer or send it over a stream transport`
-            );
-        }
-        if (this.#unacked.size >= this.max_unacked) {
-            throw new Error(
-                `ReliableCommandPipeline.send: ${this.#unacked.size} commands unacked ` +
-                `(max ${this.max_unacked}); receiver likely disconnected or path saturated`
-            );
-        }
-        const logical_seq = this.#next_send_seq;
-        this.#next_send_seq++;
-
-        // Defensive copy: the caller's buffer may be reused after this call.
-        const payload_copy = new Uint8Array(length);
-        payload_copy.set(payload.subarray(0, length));
-
-        const channel_seq = this.#transmit(logical_seq, payload_copy);
-        this.#unacked.set(channel_seq, { logical_seq, payload: payload_copy, retries: 0 });
-        return logical_seq;
-    }
-
-    /**
-     * Called by the orchestrator (typically {@link NetworkPeer}'s
-     * dispatcher) when a packet of this pipeline's type arrives. `buf`
-     * is positioned just past the packet-type byte.
-     *
-     * @param {BinaryBuffer} buf
-     * @param {number} total_length    full transport-level payload length,
-     *                                  including the consumed packet-type byte
-     */
-    handle_inbound(buf, total_length) {
-        // Bounds-checked before the read, like every other parse path in the dispatcher.
-        //
-        // `#recv_buffer` is a reused scratch: `writeBytes(bytes, 0, length)` overwrites only the
-        // first `length` bytes, so everything past them is the previous, longer packet's content.
-        // A truncated RELIABLE_COMMAND - just the type byte, from a peer or a truncating middlebox
-        // - let `readUintVar` walk into those leftovers and produce a bogus `logical_seq`, which
-        // was then recorded in the received set, so a genuine later command carrying that seq was
-        // silently dropped as a duplicate.
-        if (buf.position >= total_length) {
-            throw new MalformedPacketError(`ReliableCommandPipeline: RELIABLE_COMMAND truncated before its sequence number`);
-        }
-
-        const logical_seq = buf.readUintVar();
-
-        // ...and after it: `readUintVar` may have consumed bytes past the packet even when one was
-        // available to start with. Subtracting gave a negative payload length and an offset into an
-        // unrelated packet's bytes, handed straight to the application.
-        if (buf.position > total_length) {
-            throw new MalformedPacketError(`ReliableCommandPipeline: RELIABLE_COMMAND sequence number runs past the packet`);
-        }
-
-        if (this.#received_seqs.has(logical_seq)) {
-            // Duplicate from a retransmit; ignore.
-            return;
-        }
-        this.#received_seqs.add(logical_seq);
-        this.#received_order.push(logical_seq);
-        // Prune. Oldest-first.
-        while (this.#received_order.length > this.max_received_history) {
-            const oldest = this.#received_order.shift();
-            this.#received_seqs.delete(oldest);
-        }
-
-        const payload_offset = buf.position;
-        const payload_length = total_length - payload_offset;
-        this.onCommand.send3(buf, payload_offset, payload_length);
-    }
-
-    /**
-     * Number of commands sent that haven't yet been acked. Useful for
-     * backpressure / progress UI.
-     * @returns {number}
-     */
-    unacked_count() {
-        return this.#unacked.size;
-    }
-
-    /**
-     * Drop subscriptions and clear state. Required before discarding a
-     * pipeline whose channel will outlive it.
-     */
-    dispose() {
-        this.channel.onPacketAcked.remove(this.#bound_acked);
-        this.channel.onPacketLost.remove(this.#bound_lost);
-        this.#unacked.clear();
-        this.#received_seqs.clear();
-        this.#received_order.length = 0;
-    }
-
-    /** @private */
-    #transmit(logical_seq, payload) {
-        const buf = this.#send_scratch;
-        // Worst-case capacity: type byte + 10 bytes for varint + payload.
-        const needed = 1 + 10 + payload.length;
-        if (buf.raw_bytes.length < needed) buf.setCapacity(needed);
-        buf.position = 0;
-        buf.writeUint8(this.packet_type);
-        buf.writeUintVar(logical_seq);
-        buf.writeBytes(payload, 0, payload.length);
-        return this.channel.send(buf.raw_bytes, buf.position);
-    }
-
-    /** @private */
-    #on_packet_acked(channel_seq) {
-        this.#unacked.delete(channel_seq);
-    }
-
-    /** @private */
-    #on_packet_lost(channel_seq) {
-        const entry = this.#unacked.get(channel_seq);
-        if (entry === undefined) return;
-        this.#unacked.delete(channel_seq);
-
-        if (entry.retries >= this.max_retries) {
-            // Permanently black-holed peer or fundamentally broken path —
-            // surface the failure to the application and stop retrying.
-            this.onCommandAbandoned.send1(entry.logical_seq);
-            return;
-        }
-
-        // Retransmit on a fresh channel_seq. Same logical_seq, same payload.
-        entry.retries++;
-        const new_channel_seq = this.#transmit(entry.logical_seq, entry.payload);
-        this.#unacked.set(new_channel_seq, entry);
-    }
-}