@mikeargento/bitgraph-verify 1.5.0 → 1.7.0

package/dist/fuse.d.ts

@@ -1,3 +1,4 @@
+import { MerkleTree } from "./fuse-merkle.js";
 import type { Attribution, BitGraphProof, SlotAllocation } from "./types.js";
 export declare const FUSE_PROFILE: "bitgraph-fuse/1";
 /** Domain separation prefix: the 15 profile bytes followed by one zero byte. */
@@ -59,7 +60,7 @@ export declare function parseFusePayload(bytes: Uint8Array): {
     commitment: Uint8Array;
     originDigest?: Uint8Array;
 } | null;
-export type PlacementId = "trailer/1" | "container/1" | "produced/1" | "set/1";
+export type PlacementId = "trailer/1" | "container/1" | "container/2" | "produced/1" | "set/1" | "set/2";
 export interface Located {
     /** The commitment found in the fused bytes. */
     commitment: Uint8Array;
@@ -68,6 +69,11 @@ export interface Located {
     /** The original's bytes as carried inside the fused bytes, for placements that carry them. */
     originalBytes?: Uint8Array;
 }
+/** What a Form A or B placement puts around the original: fused = prefix, original, suffix. */
+export interface FusedFrame {
+    prefix: Uint8Array;
+    suffix: Uint8Array;
+}
 export interface Placement {
     readonly id: PlacementId;
     /** A: in-file placement of an existing original; B: container; C: produced artifact. */
@@ -82,6 +88,23 @@ export interface Placement {
     }): Uint8Array;
     /** Find the commitment in fused bytes, or null when the marker is absent or malformed. */
     locate(fused: Uint8Array): Located | null;
+    /**
+     * Forms A and B: the bytes around the original, such that
+     * build({original, originDigest, commitment}) is exactly prefix, original,
+     * suffix. A producer that streams the original once can hash the prefix and
+     * the original as they pass and finish with the suffix later.
+     */
+    frame?(input: {
+        originalSize: number;
+        originDigest: Uint8Array;
+        commitment: Uint8Array;
+    }): FusedFrame;
+    /**
+     * The prefix when it depends on the original's size alone, so a scanner can
+     * hash it before any slot exists; null when the prefix carries the
+     * commitment (container/1) and the fused digest needs the bytes again.
+     */
+    scanPrefix?(originalSize: number): Uint8Array | null;
 }
 /** Registered placements in the fixed order a verifier tries them when none is declared. */
 export declare const PLACEMENTS: readonly Placement[];
@@ -160,8 +183,74 @@ export declare function parseSetManifest(bytes: Uint8Array): {
  * strictly and to hash to the signed artifact digest.
  */
 export declare function readSetMetadata(proof: BitGraphProof): Uint8Array | null;
+export declare const SET2_PLACEMENT_ID: "set/2";
+/** The proof.metadata key under which a member's own evidence (row, index, count, path) may ride, UNSIGNED, beside the root document. */
+export declare const SET_MEMBER_METADATA_KEY: "bitgraph-fuse/1/member";
+/** The most members one set/2 tree lists. A limit stated plainly, not a design constant: the tree and the paths are fine far beyond it. */
+export declare const MAX_SET2_MEMBERS = 1000000;
+/** The root document as JSON: the type of the value under proof.metadata[SET_METADATA_KEY] for a set/2 proof. */
+export interface SetRoot {
+    count: number;
+    placement: typeof SET2_PLACEMENT_ID;
+    root: {
+        algorithm: "sha256";
+        digest: string;
+    };
+    slotCommitment: {
+        algorithm: "sha256";
+        digest: string;
+    };
+    type: typeof FUSE_PROFILE;
+}
+/** One member's evidence as JSON: its row, its leaf index, the tree size, and the sibling path from the leaf up. */
+export interface SetMemberProof {
+    count: number;
+    index: number;
+    member: SetManifest["members"][number];
+    path: string[];
+    placement: typeof SET2_PLACEMENT_ID;
+    type: typeof FUSE_PROFILE;
+}
+/** The canonical bytes of one row, exactly as a set/1 manifest lists it; the leaf a set/2 tree hashes. */
+export declare function canonicalSetRow(m: SetMember): Uint8Array;
+/** The leaf hash of one row: SHA-256(0x00, canonical row bytes). */
+export declare function setLeaf(m: SetMember): Uint8Array;
+/**
+ * Order members as a set/2 tree lists them: strictly ascending by artifact
+ * digest, no duplicate artifact. Throws on a duplicate, an empty list, or a
+ * malformed row, like buildSetManifest.
+ */
+export declare function sortSetMembers(members: readonly SetMember[]): SetMember[];
+/** The tree over a member list, in tree order (sortSetMembers): the sorted rows, their leaf hashes, the root, and every member's path on demand. */
+export declare function buildSetTree(members: readonly SetMember[]): {
+    sorted: SetMember[];
+    leaves: Uint8Array[];
+    root: Uint8Array;
+    tree: MerkleTree;
+};
+/** The inclusion path of the member at `index` in tree order. */
+export declare function setMemberPath(tree: MerkleTree, index: number): Uint8Array[];
+/** Build the canonical set/2 root document bytes: the committed artifact. */
+export declare function buildSetRoot(commitment: Uint8Array, count: number, root: Uint8Array): Uint8Array;
+/** Strict parse of set/2 root document bytes: exactly the five keys, the literals, 32-byte digests, a count in range, byte-equal to its own rebuild. */
+export declare function parseSetRoot(bytes: Uint8Array): {
+    commitment: Uint8Array;
+    count: number;
+    root: Uint8Array;
+} | null;
+/** Build a member's evidence object (JSON shape) from tree order. */
+export declare function buildSetMemberProof(member: SetMember, index: number, count: number, path: readonly Uint8Array[]): SetMemberProof;
+/** Strict read of a member's evidence from a parsed JSON value: shape, literals, 32-byte hex digests and path nodes, index within count. Null on any deviation. UNBOUND: nothing here touches a root. */
+export declare function parseSetMemberProof(value: unknown): {
+    member: SetMember;
+    index: number;
+    count: number;
+    path: Uint8Array[];
+} | null;
+/** Recompute a root from a member's leaf and path; null when the path does not fit. */
+export declare function setRootFromMember(member: SetMember, index: number, count: number, path: readonly Uint8Array[]): Uint8Array | null;
 /**
- * Resolve a placement by id. set/1 resolves here but is NOT in PLACEMENTS:
+ * Resolve a placement by id. set/1 and set/2 resolve here but are NOT in PLACEMENTS:
  * the undeclared scan is for bytes whose placement was not declared, whereas
  * a set manifest is identified by hashing to the signed artifact digest and
  * by its signed title, so the scan order of every existing fixture is

package/dist/fuse.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"fuse.d.ts","sourceRoot":"","sources":["../src/fuse.ts"],"names":[],"mappings":"AA6BA,OAAO,KAAK,EAAE,WAAW,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAM7E,eAAO,MAAM,YAAY,EAAG,iBAA0B,CAAC;AAEvD,gFAAgF;AAChF,eAAO,MAAM,WAAW,EAAE,UAMtB,CAAC;AAEL;;;;GAIG;AACH,eAAO,MAAM,qBAAqB,mBAAe,CAAC;AAElD,0FAA0F;AAC1F,eAAO,MAAM,aAAa,EAAG,UAAmB,CAAC;AACjD,eAAO,MAAM,cAAc,KAAK,CAAC;AAEjC,gDAAgD;AAChD,eAAO,MAAM,uBAAuB,EAAG,6BAAsC,CAAC;AAC9E,eAAO,MAAM,uBAAuB,EAAG,wBAAiC,CAAC;AAUzE,wBAAgB,aAAa,CAAC,KAAK,EAAE,UAAU,GAAG,MAAM,CAWvD;AAED,yGAAyG;AACzG,wBAAgB,aAAa,CAAC,GAAG,EAAE,MAAM,GAAG,UAAU,GAAG,IAAI,CAkB5D;AAED,wBAAgB,UAAU,CAAC,KAAK,EAAE,UAAU,GAAG,MAAM,CAIpD;AAED,gFAAgF;AAChF,wBAAgB,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,UAAU,GAAG,IAAI,CAKzD;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,UAAU,GAAG,OAAO,CAKhE;AAiBD;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,cAAc,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAU/E;AAED,iFAAiF;AACjF,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,cAAc,GAAG,UAAU,CAEtE;AAED,uGAAuG;AACvG,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,cAAc,GAAG,UAAU,CAMvE;AAED,kEAAkE;AAClE,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,cAAc,GAAG,UAAU,CAEtE;AAMD,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,OAAO,YAAY,CAAC;IAC1B,MAAM,CAAC,EAAE;QAAE,SAAS,EAAE,QAAQ,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IACjD,cAAc,EAAE;QAAE,SAAS,EAAE,QAAQ,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;CACzD;AAED,sFAAsF;AACtF,wBAAgB,gBAAgB,CAAC,UAAU,EAAE,UAAU,EAAE,YAAY,CAAC,EAAE,UAAU,GAAG,UAAU,CAS9F;AAcD;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,UAAU,GAAG;IAAE,UAAU,EAAE,UAAU,CAAC;IAAC,YAAY,CAAC,EAAE,UAAU,CAAA;CAAE,GAAG,IAAI,CA4BhH;AAiFD,MAAM,MAAM,WAAW,GAAG,WAAW,GAAG,aAAa,GAAG,YAAY,GAAG,OAAO,CAAC;AAE/E,MAAM,WAAW,OAAO;IACtB,+CAA+C;IAC/C,UAAU,EAAE,UAAU,CAAC;IACvB,qFAAqF;IACrF,YAAY,CAAC,EAAE,UAAU,CAAC;IAC1B,8FAA8F;IAC9F,aAAa,CAAC,EAAE,UAAU,CAAC;CAC5B;AAED,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,EAAE,EAAE,WAAW,CAAC;IACzB,wFAAwF;IACxF,QAAQ,CAAC,IAAI,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IAC/B,8FAA8F;IAC9F,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B,kFAAkF;IAClF,KAAK,CAAC,KAAK,EAAE;QAAE,QAAQ,CAAC,EAAE,UAAU,CAAC;QAAC,YAAY,CAAC,EAAE,UAAU,CAAC;QAAC,UAAU,EAAE,UAAU,CAAA;KAAE,GAAG,UAAU,CAAC;IACvG,0FAA0F;IAC1F,MAAM,CAAC,KAAK,EAAE,UAAU,GAAG,OAAO,GAAG,IAAI,CAAC;CAC3C;AA4DD,4FAA4F;AAC5F,eAAO,MAAM,UAAU,EAAE,SAAS,SAAS,EAAqD,CAAC;AAoBjG,eAAO,MAAM,gBAAgB,EAAG,OAAgB,CAAC;AAEjD;;;;;;GAMG;AACH,eAAO,MAAM,gBAAgB,mBAAe,CAAC;AAK7C,6EAA6E;AAC7E,MAAM,WAAW,SAAS;IACxB,2CAA2C;IAC3C,QAAQ,EAAE,UAAU,CAAC;IACrB,qGAAqG;IACrG,MAAM,EAAE,UAAU,CAAC;IACnB,kFAAkF;IAClF,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,0FAA0F;AAC1F,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,KAAK,CAAC;QACb,QAAQ,EAAE;YAAE,SAAS,EAAE,QAAQ,CAAC;YAAC,MAAM,EAAE,MAAM,CAAA;SAAE,CAAC;QAClD,MAAM,EAAE;YAAE,SAAS,EAAE,QAAQ,CAAC;YAAC,MAAM,EAAE,MAAM,CAAA;SAAE,CAAC;QAChD,SAAS,EAAE,MAAM,CAAC;KACnB,CAAC,CAAC;IACH,SAAS,EAAE,OAAO,gBAAgB,CAAC;IACnC,cAAc,EAAE;QAAE,SAAS,EAAE,QAAQ,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IACxD,IAAI,EAAE,OAAO,YAAY,CAAC;CAC3B;AAED;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAAC,UAAU,EAAE,UAAU,EAAE,OAAO,EAAE,SAAS,SAAS,EAAE,GAAG,UAAU,CA2BlG;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,UAAU,GAAG;IAAE,UAAU,EAAE,UAAU,CAAC;IAAC,OAAO,EAAE,SAAS,EAAE,CAAA;CAAE,GAAG,IAAI,CAyC3G;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,aAAa,GAAG,UAAU,GAAG,IAAI,CAQvE;AAeD;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS,GAAG,SAAS,CAE9D;AAMD;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,SAAS,EAAE,WAAW,EAAE,YAAY,CAAC,EAAE,UAAU,GAAG,WAAW,CAQ9F;AAED,MAAM,MAAM,YAAY,GAAG,aAAa,GAAG,UAAU,CAAC;AAEtD;;;;;GAKG;AACH,MAAM,WAAW,UAAU;IACzB,qGAAqG;IACrG,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,eAAe,EAAE,YAAY,GAAG,IAAI,CAAC;IACrC,YAAY,CAAC,EAAE,UAAU,CAAC;IAC1B,YAAY,CAAC,EAAE,YAAY,CAAC;IAC5B,yFAAyF;IACzF,MAAM,EAAE,YAAY,CAAC;CACtB;AAED,2GAA2G;AAC3G,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,aAAa,GAAG,UAAU,GAAG,IAAI,CAc3E;AAED,+FAA+F;AAC/F,wBAAgB,YAAY,CAAC,MAAM,EAAE,UAAU,GAAG,IAAI,EAAE,QAAQ,EAAE,UAAU,GAAG,IAAI,GAAG,UAAU,GAAG,IAAI,CAatG;AAMD,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,OAAO,YAAY,CAAC;IAC1B,QAAQ,EAAE;QACR,0DAA0D;QAC1D,SAAS,EAAE,MAAM,CAAC;QAClB,MAAM,CAAC,EAAE;YAAE,SAAS,EAAE,QAAQ,CAAC;YAAC,MAAM,EAAE,MAAM,CAAA;SAAE,CAAC;QACjD,QAAQ,EAAE;YAAE,SAAS,EAAE,QAAQ,CAAC;YAAC,MAAM,EAAE,MAAM,CAAA;SAAE,CAAC;QAClD,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;KAC1B,CAAC;IACF,WAAW,CAAC,EAAE,WAAW,CAAC;IAC1B,KAAK,EAAE,aAAa,CAAC;CACtB;AAED,wBAAgB,UAAU,CAAC,KAAK,EAAE;IAChC,KAAK,EAAE,aAAa,CAAC;IACrB,SAAS,EAAE,WAAW,CAAC;IACvB,cAAc,EAAE,UAAU,CAAC;IAC3B,YAAY,CAAC,EAAE,UAAU,CAAC;IAC1B,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,WAAW,CAAC,EAAE,UAAU,CAAC;CAC1B,GAAG,SAAS,CAiBZ;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,OAAO,GAAG,SAAS,GAAG,IAAI,CA2B3D;AAED,oGAAoG;AACpG,wBAAgB,eAAe,CAAC,KAAK,EAAE,SAAS,GAAG,UAAU,CAW5D"}
+{"version":3,"file":"fuse.d.ts","sourceRoot":"","sources":["../src/fuse.ts"],"names":[],"mappings":"AA4BA,OAAO,EAAsC,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAElF,OAAO,KAAK,EAAE,WAAW,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAM7E,eAAO,MAAM,YAAY,EAAG,iBAA0B,CAAC;AAEvD,gFAAgF;AAChF,eAAO,MAAM,WAAW,EAAE,UAMtB,CAAC;AAEL;;;;GAIG;AACH,eAAO,MAAM,qBAAqB,mBAAe,CAAC;AAElD,0FAA0F;AAC1F,eAAO,MAAM,aAAa,EAAG,UAAmB,CAAC;AACjD,eAAO,MAAM,cAAc,KAAK,CAAC;AAEjC,gDAAgD;AAChD,eAAO,MAAM,uBAAuB,EAAG,6BAAsC,CAAC;AAC9E,eAAO,MAAM,uBAAuB,EAAG,wBAAiC,CAAC;AAUzE,wBAAgB,aAAa,CAAC,KAAK,EAAE,UAAU,GAAG,MAAM,CAWvD;AAED,yGAAyG;AACzG,wBAAgB,aAAa,CAAC,GAAG,EAAE,MAAM,GAAG,UAAU,GAAG,IAAI,CAkB5D;AAED,wBAAgB,UAAU,CAAC,KAAK,EAAE,UAAU,GAAG,MAAM,CAIpD;AAED,gFAAgF;AAChF,wBAAgB,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,UAAU,GAAG,IAAI,CAKzD;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,UAAU,GAAG,OAAO,CAKhE;AAiBD;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,cAAc,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAU/E;AAED,iFAAiF;AACjF,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,cAAc,GAAG,UAAU,CAEtE;AAED,uGAAuG;AACvG,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,cAAc,GAAG,UAAU,CAMvE;AAED,kEAAkE;AAClE,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,cAAc,GAAG,UAAU,CAEtE;AAMD,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,OAAO,YAAY,CAAC;IAC1B,MAAM,CAAC,EAAE;QAAE,SAAS,EAAE,QAAQ,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IACjD,cAAc,EAAE;QAAE,SAAS,EAAE,QAAQ,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;CACzD;AAED,sFAAsF;AACtF,wBAAgB,gBAAgB,CAAC,UAAU,EAAE,UAAU,EAAE,YAAY,CAAC,EAAE,UAAU,GAAG,UAAU,CAS9F;AAcD;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,UAAU,GAAG;IAAE,UAAU,EAAE,UAAU,CAAC;IAAC,YAAY,CAAC,EAAE,UAAU,CAAA;CAAE,GAAG,IAAI,CA4BhH;AAiFD,MAAM,MAAM,WAAW,GAAG,WAAW,GAAG,aAAa,GAAG,aAAa,GAAG,YAAY,GAAG,OAAO,GAAG,OAAO,CAAC;AAEzG,MAAM,WAAW,OAAO;IACtB,+CAA+C;IAC/C,UAAU,EAAE,UAAU,CAAC;IACvB,qFAAqF;IACrF,YAAY,CAAC,EAAE,UAAU,CAAC;IAC1B,8FAA8F;IAC9F,aAAa,CAAC,EAAE,UAAU,CAAC;CAC5B;AAED,+FAA+F;AAC/F,MAAM,WAAW,UAAU;IACzB,MAAM,EAAE,UAAU,CAAC;IACnB,MAAM,EAAE,UAAU,CAAC;CACpB;AAED,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,EAAE,EAAE,WAAW,CAAC;IACzB,wFAAwF;IACxF,QAAQ,CAAC,IAAI,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IAC/B,8FAA8F;IAC9F,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B,kFAAkF;IAClF,KAAK,CAAC,KAAK,EAAE;QAAE,QAAQ,CAAC,EAAE,UAAU,CAAC;QAAC,YAAY,CAAC,EAAE,UAAU,CAAC;QAAC,UAAU,EAAE,UAAU,CAAA;KAAE,GAAG,UAAU,CAAC;IACvG,0FAA0F;IAC1F,MAAM,CAAC,KAAK,EAAE,UAAU,GAAG,OAAO,GAAG,IAAI,CAAC;IAC1C;;;;;OAKG;IACH,KAAK,CAAC,CAAC,KAAK,EAAE;QAAE,YAAY,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,UAAU,CAAC;QAAC,UAAU,EAAE,UAAU,CAAA;KAAE,GAAG,UAAU,CAAC;IACtG;;;;OAIG;IACH,UAAU,CAAC,CAAC,YAAY,EAAE,MAAM,GAAG,UAAU,GAAG,IAAI,CAAC;CACtD;AA+HD,4FAA4F;AAC5F,eAAO,MAAM,UAAU,EAAE,SAAS,SAAS,EAAiE,CAAC;AAoB7G,eAAO,MAAM,gBAAgB,EAAG,OAAgB,CAAC;AAEjD;;;;;;GAMG;AACH,eAAO,MAAM,gBAAgB,mBAAe,CAAC;AAK7C,6EAA6E;AAC7E,MAAM,WAAW,SAAS;IACxB,2CAA2C;IAC3C,QAAQ,EAAE,UAAU,CAAC;IACrB,qGAAqG;IACrG,MAAM,EAAE,UAAU,CAAC;IACnB,kFAAkF;IAClF,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,0FAA0F;AAC1F,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,KAAK,CAAC;QACb,QAAQ,EAAE;YAAE,SAAS,EAAE,QAAQ,CAAC;YAAC,MAAM,EAAE,MAAM,CAAA;SAAE,CAAC;QAClD,MAAM,EAAE;YAAE,SAAS,EAAE,QAAQ,CAAC;YAAC,MAAM,EAAE,MAAM,CAAA;SAAE,CAAC;QAChD,SAAS,EAAE,MAAM,CAAC;KACnB,CAAC,CAAC;IACH,SAAS,EAAE,OAAO,gBAAgB,CAAC;IACnC,cAAc,EAAE;QAAE,SAAS,EAAE,QAAQ,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IACxD,IAAI,EAAE,OAAO,YAAY,CAAC;CAC3B;AAED;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAAC,UAAU,EAAE,UAAU,EAAE,OAAO,EAAE,SAAS,SAAS,EAAE,GAAG,UAAU,CA2BlG;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,UAAU,GAAG;IAAE,UAAU,EAAE,UAAU,CAAC;IAAC,OAAO,EAAE,SAAS,EAAE,CAAA;CAAE,GAAG,IAAI,CAyC3G;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,aAAa,GAAG,UAAU,GAAG,IAAI,CAQvE;AAmCD,eAAO,MAAM,iBAAiB,EAAG,OAAgB,CAAC;AAElD,yIAAyI;AACzI,eAAO,MAAM,uBAAuB,0BAAoC,CAAC;AAEzE,2IAA2I;AAC3I,eAAO,MAAM,gBAAgB,UAAY,CAAC;AAE1C,iHAAiH;AACjH,MAAM,WAAW,OAAO;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,OAAO,iBAAiB,CAAC;IACpC,IAAI,EAAE;QAAE,SAAS,EAAE,QAAQ,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IAC9C,cAAc,EAAE;QAAE,SAAS,EAAE,QAAQ,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IACxD,IAAI,EAAE,OAAO,YAAY,CAAC;CAC3B;AAED,oHAAoH;AACpH,MAAM,WAAW,cAAc;IAC7B,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC;IACvC,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,SAAS,EAAE,OAAO,iBAAiB,CAAC;IACpC,IAAI,EAAE,OAAO,YAAY,CAAC;CAC3B;AAED,0GAA0G;AAC1G,wBAAgB,eAAe,CAAC,CAAC,EAAE,SAAS,GAAG,UAAU,CASxD;AAED,oEAAoE;AACpE,wBAAgB,OAAO,CAAC,CAAC,EAAE,SAAS,GAAG,UAAU,CAEhD;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,OAAO,EAAE,SAAS,SAAS,EAAE,GAAG,SAAS,EAAE,CAYzE;AAED,oJAAoJ;AACpJ,wBAAgB,YAAY,CAAC,OAAO,EAAE,SAAS,SAAS,EAAE,GAAG;IAAE,MAAM,EAAE,SAAS,EAAE,CAAC;IAAC,MAAM,EAAE,UAAU,EAAE,CAAC;IAAC,IAAI,EAAE,UAAU,CAAC;IAAC,IAAI,EAAE,UAAU,CAAA;CAAE,CAK7I;AAED,iEAAiE;AACjE,wBAAgB,aAAa,CAAC,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,GAAG,UAAU,EAAE,CAE3E;AAED,6EAA6E;AAC7E,wBAAgB,YAAY,CAAC,UAAU,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,GAAG,UAAU,CAYhG;AAED,wJAAwJ;AACxJ,wBAAgB,YAAY,CAAC,KAAK,EAAE,UAAU,GAAG;IAAE,UAAU,EAAE,UAAU,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,UAAU,CAAA;CAAE,GAAG,IAAI,CA6BlH;AAED,qEAAqE;AACrE,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,UAAU,EAAE,GAAG,cAAc,CAkBhI;AAED,yMAAyM;AACzM,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,OAAO,GAAG;IAAE,MAAM,EAAE,SAAS,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,UAAU,EAAE,CAAA;CAAE,GAAG,IAAI,CAyBlI;AAED,uFAAuF;AACvF,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,UAAU,EAAE,GAAG,UAAU,GAAG,IAAI,CAEjI;AAeD;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS,GAAG,SAAS,CAE9D;AAMD;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,SAAS,EAAE,WAAW,EAAE,YAAY,CAAC,EAAE,UAAU,GAAG,WAAW,CAQ9F;AAED,MAAM,MAAM,YAAY,GAAG,aAAa,GAAG,UAAU,CAAC;AAEtD;;;;;GAKG;AACH,MAAM,WAAW,UAAU;IACzB,qGAAqG;IACrG,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,eAAe,EAAE,YAAY,GAAG,IAAI,CAAC;IACrC,YAAY,CAAC,EAAE,UAAU,CAAC;IAC1B,YAAY,CAAC,EAAE,YAAY,CAAC;IAC5B,yFAAyF;IACzF,MAAM,EAAE,YAAY,CAAC;CACtB;AAED,2GAA2G;AAC3G,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,aAAa,GAAG,UAAU,GAAG,IAAI,CAc3E;AAED,+FAA+F;AAC/F,wBAAgB,YAAY,CAAC,MAAM,EAAE,UAAU,GAAG,IAAI,EAAE,QAAQ,EAAE,UAAU,GAAG,IAAI,GAAG,UAAU,GAAG,IAAI,CAatG;AAMD,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,OAAO,YAAY,CAAC;IAC1B,QAAQ,EAAE;QACR,0DAA0D;QAC1D,SAAS,EAAE,MAAM,CAAC;QAClB,MAAM,CAAC,EAAE;YAAE,SAAS,EAAE,QAAQ,CAAC;YAAC,MAAM,EAAE,MAAM,CAAA;SAAE,CAAC;QACjD,QAAQ,EAAE;YAAE,SAAS,EAAE,QAAQ,CAAC;YAAC,MAAM,EAAE,MAAM,CAAA;SAAE,CAAC;QAClD,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;KAC1B,CAAC;IACF,WAAW,CAAC,EAAE,WAAW,CAAC;IAC1B,KAAK,EAAE,aAAa,CAAC;CACtB;AAED,wBAAgB,UAAU,CAAC,KAAK,EAAE;IAChC,KAAK,EAAE,aAAa,CAAC;IACrB,SAAS,EAAE,WAAW,CAAC;IACvB,cAAc,EAAE,UAAU,CAAC;IAC3B,YAAY,CAAC,EAAE,UAAU,CAAC;IAC1B,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,WAAW,CAAC,EAAE,UAAU,CAAC;CAC1B,GAAG,SAAS,CAiBZ;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,OAAO,GAAG,SAAS,GAAG,IAAI,CA2B3D;AAED,oGAAoG;AACpG,wBAAgB,eAAe,CAAC,KAAK,EAAE,SAAS,GAAG,UAAU,CAW5D"}

package/dist/fuse.js

@@ -24,6 +24,7 @@
  * claim the slot.
  */
 import { sha256 } from "@noble/hashes/sha256";
+import { merkleLeafHash, merkleRootFromPath, MerkleTree } from "./fuse-merkle.js";
 import { canonicalize } from "./canonical.js";
 // ---------------------------------------------------------------------------
 // Constants
@@ -234,7 +235,7 @@ export function parseFusePayload(bytes) {
     return originDigest !== undefined ? { commitment, originDigest } : { commitment };
 }
 // ---------------------------------------------------------------------------
-// Minimal deterministic ustar (POSIX.1-1988) for container/1
+// Minimal deterministic ustar (POSIX.1-1988) for container/1 and container/2
 // ---------------------------------------------------------------------------
 const BLOCK = 512;
 const MAX_ENTRY = 0o77777777777; // 8 GiB - 1, the 11-digit octal size field
@@ -246,7 +247,7 @@ function octal(n, width) {
 }
 function ustarHeader(name, size) {
     if (size > MAX_ENTRY)
-        throw new RangeError("container/1 entries are limited to 8 GiB");
+        throw new RangeError("container entries are limited to 8 GiB");
     const h = new Uint8Array(BLOCK);
     const nameBytes = utf8(name);
     if (nameBytes.length > 100)
@@ -323,6 +324,14 @@ const trailer1 = {
             return null;
         return { commitment: new Uint8Array(t.subarray(16, 48)), originalBytes: fused.subarray(0, fused.length - TRAILER_LENGTH) };
     },
+    frame({ commitment }) {
+        if (commitment.length !== 32)
+            throw new TypeError("commitment must be 32 bytes");
+        return { prefix: new Uint8Array(0), suffix: concat(utf8(TRAILER_MAGIC), new Uint8Array(8), commitment) };
+    },
+    scanPrefix() {
+        return new Uint8Array(0);
+    },
 };
 const container1 = {
     id: "container/1",
@@ -350,6 +359,65 @@ const container1 = {
             return null;
         return { commitment: payload.commitment, originDigest: payload.originDigest, originalBytes: o.data };
     },
+    frame({ originalSize, originDigest, commitment }) {
+        const manifest = buildFusePayload(commitment, originDigest);
+        return {
+            prefix: concat(ustarHeader(CONTAINER_MANIFEST_PATH, manifest.length), manifest, new Uint8Array(padTo(manifest.length)), ustarHeader(CONTAINER_ORIGINAL_PATH, originalSize)),
+            suffix: concat(new Uint8Array(padTo(originalSize)), new Uint8Array(BLOCK * 2)),
+        };
+    },
+    scanPrefix() {
+        // The manifest, and so the commitment, comes before the original.
+        return null;
+    },
+};
+/**
+ * container/2: the same archive with the original FIRST. Everything before
+ * the original's bytes is its ustar header, which depends on the size alone,
+ * so a scanner that hashes header and original as the file streams by can
+ * finish the fused digest later with the manifest for whatever slot the
+ * set is made under, without reading the file again. Any bytes fit: the
+ * original stays byte-exact inside, and the archive is a plain tar.
+ */
+function buildContainer2(original, manifest) {
+    return concat(ustarHeader(CONTAINER_ORIGINAL_PATH, original.length), original, new Uint8Array(padTo(original.length)), ustarHeader(CONTAINER_MANIFEST_PATH, manifest.length), manifest, new Uint8Array(padTo(manifest.length)), new Uint8Array(BLOCK * 2));
+}
+const container2 = {
+    id: "container/2",
+    form: "B",
+    byteExact: true,
+    build({ original, originDigest, commitment }) {
+        if (original === undefined)
+            throw new TypeError("container/2 requires the original bytes");
+        const digest = originDigest ?? sha256(original);
+        return buildContainer2(original, buildFusePayload(commitment, digest));
+    },
+    locate(fused) {
+        const entries = parseTar(fused);
+        if (entries === null || entries.length !== 2)
+            return null;
+        const [o, m] = entries;
+        if (o.name !== CONTAINER_ORIGINAL_PATH || m.name !== CONTAINER_MANIFEST_PATH)
+            return null;
+        const payload = parseFusePayload(m.data);
+        if (payload === null || payload.originDigest === undefined)
+            return null;
+        // The archive must be the one this module would build: headers included.
+        const rebuilt = buildContainer2(o.data, m.data);
+        if (!bytesEqual(rebuilt, fused))
+            return null;
+        return { commitment: payload.commitment, originDigest: payload.originDigest, originalBytes: o.data };
+    },
+    frame({ originalSize, originDigest, commitment }) {
+        const manifest = buildFusePayload(commitment, originDigest);
+        return {
+            prefix: ustarHeader(CONTAINER_ORIGINAL_PATH, originalSize),
+            suffix: concat(new Uint8Array(padTo(originalSize)), ustarHeader(CONTAINER_MANIFEST_PATH, manifest.length), manifest, new Uint8Array(padTo(manifest.length)), new Uint8Array(BLOCK * 2)),
+        };
+    },
+    scanPrefix(originalSize) {
+        return ustarHeader(CONTAINER_ORIGINAL_PATH, originalSize);
+    },
 };
 const produced1 = {
     id: "produced/1",
@@ -370,7 +438,7 @@ const produced1 = {
     },
 };
 /** Registered placements in the fixed order a verifier tries them when none is declared. */
-export const PLACEMENTS = Object.freeze([trailer1, container1, produced1]);
+export const PLACEMENTS = Object.freeze([trailer1, container1, container2, produced1]);
 // ---------------------------------------------------------------------------
 // Set manifest (placement set/1): N files fused under ONE slot
 // ---------------------------------------------------------------------------
@@ -422,7 +490,7 @@ export function buildSetManifest(commitment, members) {
             throw new TypeError("member origin digest must be 32 bytes");
         if (!PLACEMENT_ID_PATTERN.test(m.placement))
             throw new TypeError(`member placement "${m.placement}" is not a placement id`);
-        if (m.placement === SET_PLACEMENT_ID)
+        if (m.placement === SET_PLACEMENT_ID || m.placement === SET2_PLACEMENT_ID)
             throw new TypeError("a set cannot list a set as a member");
         const artifact = bytesToHex(m.artifact);
         if (seen.has(artifact))
@@ -497,7 +565,7 @@ export function parseSetManifest(bytes) {
         const placement = row["placement"];
         if (artifact === null || origin === null || typeof placement !== "string")
             return null;
-        if (!PLACEMENT_ID_PATTERN.test(placement) || placement === SET_PLACEMENT_ID)
+        if (!PLACEMENT_ID_PATTERN.test(placement) || placement === SET_PLACEMENT_ID || placement === SET2_PLACEMENT_ID)
             return null;
         members.push({ artifact, origin, placement });
     }
@@ -543,15 +611,221 @@ const set1 = {
         return manifest === null ? null : { commitment: manifest.commitment };
     },
 };
+// ---------------------------------------------------------------------------
+// Merkle set (placement set/2): N files under ONE slot, any N
+// ---------------------------------------------------------------------------
+//
+// set/1 commits the whole member list, which is what caps it: the list rides
+// in the commit body and in every copy of the proof. set/2 commits the ROOT
+// of a Merkle tree over the same rows, so the committed artifact is a few
+// hundred bytes whatever N is, and a member proves its place with a path of
+// ceil(log2 N) siblings. The floor is unchanged: every member's fused bytes
+// still carry the slot's commitment through its own placement. Membership
+// and floor stay inseparable in verifyFuseMember; what changes is where the
+// list lives (with the producer and the reader that serves it) and what a
+// member carries (its row, its index and its path, see SetMemberProof).
+//
+// Leaves are the canonical row bytes (the same {artifact, origin, placement}
+// row set/1 lists), hashed with the RFC 6962 leaf prefix, in the same strict
+// order as a set/1 manifest: ascending by artifact digest, no duplicates.
+// So one root stands for exactly one member list, and a reader holding the
+// list can rebuild the tree; a reader holding one member needs its path.
+export const SET2_PLACEMENT_ID = "set/2";
+/** The proof.metadata key under which a member's own evidence (row, index, count, path) may ride, UNSIGNED, beside the root document. */
+export const SET_MEMBER_METADATA_KEY = `${FUSE_PROFILE}/member`;
+/** The most members one set/2 tree lists. A limit stated plainly, not a design constant: the tree and the paths are fine far beyond it. */
+export const MAX_SET2_MEMBERS = 1_000_000;
+/** The canonical bytes of one row, exactly as a set/1 manifest lists it; the leaf a set/2 tree hashes. */
+export function canonicalSetRow(m) {
+    if (m.artifact.length !== 32)
+        throw new TypeError("member artifact digest must be 32 bytes");
+    if (m.origin.length !== 32)
+        throw new TypeError("member origin digest must be 32 bytes");
+    if (!PLACEMENT_ID_PATTERN.test(m.placement) || m.placement === SET_PLACEMENT_ID || m.placement === SET2_PLACEMENT_ID)
+        throw new TypeError(`member placement "${m.placement}" is not a member placement id`);
+    return canonicalize({
+        artifact: { algorithm: "sha256", digest: bytesToHex(m.artifact) },
+        origin: { algorithm: "sha256", digest: bytesToHex(m.origin) },
+        placement: m.placement,
+    });
+}
+/** The leaf hash of one row: SHA-256(0x00, canonical row bytes). */
+export function setLeaf(m) {
+    return merkleLeafHash(canonicalSetRow(m));
+}
+/**
+ * Order members as a set/2 tree lists them: strictly ascending by artifact
+ * digest, no duplicate artifact. Throws on a duplicate, an empty list, or a
+ * malformed row, like buildSetManifest.
+ */
+export function sortSetMembers(members) {
+    if (members.length === 0)
+        throw new TypeError("a set lists at least one member");
+    const sorted = [...members].sort((a, b) => {
+        const x = bytesToHex(a.artifact);
+        const y = bytesToHex(b.artifact);
+        return x < y ? -1 : x > y ? 1 : 0;
+    });
+    for (let i = 0; i < sorted.length; i++) {
+        canonicalSetRow(sorted[i]);
+        if (i > 0 && bytesEqual(sorted[i].artifact, sorted[i - 1].artifact))
+            throw new TypeError(`duplicate member artifact digest ${bytesToHex(sorted[i].artifact)}`);
+    }
+    return sorted;
+}
+/** The tree over a member list, in tree order (sortSetMembers): the sorted rows, their leaf hashes, the root, and every member's path on demand. */
+export function buildSetTree(members) {
+    const sorted = sortSetMembers(members);
+    const leaves = sorted.map(setLeaf);
+    const tree = new MerkleTree(leaves);
+    return { sorted, leaves, root: tree.root, tree };
+}
+/** The inclusion path of the member at `index` in tree order. */
+export function setMemberPath(tree, index) {
+    return tree.path(index);
+}
+/** Build the canonical set/2 root document bytes: the committed artifact. */
+export function buildSetRoot(commitment, count, root) {
+    if (commitment.length !== 32)
+        throw new TypeError("commitment must be 32 bytes");
+    if (root.length !== 32)
+        throw new TypeError("root must be 32 bytes");
+    if (!Number.isInteger(count) || count < 1 || count > MAX_SET2_MEMBERS)
+        throw new TypeError(`count must be an integer from 1 to ${MAX_SET2_MEMBERS}`);
+    const doc = {
+        count,
+        placement: SET2_PLACEMENT_ID,
+        root: { algorithm: "sha256", digest: bytesToHex(root) },
+        slotCommitment: { algorithm: "sha256", digest: bytesToHex(commitment) },
+        type: FUSE_PROFILE,
+    };
+    return canonicalize(doc);
+}
+/** Strict parse of set/2 root document bytes: exactly the five keys, the literals, 32-byte digests, a count in range, byte-equal to its own rebuild. */
+export function parseSetRoot(bytes) {
+    let text;
+    try {
+        text = new TextDecoder("utf-8", { fatal: true, ignoreBOM: true }).decode(bytes);
+    }
+    catch {
+        return null;
+    }
+    let parsed;
+    try {
+        parsed = JSON.parse(text);
+    }
+    catch {
+        return null;
+    }
+    if (!isPlainObject(parsed))
+        return null;
+    if (Object.keys(parsed).sort().join(",") !== "count,placement,root,slotCommitment,type")
+        return null;
+    if (parsed["type"] !== FUSE_PROFILE || parsed["placement"] !== SET2_PLACEMENT_ID)
+        return null;
+    const count = parsed["count"];
+    if (typeof count !== "number" || !Number.isInteger(count) || count < 1 || count > MAX_SET2_MEMBERS)
+        return null;
+    const commitment = readDigestField(parsed["slotCommitment"]);
+    const root = readDigestField(parsed["root"]);
+    if (commitment === null || root === null)
+        return null;
+    let rebuilt;
+    try {
+        rebuilt = buildSetRoot(commitment, count, root);
+    }
+    catch {
+        return null;
+    }
+    if (!bytesEqual(rebuilt, bytes))
+        return null;
+    return { commitment, count, root };
+}
+/** Build a member's evidence object (JSON shape) from tree order. */
+export function buildSetMemberProof(member, index, count, path) {
+    if (!Number.isInteger(index) || !Number.isInteger(count) || count < 1 || index < 0 || index >= count)
+        throw new RangeError("member index out of range");
+    canonicalSetRow(member);
+    return {
+        count,
+        index,
+        member: {
+            artifact: { algorithm: "sha256", digest: bytesToHex(member.artifact) },
+            origin: { algorithm: "sha256", digest: bytesToHex(member.origin) },
+            placement: member.placement,
+        },
+        path: path.map((p) => {
+            if (p.length !== 32)
+                throw new TypeError("a path node is 32 bytes");
+            return bytesToHex(p);
+        }),
+        placement: SET2_PLACEMENT_ID,
+        type: FUSE_PROFILE,
+    };
+}
+/** Strict read of a member's evidence from a parsed JSON value: shape, literals, 32-byte hex digests and path nodes, index within count. Null on any deviation. UNBOUND: nothing here touches a root. */
+export function parseSetMemberProof(value) {
+    if (!isPlainObject(value))
+        return null;
+    if (Object.keys(value).sort().join(",") !== "count,index,member,path,placement,type")
+        return null;
+    if (value["type"] !== FUSE_PROFILE || value["placement"] !== SET2_PLACEMENT_ID)
+        return null;
+    const count = value["count"];
+    const index = value["index"];
+    if (typeof count !== "number" || !Number.isInteger(count) || count < 1 || count > MAX_SET2_MEMBERS)
+        return null;
+    if (typeof index !== "number" || !Number.isInteger(index) || index < 0 || index >= count)
+        return null;
+    const row = value["member"];
+    if (!isPlainObject(row) || Object.keys(row).sort().join(",") !== "artifact,origin,placement")
+        return null;
+    const artifact = readDigestField(row["artifact"]);
+    const origin = readDigestField(row["origin"]);
+    const placement = row["placement"];
+    if (artifact === null || origin === null || typeof placement !== "string")
+        return null;
+    if (!PLACEMENT_ID_PATTERN.test(placement) || placement === SET_PLACEMENT_ID || placement === SET2_PLACEMENT_ID)
+        return null;
+    const list = value["path"];
+    if (!Array.isArray(list))
+        return null;
+    const path = [];
+    for (const node of list) {
+        if (typeof node !== "string" || !/^[0-9a-f]{64}$/.test(node))
+            return null;
+        const bytes = hexToBytes(node);
+        if (bytes === null)
+            return null;
+        path.push(bytes);
+    }
+    return { member: { artifact, origin, placement }, index, count, path };
+}
+/** Recompute a root from a member's leaf and path; null when the path does not fit. */
+export function setRootFromMember(member, index, count, path) {
+    return merkleRootFromPath(setLeaf(member), index, count, path);
+}
+const set2 = {
+    id: SET2_PLACEMENT_ID,
+    form: "C",
+    byteExact: false,
+    build() {
+        throw new TypeError("set/2 is built with buildSetRoot(commitment, count, root)");
+    },
+    locate(fused) {
+        const doc = parseSetRoot(fused);
+        return doc === null ? null : { commitment: doc.commitment };
+    },
+};
 /**
- * Resolve a placement by id. set/1 resolves here but is NOT in PLACEMENTS:
+ * Resolve a placement by id. set/1 and set/2 resolve here but are NOT in PLACEMENTS:
  * the undeclared scan is for bytes whose placement was not declared, whereas
  * a set manifest is identified by hashing to the signed artifact digest and
  * by its signed title, so the scan order of every existing fixture is
  * literally unchanged.
  */
 export function getPlacement(id) {
-    return [...PLACEMENTS, set1].find((p) => p.id === id);
+    return [...PLACEMENTS, set1, set2].find((p) => p.id === id);
 }
 // ---------------------------------------------------------------------------
 // Attribution (the signed carrier of placement and origin, spec 6.5)
@@ -565,8 +839,8 @@ export function getPlacement(id) {
 export function fuseAttribution(placement, originDigest) {
     if (originDigest !== undefined && originDigest.length !== 32)
         throw new TypeError("originDigest must be 32 bytes");
-    if (placement === SET_PLACEMENT_ID && originDigest !== undefined)
-        throw new TypeError("set/1 has no single origin; a set marker carries no origin digest");
+    if ((placement === SET_PLACEMENT_ID || placement === SET2_PLACEMENT_ID) && originDigest !== undefined)
+        throw new TypeError(`${placement} has no single origin; a set marker carries no origin digest`);
     return {
         name: FUSE_ATTRIBUTION_NAME,
         title: placement,