@blockcast/mmt-container 2.2.0-main.efb4fa4521af → 2.2.0-main.fb5c7dfbe2de

package/dist/iso-block-locator.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../mmt-base/src/mmtp.ts", "../../mmt-base/src/ntp-short.ts", "../../mmt-base/src/serial-number.ts", "../../mmt-base/src/fec-block-profile.ts", "../../mmt-base/src/fec-bindings.ts", "../src/iso-block-locator.ts"],
-  "sourcesContent": ["/**\n * @mmt/container - MMTP Parser\n *\n * MMTP (MMT Protocol) packet parser based on ISO/IEC 23008-1:2023 Section 9.2\n *\n * MMTP header format (12 bytes):\n * - Byte 0: V(2) | C(1) | FEC_type(2) | r(1) | X(1) | R(1)\n * - Byte 1: reserved(2) | packet_type(6)\n * - Bytes 2-3: packet_id (big-endian)\n * - Bytes 4-7: timestamp (big-endian, 32-bit)\n * - Bytes 8-11: sequence_number (big-endian)\n *\n * FEC_type values:\n * - 0: No FEC / source packet\n * - 1: FEC mode 0 (source with FEC payload ID)\n * - 2: FEC repair packet mode 0\n * - 3: FEC repair packet mode 1\n *\n * @packageDocumentation\n */\n\nexport interface MMTPHeader {\n  version: number\n  /** Packet type: 0x00=MPU, 0x02=Signaling, 0x03=Repair */\n  packetType: number\n  packetId: number\n  timestamp: bigint\n  sequenceNumber: number\n  payloadLength: number\n  fecType: number\n  /** C flag: header carries a 32-bit packet_counter. */\n  packetCounterFlag: boolean\n  packetCounter?: number\n  /** X flag: header carries an extension header and value. */\n  extensionFlag: boolean\n  extension?: { type: number; data: Uint8Array }\n  /** Byte offset at which the MMTP payload begins. */\n  headerLength: number\n  /** Random Access Point flag - indicates keyframe (ISO 23008-1, byte 0 bit 0) */\n  rapFlag: boolean\n}\n\nexport interface MPUHeader {\n  mpuSequenceNumber: number\n  fragmentationIndicator: number // FI: 0=complete, 1=first, 2=middle, 3=last\n  /** 8-bit MPU fragment_counter from byte 3. */\n  fragmentCounter: number\n  /** T flag: 1=timed media (14-byte MFU DU header), 0=non-timed (4-byte header) */\n  timedFlag: number\n  /** A flag: aggregated MPU payload. This strict profile requires A=0. */\n  aggregationFlag: boolean\n  /** MPU payload_length (bytes 0-1): bytes after the length field, including\n   *  the remaining six MPU-header bytes and all data-unit bytes. */\n  payloadLength: number\n}\n\nexport interface MFUDuHeader {\n  movieFragmentSequenceNumber: number\n  sampleNumber: number\n  offset: number\n  priority: number\n  dependencyCounter: number\n}\n\nexport interface MMTPPacket {\n  header: MMTPHeader\n  payload: Uint8Array\n}\n\nexport const MMTP_HEADER_SIZE = 12\nexport const MPU_HEADER_SIZE = 8\nexport const MFU_DU_HEADER_SIZE_TIMED = 14    // T=1: timed media (video/audio samples)\nexport const MFU_DU_HEADER_SIZE_NONTIMED = 4  // T=0: non-timed media (item_id only)\n\nconst MPU_LENGTH_FIELD_SIZE = 2\nconst MPU_HEADER_REMAINDER_SIZE = MPU_HEADER_SIZE - MPU_LENGTH_FIELD_SIZE\nexport const SOURCE_FEC_PAYLOAD_ID_SIZE = 4\n\n// MMTP Packet Types (ISO/IEC 23008-1:2023 Section 9.2.2)\nexport const PACKET_TYPE_MPU = 0x00\nexport const PACKET_TYPE_SIGNALING = 0x02\nexport const PACKET_TYPE_REPAIR = 0x03\n\n// AL-FEC Signaling Message ID (ISO/IEC 23008-1:2023 Amendment 1:2025)\nexport const ALFEC_MESSAGE_ID = 0x0203\n\n/**\n * MMTP `packet_id` of the signaling flow, which carries PACKET_TYPE_SIGNALING\n * packets such as the AL-FEC message (ALFEC_MESSAGE_ID). The FFmpeg `moq_mmt`\n * muxer sends that message on this packet_id into the same multicast group as\n * the media, and moqcast-draft (PR #44) makes advertising it for a track a\n * MUST NOT. A track's packet_id is therefore 1..MMTP_PACKET_ID_MAX.\n */\nexport const MMTP_SIGNALING_PACKET_ID = 0\n\n/** Largest value of the 16-bit MMTP `packet_id` header field. */\nexport const MMTP_PACKET_ID_MAX = 0xffff\n\n// fec_code_id_for_repair_flow code points (ISO/IEC 23008-10 Table 1;\n// draft-ramadan-moq-mmt-01 Section 8.3).\nexport const FEC_CODE_REED_SOLOMON = 1\nexport const FEC_CODE_RAPTORQ = 3\n\n/**\n * Parse MMTP header from buffer\n */\nexport function parseMMTPHeader(buffer: Uint8Array): MMTPHeader {\n  if (buffer.length < MMTP_HEADER_SIZE) {\n    throw new Error(`MMTP packet too small: ${buffer.length} bytes`)\n  }\n\n  const view = new DataView(buffer.buffer, buffer.byteOffset, buffer.byteLength)\n\n  const version = (buffer[0]! >> 6) & 0x03\n  if (version !== 0) {\n    throw new Error(`Unsupported MMTP version: ${version}`)\n  }\n\n  // Extract FEC type from byte 0, bits 3-4\n  const fecType = (buffer[0]! >> 3) & 0x03\n  const packetCounterFlag = (buffer[0]! & 0x20) !== 0\n  const extensionFlag = (buffer[0]! & 0x02) !== 0\n\n  // Extract RAP flag from byte 0, bit 0 (R bit - Random Access Point)\n  const rapFlag = (buffer[0]! & 0x01) === 1\n\n  // ISO/IEC 23008-1:2023 Figure 8 (V=0) places reserved(2) before\n  // packet_type(6), so packet_type occupies the low six bits of byte 1.\n  const packetType = buffer[1]! & 0x3F\n\n  let offset = 2\n\n  // Packet ID (2 bytes, big-endian)\n  const packetId = view.getUint16(offset, false)\n  offset += 2\n\n  // Timestamp (4 bytes, big-endian)\n  const timestamp = BigInt(view.getUint32(offset, false))\n  offset += 4\n\n  // Sequence number (4 bytes, big-endian)\n  const sequenceNumber = view.getUint32(offset, false)\n  offset += 4\n\n  let packetCounter: number | undefined\n  if (packetCounterFlag) {\n    if (offset + 4 > buffer.length) throw new Error('MMTP packet truncated in packet_counter')\n    packetCounter = view.getUint32(offset, false)\n    offset += 4\n  }\n\n  let extension: { type: number; data: Uint8Array } | undefined\n  if (extensionFlag) {\n    if (offset + 4 > buffer.length) throw new Error('MMTP packet truncated in header extension')\n    const type = view.getUint16(offset, false)\n    const length = view.getUint16(offset + 2, false)\n    offset += 4\n    if (offset + length > buffer.length) throw new Error('MMTP packet truncated in header extension value')\n    extension = { type, data: buffer.subarray(offset, offset + length) }\n    offset += length\n  }\n\n  return {\n    version,\n    packetType,\n    packetId,\n    timestamp,\n    sequenceNumber,\n    payloadLength: buffer.length - offset,\n    fecType,\n    packetCounterFlag,\n    packetCounter,\n    extensionFlag,\n    extension,\n    headerLength: offset,\n    rapFlag,\n  }\n}\n\n/**\n * The MMTP `packet_id` of `buffer`, or null exactly when parseMMTPHeader would\n * throw for it (short buffer, V != 0, truncated packet_counter or header\n * extension).\n *\n * This is the per-packet filter a receiver runs before any other work, so it\n * builds no header object, DataView or BigInt timestamp (BLO-36599). Use\n * parseMMTPHeader when any other header field is needed.\n */\nexport function readMMTPPacketId(buffer: Uint8Array): number | null {\n  if (buffer.length < MMTP_HEADER_SIZE) return null\n  const flags = buffer[0]!\n  if (((flags >> 6) & 0x03) !== 0) return null\n  let offset = MMTP_HEADER_SIZE\n  if ((flags & 0x20) !== 0) {\n    if (offset + 4 > buffer.length) return null\n    offset += 4\n  }\n  if ((flags & 0x02) !== 0) {\n    if (offset + 4 > buffer.length) return null\n    const length = (buffer[offset + 2]! << 8) | buffer[offset + 3]!\n    if (offset + 4 + length > buffer.length) return null\n  }\n  return (buffer[2]! << 8) | buffer[3]!\n}\n\n/**\n * Unwrap MMTP packet to extract payload\n */\nexport function unwrapMMTP(buffer: Uint8Array): MMTPPacket {\n  const header = parseMMTPHeader(buffer)\n  const payload = buffer.subarray(header.headerLength)\n\n  return { header, payload }\n}\n\n/**\n * Parse MPU header from payload\n * ISO/IEC 23008-1:2023 Section 9.2.3.3\n *\n * MPU Header format (8 bytes) as written by FFmpeg/libmmt:\n * - Bytes 0-1: payload_length (16 bits, big-endian)\n * - Byte 2: FT(4) | T(1) | FI(2) | A(1)\n * - Byte 3: fragment_counter (8 bits)\n * - Bytes 4-7: MPU_sequence_number (32 bits, big-endian)\n */\nexport function parseMPUHeader(payload: Uint8Array): MPUHeader {\n  if (payload.length < MPU_HEADER_SIZE) {\n    throw new Error(`Payload too small for MPU header: ${payload.length} bytes`)\n  }\n\n  const view = new DataView(payload.buffer, payload.byteOffset, payload.byteLength)\n\n  // Bytes 0-1: payload_length (16 bits, big-endian)\n  const payloadLength = view.getUint16(0, false)\n\n  // Byte 2: FT(4) | T(1) | FI(2) | A(1)\n  const flagsByte = payload[2]!\n  const timedFlag = (flagsByte >> 3) & 0x01\n  const fragmentationIndicator = (flagsByte >> 1) & 0x03\n  const aggregationFlag = (flagsByte & 0x01) !== 0\n\n  // Byte 3: fragment_counter (8 bits). The high bit is part of the counter in\n  // the current libmmt/FFmpeg writer ABI.\n  const fragmentCounter = payload[3]!\n\n  // Bytes 4-7: MPU_sequence_number (32 bits, big-endian)\n  const mpuSequenceNumber = view.getUint32(4, false)\n\n  return {\n    mpuSequenceNumber,\n    fragmentationIndicator,\n    fragmentCounter,\n    timedFlag,\n    aggregationFlag,\n    payloadLength,\n  }\n}\n\nexport function parseTimedMfuDuHeader(payload: Uint8Array, offset: number): MFUDuHeader | null {\n  if (offset < 0 || offset + MFU_DU_HEADER_SIZE_TIMED > payload.length) return null\n  const view = new DataView(payload.buffer, payload.byteOffset + offset, MFU_DU_HEADER_SIZE_TIMED)\n  return {\n    movieFragmentSequenceNumber: view.getUint32(0, false),\n    sampleNumber: view.getUint32(4, false),\n    offset: view.getUint32(8, false),\n    priority: payload[offset + 12]!,\n    dependencyCounter: payload[offset + 13]!,\n  }\n}\n\n/**\n * Why `extractMFUPayload` refused a packet.\n *\n * These identifiers are part of the public contract: callers surface them in\n * diagnostics, so renaming one is a breaking change.\n */\nexport type MFURejectionGate =\n  | 'packet-shorter-than-mmtp-plus-mpu-header'\n  | 'mmtp-header-unparseable'\n  | 'not-an-mpu-packet'\n  | 'payload-shorter-than-mpu-header'\n  | 'aggregation-flag-set'\n  | 'mpu-payload-length-below-header-remainder'\n  | 'mpu-declared-end-exceeds-payload'\n  | 'mfu-offset-at-or-past-declared-end'\n  | 'source-fec-payload-id-width-mismatch'\n  | 'declared-trailers-unresolved'\n\nexport interface MFURejection {\n  gate: MFURejectionGate\n  /** Human-readable detail, including the byte arithmetic that decided it. */\n  detail: string\n}\n\ninterface MfuPayloadLayout {\n  hasMfuDuHeader: boolean\n  mfuOffset: number\n  dataEnd: number\n}\n\nfunction resolveMfuPayloadLayout(\n  mpu: MPUHeader,\n  fragmentType: number,\n  payload: Uint8Array,\n): { layout: MfuPayloadLayout } | { rejection: MFURejection } {\n  if (mpu.payloadLength < MPU_HEADER_REMAINDER_SIZE) {\n    return {\n      rejection: {\n        gate: 'mpu-payload-length-below-header-remainder',\n        detail: `payload_length=${mpu.payloadLength} < ${MPU_HEADER_REMAINDER_SIZE}`,\n      },\n    }\n  }\n\n  // ISO/IEC 23008-1 defines payload_length from immediately after its own\n  // two-byte field. It therefore includes the remaining six MPU-header bytes.\n  const declaredEnd = MPU_LENGTH_FIELD_SIZE + mpu.payloadLength\n  if (declaredEnd > payload.length) {\n    return {\n      rejection: {\n        gate: 'mpu-declared-end-exceeds-payload',\n        detail:\n          `payload_length=${mpu.payloadLength} implies end=${declaredEnd}, ` +\n          `payload is ${payload.length} bytes`,\n      },\n    }\n  }\n\n  const hasHeader = fragmentType === 2 && mpu.fragmentationIndicator <= 1\n  const mfuHeaderSize = mpu.timedFlag ? MFU_DU_HEADER_SIZE_TIMED : MFU_DU_HEADER_SIZE_NONTIMED\n  const mfuOffset = MPU_HEADER_SIZE + (hasHeader ? mfuHeaderSize : 0)\n  if (mfuOffset >= declaredEnd) {\n    return {\n      rejection: {\n        gate: 'mfu-offset-at-or-past-declared-end',\n        detail: `mfuOffset=${mfuOffset} >= declaredEnd=${declaredEnd}`,\n      },\n    }\n  }\n\n  return {\n    layout: {\n      hasMfuDuHeader: hasHeader,\n      mfuOffset,\n      dataEnd: declaredEnd,\n    },\n  }\n}\n\n// Legacy detached per-packet authenticator suffix `[0xf0a1][len][auth]`. Its\n// producer was removed (BLO-16483) and nothing verifies it any more; provenance\n// is the signed per-group manifest. Receivers still skip an exact suffix so a\n// stale producer degrades to unauthenticated playback instead of dropped\n// packets. ponytail: hard-cut to reject once no deployed producer can emit it.\nconst LEGACY_TRAILER_EXT_TYPE = 0xf0a1\nconst LEGACY_TRAILER_HEADER_SIZE = 4\n\nfunction isEmptyOrExactLegacyTrailer(payload: Uint8Array, start: number, end: number): boolean {\n  if (start === end) return true\n  if (start < 0 || end > payload.length || start + LEGACY_TRAILER_HEADER_SIZE > end) {\n    return false\n  }\n\n  const view = new DataView(\n    payload.buffer,\n    payload.byteOffset + start,\n    end - start,\n  )\n  if (view.getUint16(0, false) !== LEGACY_TRAILER_EXT_TYPE) return false\n\n  const authLength = view.getUint16(2, false)\n  return start + LEGACY_TRAILER_HEADER_SIZE + authLength === end\n}\n\ninterface DeclaredTrailerLayout {\n  hasFecId: boolean\n}\n\n/** Options for extractMFUPayload and explainMFURejection. */\nexport interface MFUExtractOptions {\n  /**\n   * When true, do NOT subtract the Source FEC Payload ID from the payload\n   * boundary, even if fecType >= 1. For FEC-recovered symbols whose FEC PID\n   * was already stripped before WASM decoding.\n   */\n  skipFecId?: boolean\n}\n\nfunction resolveDeclaredTrailers(\n  payload: Uint8Array,\n  declaredEnd: number,\n  fecType: number,\n  options?: MFUExtractOptions,\n): DeclaredTrailerLayout | null {\n  if (declaredEnd > payload.length) return null\n\n  if (options?.skipFecId) {\n    return isEmptyOrExactLegacyTrailer(payload, declaredEnd, payload.length)\n      ? { hasFecId: false }\n      : null\n  }\n\n  if (fecType === 1) {\n    const fecStart = payload.length - SOURCE_FEC_PAYLOAD_ID_SIZE\n    if (fecStart < declaredEnd || !isEmptyOrExactLegacyTrailer(payload, declaredEnd, fecStart)) {\n      return null\n    }\n    return { hasFecId: true }\n  }\n  if (fecType !== 0) return null\n\n  if (isEmptyOrExactLegacyTrailer(payload, declaredEnd, payload.length)) {\n    return { hasFecId: false }\n  }\n\n  return null\n}\n\n/**\n * Extract NAL unit payload from MMTP packet\n */\nexport function extractNALUnit(mmtpPacket: Uint8Array): Uint8Array {\n  const extraction = extractMFUPayload(mmtpPacket)\n  if (!extraction) throw new Error('Malformed MMTP MPU payload')\n  return extraction.data\n}\n\n/** Result of extracting MFU payload from an MMTP packet */\nexport interface MFUExtraction {\n  /** MMTP header fields */\n  header: MMTPHeader\n  /** MPU header fields */\n  mpu: MPUHeader\n  /** Fragment type (FT field, 4 bits): 0=metadata, 2=MFU data */\n  fragmentType: number\n  /** MFU payload data (video/audio bytes, headers stripped, FEC ID excluded) */\n  data: Uint8Array\n  /** Parsed timed MFU DU header when present, otherwise null */\n  mfuDuHeader: MFUDuHeader | null\n  /** Non-timed MFU Item_ID when the 4-byte DU header is present. */\n  itemId: number | null\n  /** Source FEC Payload ID if present (`FEC_type == 1`), or null */\n  fecPayloadId: { ssId: number } | null\n}\n\n/**\n * Extract MFU payload from a raw MMTP packet.\n *\n * Handles all the byte arithmetic for:\n * - MMTP header (12 bytes)\n * - MPU sub-header (8 bytes, payloadLength field)\n * - MFU DU header (14 bytes timed / 4 bytes non-timed, only for FI \u2264 1)\n * - Source FEC Payload ID (4 bytes at end, only when `FEC_type == 1`)\n *\n * `payloadLength` is the ISO length-after-field value: six remaining MPU-header\n * bytes, then the MFU DU header when present, then media. The legacy\n * authenticator suffix and the Source FEC trailer are outside that declared span and must consume the exact suffix.\n *\n * @param mmtpPacket Raw MMTP packet (from multicast or MoQ)\n * @param options.skipFecId When true, do NOT subtract the 4-byte Source FEC Payload ID\n *   from the payload boundary, even if fecType >= 1 in the MMTP header.  Use this for\n *   FEC-recovered symbols where the FEC PID was already stripped before WASM decoding\n *   but the fecType bits in byte 0 still reflect the original packet (FEC Type=1 per\n *   draft-ramadan-moq-mmt-01 \u00A73.1).\n * @returns Extracted MFU data + metadata, or null if packet is too small\n */\ninterface MfuPlan {\n  header: MMTPHeader\n  payload: Uint8Array\n  mpu: MPUHeader\n  fragmentType: number\n  layout: MfuPayloadLayout\n  trailerLayout: DeclaredTrailerLayout\n}\n\n/**\n * Single source of truth for whether a packet yields an MFU payload.\n *\n * `extractMFUPayload` and `explainMFURejection` both delegate here, so the\n * reason reported to operators can never drift from the decision the parser\n * actually made.\n */\nfunction planMfuExtraction(\n  mmtpPacket: Uint8Array,\n  options?: MFUExtractOptions,\n  parsedHeader?: MMTPHeader,\n): { plan: MfuPlan } | { rejection: MFURejection } {\n  if (mmtpPacket.length < MMTP_HEADER_SIZE + MPU_HEADER_SIZE) {\n    return {\n      rejection: {\n        gate: 'packet-shorter-than-mmtp-plus-mpu-header',\n        detail: `${mmtpPacket.length} bytes < ${MMTP_HEADER_SIZE + MPU_HEADER_SIZE}`,\n      },\n    }\n  }\n\n  let header: MMTPHeader\n  if (parsedHeader) {\n    header = parsedHeader\n  } else {\n    try {\n      header = parseMMTPHeader(mmtpPacket)\n    } catch (error) {\n      return {\n        rejection: {\n          gate: 'mmtp-header-unparseable',\n          detail: error instanceof Error ? error.message : String(error),\n        },\n      }\n    }\n  }\n  if (header.packetType !== PACKET_TYPE_MPU) {\n    return {\n      rejection: {\n        gate: 'not-an-mpu-packet',\n        detail: `packetType=0x${header.packetType.toString(16).padStart(2, '0')}`,\n      },\n    }\n  }\n\n  const payload = mmtpPacket.subarray(header.headerLength)\n  if (payload.length < MPU_HEADER_SIZE) {\n    return {\n      rejection: {\n        gate: 'payload-shorter-than-mpu-header',\n        detail: `${payload.length} bytes < ${MPU_HEADER_SIZE}`,\n      },\n    }\n  }\n\n  const mpu = parseMPUHeader(payload)\n  if (mpu.aggregationFlag) {\n    return {\n      rejection: { gate: 'aggregation-flag-set', detail: 'strict profile requires A=0' },\n    }\n  }\n\n  // Fragment type from byte 2 upper nibble (not returned by parseMPUHeader)\n  const fragmentType = (payload[2]! >> 4) & 0x0f\n\n  const layoutResult = resolveMfuPayloadLayout(mpu, fragmentType, payload)\n  if ('rejection' in layoutResult) return layoutResult\n  const { layout } = layoutResult\n\n  const trailerLayout = resolveDeclaredTrailers(\n    payload,\n    layout.dataEnd,\n    header.fecType,\n    options,\n  )\n  if (!trailerLayout) {\n    // The most common cause is a producer whose Source FEC Payload ID width\n    // disagrees with ISO/IEC 23008-1 \u00A7C.5.2. Name that explicitly rather than\n    // leaving operators to infer it from a generic trailer error.\n    if (!options?.skipFecId && header.fecType === 1) {\n      const observed = payload.length - layout.dataEnd\n      const expected = SOURCE_FEC_PAYLOAD_ID_SIZE\n      if (observed !== expected) {\n        return {\n          rejection: {\n            gate: 'source-fec-payload-id-width-mismatch',\n            detail:\n              `producer wrote a ${observed}-byte Source FEC Payload ID, ` +\n              `ISO/IEC 23008-1 \u00A7C.5.2 requires ${expected} ` +\n              `(payload=${payload.length}, declaredEnd=${layout.dataEnd})`,\n          },\n        }\n      }\n    }\n    return {\n      rejection: {\n        gate: 'declared-trailers-unresolved',\n        detail:\n          `trailer bytes [${layout.dataEnd}, ${payload.length}) are neither empty ` +\n          `nor an exact legacy authenticator trailer (fecType=${header.fecType})`,\n      },\n    }\n  }\n\n  return { plan: { header, payload, mpu, fragmentType, layout, trailerLayout } }\n}\n\n/**\n * Report why `extractMFUPayload` would refuse this packet, or null if it would\n * accept it.\n *\n * `extractMFUPayload` returns bare `null` on ten distinct conditions, which\n * makes a producer/consumer framing disagreement indistinguishable from a\n * publisher that never started \u2014 both render as silence. Use this wherever\n * that distinction matters: diagnostics, contract tests, and operator-facing\n * logs.\n */\nexport function explainMFURejection(\n  mmtpPacket: Uint8Array,\n  options?: MFUExtractOptions,\n): MFURejection | null {\n  const result = planMfuExtraction(mmtpPacket, options)\n  return 'rejection' in result ? result.rejection : null\n}\n\nexport function extractMFUPayload(\n  mmtpPacket: Uint8Array,\n  options?: MFUExtractOptions,\n): MFUExtraction | null {\n  return extractPlannedMfu(mmtpPacket, planMfuExtraction(mmtpPacket, options))\n}\n\n/**\n * extractMFUPayload for a caller that already holds this packet's parsed MMTP\n * header, so the header is not parsed a second time (BLO-36599).\n *\n * `header` must be `parseMMTPHeader(mmtpPacket)` of this same packet; the\n * result is then identical to `extractMFUPayload(mmtpPacket, options)`.\n */\nexport function extractMFUPayloadWithHeader(\n  mmtpPacket: Uint8Array,\n  header: MMTPHeader,\n  options?: MFUExtractOptions,\n): MFUExtraction | null {\n  return extractPlannedMfu(mmtpPacket, planMfuExtraction(mmtpPacket, options, header))\n}\n\nfunction extractPlannedMfu(\n  mmtpPacket: Uint8Array,\n  result: { plan: MfuPlan } | { rejection: MFURejection },\n): MFUExtraction | null {\n  if ('rejection' in result) return null\n  const { header, payload, mpu, fragmentType, layout, trailerLayout } = result.plan\n\n  const mfuDuHeaderPresent = layout.hasMfuDuHeader\n  const mfuOffset = layout.mfuOffset\n  const dataEnd = layout.dataEnd\n\n  const mfuDuHeader =\n    mfuDuHeaderPresent && mpu.timedFlag === 1\n      ? parseTimedMfuDuHeader(payload, MPU_HEADER_SIZE)\n      : null\n  const itemId =\n    mfuDuHeaderPresent && mpu.timedFlag === 0\n      ? new DataView(payload.buffer, payload.byteOffset + MPU_HEADER_SIZE, 4).getUint32(0, false)\n      : null\n\n  const data = payload.subarray(mfuOffset, dataEnd)\n\n  const fecPayloadId = trailerLayout.hasFecId\n    ? {\n        ssId: new DataView(\n          mmtpPacket.buffer,\n          mmtpPacket.byteOffset + mmtpPacket.length - SOURCE_FEC_PAYLOAD_ID_SIZE,\n          4,\n        ).getUint32(0, false),\n      }\n    : null\n\n  return { header, mpu, fragmentType, data, mfuDuHeader, itemId, fecPayloadId }\n}\n\n/**\n * Extract timestamp from MMTP packet\n */\nexport function extractTimestamp(mmtpPacket: Uint8Array): bigint {\n  const { header } = unwrapMMTP(mmtpPacket)\n  return header.timestamp\n}\n\n/**\n * Check if MMTP packet is an FEC repair packet\n * FEC_type 2 and 3 are repair packets\n */\nexport function isFecRepairPacket(mmtpPacket: Uint8Array): boolean {\n  if (mmtpPacket.length < 1) return false\n  const fecType = (mmtpPacket[0]! >> 3) & 0x03\n  return fecType >= 2\n}\n\n/**\n * Extract Source FEC Payload ID (SS_ID) from the last 4 bytes of an MMTP\n * source packet per ISO/IEC 23008-1:2023 Section C.5.2 Figure C.10.\n *\n * SS_ID is a flat 32-bit monotonic counter (incremented by 1 per packet\n * for ssbg_mode0 and ssbg_mode1). Block membership and ESI use the\n * configured K; repair SS_Start identifies the first SS_ID of the block and\n * SSB_length records the authored source-symbol count:\n *   SBN = floor(SS_ID / K), ESI = SS_ID % K\n *   SS_Start = SBN * K  (first SS_ID of the block)\n *\n * This matches FFmpeg moqenc_mmt.c, the drafts (draft-ramadan-moq-fec \u00A76.2),\n * and ATSC A/331 \u00A78.1.2.5 which defers to ISO 23008-1 Annex C.\n */\nexport function extractFecPayloadId(mmtpPacket: Uint8Array): { ssId: number } | null {\n  const header = parseHeaderForSourceFecId(mmtpPacket)\n  return header ? sourceFecPayloadIdOf(mmtpPacket, header) : null\n}\n\n/**\n * Return true when FEC_type=1 and the exact suffix after the ISO-declared MPU\n * payload contains a four-byte Source FEC Payload ID.\n */\nexport function hasSourceFecPayloadId(mmtpPacket: Uint8Array): boolean {\n  const header = parseHeaderForSourceFecId(mmtpPacket)\n  return header !== null && sourceFecPayloadIdOf(mmtpPacket, header) !== null\n}\n\nfunction parseHeaderForSourceFecId(mmtpPacket: Uint8Array): MMTPHeader | null {\n  if (mmtpPacket.length < MMTP_HEADER_SIZE + MPU_HEADER_SIZE) return null\n  try {\n    return parseMMTPHeader(mmtpPacket)\n  } catch {\n    return null\n  }\n}\n\n/**\n * The Source FEC Payload ID of a packet whose MMTP header the caller already\n * parsed, or null when the packet carries none: present only when FEC_type=1\n * and the exact suffix after the ISO-declared MPU payload holds the four-byte\n * ID (ISO/IEC 23008-1 \u00A7C.5.2). Same answer as extractFecPayloadId, without a\n * second header parse (BLO-36599).\n *\n * `header` must be `parseMMTPHeader(mmtpPacket)` of this same packet.\n */\nexport function sourceFecPayloadIdOf(\n  mmtpPacket: Uint8Array,\n  header: MMTPHeader,\n): { ssId: number } | null {\n  if (mmtpPacket.length < MMTP_HEADER_SIZE + MPU_HEADER_SIZE) return null\n  if (header.packetType !== PACKET_TYPE_MPU) return null\n\n  const payload = mmtpPacket.subarray(header.headerLength)\n  if (payload.length < MPU_HEADER_SIZE) return null\n  const payloadLength = (payload[0]! << 8) | payload[1]!\n  if (payloadLength < MPU_HEADER_REMAINDER_SIZE) return null\n  const declaredEnd = MPU_LENGTH_FIELD_SIZE + payloadLength\n  if (!resolveDeclaredTrailers(payload, declaredEnd, header.fecType)?.hasFecId) return null\n\n  // Flat 4-byte SS_ID: encoder writes block_id * K + symbol_id\n  const off = mmtpPacket.length - SOURCE_FEC_PAYLOAD_ID_SIZE\n  return {\n    ssId:\n      ((mmtpPacket[off]! << 24) |\n        (mmtpPacket[off + 1]! << 16) |\n        (mmtpPacket[off + 2]! << 8) |\n        mmtpPacket[off + 3]!) >>>\n      0,\n  }\n}\n\n/** Size of Repair FEC Payload ID per ISO/IEC 23008-1 Section C.5.3 */\nexport const REPAIR_FEC_PID_SIZE = 13\n\n/**\n * Parse the 13-byte Repair FEC Payload ID after the complete dynamic MMTP header.\n * `parsedHeader`, when given, must be `parseMMTPHeader(mmtpPacket)` of this\n * same packet; it spares the second header parse (BLO-36599).\n */\nfunction readRepairFecPayloadIdFields(mmtpPacket: Uint8Array, parsedHeader?: MMTPHeader): {\n  packetId: number; ssStart: number; rsbLength: number; rsId: number; ssbLength: number; dataOffset: number\n} | null {\n  let header: MMTPHeader\n  if (parsedHeader) {\n    header = parsedHeader\n  } else {\n    try {\n      header = parseMMTPHeader(mmtpPacket)\n    } catch {\n      return null\n    }\n  }\n  if (header.packetType !== PACKET_TYPE_REPAIR || header.fecType !== 2) return null\n\n  const off = header.headerLength\n  if (mmtpPacket.length < off + REPAIR_FEC_PID_SIZE) return null\n  const ssStart =\n    ((mmtpPacket[off]! << 24) |\n      (mmtpPacket[off + 1]! << 16) |\n      (mmtpPacket[off + 2]! << 8) |\n      mmtpPacket[off + 3]!) >>>\n    0  // 32 bits\n  const rsbLength = (mmtpPacket[off + 4]! << 16) | (mmtpPacket[off + 5]! << 8) | mmtpPacket[off + 6]!  // 24 bits\n  const rsId = (mmtpPacket[off + 7]! << 16) | (mmtpPacket[off + 8]! << 8) | mmtpPacket[off + 9]!  // 24 bits\n  const ssbLength = (mmtpPacket[off + 10]! << 16) | (mmtpPacket[off + 11]! << 8) | mmtpPacket[off + 12]!  // 24 bits\n  return {\n    packetId: header.packetId,\n    ssStart,\n    rsbLength,\n    rsId,\n    ssbLength,\n    dataOffset: off + REPAIR_FEC_PID_SIZE,\n  }\n}\n\n/**\n * Extract Repair FEC Payload ID from a raw-multicast MMTP repair packet.\n * Per ISO/IEC 23008-1:2023 Section C.5.3 (ssbg_mode0, one-stage, no FFSRP_TS):\n *   [MMTP header][SS_Start:4][RSB_length:3][RS_ID:3][SSB_length:3][repair data]\n * OTI is delivered via AL-FEC signaling message (Table C.3), not per-packet.\n *\n * Byte 1 is reserved(2)|packet_type(6) for V=0, so repair type 0x03 is 0x03.\n * Pre-migration high-bits bytes (0x0c) are rejected \u2014 no compatibility decode.\n */\nexport function extractRepairFecPayloadId(mmtpPacket: Uint8Array): {\n  ssStart: number; rsbLength: number; rsId: number; ssbLength: number\n} | null {\n  const fields = readRepairFecPayloadIdFields(mmtpPacket)\n  if (!fields) return null\n  return {\n    ssStart: fields.ssStart,\n    rsbLength: fields.rsbLength,\n    rsId: fields.rsId,\n    ssbLength: fields.ssbLength,\n  }\n}\n\n/** Parsed MoQ repair frame per ISO/IEC 23008-1 Section C.4.3 + C.5.3 */\nexport interface MoqRepairFrame {\n  /** MMTP packetId (1=video, 2=audio) \u2014 for routing to correct FEC decoder */\n  packetId: number\n  /** SS_Start (32 bits): SS_ID of first source symbol in block */\n  ssStart: number\n  /** RSB_length (24 bits): number of repair symbols (P) */\n  rsbLength: number\n  /** RS_ID (24 bits): repair symbol index (0-based) */\n  rsId: number\n  /** SSB_length (24 bits): authored source-symbol count (1..=configured K) */\n  ssbLength: number\n  /** Repair symbol data after the dynamic MMTP header and 13-byte FEC payload ID. */\n  symbolData: Uint8Array\n}\n\n/**\n * Parse a MoQ repair frame (ISO/IEC 23008-1 Annex C format).\n *\n * Wire format per ISO 23008-1 \u00A7C.4.3 + \u00A7C.5.3:\n *   MMTP Header: fixed 12 bytes plus C/X optional fields\n *   then SS_Start (4 bytes) \u2192 block identifier\n *   then RSB_length (3 bytes) \u2192 P\n *   then RS_ID (3 bytes) \u2192 ESI = K + RS_ID\n *   then SSB_length (3 bytes) \u2192 authored source-symbol count (1..=K)\n *   then Repair Symbol Data (T bytes)\n *\n * @param frame - Raw MoQ repair frame bytes\n * @returns Parsed frame or null if invalid\n */\nexport function parseMoqRepairFrame(frame: Uint8Array): MoqRepairFrame | null {\n  return moqRepairFrameFrom(frame, readRepairFecPayloadIdFields(frame))\n}\n\n/**\n * parseMoqRepairFrame for a caller that already holds this frame's parsed MMTP\n * header, so the header is not parsed a second time (BLO-36599). The router's\n * multicast repair branch uses it: one repair packet in every K + P otherwise\n * paid two header parses.\n *\n * `header` must be `parseMMTPHeader(frame)` of this same frame; the result is\n * then identical to `parseMoqRepairFrame(frame)`.\n */\nexport function parseMoqRepairFrameWithHeader(\n  frame: Uint8Array,\n  header: MMTPHeader,\n): MoqRepairFrame | null {\n  return moqRepairFrameFrom(frame, readRepairFecPayloadIdFields(frame, header))\n}\n\nfunction moqRepairFrameFrom(\n  frame: Uint8Array,\n  repairId: ReturnType<typeof readRepairFecPayloadIdFields>,\n  checkRsId = true,\n): MoqRepairFrame | null {\n  if (!repairId) return null\n\n  const symbolData = frame.subarray(repairId.dataOffset)\n  if (\n    repairId.ssbLength === 0 ||\n    (checkRsId && repairId.rsId >= repairId.rsbLength) ||\n    symbolData.length === 0\n  ) return null\n\n  return {\n    packetId: repairId.packetId,\n    ssStart: repairId.ssStart,\n    rsbLength: repairId.rsbLength,\n    rsId: repairId.rsId,\n    ssbLength: repairId.ssbLength,\n    symbolData,\n  }\n}\n\n/**\n * Why a repair object of an mmtp track is discarded on admission:\n * `repairLength` -- the object is not exactly 12 + 13 + T bytes with a\n * 12-byte MMTP header (C = 0, X = 0; draft-ramadan-moq-mmt-02 7.3, judged\n * before any Repair FEC Payload ID field is read); `repairRsId` -- RS_ID is not\n * below RSB_length, under every scheme; `repairSchemeBound` -- the object\n * breaks its scheme's bound: reed-solomon SSB_length + RSB_length > 255, which\n * also caps RS_ID at 253, or raptorq SSB_length + RSB_length - 1 > 2^24 - 1\n * (draft-ramadan-moq-fec-core-00 7.5 and 10.3, -block-codes-00 7).\n */\nexport type RepairObjectReject = 'repairLength' | 'repairRsId' | 'repairSchemeBound'\n\n/**\n * Admission of one mmtp repair object under its instance's T and scheme. The\n * caller names the instance (by the repair track it subscribed); nothing here\n * infers it from the fields. `repairRsId` and `repairSchemeBound` carry the\n * frame so the caller can first route an RSB_length below a held layer's\n * O_i + P_i to the 7.3.2 stop, which takes precedence over the discard.\n * `null`: not an iso repair packet, or SSB_length 0.\n */\nexport function admitMmtpRepairObject(\n  packet: Uint8Array,\n  header: MMTPHeader,\n  symbolSize: number,\n  algorithm: string | undefined,\n): { frame: MoqRepairFrame; reject?: Exclude<RepairObjectReject, 'repairLength'> } | { reject: 'repairLength' } | null {\n  if (header.packetType !== PACKET_TYPE_REPAIR || header.fecType !== 2) return null\n  if (header.headerLength !== MMTP_HEADER_SIZE || packet.length !== MMTP_HEADER_SIZE + REPAIR_FEC_PID_SIZE + symbolSize) {\n    return { reject: 'repairLength' }\n  }\n  const frame = moqRepairFrameFrom(packet, readRepairFecPayloadIdFields(packet, header), false)\n  if (!frame) return null\n  if (frame.rsId >= frame.rsbLength) return { frame, reject: 'repairRsId' }\n  const blockSymbols = frame.ssbLength + frame.rsbLength\n  if (algorithm === 'reed-solomon' ? blockSymbols > 255 : algorithm === 'raptorq' && blockSymbols - 1 > 0xffffff) {\n    return { frame, reject: 'repairSchemeBound' }\n  }\n  return { frame }\n}\n\n// The signalling-message parsers (9.3.4.2 payload header, AL-FEC message,\n// PA/MPT) live in ./signalling.ts.\n", "/**\n * NTP short format (RFC 5905 \u00A76): an unsigned 32-bit, 16.16 fixed-point count\n * of seconds. The MMTP header `timestamp` field (ISO/IEC 23008-1 \u00A79.2.2)\n * carries each packet's UTC sending instant in this format, so the value wraps\n * to 0 every 2^16 s (~18.2 h).\n *\n * Plain numeric order on these values breaks at every wrap: a retained\n * `Math.max` stays at the pre-wrap value and every later instant compares as\n * older. Order send times only with {@link compareNtpShort}, which applies\n * RFC 1982 serial-number arithmetic over the field's width.\n */\n\n/** Width in bits of the MMTP `timestamp` field (NTP short). */\nexport const NTP_SHORT_BITS = 32\n\n/** Number of distinct NTP-short values; the field wraps to 0 here. */\nexport const NTP_SHORT_MODULUS = 2 ** NTP_SHORT_BITS\n\n/**\n * RFC 1982 \u00A73.2's `2^(SERIAL_BITS - 1)`. Two values whose forward distance is\n * below this are ordered; exactly this far apart they are not ordered at all.\n * Two instants must be less than this far apart (2^15 s, ~9.1 h of send time)\n * for the comparison to give their true order.\n */\nexport const NTP_SHORT_HALF_RANGE = 2 ** (NTP_SHORT_BITS - 1)\n\n/**\n * Serial order of one NTP-short value relative to another.\n *\n * `'unordered'` is RFC 1982's undefined case: the values are exactly\n * {@link NTP_SHORT_HALF_RANGE} apart, so neither precedes the other. It is\n * never folded into `'before'` or `'after'`; each caller decides what an\n * unorderable pair means for it.\n */\nexport type NtpShortOrder = 'before' | 'equal' | 'after' | 'unordered'\n\n/** True when `value` is an NTP-short value: an integer in [0, NTP_SHORT_MODULUS). */\nexport function isNtpShort(value: number): boolean {\n  return Number.isInteger(value) && value >= 0 && value < NTP_SHORT_MODULUS\n}\n\n/**\n * RFC 1982 serial comparison of NTP-short `a` against `b`: `'after'` when `a`\n * is the later instant, `'before'` when it is the earlier one.\n *\n * The answer is the true order only while the two instants are less than\n * {@link NTP_SHORT_HALF_RANGE} apart. Past that a 32-bit field cannot tell\n * later from earlier, and the result names whichever direction is nearer.\n * This is not a total order (it is not transitive across the whole space), so\n * it must never be used to sort.\n *\n * @throws {RangeError} if either operand is not an NTP-short value\n */\nexport function compareNtpShort(a: number, b: number): NtpShortOrder {\n  if (!isNtpShort(a) || !isNtpShort(b)) {\n    throw new RangeError(\n      `NTP-short values must be integers in [0, 2^${NTP_SHORT_BITS}), got ${String(a)} and ${String(b)}`,\n    )\n  }\n  if (a === b) return 'equal'\n  // Forward distance from b to a, reduced into [1, NTP_SHORT_MODULUS). Both\n  // operands are below 2^32, so every step is exact in a double.\n  const forward = (a - b + NTP_SHORT_MODULUS) % NTP_SHORT_MODULUS\n  if (forward < NTP_SHORT_HALF_RANGE) return 'after'\n  if (forward > NTP_SHORT_HALF_RANGE) return 'before'\n  return 'unordered'\n}\n", "/**\n * RFC 1982 serial-number arithmetic for the 32-bit MMTP AL-FEC symbol\n * counters (ISO/IEC 23008-1:2023 C.5.2 SS_ID, C.5.3 SS_Start).\n *\n * SS_ID is a 32-bit field, so a stream that runs long enough wraps it to 0.\n * Ordering two SS_IDs (or two blocks by their first SS_ID) with `<` reads\n * every post-wrap value as older than every pre-wrap one. Serial order\n * agrees with `<` whenever the two values are less than 2^31 apart, so for\n * every stream that has not reached the wrap the result is unchanged; only\n * the order across the wrap point differs (BLO-35597 iso:5).\n */\n\n/** 2^SERIAL_BITS for SERIAL_BITS = 32. */\nexport const SERIAL32_SPAN = 0x1_0000_0000\n\n/** RFC 1982 \u00A73.2's 2^(SERIAL_BITS - 1). */\nexport const SERIAL32_HALF = 0x8000_0000\n\nfunction assertUint32(value: number, name: string): void {\n  if (!Number.isInteger(value) || value < 0 || value >= SERIAL32_SPAN) {\n    throw new RangeError(`${name} must be a uint32 (got ${value})`)\n  }\n}\n\n/**\n * RFC 1982 \u00A73.1 addition, extended to negative `n` for the matching\n * subtraction: `(s + n) mod 2^32`. `n` must lie in (-2^31, 2^31).\n */\nexport function serial32Add(s: number, n: number): number {\n  assertUint32(s, 's')\n  if (!Number.isInteger(n) || n <= -SERIAL32_HALF || n >= SERIAL32_HALF) {\n    throw new RangeError(`serial addend must lie in (-2^31, 2^31) (got ${n})`)\n  }\n  return (s + n + SERIAL32_SPAN) % SERIAL32_SPAN\n}\n\n/** Forward distance from `from` to `to`: `(to - from) mod 2^32`. */\nexport function serial32Distance(from: number, to: number): number {\n  return (to - from) >>> 0\n}\n\n/**\n * RFC 1982 \u00A73.2: `a` precedes `b`. Values exactly 2^31 apart are unordered\n * (neither precedes the other).\n */\nexport function serial32Precedes(a: number, b: number): boolean {\n  const distance = serial32Distance(a, b)\n  return distance !== 0 && distance < SERIAL32_HALF\n}\n", "/**\n * FEC block profile (BLO-35597, ISO/IEC 23008-1 Annex C).\n *\n * Every catalog `fec` object that declares an FEC instance names its block\n * profile in `fec.blockProfile`. A receiver applies all of a profile's rules\n * or none of them, so the token is the one explicit per-stream discriminator:\n * it is never defaulted and never inferred from the wire.\n *\n * draft-ramadan-moq-fec \u00A75.1 defines exactly one value, and it is the only\n * profile this library implements:\n *\n * - `iso-ssbg1-v1`: ssbg_mode1 (C.3.3): a source symbol is\n *   `u16 length || protected packet || zero padding` to T; a block is a\n *   K' = SSB_length RaptorQ block (C.5.3) and repair ESI = SSB_length + RS_ID;\n *   SS_ID increments by one per FEC source packet and wraps at 2^32 (C.5.2),\n *   so a block is located by membership in `[SS_Start, SS_Start + SSB_length)`\n *   under RFC 1982 serial arithmetic; the MoQ repair group id is the 62-bit\n *   wrap-epoch-extended SS_Start. The AL-FEC coding byte for this profile is\n *   0x14 (one-stage, ssbg_mode1, fec_payload_id_mode 0, Amd 1:2025 Table C.3).\n *\n * A track whose `blockProfile` is absent or names any other token (the\n * retired Blockcast-private `k-padded-v1` included) has no FEC: a receiver\n * consumes its source without FEC and joins none of its repair tracks\n * (draft-ramadan-moq-fec \u00A75.1). `parseFecBlockProfile` throws for such a\n * token; the per-track catalog resolver turns the same rule into a typed\n * per-track \"FEC unavailable\" outcome instead of failing the session.\n */\nimport { serial32Add, serial32Distance, serial32Precedes } from './serial-number.js'\n\n/** The block profile a catalog `fec.blockProfile` may name: the one this library implements. */\nexport type FecBlockProfile = 'iso-ssbg1-v1'\n\n/** Every accepted `fec.blockProfile` token. */\nexport const FEC_BLOCK_PROFILES: readonly FecBlockProfile[] = Object.freeze([\n  'iso-ssbg1-v1',\n])\n\n/** True for a block-profile token this library implements. */\nexport function isFecBlockProfile(value: unknown): value is FecBlockProfile {\n  return value === 'iso-ssbg1-v1'\n}\n\n/**\n * Read a required `fec.blockProfile`. Throws on an absent token and on any\n * token other than `iso-ssbg1-v1`: there is no default and nothing is\n * inferred from the wire (draft-ramadan-moq-fec \u00A75.1).\n *\n * @param where the catalog path of the field, for the error message.\n */\nexport function parseFecBlockProfile(value: unknown, where: string): FecBlockProfile {\n  if (isFecBlockProfile(value)) return value\n  if (value === undefined) {\n    throw new Error(`${where} is required: name the FEC block profile (\"iso-ssbg1-v1\")`)\n  }\n  throw new Error(`${where} must be \"iso-ssbg1-v1\" (got ${JSON.stringify(value)})`)\n}\n\n/** ISO/IEC 23008-1 C.3.3 ssbg_mode1: the two-octet packet length field. */\nexport const SSBG1_LENGTH_FIELD_BYTES = 2\n\n/** The largest protected packet an ssbg_mode1 symbol of size T can carry. */\nexport function ssbg1MaxPacketLength(symbolSize: number): number {\n  return symbolSize - SSBG1_LENGTH_FIELD_BYTES\n}\n\n/** Whether a protected packet of `packetLength` bytes fits one T-byte ssbg_mode1 symbol. */\nexport function ssbg1FitsSymbol(packetLength: number, symbolSize: number): boolean {\n  return (\n    Number.isSafeInteger(packetLength) &&\n    packetLength >= 0 &&\n    packetLength <= ssbg1MaxPacketLength(symbolSize) &&\n    packetLength <= 0xffff\n  )\n}\n\n/**\n * Build one ssbg_mode1 source symbol (C.3.3): the protected packet's length\n * in two octets, network byte order, then the packet, then zero octets up to\n * T. The protected packet is the MMTP packet before its Source FEC Payload ID\n * is appended (C.4.2).\n *\n * @throws when `length + 2 > T`: the packet cannot be protected under this\n * profile, and silently truncating it would corrupt every repair symbol.\n */\nexport function buildSsbg1SourceSymbol(packet: Uint8Array, symbolSize: number): Uint8Array {\n  if (!Number.isSafeInteger(symbolSize) || symbolSize <= SSBG1_LENGTH_FIELD_BYTES) {\n    throw new Error(`ssbg_mode1 symbol size must exceed ${SSBG1_LENGTH_FIELD_BYTES} (got ${symbolSize})`)\n  }\n  if (!ssbg1FitsSymbol(packet.byteLength, symbolSize)) {\n    throw new Error(\n      `ssbg_mode1 source symbol needs ${packet.byteLength} + ${SSBG1_LENGTH_FIELD_BYTES} bytes but T is ${symbolSize}`,\n    )\n  }\n  const symbol = new Uint8Array(symbolSize)\n  symbol[0] = (packet.byteLength >>> 8) & 0xff\n  symbol[1] = packet.byteLength & 0xff\n  symbol.set(packet, SSBG1_LENGTH_FIELD_BYTES)\n  return symbol\n}\n\n/**\n * Recover the protected packet from one ssbg_mode1 source symbol: the bytes\n * the length field names. Returns null, never a guess, when the length field\n * points past the symbol or any padding octet is non-zero (C.3.3 padding is\n * all 00h), since either means the recovered symbol is not what was sent.\n */\nexport function trimSsbg1SourceSymbol(symbol: Uint8Array): Uint8Array | null {\n  if (symbol.byteLength < SSBG1_LENGTH_FIELD_BYTES) return null\n  const length = (symbol[0]! << 8) | symbol[1]!\n  const end = SSBG1_LENGTH_FIELD_BYTES + length\n  if (end > symbol.byteLength) return null\n  for (let i = end; i < symbol.byteLength; i++) {\n    if (symbol[i] !== 0) return null\n  }\n  return symbol.subarray(SSBG1_LENGTH_FIELD_BYTES, end)\n}\n\n/** The SS_ID after the last source symbol of `[ssStart, ssStart + ssbLength)`. */\nexport function isoBlockEnd(ssStart: number, ssbLength: number): number {\n  return serial32Add(ssStart, ssbLength)\n}\n\n/**\n * Range membership (C.5.2, C.5.3): whether `ssId` is one of the\n * `ssbLength` consecutive SS_IDs starting at `ssStart`, modulo 2^32.\n */\nexport function isoBlockContains(ssStart: number, ssbLength: number, ssId: number): boolean {\n  return serial32Distance(ssStart, ssId) < ssbLength\n}\n\n/**\n * A lower bound on how many blocks the block starting at `a` lies behind the\n * one starting at `b` (0 when `a` does not precede `b`). An iso-ssbg1-v1\n * block holds at most `kMax` source symbols (the catalog `sourceSymbols`, the\n * AL-FEC maximum_k_for_repair_flow), so `n * kMax` SS_IDs always span at least\n * `n` blocks. Every interleave horizon in the receiver (decoder retention,\n * worker retirement, ordered-relay settlement) uses this one bound, so the\n * manager's horizon can never fall inside the decoder's.\n */\nexport function isoBlocksBehindLowerBound(a: number, b: number, kMax: number): number {\n  if (!Number.isSafeInteger(kMax) || kMax <= 0) {\n    throw new Error(`iso-ssbg1-v1 block horizon needs a positive maximum K (got ${kMax})`)\n  }\n  return serial32Precedes(a, b) ? Math.floor(serial32Distance(a, b) / kMax) : 0\n}\n", "/**\n * Runtime FEC bindings (BLO-50171): what each source track's FEC resolves to\n * for this library's receiver, read from `validateFecCatalog`'s per-instance\n * result and never re-derived.\n *\n * Every runtime reader (the container's `resolveCatalogTrackFec`,\n * `resolveRepairLayers`, `MulticastManager.configureMultiTrack`, transport's\n * `catalogRepairTracks`) goes through `resolveFecBindings`, so they cannot\n * disagree with the validator or with each other about which tracks have FEC\n * and which repair tracks belong to them.\n *\n * The draft-ramadan-moq-fec-catalog-00 array is the only shape. Both catalog\n * dialects bind through it: an MSF `tracks[]` entry directly, and a hang\n * `video`/`audio` rendition (`fec` the same array) with its `repair.renditions`\n * entries (`source` + `instanceId`), mapped onto a `tracks[]` view so the same\n * validator runs. A hang rendition is authoritative over a `tracks[]` entry of\n * the same name.\n *\n * Fail closed per instance: a source whose base instance is not `ok` resolves\n * to `unavailable` with the validator's code and path, and costs no other\n * track anything. A draft-01 object `fec` is `fec_member` at that track's\n * `fec`: the track plays without FEC.\n */\nimport { validateFecCatalog, type FecCatalogCode, type FecCatalogReceiver } from './fec-catalog.js'\n\n/** The receiver this runtime is: it decodes `iso-ssbg1-v1` only. */\nexport const RUNTIME_FEC_RECEIVER: FecCatalogReceiver = Object.freeze({\n  schemes: Object.freeze(['raptorq', 'reed-solomon']),\n  blockProfiles: Object.freeze(['iso-ssbg1-v1']),\n  overlays: true,\n})\n\n/** Repair track priority when the track states none (MoQT scale, 192..255). */\nexport const DEFAULT_FEC_REPAIR_PRIORITY = 240\n\n/** One `ok` instance's geometry. */\nexport interface FecInstanceGeometry {\n  readonly instanceId: number\n  readonly scheme: 'raptorq' | 'reed-solomon'\n  /** `iso-ssbg1-v1` under `RUNTIME_FEC_RECEIVER`. */\n  readonly blockProfile: string\n  /** K. */\n  readonly sourceSymbols: number\n  /** P_0 for a base instance; the overlay's own P for an overlay. */\n  readonly repairSymbols: number\n  /** T. */\n  readonly symbolSize: number\n  readonly interleaveDepthMs?: number\n  readonly reorderToleranceMs?: number\n  readonly repairTrack: string\n  readonly symbolTrack?: string\n}\n\nexport interface FecLayerBinding {\n  readonly layer: number\n  readonly repairTrackName: string\n  readonly repairSymbols: number\n  /** O_i = sum(P_j, j < i). */\n  readonly rsIdOffset: number\n  readonly priority: number\n}\n\nexport interface FecOverlayBinding {\n  readonly repairTrackName: string\n  readonly scope: 'keyframe'\n  readonly sourceSymbols: number\n  readonly repairSymbols: number\n  readonly priority: number\n  readonly geometry: FecInstanceGeometry\n}\n\nexport interface FecBindingUnavailable {\n  /** The validator's code, or `fec_base_instances` for a track with no base\n   *  instance or more than one `ok` one (the MMTP wire carries one base Source FEC Payload\n   *  ID, mmt-02 7.4.1). */\n  readonly code: FecCatalogCode | 'fec_base_instances'\n  /** JSON Pointer into the catalog (a hang path starts `/video` or `/audio`). */\n  readonly path: string\n  readonly outcome: 'unavailable' | 'violation'\n}\n\nexport type FecSourceBinding =\n  | {\n      readonly status: 'ok'\n      readonly track: string\n      /** JSON Pointer of the source track (`/tracks/<i>`, `/video/renditions/<name>`). */\n      readonly pointer: string\n      readonly base: FecInstanceGeometry\n      /** Base layers in order, layer 0 first. */\n      readonly layers: readonly FecLayerBinding[]\n      /** Sum of P over the base layers: the wire RSB_length. */\n      readonly totalBaseRepairSymbols: number\n      readonly overlay?: FecOverlayBinding\n      /** Why a declared overlay is not used, when one is not. */\n      readonly overlayUnavailable?: FecBindingUnavailable\n    }\n  | {\n      readonly status: 'unavailable'\n      readonly track: string\n      readonly pointer: string\n      readonly reason: FecBindingUnavailable\n    }\n\ntype Obj = Record<string, unknown>\nconst recordOf = (v: unknown): Obj | undefined =>\n  typeof v === 'object' && v !== null && !Array.isArray(v) ? (v as Obj) : undefined\nconst escape = (s: string) => s.replace(/~/g, '~0').replace(/\\//g, '~1')\n\n/**\n * The `tracks[]` view of a catalog in either dialect, with each view track's\n * JSON Pointer in the original catalog.\n */\nexport function fecCatalogTracks(catalog: unknown): { tracks: unknown[]; pointers: string[] } {\n  const root = recordOf(catalog) ?? {}\n  const tracks: unknown[] = []\n  const pointers: string[] = []\n  const hangNames = new Set<string>()\n  for (const role of ['video', 'audio'] as const) {\n    for (const [name, r] of Object.entries(recordOf(recordOf(root[role])?.['renditions']) ?? {})) {\n      const entry = recordOf(r)\n      if (!entry) continue\n      hangNames.add(name)\n      const kind = recordOf(entry['container'])?.['kind']\n      // A hang rendition carries no `packaging`; its container kind is it.\n      // `mmtp-fec` is hang's kind for MMTP that carries FEC (the FFmpeg\n      // publisher's `moq_publish_set_video_packaging`): MMTP packaging.\n      const view: Obj = { name, packaging: kind === undefined || kind === 'mmtp-fec' ? 'mmtp' : kind }\n      if (entry['fec'] !== undefined) view['fec'] = entry['fec']\n      tracks.push(view)\n      pointers.push(`/${role}/renditions/${escape(name)}`)\n    }\n  }\n  const hangRenditions = tracks.length\n  for (const [name, r] of Object.entries(recordOf(recordOf(root['repair'])?.['renditions']) ?? {})) {\n    hangNames.add(name)\n    tracks.push({ packaging: 'fec-repair', ...recordOf(r), name })\n    pointers.push(`/repair/renditions/${escape(name)}`)\n  }\n  const raw = Array.isArray(root['tracks']) ? root['tracks'] : []\n  const named = new Set(hangNames)\n  raw.forEach((t, i) => {\n    const name = recordOf(t)?.['name']\n    if (typeof name === 'string') named.add(name)\n    if (typeof name === 'string' && hangNames.has(name)) return\n    tracks.push(t)\n    pointers.push(`/tracks/${i}`)\n  })\n  // hang layer 0 needs no `repair.renditions` entry: the rendition's instance\n  // names it, and a hang Root (hang's toHang) carries no repair block. Such a\n  // name stands for a repair track of that instance.\n  tracks.slice(0, hangRenditions).forEach((t, ti) => {\n    const view = t as Obj\n    if (!Array.isArray(view['fec'])) return\n    view['fec'].forEach((o, ii) => {\n      const repairTrack = recordOf(o)?.['repairTrack']\n      if (typeof repairTrack !== 'string' || named.has(repairTrack)) return\n      named.add(repairTrack)\n      const instanceId = recordOf(o)?.['instanceId']\n      tracks.push({ name: repairTrack, packaging: 'fec-repair', source: view['name'], ...(instanceId === undefined ? {} : { instanceId }) })\n      pointers.push(`${pointers[ti]}/fec/${ii}/repairTrack`)\n    })\n  })\n  return { tracks, pointers }\n}\n\n/**\n * Every source track's runtime FEC binding, by track name. A track with no\n * `fec`, or an empty `fec` array, declares no FEC and has no entry.\n */\nexport function resolveFecBindings(\n  catalog: unknown,\n  receiver: FecCatalogReceiver = RUNTIME_FEC_RECEIVER,\n): ReadonlyMap<string, FecSourceBinding> {\n  const { tracks, pointers } = fecCatalogTracks(catalog)\n  const report = validateFecCatalog({ tracks }, receiver)\n  const at = (path: string) => {\n    const m = /^\\/tracks\\/(\\d+)(.*)$/.exec(path)\n    return m ? pointers[Number(m[1])] + m[2] : path\n  }\n  const trackAt = (i: number) => recordOf(tracks[i]) ?? {}\n  const nameAt = (i: number | null) => (i === null ? undefined : (trackAt(i)['name'] as string))\n  const why = (i: { outcome: string; issues: readonly { code: FecCatalogCode; path: string }[]; path: string }) =>\n    Object.freeze({\n      code: i.issues[0]?.code ?? 'fec_member',\n      path: at(i.issues[0]?.path ?? i.path),\n      outcome: i.outcome === 'unavailable' ? ('unavailable' as const) : ('violation' as const),\n    })\n\n  const out = new Map<string, FecSourceBinding>()\n  tracks.forEach((t, ti) => {\n    const track = recordOf(t)\n    const name = track?.['name']\n    if (!track || typeof name !== 'string' || out.has(name)) return\n    if (track['packaging'] === 'fec-repair' || track['packaging'] === 'fec-source') return\n    const fec = track['fec']\n    if (fec === undefined) return\n    if (!Array.isArray(fec)) {\n      const reason = { code: 'fec_member' as const, path: at(`/tracks/${ti}/fec`), outcome: 'violation' as const }\n      out.set(name, Object.freeze({ status: 'unavailable', track: name, pointer: pointers[ti]!, reason: Object.freeze(reason) }))\n      return\n    }\n    if (fec.length === 0) return\n    const insts = report.instances.filter((i) => i.trackIndex === ti)\n    const isOverlay = (i: (typeof insts)[number]) => Object.hasOwn(recordOf(fec[Number(i.path.split('/').pop())]) ?? {}, 'scope')\n    const bases = insts.filter((i) => !isOverlay(i))\n    const okBases = bases.filter((i) => i.outcome === 'ok')\n    if (okBases.length !== 1) {\n      const reason =\n        // No base instance at all (overlay-only `fec`) is a count of 0, not\n        // the overlay's own issue.\n        okBases.length > 1 || bases.length === 0\n          ? Object.freeze({ code: 'fec_base_instances' as const, path: at(`/tracks/${ti}/fec`), outcome: 'violation' as const })\n          : why(bases[0] ?? insts[0]!)\n      out.set(name, Object.freeze({ status: 'unavailable', track: name, pointer: pointers[ti]!, reason }))\n      return\n    }\n    const b = okBases[0]!\n    const base = geometry(recordOf(fec[Number(b.path.split('/').pop())])!, b.instanceId!, nameAt(b.symbolTrack))\n    const priorityOf = (i: number | null) => {\n      const p = i === null ? undefined : trackAt(i)['priority']\n      return typeof p === 'number' ? p : DEFAULT_FEC_REPAIR_PRIORITY\n    }\n    const layers: FecLayerBinding[] = [\n      { layer: 0, repairTrackName: base.repairTrack, repairSymbols: base.repairSymbols, rsIdOffset: 0, priority: priorityOf(b.repairTrack) },\n    ]\n    const more = b.boundRepairTracks\n      .map((tj) => ({ tj, layer: trackAt(tj)['repairLayer'] as number }))\n      .sort((x, y) => x.layer - y.layer)\n    let offset = base.repairSymbols\n    for (const { tj, layer } of more) {\n      const repairSymbols = trackAt(tj)['repairSymbols'] as number\n      layers.push({ layer, repairTrackName: nameAt(tj)!, repairSymbols, rsIdOffset: offset, priority: priorityOf(tj) })\n      offset += repairSymbols\n    }\n    let overlay: FecOverlayBinding | undefined\n    let overlayUnavailable: FecBindingUnavailable | undefined\n    const ov = insts.find(isOverlay)\n    if (ov?.outcome === 'ok') {\n      const g = geometry(recordOf(fec[Number(ov.path.split('/').pop())])!, ov.instanceId!, nameAt(ov.symbolTrack))\n      overlay = Object.freeze({\n        repairTrackName: g.repairTrack,\n        scope: 'keyframe' as const,\n        sourceSymbols: g.sourceSymbols,\n        repairSymbols: g.repairSymbols,\n        priority: priorityOf(ov.repairTrack),\n        geometry: g,\n      })\n    } else if (ov) overlayUnavailable = why(ov)\n    out.set(\n      name,\n      Object.freeze({\n        status: 'ok' as const,\n        track: name,\n        pointer: pointers[ti]!,\n        base,\n        layers: Object.freeze(layers.map((l) => Object.freeze(l))),\n        totalBaseRepairSymbols: offset,\n        ...(overlay ? { overlay } : {}),\n        ...(overlayUnavailable ? { overlayUnavailable } : {}),\n      }),\n    )\n  })\n  return out\n}\n\n// The validator passed this instance for this receiver, so every member read\n// here is present and in range.\nfunction geometry(o: Obj, instanceId: number, symbolTrack: string | undefined): FecInstanceGeometry {\n  return Object.freeze({\n    instanceId,\n    scheme: o['scheme'] as 'raptorq' | 'reed-solomon',\n    blockProfile: o['blockProfile'] as string,\n    sourceSymbols: o['sourceSymbols'] as number,\n    repairSymbols: o['repairSymbols'] as number,\n    symbolSize: o['symbolSize'] as number,\n    ...(typeof o['interleaveDepthMs'] === 'number' ? { interleaveDepthMs: o['interleaveDepthMs'] } : {}),\n    ...(typeof o['reorderToleranceMs'] === 'number' ? { reorderToleranceMs: o['reorderToleranceMs'] } : {}),\n    repairTrack: o['repairTrack'] as string,\n    ...(symbolTrack !== undefined ? { symbolTrack } : {}),\n  })\n}\n", "/**\n * iso-ssbg1-v1 block location for one FEC stream (BLO-35597 iso:2/iso:3/iso:5).\n *\n * Under ISO/IEC 23008-1 C.5.2 the SS_ID increments by one per FEC source\n * packet and wraps at 2^32, and a block is the SS_ID range\n * `[SS_Start, SS_Start + SSB_length)` its Repair FEC Payload ID states (C.5.3).\n * Block lengths vary, so `floor(SS_ID / K)` locates nothing: a source symbol\n * belongs to a block only once a repair symbol has stated that block's range.\n * A source that arrives first is held, unplaced, and handed back when a repair\n * places it. Nothing here guesses a boundary.\n *\n * Coverage grows contiguously from the first block a repair states. When a\n * repair states a block that starts after the end of known coverage, the SS_IDs\n * between are one or more blocks whose every repair symbol was lost: they are\n * kept as one repair-less span, which completes clean once all of its SS_IDs\n * arrived (C.5.2 makes a gap in consecutive SS_IDs directly visible) and\n * otherwise resolves through its catalog-derived deadline. That is the only\n * way a block without repair completes: on the next block's SS_Start, never on\n * a count of K source symbols.\n */\nimport {\n  isoBlockContains,\n  isoBlockEnd,\n  isoBlocksBehindLowerBound,\n  serial32Add,\n  serial32Distance,\n  serial32Precedes,\n} from '@blockcast/mmt-base'\n\n/** One block (or repair-less span) the locator knows the exact range of. */\nexport interface IsoBlockRange {\n  readonly start: number\n  readonly length: number\n  /** True for SS_IDs between two stated blocks whose own repair never came. */\n  readonly span: boolean\n}\n\n/** A held source symbol handed back with its block coordinate. */\nexport interface IsoPlacedSource<T> {\n  readonly ssId: number\n  readonly esi: number\n  readonly payload: T\n}\n\n/** What one repair symbol's `(SS_Start, SSB_length)` did to the locator. */\nexport type IsoRepairPlacement<T> =\n  | {\n      readonly status: 'placed'\n      readonly block: IsoBlockRange\n      /** Sources this repair placed into `block`, in SS_ID order. */\n      readonly placed: readonly IsoPlacedSource<T>[]\n      /** The repair-less span this repair closed in front of `block`, if any. */\n      readonly span?: { readonly block: IsoBlockRange; readonly placed: readonly IsoPlacedSource<T>[] }\n      /**\n       * With `deferIncompleteGaps`: the SS_IDs in front of `block` whose every\n       * repair was lost and some source too, kept as a pending hole instead of\n       * a span (see `closeHolesWithin`). `lostSsId` is the highest missing one.\n       */\n      readonly hole?: { readonly block: IsoBlockRange; readonly lostSsId: number }\n    }\n  /** Not a block this stream can use; the repair symbol is dropped. */\n  | { readonly status: 'conflict' | 'overlap' | 'stale' | 'ahead'; readonly reason: string }\n\n/**\n * Retention: the locator is never without one. Every call that can grow it\n * (`hold`, `placeRepair`) retires, behind the position it just saw, every\n * block, span and held source more than `retentionBlocks` blocks back, by the\n * one ISO horizon metric (`isoBlocksBehindLowerBound`). A block is measured\n * from its last SS_ID, so it stays while any SS_ID of it is inside the\n * horizon: a repair-less span has no length bound, and one measured from its\n * start could be retired the moment it is created, before the sources it\n * placed are fed. Held sources are additionally capped at the SS_IDs the\n * horizon spans (`(retentionBlocks + 1) * kMax`): consecutive SS_IDs (C.5.2)\n * cannot hold more inside it, so the cap only ever bites on a stream whose\n * SS_IDs are not consecutive, and then the oldest arrival goes first.\n */\nexport class IsoBlockLocator<T> {\n  /** Known blocks and spans, in serial order of their start. */\n  readonly #blocks: IsoBlockRange[] = []\n  /** Held first-arrival sources whose block no repair has stated yet. */\n  readonly #held = new Map<number, T>()\n  /** End of contiguous coverage: the SS_ID the next unknown block starts at. */\n  #coverageEnd: number | undefined\n  readonly #kMax: number\n  #retentionBlocks: number\n  #heldEvicted = 0\n  #newest: number | undefined\n  /** Pending holes (see `deferIncompleteGaps`): unstated, sources still held. */\n  readonly #holes: IsoBlockRange[] = []\n  /**\n   * Keep a gap that is missing a source as a pending hole rather than a span,\n   * so a repair FETCHed for it (draft-ramadan-moq-fec \u00A77.5) can still state\n   * its blocks. Set only while a range repair scheduler is wired; its owner\n   * must close every hole it is told about (`closeHolesWithin`).\n   */\n  deferIncompleteGaps = false\n\n  /**\n   * @param kMax the catalog maximum K (`sourceSymbols`), the bound on SSB_length.\n   * @param retentionBlocks how many blocks behind the newest position the\n   *   locator keeps, derived by its owner from catalog timing; required, so\n   *   no locator exists without retention.\n   */\n  constructor(kMax: number, retentionBlocks: number) {\n    if (!Number.isSafeInteger(kMax) || kMax <= 0) {\n      throw new Error(`[IsoBlockLocator] maximum K must be a positive integer (got ${kMax})`)\n    }\n    this.#kMax = kMax\n    this.#retentionBlocks = IsoBlockLocator.#checkedRetention(retentionBlocks)\n  }\n\n  static #checkedRetention(retentionBlocks: number): number {\n    if (!Number.isSafeInteger(retentionBlocks) || retentionBlocks <= 0) {\n      throw new Error(\n        `[IsoBlockLocator] retention must be a positive integer number of blocks (got ${retentionBlocks})`,\n      )\n    }\n    return retentionBlocks\n  }\n\n  get kMax(): number {\n    return this.#kMax\n  }\n\n  /** Blocks behind the newest position the locator keeps. */\n  get retentionBlocks(): number {\n    return this.#retentionBlocks\n  }\n\n  /** Update the retention when the catalog timing it derives from changes. */\n  set retentionBlocks(retentionBlocks: number) {\n    this.#retentionBlocks = IsoBlockLocator.#checkedRetention(retentionBlocks)\n  }\n\n  /** The most sources held at once: the SS_IDs the retention horizon spans. */\n  get heldCapacity(): number {\n    return (this.#retentionBlocks + 1) * this.#kMax\n  }\n\n  /**\n   * The newest position the stream has reached (RFC 1982 order): the newest\n   * SS_ID of a source held, or fed once located (`observe`), or SS_Start of a\n   * placed repair, so no source the stream has fed follows it. Undefined\n   * before the first one.\n   */\n  get newest(): number | undefined {\n    return this.#newest\n  }\n\n  /** Advance `newest` to `position` if it is newer; retires nothing. */\n  observe(position: number): void {\n    if (this.#newest === undefined || serial32Precedes(this.#newest, position)) this.#newest = position\n  }\n\n  /** Held sources evicted by `heldCapacity` (never by the horizon itself). */\n  get heldEvicted(): number {\n    return this.#heldEvicted\n  }\n\n  /** Number of known blocks and spans. */\n  get blockCount(): number {\n    return this.#blocks.length\n  }\n\n  /** End of contiguous coverage, or undefined before the first repair. */\n  get coverageEnd(): number | undefined {\n    return this.#coverageEnd\n  }\n\n  /** Number of sources held for a block no repair has stated yet. */\n  get heldCount(): number {\n    return this.#held.size\n  }\n\n  /** The known block or span containing `ssId`, with its ESI. */\n  locate(ssId: number): { block: IsoBlockRange; esi: number } | null {\n    for (let i = this.#blocks.length - 1; i >= 0; i--) {\n      const block = this.#blocks[i]!\n      if (isoBlockContains(block.start, block.length, ssId)) {\n        return { block, esi: serial32Distance(block.start, ssId) }\n      }\n    }\n    return null\n  }\n\n  /** Number of pending holes. */\n  get holeCount(): number {\n    return this.#holes.length\n  }\n\n  /** The stated block (never a span) ending exactly at `end`. */\n  blockEndingAt(end: number): IsoBlockRange | undefined {\n    return this.#blocks.find((block) => !block.span && isoBlockEnd(block.start, block.length) === end)\n  }\n\n  /** The known block or span starting exactly at `start`. */\n  blockAt(start: number): IsoBlockRange | undefined {\n    return this.#blocks.find((block) => block.start === start)\n  }\n\n  /** Known blocks and spans overlapping the SS_IDs strictly between `a` and `b`. */\n  blocksBetween(a: number, b: number): IsoBlockRange[] {\n    const first = (a + 1) >>> 0\n    const count = serial32Distance(a, b) - 1\n    if (!serial32Precedes(a, b) || count <= 0) return []\n    return this.#blocks.filter((block) => {\n      const toBlock = serial32Distance(first, block.start)\n      const fromBlock = serial32Distance(block.start, first)\n      return toBlock < count || fromBlock < block.length\n    })\n  }\n\n  /**\n   * Whether every SS_ID strictly between `a` and `b` lies in known coverage,\n   * so no block that could hold them is still to be stated by a repair.\n   */\n  coversBetween(a: number, b: number): boolean {\n    if (this.#coverageEnd === undefined) return false\n    if (!serial32Precedes(a, b) || serial32Distance(a, b) <= 1) return true\n    // A pending hole may still be stated by a FETCHed repair.\n    const first = (a + 1) >>> 0\n    const count = serial32Distance(a, b) - 1\n    if (this.#holes.some((hole) => isoRangesOverlap(first, count, hole.start, hole.length))) return false\n    // The last SS_ID strictly before b must precede the coverage end.\n    return serial32Precedes((b - 1) >>> 0, this.#coverageEnd)\n  }\n\n  /**\n   * Hold a first-arrival source symbol whose block is not yet known. Returns\n   * false for a second copy of an SS_ID already held, so the first copy wins.\n   * Retires behind `ssId` (see the class note).\n   */\n  hold(ssId: number, payload: T): boolean {\n    if (this.#held.has(ssId)) return false\n    this.#held.set(ssId, payload)\n    this.retireBehind(ssId)\n    for (const oldest of this.#held.keys()) {\n      if (this.#held.size <= this.heldCapacity) break\n      this.#held.delete(oldest)\n      this.#heldEvicted++\n    }\n    return true\n  }\n\n  /** Whether `ssId` is held unplaced. */\n  isHeld(ssId: number): boolean {\n    return this.#held.has(ssId)\n  }\n\n  /**\n   * Apply one repair symbol's `(SS_Start, SSB_length)`. The first repair of a\n   * block states its range and places every held source in it; later repair\n   * symbols of the same block change nothing. A range that contradicts a\n   * known block (a different length, or an overlap with another block or a\n   * span) fails closed: the repair symbol is dropped and no block changes.\n   * A newly stated block retires behind its SS_Start (see the class note).\n   * A block so far past `newest` that stating it would retire the position\n   * `newest` is refused as `ahead`. When `newest` is a placed block's SS_Start\n   * this is slightly conservative (retirement measures that block from its\n   * last SS_ID), dropping up to one block-length of repairs past the horizon\n   * until a source moves `newest`. Placing it would turn everything\n   * between into a repair-less span and leave every real repair behind it\n   * `stale`. Sources move `newest` (`hold`, `observe`), so after a real outage\n   * the first source back brings the next repair inside the horizon; until one\n   * arrives, a stream's repairs alone cannot pass it.\n   */\n  placeRepair(start: number, length: number): IsoRepairPlacement<T> {\n    if (!Number.isSafeInteger(length) || length <= 0 || length > this.#kMax) {\n      return { status: 'conflict', reason: `SSB_length ${length} is outside 1..${this.#kMax}` }\n    }\n    const known = this.blockAt(start)\n    if (known !== undefined) {\n      if (known.span) {\n        return { status: 'overlap', reason: `repair block ${start}+${length} falls inside a repair-less span` }\n      }\n      if (known.length !== length) {\n        return {\n          status: 'conflict',\n          reason: `repair SSB_length ${length} conflicts with ${known.length} for SS_Start ${start}`,\n        }\n      }\n      return { status: 'placed', block: known, placed: [] }\n    }\n    const pending = this.#holes.find((h) => isoBlockContains(h.start, h.length, start))\n    if (pending !== undefined) {\n      if (!isoBlockContains(pending.start, pending.length, serial32Add(start, length - 1))) {\n        return { status: 'overlap', reason: `repair block ${start}+${length} runs past pending hole ${pending.start}+${pending.length}` }\n      }\n      // A FETCHed repair stated a block inside a pending hole: split the hole round it.\n      this.#holes.splice(this.#holes.indexOf(pending), 1)\n      const before = serial32Distance(pending.start, start)\n      const afterStart = isoBlockEnd(start, length)\n      const after = pending.length - before - length\n      if (before > 0) this.#holes.push({ start: pending.start, length: before, span: false })\n      if (after > 0) this.#holes.push({ start: afterStart, length: after, span: false })\n      const block: IsoBlockRange = { start, length, span: false }\n      const placed = this.#claim(block)\n      this.#blocks.push(block)\n      return { status: 'placed', block, placed }\n    }\n    for (const block of this.#blocks) {\n      if (\n        isoBlockContains(block.start, block.length, start) ||\n        isoBlockContains(start, length, block.start)\n      ) {\n        return {\n          status: 'overlap',\n          reason: `repair block ${start}+${length} overlaps known block ${block.start}+${block.length}`,\n        }\n      }\n    }\n    if (this.#newest !== undefined && isoBlocksBehindLowerBound(this.#newest, start, this.#kMax) > this.#retentionBlocks) {\n      return { status: 'ahead', reason: `repair block ${start}+${length} is past the retention horizon ahead of ${this.#newest}` }\n    }\n    let span: { block: IsoBlockRange; placed: IsoPlacedSource<T>[] } | undefined\n    let hole: { block: IsoBlockRange; lostSsId: number } | undefined\n    if (this.#coverageEnd === undefined) {\n      // Reception starts at the first stated block. Held sources before it\n      // are the tail of blocks that began before the join: their range is\n      // never stated, so they are not FEC symbols of this receiver.\n      for (const ssId of this.#held.keys()) {\n        if (serial32Precedes(ssId, start)) this.#held.delete(ssId)\n      }\n      this.#coverageEnd = start\n    } else if (serial32Precedes(start, this.#coverageEnd)) {\n      return { status: 'stale', reason: `repair block ${start}+${length} precedes known coverage` }\n    } else if (start !== this.#coverageEnd) {\n      const gap = { start: this.#coverageEnd, length: serial32Distance(this.#coverageEnd, start) }\n      const lostSsId = this.deferIncompleteGaps ? this.#highestMissing(gap.start, gap.length) : undefined\n      if (lostSsId !== undefined) {\n        const holeBlock: IsoBlockRange = { ...gap, span: false }\n        this.#holes.push(holeBlock)\n        hole = { block: holeBlock, lostSsId }\n      } else {\n        const spanBlock: IsoBlockRange = { ...gap, span: true }\n        span = { block: spanBlock, placed: this.#claim(spanBlock) }\n        this.#blocks.push(spanBlock)\n      }\n    }\n    const block: IsoBlockRange = { start, length, span: false }\n    const placed = this.#claim(block)\n    this.#blocks.push(block)\n    this.#coverageEnd = isoBlockEnd(start, length)\n    this.retireBehind(start)\n    if (hole !== undefined) return { status: 'placed', block, placed, hole }\n    return span === undefined\n      ? { status: 'placed', block, placed }\n      : { status: 'placed', block, placed, span }\n  }\n\n  /**\n   * Turn every pending hole inside `[start, start + length)` into a\n   * repair-less span, claiming its held sources: its range FETCH ended, so\n   * nothing more will state its blocks. Returns the spans, in SS_ID order.\n   */\n  closeHolesWithin(start: number, length: number): { block: IsoBlockRange; placed: IsoPlacedSource<T>[] }[] {\n    const closed: { block: IsoBlockRange; placed: IsoPlacedSource<T>[] }[] = []\n    for (const hole of [...this.#holes]) {\n      if (!isoBlockContains(start, length, hole.start)) continue\n      this.#holes.splice(this.#holes.indexOf(hole), 1)\n      const spanBlock: IsoBlockRange = { start: hole.start, length: hole.length, span: true }\n      closed.push({ block: spanBlock, placed: this.#claim(spanBlock) })\n      this.#blocks.push(spanBlock)\n    }\n    return closed.sort((x, y) => serial32Distance(start, x.block.start) - serial32Distance(start, y.block.start))\n  }\n\n  /** The highest SS_ID in the range no source is held for, or undefined when all are. */\n  #highestMissing(start: number, length: number): number | undefined {\n    // Every position past the held count cannot all be held: bounded scan.\n    const steps = Math.min(length, this.#held.size + 1)\n    for (let i = 1; i <= steps; i++) {\n      const ssId = serial32Add(start, length - i)\n      if (!this.#held.has(ssId)) return ssId\n    }\n    return undefined\n  }\n\n  /**\n   * Retire every block and span whose last SS_ID, and every held source,\n   * lies more than `retentionBlocks` blocks behind `position`, with the shared\n   * lower-bound metric (`isoBlocksBehindLowerBound`) every ISO interleave\n   * horizon uses. Returns the retired block starts.\n   */\n  retireBehind(position: number): number[] {\n    this.observe(position)\n    const horizon = this.#retentionBlocks\n    const retired: number[] = []\n    for (let i = this.#blocks.length - 1; i >= 0; i--) {\n      const block = this.#blocks[i]!\n      const last = serial32Add(block.start, block.length - 1)\n      if (isoBlocksBehindLowerBound(last, position, this.#kMax) > horizon) {\n        retired.push(block.start)\n        this.#blocks.splice(i, 1)\n      }\n    }\n    for (let i = this.#holes.length - 1; i >= 0; i--) {\n      const hole = this.#holes[i]!\n      const last = serial32Add(hole.start, hole.length - 1)\n      if (isoBlocksBehindLowerBound(last, position, this.#kMax) > horizon) this.#holes.splice(i, 1)\n    }\n    for (const ssId of [...this.#held.keys()]) {\n      if (isoBlocksBehindLowerBound(ssId, position, this.#kMax) > horizon) this.#held.delete(ssId)\n    }\n    return retired\n  }\n\n  /** Forget everything (publisher restart, track reset). */\n  reset(): void {\n    this.#blocks.length = 0\n    this.#holes.length = 0\n    this.#held.clear()\n    this.#coverageEnd = undefined\n    this.#newest = undefined\n  }\n\n  #claim(block: IsoBlockRange): IsoPlacedSource<T>[] {\n    const placed: IsoPlacedSource<T>[] = []\n    for (const [ssId, payload] of this.#held) {\n      if (!isoBlockContains(block.start, block.length, ssId)) continue\n      placed.push({ ssId, esi: serial32Distance(block.start, ssId), payload })\n      this.#held.delete(ssId)\n    }\n    placed.sort((x, y) => x.esi - y.esi)\n    return placed\n  }\n}\n\n/** Whether `[aStart, aStart + aLength)` and `[bStart, bStart + bLength)` share an SS_ID. */\nfunction isoRangesOverlap(aStart: number, aLength: number, bStart: number, bLength: number): boolean {\n  return serial32Distance(aStart, bStart) < aLength || serial32Distance(bStart, aStart) < bLength\n}\n"],
-  "mappings": ";AAsEO,IAAM,kBAAkB;AAI/B,IAAM,wBAAwB;AAC9B,IAAM,4BAA4B,kBAAkB;;;AC9D7C,IAAM,iBAAiB;AAGvB,IAAM,oBAAoB,KAAK;AAQ/B,IAAM,uBAAuB,MAAM,iBAAiB;;;ACXpD,IAAM,gBAAgB;AAGtB,IAAM,gBAAgB;AAE7B,SAAS,aAAa,OAAe,MAAY;AAC/C,MAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,KAAK,SAAS,eAAe;AACnE,UAAM,IAAI,WAAW,GAAG,IAAI,0BAA0B,KAAK,GAAG;EAChE;AACF;AAMM,SAAU,YAAY,GAAW,GAAS;AAC9C,eAAa,GAAG,GAAG;AACnB,MAAI,CAAC,OAAO,UAAU,CAAC,KAAK,KAAK,CAAC,iBAAiB,KAAK,eAAe;AACrE,UAAM,IAAI,WAAW,gDAAgD,CAAC,GAAG;EAC3E;AACA,UAAQ,IAAI,IAAI,iBAAiB;AACnC;AAGM,SAAU,iBAAiB,MAAc,IAAU;AACvD,SAAQ,KAAK,SAAU;AACzB;AAMM,SAAU,iBAAiB,GAAW,GAAS;AACnD,QAAM,WAAW,iBAAiB,GAAG,CAAC;AACtC,SAAO,aAAa,KAAK,WAAW;AACtC;;;ACfO,IAAM,qBAAiD,OAAO,OAAO;EAC1E;CACD;AAmFK,SAAU,YAAY,SAAiB,WAAiB;AAC5D,SAAO,YAAY,SAAS,SAAS;AACvC;AAMM,SAAU,iBAAiB,SAAiB,WAAmB,MAAY;AAC/E,SAAO,iBAAiB,SAAS,IAAI,IAAI;AAC3C;AAWM,SAAU,0BAA0B,GAAW,GAAW,MAAY;AAC1E,MAAI,CAAC,OAAO,cAAc,IAAI,KAAK,QAAQ,GAAG;AAC5C,UAAM,IAAI,MAAM,8DAA8D,IAAI,GAAG;EACvF;AACA,SAAO,iBAAiB,GAAG,CAAC,IAAI,KAAK,MAAM,iBAAiB,GAAG,CAAC,IAAI,IAAI,IAAI;AAC9E;;;ACtHO,IAAM,uBAA2C,OAAO,OAAO;EACpE,SAAS,OAAO,OAAO,CAAC,WAAW,cAAc,CAAC;EAClD,eAAe,OAAO,OAAO,CAAC,cAAc,CAAC;EAC7C,UAAU;CACX;;;AC8CM,IAAM,kBAAN,MAAM,iBAAmB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA2B9B,YAAY,MAAc,iBAAyB;AAzBnD;AAAA,SAAS,UAA2B,CAAC;AAErC;AAAA,SAAS,QAAQ,oBAAI,IAAe;AAKpC,wBAAe;AAGf;AAAA,SAAS,SAA0B,CAAC;AAOpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,+BAAsB;AASpB,QAAI,CAAC,OAAO,cAAc,IAAI,KAAK,QAAQ,GAAG;AAC5C,YAAM,IAAI,MAAM,+DAA+D,IAAI,GAAG;AAAA,IACxF;AACA,SAAK,QAAQ;AACb,SAAK,mBAAmB,iBAAgB,kBAAkB,eAAe;AAAA,EAC3E;AAAA,EA/BS;AAAA,EAEA;AAAA;AAAA,EAET;AAAA,EACS;AAAA,EACT;AAAA,EACA;AAAA,EACA;AAAA,EAES;AAAA,EAuBT,OAAO,kBAAkB,iBAAiC;AACxD,QAAI,CAAC,OAAO,cAAc,eAAe,KAAK,mBAAmB,GAAG;AAClE,YAAM,IAAI;AAAA,QACR,gFAAgF,eAAe;AAAA,MACjG;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA,EAEA,IAAI,OAAe;AACjB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,kBAA0B;AAC5B,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,gBAAgB,iBAAyB;AAC3C,SAAK,mBAAmB,iBAAgB,kBAAkB,eAAe;AAAA,EAC3E;AAAA;AAAA,EAGA,IAAI,eAAuB;AACzB,YAAQ,KAAK,mBAAmB,KAAK,KAAK;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAI,SAA6B;AAC/B,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,QAAQ,UAAwB;AAC9B,QAAI,KAAK,YAAY,UAAa,iBAAiB,KAAK,SAAS,QAAQ,EAAG,MAAK,UAAU;AAAA,EAC7F;AAAA;AAAA,EAGA,IAAI,cAAsB;AACxB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,aAAqB;AACvB,WAAO,KAAK,QAAQ;AAAA,EACtB;AAAA;AAAA,EAGA,IAAI,cAAkC;AACpC,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,YAAoB;AACtB,WAAO,KAAK,MAAM;AAAA,EACpB;AAAA;AAAA,EAGA,OAAO,MAA4D;AACjE,aAAS,IAAI,KAAK,QAAQ,SAAS,GAAG,KAAK,GAAG,KAAK;AACjD,YAAM,QAAQ,KAAK,QAAQ,CAAC;AAC5B,UAAI,iBAAiB,MAAM,OAAO,MAAM,QAAQ,IAAI,GAAG;AACrD,eAAO,EAAE,OAAO,KAAK,iBAAiB,MAAM,OAAO,IAAI,EAAE;AAAA,MAC3D;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,IAAI,YAAoB;AACtB,WAAO,KAAK,OAAO;AAAA,EACrB;AAAA;AAAA,EAGA,cAAc,KAAwC;AACpD,WAAO,KAAK,QAAQ,KAAK,CAAC,UAAU,CAAC,MAAM,QAAQ,YAAY,MAAM,OAAO,MAAM,MAAM,MAAM,GAAG;AAAA,EACnG;AAAA;AAAA,EAGA,QAAQ,OAA0C;AAChD,WAAO,KAAK,QAAQ,KAAK,CAAC,UAAU,MAAM,UAAU,KAAK;AAAA,EAC3D;AAAA;AAAA,EAGA,cAAc,GAAW,GAA4B;AACnD,UAAM,QAAS,IAAI,MAAO;AAC1B,UAAM,QAAQ,iBAAiB,GAAG,CAAC,IAAI;AACvC,QAAI,CAAC,iBAAiB,GAAG,CAAC,KAAK,SAAS,EAAG,QAAO,CAAC;AACnD,WAAO,KAAK,QAAQ,OAAO,CAAC,UAAU;AACpC,YAAM,UAAU,iBAAiB,OAAO,MAAM,KAAK;AACnD,YAAM,YAAY,iBAAiB,MAAM,OAAO,KAAK;AACrD,aAAO,UAAU,SAAS,YAAY,MAAM;AAAA,IAC9C,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,cAAc,GAAW,GAAoB;AAC3C,QAAI,KAAK,iBAAiB,OAAW,QAAO;AAC5C,QAAI,CAAC,iBAAiB,GAAG,CAAC,KAAK,iBAAiB,GAAG,CAAC,KAAK,EAAG,QAAO;AAEnE,UAAM,QAAS,IAAI,MAAO;AAC1B,UAAM,QAAQ,iBAAiB,GAAG,CAAC,IAAI;AACvC,QAAI,KAAK,OAAO,KAAK,CAAC,SAAS,iBAAiB,OAAO,OAAO,KAAK,OAAO,KAAK,MAAM,CAAC,EAAG,QAAO;AAEhG,WAAO,iBAAkB,IAAI,MAAO,GAAG,KAAK,YAAY;AAAA,EAC1D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,KAAK,MAAc,SAAqB;AACtC,QAAI,KAAK,MAAM,IAAI,IAAI,EAAG,QAAO;AACjC,SAAK,MAAM,IAAI,MAAM,OAAO;AAC5B,SAAK,aAAa,IAAI;AACtB,eAAW,UAAU,KAAK,MAAM,KAAK,GAAG;AACtC,UAAI,KAAK,MAAM,QAAQ,KAAK,aAAc;AAC1C,WAAK,MAAM,OAAO,MAAM;AACxB,WAAK;AAAA,IACP;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,OAAO,MAAuB;AAC5B,WAAO,KAAK,MAAM,IAAI,IAAI;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBA,YAAY,OAAe,QAAuC;AAChE,QAAI,CAAC,OAAO,cAAc,MAAM,KAAK,UAAU,KAAK,SAAS,KAAK,OAAO;AACvE,aAAO,EAAE,QAAQ,YAAY,QAAQ,cAAc,MAAM,kBAAkB,KAAK,KAAK,GAAG;AAAA,IAC1F;AACA,UAAM,QAAQ,KAAK,QAAQ,KAAK;AAChC,QAAI,UAAU,QAAW;AACvB,UAAI,MAAM,MAAM;AACd,eAAO,EAAE,QAAQ,WAAW,QAAQ,gBAAgB,KAAK,IAAI,MAAM,mCAAmC;AAAA,MACxG;AACA,UAAI,MAAM,WAAW,QAAQ;AAC3B,eAAO;AAAA,UACL,QAAQ;AAAA,UACR,QAAQ,qBAAqB,MAAM,mBAAmB,MAAM,MAAM,iBAAiB,KAAK;AAAA,QAC1F;AAAA,MACF;AACA,aAAO,EAAE,QAAQ,UAAU,OAAO,OAAO,QAAQ,CAAC,EAAE;AAAA,IACtD;AACA,UAAM,UAAU,KAAK,OAAO,KAAK,CAAC,MAAM,iBAAiB,EAAE,OAAO,EAAE,QAAQ,KAAK,CAAC;AAClF,QAAI,YAAY,QAAW;AACzB,UAAI,CAAC,iBAAiB,QAAQ,OAAO,QAAQ,QAAQ,YAAY,OAAO,SAAS,CAAC,CAAC,GAAG;AACpF,eAAO,EAAE,QAAQ,WAAW,QAAQ,gBAAgB,KAAK,IAAI,MAAM,2BAA2B,QAAQ,KAAK,IAAI,QAAQ,MAAM,GAAG;AAAA,MAClI;AAEA,WAAK,OAAO,OAAO,KAAK,OAAO,QAAQ,OAAO,GAAG,CAAC;AAClD,YAAM,SAAS,iBAAiB,QAAQ,OAAO,KAAK;AACpD,YAAM,aAAa,YAAY,OAAO,MAAM;AAC5C,YAAM,QAAQ,QAAQ,SAAS,SAAS;AACxC,UAAI,SAAS,EAAG,MAAK,OAAO,KAAK,EAAE,OAAO,QAAQ,OAAO,QAAQ,QAAQ,MAAM,MAAM,CAAC;AACtF,UAAI,QAAQ,EAAG,MAAK,OAAO,KAAK,EAAE,OAAO,YAAY,QAAQ,OAAO,MAAM,MAAM,CAAC;AACjF,YAAMA,SAAuB,EAAE,OAAO,QAAQ,MAAM,MAAM;AAC1D,YAAMC,UAAS,KAAK,OAAOD,MAAK;AAChC,WAAK,QAAQ,KAAKA,MAAK;AACvB,aAAO,EAAE,QAAQ,UAAU,OAAAA,QAAO,QAAAC,QAAO;AAAA,IAC3C;AACA,eAAWD,UAAS,KAAK,SAAS;AAChC,UACE,iBAAiBA,OAAM,OAAOA,OAAM,QAAQ,KAAK,KACjD,iBAAiB,OAAO,QAAQA,OAAM,KAAK,GAC3C;AACA,eAAO;AAAA,UACL,QAAQ;AAAA,UACR,QAAQ,gBAAgB,KAAK,IAAI,MAAM,yBAAyBA,OAAM,KAAK,IAAIA,OAAM,MAAM;AAAA,QAC7F;AAAA,MACF;AAAA,IACF;AACA,QAAI,KAAK,YAAY,UAAa,0BAA0B,KAAK,SAAS,OAAO,KAAK,KAAK,IAAI,KAAK,kBAAkB;AACpH,aAAO,EAAE,QAAQ,SAAS,QAAQ,gBAAgB,KAAK,IAAI,MAAM,2CAA2C,KAAK,OAAO,GAAG;AAAA,IAC7H;AACA,QAAI;AACJ,QAAI;AACJ,QAAI,KAAK,iBAAiB,QAAW;AAInC,iBAAW,QAAQ,KAAK,MAAM,KAAK,GAAG;AACpC,YAAI,iBAAiB,MAAM,KAAK,EAAG,MAAK,MAAM,OAAO,IAAI;AAAA,MAC3D;AACA,WAAK,eAAe;AAAA,IACtB,WAAW,iBAAiB,OAAO,KAAK,YAAY,GAAG;AACrD,aAAO,EAAE,QAAQ,SAAS,QAAQ,gBAAgB,KAAK,IAAI,MAAM,2BAA2B;AAAA,IAC9F,WAAW,UAAU,KAAK,cAAc;AACtC,YAAM,MAAM,EAAE,OAAO,KAAK,cAAc,QAAQ,iBAAiB,KAAK,cAAc,KAAK,EAAE;AAC3F,YAAM,WAAW,KAAK,sBAAsB,KAAK,gBAAgB,IAAI,OAAO,IAAI,MAAM,IAAI;AAC1F,UAAI,aAAa,QAAW;AAC1B,cAAM,YAA2B,EAAE,GAAG,KAAK,MAAM,MAAM;AACvD,aAAK,OAAO,KAAK,SAAS;AAC1B,eAAO,EAAE,OAAO,WAAW,SAAS;AAAA,MACtC,OAAO;AACL,cAAM,YAA2B,EAAE,GAAG,KAAK,MAAM,KAAK;AACtD,eAAO,EAAE,OAAO,WAAW,QAAQ,KAAK,OAAO,SAAS,EAAE;AAC1D,aAAK,QAAQ,KAAK,SAAS;AAAA,MAC7B;AAAA,IACF;AACA,UAAM,QAAuB,EAAE,OAAO,QAAQ,MAAM,MAAM;AAC1D,UAAM,SAAS,KAAK,OAAO,KAAK;AAChC,SAAK,QAAQ,KAAK,KAAK;AACvB,SAAK,eAAe,YAAY,OAAO,MAAM;AAC7C,SAAK,aAAa,KAAK;AACvB,QAAI,SAAS,OAAW,QAAO,EAAE,QAAQ,UAAU,OAAO,QAAQ,KAAK;AACvE,WAAO,SAAS,SACZ,EAAE,QAAQ,UAAU,OAAO,OAAO,IAClC,EAAE,QAAQ,UAAU,OAAO,QAAQ,KAAK;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,iBAAiB,OAAe,QAA0E;AACxG,UAAM,SAAmE,CAAC;AAC1E,eAAW,QAAQ,CAAC,GAAG,KAAK,MAAM,GAAG;AACnC,UAAI,CAAC,iBAAiB,OAAO,QAAQ,KAAK,KAAK,EAAG;AAClD,WAAK,OAAO,OAAO,KAAK,OAAO,QAAQ,IAAI,GAAG,CAAC;AAC/C,YAAM,YAA2B,EAAE,OAAO,KAAK,OAAO,QAAQ,KAAK,QAAQ,MAAM,KAAK;AACtF,aAAO,KAAK,EAAE,OAAO,WAAW,QAAQ,KAAK,OAAO,SAAS,EAAE,CAAC;AAChE,WAAK,QAAQ,KAAK,SAAS;AAAA,IAC7B;AACA,WAAO,OAAO,KAAK,CAAC,GAAG,MAAM,iBAAiB,OAAO,EAAE,MAAM,KAAK,IAAI,iBAAiB,OAAO,EAAE,MAAM,KAAK,CAAC;AAAA,EAC9G;AAAA;AAAA,EAGA,gBAAgB,OAAe,QAAoC;AAEjE,UAAM,QAAQ,KAAK,IAAI,QAAQ,KAAK,MAAM,OAAO,CAAC;AAClD,aAAS,IAAI,GAAG,KAAK,OAAO,KAAK;AAC/B,YAAM,OAAO,YAAY,OAAO,SAAS,CAAC;AAC1C,UAAI,CAAC,KAAK,MAAM,IAAI,IAAI,EAAG,QAAO;AAAA,IACpC;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,aAAa,UAA4B;AACvC,SAAK,QAAQ,QAAQ;AACrB,UAAM,UAAU,KAAK;AACrB,UAAM,UAAoB,CAAC;AAC3B,aAAS,IAAI,KAAK,QAAQ,SAAS,GAAG,KAAK,GAAG,KAAK;AACjD,YAAM,QAAQ,KAAK,QAAQ,CAAC;AAC5B,YAAM,OAAO,YAAY,MAAM,OAAO,MAAM,SAAS,CAAC;AACtD,UAAI,0BAA0B,MAAM,UAAU,KAAK,KAAK,IAAI,SAAS;AACnE,gBAAQ,KAAK,MAAM,KAAK;AACxB,aAAK,QAAQ,OAAO,GAAG,CAAC;AAAA,MAC1B;AAAA,IACF;AACA,aAAS,IAAI,KAAK,OAAO,SAAS,GAAG,KAAK,GAAG,KAAK;AAChD,YAAM,OAAO,KAAK,OAAO,CAAC;AAC1B,YAAM,OAAO,YAAY,KAAK,OAAO,KAAK,SAAS,CAAC;AACpD,UAAI,0BAA0B,MAAM,UAAU,KAAK,KAAK,IAAI,QAAS,MAAK,OAAO,OAAO,GAAG,CAAC;AAAA,IAC9F;AACA,eAAW,QAAQ,CAAC,GAAG,KAAK,MAAM,KAAK,CAAC,GAAG;AACzC,UAAI,0BAA0B,MAAM,UAAU,KAAK,KAAK,IAAI,QAAS,MAAK,MAAM,OAAO,IAAI;AAAA,IAC7F;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,QAAc;AACZ,SAAK,QAAQ,SAAS;AACtB,SAAK,OAAO,SAAS;AACrB,SAAK,MAAM,MAAM;AACjB,SAAK,eAAe;AACpB,SAAK,UAAU;AAAA,EACjB;AAAA,EAEA,OAAO,OAA4C;AACjD,UAAM,SAA+B,CAAC;AACtC,eAAW,CAAC,MAAM,OAAO,KAAK,KAAK,OAAO;AACxC,UAAI,CAAC,iBAAiB,MAAM,OAAO,MAAM,QAAQ,IAAI,EAAG;AACxD,aAAO,KAAK,EAAE,MAAM,KAAK,iBAAiB,MAAM,OAAO,IAAI,GAAG,QAAQ,CAAC;AACvE,WAAK,MAAM,OAAO,IAAI;AAAA,IACxB;AACA,WAAO,KAAK,CAAC,GAAG,MAAM,EAAE,MAAM,EAAE,GAAG;AACnC,WAAO;AAAA,EACT;AACF;AAGA,SAAS,iBAAiB,QAAgB,SAAiB,QAAgB,SAA0B;AACnG,SAAO,iBAAiB,QAAQ,MAAM,IAAI,WAAW,iBAAiB,QAAQ,MAAM,IAAI;AAC1F;",
+  "sourcesContent": ["/**\n * @mmt/container - MMTP Parser\n *\n * MMTP (MMT Protocol) packet parser based on ISO/IEC 23008-1:2023 Section 9.2\n *\n * MMTP header format (12 bytes):\n * - Byte 0: V(2) | C(1) | FEC_type(2) | r(1) | X(1) | R(1)\n * - Byte 1: reserved(2) | packet_type(6)\n * - Bytes 2-3: packet_id (big-endian)\n * - Bytes 4-7: timestamp (big-endian, 32-bit)\n * - Bytes 8-11: sequence_number (big-endian)\n *\n * FEC_type values:\n * - 0: No FEC / source packet\n * - 1: FEC mode 0 (source with FEC payload ID)\n * - 2: FEC repair packet mode 0\n * - 3: FEC repair packet mode 1\n *\n * @packageDocumentation\n */\n\nexport interface MMTPHeader {\n  version: number\n  /** Packet type: 0x00=MPU, 0x02=Signaling, 0x03=Repair */\n  packetType: number\n  packetId: number\n  timestamp: bigint\n  sequenceNumber: number\n  payloadLength: number\n  fecType: number\n  /** C flag: header carries a 32-bit packet_counter. */\n  packetCounterFlag: boolean\n  packetCounter?: number\n  /** X flag: header carries an extension header and value. */\n  extensionFlag: boolean\n  extension?: { type: number; data: Uint8Array }\n  /** Byte offset at which the MMTP payload begins. */\n  headerLength: number\n  /** Random Access Point flag - indicates keyframe (ISO 23008-1, byte 0 bit 0) */\n  rapFlag: boolean\n}\n\nexport interface MPUHeader {\n  mpuSequenceNumber: number\n  fragmentationIndicator: number // FI: 0=complete, 1=first, 2=middle, 3=last\n  /** 8-bit MPU fragment_counter from byte 3. */\n  fragmentCounter: number\n  /** T flag: 1=timed media (14-byte MFU DU header), 0=non-timed (4-byte header) */\n  timedFlag: number\n  /** A flag: aggregated MPU payload. This strict profile requires A=0. */\n  aggregationFlag: boolean\n  /** MPU payload_length (bytes 0-1): bytes after the length field, including\n   *  the remaining six MPU-header bytes and all data-unit bytes. */\n  payloadLength: number\n}\n\nexport interface MFUDuHeader {\n  movieFragmentSequenceNumber: number\n  sampleNumber: number\n  offset: number\n  priority: number\n  dependencyCounter: number\n}\n\nexport interface MMTPPacket {\n  header: MMTPHeader\n  payload: Uint8Array\n}\n\nexport const MMTP_HEADER_SIZE = 12\nexport const MPU_HEADER_SIZE = 8\nexport const MFU_DU_HEADER_SIZE_TIMED = 14    // T=1: timed media (video/audio samples)\nexport const MFU_DU_HEADER_SIZE_NONTIMED = 4  // T=0: non-timed media (item_id only)\n\nconst MPU_LENGTH_FIELD_SIZE = 2\nconst MPU_HEADER_REMAINDER_SIZE = MPU_HEADER_SIZE - MPU_LENGTH_FIELD_SIZE\nexport const SOURCE_FEC_PAYLOAD_ID_SIZE = 4\n\n// MMTP Packet Types (ISO/IEC 23008-1:2023 Section 9.2.2)\nexport const PACKET_TYPE_MPU = 0x00\nexport const PACKET_TYPE_SIGNALING = 0x02\nexport const PACKET_TYPE_REPAIR = 0x03\n\n// AL-FEC Signaling Message ID (ISO/IEC 23008-1:2023 Amendment 1:2025)\nexport const ALFEC_MESSAGE_ID = 0x0203\n\n/**\n * MMTP `packet_id` of the signaling flow, which carries PACKET_TYPE_SIGNALING\n * packets such as the AL-FEC message (ALFEC_MESSAGE_ID). The FFmpeg `moq_mmt`\n * muxer sends that message on this packet_id into the same multicast group as\n * the media, and moqcast-draft (PR #44) makes advertising it for a track a\n * MUST NOT. A track's packet_id is therefore 1..MMTP_PACKET_ID_MAX.\n */\nexport const MMTP_SIGNALING_PACKET_ID = 0\n\n/** Largest value of the 16-bit MMTP `packet_id` header field. */\nexport const MMTP_PACKET_ID_MAX = 0xffff\n\n// fec_code_id_for_repair_flow code points (ISO/IEC 23008-10 Table 1;\n// draft-ramadan-moq-mmt-01 Section 8.3).\nexport const FEC_CODE_REED_SOLOMON = 1\nexport const FEC_CODE_RAPTORQ = 3\n\n/**\n * Parse MMTP header from buffer\n */\nexport function parseMMTPHeader(buffer: Uint8Array): MMTPHeader {\n  if (buffer.length < MMTP_HEADER_SIZE) {\n    throw new Error(`MMTP packet too small: ${buffer.length} bytes`)\n  }\n\n  const view = new DataView(buffer.buffer, buffer.byteOffset, buffer.byteLength)\n\n  const version = (buffer[0]! >> 6) & 0x03\n  if (version !== 0) {\n    throw new Error(`Unsupported MMTP version: ${version}`)\n  }\n\n  // Extract FEC type from byte 0, bits 3-4\n  const fecType = (buffer[0]! >> 3) & 0x03\n  const packetCounterFlag = (buffer[0]! & 0x20) !== 0\n  const extensionFlag = (buffer[0]! & 0x02) !== 0\n\n  // Extract RAP flag from byte 0, bit 0 (R bit - Random Access Point)\n  const rapFlag = (buffer[0]! & 0x01) === 1\n\n  // ISO/IEC 23008-1:2023 Figure 8 (V=0) places reserved(2) before\n  // packet_type(6), so packet_type occupies the low six bits of byte 1.\n  const packetType = buffer[1]! & 0x3F\n\n  let offset = 2\n\n  // Packet ID (2 bytes, big-endian)\n  const packetId = view.getUint16(offset, false)\n  offset += 2\n\n  // Timestamp (4 bytes, big-endian)\n  const timestamp = BigInt(view.getUint32(offset, false))\n  offset += 4\n\n  // Sequence number (4 bytes, big-endian)\n  const sequenceNumber = view.getUint32(offset, false)\n  offset += 4\n\n  let packetCounter: number | undefined\n  if (packetCounterFlag) {\n    if (offset + 4 > buffer.length) throw new Error('MMTP packet truncated in packet_counter')\n    packetCounter = view.getUint32(offset, false)\n    offset += 4\n  }\n\n  let extension: { type: number; data: Uint8Array } | undefined\n  if (extensionFlag) {\n    if (offset + 4 > buffer.length) throw new Error('MMTP packet truncated in header extension')\n    const type = view.getUint16(offset, false)\n    const length = view.getUint16(offset + 2, false)\n    offset += 4\n    if (offset + length > buffer.length) throw new Error('MMTP packet truncated in header extension value')\n    extension = { type, data: buffer.subarray(offset, offset + length) }\n    offset += length\n  }\n\n  return {\n    version,\n    packetType,\n    packetId,\n    timestamp,\n    sequenceNumber,\n    payloadLength: buffer.length - offset,\n    fecType,\n    packetCounterFlag,\n    packetCounter,\n    extensionFlag,\n    extension,\n    headerLength: offset,\n    rapFlag,\n  }\n}\n\n/**\n * The MMTP `packet_id` of `buffer`, or null exactly when parseMMTPHeader would\n * throw for it (short buffer, V != 0, truncated packet_counter or header\n * extension).\n *\n * This is the per-packet filter a receiver runs before any other work, so it\n * builds no header object, DataView or BigInt timestamp (BLO-36599). Use\n * parseMMTPHeader when any other header field is needed.\n */\nexport function readMMTPPacketId(buffer: Uint8Array): number | null {\n  if (buffer.length < MMTP_HEADER_SIZE) return null\n  const flags = buffer[0]!\n  if (((flags >> 6) & 0x03) !== 0) return null\n  let offset = MMTP_HEADER_SIZE\n  if ((flags & 0x20) !== 0) {\n    if (offset + 4 > buffer.length) return null\n    offset += 4\n  }\n  if ((flags & 0x02) !== 0) {\n    if (offset + 4 > buffer.length) return null\n    const length = (buffer[offset + 2]! << 8) | buffer[offset + 3]!\n    if (offset + 4 + length > buffer.length) return null\n  }\n  return (buffer[2]! << 8) | buffer[3]!\n}\n\n/**\n * Unwrap MMTP packet to extract payload\n */\nexport function unwrapMMTP(buffer: Uint8Array): MMTPPacket {\n  const header = parseMMTPHeader(buffer)\n  const payload = buffer.subarray(header.headerLength)\n\n  return { header, payload }\n}\n\n/**\n * Parse MPU header from payload\n * ISO/IEC 23008-1:2023 Section 9.2.3.3\n *\n * MPU Header format (8 bytes) as written by FFmpeg/libmmt:\n * - Bytes 0-1: payload_length (16 bits, big-endian)\n * - Byte 2: FT(4) | T(1) | FI(2) | A(1)\n * - Byte 3: fragment_counter (8 bits)\n * - Bytes 4-7: MPU_sequence_number (32 bits, big-endian)\n */\nexport function parseMPUHeader(payload: Uint8Array): MPUHeader {\n  if (payload.length < MPU_HEADER_SIZE) {\n    throw new Error(`Payload too small for MPU header: ${payload.length} bytes`)\n  }\n\n  const view = new DataView(payload.buffer, payload.byteOffset, payload.byteLength)\n\n  // Bytes 0-1: payload_length (16 bits, big-endian)\n  const payloadLength = view.getUint16(0, false)\n\n  // Byte 2: FT(4) | T(1) | FI(2) | A(1)\n  const flagsByte = payload[2]!\n  const timedFlag = (flagsByte >> 3) & 0x01\n  const fragmentationIndicator = (flagsByte >> 1) & 0x03\n  const aggregationFlag = (flagsByte & 0x01) !== 0\n\n  // Byte 3: fragment_counter (8 bits). The high bit is part of the counter in\n  // the current libmmt/FFmpeg writer ABI.\n  const fragmentCounter = payload[3]!\n\n  // Bytes 4-7: MPU_sequence_number (32 bits, big-endian)\n  const mpuSequenceNumber = view.getUint32(4, false)\n\n  return {\n    mpuSequenceNumber,\n    fragmentationIndicator,\n    fragmentCounter,\n    timedFlag,\n    aggregationFlag,\n    payloadLength,\n  }\n}\n\nexport function parseTimedMfuDuHeader(payload: Uint8Array, offset: number): MFUDuHeader | null {\n  if (offset < 0 || offset + MFU_DU_HEADER_SIZE_TIMED > payload.length) return null\n  const view = new DataView(payload.buffer, payload.byteOffset + offset, MFU_DU_HEADER_SIZE_TIMED)\n  return {\n    movieFragmentSequenceNumber: view.getUint32(0, false),\n    sampleNumber: view.getUint32(4, false),\n    offset: view.getUint32(8, false),\n    priority: payload[offset + 12]!,\n    dependencyCounter: payload[offset + 13]!,\n  }\n}\n\n/**\n * Why `extractMFUPayload` refused a packet.\n *\n * These identifiers are part of the public contract: callers surface them in\n * diagnostics, so renaming one is a breaking change.\n */\nexport type MFURejectionGate =\n  | 'packet-shorter-than-mmtp-plus-mpu-header'\n  | 'mmtp-header-unparseable'\n  | 'not-an-mpu-packet'\n  | 'payload-shorter-than-mpu-header'\n  | 'aggregation-flag-set'\n  | 'mpu-payload-length-below-header-remainder'\n  | 'mpu-declared-end-exceeds-payload'\n  | 'mfu-offset-at-or-past-declared-end'\n  | 'source-fec-payload-id-width-mismatch'\n  | 'declared-trailers-unresolved'\n\nexport interface MFURejection {\n  gate: MFURejectionGate\n  /** Human-readable detail, including the byte arithmetic that decided it. */\n  detail: string\n}\n\ninterface MfuPayloadLayout {\n  hasMfuDuHeader: boolean\n  mfuOffset: number\n  dataEnd: number\n}\n\nfunction resolveMfuPayloadLayout(\n  mpu: MPUHeader,\n  fragmentType: number,\n  payload: Uint8Array,\n): { layout: MfuPayloadLayout } | { rejection: MFURejection } {\n  if (mpu.payloadLength < MPU_HEADER_REMAINDER_SIZE) {\n    return {\n      rejection: {\n        gate: 'mpu-payload-length-below-header-remainder',\n        detail: `payload_length=${mpu.payloadLength} < ${MPU_HEADER_REMAINDER_SIZE}`,\n      },\n    }\n  }\n\n  // ISO/IEC 23008-1 defines payload_length from immediately after its own\n  // two-byte field. It therefore includes the remaining six MPU-header bytes.\n  const declaredEnd = MPU_LENGTH_FIELD_SIZE + mpu.payloadLength\n  if (declaredEnd > payload.length) {\n    return {\n      rejection: {\n        gate: 'mpu-declared-end-exceeds-payload',\n        detail:\n          `payload_length=${mpu.payloadLength} implies end=${declaredEnd}, ` +\n          `payload is ${payload.length} bytes`,\n      },\n    }\n  }\n\n  const hasHeader = fragmentType === 2 && mpu.fragmentationIndicator <= 1\n  const mfuHeaderSize = mpu.timedFlag ? MFU_DU_HEADER_SIZE_TIMED : MFU_DU_HEADER_SIZE_NONTIMED\n  const mfuOffset = MPU_HEADER_SIZE + (hasHeader ? mfuHeaderSize : 0)\n  if (mfuOffset >= declaredEnd) {\n    return {\n      rejection: {\n        gate: 'mfu-offset-at-or-past-declared-end',\n        detail: `mfuOffset=${mfuOffset} >= declaredEnd=${declaredEnd}`,\n      },\n    }\n  }\n\n  return {\n    layout: {\n      hasMfuDuHeader: hasHeader,\n      mfuOffset,\n      dataEnd: declaredEnd,\n    },\n  }\n}\n\n// Legacy detached per-packet authenticator suffix `[0xf0a1][len][auth]`. Its\n// producer was removed (BLO-16483) and nothing verifies it any more; provenance\n// is the signed per-group manifest. Receivers still skip an exact suffix so a\n// stale producer degrades to unauthenticated playback instead of dropped\n// packets. ponytail: hard-cut to reject once no deployed producer can emit it.\nconst LEGACY_TRAILER_EXT_TYPE = 0xf0a1\nconst LEGACY_TRAILER_HEADER_SIZE = 4\n\nfunction isEmptyOrExactLegacyTrailer(payload: Uint8Array, start: number, end: number): boolean {\n  if (start === end) return true\n  if (start < 0 || end > payload.length || start + LEGACY_TRAILER_HEADER_SIZE > end) {\n    return false\n  }\n\n  const view = new DataView(\n    payload.buffer,\n    payload.byteOffset + start,\n    end - start,\n  )\n  if (view.getUint16(0, false) !== LEGACY_TRAILER_EXT_TYPE) return false\n\n  const authLength = view.getUint16(2, false)\n  return start + LEGACY_TRAILER_HEADER_SIZE + authLength === end\n}\n\ninterface DeclaredTrailerLayout {\n  hasFecId: boolean\n}\n\n/** Options for extractMFUPayload and explainMFURejection. */\nexport interface MFUExtractOptions {\n  /**\n   * When true, do NOT subtract the Source FEC Payload ID from the payload\n   * boundary, even if fecType >= 1. For FEC-recovered symbols whose FEC PID\n   * was already stripped before WASM decoding.\n   */\n  skipFecId?: boolean\n}\n\nfunction resolveDeclaredTrailers(\n  payload: Uint8Array,\n  declaredEnd: number,\n  fecType: number,\n  options?: MFUExtractOptions,\n): DeclaredTrailerLayout | null {\n  if (declaredEnd > payload.length) return null\n\n  if (options?.skipFecId) {\n    return isEmptyOrExactLegacyTrailer(payload, declaredEnd, payload.length)\n      ? { hasFecId: false }\n      : null\n  }\n\n  if (fecType === 1) {\n    const fecStart = payload.length - SOURCE_FEC_PAYLOAD_ID_SIZE\n    if (fecStart < declaredEnd || !isEmptyOrExactLegacyTrailer(payload, declaredEnd, fecStart)) {\n      return null\n    }\n    return { hasFecId: true }\n  }\n  if (fecType !== 0) return null\n\n  if (isEmptyOrExactLegacyTrailer(payload, declaredEnd, payload.length)) {\n    return { hasFecId: false }\n  }\n\n  return null\n}\n\n/**\n * Extract NAL unit payload from MMTP packet\n */\nexport function extractNALUnit(mmtpPacket: Uint8Array): Uint8Array {\n  const extraction = extractMFUPayload(mmtpPacket)\n  if (!extraction) throw new Error('Malformed MMTP MPU payload')\n  return extraction.data\n}\n\n/** Result of extracting MFU payload from an MMTP packet */\nexport interface MFUExtraction {\n  /** MMTP header fields */\n  header: MMTPHeader\n  /** MPU header fields */\n  mpu: MPUHeader\n  /** Fragment type (FT field, 4 bits): 0=metadata, 2=MFU data */\n  fragmentType: number\n  /** MFU payload data (video/audio bytes, headers stripped, FEC ID excluded) */\n  data: Uint8Array\n  /** Parsed timed MFU DU header when present, otherwise null */\n  mfuDuHeader: MFUDuHeader | null\n  /** Non-timed MFU Item_ID when the 4-byte DU header is present. */\n  itemId: number | null\n  /** Source FEC Payload ID if present (`FEC_type == 1`), or null */\n  fecPayloadId: { ssId: number } | null\n}\n\n/**\n * Extract MFU payload from a raw MMTP packet.\n *\n * Handles all the byte arithmetic for:\n * - MMTP header (12 bytes)\n * - MPU sub-header (8 bytes, payloadLength field)\n * - MFU DU header (14 bytes timed / 4 bytes non-timed, only for FI \u2264 1)\n * - Source FEC Payload ID (4 bytes at end, only when `FEC_type == 1`)\n *\n * `payloadLength` is the ISO length-after-field value: six remaining MPU-header\n * bytes, then the MFU DU header when present, then media. The legacy\n * authenticator suffix and the Source FEC trailer are outside that declared span and must consume the exact suffix.\n *\n * @param mmtpPacket Raw MMTP packet (from multicast or MoQ)\n * @param options.skipFecId When true, do NOT subtract the 4-byte Source FEC Payload ID\n *   from the payload boundary, even if fecType >= 1 in the MMTP header.  Use this for\n *   FEC-recovered symbols where the FEC PID was already stripped before WASM decoding\n *   but the fecType bits in byte 0 still reflect the original packet (FEC Type=1 per\n *   draft-ramadan-moq-mmt-01 \u00A73.1).\n * @returns Extracted MFU data + metadata, or null if packet is too small\n */\ninterface MfuPlan {\n  header: MMTPHeader\n  payload: Uint8Array\n  mpu: MPUHeader\n  fragmentType: number\n  layout: MfuPayloadLayout\n  trailerLayout: DeclaredTrailerLayout\n}\n\n/**\n * Single source of truth for whether a packet yields an MFU payload.\n *\n * `extractMFUPayload` and `explainMFURejection` both delegate here, so the\n * reason reported to operators can never drift from the decision the parser\n * actually made.\n */\nfunction planMfuExtraction(\n  mmtpPacket: Uint8Array,\n  options?: MFUExtractOptions,\n  parsedHeader?: MMTPHeader,\n): { plan: MfuPlan } | { rejection: MFURejection } {\n  if (mmtpPacket.length < MMTP_HEADER_SIZE + MPU_HEADER_SIZE) {\n    return {\n      rejection: {\n        gate: 'packet-shorter-than-mmtp-plus-mpu-header',\n        detail: `${mmtpPacket.length} bytes < ${MMTP_HEADER_SIZE + MPU_HEADER_SIZE}`,\n      },\n    }\n  }\n\n  let header: MMTPHeader\n  if (parsedHeader) {\n    header = parsedHeader\n  } else {\n    try {\n      header = parseMMTPHeader(mmtpPacket)\n    } catch (error) {\n      return {\n        rejection: {\n          gate: 'mmtp-header-unparseable',\n          detail: error instanceof Error ? error.message : String(error),\n        },\n      }\n    }\n  }\n  if (header.packetType !== PACKET_TYPE_MPU) {\n    return {\n      rejection: {\n        gate: 'not-an-mpu-packet',\n        detail: `packetType=0x${header.packetType.toString(16).padStart(2, '0')}`,\n      },\n    }\n  }\n\n  const payload = mmtpPacket.subarray(header.headerLength)\n  if (payload.length < MPU_HEADER_SIZE) {\n    return {\n      rejection: {\n        gate: 'payload-shorter-than-mpu-header',\n        detail: `${payload.length} bytes < ${MPU_HEADER_SIZE}`,\n      },\n    }\n  }\n\n  const mpu = parseMPUHeader(payload)\n  if (mpu.aggregationFlag) {\n    return {\n      rejection: { gate: 'aggregation-flag-set', detail: 'strict profile requires A=0' },\n    }\n  }\n\n  // Fragment type from byte 2 upper nibble (not returned by parseMPUHeader)\n  const fragmentType = (payload[2]! >> 4) & 0x0f\n\n  const layoutResult = resolveMfuPayloadLayout(mpu, fragmentType, payload)\n  if ('rejection' in layoutResult) return layoutResult\n  const { layout } = layoutResult\n\n  const trailerLayout = resolveDeclaredTrailers(\n    payload,\n    layout.dataEnd,\n    header.fecType,\n    options,\n  )\n  if (!trailerLayout) {\n    // The most common cause is a producer whose Source FEC Payload ID width\n    // disagrees with ISO/IEC 23008-1 \u00A7C.5.2. Name that explicitly rather than\n    // leaving operators to infer it from a generic trailer error.\n    if (!options?.skipFecId && header.fecType === 1) {\n      const observed = payload.length - layout.dataEnd\n      const expected = SOURCE_FEC_PAYLOAD_ID_SIZE\n      if (observed !== expected) {\n        return {\n          rejection: {\n            gate: 'source-fec-payload-id-width-mismatch',\n            detail:\n              `producer wrote a ${observed}-byte Source FEC Payload ID, ` +\n              `ISO/IEC 23008-1 \u00A7C.5.2 requires ${expected} ` +\n              `(payload=${payload.length}, declaredEnd=${layout.dataEnd})`,\n          },\n        }\n      }\n    }\n    return {\n      rejection: {\n        gate: 'declared-trailers-unresolved',\n        detail:\n          `trailer bytes [${layout.dataEnd}, ${payload.length}) are neither empty ` +\n          `nor an exact legacy authenticator trailer (fecType=${header.fecType})`,\n      },\n    }\n  }\n\n  return { plan: { header, payload, mpu, fragmentType, layout, trailerLayout } }\n}\n\n/**\n * Report why `extractMFUPayload` would refuse this packet, or null if it would\n * accept it.\n *\n * `extractMFUPayload` returns bare `null` on ten distinct conditions, which\n * makes a producer/consumer framing disagreement indistinguishable from a\n * publisher that never started \u2014 both render as silence. Use this wherever\n * that distinction matters: diagnostics, contract tests, and operator-facing\n * logs.\n */\nexport function explainMFURejection(\n  mmtpPacket: Uint8Array,\n  options?: MFUExtractOptions,\n): MFURejection | null {\n  const result = planMfuExtraction(mmtpPacket, options)\n  return 'rejection' in result ? result.rejection : null\n}\n\nexport function extractMFUPayload(\n  mmtpPacket: Uint8Array,\n  options?: MFUExtractOptions,\n): MFUExtraction | null {\n  return extractPlannedMfu(mmtpPacket, planMfuExtraction(mmtpPacket, options))\n}\n\n/**\n * extractMFUPayload for a caller that already holds this packet's parsed MMTP\n * header, so the header is not parsed a second time (BLO-36599).\n *\n * `header` must be `parseMMTPHeader(mmtpPacket)` of this same packet; the\n * result is then identical to `extractMFUPayload(mmtpPacket, options)`.\n */\nexport function extractMFUPayloadWithHeader(\n  mmtpPacket: Uint8Array,\n  header: MMTPHeader,\n  options?: MFUExtractOptions,\n): MFUExtraction | null {\n  return extractPlannedMfu(mmtpPacket, planMfuExtraction(mmtpPacket, options, header))\n}\n\nfunction extractPlannedMfu(\n  mmtpPacket: Uint8Array,\n  result: { plan: MfuPlan } | { rejection: MFURejection },\n): MFUExtraction | null {\n  if ('rejection' in result) return null\n  const { header, payload, mpu, fragmentType, layout, trailerLayout } = result.plan\n\n  const mfuDuHeaderPresent = layout.hasMfuDuHeader\n  const mfuOffset = layout.mfuOffset\n  const dataEnd = layout.dataEnd\n\n  const mfuDuHeader =\n    mfuDuHeaderPresent && mpu.timedFlag === 1\n      ? parseTimedMfuDuHeader(payload, MPU_HEADER_SIZE)\n      : null\n  const itemId =\n    mfuDuHeaderPresent && mpu.timedFlag === 0\n      ? new DataView(payload.buffer, payload.byteOffset + MPU_HEADER_SIZE, 4).getUint32(0, false)\n      : null\n\n  const data = payload.subarray(mfuOffset, dataEnd)\n\n  const fecPayloadId = trailerLayout.hasFecId\n    ? {\n        ssId: new DataView(\n          mmtpPacket.buffer,\n          mmtpPacket.byteOffset + mmtpPacket.length - SOURCE_FEC_PAYLOAD_ID_SIZE,\n          4,\n        ).getUint32(0, false),\n      }\n    : null\n\n  return { header, mpu, fragmentType, data, mfuDuHeader, itemId, fecPayloadId }\n}\n\n/**\n * Extract timestamp from MMTP packet\n */\nexport function extractTimestamp(mmtpPacket: Uint8Array): bigint {\n  const { header } = unwrapMMTP(mmtpPacket)\n  return header.timestamp\n}\n\n/**\n * Check if MMTP packet is an FEC repair packet\n * FEC_type 2 and 3 are repair packets\n */\nexport function isFecRepairPacket(mmtpPacket: Uint8Array): boolean {\n  if (mmtpPacket.length < 1) return false\n  const fecType = (mmtpPacket[0]! >> 3) & 0x03\n  return fecType >= 2\n}\n\n/**\n * Extract Source FEC Payload ID (SS_ID) from the last 4 bytes of an MMTP\n * source packet per ISO/IEC 23008-1:2023 Section C.5.2 Figure C.10.\n *\n * SS_ID is a flat 32-bit monotonic counter (incremented by 1 per packet\n * for ssbg_mode0 and ssbg_mode1). Block membership and ESI use the\n * configured K; repair SS_Start identifies the first SS_ID of the block and\n * SSB_length records the authored source-symbol count:\n *   SBN = floor(SS_ID / K), ESI = SS_ID % K\n *   SS_Start = SBN * K  (first SS_ID of the block)\n *\n * This matches FFmpeg moqenc_mmt.c, the drafts (draft-ramadan-moq-fec \u00A76.2),\n * and ATSC A/331 \u00A78.1.2.5 which defers to ISO 23008-1 Annex C.\n */\nexport function extractFecPayloadId(mmtpPacket: Uint8Array): { ssId: number } | null {\n  const header = parseHeaderForSourceFecId(mmtpPacket)\n  return header ? sourceFecPayloadIdOf(mmtpPacket, header) : null\n}\n\n/**\n * Return true when FEC_type=1 and the exact suffix after the ISO-declared MPU\n * payload contains a four-byte Source FEC Payload ID.\n */\nexport function hasSourceFecPayloadId(mmtpPacket: Uint8Array): boolean {\n  const header = parseHeaderForSourceFecId(mmtpPacket)\n  return header !== null && sourceFecPayloadIdOf(mmtpPacket, header) !== null\n}\n\nfunction parseHeaderForSourceFecId(mmtpPacket: Uint8Array): MMTPHeader | null {\n  if (mmtpPacket.length < MMTP_HEADER_SIZE + MPU_HEADER_SIZE) return null\n  try {\n    return parseMMTPHeader(mmtpPacket)\n  } catch {\n    return null\n  }\n}\n\n/**\n * The Source FEC Payload ID of a packet whose MMTP header the caller already\n * parsed, or null when the packet carries none: present only when FEC_type=1\n * and the exact suffix after the ISO-declared MPU payload holds the four-byte\n * ID (ISO/IEC 23008-1 \u00A7C.5.2). Same answer as extractFecPayloadId, without a\n * second header parse (BLO-36599).\n *\n * `header` must be `parseMMTPHeader(mmtpPacket)` of this same packet.\n */\nexport function sourceFecPayloadIdOf(\n  mmtpPacket: Uint8Array,\n  header: MMTPHeader,\n): { ssId: number } | null {\n  if (mmtpPacket.length < MMTP_HEADER_SIZE + MPU_HEADER_SIZE) return null\n  if (header.packetType !== PACKET_TYPE_MPU) return null\n\n  const payload = mmtpPacket.subarray(header.headerLength)\n  if (payload.length < MPU_HEADER_SIZE) return null\n  const payloadLength = (payload[0]! << 8) | payload[1]!\n  if (payloadLength < MPU_HEADER_REMAINDER_SIZE) return null\n  const declaredEnd = MPU_LENGTH_FIELD_SIZE + payloadLength\n  if (!resolveDeclaredTrailers(payload, declaredEnd, header.fecType)?.hasFecId) return null\n\n  // Flat 4-byte SS_ID: encoder writes block_id * K + symbol_id\n  const off = mmtpPacket.length - SOURCE_FEC_PAYLOAD_ID_SIZE\n  return {\n    ssId:\n      ((mmtpPacket[off]! << 24) |\n        (mmtpPacket[off + 1]! << 16) |\n        (mmtpPacket[off + 2]! << 8) |\n        mmtpPacket[off + 3]!) >>>\n      0,\n  }\n}\n\n/** Size of Repair FEC Payload ID per ISO/IEC 23008-1 Section C.5.3 */\nexport const REPAIR_FEC_PID_SIZE = 13\n\n/**\n * Parse the 13-byte Repair FEC Payload ID after the complete dynamic MMTP header.\n * `parsedHeader`, when given, must be `parseMMTPHeader(mmtpPacket)` of this\n * same packet; it spares the second header parse (BLO-36599).\n */\nfunction readRepairFecPayloadIdFields(mmtpPacket: Uint8Array, parsedHeader?: MMTPHeader): {\n  packetId: number; ssStart: number; rsbLength: number; rsId: number; ssbLength: number; dataOffset: number\n} | null {\n  let header: MMTPHeader\n  if (parsedHeader) {\n    header = parsedHeader\n  } else {\n    try {\n      header = parseMMTPHeader(mmtpPacket)\n    } catch {\n      return null\n    }\n  }\n  if (header.packetType !== PACKET_TYPE_REPAIR || header.fecType !== 2) return null\n\n  const off = header.headerLength\n  if (mmtpPacket.length < off + REPAIR_FEC_PID_SIZE) return null\n  const ssStart =\n    ((mmtpPacket[off]! << 24) |\n      (mmtpPacket[off + 1]! << 16) |\n      (mmtpPacket[off + 2]! << 8) |\n      mmtpPacket[off + 3]!) >>>\n    0  // 32 bits\n  const rsbLength = (mmtpPacket[off + 4]! << 16) | (mmtpPacket[off + 5]! << 8) | mmtpPacket[off + 6]!  // 24 bits\n  const rsId = (mmtpPacket[off + 7]! << 16) | (mmtpPacket[off + 8]! << 8) | mmtpPacket[off + 9]!  // 24 bits\n  const ssbLength = (mmtpPacket[off + 10]! << 16) | (mmtpPacket[off + 11]! << 8) | mmtpPacket[off + 12]!  // 24 bits\n  return {\n    packetId: header.packetId,\n    ssStart,\n    rsbLength,\n    rsId,\n    ssbLength,\n    dataOffset: off + REPAIR_FEC_PID_SIZE,\n  }\n}\n\n/**\n * Extract Repair FEC Payload ID from a raw-multicast MMTP repair packet.\n * Per ISO/IEC 23008-1:2023 Section C.5.3 (ssbg_mode0, one-stage, no FFSRP_TS):\n *   [MMTP header][SS_Start:4][RSB_length:3][RS_ID:3][SSB_length:3][repair data]\n * OTI is delivered via AL-FEC signaling message (Table C.3), not per-packet.\n *\n * Byte 1 is reserved(2)|packet_type(6) for V=0, so repair type 0x03 is 0x03.\n * Pre-migration high-bits bytes (0x0c) are rejected \u2014 no compatibility decode.\n */\nexport function extractRepairFecPayloadId(mmtpPacket: Uint8Array): {\n  ssStart: number; rsbLength: number; rsId: number; ssbLength: number\n} | null {\n  const fields = readRepairFecPayloadIdFields(mmtpPacket)\n  if (!fields) return null\n  return {\n    ssStart: fields.ssStart,\n    rsbLength: fields.rsbLength,\n    rsId: fields.rsId,\n    ssbLength: fields.ssbLength,\n  }\n}\n\n/** Parsed MoQ repair frame per ISO/IEC 23008-1 Section C.4.3 + C.5.3 */\nexport interface MoqRepairFrame {\n  /** MMTP packetId (1=video, 2=audio) \u2014 for routing to correct FEC decoder */\n  packetId: number\n  /** SS_Start (32 bits): SS_ID of first source symbol in block */\n  ssStart: number\n  /** RSB_length (24 bits): number of repair symbols (P) */\n  rsbLength: number\n  /** RS_ID (24 bits): repair symbol index (0-based) */\n  rsId: number\n  /** SSB_length (24 bits): authored source-symbol count (1..=configured K) */\n  ssbLength: number\n  /** Repair symbol data after the dynamic MMTP header and 13-byte FEC payload ID. */\n  symbolData: Uint8Array\n}\n\n/**\n * Parse a MoQ repair frame (ISO/IEC 23008-1 Annex C format).\n *\n * Wire format per ISO 23008-1 \u00A7C.4.3 + \u00A7C.5.3:\n *   MMTP Header: fixed 12 bytes plus C/X optional fields\n *   then SS_Start (4 bytes) \u2192 block identifier\n *   then RSB_length (3 bytes) \u2192 P\n *   then RS_ID (3 bytes) \u2192 ESI = K + RS_ID\n *   then SSB_length (3 bytes) \u2192 authored source-symbol count (1..=K)\n *   then Repair Symbol Data (T bytes)\n *\n * @param frame - Raw MoQ repair frame bytes\n * @returns Parsed frame or null if invalid\n */\nexport function parseMoqRepairFrame(frame: Uint8Array): MoqRepairFrame | null {\n  return moqRepairFrameFrom(frame, readRepairFecPayloadIdFields(frame))\n}\n\n/**\n * parseMoqRepairFrame for a caller that already holds this frame's parsed MMTP\n * header, so the header is not parsed a second time (BLO-36599). The router's\n * multicast repair branch uses it: one repair packet in every K + P otherwise\n * paid two header parses.\n *\n * `header` must be `parseMMTPHeader(frame)` of this same frame; the result is\n * then identical to `parseMoqRepairFrame(frame)`.\n */\nexport function parseMoqRepairFrameWithHeader(\n  frame: Uint8Array,\n  header: MMTPHeader,\n): MoqRepairFrame | null {\n  return moqRepairFrameFrom(frame, readRepairFecPayloadIdFields(frame, header))\n}\n\nfunction moqRepairFrameFrom(\n  frame: Uint8Array,\n  repairId: ReturnType<typeof readRepairFecPayloadIdFields>,\n  checkRsId = true,\n): MoqRepairFrame | null {\n  if (!repairId) return null\n\n  const symbolData = frame.subarray(repairId.dataOffset)\n  if (\n    repairId.ssbLength === 0 ||\n    (checkRsId && repairId.rsId >= repairId.rsbLength) ||\n    symbolData.length === 0\n  ) return null\n\n  return {\n    packetId: repairId.packetId,\n    ssStart: repairId.ssStart,\n    rsbLength: repairId.rsbLength,\n    rsId: repairId.rsId,\n    ssbLength: repairId.ssbLength,\n    symbolData,\n  }\n}\n\n/**\n * Why a repair object of an mmtp track is discarded on admission:\n * `repairLength` -- the object is not exactly 12 + 13 + T bytes with a\n * 12-byte MMTP header (C = 0, X = 0; draft-ramadan-moq-mmt-02 7.3, judged\n * before any Repair FEC Payload ID field is read); `repairRsId` -- RS_ID is not\n * below RSB_length, under every scheme; `repairSchemeBound` -- the object\n * breaks its scheme's bound: reed-solomon SSB_length + RSB_length > 255, which\n * also caps RS_ID at 253, or raptorq SSB_length + RSB_length - 1 > 2^24 - 1\n * (draft-ramadan-moq-fec-core-00 7.5 and 10.3, -block-codes-00 7).\n */\nexport type RepairObjectReject = 'repairLength' | 'repairRsId' | 'repairSchemeBound'\n\n/**\n * Admission of one mmtp repair object under its instance's T and scheme. The\n * caller names the instance (by the repair track it subscribed); nothing here\n * infers it from the fields. `repairRsId` and `repairSchemeBound` carry the\n * frame so the caller can first route an RSB_length below a held layer's\n * O_i + P_i to the 7.3.2 stop, which takes precedence over the discard.\n * `null`: not an iso repair packet, or SSB_length 0.\n */\nexport function admitMmtpRepairObject(\n  packet: Uint8Array,\n  header: MMTPHeader,\n  symbolSize: number,\n  algorithm: string | undefined,\n): { frame: MoqRepairFrame; reject?: Exclude<RepairObjectReject, 'repairLength'> } | { reject: 'repairLength' } | null {\n  if (header.packetType !== PACKET_TYPE_REPAIR || header.fecType !== 2) return null\n  if (header.headerLength !== MMTP_HEADER_SIZE || packet.length !== MMTP_HEADER_SIZE + REPAIR_FEC_PID_SIZE + symbolSize) {\n    return { reject: 'repairLength' }\n  }\n  const frame = moqRepairFrameFrom(packet, readRepairFecPayloadIdFields(packet, header), false)\n  if (!frame) return null\n  if (frame.rsId >= frame.rsbLength) return { frame, reject: 'repairRsId' }\n  const blockSymbols = frame.ssbLength + frame.rsbLength\n  if (algorithm === 'reed-solomon' ? blockSymbols > 255 : algorithm === 'raptorq' && blockSymbols - 1 > 0xffffff) {\n    return { frame, reject: 'repairSchemeBound' }\n  }\n  return { frame }\n}\n\n// The signalling-message parsers (9.3.4.2 payload header, AL-FEC message,\n// PA/MPT) live in ./signalling.ts.\n", "/**\n * NTP short format (RFC 5905 \u00A76): an unsigned 32-bit, 16.16 fixed-point count\n * of seconds. The MMTP header `timestamp` field (ISO/IEC 23008-1 \u00A79.2.2)\n * carries each packet's UTC sending instant in this format, so the value wraps\n * to 0 every 2^16 s (~18.2 h).\n *\n * Plain numeric order on these values breaks at every wrap: a retained\n * `Math.max` stays at the pre-wrap value and every later instant compares as\n * older. Order send times only with {@link compareNtpShort}, which applies\n * RFC 1982 serial-number arithmetic over the field's width.\n */\n\n/** Width in bits of the MMTP `timestamp` field (NTP short). */\nexport const NTP_SHORT_BITS = 32\n\n/** Number of distinct NTP-short values; the field wraps to 0 here. */\nexport const NTP_SHORT_MODULUS = 2 ** NTP_SHORT_BITS\n\n/**\n * RFC 1982 \u00A73.2's `2^(SERIAL_BITS - 1)`. Two values whose forward distance is\n * below this are ordered; exactly this far apart they are not ordered at all.\n * Two instants must be less than this far apart (2^15 s, ~9.1 h of send time)\n * for the comparison to give their true order.\n */\nexport const NTP_SHORT_HALF_RANGE = 2 ** (NTP_SHORT_BITS - 1)\n\n/**\n * Serial order of one NTP-short value relative to another.\n *\n * `'unordered'` is RFC 1982's undefined case: the values are exactly\n * {@link NTP_SHORT_HALF_RANGE} apart, so neither precedes the other. It is\n * never folded into `'before'` or `'after'`; each caller decides what an\n * unorderable pair means for it.\n */\nexport type NtpShortOrder = 'before' | 'equal' | 'after' | 'unordered'\n\n/** True when `value` is an NTP-short value: an integer in [0, NTP_SHORT_MODULUS). */\nexport function isNtpShort(value: number): boolean {\n  return Number.isInteger(value) && value >= 0 && value < NTP_SHORT_MODULUS\n}\n\n/**\n * RFC 1982 serial comparison of NTP-short `a` against `b`: `'after'` when `a`\n * is the later instant, `'before'` when it is the earlier one.\n *\n * The answer is the true order only while the two instants are less than\n * {@link NTP_SHORT_HALF_RANGE} apart. Past that a 32-bit field cannot tell\n * later from earlier, and the result names whichever direction is nearer.\n * This is not a total order (it is not transitive across the whole space), so\n * it must never be used to sort.\n *\n * @throws {RangeError} if either operand is not an NTP-short value\n */\nexport function compareNtpShort(a: number, b: number): NtpShortOrder {\n  if (!isNtpShort(a) || !isNtpShort(b)) {\n    throw new RangeError(\n      `NTP-short values must be integers in [0, 2^${NTP_SHORT_BITS}), got ${String(a)} and ${String(b)}`,\n    )\n  }\n  if (a === b) return 'equal'\n  // Forward distance from b to a, reduced into [1, NTP_SHORT_MODULUS). Both\n  // operands are below 2^32, so every step is exact in a double.\n  const forward = (a - b + NTP_SHORT_MODULUS) % NTP_SHORT_MODULUS\n  if (forward < NTP_SHORT_HALF_RANGE) return 'after'\n  if (forward > NTP_SHORT_HALF_RANGE) return 'before'\n  return 'unordered'\n}\n", "/**\n * RFC 1982 serial-number arithmetic for the 32-bit MMTP AL-FEC symbol\n * counters (ISO/IEC 23008-1:2023 C.5.2 SS_ID, C.5.3 SS_Start).\n *\n * SS_ID is a 32-bit field, so a stream that runs long enough wraps it to 0.\n * Ordering two SS_IDs (or two blocks by their first SS_ID) with `<` reads\n * every post-wrap value as older than every pre-wrap one. Serial order\n * agrees with `<` whenever the two values are less than 2^31 apart, so for\n * every stream that has not reached the wrap the result is unchanged; only\n * the order across the wrap point differs (BLO-35597 iso:5).\n */\n\n/** 2^SERIAL_BITS for SERIAL_BITS = 32. */\nexport const SERIAL32_SPAN = 0x1_0000_0000\n\n/** RFC 1982 \u00A73.2's 2^(SERIAL_BITS - 1). */\nexport const SERIAL32_HALF = 0x8000_0000\n\nfunction assertUint32(value: number, name: string): void {\n  if (!Number.isInteger(value) || value < 0 || value >= SERIAL32_SPAN) {\n    throw new RangeError(`${name} must be a uint32 (got ${value})`)\n  }\n}\n\n/**\n * RFC 1982 \u00A73.1 addition, extended to negative `n` for the matching\n * subtraction: `(s + n) mod 2^32`. `n` must lie in (-2^31, 2^31).\n */\nexport function serial32Add(s: number, n: number): number {\n  assertUint32(s, 's')\n  if (!Number.isInteger(n) || n <= -SERIAL32_HALF || n >= SERIAL32_HALF) {\n    throw new RangeError(`serial addend must lie in (-2^31, 2^31) (got ${n})`)\n  }\n  return (s + n + SERIAL32_SPAN) % SERIAL32_SPAN\n}\n\n/** Forward distance from `from` to `to`: `(to - from) mod 2^32`. */\nexport function serial32Distance(from: number, to: number): number {\n  return (to - from) >>> 0\n}\n\n/**\n * RFC 1982 \u00A73.2: `a` precedes `b`. Values exactly 2^31 apart are unordered\n * (neither precedes the other).\n */\nexport function serial32Precedes(a: number, b: number): boolean {\n  const distance = serial32Distance(a, b)\n  return distance !== 0 && distance < SERIAL32_HALF\n}\n", "/**\n * FEC block profile (BLO-35597, ISO/IEC 23008-1 Annex C).\n *\n * Every catalog `fec` object that declares an FEC instance names its block\n * profile in `fec.blockProfile`. A receiver applies all of a profile's rules\n * or none of them, so the token is the one explicit per-stream discriminator:\n * it is never defaulted and never inferred from the wire.\n *\n * draft-ramadan-moq-fec \u00A75.1 defines exactly one value, and it is the only\n * profile this library implements:\n *\n * - `iso-ssbg1-v1`: ssbg_mode1 (C.3.3): a source symbol is\n *   `u16 length || protected packet || zero padding` to T; a block is a\n *   K' = SSB_length RaptorQ block (C.5.3) and repair ESI = SSB_length + RS_ID;\n *   SS_ID increments by one per FEC source packet and wraps at 2^32 (C.5.2),\n *   so a block is located by membership in `[SS_Start, SS_Start + SSB_length)`\n *   under RFC 1982 serial arithmetic; the MoQ repair group id is the 62-bit\n *   wrap-epoch-extended SS_Start. The AL-FEC coding byte for this profile is\n *   0x14 (one-stage, ssbg_mode1, fec_payload_id_mode 0, Amd 1:2025 Table C.3).\n *\n * A track whose `blockProfile` is absent or names any other token (the\n * retired Blockcast-private `k-padded-v1` included) has no FEC: a receiver\n * consumes its source without FEC and joins none of its repair tracks\n * (draft-ramadan-moq-fec \u00A75.1). `parseFecBlockProfile` throws for such a\n * token; the per-track catalog resolver turns the same rule into a typed\n * per-track \"FEC unavailable\" outcome instead of failing the session.\n */\nimport { serial32Add, serial32Distance, serial32Precedes } from './serial-number.js'\n\n/** The block profile a catalog `fec.blockProfile` may name: the one this library implements. */\nexport type FecBlockProfile = 'iso-ssbg1-v1'\n\n/** Every accepted `fec.blockProfile` token. */\nexport const FEC_BLOCK_PROFILES: readonly FecBlockProfile[] = Object.freeze([\n  'iso-ssbg1-v1',\n])\n\n/** True for a block-profile token this library implements. */\nexport function isFecBlockProfile(value: unknown): value is FecBlockProfile {\n  return value === 'iso-ssbg1-v1'\n}\n\n/**\n * Read a required `fec.blockProfile`. Throws on an absent token and on any\n * token other than `iso-ssbg1-v1`: there is no default and nothing is\n * inferred from the wire (draft-ramadan-moq-fec \u00A75.1).\n *\n * @param where the catalog path of the field, for the error message.\n */\nexport function parseFecBlockProfile(value: unknown, where: string): FecBlockProfile {\n  if (isFecBlockProfile(value)) return value\n  if (value === undefined) {\n    throw new Error(`${where} is required: name the FEC block profile (\"iso-ssbg1-v1\")`)\n  }\n  throw new Error(`${where} must be \"iso-ssbg1-v1\" (got ${JSON.stringify(value)})`)\n}\n\n/** ISO/IEC 23008-1 C.3.3 ssbg_mode1: the two-octet packet length field. */\nexport const SSBG1_LENGTH_FIELD_BYTES = 2\n\n/** The largest protected packet an ssbg_mode1 symbol of size T can carry. */\nexport function ssbg1MaxPacketLength(symbolSize: number): number {\n  return symbolSize - SSBG1_LENGTH_FIELD_BYTES\n}\n\n/** Whether a protected packet of `packetLength` bytes fits one T-byte ssbg_mode1 symbol. */\nexport function ssbg1FitsSymbol(packetLength: number, symbolSize: number): boolean {\n  return (\n    Number.isSafeInteger(packetLength) &&\n    packetLength >= 0 &&\n    packetLength <= ssbg1MaxPacketLength(symbolSize) &&\n    packetLength <= 0xffff\n  )\n}\n\n/**\n * Build one ssbg_mode1 source symbol (C.3.3): the protected packet's length\n * in two octets, network byte order, then the packet, then zero octets up to\n * T. The protected packet is the MMTP packet before its Source FEC Payload ID\n * is appended (C.4.2).\n *\n * @throws when `length + 2 > T`: the packet cannot be protected under this\n * profile, and silently truncating it would corrupt every repair symbol.\n */\nexport function buildSsbg1SourceSymbol(packet: Uint8Array, symbolSize: number): Uint8Array {\n  if (!Number.isSafeInteger(symbolSize) || symbolSize <= SSBG1_LENGTH_FIELD_BYTES) {\n    throw new Error(`ssbg_mode1 symbol size must exceed ${SSBG1_LENGTH_FIELD_BYTES} (got ${symbolSize})`)\n  }\n  if (!ssbg1FitsSymbol(packet.byteLength, symbolSize)) {\n    throw new Error(\n      `ssbg_mode1 source symbol needs ${packet.byteLength} + ${SSBG1_LENGTH_FIELD_BYTES} bytes but T is ${symbolSize}`,\n    )\n  }\n  const symbol = new Uint8Array(symbolSize)\n  symbol[0] = (packet.byteLength >>> 8) & 0xff\n  symbol[1] = packet.byteLength & 0xff\n  symbol.set(packet, SSBG1_LENGTH_FIELD_BYTES)\n  return symbol\n}\n\n/**\n * Recover the protected packet from one ssbg_mode1 source symbol: the bytes\n * the length field names. Returns null, never a guess, when the length field\n * points past the symbol or any padding octet is non-zero (C.3.3 padding is\n * all 00h), since either means the recovered symbol is not what was sent.\n */\nexport function trimSsbg1SourceSymbol(symbol: Uint8Array): Uint8Array | null {\n  if (symbol.byteLength < SSBG1_LENGTH_FIELD_BYTES) return null\n  const length = (symbol[0]! << 8) | symbol[1]!\n  const end = SSBG1_LENGTH_FIELD_BYTES + length\n  if (end > symbol.byteLength) return null\n  for (let i = end; i < symbol.byteLength; i++) {\n    if (symbol[i] !== 0) return null\n  }\n  return symbol.subarray(SSBG1_LENGTH_FIELD_BYTES, end)\n}\n\n/** The SS_ID after the last source symbol of `[ssStart, ssStart + ssbLength)`. */\nexport function isoBlockEnd(ssStart: number, ssbLength: number): number {\n  return serial32Add(ssStart, ssbLength)\n}\n\n/**\n * Range membership (C.5.2, C.5.3): whether `ssId` is one of the\n * `ssbLength` consecutive SS_IDs starting at `ssStart`, modulo 2^32.\n */\nexport function isoBlockContains(ssStart: number, ssbLength: number, ssId: number): boolean {\n  return serial32Distance(ssStart, ssId) < ssbLength\n}\n\n/**\n * A lower bound on how many blocks the block starting at `a` lies behind the\n * one starting at `b` (0 when `a` does not precede `b`). An iso-ssbg1-v1\n * block holds at most `kMax` source symbols (the catalog `sourceSymbols`, the\n * AL-FEC maximum_k_for_repair_flow), so `n * kMax` SS_IDs always span at least\n * `n` blocks. Every interleave horizon in the receiver (decoder retention,\n * worker retirement, ordered-relay settlement) uses this one bound, so the\n * manager's horizon can never fall inside the decoder's.\n */\nexport function isoBlocksBehindLowerBound(a: number, b: number, kMax: number): number {\n  if (!Number.isSafeInteger(kMax) || kMax <= 0) {\n    throw new Error(`iso-ssbg1-v1 block horizon needs a positive maximum K (got ${kMax})`)\n  }\n  return serial32Precedes(a, b) ? Math.floor(serial32Distance(a, b) / kMax) : 0\n}\n", "/**\n * Runtime FEC bindings (BLO-50171): what each source track's FEC resolves to\n * for this library's receiver, read from `validateFecCatalog`'s per-instance\n * result and never re-derived.\n *\n * Every runtime reader (the container's `resolveCatalogTrackFec`,\n * `resolveRepairLayers`, `MulticastManager.configureMultiTrack`, transport's\n * `catalogRepairTracks`) goes through `resolveFecBindings`, so they cannot\n * disagree with the validator or with each other about which tracks have FEC\n * and which repair tracks belong to them.\n *\n * The draft-ramadan-moq-fec-catalog-00 array is the only shape. Both catalog\n * dialects bind through it: an MSF `tracks[]` entry directly, and a hang\n * `video`/`audio` rendition (`fec` the same array) with its `repair.renditions`\n * entries (`source` + `instanceId`), mapped onto a `tracks[]` view so the same\n * validator runs. A hang rendition is authoritative over a `tracks[]` entry of\n * the same name.\n *\n * Fail closed per instance: a source whose base instance is not `ok` resolves\n * to `unavailable` with the validator's code and path, and costs no other\n * track anything. A draft-01 object `fec` is `fec_member` at that track's\n * `fec`: the track plays without FEC.\n */\nimport { validateFecCatalog, type FecCatalogCode, type FecCatalogReceiver } from './fec-catalog.js'\n\n/** The receiver this runtime is: it decodes `iso-ssbg1-v1` only. */\nexport const RUNTIME_FEC_RECEIVER: FecCatalogReceiver = Object.freeze({\n  schemes: Object.freeze(['raptorq', 'reed-solomon']),\n  blockProfiles: Object.freeze(['iso-ssbg1-v1']),\n  overlays: true,\n})\n\n/** Repair track priority when the track states none (MoQT scale, 192..255). */\nexport const DEFAULT_FEC_REPAIR_PRIORITY = 240\n\n/** One `ok` instance's geometry. */\nexport interface FecInstanceGeometry {\n  readonly instanceId: number\n  readonly scheme: 'raptorq' | 'reed-solomon'\n  /** `iso-ssbg1-v1` under `RUNTIME_FEC_RECEIVER`. */\n  readonly blockProfile: string\n  /** K. */\n  readonly sourceSymbols: number\n  /** P_0 for a base instance; the overlay's own P for an overlay. */\n  readonly repairSymbols: number\n  /** T. */\n  readonly symbolSize: number\n  readonly interleaveDepthMs?: number\n  readonly reorderToleranceMs?: number\n  readonly repairTrack: string\n  readonly symbolTrack?: string\n}\n\nexport interface FecLayerBinding {\n  readonly layer: number\n  readonly repairTrackName: string\n  readonly repairSymbols: number\n  /** O_i = sum(P_j, j < i). */\n  readonly rsIdOffset: number\n  readonly priority: number\n}\n\nexport interface FecOverlayBinding {\n  readonly repairTrackName: string\n  readonly scope: 'keyframe'\n  readonly sourceSymbols: number\n  readonly repairSymbols: number\n  readonly priority: number\n  readonly geometry: FecInstanceGeometry\n}\n\nexport interface FecBindingUnavailable {\n  /** The validator's code, or `fec_base_instances` for a track with no base\n   *  instance or more than one `ok` one (the MMTP wire carries one base Source FEC Payload\n   *  ID, mmt-02 7.4.1). */\n  readonly code: FecCatalogCode | 'fec_base_instances'\n  /** JSON Pointer into the catalog (a hang path starts `/video` or `/audio`). */\n  readonly path: string\n  readonly outcome: 'unavailable' | 'violation'\n}\n\nexport type FecSourceBinding =\n  | {\n      readonly status: 'ok'\n      readonly track: string\n      /** JSON Pointer of the source track (`/tracks/<i>`, `/video/renditions/<name>`). */\n      readonly pointer: string\n      readonly base: FecInstanceGeometry\n      /** Base layers in order, layer 0 first. */\n      readonly layers: readonly FecLayerBinding[]\n      /** Sum of P over the base layers: the wire RSB_length. */\n      readonly totalBaseRepairSymbols: number\n      readonly overlay?: FecOverlayBinding\n      /** Why a declared overlay is not used, when one is not. */\n      readonly overlayUnavailable?: FecBindingUnavailable\n    }\n  | {\n      readonly status: 'unavailable'\n      readonly track: string\n      readonly pointer: string\n      readonly reason: FecBindingUnavailable\n    }\n\ntype Obj = Record<string, unknown>\nconst recordOf = (v: unknown): Obj | undefined =>\n  typeof v === 'object' && v !== null && !Array.isArray(v) ? (v as Obj) : undefined\nconst escape = (s: string) => s.replace(/~/g, '~0').replace(/\\//g, '~1')\n\n/**\n * The `tracks[]` view of a catalog in either dialect, with each view track's\n * JSON Pointer in the original catalog.\n */\nexport function fecCatalogTracks(catalog: unknown): { tracks: unknown[]; pointers: string[] } {\n  const root = recordOf(catalog) ?? {}\n  const tracks: unknown[] = []\n  const pointers: string[] = []\n  const hangNames = new Set<string>()\n  for (const role of ['video', 'audio'] as const) {\n    for (const [name, r] of Object.entries(recordOf(recordOf(root[role])?.['renditions']) ?? {})) {\n      const entry = recordOf(r)\n      if (!entry) continue\n      hangNames.add(name)\n      const kind = recordOf(entry['container'])?.['kind']\n      // A hang rendition carries no `packaging`; its container kind is it.\n      // `mmtp-fec` is hang's kind for MMTP that carries FEC (the FFmpeg\n      // publisher's `moq_publish_set_video_packaging`): MMTP packaging.\n      const view: Obj = { name, packaging: kind === undefined || kind === 'mmtp-fec' ? 'mmtp' : kind }\n      if (entry['fec'] !== undefined) view['fec'] = entry['fec']\n      tracks.push(view)\n      pointers.push(`/${role}/renditions/${escape(name)}`)\n    }\n  }\n  const hangRenditions = tracks.length\n  for (const [name, r] of Object.entries(recordOf(recordOf(root['repair'])?.['renditions']) ?? {})) {\n    hangNames.add(name)\n    tracks.push({ packaging: 'fec-repair', ...recordOf(r), name })\n    pointers.push(`/repair/renditions/${escape(name)}`)\n  }\n  const raw = Array.isArray(root['tracks']) ? root['tracks'] : []\n  const named = new Set(hangNames)\n  raw.forEach((t, i) => {\n    const name = recordOf(t)?.['name']\n    if (typeof name === 'string') named.add(name)\n    if (typeof name === 'string' && hangNames.has(name)) return\n    tracks.push(t)\n    pointers.push(`/tracks/${i}`)\n  })\n  // hang layer 0 needs no `repair.renditions` entry: the rendition's instance\n  // names it, and a hang Root (hang's toHang) carries no repair block. Such a\n  // name stands for a repair track of that instance.\n  tracks.slice(0, hangRenditions).forEach((t, ti) => {\n    const view = t as Obj\n    if (!Array.isArray(view['fec'])) return\n    view['fec'].forEach((o, ii) => {\n      const repairTrack = recordOf(o)?.['repairTrack']\n      if (typeof repairTrack !== 'string' || named.has(repairTrack)) return\n      named.add(repairTrack)\n      const instanceId = recordOf(o)?.['instanceId']\n      tracks.push({ name: repairTrack, packaging: 'fec-repair', source: view['name'], ...(instanceId === undefined ? {} : { instanceId }) })\n      pointers.push(`${pointers[ti]}/fec/${ii}/repairTrack`)\n    })\n  })\n  return { tracks, pointers }\n}\n\n/**\n * Every source track's runtime FEC binding, by track name. A track with no\n * `fec`, or an empty `fec` array, declares no FEC and has no entry.\n */\nexport function resolveFecBindings(\n  catalog: unknown,\n  receiver: FecCatalogReceiver = RUNTIME_FEC_RECEIVER,\n): ReadonlyMap<string, FecSourceBinding> {\n  const { tracks, pointers } = fecCatalogTracks(catalog)\n  const report = validateFecCatalog({ tracks }, receiver)\n  const at = (path: string) => {\n    const m = /^\\/tracks\\/(\\d+)(.*)$/.exec(path)\n    return m ? pointers[Number(m[1])] + m[2] : path\n  }\n  const trackAt = (i: number) => recordOf(tracks[i]) ?? {}\n  const nameAt = (i: number | null) => (i === null ? undefined : (trackAt(i)['name'] as string))\n  const why = (i: { outcome: string; issues: readonly { code: FecCatalogCode; path: string }[]; path: string }) =>\n    Object.freeze({\n      code: i.issues[0]?.code ?? 'fec_member',\n      path: at(i.issues[0]?.path ?? i.path),\n      outcome: i.outcome === 'unavailable' ? ('unavailable' as const) : ('violation' as const),\n    })\n\n  const out = new Map<string, FecSourceBinding>()\n  tracks.forEach((t, ti) => {\n    const track = recordOf(t)\n    const name = track?.['name']\n    if (!track || typeof name !== 'string' || out.has(name)) return\n    if (track['packaging'] === 'fec-repair' || track['packaging'] === 'fec-source') return\n    const fec = track['fec']\n    if (fec === undefined) return\n    if (!Array.isArray(fec)) {\n      const reason = { code: 'fec_member' as const, path: at(`/tracks/${ti}/fec`), outcome: 'violation' as const }\n      out.set(name, Object.freeze({ status: 'unavailable', track: name, pointer: pointers[ti]!, reason: Object.freeze(reason) }))\n      return\n    }\n    if (fec.length === 0) return\n    const insts = report.instances.filter((i) => i.trackIndex === ti)\n    const isOverlay = (i: (typeof insts)[number]) => Object.hasOwn(recordOf(fec[Number(i.path.split('/').pop())]) ?? {}, 'scope')\n    const bases = insts.filter((i) => !isOverlay(i))\n    const okBases = bases.filter((i) => i.outcome === 'ok')\n    if (okBases.length !== 1) {\n      const reason =\n        // No base instance at all (overlay-only `fec`) is a count of 0, not\n        // the overlay's own issue.\n        okBases.length > 1 || bases.length === 0\n          ? Object.freeze({ code: 'fec_base_instances' as const, path: at(`/tracks/${ti}/fec`), outcome: 'violation' as const })\n          : why(bases[0] ?? insts[0]!)\n      out.set(name, Object.freeze({ status: 'unavailable', track: name, pointer: pointers[ti]!, reason }))\n      return\n    }\n    const b = okBases[0]!\n    const base = geometry(recordOf(fec[Number(b.path.split('/').pop())])!, b.instanceId!, nameAt(b.symbolTrack))\n    const priorityOf = (i: number | null) => {\n      const p = i === null ? undefined : trackAt(i)['priority']\n      return typeof p === 'number' ? p : DEFAULT_FEC_REPAIR_PRIORITY\n    }\n    const layers: FecLayerBinding[] = [\n      { layer: 0, repairTrackName: base.repairTrack, repairSymbols: base.repairSymbols, rsIdOffset: 0, priority: priorityOf(b.repairTrack) },\n    ]\n    const more = b.boundRepairTracks\n      .map((tj) => ({ tj, layer: trackAt(tj)['repairLayer'] as number }))\n      .sort((x, y) => x.layer - y.layer)\n    let offset = base.repairSymbols\n    for (const { tj, layer } of more) {\n      const repairSymbols = trackAt(tj)['repairSymbols'] as number\n      layers.push({ layer, repairTrackName: nameAt(tj)!, repairSymbols, rsIdOffset: offset, priority: priorityOf(tj) })\n      offset += repairSymbols\n    }\n    let overlay: FecOverlayBinding | undefined\n    let overlayUnavailable: FecBindingUnavailable | undefined\n    const ov = insts.find(isOverlay)\n    if (ov?.outcome === 'ok') {\n      const g = geometry(recordOf(fec[Number(ov.path.split('/').pop())])!, ov.instanceId!, nameAt(ov.symbolTrack))\n      overlay = Object.freeze({\n        repairTrackName: g.repairTrack,\n        scope: 'keyframe' as const,\n        sourceSymbols: g.sourceSymbols,\n        repairSymbols: g.repairSymbols,\n        priority: priorityOf(ov.repairTrack),\n        geometry: g,\n      })\n    } else if (ov) overlayUnavailable = why(ov)\n    out.set(\n      name,\n      Object.freeze({\n        status: 'ok' as const,\n        track: name,\n        pointer: pointers[ti]!,\n        base,\n        layers: Object.freeze(layers.map((l) => Object.freeze(l))),\n        totalBaseRepairSymbols: offset,\n        ...(overlay ? { overlay } : {}),\n        ...(overlayUnavailable ? { overlayUnavailable } : {}),\n      }),\n    )\n  })\n  return out\n}\n\n// The validator passed this instance for this receiver, so every member read\n// here is present and in range.\nfunction geometry(o: Obj, instanceId: number, symbolTrack: string | undefined): FecInstanceGeometry {\n  return Object.freeze({\n    instanceId,\n    scheme: o['scheme'] as 'raptorq' | 'reed-solomon',\n    blockProfile: o['blockProfile'] as string,\n    sourceSymbols: o['sourceSymbols'] as number,\n    repairSymbols: o['repairSymbols'] as number,\n    symbolSize: o['symbolSize'] as number,\n    ...(typeof o['interleaveDepthMs'] === 'number' ? { interleaveDepthMs: o['interleaveDepthMs'] } : {}),\n    ...(typeof o['reorderToleranceMs'] === 'number' ? { reorderToleranceMs: o['reorderToleranceMs'] } : {}),\n    repairTrack: o['repairTrack'] as string,\n    ...(symbolTrack !== undefined ? { symbolTrack } : {}),\n  })\n}\n", "/**\n * iso-ssbg1-v1 block location for one FEC stream (BLO-35597 iso:2/iso:3/iso:5).\n *\n * Under ISO/IEC 23008-1 C.5.2 the SS_ID increments by one per FEC source\n * packet and wraps at 2^32, and a block is the SS_ID range\n * `[SS_Start, SS_Start + SSB_length)` its Repair FEC Payload ID states (C.5.3).\n * Block lengths vary, so `floor(SS_ID / K)` locates nothing: a source symbol\n * belongs to a block only once a repair symbol has stated that block's range.\n * A source that arrives first is held, unplaced, and handed back when a repair\n * places it. Nothing here guesses a boundary.\n *\n * Coverage grows contiguously from the first block a repair states. When a\n * repair states a block that starts after the end of known coverage, the SS_IDs\n * between are one or more blocks whose every repair symbol was lost: they are\n * kept as one repair-less span, which completes clean once all of its SS_IDs\n * arrived (C.5.2 makes a gap in consecutive SS_IDs directly visible) and\n * otherwise resolves through its catalog-derived deadline. A block without\n * repair completes that way, on the next block's SS_Start, never on a count of\n * K source symbols, unless a repair that arrives later (a FETCH of the span's\n * first group) states exactly the span's range: the span was that one block.\n */\nimport {\n  isoBlockContains,\n  isoBlockEnd,\n  isoBlocksBehindLowerBound,\n  serial32Add,\n  serial32Distance,\n  serial32Precedes,\n} from '@blockcast/mmt-base'\n\n/** One block (or repair-less span) the locator knows the exact range of. */\nexport interface IsoBlockRange {\n  readonly start: number\n  readonly length: number\n  /** True for SS_IDs between two stated blocks whose own repair never came. */\n  readonly span: boolean\n}\n\n/** A held source symbol handed back with its block coordinate. */\nexport interface IsoPlacedSource<T> {\n  readonly ssId: number\n  readonly esi: number\n  readonly payload: T\n}\n\n/** What one repair symbol's `(SS_Start, SSB_length)` did to the locator. */\nexport type IsoRepairPlacement<T> =\n  | {\n      readonly status: 'placed'\n      readonly block: IsoBlockRange\n      /** Sources this repair placed into `block`, in SS_ID order. */\n      readonly placed: readonly IsoPlacedSource<T>[]\n      /** The repair-less span this repair closed in front of `block`, if any. */\n      readonly span?: { readonly block: IsoBlockRange; readonly placed: readonly IsoPlacedSource<T>[] }\n      /**\n       * With `deferIncompleteGaps`: the SS_IDs in front of `block` whose every\n       * repair was lost and some source too, kept as a pending hole instead of\n       * a span (see `closeHolesWithin`). `lostSsId` is the highest missing one.\n       */\n      readonly hole?: { readonly block: IsoBlockRange; readonly lostSsId: number }\n    }\n  /**\n   * Not a block this stream can use; the repair symbol is dropped. `ofSpan` is\n   * set when the repair stated only the first block of that repair-less span:\n   * the span holds more than one block, so no single repair group completes it.\n   */\n  | {\n      readonly status: 'conflict' | 'overlap' | 'stale' | 'ahead'\n      readonly reason: string\n      readonly ofSpan?: IsoBlockRange\n    }\n\n/**\n * Retention: the locator is never without one. Every call that can grow it\n * (`hold`, `placeRepair`) retires, behind the position it just saw, every\n * block, span and held source more than `retentionBlocks` blocks back, by the\n * one ISO horizon metric (`isoBlocksBehindLowerBound`). A held source stays\n * while a pending hole holding it does: the hole's repair FETCH may still\n * state its block, and closing the hole places it, so the span it leaves\n * counts every source it received (BLO-52085). A pending hole the horizon\n * passes stops being pending (its blocks can no longer be stated, and the\n * release gate no longer waits for it), but keeps its sources until its\n * owner closes it (`takeExpiredHoles`), so it still fails as the span it\n * is. A block is measured\n * from its last SS_ID, so it stays while any SS_ID of it is inside the\n * horizon: a repair-less span has no length bound, and one measured from its\n * start could be retired the moment it is created, before the sources it\n * placed are fed. Held sources are additionally capped at the SS_IDs the\n * horizon spans (`(retentionBlocks + 1) * kMax`): consecutive SS_IDs (C.5.2)\n * cannot hold more inside it, so the cap only ever bites on a stream whose\n * SS_IDs are not consecutive, and then the oldest arrival goes first.\n */\nexport class IsoBlockLocator<T> {\n  /** Known blocks and spans, in serial order of their start. */\n  readonly #blocks: IsoBlockRange[] = []\n  /** Held first-arrival sources whose block no repair has stated yet. */\n  readonly #held = new Map<number, T>()\n  /** End of contiguous coverage: the SS_ID the next unknown block starts at. */\n  #coverageEnd: number | undefined\n  readonly #kMax: number\n  #retentionBlocks: number\n  #heldEvicted = 0\n  #newest: number | undefined\n  #newestSource: number | undefined\n  /** Pending holes (see `deferIncompleteGaps`): unstated, sources still held. */\n  readonly #holes: IsoBlockRange[] = []\n  /** Holes the horizon passed while pending: sources held until closed. */\n  readonly #expired: IsoBlockRange[] = []\n  /** Of `#expired`, those `takeExpiredHoles` has not handed out yet. */\n  readonly #newlyExpired: IsoBlockRange[] = []\n  /**\n   * Spans closed from expired holes: behind the horizon, so kept only for\n   * `locate` while their sources are fed, until the next retirement.\n   */\n  readonly #closedBehind: IsoBlockRange[] = []\n  /**\n   * Keep a gap that is missing a source as a pending hole rather than a span,\n   * so a repair FETCHed for it (draft-ramadan-moq-fec \u00A77.5) can still state\n   * its blocks. Set only while a range repair scheduler is wired; its owner\n   * must close every hole it is told about (`closeHolesWithin`).\n   */\n  deferIncompleteGaps = false\n\n  /**\n   * @param kMax the catalog maximum K (`sourceSymbols`), the bound on SSB_length.\n   * @param retentionBlocks how many blocks behind the newest position the\n   *   locator keeps, derived by its owner from catalog timing; required, so\n   *   no locator exists without retention.\n   */\n  constructor(kMax: number, retentionBlocks: number) {\n    if (!Number.isSafeInteger(kMax) || kMax <= 0) {\n      throw new Error(`[IsoBlockLocator] maximum K must be a positive integer (got ${kMax})`)\n    }\n    this.#kMax = kMax\n    this.#retentionBlocks = IsoBlockLocator.#checkedRetention(retentionBlocks)\n  }\n\n  static #checkedRetention(retentionBlocks: number): number {\n    if (!Number.isSafeInteger(retentionBlocks) || retentionBlocks <= 0) {\n      throw new Error(\n        `[IsoBlockLocator] retention must be a positive integer number of blocks (got ${retentionBlocks})`,\n      )\n    }\n    return retentionBlocks\n  }\n\n  get kMax(): number {\n    return this.#kMax\n  }\n\n  /** Blocks behind the newest position the locator keeps. */\n  get retentionBlocks(): number {\n    return this.#retentionBlocks\n  }\n\n  /** Update the retention when the catalog timing it derives from changes. */\n  set retentionBlocks(retentionBlocks: number) {\n    this.#retentionBlocks = IsoBlockLocator.#checkedRetention(retentionBlocks)\n  }\n\n  /** The most sources held at once: the SS_IDs the retention horizon spans. */\n  get heldCapacity(): number {\n    return (this.#retentionBlocks + 1) * this.#kMax\n  }\n\n  /**\n   * The newest position the stream has reached (RFC 1982 order): the newest\n   * SS_ID of a source held, or fed once located (`observe`), or SS_Start of a\n   * placed repair, so no source the stream has fed follows it. Undefined\n   * before the first one.\n   */\n  get newest(): number | undefined {\n    return this.#newest\n  }\n\n  /** Advance `newest` to `position` if it is newer; retires nothing. */\n  observe(position: number): void {\n    if (this.#newest === undefined || serial32Precedes(this.#newest, position)) this.#newest = position\n  }\n\n  /**\n   * The newest source SS_ID noted with `noteSource` (RFC 1982 order). Unlike\n   * `newest`, a repair never moves it: a repair can run ahead of its sources,\n   * a source cannot run ahead of the sources sent before it except by\n   * reordering.\n   */\n  get newestSource(): number | undefined {\n    return this.#newestSource\n  }\n\n  /** Note a received source's SS_ID; true when it is the newest one yet. */\n  noteSource(ssId: number): boolean {\n    if (this.#newestSource !== undefined && !serial32Precedes(this.#newestSource, ssId)) return false\n    this.#newestSource = ssId\n    return true\n  }\n\n  /** Held sources evicted by `heldCapacity` (never by the horizon itself). */\n  get heldEvicted(): number {\n    return this.#heldEvicted\n  }\n\n  /** Number of known blocks and spans. */\n  get blockCount(): number {\n    return this.#blocks.length\n  }\n\n  /** End of contiguous coverage, or undefined before the first repair. */\n  get coverageEnd(): number | undefined {\n    return this.#coverageEnd\n  }\n\n  /** Number of sources held for a block no repair has stated yet. */\n  get heldCount(): number {\n    return this.#held.size\n  }\n\n  /** The known block or span containing `ssId`, with its ESI. */\n  locate(ssId: number): { block: IsoBlockRange; esi: number } | null {\n    for (const blocks of [this.#blocks, this.#closedBehind]) {\n      for (let i = blocks.length - 1; i >= 0; i--) {\n        const block = blocks[i]!\n        if (isoBlockContains(block.start, block.length, ssId)) {\n          return { block, esi: serial32Distance(block.start, ssId) }\n        }\n      }\n    }\n    return null\n  }\n\n  /** Number of holes not closed yet, pending or past the horizon. */\n  get holeCount(): number {\n    return this.#holes.length + this.#expired.length\n  }\n\n  /**\n   * The pending holes the horizon has passed since the last call, in the\n   * order it passed them. Each is no longer pending: no repair states a block\n   * in it (that repair is `stale`, as for a span the horizon retired) and the\n   * release gate does not wait for it. Its owner must close it\n   * (`closeHolesWithin`), which turns it into a span that is not kept here.\n   */\n  takeExpiredHoles(): IsoBlockRange[] {\n    return this.#newlyExpired.splice(0)\n  }\n\n  /** The stated block (never a span) ending exactly at `end`. */\n  blockEndingAt(end: number): IsoBlockRange | undefined {\n    return this.#blocks.find((block) => !block.span && isoBlockEnd(block.start, block.length) === end)\n  }\n\n  /** The known block or span starting exactly at `start`. */\n  blockAt(start: number): IsoBlockRange | undefined {\n    return this.#blocks.find((block) => block.start === start)\n  }\n\n  /** Known blocks and spans overlapping the SS_IDs strictly between `a` and `b`. */\n  blocksBetween(a: number, b: number): IsoBlockRange[] {\n    const first = (a + 1) >>> 0\n    const count = serial32Distance(a, b) - 1\n    if (!serial32Precedes(a, b) || count <= 0) return []\n    return this.#blocks.filter((block) => {\n      const toBlock = serial32Distance(first, block.start)\n      const fromBlock = serial32Distance(block.start, first)\n      return toBlock < count || fromBlock < block.length\n    })\n  }\n\n  /**\n   * Whether every SS_ID strictly between `a` and `b` lies in known coverage,\n   * so no block that could hold them is still to be stated by a repair.\n   */\n  coversBetween(a: number, b: number): boolean {\n    if (this.#coverageEnd === undefined) return false\n    if (!serial32Precedes(a, b) || serial32Distance(a, b) <= 1) return true\n    // A pending hole may still be stated by a FETCHed repair.\n    const first = (a + 1) >>> 0\n    const count = serial32Distance(a, b) - 1\n    if (this.#holes.some((hole) => isoRangesOverlap(first, count, hole.start, hole.length))) return false\n    // The last SS_ID strictly before b must precede the coverage end.\n    return serial32Precedes((b - 1) >>> 0, this.#coverageEnd)\n  }\n\n  /**\n   * Hold a first-arrival source symbol whose block is not yet known. Returns\n   * false for a second copy of an SS_ID already held, so the first copy wins.\n   * Retires behind `ssId` (see the class note).\n   */\n  hold(ssId: number, payload: T): boolean {\n    if (this.#held.has(ssId)) return false\n    this.#held.set(ssId, payload)\n    this.retireBehind(ssId)\n    for (const oldest of this.#held.keys()) {\n      if (this.#held.size <= this.heldCapacity) break\n      this.#held.delete(oldest)\n      this.#heldEvicted++\n    }\n    return true\n  }\n\n  /** Whether `ssId` is held unplaced. */\n  isHeld(ssId: number): boolean {\n    return this.#held.has(ssId)\n  }\n\n  /**\n   * Apply one repair symbol's `(SS_Start, SSB_length)`. The first repair of a\n   * block states its range and places every held source in it; later repair\n   * symbols of the same block change nothing. A repair whose range is exactly\n   * a repair-less span states that span's one block. A range that contradicts\n   * a known block (a different length, or an overlap with another block or\n   * with part of a span) fails closed: the repair symbol is dropped and no\n   * block changes.\n   * A newly stated block retires behind its SS_Start (see the class note).\n   * A block so far past `newest` that stating it would retire the position\n   * `newest` is refused as `ahead`. When `newest` is a placed block's SS_Start\n   * this is slightly conservative (retirement measures that block from its\n   * last SS_ID), dropping up to one block-length of repairs past the horizon\n   * until a source moves `newest`. Placing it would turn everything\n   * between into a repair-less span and leave every real repair behind it\n   * `stale`. Sources move `newest` (`hold`, `observe`), so after a real outage\n   * the first source back brings the next repair inside the horizon; until one\n   * arrives, a stream's repairs alone cannot pass it.\n   */\n  placeRepair(start: number, length: number): IsoRepairPlacement<T> {\n    if (!Number.isSafeInteger(length) || length <= 0 || length > this.#kMax) {\n      return { status: 'conflict', reason: `SSB_length ${length} is outside 1..${this.#kMax}` }\n    }\n    const known = this.blockAt(start)\n    if (known !== undefined) {\n      if (known.span) {\n        // A span is no accepted block: it is the whole blocks between two\n        // stated ones whose repair never came (blocks are consecutive), so a\n        // repair whose range is exactly the span states its one block and\n        // contradicts nothing (draft-ramadan-moq-fec-core-00 5.4). Its sources\n        // were placed at these same ESIs when the span closed. A FETCH of the\n        // span's Group ext(SS_Start) returns just this when one block lost\n        // every multicast repair (a join).\n        if (known.length === length) {\n          const block: IsoBlockRange = { start, length, span: false }\n          this.#blocks[this.#blocks.indexOf(known)] = block\n          return { status: 'placed', block, placed: [] }\n        }\n        return length < known.length\n          ? {\n              status: 'overlap',\n              reason: `repair block ${start}+${length} is only the first block of repair-less span ${known.start}+${known.length}`,\n              ofSpan: known,\n            }\n          : { status: 'overlap', reason: `repair block ${start}+${length} runs past repair-less span ${known.start}+${known.length}` }\n      }\n      if (known.length !== length) {\n        return {\n          status: 'conflict',\n          reason: `repair SSB_length ${length} conflicts with ${known.length} for SS_Start ${start}`,\n        }\n      }\n      return { status: 'placed', block: known, placed: [] }\n    }\n    const pending = this.#holes.find((h) => isoBlockContains(h.start, h.length, start))\n    if (pending !== undefined) {\n      if (!isoBlockContains(pending.start, pending.length, serial32Add(start, length - 1))) {\n        return { status: 'overlap', reason: `repair block ${start}+${length} runs past pending hole ${pending.start}+${pending.length}` }\n      }\n      // A FETCHed repair stated a block inside a pending hole: split the hole round it.\n      this.#holes.splice(this.#holes.indexOf(pending), 1)\n      const before = serial32Distance(pending.start, start)\n      const afterStart = isoBlockEnd(start, length)\n      const after = pending.length - before - length\n      if (before > 0) this.#holes.push({ start: pending.start, length: before, span: false })\n      if (after > 0) this.#holes.push({ start: afterStart, length: after, span: false })\n      const block: IsoBlockRange = { start, length, span: false }\n      const placed = this.#claim(block)\n      this.#blocks.push(block)\n      return { status: 'placed', block, placed }\n    }\n    for (const block of this.#blocks) {\n      if (\n        isoBlockContains(block.start, block.length, start) ||\n        isoBlockContains(start, length, block.start)\n      ) {\n        return {\n          status: 'overlap',\n          reason: `repair block ${start}+${length} overlaps known block ${block.start}+${block.length}`,\n        }\n      }\n    }\n    if (this.#newest !== undefined && isoBlocksBehindLowerBound(this.#newest, start, this.#kMax) > this.#retentionBlocks) {\n      return { status: 'ahead', reason: `repair block ${start}+${length} is past the retention horizon ahead of ${this.#newest}` }\n    }\n    let span: { block: IsoBlockRange; placed: IsoPlacedSource<T>[] } | undefined\n    let hole: { block: IsoBlockRange; lostSsId: number } | undefined\n    if (this.#coverageEnd === undefined) {\n      // Reception starts at the first stated block. Held sources before it\n      // are the tail of blocks that began before the join: their range is\n      // never stated, so they are not FEC symbols of this receiver.\n      for (const ssId of this.#held.keys()) {\n        if (serial32Precedes(ssId, start)) this.#held.delete(ssId)\n      }\n      this.#coverageEnd = start\n    } else if (serial32Precedes(start, this.#coverageEnd)) {\n      return { status: 'stale', reason: `repair block ${start}+${length} precedes known coverage` }\n    } else if (start !== this.#coverageEnd) {\n      const gap = { start: this.#coverageEnd, length: serial32Distance(this.#coverageEnd, start) }\n      const lostSsId = this.deferIncompleteGaps ? this.#highestMissing(gap.start, gap.length) : undefined\n      if (lostSsId !== undefined) {\n        const holeBlock: IsoBlockRange = { ...gap, span: false }\n        this.#holes.push(holeBlock)\n        hole = { block: holeBlock, lostSsId }\n      } else {\n        const spanBlock: IsoBlockRange = { ...gap, span: true }\n        span = { block: spanBlock, placed: this.#claim(spanBlock) }\n        this.#blocks.push(spanBlock)\n      }\n    }\n    const block: IsoBlockRange = { start, length, span: false }\n    const placed = this.#claim(block)\n    this.#blocks.push(block)\n    this.#coverageEnd = isoBlockEnd(start, length)\n    this.retireBehind(start)\n    if (hole !== undefined) return { status: 'placed', block, placed, hole }\n    return span === undefined\n      ? { status: 'placed', block, placed }\n      : { status: 'placed', block, placed, span }\n  }\n\n  /**\n   * Turn every hole inside `[start, start + length)` into a repair-less span,\n   * claiming its held sources: its range FETCH ended, so nothing more will\n   * state its blocks. A hole the horizon passed (`takeExpiredHoles`) leaves a\n   * span that is not kept among the blocks, as the horizon would retire it at\n   * once; only `locate` finds it, until the next retirement, so its sources\n   * can be fed. Returns the spans, in SS_ID order.\n   */\n  closeHolesWithin(start: number, length: number): { block: IsoBlockRange; placed: IsoPlacedSource<T>[] }[] {\n    const closed: { block: IsoBlockRange; placed: IsoPlacedSource<T>[] }[] = []\n    for (const holes of [this.#holes, this.#expired]) {\n      for (const hole of [...holes]) {\n        if (!isoBlockContains(start, length, hole.start)) continue\n        holes.splice(holes.indexOf(hole), 1)\n        const spanBlock: IsoBlockRange = { start: hole.start, length: hole.length, span: true }\n        closed.push({ block: spanBlock, placed: this.#claim(spanBlock) })\n        if (holes === this.#holes) {\n          this.#blocks.push(spanBlock)\n        } else {\n          this.#closedBehind.push(spanBlock)\n          if (this.#newlyExpired.includes(hole)) this.#newlyExpired.splice(this.#newlyExpired.indexOf(hole), 1)\n        }\n      }\n    }\n    return closed.sort((x, y) => serial32Distance(start, x.block.start) - serial32Distance(start, y.block.start))\n  }\n\n  /** The highest SS_ID in the range no source is held for, or undefined when all are. */\n  #highestMissing(start: number, length: number): number | undefined {\n    // Every position past the held count cannot all be held: bounded scan.\n    const steps = Math.min(length, this.#held.size + 1)\n    for (let i = 1; i <= steps; i++) {\n      const ssId = serial32Add(start, length - i)\n      if (!this.#held.has(ssId)) return ssId\n    }\n    return undefined\n  }\n\n  /**\n   * Retire every block and span whose last SS_ID, and every held source\n   * outside a hole, lies more than `retentionBlocks` blocks behind\n   * `position`, with the shared lower-bound metric (`isoBlocksBehindLowerBound`)\n   * every ISO interleave horizon uses; a pending hole so far behind expires\n   * (`takeExpiredHoles`). Returns the retired block starts.\n   */\n  retireBehind(position: number): number[] {\n    this.observe(position)\n    const horizon = this.#retentionBlocks\n    const retired: number[] = []\n    this.#closedBehind.length = 0\n    for (let i = this.#blocks.length - 1; i >= 0; i--) {\n      const block = this.#blocks[i]!\n      const last = serial32Add(block.start, block.length - 1)\n      if (isoBlocksBehindLowerBound(last, position, this.#kMax) > horizon) {\n        retired.push(block.start)\n        this.#blocks.splice(i, 1)\n      }\n    }\n    for (let i = this.#holes.length - 1; i >= 0; i--) {\n      const hole = this.#holes[i]!\n      const last = serial32Add(hole.start, hole.length - 1)\n      if (isoBlocksBehindLowerBound(last, position, this.#kMax) <= horizon) continue\n      this.#holes.splice(i, 1)\n      this.#expired.push(hole)\n      this.#newlyExpired.push(hole)\n    }\n    // A held source stays while a hole holding it does (class note).\n    for (const ssId of [...this.#held.keys()]) {\n      if (\n        isoBlocksBehindLowerBound(ssId, position, this.#kMax) > horizon &&\n        !this.#holes.some((hole) => isoBlockContains(hole.start, hole.length, ssId)) &&\n        !this.#expired.some((hole) => isoBlockContains(hole.start, hole.length, ssId))\n      ) {\n        this.#held.delete(ssId)\n      }\n    }\n    return retired\n  }\n\n  /** Forget everything (publisher restart, track reset). */\n  reset(): void {\n    this.#blocks.length = 0\n    this.#holes.length = 0\n    this.#expired.length = 0\n    this.#newlyExpired.length = 0\n    this.#closedBehind.length = 0\n    this.#held.clear()\n    this.#coverageEnd = undefined\n    this.#newest = undefined\n    this.#newestSource = undefined\n  }\n\n  #claim(block: IsoBlockRange): IsoPlacedSource<T>[] {\n    const placed: IsoPlacedSource<T>[] = []\n    for (const [ssId, payload] of this.#held) {\n      if (!isoBlockContains(block.start, block.length, ssId)) continue\n      placed.push({ ssId, esi: serial32Distance(block.start, ssId), payload })\n      this.#held.delete(ssId)\n    }\n    placed.sort((x, y) => x.esi - y.esi)\n    return placed\n  }\n}\n\n/** Whether `[aStart, aStart + aLength)` and `[bStart, bStart + bLength)` share an SS_ID. */\nfunction isoRangesOverlap(aStart: number, aLength: number, bStart: number, bLength: number): boolean {\n  return serial32Distance(aStart, bStart) < aLength || serial32Distance(bStart, aStart) < bLength\n}\n"],
+  "mappings": ";AAsEO,IAAM,kBAAkB;AAI/B,IAAM,wBAAwB;AAC9B,IAAM,4BAA4B,kBAAkB;;;AC9D7C,IAAM,iBAAiB;AAGvB,IAAM,oBAAoB,KAAK;AAQ/B,IAAM,uBAAuB,MAAM,iBAAiB;;;ACXpD,IAAM,gBAAgB;AAGtB,IAAM,gBAAgB;AAE7B,SAAS,aAAa,OAAe,MAAY;AAC/C,MAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,KAAK,SAAS,eAAe;AACnE,UAAM,IAAI,WAAW,GAAG,IAAI,0BAA0B,KAAK,GAAG;EAChE;AACF;AAMM,SAAU,YAAY,GAAW,GAAS;AAC9C,eAAa,GAAG,GAAG;AACnB,MAAI,CAAC,OAAO,UAAU,CAAC,KAAK,KAAK,CAAC,iBAAiB,KAAK,eAAe;AACrE,UAAM,IAAI,WAAW,gDAAgD,CAAC,GAAG;EAC3E;AACA,UAAQ,IAAI,IAAI,iBAAiB;AACnC;AAGM,SAAU,iBAAiB,MAAc,IAAU;AACvD,SAAQ,KAAK,SAAU;AACzB;AAMM,SAAU,iBAAiB,GAAW,GAAS;AACnD,QAAM,WAAW,iBAAiB,GAAG,CAAC;AACtC,SAAO,aAAa,KAAK,WAAW;AACtC;;;ACfO,IAAM,qBAAiD,OAAO,OAAO;EAC1E;CACD;AAmFK,SAAU,YAAY,SAAiB,WAAiB;AAC5D,SAAO,YAAY,SAAS,SAAS;AACvC;AAMM,SAAU,iBAAiB,SAAiB,WAAmB,MAAY;AAC/E,SAAO,iBAAiB,SAAS,IAAI,IAAI;AAC3C;AAWM,SAAU,0BAA0B,GAAW,GAAW,MAAY;AAC1E,MAAI,CAAC,OAAO,cAAc,IAAI,KAAK,QAAQ,GAAG;AAC5C,UAAM,IAAI,MAAM,8DAA8D,IAAI,GAAG;EACvF;AACA,SAAO,iBAAiB,GAAG,CAAC,IAAI,KAAK,MAAM,iBAAiB,GAAG,CAAC,IAAI,IAAI,IAAI;AAC9E;;;ACtHO,IAAM,uBAA2C,OAAO,OAAO;EACpE,SAAS,OAAO,OAAO,CAAC,WAAW,cAAc,CAAC;EAClD,eAAe,OAAO,OAAO,CAAC,cAAc,CAAC;EAC7C,UAAU;CACX;;;AC8DM,IAAM,kBAAN,MAAM,iBAAmB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAqC9B,YAAY,MAAc,iBAAyB;AAnCnD;AAAA,SAAS,UAA2B,CAAC;AAErC;AAAA,SAAS,QAAQ,oBAAI,IAAe;AAKpC,wBAAe;AAIf;AAAA,SAAS,SAA0B,CAAC;AAEpC;AAAA,SAAS,WAA4B,CAAC;AAEtC;AAAA,SAAS,gBAAiC,CAAC;AAK3C;AAAA;AAAA;AAAA;AAAA,SAAS,gBAAiC,CAAC;AAO3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,+BAAsB;AASpB,QAAI,CAAC,OAAO,cAAc,IAAI,KAAK,QAAQ,GAAG;AAC5C,YAAM,IAAI,MAAM,+DAA+D,IAAI,GAAG;AAAA,IACxF;AACA,SAAK,QAAQ;AACb,SAAK,mBAAmB,iBAAgB,kBAAkB,eAAe;AAAA,EAC3E;AAAA,EAzCS;AAAA,EAEA;AAAA;AAAA,EAET;AAAA,EACS;AAAA,EACT;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAES;AAAA,EAEA;AAAA,EAEA;AAAA,EAKA;AAAA,EAuBT,OAAO,kBAAkB,iBAAiC;AACxD,QAAI,CAAC,OAAO,cAAc,eAAe,KAAK,mBAAmB,GAAG;AAClE,YAAM,IAAI;AAAA,QACR,gFAAgF,eAAe;AAAA,MACjG;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA,EAEA,IAAI,OAAe;AACjB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,kBAA0B;AAC5B,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,gBAAgB,iBAAyB;AAC3C,SAAK,mBAAmB,iBAAgB,kBAAkB,eAAe;AAAA,EAC3E;AAAA;AAAA,EAGA,IAAI,eAAuB;AACzB,YAAQ,KAAK,mBAAmB,KAAK,KAAK;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAI,SAA6B;AAC/B,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,QAAQ,UAAwB;AAC9B,QAAI,KAAK,YAAY,UAAa,iBAAiB,KAAK,SAAS,QAAQ,EAAG,MAAK,UAAU;AAAA,EAC7F;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAI,eAAmC;AACrC,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,WAAW,MAAuB;AAChC,QAAI,KAAK,kBAAkB,UAAa,CAAC,iBAAiB,KAAK,eAAe,IAAI,EAAG,QAAO;AAC5F,SAAK,gBAAgB;AACrB,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,IAAI,cAAsB;AACxB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,aAAqB;AACvB,WAAO,KAAK,QAAQ;AAAA,EACtB;AAAA;AAAA,EAGA,IAAI,cAAkC;AACpC,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,YAAoB;AACtB,WAAO,KAAK,MAAM;AAAA,EACpB;AAAA;AAAA,EAGA,OAAO,MAA4D;AACjE,eAAW,UAAU,CAAC,KAAK,SAAS,KAAK,aAAa,GAAG;AACvD,eAAS,IAAI,OAAO,SAAS,GAAG,KAAK,GAAG,KAAK;AAC3C,cAAM,QAAQ,OAAO,CAAC;AACtB,YAAI,iBAAiB,MAAM,OAAO,MAAM,QAAQ,IAAI,GAAG;AACrD,iBAAO,EAAE,OAAO,KAAK,iBAAiB,MAAM,OAAO,IAAI,EAAE;AAAA,QAC3D;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,IAAI,YAAoB;AACtB,WAAO,KAAK,OAAO,SAAS,KAAK,SAAS;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,mBAAoC;AAClC,WAAO,KAAK,cAAc,OAAO,CAAC;AAAA,EACpC;AAAA;AAAA,EAGA,cAAc,KAAwC;AACpD,WAAO,KAAK,QAAQ,KAAK,CAAC,UAAU,CAAC,MAAM,QAAQ,YAAY,MAAM,OAAO,MAAM,MAAM,MAAM,GAAG;AAAA,EACnG;AAAA;AAAA,EAGA,QAAQ,OAA0C;AAChD,WAAO,KAAK,QAAQ,KAAK,CAAC,UAAU,MAAM,UAAU,KAAK;AAAA,EAC3D;AAAA;AAAA,EAGA,cAAc,GAAW,GAA4B;AACnD,UAAM,QAAS,IAAI,MAAO;AAC1B,UAAM,QAAQ,iBAAiB,GAAG,CAAC,IAAI;AACvC,QAAI,CAAC,iBAAiB,GAAG,CAAC,KAAK,SAAS,EAAG,QAAO,CAAC;AACnD,WAAO,KAAK,QAAQ,OAAO,CAAC,UAAU;AACpC,YAAM,UAAU,iBAAiB,OAAO,MAAM,KAAK;AACnD,YAAM,YAAY,iBAAiB,MAAM,OAAO,KAAK;AACrD,aAAO,UAAU,SAAS,YAAY,MAAM;AAAA,IAC9C,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,cAAc,GAAW,GAAoB;AAC3C,QAAI,KAAK,iBAAiB,OAAW,QAAO;AAC5C,QAAI,CAAC,iBAAiB,GAAG,CAAC,KAAK,iBAAiB,GAAG,CAAC,KAAK,EAAG,QAAO;AAEnE,UAAM,QAAS,IAAI,MAAO;AAC1B,UAAM,QAAQ,iBAAiB,GAAG,CAAC,IAAI;AACvC,QAAI,KAAK,OAAO,KAAK,CAAC,SAAS,iBAAiB,OAAO,OAAO,KAAK,OAAO,KAAK,MAAM,CAAC,EAAG,QAAO;AAEhG,WAAO,iBAAkB,IAAI,MAAO,GAAG,KAAK,YAAY;AAAA,EAC1D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,KAAK,MAAc,SAAqB;AACtC,QAAI,KAAK,MAAM,IAAI,IAAI,EAAG,QAAO;AACjC,SAAK,MAAM,IAAI,MAAM,OAAO;AAC5B,SAAK,aAAa,IAAI;AACtB,eAAW,UAAU,KAAK,MAAM,KAAK,GAAG;AACtC,UAAI,KAAK,MAAM,QAAQ,KAAK,aAAc;AAC1C,WAAK,MAAM,OAAO,MAAM;AACxB,WAAK;AAAA,IACP;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,OAAO,MAAuB;AAC5B,WAAO,KAAK,MAAM,IAAI,IAAI;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAqBA,YAAY,OAAe,QAAuC;AAChE,QAAI,CAAC,OAAO,cAAc,MAAM,KAAK,UAAU,KAAK,SAAS,KAAK,OAAO;AACvE,aAAO,EAAE,QAAQ,YAAY,QAAQ,cAAc,MAAM,kBAAkB,KAAK,KAAK,GAAG;AAAA,IAC1F;AACA,UAAM,QAAQ,KAAK,QAAQ,KAAK;AAChC,QAAI,UAAU,QAAW;AACvB,UAAI,MAAM,MAAM;AAQd,YAAI,MAAM,WAAW,QAAQ;AAC3B,gBAAMA,SAAuB,EAAE,OAAO,QAAQ,MAAM,MAAM;AAC1D,eAAK,QAAQ,KAAK,QAAQ,QAAQ,KAAK,CAAC,IAAIA;AAC5C,iBAAO,EAAE,QAAQ,UAAU,OAAAA,QAAO,QAAQ,CAAC,EAAE;AAAA,QAC/C;AACA,eAAO,SAAS,MAAM,SAClB;AAAA,UACE,QAAQ;AAAA,UACR,QAAQ,gBAAgB,KAAK,IAAI,MAAM,gDAAgD,MAAM,KAAK,IAAI,MAAM,MAAM;AAAA,UAClH,QAAQ;AAAA,QACV,IACA,EAAE,QAAQ,WAAW,QAAQ,gBAAgB,KAAK,IAAI,MAAM,+BAA+B,MAAM,KAAK,IAAI,MAAM,MAAM,GAAG;AAAA,MAC/H;AACA,UAAI,MAAM,WAAW,QAAQ;AAC3B,eAAO;AAAA,UACL,QAAQ;AAAA,UACR,QAAQ,qBAAqB,MAAM,mBAAmB,MAAM,MAAM,iBAAiB,KAAK;AAAA,QAC1F;AAAA,MACF;AACA,aAAO,EAAE,QAAQ,UAAU,OAAO,OAAO,QAAQ,CAAC,EAAE;AAAA,IACtD;AACA,UAAM,UAAU,KAAK,OAAO,KAAK,CAAC,MAAM,iBAAiB,EAAE,OAAO,EAAE,QAAQ,KAAK,CAAC;AAClF,QAAI,YAAY,QAAW;AACzB,UAAI,CAAC,iBAAiB,QAAQ,OAAO,QAAQ,QAAQ,YAAY,OAAO,SAAS,CAAC,CAAC,GAAG;AACpF,eAAO,EAAE,QAAQ,WAAW,QAAQ,gBAAgB,KAAK,IAAI,MAAM,2BAA2B,QAAQ,KAAK,IAAI,QAAQ,MAAM,GAAG;AAAA,MAClI;AAEA,WAAK,OAAO,OAAO,KAAK,OAAO,QAAQ,OAAO,GAAG,CAAC;AAClD,YAAM,SAAS,iBAAiB,QAAQ,OAAO,KAAK;AACpD,YAAM,aAAa,YAAY,OAAO,MAAM;AAC5C,YAAM,QAAQ,QAAQ,SAAS,SAAS;AACxC,UAAI,SAAS,EAAG,MAAK,OAAO,KAAK,EAAE,OAAO,QAAQ,OAAO,QAAQ,QAAQ,MAAM,MAAM,CAAC;AACtF,UAAI,QAAQ,EAAG,MAAK,OAAO,KAAK,EAAE,OAAO,YAAY,QAAQ,OAAO,MAAM,MAAM,CAAC;AACjF,YAAMA,SAAuB,EAAE,OAAO,QAAQ,MAAM,MAAM;AAC1D,YAAMC,UAAS,KAAK,OAAOD,MAAK;AAChC,WAAK,QAAQ,KAAKA,MAAK;AACvB,aAAO,EAAE,QAAQ,UAAU,OAAAA,QAAO,QAAAC,QAAO;AAAA,IAC3C;AACA,eAAWD,UAAS,KAAK,SAAS;AAChC,UACE,iBAAiBA,OAAM,OAAOA,OAAM,QAAQ,KAAK,KACjD,iBAAiB,OAAO,QAAQA,OAAM,KAAK,GAC3C;AACA,eAAO;AAAA,UACL,QAAQ;AAAA,UACR,QAAQ,gBAAgB,KAAK,IAAI,MAAM,yBAAyBA,OAAM,KAAK,IAAIA,OAAM,MAAM;AAAA,QAC7F;AAAA,MACF;AAAA,IACF;AACA,QAAI,KAAK,YAAY,UAAa,0BAA0B,KAAK,SAAS,OAAO,KAAK,KAAK,IAAI,KAAK,kBAAkB;AACpH,aAAO,EAAE,QAAQ,SAAS,QAAQ,gBAAgB,KAAK,IAAI,MAAM,2CAA2C,KAAK,OAAO,GAAG;AAAA,IAC7H;AACA,QAAI;AACJ,QAAI;AACJ,QAAI,KAAK,iBAAiB,QAAW;AAInC,iBAAW,QAAQ,KAAK,MAAM,KAAK,GAAG;AACpC,YAAI,iBAAiB,MAAM,KAAK,EAAG,MAAK,MAAM,OAAO,IAAI;AAAA,MAC3D;AACA,WAAK,eAAe;AAAA,IACtB,WAAW,iBAAiB,OAAO,KAAK,YAAY,GAAG;AACrD,aAAO,EAAE,QAAQ,SAAS,QAAQ,gBAAgB,KAAK,IAAI,MAAM,2BAA2B;AAAA,IAC9F,WAAW,UAAU,KAAK,cAAc;AACtC,YAAM,MAAM,EAAE,OAAO,KAAK,cAAc,QAAQ,iBAAiB,KAAK,cAAc,KAAK,EAAE;AAC3F,YAAM,WAAW,KAAK,sBAAsB,KAAK,gBAAgB,IAAI,OAAO,IAAI,MAAM,IAAI;AAC1F,UAAI,aAAa,QAAW;AAC1B,cAAM,YAA2B,EAAE,GAAG,KAAK,MAAM,MAAM;AACvD,aAAK,OAAO,KAAK,SAAS;AAC1B,eAAO,EAAE,OAAO,WAAW,SAAS;AAAA,MACtC,OAAO;AACL,cAAM,YAA2B,EAAE,GAAG,KAAK,MAAM,KAAK;AACtD,eAAO,EAAE,OAAO,WAAW,QAAQ,KAAK,OAAO,SAAS,EAAE;AAC1D,aAAK,QAAQ,KAAK,SAAS;AAAA,MAC7B;AAAA,IACF;AACA,UAAM,QAAuB,EAAE,OAAO,QAAQ,MAAM,MAAM;AAC1D,UAAM,SAAS,KAAK,OAAO,KAAK;AAChC,SAAK,QAAQ,KAAK,KAAK;AACvB,SAAK,eAAe,YAAY,OAAO,MAAM;AAC7C,SAAK,aAAa,KAAK;AACvB,QAAI,SAAS,OAAW,QAAO,EAAE,QAAQ,UAAU,OAAO,QAAQ,KAAK;AACvE,WAAO,SAAS,SACZ,EAAE,QAAQ,UAAU,OAAO,OAAO,IAClC,EAAE,QAAQ,UAAU,OAAO,QAAQ,KAAK;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,iBAAiB,OAAe,QAA0E;AACxG,UAAM,SAAmE,CAAC;AAC1E,eAAW,SAAS,CAAC,KAAK,QAAQ,KAAK,QAAQ,GAAG;AAChD,iBAAW,QAAQ,CAAC,GAAG,KAAK,GAAG;AAC7B,YAAI,CAAC,iBAAiB,OAAO,QAAQ,KAAK,KAAK,EAAG;AAClD,cAAM,OAAO,MAAM,QAAQ,IAAI,GAAG,CAAC;AACnC,cAAM,YAA2B,EAAE,OAAO,KAAK,OAAO,QAAQ,KAAK,QAAQ,MAAM,KAAK;AACtF,eAAO,KAAK,EAAE,OAAO,WAAW,QAAQ,KAAK,OAAO,SAAS,EAAE,CAAC;AAChE,YAAI,UAAU,KAAK,QAAQ;AACzB,eAAK,QAAQ,KAAK,SAAS;AAAA,QAC7B,OAAO;AACL,eAAK,cAAc,KAAK,SAAS;AACjC,cAAI,KAAK,cAAc,SAAS,IAAI,EAAG,MAAK,cAAc,OAAO,KAAK,cAAc,QAAQ,IAAI,GAAG,CAAC;AAAA,QACtG;AAAA,MACF;AAAA,IACF;AACA,WAAO,OAAO,KAAK,CAAC,GAAG,MAAM,iBAAiB,OAAO,EAAE,MAAM,KAAK,IAAI,iBAAiB,OAAO,EAAE,MAAM,KAAK,CAAC;AAAA,EAC9G;AAAA;AAAA,EAGA,gBAAgB,OAAe,QAAoC;AAEjE,UAAM,QAAQ,KAAK,IAAI,QAAQ,KAAK,MAAM,OAAO,CAAC;AAClD,aAAS,IAAI,GAAG,KAAK,OAAO,KAAK;AAC/B,YAAM,OAAO,YAAY,OAAO,SAAS,CAAC;AAC1C,UAAI,CAAC,KAAK,MAAM,IAAI,IAAI,EAAG,QAAO;AAAA,IACpC;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,aAAa,UAA4B;AACvC,SAAK,QAAQ,QAAQ;AACrB,UAAM,UAAU,KAAK;AACrB,UAAM,UAAoB,CAAC;AAC3B,SAAK,cAAc,SAAS;AAC5B,aAAS,IAAI,KAAK,QAAQ,SAAS,GAAG,KAAK,GAAG,KAAK;AACjD,YAAM,QAAQ,KAAK,QAAQ,CAAC;AAC5B,YAAM,OAAO,YAAY,MAAM,OAAO,MAAM,SAAS,CAAC;AACtD,UAAI,0BAA0B,MAAM,UAAU,KAAK,KAAK,IAAI,SAAS;AACnE,gBAAQ,KAAK,MAAM,KAAK;AACxB,aAAK,QAAQ,OAAO,GAAG,CAAC;AAAA,MAC1B;AAAA,IACF;AACA,aAAS,IAAI,KAAK,OAAO,SAAS,GAAG,KAAK,GAAG,KAAK;AAChD,YAAM,OAAO,KAAK,OAAO,CAAC;AAC1B,YAAM,OAAO,YAAY,KAAK,OAAO,KAAK,SAAS,CAAC;AACpD,UAAI,0BAA0B,MAAM,UAAU,KAAK,KAAK,KAAK,QAAS;AACtE,WAAK,OAAO,OAAO,GAAG,CAAC;AACvB,WAAK,SAAS,KAAK,IAAI;AACvB,WAAK,cAAc,KAAK,IAAI;AAAA,IAC9B;AAEA,eAAW,QAAQ,CAAC,GAAG,KAAK,MAAM,KAAK,CAAC,GAAG;AACzC,UACE,0BAA0B,MAAM,UAAU,KAAK,KAAK,IAAI,WACxD,CAAC,KAAK,OAAO,KAAK,CAAC,SAAS,iBAAiB,KAAK,OAAO,KAAK,QAAQ,IAAI,CAAC,KAC3E,CAAC,KAAK,SAAS,KAAK,CAAC,SAAS,iBAAiB,KAAK,OAAO,KAAK,QAAQ,IAAI,CAAC,GAC7E;AACA,aAAK,MAAM,OAAO,IAAI;AAAA,MACxB;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,QAAc;AACZ,SAAK,QAAQ,SAAS;AACtB,SAAK,OAAO,SAAS;AACrB,SAAK,SAAS,SAAS;AACvB,SAAK,cAAc,SAAS;AAC5B,SAAK,cAAc,SAAS;AAC5B,SAAK,MAAM,MAAM;AACjB,SAAK,eAAe;AACpB,SAAK,UAAU;AACf,SAAK,gBAAgB;AAAA,EACvB;AAAA,EAEA,OAAO,OAA4C;AACjD,UAAM,SAA+B,CAAC;AACtC,eAAW,CAAC,MAAM,OAAO,KAAK,KAAK,OAAO;AACxC,UAAI,CAAC,iBAAiB,MAAM,OAAO,MAAM,QAAQ,IAAI,EAAG;AACxD,aAAO,KAAK,EAAE,MAAM,KAAK,iBAAiB,MAAM,OAAO,IAAI,GAAG,QAAQ,CAAC;AACvE,WAAK,MAAM,OAAO,IAAI;AAAA,IACxB;AACA,WAAO,KAAK,CAAC,GAAG,MAAM,EAAE,MAAM,EAAE,GAAG;AACnC,WAAO;AAAA,EACT;AACF;AAGA,SAAS,iBAAiB,QAAgB,SAAiB,QAAgB,SAA0B;AACnG,SAAO,iBAAiB,QAAQ,MAAM,IAAI,WAAW,iBAAiB,QAAQ,MAAM,IAAI;AAC1F;",
   "names": ["block", "placed"]
 }

package/dist/iso-bmff-timing.d.ts

@@ -36,6 +36,8 @@ export declare class IsoBmffTimingResolver {
     #private;
     readonly maxPendingSamples: number;
     constructor(maxPendingSamples: number);
+    /** True once an FT=0 has bound the track that FT=1 timing is read against. */
+    get initialized(): boolean;
     get pendingSampleCount(): number;
     /**
      * Slots reclaimed by window displacement rather than by delivery or
@@ -47,7 +49,14 @@ export declare class IsoBmffTimingResolver {
     /** Typed reason for the most recent rejected movie fragment. */
     get lastMovieFragmentRejection(): IsoBmffMovieFragmentRejection | null;
     addInitialization(data: Uint8Array): boolean;
-    addMovieFragment(mpuSequenceNumber: number, data: Uint8Array, additionalSampleLimit?: number): boolean;
+    /**
+     * `recovered` marks an FEC-recovered copy. A recovered block hands back
+     * every FT=1 it holds, the received ones included, so a recovered copy of a
+     * fragment whose samples are all done is a duplicate: admitting it again
+     * would charge stale timing and could displace the live MPU's. A source
+     * copy is still admitted again (a rendition switch re-arms timing that way).
+     */
+    addMovieFragment(mpuSequenceNumber: number, data: Uint8Array, additionalSampleLimit?: number, recovered?: boolean): boolean;
     sampleTiming(mpuSequenceNumber: number, movieFragmentSequenceNumber: number, sampleNumber: number): IsoBmffSampleTiming | null;
     consumeSample(mpuSequenceNumber: number, movieFragmentSequenceNumber: number, sampleNumber: number, expected: IsoBmffSampleTiming): boolean;
     /**

package/dist/iso-bmff-timing.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"iso-bmff-timing.d.ts","sourceRoot":"","sources":["../src/iso-bmff-timing.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAqCH,MAAM,WAAW,kBAAkB;IACjC,OAAO,EAAE,MAAM,CAAA;IACf,SAAS,EAAE,MAAM,CAAA;IACjB,qBAAqB,CAAC,EAAE,MAAM,CAAA;IAC9B,iBAAiB,CAAC,EAAE,MAAM,CAAA;CAC3B;AAED,MAAM,WAAW,mBAAmB;IAClC,iDAAiD;IACjD,UAAU,EAAE,MAAM,CAAA;IAClB,6EAA6E;IAC7E,gBAAgB,EAAE,MAAM,CAAA;IACxB,uDAAuD;IACvD,QAAQ,EAAE,MAAM,CAAA;IAChB,SAAS,EAAE,MAAM,CAAA;IACjB,sEAAsE;IACtE,IAAI,EAAE,MAAM,CAAA;IACZ,yEAAyE;IACzE,YAAY,EAAE,MAAM,CAAA;CACrB;AAED,MAAM,WAAW,0BAA0B;IACzC,2BAA2B,EAAE,MAAM,CAAA;IACnC,OAAO,EAAE,SAAS,mBAAmB,EAAE,CAAA;CACxC;AAED,MAAM,MAAM,6BAA6B,GAAG,SAAS,GAAG,QAAQ,CAAA;AAmNhE,wBAAgB,gCAAgC,CAC9C,IAAI,EAAE,UAAU,GACf,kBAAkB,GAAG,IAAI,CA8C3B;AA4LD,wBAAgB,+BAA+B,CAC7C,IAAI,EAAE,UAAU,EAChB,KAAK,EAAE,kBAAkB,EACzB,UAAU,EAAE,MAAM,GACjB,0BAA0B,GAAG,IAAI,CAuCnC;AAoBD,gDAAgD;AAChD,qBAAa,qBAAqB;;IAOpB,QAAQ,CAAC,iBAAiB,EAAE,MAAM;gBAAzB,iBAAiB,EAAE,MAAM;IAM9C,IAAI,kBAAkB,IAAI,MAAM,CAE/B;IAED;;;;;OAKG;IACH,IAAI,kBAAkB,IAAI,MAAM,CAE/B;IAED,gEAAgE;IAChE,IAAI,0BAA0B,IAAI,6BAA6B,GAAG,IAAI,CAErE;IAED,iBAAiB,CAAC,IAAI,EAAE,UAAU,GAAG,OAAO;IAQ5C,gBAAgB,CACd,iBAAiB,EAAE,MAAM,EACzB,IAAI,EAAE,UAAU,EAChB,qBAAqB,SAAyB,GAC7C,OAAO;IAiEV,YAAY,CACV,iBAAiB,EAAE,MAAM,EACzB,2BAA2B,EAAE,MAAM,EACnC,YAAY,EAAE,MAAM,GACnB,mBAAmB,GAAG,IAAI;IAW7B,aAAa,CACX,iBAAiB,EAAE,MAAM,EACzB,2BAA2B,EAAE,MAAM,EACnC,YAAY,EAAE,MAAM,EACpB,QAAQ,EAAE,mBAAmB,GAC5B,OAAO;IASV;;;;;;;;;;;;;;;;;;;OAmBG;IACH,aAAa,CACX,iBAAiB,EAAE,MAAM,EACzB,2BAA2B,EAAE,MAAM,EACnC,YAAY,EAAE,MAAM,GACnB,OAAO;IA2CV,KAAK,IAAI,IAAI;CAKd;AAUD,mFAAmF;AACnF,wBAAgB,wBAAwB,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAWxF"}
+{"version":3,"file":"iso-bmff-timing.d.ts","sourceRoot":"","sources":["../src/iso-bmff-timing.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAqCH,MAAM,WAAW,kBAAkB;IACjC,OAAO,EAAE,MAAM,CAAA;IACf,SAAS,EAAE,MAAM,CAAA;IACjB,qBAAqB,CAAC,EAAE,MAAM,CAAA;IAC9B,iBAAiB,CAAC,EAAE,MAAM,CAAA;CAC3B;AAED,MAAM,WAAW,mBAAmB;IAClC,iDAAiD;IACjD,UAAU,EAAE,MAAM,CAAA;IAClB,6EAA6E;IAC7E,gBAAgB,EAAE,MAAM,CAAA;IACxB,uDAAuD;IACvD,QAAQ,EAAE,MAAM,CAAA;IAChB,SAAS,EAAE,MAAM,CAAA;IACjB,sEAAsE;IACtE,IAAI,EAAE,MAAM,CAAA;IACZ,yEAAyE;IACzE,YAAY,EAAE,MAAM,CAAA;CACrB;AAED,MAAM,WAAW,0BAA0B;IACzC,2BAA2B,EAAE,MAAM,CAAA;IACnC,OAAO,EAAE,SAAS,mBAAmB,EAAE,CAAA;CACxC;AAED,MAAM,MAAM,6BAA6B,GAAG,SAAS,GAAG,QAAQ,CAAA;AAmNhE,wBAAgB,gCAAgC,CAC9C,IAAI,EAAE,UAAU,GACf,kBAAkB,GAAG,IAAI,CA8C3B;AA4LD,wBAAgB,+BAA+B,CAC7C,IAAI,EAAE,UAAU,EAChB,KAAK,EAAE,kBAAkB,EACzB,UAAU,EAAE,MAAM,GACjB,0BAA0B,GAAG,IAAI,CAuCnC;AAoBD,gDAAgD;AAChD,qBAAa,qBAAqB;;IAepB,QAAQ,CAAC,iBAAiB,EAAE,MAAM;gBAAzB,iBAAiB,EAAE,MAAM;IAM9C,8EAA8E;IAC9E,IAAI,WAAW,IAAI,OAAO,CAEzB;IAED,IAAI,kBAAkB,IAAI,MAAM,CAE/B;IAED;;;;;OAKG;IACH,IAAI,kBAAkB,IAAI,MAAM,CAE/B;IAED,gEAAgE;IAChE,IAAI,0BAA0B,IAAI,6BAA6B,GAAG,IAAI,CAErE;IAED,iBAAiB,CAAC,IAAI,EAAE,UAAU,GAAG,OAAO;IAQ5C;;;;;;OAMG;IACH,gBAAgB,CACd,iBAAiB,EAAE,MAAM,EACzB,IAAI,EAAE,UAAU,EAChB,qBAAqB,SAAyB,EAC9C,SAAS,UAAQ,GAChB,OAAO;IAqEV,YAAY,CACV,iBAAiB,EAAE,MAAM,EACzB,2BAA2B,EAAE,MAAM,EACnC,YAAY,EAAE,MAAM,GACnB,mBAAmB,GAAG,IAAI;IAW7B,aAAa,CACX,iBAAiB,EAAE,MAAM,EACzB,2BAA2B,EAAE,MAAM,EACnC,YAAY,EAAE,MAAM,EACpB,QAAQ,EAAE,mBAAmB,GAC5B,OAAO;IASV;;;;;;;;;;;;;;;;;;;OAmBG;IACH,aAAa,CACX,iBAAiB,EAAE,MAAM,EACzB,2BAA2B,EAAE,MAAM,EACnC,YAAY,EAAE,MAAM,GACnB,OAAO;IAuDV,KAAK,IAAI,IAAI;CAOd;AAUD,mFAAmF;AACnF,wBAAgB,wBAAwB,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAWxF"}

package/dist/iso-bmff-timing.js

@@ -420,9 +420,21 @@ var IsoBmffTimingResolver = class {
   }
   #track = null;
   #fragments = /* @__PURE__ */ new Map();
+  /** First sample of each pending fragment, kept in `#delivered` with its sample count. */
+  #firstSamples = /* @__PURE__ */ new Map();
+  /**
+   * First sample and sample count of the newest fragments whose every slot was
+   * cleared. Abandonment counts: `releaseSample` clears a slot too, which
+   * matches the combiner, since it retires an abandoned sample as well.
+   */
+  #delivered = /* @__PURE__ */ new Map();
   #pendingSamples = 0;
   #evictedSamples = 0;
   #lastMovieFragmentRejection = null;
+  /** True once an FT=0 has bound the track that FT=1 timing is read against. */
+  get initialized() {
+    return this.#track !== null;
+  }
   get pendingSampleCount() {
     return this.#pendingSamples;
   }
@@ -446,7 +458,14 @@ var IsoBmffTimingResolver = class {
     this.#track = timing;
     return true;
   }
-  addMovieFragment(mpuSequenceNumber, data, additionalSampleLimit = this.maxPendingSamples) {
+  /**
+   * `recovered` marks an FEC-recovered copy. A recovered block hands back
+   * every FT=1 it holds, the received ones included, so a recovered copy of a
+   * fragment whose samples are all done is a duplicate: admitting it again
+   * would charge stale timing and could displace the live MPU's. A source
+   * copy is still admitted again (a rendition switch re-arms timing that way).
+   */
+  addMovieFragment(mpuSequenceNumber, data, additionalSampleLimit = this.maxPendingSamples, recovered = false) {
     this.#lastMovieFragmentRejection = null;
     if (!Number.isInteger(additionalSampleLimit) || additionalSampleLimit < 0) {
       this.#lastMovieFragmentRejection = "invalid";
@@ -472,6 +491,8 @@ var IsoBmffTimingResolver = class {
         (sample, index) => sample !== null && sameSample(sample, parsed.samples[index])
       );
     }
+    const delivered = recovered ? this.#delivered.get(key) : void 0;
+    if (delivered && delivered.sampleCount === parsed.samples.length && sameSample(delivered.first, parsed.samples[0])) return true;
     let freed = 0;
     while (this.#fragments.size > 0 && (this.#pendingSamples + parsed.samples.length > this.maxPendingSamples || parsed.samples.length - freed > additionalSampleLimit)) {
       freed += this.#evictOldestFragment();
@@ -485,6 +506,7 @@ var IsoBmffTimingResolver = class {
       return false;
     }
     this.#fragments.set(key, [...parsed.samples]);
+    this.#firstSamples.set(key, parsed.samples[0]);
     this.#pendingSamples += parsed.samples.length;
     return true;
   }
@@ -542,6 +564,7 @@ var IsoBmffTimingResolver = class {
     let live = 0;
     for (const sample of samples) if (sample !== null) live++;
     this.#fragments.delete(oldest);
+    this.#firstSamples.delete(oldest);
     this.#pendingSamples -= live;
     this.#evictedSamples += live;
     return live;
@@ -557,12 +580,23 @@ var IsoBmffTimingResolver = class {
     if (!samples || !samples[index]) return false;
     samples[index] = null;
     this.#pendingSamples--;
-    if (samples.every((value) => value === null)) this.#fragments.delete(key);
+    if (samples.every((value) => value === null)) {
+      this.#fragments.delete(key);
+      const first = this.#firstSamples.get(key);
+      this.#firstSamples.delete(key);
+      this.#delivered.delete(key);
+      this.#delivered.set(key, { first, sampleCount: samples.length });
+      if (this.#delivered.size > this.maxPendingSamples) {
+        this.#delivered.delete(this.#delivered.keys().next().value);
+      }
+    }
     return true;
   }
   reset() {
     this.#track = null;
     this.#fragments.clear();
+    this.#firstSamples.clear();
+    this.#delivered.clear();
     this.#pendingSamples = 0;
   }
 };