onelobby 0.0.0-stage → 0.2.0

package/dist/lockstep.js

@@ -0,0 +1,471 @@
+import { CHUNK_PAYLOAD, splitChunks } from "./chunking.js";
+import { PROTO } from "./codec.js";
+import { deflate, deflateAvailable, inflate } from "./deflate.js";
+import { Emitter } from "./emitter.js";
+export const MAX_DESYNCS = 3;
+export const MAX_RESTORE_RETRIES = 3;
+export const HOST_SILENCE_MS = 3000;
+export const PEER_HASH_SILENCE_MS = 10_000;
+const SNAPSHOT_COMPRESS_MIN = 1024;
+/**
+ * Host-ordered lockstep (spec/binary.md, DESIGN s.8). One class for both roles: the host emits `frame(T)` on a fixed
+ * cadence and never waits; joiners queue frames and hand them out through `nextFrame()`.
+ *
+ * Ticks: the initial state is tick 0 and has no frame; `frame(T)` produces tick T. `reportHash(tick, h)` is called
+ * after applying `frame.tick` (the library only sends when `tick % hashEveryTicks == 0`, tick > 0). `snapshot()` must
+ * return the state after the last frame returned by `nextFrame()`; `restore(tick, bytes)` receives that tick, and the
+ * next frame applied is `tick + 1`.
+ */
+export class Lockstep extends Emitter {
+    hub;
+    snapshot = null;
+    restore = null;
+    hashEveryTicks;
+    /** Chunk body size used when serving snapshots. */
+    chunkSize = CHUNK_PAYLOAD;
+    historyMax;
+    queue = [];
+    history = [];
+    /** Highest frame tick received/emitted; -1 = no state (a fresh joiner). */
+    lastFrameTick = -1;
+    /** Tick of the state the game holds (last frame returned by nextFrame, or a restored snapshot). */
+    consumedTick = 0;
+    cmdSeq = 1;
+    awaitingSnapshot = false;
+    lastFrameRx = 0;
+    lastSnapshotReq = -Infinity;
+    restoreFailures = 0;
+    // host side
+    hosting = false;
+    _started = false;
+    pending = [];
+    ready = new Set();
+    snapshotting = new Set();
+    cancelTicker = null;
+    baseTime = 0;
+    emitted = 0;
+    ownHashes = new Map();
+    peerHashes = new Map();
+    desyncs = new Map();
+    lastHashRx = new Map();
+    /** Hashes a peer sent for ticks up to this were computed before it restored a snapshot: stale, not evidence. */
+    staleUpTo = new Map();
+    // joiner side
+    pendingSnapshot = null;
+    constructor(hub, opts) {
+        super();
+        this.hub = hub;
+        this.hashEveryTicks = Math.max(1, opts.hashEveryTicks);
+        this.historyMax = opts.historyFrames ?? Math.max(60, hub.tickRate * 30);
+        this.lastFrameRx = hub.clock.now();
+    }
+    // ---- public game-facing surface -------------------------------------------------------------------------------
+    get started() {
+        return this._started;
+    }
+    get framesBuffered() {
+        return this.queue.length;
+    }
+    /** True when the game should run ticks without rendering (> 2 frames behind). */
+    get catchingUp() {
+        return this.queue.length > 2;
+    }
+    /** Tick of the game's current state. */
+    get currentTick() {
+        return this.consumedTick;
+    }
+    /** Highest frame tick known to this peer (0 when none yet; the host's `welcome_dc.tick`). */
+    get lastTick() {
+        return Math.max(0, this.lastFrameTick);
+    }
+    /** What `hi.lastTick` carries: -1 until the first frame/snapshot. */
+    get hiTick() {
+        return this.lastFrameTick;
+    }
+    /** Queue a command. Host: into its own next frame. Joiner: to the host (reliable). */
+    submit(bytes) {
+        if (this.hosting) {
+            this.pending.push({ peerId: this.hub.localPeerId, bytes: bytes.slice() });
+        }
+        else {
+            this.hub.sendToHost({ type: "cmd", seq: this.cmdSeq++ >>> 0, bytes });
+        }
+    }
+    nextFrame() {
+        const f = this.queue.shift() ?? null;
+        if (f)
+            this.consumedTick = f.tick;
+        return f;
+    }
+    reportHash(tick, hash) {
+        if (this.awaitingSnapshot || tick <= 0 || tick % this.hashEveryTicks !== 0)
+            return;
+        if (this.hosting) {
+            this.ownHashes.set(tick, hash);
+            this.prune(this.ownHashes);
+            const theirs = this.peerHashes.get(tick);
+            if (theirs) {
+                this.peerHashes.delete(tick);
+                for (const [peer, h] of [...theirs].sort((a, b) => a[0] - b[0]))
+                    this.compare(peer, tick, hash, h);
+            }
+        }
+        else {
+            this.hub.sendToHost({ type: "hash", tick, hash });
+        }
+    }
+    // ---- role control (called by Lobby) ---------------------------------------------------------------------------
+    /** Host role without emitting yet (lobby phase): peers may already say hi. */
+    hostIdle() {
+        this.hosting = true;
+        if (this.lastFrameTick < 0)
+            this.lastFrameTick = 0;
+    }
+    /** Host begins emitting frames (game start, or after winning a migration), continuing after the last known tick. */
+    hostStart() {
+        this.hostIdle();
+        this._started = true;
+        this.emitted = 0;
+        this.baseTime = this.hub.clock.now();
+        this.cancelTicker?.();
+        const interval = 1000 / this.hub.tickRate;
+        this.cancelTicker = this.hub.clock.setInterval(() => this.pump(interval), Math.max(1, Math.floor(interval / 2)));
+    }
+    /** Winning a migration: continue from our last received frame. Pending commands are lost by design. */
+    becomeHost() {
+        this.pending = [];
+        this.ready.clear();
+        this.snapshotting.clear();
+        this.ownHashes.clear();
+        this.peerHashes.clear();
+        this.desyncs.clear();
+        this.awaitingSnapshot = false;
+        this.hostIdle();
+        if (this._started)
+            this.hostStart();
+    }
+    /** Losing a claim, or a new host appeared: stop emitting. Keep history; the new host decides replay vs snapshot. */
+    becomeJoiner() {
+        this.hosting = false;
+        this.cancelTicker?.();
+        this.cancelTicker = null;
+        this.pending = [];
+        this.ready.clear();
+        this.lastFrameRx = this.hub.clock.now();
+    }
+    /** A joiner just learned the session is in game (first frame, snapshot, or phase from the server). */
+    markStarted() {
+        if (this._started)
+            return;
+        this._started = true;
+        this.emit("started");
+    }
+    stop() {
+        this.cancelTicker?.();
+        this.cancelTicker = null;
+    }
+    onPeerLeft(peerId) {
+        this.ready.delete(peerId);
+        this.snapshotting.delete(peerId);
+        this.desyncs.delete(peerId);
+        this.lastHashRx.delete(peerId);
+        this.staleUpTo.delete(peerId);
+        for (const m of this.peerHashes.values())
+            m.delete(peerId);
+        this.pending = this.pending.filter((c) => c.peerId !== peerId);
+    }
+    // ---- host: frame emission ---------------------------------------------------------------------------------------
+    pump(interval) {
+        if (!this.hosting)
+            return;
+        const now = this.hub.clock.now();
+        let due = Math.floor((now - this.baseTime + 1) / interval) - this.emitted;
+        if (due > 10) {
+            // Starved (e.g. a throttled tab): do not flood. Rebase rather than emit a burst of empty frames.
+            this.baseTime = now - this.emitted * interval;
+            due = 1;
+        }
+        for (let i = 0; i < due; i++)
+            this.emitFrame();
+    }
+    emitFrame() {
+        // sorted by peerId, stable: one peer's commands keep their arrival order
+        const commands = this.pending.splice(0).sort((a, b) => a.peerId - b.peerId);
+        const frame = { tick: this.lastFrameTick + 1, commands };
+        this.emitted++;
+        this.lastFrameTick = frame.tick;
+        this.record(frame);
+        this.queue.push(frame);
+        const msg = { type: "frame", tick: frame.tick, commands };
+        for (const p of this.ready)
+            this.hub.sendTo(p, msg, 0);
+        this.checkPeerSilence();
+    }
+    record(f) {
+        this.history.push(f);
+        if (this.history.length > this.historyMax)
+            this.history.splice(0, this.history.length - this.historyMax);
+    }
+    /** The host drops a peer it has had no `hash` from for 10 s (scaled up when hashes are rare). */
+    checkPeerSilence() {
+        if (this.ownHashes.size === 0)
+            return;
+        const now = this.hub.clock.now();
+        const limit = Math.max(PEER_HASH_SILENCE_MS, (this.hashEveryTicks / this.hub.tickRate) * 1000 * 3);
+        for (const p of [...this.ready]) {
+            const last = this.lastHashRx.get(p) ?? now;
+            if (now - last > limit)
+                this.hub.dropPeer(p, "timeout");
+        }
+    }
+    // ---- message handling -------------------------------------------------------------------------------------------
+    handle(from, msg) {
+        switch (msg.type) {
+            case "cmd":
+                if (this.hosting)
+                    this.pending.push({ peerId: from, bytes: msg.bytes });
+                break;
+            case "frame":
+                if (!this.hosting)
+                    this.onFrame(msg.tick, msg.commands);
+                break;
+            case "hash":
+                if (this.hosting)
+                    this.onPeerHash(from, msg.tick, msg.hash);
+                break;
+            case "desync":
+                if (!this.hosting) {
+                    this.awaitingSnapshot = true;
+                    this.queue = [];
+                    this.emit("desync", { tick: msg.tick, hostHash: msg.hostHash, yourHash: msg.yourHash });
+                }
+                break;
+            case "snapshot_req":
+                if (this.hosting)
+                    void this.sendSnapshot(from);
+                break;
+            case "snapshot":
+                if (!this.hosting) {
+                    this.markStarted();
+                    this.pendingSnapshot = { tick: msg.tick, total: msg.total, flags: msg.flags };
+                }
+                break;
+        }
+    }
+    /** True when a `snapshot` header was seen and its chunk set has not completed yet. */
+    get snapshotPending() {
+        return this.pendingSnapshot !== null;
+    }
+    /** The reassembled chunk set that follows a `snapshot` header. */
+    onSnapshotPayload(payload) {
+        const ps = this.pendingSnapshot;
+        this.pendingSnapshot = null;
+        if (!ps)
+            return;
+        if (payload.length !== ps.total) {
+            // spec: a receiver that gets a different sum drops the snapshot and re-requests
+            this.awaitingSnapshot = false;
+            this.requestSnapshot();
+            return;
+        }
+        void this.applySnapshot(ps, payload);
+    }
+    onFrame(tick, commands) {
+        this.lastFrameRx = this.hub.clock.now();
+        this.markStarted();
+        if (this.awaitingSnapshot)
+            return;
+        const expected = Math.max(0, this.lastFrameTick) + 1;
+        if (tick < expected)
+            return; // duplicate (replay overlap)
+        if (tick > expected) {
+            this.requestSnapshot(); // gap: the host changed under us
+            return;
+        }
+        const f = { tick, commands };
+        this.lastFrameTick = tick;
+        this.record(f);
+        this.queue.push(f);
+        if (this.queue.length > this.hub.tickRate * 3)
+            this.requestSnapshot();
+    }
+    /** Joiner asks the host for a snapshot (far behind, gap, silent host). Throttled while one is outstanding. */
+    requestSnapshot() {
+        const now = this.hub.clock.now();
+        if (this.awaitingSnapshot && now - this.lastSnapshotReq < 2000)
+            return;
+        this.lastSnapshotReq = now;
+        this.awaitingSnapshot = true;
+        this.queue = [];
+        this.hub.sendToHost({ type: "snapshot_req", sinceTick: this.lastFrameTick });
+    }
+    /** 3 s without frames: ask the host for a snapshot without discarding anything (a live host answers). */
+    pokeHost() {
+        this.hub.sendToHost({ type: "snapshot_req", sinceTick: this.lastFrameTick });
+    }
+    async applySnapshot(ps, payload) {
+        try {
+            let bytes = payload;
+            if (ps.flags & 1)
+                bytes = await inflate(payload);
+            if (!this.restore)
+                throw new Error("lockstep.restore is not set; cannot apply a snapshot");
+            // Restore first: if the game's restore() throws, our bookkeeping must not have moved.
+            this.restore(ps.tick, bytes);
+            this.queue = [];
+            this.history = [];
+            this.lastFrameTick = ps.tick;
+            this.consumedTick = ps.tick;
+            this.awaitingSnapshot = false;
+            this.restoreFailures = 0;
+            this.markStarted();
+            this.lastFrameRx = this.hub.clock.now();
+            this.emit("restored", ps.tick);
+        }
+        catch (e) {
+            this.hub.reportError(e instanceof Error ? e : new Error(String(e)));
+            // The game's state is unknown after a failed restore: keep our tick where it was, drop frames, ask again.
+            if (++this.restoreFailures <= MAX_RESTORE_RETRIES) {
+                this.awaitingSnapshot = false;
+                this.lastSnapshotReq = -Infinity;
+                this.requestSnapshot();
+            }
+            else {
+                this.hub.reportError(new Error(`snapshot restore failed ${this.restoreFailures} times; giving up`));
+            }
+        }
+    }
+    // ---- host: hello, hashes, snapshots -----------------------------------------------------------------------------
+    /** Host: a peer said hi (welcome_dc and chat_history already sent). Decide: nothing, replay, or snapshot. */
+    onPeerHi(peerId, lastTick) {
+        this.lastHashRx.set(peerId, this.hub.clock.now());
+        const hostTick = this.lastFrameTick;
+        const first = this.history.length ? this.history[0].tick : hostTick + 1;
+        if (lastTick < 0) {
+            // fresh joiner: initial state if no game is running, otherwise a snapshot
+            if (this._started && hostTick > 0)
+                void this.sendSnapshot(peerId);
+            else
+                this.ready.add(peerId);
+            return;
+        }
+        if (lastTick <= hostTick && lastTick + 1 >= first) {
+            // The peer's timeline is a prefix of ours: replay what it lacks, then go live.
+            for (const f of this.history) {
+                if (f.tick > lastTick)
+                    this.hub.sendTo(peerId, { type: "frame", tick: f.tick, commands: f.commands }, 0);
+            }
+            this.ready.add(peerId);
+        }
+        else {
+            void this.sendSnapshot(peerId);
+        }
+    }
+    onPeerHash(peerId, tick, hash) {
+        this.lastHashRx.set(peerId, this.hub.clock.now());
+        if (this.isStale(peerId, tick))
+            return;
+        const own = this.ownHashes.get(tick);
+        if (own === undefined) {
+            let m = this.peerHashes.get(tick);
+            if (!m)
+                this.peerHashes.set(tick, (m = new Map()));
+            m.set(peerId, hash);
+            this.prune(this.peerHashes);
+            return;
+        }
+        this.compare(peerId, tick, own, hash);
+    }
+    compare(peerId, tick, hostHash, yourHash) {
+        if (hostHash === yourHash)
+            return;
+        if (this.isStale(peerId, tick))
+            return;
+        if (!this.ready.has(peerId) || this.snapshotting.has(peerId))
+            return; // already being resynced
+        const n = (this.desyncs.get(peerId) ?? 0) + 1;
+        this.desyncs.set(peerId, n);
+        if (n >= MAX_DESYNCS) {
+            this.hub.dropPeer(peerId, "desync");
+            return;
+        }
+        this.hub.sendTo(peerId, { type: "desync", tick, hostHash, yourHash }, 0);
+        void this.sendSnapshot(peerId, tick);
+    }
+    /** Hashes computed before a peer restored its snapshot (ticks after the strike, up to what we had emitted) are not evidence. */
+    isStale(peerId, tick) {
+        const w = this.staleUpTo.get(peerId);
+        return !!w && tick > w.from && tick <= w.to;
+    }
+    async sendSnapshot(peerId, strikeTick = Infinity) {
+        if (this.snapshotting.has(peerId))
+            return;
+        if (!this.snapshot) {
+            this.hub.reportError(new Error("lockstep.snapshot is not set; cannot serve a snapshot"));
+            return;
+        }
+        this.snapshotting.add(peerId);
+        this.ready.delete(peerId); // live frames now flow only through the replay below
+        try {
+            const S = this.consumedTick;
+            const raw = this.snapshot();
+            let payload = raw;
+            let flags = 0;
+            if (raw.length >= SNAPSHOT_COMPRESS_MIN && deflateAvailable()) {
+                payload = await deflate(raw);
+                flags = 1;
+            }
+            if (!this.snapshotting.has(peerId))
+                return; // peer left while compressing
+            // header + one contiguous chunk set + frames S+1... with nothing else in between
+            this.hub.sendTo(peerId, { type: "snapshot", tick: S, total: payload.length, flags }, 0);
+            for (const c of splitChunks(this.hub.nextChunkId(), payload, this.chunkSize))
+                this.hub.sendTo(peerId, c, 0);
+            for (const f of this.history) {
+                if (f.tick > S)
+                    this.hub.sendTo(peerId, { type: "frame", tick: f.tick, commands: f.commands }, 0);
+            }
+            if (strikeTick !== Infinity)
+                this.staleUpTo.set(peerId, { from: strikeTick, to: this.lastFrameTick });
+            else
+                this.staleUpTo.delete(peerId);
+            for (const m of this.peerHashes.values())
+                m.delete(peerId);
+            this.ready.add(peerId);
+            this.lastHashRx.set(peerId, this.hub.clock.now());
+        }
+        catch (e) {
+            this.hub.reportError(e instanceof Error ? e : new Error(String(e)));
+        }
+        finally {
+            this.snapshotting.delete(peerId);
+        }
+    }
+    prune(m) {
+        if (m.size <= 64)
+            return;
+        const keys = [...m.keys()].sort((a, b) => a - b);
+        for (const k of keys.slice(0, keys.length - 64))
+            m.delete(k);
+    }
+    // ---- joiner watchdog --------------------------------------------------------------------------------------------
+    /** Joiner: ms since the last frame from the host (only meaningful once in game). */
+    get msSinceFrame() {
+        return this.hub.clock.now() - this.lastFrameRx;
+    }
+    /** True when a started joiner has heard no frames for 3 s: the Lobby then runs the host-loss rule (s.9). */
+    hostSilent() {
+        return !this.hosting && this._started && this.msSinceFrame > HOST_SILENCE_MS;
+    }
+    /** Reset the silence timer, e.g. after the link to a new host opened. */
+    touch() {
+        this.lastFrameRx = this.hub.clock.now();
+    }
+    hiMessage(peerId) {
+        return { type: "hi", proto: PROTO, peerId, lastTick: this.lastFrameTick };
+    }
+    get resyncCount() {
+        return this.desyncs;
+    }
+}
+//# sourceMappingURL=lockstep.js.map

package/dist/lockstep.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lockstep.js","sourceRoot":"","sources":["../src/lockstep.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAC3D,OAAO,EAAE,KAAK,EAAmC,MAAM,YAAY,CAAC;AACpE,OAAO,EAAE,OAAO,EAAE,gBAAgB,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAuBvC,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,CAAC;AAC7B,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,CAAC;AACrC,MAAM,CAAC,MAAM,eAAe,GAAG,IAAI,CAAC;AACpC,MAAM,CAAC,MAAM,oBAAoB,GAAG,MAAM,CAAC;AAC3C,MAAM,qBAAqB,GAAG,IAAI,CAAC;AAQnC;;;;;;;;GAQG;AACH,MAAM,OAAO,QAAS,SAAQ,OAAuB;IAwC/B;IAvCpB,QAAQ,GAA8B,IAAI,CAAC;IAC3C,OAAO,GAAuD,IAAI,CAAC;IAE1D,cAAc,CAAS;IAChC,mDAAmD;IACnD,SAAS,GAAG,aAAa,CAAC;IAClB,UAAU,CAAS;IAEnB,KAAK,GAAY,EAAE,CAAC;IACpB,OAAO,GAAY,EAAE,CAAC;IAC9B,2EAA2E;IACnE,aAAa,GAAG,CAAC,CAAC,CAAC;IAC3B,mGAAmG;IAC3F,YAAY,GAAG,CAAC,CAAC;IACjB,MAAM,GAAG,CAAC,CAAC;IACX,gBAAgB,GAAG,KAAK,CAAC;IACzB,WAAW,GAAG,CAAC,CAAC;IAChB,eAAe,GAAG,CAAC,QAAQ,CAAC;IAC5B,eAAe,GAAG,CAAC,CAAC;IAE5B,YAAY;IACJ,OAAO,GAAG,KAAK,CAAC;IAChB,QAAQ,GAAG,KAAK,CAAC;IACjB,OAAO,GAAmB,EAAE,CAAC;IAC7B,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAC1B,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,YAAY,GAAwB,IAAI,CAAC;IACzC,QAAQ,GAAG,CAAC,CAAC;IACb,OAAO,GAAG,CAAC,CAAC;IACZ,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,UAAU,GAAG,IAAI,GAAG,EAA+B,CAAC;IACpD,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IACpC,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,gHAAgH;IACxG,SAAS,GAAG,IAAI,GAAG,EAAwC,CAAC;IAEpE,cAAc;IACN,eAAe,GAA0D,IAAI,CAAC;IAEtF,YAAoB,GAAQ,EAAE,IAAqB;QACjD,KAAK,EAAE,CAAC;QADU,QAAG,GAAH,GAAG,CAAK;QAE1B,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;QACvD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,QAAQ,GAAG,EAAE,CAAC,CAAC;QACxE,IAAI,CAAC,WAAW,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;IACrC,CAAC;IAED,kHAAkH;IAElH,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IACD,IAAI,cAAc;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IACD,iFAAiF;IACjF,IAAI,UAAU;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAC/B,CAAC;IACD,wCAAwC;IACxC,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IACD,6FAA6F;IAC7F,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;IACzC,CAAC;IACD,qEAAqE;IACrE,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,aAAa,CAAC;IAC5B,CAAC;IAED,sFAAsF;IACtF,MAAM,CAAC,KAAiB;QACtB,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAC5E,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QACxE,CAAC;IACH,CAAC;IAED,SAAS;QACP,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,IAAI,CAAC;QACrC,IAAI,CAAC;YAAE,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,IAAI,CAAC;QAClC,OAAO,CAAC,CAAC;IACX,CAAC;IAED,UAAU,CAAC,IAAY,EAAE,IAAY;QACnC,IAAI,IAAI,CAAC,gBAAgB,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,cAAc,KAAK,CAAC;YAAE,OAAO;QACnF,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC/B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACzC,IAAI,MAAM,EAAE,CAAC;gBACX,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC7B,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;oBAAE,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;YACrG,CAAC;QACH,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IAED,kHAAkH;IAElH,8EAA8E;IAC9E,QAAQ;QACN,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QACpB,IAAI,IAAI,CAAC,aAAa,GAAG,CAAC;YAAE,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;IACrD,CAAC;IAED,oHAAoH;IACpH,SAAS;QACP,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;QACjB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;QACrC,IAAI,CAAC,YAAY,EAAE,EAAE,CAAC;QACtB,MAAM,QAAQ,GAAG,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC;QAC1C,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACnH,CAAC;IAED,uGAAuG;IACvG,UAAU;QACR,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QACvB,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACrB,IAAI,CAAC,gBAAgB,GAAG,KAAK,CAAC;QAC9B,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChB,IAAI,IAAI,CAAC,QAAQ;YAAE,IAAI,CAAC,SAAS,EAAE,CAAC;IACtC,CAAC;IAED,oHAAoH;IACpH,YAAY;QACV,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC;QACrB,IAAI,CAAC,YAAY,EAAE,EAAE,CAAC;QACtB,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;QACzB,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;IAC1C,CAAC;IAED,sGAAsG;IACtG,WAAW;QACT,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO;QAC1B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACvB,CAAC;IAED,IAAI;QACF,IAAI,CAAC,YAAY,EAAE,EAAE,CAAC;QACtB,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;IAC3B,CAAC;IAED,UAAU,CAAC,MAAc;QACvB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC1B,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACjC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC5B,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC/B,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC9B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE;YAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC3D,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;IACjE,CAAC;IAED,oHAAoH;IAE5G,IAAI,CAAC,QAAgB;QAC3B,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,OAAO;QAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;QACjC,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC;QAC1E,IAAI,GAAG,GAAG,EAAE,EAAE,CAAC;YACb,iGAAiG;YACjG,IAAI,CAAC,QAAQ,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC;YAC9C,GAAG,GAAG,CAAC,CAAC;QACV,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,SAAS,EAAE,CAAC;IACjD,CAAC;IAEO,SAAS;QACf,yEAAyE;QACzE,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;QAC5E,MAAM,KAAK,GAAU,EAAE,IAAI,EAAE,IAAI,CAAC,aAAa,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC;QAChE,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,IAAI,CAAC;QAChC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACnB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvB,MAAM,GAAG,GAAY,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC;QACnE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QACvD,IAAI,CAAC,gBAAgB,EAAE,CAAC;IAC1B,CAAC;IAEO,MAAM,CAAC,CAAQ;QACrB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,UAAU;YAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC;IAC3G,CAAC;IAED,iGAAiG;IACzF,gBAAgB;QACtB,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO;QACtC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,oBAAoB,EAAE,CAAC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;QACnG,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;YAC3C,IAAI,GAAG,GAAG,IAAI,GAAG,KAAK;gBAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IAED,oHAAoH;IAEpH,MAAM,CAAC,IAAY,EAAE,GAAY;QAC/B,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;YACjB,KAAK,KAAK;gBACR,IAAI,IAAI,CAAC,OAAO;oBAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC;gBACxE,MAAM;YACR,KAAK,OAAO;gBACV,IAAI,CAAC,IAAI,CAAC,OAAO;oBAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC;gBACxD,MAAM;YACR,KAAK,MAAM;gBACT,IAAI,IAAI,CAAC,OAAO;oBAAE,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;gBAC5D,MAAM;YACR,KAAK,QAAQ;gBACX,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;oBAClB,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC;oBAC7B,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;oBAChB,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;gBAC1F,CAAC;gBACD,MAAM;YACR,KAAK,cAAc;gBACjB,IAAI,IAAI,CAAC,OAAO;oBAAE,KAAK,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;gBAC/C,MAAM;YACR,KAAK,UAAU;gBACb,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;oBAClB,IAAI,CAAC,WAAW,EAAE,CAAC;oBACnB,IAAI,CAAC,eAAe,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC;gBAChF,CAAC;gBACD,MAAM;QACV,CAAC;IACH,CAAC;IAED,sFAAsF;IACtF,IAAI,eAAe;QACjB,OAAO,IAAI,CAAC,eAAe,KAAK,IAAI,CAAC;IACvC,CAAC;IAED,kEAAkE;IAClE,iBAAiB,CAAC,OAAmB;QACnC,MAAM,EAAE,GAAG,IAAI,CAAC,eAAe,CAAC;QAChC,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC;QAC5B,IAAI,CAAC,EAAE;YAAE,OAAO;QAChB,IAAI,OAAO,CAAC,MAAM,KAAK,EAAE,CAAC,KAAK,EAAE,CAAC;YAChC,gFAAgF;YAChF,IAAI,CAAC,gBAAgB,GAAG,KAAK,CAAC;YAC9B,IAAI,CAAC,eAAe,EAAE,CAAC;YACvB,OAAO;QACT,CAAC;QACD,KAAK,IAAI,CAAC,aAAa,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IACvC,CAAC;IAEO,OAAO,CAAC,IAAY,EAAE,QAAwB;QACpD,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;QACxC,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,IAAI,IAAI,CAAC,gBAAgB;YAAE,OAAO;QAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;QACrD,IAAI,IAAI,GAAG,QAAQ;YAAE,OAAO,CAAC,6BAA6B;QAC1D,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;YACpB,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC,iCAAiC;YACzD,OAAO;QACT,CAAC;QACD,MAAM,CAAC,GAAU,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;QACpC,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACf,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,CAAC;YAAE,IAAI,CAAC,eAAe,EAAE,CAAC;IACxE,CAAC;IAED,8GAA8G;IAC9G,eAAe;QACb,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;QACjC,IAAI,IAAI,CAAC,gBAAgB,IAAI,GAAG,GAAG,IAAI,CAAC,eAAe,GAAG,IAAI;YAAE,OAAO;QACvE,IAAI,CAAC,eAAe,GAAG,GAAG,CAAC;QAC3B,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,SAAS,EAAE,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;IAC/E,CAAC;IAED,yGAAyG;IACzG,QAAQ;QACN,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,SAAS,EAAE,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;IAC/E,CAAC;IAEO,KAAK,CAAC,aAAa,CAAC,EAAkD,EAAE,OAAmB;QACjG,IAAI,CAAC;YACH,IAAI,KAAK,GAAG,OAAO,CAAC;YACpB,IAAI,EAAE,CAAC,KAAK,GAAG,CAAC;gBAAE,KAAK,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,CAAC;YACjD,IAAI,CAAC,IAAI,CAAC,OAAO;gBAAE,MAAM,IAAI,KAAK,CAAC,sDAAsD,CAAC,CAAC;YAC3F,sFAAsF;YACtF,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAC7B,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YAChB,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;YAClB,IAAI,CAAC,aAAa,GAAG,EAAE,CAAC,IAAI,CAAC;YAC7B,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC,IAAI,CAAC;YAC5B,IAAI,CAAC,gBAAgB,GAAG,KAAK,CAAC;YAC9B,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC;YACzB,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;YACxC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QACjC,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACpE,0GAA0G;YAC1G,IAAI,EAAE,IAAI,CAAC,eAAe,IAAI,mBAAmB,EAAE,CAAC;gBAClD,IAAI,CAAC,gBAAgB,GAAG,KAAK,CAAC;gBAC9B,IAAI,CAAC,eAAe,GAAG,CAAC,QAAQ,CAAC;gBACjC,IAAI,CAAC,eAAe,EAAE,CAAC;YACzB,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,2BAA2B,IAAI,CAAC,eAAe,mBAAmB,CAAC,CAAC,CAAC;YACtG,CAAC;QACH,CAAC;IACH,CAAC;IAED,oHAAoH;IAEpH,6GAA6G;IAC7G,QAAQ,CAAC,MAAc,EAAE,QAAgB;QACvC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC;QAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC;QACpC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC;QACxE,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;YACjB,0EAA0E;YAC1E,IAAI,IAAI,CAAC,QAAQ,IAAI,QAAQ,GAAG,CAAC;gBAAE,KAAK,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;;gBAC7D,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC5B,OAAO;QACT,CAAC;QACD,IAAI,QAAQ,IAAI,QAAQ,IAAI,QAAQ,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC;YAClD,+EAA+E;YAC/E,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBAC7B,IAAI,CAAC,CAAC,IAAI,GAAG,QAAQ;oBAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC;YAC3G,CAAC;YACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACzB,CAAC;aAAM,CAAC;YACN,KAAK,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IAEO,UAAU,CAAC,MAAc,EAAE,IAAY,EAAE,IAAY;QAC3D,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC;QAClD,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC;YAAE,OAAO;QACvC,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,CAAC,CAAC;gBAAE,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC;YACnD,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACpB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC5B,OAAO;QACT,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;IACxC,CAAC;IAEO,OAAO,CAAC,MAAc,EAAE,IAAY,EAAE,QAAgB,EAAE,QAAgB;QAC9E,IAAI,QAAQ,KAAK,QAAQ;YAAE,OAAO;QAClC,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC;YAAE,OAAO;QACvC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,OAAO,CAAC,yBAAyB;QAC/F,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAC9C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,IAAI,WAAW,EAAE,CAAC;YACrB,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;YACpC,OAAO;QACT,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC;QACzE,KAAK,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IACvC,CAAC;IAED,gIAAgI;IACxH,OAAO,CAAC,MAAc,EAAE,IAAY;QAC1C,MAAM,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACrC,OAAO,CAAC,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC;IAC9C,CAAC;IAEO,KAAK,CAAC,YAAY,CAAC,MAAc,EAAE,UAAU,GAAG,QAAQ;QAC9D,IAAI,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,OAAO;QAC1C,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnB,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,uDAAuD,CAAC,CAAC,CAAC;YACzF,OAAO;QACT,CAAC;QACD,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,qDAAqD;QAChF,IAAI,CAAC;YACH,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC;YAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC5B,IAAI,OAAO,GAAG,GAAG,CAAC;YAClB,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,IAAI,GAAG,CAAC,MAAM,IAAI,qBAAqB,IAAI,gBAAgB,EAAE,EAAE,CAAC;gBAC9D,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC;gBAC7B,KAAK,GAAG,CAAC,CAAC;YACZ,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,OAAO,CAAC,8BAA8B;YAC1E,iFAAiF;YACjF,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC;YACxF,KAAK,MAAM,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC;gBAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5G,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBAC7B,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC;oBAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC;YACpG,CAAC;YACD,IAAI,UAAU,KAAK,QAAQ;gBAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;;gBACjG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACnC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE;gBAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC3D,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACvB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC;QACpD,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,CAAC;gBAAS,CAAC;YACT,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IAEO,KAAK,CAAI,CAAiB;QAChC,IAAI,CAAC,CAAC,IAAI,IAAI,EAAE;YAAE,OAAO;QACzB,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACjD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;YAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC/D,CAAC;IAED,oHAAoH;IAEpH,oFAAoF;IACpF,IAAI,YAAY;QACd,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC;IACjD,CAAC;IAED,4GAA4G;IAC5G,UAAU;QACR,OAAO,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,YAAY,GAAG,eAAe,CAAC;IAC/E,CAAC;IAED,yEAAyE;IACzE,KAAK;QACH,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;IAC1C,CAAC;IAED,SAAS,CAAC,MAAc;QACtB,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,aAAa,EAAE,CAAC;IAC5E,CAAC;IAED,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;CACF","sourcesContent":["import { CHUNK_PAYLOAD, splitChunks } from \"./chunking.js\";\nimport { PROTO, type FrameCommand, type Message } from \"./codec.js\";\nimport { deflate, deflateAvailable, inflate } from \"./deflate.js\";\nimport { Emitter } from \"./emitter.js\";\nimport type { Hub } from \"./hub.js\";\n\nexport interface Frame {\n  tick: number;\n  commands: FrameCommand[];\n}\n\nexport interface DesyncInfo {\n  tick: number;\n  hostHash: bigint;\n  yourHash: bigint;\n}\n\nexport type LockstepEvents = {\n  desync: [DesyncInfo];\n  /** A snapshot was applied (late join, desync, falling too far behind). */\n  restored: [tick: number];\n  /** First frame (or snapshot) of the game reached this peer: the session is in game. */\n  started: [];\n  error: [Error];\n};\n\nexport const MAX_DESYNCS = 3;\nexport const MAX_RESTORE_RETRIES = 3;\nexport const HOST_SILENCE_MS = 3000;\nexport const PEER_HASH_SILENCE_MS = 10_000;\nconst SNAPSHOT_COMPRESS_MIN = 1024;\n\nexport interface LockstepOptions {\n  hashEveryTicks: number;\n  /** Frames kept for replays (late join, migration). Default 30 s of ticks. */\n  historyFrames?: number;\n}\n\n/**\n * Host-ordered lockstep (spec/binary.md, DESIGN s.8). One class for both roles: the host emits `frame(T)` on a fixed\n * cadence and never waits; joiners queue frames and hand them out through `nextFrame()`.\n *\n * Ticks: the initial state is tick 0 and has no frame; `frame(T)` produces tick T. `reportHash(tick, h)` is called\n * after applying `frame.tick` (the library only sends when `tick % hashEveryTicks == 0`, tick > 0). `snapshot()` must\n * return the state after the last frame returned by `nextFrame()`; `restore(tick, bytes)` receives that tick, and the\n * next frame applied is `tick + 1`.\n */\nexport class Lockstep extends Emitter<LockstepEvents> {\n  snapshot: (() => Uint8Array) | null = null;\n  restore: ((tick: number, bytes: Uint8Array) => void) | null = null;\n\n  readonly hashEveryTicks: number;\n  /** Chunk body size used when serving snapshots. */\n  chunkSize = CHUNK_PAYLOAD;\n  private historyMax: number;\n\n  private queue: Frame[] = [];\n  private history: Frame[] = [];\n  /** Highest frame tick received/emitted; -1 = no state (a fresh joiner). */\n  private lastFrameTick = -1;\n  /** Tick of the state the game holds (last frame returned by nextFrame, or a restored snapshot). */\n  private consumedTick = 0;\n  private cmdSeq = 1;\n  private awaitingSnapshot = false;\n  private lastFrameRx = 0;\n  private lastSnapshotReq = -Infinity;\n  private restoreFailures = 0;\n\n  // host side\n  private hosting = false;\n  private _started = false;\n  private pending: FrameCommand[] = [];\n  private ready = new Set<number>();\n  private snapshotting = new Set<number>();\n  private cancelTicker: (() => void) | null = null;\n  private baseTime = 0;\n  private emitted = 0;\n  private ownHashes = new Map<number, bigint>();\n  private peerHashes = new Map<number, Map<number, bigint>>();\n  private desyncs = new Map<number, number>();\n  private lastHashRx = new Map<number, number>();\n  /** Hashes a peer sent for ticks up to this were computed before it restored a snapshot: stale, not evidence. */\n  private staleUpTo = new Map<number, { from: number; to: number }>();\n\n  // joiner side\n  private pendingSnapshot: { tick: number; total: number; flags: number } | null = null;\n\n  constructor(private hub: Hub, opts: LockstepOptions) {\n    super();\n    this.hashEveryTicks = Math.max(1, opts.hashEveryTicks);\n    this.historyMax = opts.historyFrames ?? Math.max(60, hub.tickRate * 30);\n    this.lastFrameRx = hub.clock.now();\n  }\n\n  // ---- public game-facing surface -------------------------------------------------------------------------------\n\n  get started(): boolean {\n    return this._started;\n  }\n  get framesBuffered(): number {\n    return this.queue.length;\n  }\n  /** True when the game should run ticks without rendering (> 2 frames behind). */\n  get catchingUp(): boolean {\n    return this.queue.length > 2;\n  }\n  /** Tick of the game's current state. */\n  get currentTick(): number {\n    return this.consumedTick;\n  }\n  /** Highest frame tick known to this peer (0 when none yet; the host's `welcome_dc.tick`). */\n  get lastTick(): number {\n    return Math.max(0, this.lastFrameTick);\n  }\n  /** What `hi.lastTick` carries: -1 until the first frame/snapshot. */\n  get hiTick(): number {\n    return this.lastFrameTick;\n  }\n\n  /** Queue a command. Host: into its own next frame. Joiner: to the host (reliable). */\n  submit(bytes: Uint8Array): void {\n    if (this.hosting) {\n      this.pending.push({ peerId: this.hub.localPeerId, bytes: bytes.slice() });\n    } else {\n      this.hub.sendToHost({ type: \"cmd\", seq: this.cmdSeq++ >>> 0, bytes });\n    }\n  }\n\n  nextFrame(): Frame | null {\n    const f = this.queue.shift() ?? null;\n    if (f) this.consumedTick = f.tick;\n    return f;\n  }\n\n  reportHash(tick: number, hash: bigint): void {\n    if (this.awaitingSnapshot || tick <= 0 || tick % this.hashEveryTicks !== 0) return;\n    if (this.hosting) {\n      this.ownHashes.set(tick, hash);\n      this.prune(this.ownHashes);\n      const theirs = this.peerHashes.get(tick);\n      if (theirs) {\n        this.peerHashes.delete(tick);\n        for (const [peer, h] of [...theirs].sort((a, b) => a[0] - b[0])) this.compare(peer, tick, hash, h);\n      }\n    } else {\n      this.hub.sendToHost({ type: \"hash\", tick, hash });\n    }\n  }\n\n  // ---- role control (called by Lobby) ---------------------------------------------------------------------------\n\n  /** Host role without emitting yet (lobby phase): peers may already say hi. */\n  hostIdle(): void {\n    this.hosting = true;\n    if (this.lastFrameTick < 0) this.lastFrameTick = 0;\n  }\n\n  /** Host begins emitting frames (game start, or after winning a migration), continuing after the last known tick. */\n  hostStart(): void {\n    this.hostIdle();\n    this._started = true;\n    this.emitted = 0;\n    this.baseTime = this.hub.clock.now();\n    this.cancelTicker?.();\n    const interval = 1000 / this.hub.tickRate;\n    this.cancelTicker = this.hub.clock.setInterval(() => this.pump(interval), Math.max(1, Math.floor(interval / 2)));\n  }\n\n  /** Winning a migration: continue from our last received frame. Pending commands are lost by design. */\n  becomeHost(): void {\n    this.pending = [];\n    this.ready.clear();\n    this.snapshotting.clear();\n    this.ownHashes.clear();\n    this.peerHashes.clear();\n    this.desyncs.clear();\n    this.awaitingSnapshot = false;\n    this.hostIdle();\n    if (this._started) this.hostStart();\n  }\n\n  /** Losing a claim, or a new host appeared: stop emitting. Keep history; the new host decides replay vs snapshot. */\n  becomeJoiner(): void {\n    this.hosting = false;\n    this.cancelTicker?.();\n    this.cancelTicker = null;\n    this.pending = [];\n    this.ready.clear();\n    this.lastFrameRx = this.hub.clock.now();\n  }\n\n  /** A joiner just learned the session is in game (first frame, snapshot, or phase from the server). */\n  markStarted(): void {\n    if (this._started) return;\n    this._started = true;\n    this.emit(\"started\");\n  }\n\n  stop(): void {\n    this.cancelTicker?.();\n    this.cancelTicker = null;\n  }\n\n  onPeerLeft(peerId: number): void {\n    this.ready.delete(peerId);\n    this.snapshotting.delete(peerId);\n    this.desyncs.delete(peerId);\n    this.lastHashRx.delete(peerId);\n    this.staleUpTo.delete(peerId);\n    for (const m of this.peerHashes.values()) m.delete(peerId);\n    this.pending = this.pending.filter((c) => c.peerId !== peerId);\n  }\n\n  // ---- host: frame emission ---------------------------------------------------------------------------------------\n\n  private pump(interval: number): void {\n    if (!this.hosting) return;\n    const now = this.hub.clock.now();\n    let due = Math.floor((now - this.baseTime + 1) / interval) - this.emitted;\n    if (due > 10) {\n      // Starved (e.g. a throttled tab): do not flood. Rebase rather than emit a burst of empty frames.\n      this.baseTime = now - this.emitted * interval;\n      due = 1;\n    }\n    for (let i = 0; i < due; i++) this.emitFrame();\n  }\n\n  private emitFrame(): void {\n    // sorted by peerId, stable: one peer's commands keep their arrival order\n    const commands = this.pending.splice(0).sort((a, b) => a.peerId - b.peerId);\n    const frame: Frame = { tick: this.lastFrameTick + 1, commands };\n    this.emitted++;\n    this.lastFrameTick = frame.tick;\n    this.record(frame);\n    this.queue.push(frame);\n    const msg: Message = { type: \"frame\", tick: frame.tick, commands };\n    for (const p of this.ready) this.hub.sendTo(p, msg, 0);\n    this.checkPeerSilence();\n  }\n\n  private record(f: Frame): void {\n    this.history.push(f);\n    if (this.history.length > this.historyMax) this.history.splice(0, this.history.length - this.historyMax);\n  }\n\n  /** The host drops a peer it has had no `hash` from for 10 s (scaled up when hashes are rare). */\n  private checkPeerSilence(): void {\n    if (this.ownHashes.size === 0) return;\n    const now = this.hub.clock.now();\n    const limit = Math.max(PEER_HASH_SILENCE_MS, (this.hashEveryTicks / this.hub.tickRate) * 1000 * 3);\n    for (const p of [...this.ready]) {\n      const last = this.lastHashRx.get(p) ?? now;\n      if (now - last > limit) this.hub.dropPeer(p, \"timeout\");\n    }\n  }\n\n  // ---- message handling -------------------------------------------------------------------------------------------\n\n  handle(from: number, msg: Message): void {\n    switch (msg.type) {\n      case \"cmd\":\n        if (this.hosting) this.pending.push({ peerId: from, bytes: msg.bytes });\n        break;\n      case \"frame\":\n        if (!this.hosting) this.onFrame(msg.tick, msg.commands);\n        break;\n      case \"hash\":\n        if (this.hosting) this.onPeerHash(from, msg.tick, msg.hash);\n        break;\n      case \"desync\":\n        if (!this.hosting) {\n          this.awaitingSnapshot = true;\n          this.queue = [];\n          this.emit(\"desync\", { tick: msg.tick, hostHash: msg.hostHash, yourHash: msg.yourHash });\n        }\n        break;\n      case \"snapshot_req\":\n        if (this.hosting) void this.sendSnapshot(from);\n        break;\n      case \"snapshot\":\n        if (!this.hosting) {\n          this.markStarted();\n          this.pendingSnapshot = { tick: msg.tick, total: msg.total, flags: msg.flags };\n        }\n        break;\n    }\n  }\n\n  /** True when a `snapshot` header was seen and its chunk set has not completed yet. */\n  get snapshotPending(): boolean {\n    return this.pendingSnapshot !== null;\n  }\n\n  /** The reassembled chunk set that follows a `snapshot` header. */\n  onSnapshotPayload(payload: Uint8Array): void {\n    const ps = this.pendingSnapshot;\n    this.pendingSnapshot = null;\n    if (!ps) return;\n    if (payload.length !== ps.total) {\n      // spec: a receiver that gets a different sum drops the snapshot and re-requests\n      this.awaitingSnapshot = false;\n      this.requestSnapshot();\n      return;\n    }\n    void this.applySnapshot(ps, payload);\n  }\n\n  private onFrame(tick: number, commands: FrameCommand[]): void {\n    this.lastFrameRx = this.hub.clock.now();\n    this.markStarted();\n    if (this.awaitingSnapshot) return;\n    const expected = Math.max(0, this.lastFrameTick) + 1;\n    if (tick < expected) return; // duplicate (replay overlap)\n    if (tick > expected) {\n      this.requestSnapshot(); // gap: the host changed under us\n      return;\n    }\n    const f: Frame = { tick, commands };\n    this.lastFrameTick = tick;\n    this.record(f);\n    this.queue.push(f);\n    if (this.queue.length > this.hub.tickRate * 3) this.requestSnapshot();\n  }\n\n  /** Joiner asks the host for a snapshot (far behind, gap, silent host). Throttled while one is outstanding. */\n  requestSnapshot(): void {\n    const now = this.hub.clock.now();\n    if (this.awaitingSnapshot && now - this.lastSnapshotReq < 2000) return;\n    this.lastSnapshotReq = now;\n    this.awaitingSnapshot = true;\n    this.queue = [];\n    this.hub.sendToHost({ type: \"snapshot_req\", sinceTick: this.lastFrameTick });\n  }\n\n  /** 3 s without frames: ask the host for a snapshot without discarding anything (a live host answers). */\n  pokeHost(): void {\n    this.hub.sendToHost({ type: \"snapshot_req\", sinceTick: this.lastFrameTick });\n  }\n\n  private async applySnapshot(ps: { tick: number; total: number; flags: number }, payload: Uint8Array): Promise<void> {\n    try {\n      let bytes = payload;\n      if (ps.flags & 1) bytes = await inflate(payload);\n      if (!this.restore) throw new Error(\"lockstep.restore is not set; cannot apply a snapshot\");\n      // Restore first: if the game's restore() throws, our bookkeeping must not have moved.\n      this.restore(ps.tick, bytes);\n      this.queue = [];\n      this.history = [];\n      this.lastFrameTick = ps.tick;\n      this.consumedTick = ps.tick;\n      this.awaitingSnapshot = false;\n      this.restoreFailures = 0;\n      this.markStarted();\n      this.lastFrameRx = this.hub.clock.now();\n      this.emit(\"restored\", ps.tick);\n    } catch (e) {\n      this.hub.reportError(e instanceof Error ? e : new Error(String(e)));\n      // The game's state is unknown after a failed restore: keep our tick where it was, drop frames, ask again.\n      if (++this.restoreFailures <= MAX_RESTORE_RETRIES) {\n        this.awaitingSnapshot = false;\n        this.lastSnapshotReq = -Infinity;\n        this.requestSnapshot();\n      } else {\n        this.hub.reportError(new Error(`snapshot restore failed ${this.restoreFailures} times; giving up`));\n      }\n    }\n  }\n\n  // ---- host: hello, hashes, snapshots -----------------------------------------------------------------------------\n\n  /** Host: a peer said hi (welcome_dc and chat_history already sent). Decide: nothing, replay, or snapshot. */\n  onPeerHi(peerId: number, lastTick: number): void {\n    this.lastHashRx.set(peerId, this.hub.clock.now());\n    const hostTick = this.lastFrameTick;\n    const first = this.history.length ? this.history[0].tick : hostTick + 1;\n    if (lastTick < 0) {\n      // fresh joiner: initial state if no game is running, otherwise a snapshot\n      if (this._started && hostTick > 0) void this.sendSnapshot(peerId);\n      else this.ready.add(peerId);\n      return;\n    }\n    if (lastTick <= hostTick && lastTick + 1 >= first) {\n      // The peer's timeline is a prefix of ours: replay what it lacks, then go live.\n      for (const f of this.history) {\n        if (f.tick > lastTick) this.hub.sendTo(peerId, { type: \"frame\", tick: f.tick, commands: f.commands }, 0);\n      }\n      this.ready.add(peerId);\n    } else {\n      void this.sendSnapshot(peerId);\n    }\n  }\n\n  private onPeerHash(peerId: number, tick: number, hash: bigint): void {\n    this.lastHashRx.set(peerId, this.hub.clock.now());\n    if (this.isStale(peerId, tick)) return;\n    const own = this.ownHashes.get(tick);\n    if (own === undefined) {\n      let m = this.peerHashes.get(tick);\n      if (!m) this.peerHashes.set(tick, (m = new Map()));\n      m.set(peerId, hash);\n      this.prune(this.peerHashes);\n      return;\n    }\n    this.compare(peerId, tick, own, hash);\n  }\n\n  private compare(peerId: number, tick: number, hostHash: bigint, yourHash: bigint): void {\n    if (hostHash === yourHash) return;\n    if (this.isStale(peerId, tick)) return;\n    if (!this.ready.has(peerId) || this.snapshotting.has(peerId)) return; // already being resynced\n    const n = (this.desyncs.get(peerId) ?? 0) + 1;\n    this.desyncs.set(peerId, n);\n    if (n >= MAX_DESYNCS) {\n      this.hub.dropPeer(peerId, \"desync\");\n      return;\n    }\n    this.hub.sendTo(peerId, { type: \"desync\", tick, hostHash, yourHash }, 0);\n    void this.sendSnapshot(peerId, tick);\n  }\n\n  /** Hashes computed before a peer restored its snapshot (ticks after the strike, up to what we had emitted) are not evidence. */\n  private isStale(peerId: number, tick: number): boolean {\n    const w = this.staleUpTo.get(peerId);\n    return !!w && tick > w.from && tick <= w.to;\n  }\n\n  private async sendSnapshot(peerId: number, strikeTick = Infinity): Promise<void> {\n    if (this.snapshotting.has(peerId)) return;\n    if (!this.snapshot) {\n      this.hub.reportError(new Error(\"lockstep.snapshot is not set; cannot serve a snapshot\"));\n      return;\n    }\n    this.snapshotting.add(peerId);\n    this.ready.delete(peerId); // live frames now flow only through the replay below\n    try {\n      const S = this.consumedTick;\n      const raw = this.snapshot();\n      let payload = raw;\n      let flags = 0;\n      if (raw.length >= SNAPSHOT_COMPRESS_MIN && deflateAvailable()) {\n        payload = await deflate(raw);\n        flags = 1;\n      }\n      if (!this.snapshotting.has(peerId)) return; // peer left while compressing\n      // header + one contiguous chunk set + frames S+1... with nothing else in between\n      this.hub.sendTo(peerId, { type: \"snapshot\", tick: S, total: payload.length, flags }, 0);\n      for (const c of splitChunks(this.hub.nextChunkId(), payload, this.chunkSize)) this.hub.sendTo(peerId, c, 0);\n      for (const f of this.history) {\n        if (f.tick > S) this.hub.sendTo(peerId, { type: \"frame\", tick: f.tick, commands: f.commands }, 0);\n      }\n      if (strikeTick !== Infinity) this.staleUpTo.set(peerId, { from: strikeTick, to: this.lastFrameTick });\n      else this.staleUpTo.delete(peerId);\n      for (const m of this.peerHashes.values()) m.delete(peerId);\n      this.ready.add(peerId);\n      this.lastHashRx.set(peerId, this.hub.clock.now());\n    } catch (e) {\n      this.hub.reportError(e instanceof Error ? e : new Error(String(e)));\n    } finally {\n      this.snapshotting.delete(peerId);\n    }\n  }\n\n  private prune<T>(m: Map<number, T>): void {\n    if (m.size <= 64) return;\n    const keys = [...m.keys()].sort((a, b) => a - b);\n    for (const k of keys.slice(0, keys.length - 64)) m.delete(k);\n  }\n\n  // ---- joiner watchdog --------------------------------------------------------------------------------------------\n\n  /** Joiner: ms since the last frame from the host (only meaningful once in game). */\n  get msSinceFrame(): number {\n    return this.hub.clock.now() - this.lastFrameRx;\n  }\n\n  /** True when a started joiner has heard no frames for 3 s: the Lobby then runs the host-loss rule (s.9). */\n  hostSilent(): boolean {\n    return !this.hosting && this._started && this.msSinceFrame > HOST_SILENCE_MS;\n  }\n\n  /** Reset the silence timer, e.g. after the link to a new host opened. */\n  touch(): void {\n    this.lastFrameRx = this.hub.clock.now();\n  }\n\n  hiMessage(peerId: number): Message {\n    return { type: \"hi\", proto: PROTO, peerId, lastTick: this.lastFrameTick };\n  }\n\n  get resyncCount(): Map<number, number> {\n    return this.desyncs;\n  }\n}\n"]}

package/dist/migration.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Host migration rule (DESIGN s.9). Pure functions so the rule is testable without any network.
+ *
+ *  - New host = lowest peerId still connected.
+ *  - Two claims: higher epoch wins; equal epoch -> lower peerId wins; the loser demotes itself.
+ */
+export interface Claim {
+    epoch: number;
+    hostId: number;
+}
+/** Lowest peerId among `connected`, skipping the failed host. Null when nobody is left. */
+export declare function pickNewHost(connected: Iterable<number>, failedHost: number): number | null;
+/** True when claim `a` beats claim `b`. */
+export declare function claimWins(a: Claim, b: Claim): boolean;
+/** Epochs are u16 on the wire; compare with wraparound so a long-lived lobby never sticks. */
+export declare function epochAfter(a: number, b: number): boolean;
+export declare function claimWinsWrapped(a: Claim, b: Claim): boolean;

package/dist/migration.js

@@ -0,0 +1,34 @@
+/**
+ * Host migration rule (DESIGN s.9). Pure functions so the rule is testable without any network.
+ *
+ *  - New host = lowest peerId still connected.
+ *  - Two claims: higher epoch wins; equal epoch -> lower peerId wins; the loser demotes itself.
+ */
+/** Lowest peerId among `connected`, skipping the failed host. Null when nobody is left. */
+export function pickNewHost(connected, failedHost) {
+    let best = null;
+    for (const id of connected) {
+        if (id === failedHost)
+            continue;
+        if (best === null || id < best)
+            best = id;
+    }
+    return best;
+}
+/** True when claim `a` beats claim `b`. */
+export function claimWins(a, b) {
+    if (a.epoch !== b.epoch)
+        return a.epoch > b.epoch;
+    return a.hostId < b.hostId;
+}
+/** Epochs are u16 on the wire; compare with wraparound so a long-lived lobby never sticks. */
+export function epochAfter(a, b) {
+    const d = (a - b) & 0xffff;
+    return d !== 0 && d < 0x8000;
+}
+export function claimWinsWrapped(a, b) {
+    if (a.epoch !== b.epoch)
+        return epochAfter(a.epoch, b.epoch);
+    return a.hostId < b.hostId;
+}
+//# sourceMappingURL=migration.js.map

package/dist/migration.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"migration.js","sourceRoot":"","sources":["../src/migration.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAOH,2FAA2F;AAC3F,MAAM,UAAU,WAAW,CAAC,SAA2B,EAAE,UAAkB;IACzE,IAAI,IAAI,GAAkB,IAAI,CAAC;IAC/B,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QAC3B,IAAI,EAAE,KAAK,UAAU;YAAE,SAAS;QAChC,IAAI,IAAI,KAAK,IAAI,IAAI,EAAE,GAAG,IAAI;YAAE,IAAI,GAAG,EAAE,CAAC;IAC5C,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,2CAA2C;AAC3C,MAAM,UAAU,SAAS,CAAC,CAAQ,EAAE,CAAQ;IAC1C,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK;QAAE,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;IAClD,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;AAC7B,CAAC;AAED,8FAA8F;AAC9F,MAAM,UAAU,UAAU,CAAC,CAAS,EAAE,CAAS;IAC7C,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC;IAC3B,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;AAC/B,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,CAAQ,EAAE,CAAQ;IACjD,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK;QAAE,OAAO,UAAU,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IAC7D,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;AAC7B,CAAC","sourcesContent":["/**\n * Host migration rule (DESIGN s.9). Pure functions so the rule is testable without any network.\n *\n *  - New host = lowest peerId still connected.\n *  - Two claims: higher epoch wins; equal epoch -> lower peerId wins; the loser demotes itself.\n */\n\nexport interface Claim {\n  epoch: number;\n  hostId: number;\n}\n\n/** Lowest peerId among `connected`, skipping the failed host. Null when nobody is left. */\nexport function pickNewHost(connected: Iterable<number>, failedHost: number): number | null {\n  let best: number | null = null;\n  for (const id of connected) {\n    if (id === failedHost) continue;\n    if (best === null || id < best) best = id;\n  }\n  return best;\n}\n\n/** True when claim `a` beats claim `b`. */\nexport function claimWins(a: Claim, b: Claim): boolean {\n  if (a.epoch !== b.epoch) return a.epoch > b.epoch;\n  return a.hostId < b.hostId;\n}\n\n/** Epochs are u16 on the wire; compare with wraparound so a long-lived lobby never sticks. */\nexport function epochAfter(a: number, b: number): boolean {\n  const d = (a - b) & 0xffff;\n  return d !== 0 && d < 0x8000;\n}\n\nexport function claimWinsWrapped(a: Claim, b: Claim): boolean {\n  if (a.epoch !== b.epoch) return epochAfter(a.epoch, b.epoch);\n  return a.hostId < b.hostId;\n}\n"]}