@integraledger/lcp-verify 0.9.0

package/CHANGELOG.md

@@ -0,0 +1,13 @@
+# @integraledger/lcp-verify
+
+## 0.9.0
+
+First public release.
+
+`0.9.0` is deliberate: this is a release candidate for 1.0, not a preview. The implementation is complete
+against LCP v1.38 and certified by the conformance corpus, and the remaining distance to 1.0 is the
+specification's own — the standard is still moving through its steering committee, and this package will not
+claim a stability its protocol has not yet promised.
+
+Development before this release happened in a private repository and is not reproduced here; no earlier
+version was ever available to install.

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/NOTICE

@@ -0,0 +1,14 @@
+Integra Protocol
+Copyright 2026 Integra Ledger
+
+This product includes software developed by Integra Ledger (https://integraledger.com).
+
+"Integra", "Integra Ledger", and the Integra logo are trademarks of Integra Ledger.
+Trademark use is not granted by the Apache License 2.0 (see Section 6).
+
+The Legal Context Protocol is co-stewarded by Integra Ledger and AAA-ICDR. This repository is a
+reference implementation of the standard's open layer; the specification itself is published at
+https://legalcontextprotocol.org/standard and is not part of this distribution.
+
+The vendored submodule under lib/commerce-payments is Coinbase's AuthCaptureEscrow and carries its own
+MIT licence at lib/commerce-payments/LICENSE.md. It is not covered by the Apache License above.

package/README.md

@@ -0,0 +1,116 @@
+# @integraledger/lcp-verify
+
+The verification walk, and the canonical report it emits.
+
+`verify` takes the pieces of a record and reports, step by step, what it was able to establish. It is
+**pure over its supplied inputs** — it opens no sockets and fetches nothing. The imperative shell that
+gathers those inputs over live ports belongs to the caller, which is what makes this function
+deterministic and testable against fixed vectors.
+
+```bash
+npm install @integraledger/lcp-verify
+```
+
+Built on [`@integraledger/lcp-kernel`](../kernel#readme), [`@integraledger/lcp-binding-core`](../binding-core#readme) and [`@integraledger/lcp-authority`](../authority#readme). No chain SDK: the ports are yours to
+supply, and [`@integraledger/lcp-binding-evm-common`](../binding-evm-common#readme) is the EVM implementation of the signature-verifier one.
+
+## Use
+
+```ts
+import { verify, serializeReport } from "@integraledger/lcp-verify";
+
+declare const atrBytes: Uint8Array;      // the exact ATR bytes the record was hashed over
+declare const settledAtrHash: string;    // the atrHash recovered from the settlement
+
+const report = await verify({
+  asOf: "2026-07-27T00:00:00Z",
+  coverage: { ports: [], bindings: ["evm-x402"] },
+  atrBytes,
+  settledAtrHash,
+  settlements: [{ txHash: "0x1111…" }],
+});
+```
+
+```
+verified: false | supportedClass: TC-2
+   atr-fingerprint          proved
+   settlement-enumeration   proved
+   buyer-acceptance         not-attempted   no-acceptance
+   authority-attenuation    not-attempted   no-authority-chain
+   commitment-vs-leaf       not-attempted   no-commitment
+   recourse-elections       not-attempted   no-elections-recorded
+   resolve-party            not-attempted   no-identity
+```
+
+## The four statuses, and why there are four
+
+Most verifiers have two: pass and fail. That collapses two very different situations — *this is wrong*
+and *I was not equipped to check this* — into one word, and a caller cannot tell them apart.
+
+| Status | Meaning |
+|---|---|
+| `proved` | The step ran and held |
+| `failed` | The step ran and did not hold — carries a halt class |
+| `indeterminate` | The input exists but could not be retrieved |
+| `not-attempted` | The input was never supplied — carries the reason |
+
+**An absent input never becomes a pass.** An empty authority chain is `not-attempted`, never `proved`:
+a record carrying no delegated authority at all must not clear the authority rung by supplying nothing.
+A malformed chain is `not-attempted` too, with a different reason — unwalkable is a gap, not a
+contradiction.
+
+An acceptance presented without a signature verifier is `not-attempted("no-signature-verifier")`, because
+a signature nobody checked is not evidence of a signature.
+
+## `verified` and `supportedClass` are readouts, not targets
+
+At the default `depth: "structural"`, `verified` is **always** `false`. A structural walk is a
+presence-and-absence readout; it cannot raise a verdict. Passing `depth: "mechanical"` — where the caller
+has supplied live ports — lets `verified` become an honest function of the walk: true only when every
+class-required step is `proved` and none `failed`.
+
+`supportedClass` works the same way. The record is *shaped for* a claimed class, and the structural walk
+can only confirm or impeach that shape: any failed step downgrades it to `TC-0`, and the walk never
+raises it.
+
+A forged input cannot produce a `proved`. Signature verification that throws deep in curve math over
+corrupted bytes is reported as a failure, not propagated as a crash — a verifier that dies on a forgery
+cannot report the forgery, which is the one case it exists for.
+
+## Byte-identical reports
+
+```ts
+import { serializeReport, type VerificationReport } from "@integraledger/lcp-verify";
+
+declare const report: VerificationReport;
+
+serializeReport(report); // RFC 8785 (JCS) canonical JSON
+```
+
+The protocol's promise is that independent verifiers holding the same inputs emit the same bytes. That
+requires a canonical form, and RFC 8785 is precisely the multi-producer convergence case — including the
+rule that integer-like keys sort by UTF-16 code unit rather than numerically.
+
+## Requirement ids
+
+This package's source and its messages cite short ids — `ATA-3`, `RCS-5`, `CMP-6` and their kin.
+**They are not LCP clause numbers.** LCP is cited by section (`§8.3.1`, `§C.2`); anything shaped `XXX-n`
+comes from Integra's functional specification of what a complete agent transaction requires, the fourteen
+families below. Nothing in this package's behaviour depends on them, and where an id and an LCP section
+disagree the section governs.
+
+| | | | |
+|---|---|---|---|
+| `IDN` identity | `ASP` authority to spend | `ATA` authority to accept terms | `TRM` the terms record |
+| `RCS` recourse | `PAY` payment and settlement | `WLD` the transactional weld | `OFR` offer integrity |
+| `FRC` fraud, risk, and compliance | `OPS` commercial operations | `DSC` discovery and reputation | `ORC` orchestration |
+| `CMP` composition | `PRS` persistence and verification infrastructure | | |
+
+---
+
+**Requires Node >= 24.** Part of the
+[Legal Context Protocol open layer](https://github.com/IntegraLedger/integra-protocol) — see the
+[documentation](https://github.com/IntegraLedger/integra-protocol/blob/main/docs/developer/index.md)
+and the
+[package index](https://github.com/IntegraLedger/integra-protocol/blob/main/docs/developer/reference.md).
+Apache-2.0.

package/dist/composition.d.ts

@@ -0,0 +1,53 @@
+/**
+ * The TC-4 **composition readout** — the pure step evaluators the walk appends when a
+ * `composition` slot is supplied. Each evaluator mirrors `fingerprintStep`: presence/absence over the
+ * supplied `CompositionInput` → a `StepOutcome`, no I/O, no fetch, no viem. TC-4 is a READOUT of a record
+ * complete enough to prove it was complete — these steps never gate; they only confirm or impeach.
+ *
+ * FRC is DELIBERATELY non-gating (FRC-1): `frcNonGatingStep` is impeachment-only — a signal that GATED is a
+ * `failed(risk-block)`, its ABSENCE never blocks TC-4 (it is not in `REQUIRED_STEPS["TC-4"]`).
+ */
+import type { StepOutcome } from "./report.js";
+/** What the caller can state about a record's composition. **Every field is optional, and absence is
+ *  meaningful**: an omitted field is a gap the readout reports as unproved, never an assumed `false`.
+ *  The values are the CALLER's assertions — this module performs no I/O and cannot check any of them. */
+export interface CompositionInput {
+    readonly offerBound?: boolean;
+    readonly operations?: {
+        readonly orderStateRef?: boolean;
+        readonly reconciliationIds?: boolean;
+    };
+    readonly discoveryIntegrity?: "ok" | "mismatch" | "not-checked";
+    readonly proportionalityTier?: 1 | 2 | 3 | 4;
+    readonly frcSignals?: readonly {
+        readonly role: string;
+        readonly gated: boolean;
+    }[];
+}
+/** The flattened TC-4 readout. It is a READOUT, not a verdict: nothing here gates, and `frcGated: true`
+ *  is an impeachment signal rather than a refusal. `proportionalityTier` stays `undefined` when the caller
+ *  stated none, because an unstated tier is not tier 1. */
+export interface CompositionReadout {
+    readonly offerBound: boolean;
+    readonly operationsBound: boolean;
+    readonly discoveryIntegrity: "ok" | "mismatch" | "not-checked";
+    readonly proportionalityTier: 1 | 2 | 3 | 4 | undefined;
+    readonly frcSignalCount: number;
+    readonly frcGated: boolean;
+}
+/** OFR — proved iff the offer slot is bound; an unbound offer is incompleteness (not-attempted), never a failure. */
+export declare function offerBoundStep(c: CompositionInput | undefined): StepOutcome;
+/** OPS core — the always-applicable OPS bindings (OPS-2 order/fulfillment ref AND OPS-5 reconciliation). */
+export declare function operationsStep(c: CompositionInput | undefined): StepOutcome;
+/** DSC-1/2 — "ok" proves; "mismatch" is a hard DSC-2 violation (verification-failure); else not-attempted. */
+export declare function discoveryIntegrityStep(c: CompositionInput | undefined): StepOutcome;
+/** CMP-6 — proved iff the proportionality tier is declared. */
+export declare function proportionalityStep(c: CompositionInput | undefined): StepOutcome;
+/** FRC-1 — impeachment-only: any signal that GATED is a `failed(risk-block)`; signals present but non-gating
+ *  prove the stack recorded-not-gated; no signals is not-attempted (FRC is not a v1 requirement). */
+export declare function frcNonGatingStep(c: CompositionInput | undefined): StepOutcome;
+/** Flatten a {@link CompositionInput} into a {@link CompositionReadout}. Pure and total — an `undefined`
+ *  input is legitimate and reads as "nothing stated" rather than throwing. `operationsBound` requires BOTH
+ *  operations fields; either alone is a partially-composed record and reads `false`. */
+export declare function readCompositionSlots(input: CompositionInput | undefined): CompositionReadout;
+//# sourceMappingURL=composition.d.ts.map

package/dist/composition.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"composition.d.ts","sourceRoot":"","sources":["../src/composition.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAE/C;;yGAEyG;AACzG,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,UAAU,CAAC,EAAE,OAAO,CAAC;IAC9B,QAAQ,CAAC,UAAU,CAAC,EAAE;QACpB,QAAQ,CAAC,aAAa,CAAC,EAAE,OAAO,CAAC;QACjC,QAAQ,CAAC,iBAAiB,CAAC,EAAE,OAAO,CAAC;KACtC,CAAC;IACF,QAAQ,CAAC,kBAAkB,CAAC,EAAE,IAAI,GAAG,UAAU,GAAG,aAAa,CAAC;IAChE,QAAQ,CAAC,mBAAmB,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC7C,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS;QAC7B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QACtB,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;KACzB,EAAE,CAAC;CACL;AACD;;2DAE2D;AAC3D,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,QAAQ,CAAC,eAAe,EAAE,OAAO,CAAC;IAClC,QAAQ,CAAC,kBAAkB,EAAE,IAAI,GAAG,UAAU,GAAG,aAAa,CAAC;IAC/D,QAAQ,CAAC,mBAAmB,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IACxD,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;CAC5B;AAOD,qHAAqH;AACrH,wBAAgB,cAAc,CAAC,CAAC,EAAE,gBAAgB,GAAG,SAAS,GAAG,WAAW,CAE3E;AACD,4GAA4G;AAC5G,wBAAgB,cAAc,CAAC,CAAC,EAAE,gBAAgB,GAAG,SAAS,GAAG,WAAW,CAI3E;AACD,8GAA8G;AAC9G,wBAAgB,sBAAsB,CACpC,CAAC,EAAE,gBAAgB,GAAG,SAAS,GAC9B,WAAW,CAMb;AACD,+DAA+D;AAC/D,wBAAgB,mBAAmB,CACjC,CAAC,EAAE,gBAAgB,GAAG,SAAS,GAC9B,WAAW,CAIb;AACD;qGACqG;AACrG,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,gBAAgB,GAAG,SAAS,GAAG,WAAW,CAM7E;AAED;;wFAEwF;AACxF,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,gBAAgB,GAAG,SAAS,GAClC,kBAAkB,CAYpB"}

package/dist/composition.js

@@ -0,0 +1,54 @@
+const na = (why) => ({
+    status: "not-attempted",
+    depth: why,
+});
+/** OFR — proved iff the offer slot is bound; an unbound offer is incompleteness (not-attempted), never a failure. */
+export function offerBoundStep(c) {
+    return c?.offerBound ? { status: "proved" } : na("no-offer");
+}
+/** OPS core — the always-applicable OPS bindings (OPS-2 order/fulfillment ref AND OPS-5 reconciliation). */
+export function operationsStep(c) {
+    return c?.operations?.orderStateRef && c.operations.reconciliationIds
+        ? { status: "proved" }
+        : na("ops-incomplete");
+}
+/** DSC-1/2 — "ok" proves; "mismatch" is a hard DSC-2 violation (verification-failure); else not-attempted. */
+export function discoveryIntegrityStep(c) {
+    const d = c?.discoveryIntegrity;
+    if (d === undefined || d === "not-checked")
+        return na("no-discovery-check");
+    return d === "ok"
+        ? { status: "proved" }
+        : { status: "failed", haltClass: "verification-failure" };
+}
+/** CMP-6 — proved iff the proportionality tier is declared. */
+export function proportionalityStep(c) {
+    return c?.proportionalityTier !== undefined
+        ? { status: "proved" }
+        : na("no-tier");
+}
+/** FRC-1 — impeachment-only: any signal that GATED is a `failed(risk-block)`; signals present but non-gating
+ *  prove the stack recorded-not-gated; no signals is not-attempted (FRC is not a v1 requirement). */
+export function frcNonGatingStep(c) {
+    const sigs = c?.frcSignals ?? [];
+    if (sigs.length === 0)
+        return na("no-frc-signals");
+    return sigs.some((s) => s.gated)
+        ? { status: "failed", haltClass: "risk-block" }
+        : { status: "proved" };
+}
+/** Flatten a {@link CompositionInput} into a {@link CompositionReadout}. Pure and total — an `undefined`
+ *  input is legitimate and reads as "nothing stated" rather than throwing. `operationsBound` requires BOTH
+ *  operations fields; either alone is a partially-composed record and reads `false`. */
+export function readCompositionSlots(input) {
+    const sigs = input?.frcSignals ?? [];
+    return {
+        offerBound: !!input?.offerBound,
+        operationsBound: !!(input?.operations?.orderStateRef && input.operations.reconciliationIds),
+        discoveryIntegrity: input?.discoveryIntegrity ?? "not-checked",
+        proportionalityTier: input?.proportionalityTier,
+        frcSignalCount: sigs.length,
+        frcGated: sigs.some((s) => s.gated),
+    };
+}
+//# sourceMappingURL=composition.js.map

package/dist/composition.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"composition.js","sourceRoot":"","sources":["../src/composition.ts"],"names":[],"mappings":"AAuCA,MAAM,EAAE,GAAG,CAAC,GAAW,EAAe,EAAE,CAAC,CAAC;IACxC,MAAM,EAAE,eAAe;IACvB,KAAK,EAAE,GAAG;CACX,CAAC,CAAC;AAEH,qHAAqH;AACrH,MAAM,UAAU,cAAc,CAAC,CAA+B;IAC5D,OAAO,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC;AAC/D,CAAC;AACD,4GAA4G;AAC5G,MAAM,UAAU,cAAc,CAAC,CAA+B;IAC5D,OAAO,CAAC,EAAE,UAAU,EAAE,aAAa,IAAI,CAAC,CAAC,UAAU,CAAC,iBAAiB;QACnE,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE;QACtB,CAAC,CAAC,EAAE,CAAC,gBAAgB,CAAC,CAAC;AAC3B,CAAC;AACD,8GAA8G;AAC9G,MAAM,UAAU,sBAAsB,CACpC,CAA+B;IAE/B,MAAM,CAAC,GAAG,CAAC,EAAE,kBAAkB,CAAC;IAChC,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,aAAa;QAAE,OAAO,EAAE,CAAC,oBAAoB,CAAC,CAAC;IAC5E,OAAO,CAAC,KAAK,IAAI;QACf,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE;QACtB,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,sBAAsB,EAAE,CAAC;AAC9D,CAAC;AACD,+DAA+D;AAC/D,MAAM,UAAU,mBAAmB,CACjC,CAA+B;IAE/B,OAAO,CAAC,EAAE,mBAAmB,KAAK,SAAS;QACzC,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE;QACtB,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC;AACpB,CAAC;AACD;qGACqG;AACrG,MAAM,UAAU,gBAAgB,CAAC,CAA+B;IAC9D,MAAM,IAAI,GAAG,CAAC,EAAE,UAAU,IAAI,EAAE,CAAC;IACjC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC,gBAAgB,CAAC,CAAC;IACnD,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;QAC9B,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,YAAY,EAAE;QAC/C,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;AAC3B,CAAC;AAED;;wFAEwF;AACxF,MAAM,UAAU,oBAAoB,CAClC,KAAmC;IAEnC,MAAM,IAAI,GAAG,KAAK,EAAE,UAAU,IAAI,EAAE,CAAC;IACrC,OAAO;QACL,UAAU,EAAE,CAAC,CAAC,KAAK,EAAE,UAAU;QAC/B,eAAe,EAAE,CAAC,CAAC,CACjB,KAAK,EAAE,UAAU,EAAE,aAAa,IAAI,KAAK,CAAC,UAAU,CAAC,iBAAiB,CACvE;QACD,kBAAkB,EAAE,KAAK,EAAE,kBAAkB,IAAI,aAAa;QAC9D,mBAAmB,EAAE,KAAK,EAAE,mBAAmB;QAC/C,cAAc,EAAE,IAAI,CAAC,MAAM;QAC3B,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;KACpC,CAAC;AACJ,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,104 @@
+/**
+ * `verify` — the walk at the caller-specified `depth` (default `"structural"`). Pure over
+ * its supplied inputs (the fetched ATR bytes, the enumerated settlements, the ATA chain, the acceptance)
+ * — the imperative shell that fetches them via live ports is the buyer gate's. The report is honest about
+ * coverage: a step whose inputs are absent is `not-attempted(<why>)`.
+ *
+ * At STRUCTURAL depth `verified` is always `false` (a presence/absence readout → class, not a verdict).
+ * At MECHANICAL depth `verified` is an honest function of the walk via `computeVerified` — raised `true`
+ * iff every class-required step is `proved` and no step `failed`.
+ *
+ * `supportedClass` is an HONEST READOUT, never a target: the record is *shaped for* `claimedClass`, and
+ * the structural walk can only CONFIRM-OR-IMPEACH that shape — any `failed` step downgrades it to `TC-0`;
+ * the walk never raises it (raising requires the mechanical verification `computeVerified` supplies).
+ */
+import type { Bounds, ChainWalkResult, SignatureVerifier, SignedAcceptance } from "@integraledger/lcp-authority";
+import { type CompositionInput } from "./composition.js";
+import type { VerificationReport, VerifyDepth } from "./report.js";
+import { type TransactionClass } from "./required.js";
+import { type AuthorityLink, type PlacementInput, type RecordIdentity } from "./steps.js";
+export { type CompositionInput, type CompositionReadout, discoveryIntegrityStep, frcNonGatingStep, offerBoundStep, operationsStep, proportionalityStep, readCompositionSlots, } from "./composition.js";
+export { jcsCanonicalize, type StepOutcome, serializeReport, type VerificationReport, type VerificationStep, type VerifyDepth, } from "./report.js";
+export { computeVerified, REQUIRED_STEPS, type StepName, type TransactionClass, } from "./required.js";
+export { type AuthorityLink, acceptanceStep, authorityStep, authorityStepFromWalk, commitmentStep, fingerprintStep, type PlacementInput, RCS4_REQUIRED_ROLES, type RecordIdentity, recourseStep, referencePlacementStep, resolvePartyStep, settlementStep, } from "./steps.js";
+/**
+ * Everything a verification walk is given. **The caller gathers the inputs; `verify()` opens no network
+ * connection of its own** — it takes `atrBytes`, not a reference to fetch, and takes `settlements` rather
+ * than enumerating them. That is what makes the walk pure and reproducible.
+ *
+ * Nearly every field is optional, and this is the type's central property: an absent input yields an
+ * `indeterminate` or `not-attempted` step, never a pass. `coverage` is how the report stays honest about
+ * that — it states which ports and bindings were actually supplied, so a thin walk cannot read as a
+ * thorough one.
+ */
+export interface VerifyInput {
+    /** The settlement's chain-anchored time (every validity check is evaluated against it). */
+    asOf: string;
+    /** Which ports/bindings were supplied — coverage is honest depth. */
+    coverage: {
+        ports: string[];
+        bindings: string[];
+    };
+    /** The retrieved ATR bytes (absent ⇒ the fingerprint step is indeterminate). */
+    atrBytes?: Uint8Array;
+    /** The atrHash the settlement committed (nonce/salt) — the fingerprint is checked against it. */
+    settledAtrHash?: string;
+    /** Settlements found for the fingerprint across supplied forward-indexable bindings. */
+    settlements?: unknown[];
+    /** The buyer's presented signed acceptance over the fingerprint (TRM-6). */
+    acceptance?: SignedAcceptance;
+    /** The port that checks the acceptance's signature. Absent ⇒ the acceptance step cannot prove — a
+     *  signature nobody checked is not evidence of a signature. The EVM impl is `binding-evm-common`'s. */
+    acceptanceVerifier?: SignatureVerifier;
+    /**
+     * The ATA chain to check for attenuation + as-of revocation/expiry, ALREADY FLATTENED.
+     *
+     * Whoever produced this array is a trusted oracle — every field on a link is a derived fact the step
+     * takes at face value. Prefer `authorityWalk`, which removes that trust. This door stays open because
+     * a foreign conformance subject may legitimately derive its links some other way.
+     */
+    authorityChain?: AuthorityLink[];
+    /**
+     * The custody walk's readout (`authority.walkChain`) — the PREFERRED authority input.
+     *
+     * `authorityChain` cannot express what the walk found: a spliced link, an issuer discontinuity, a root
+     * issued by someone other than the declared principal, a leaf granted to anyone but the acceptance
+     * signer. Flattening a `refused` walk throws those away and hands over links that then read as a clean
+     * `not-attempted`, so the report says the record simply did not carry a chain when in fact it carried
+     * a contradictory one. Supplied here, the refusal reaches the report WITH its halt class, and the
+     * walk's own gap depths pass through verbatim.
+     *
+     * Mutually exclusive with `authorityChain` — supplying both is a contradiction, not a precedence
+     * question, so it throws rather than silently picking one (the same ruling `makeProposalRecord` makes
+     * on its own exactly-one-of invariant).
+     */
+    authorityWalk?: ChainWalkResult;
+    /** The accepted commitment vs the leaf grant's bounds (ATA-4). */
+    commitment?: {
+        commitment: Bounds;
+        leafBounds: Bounds;
+    };
+    /** Both parties' resolutions, each at a stated assurance (IDN-1/IDN-3) — the record's `identity` slot. */
+    identity?: RecordIdentity;
+    /** The retained evidence package's manifest roles (RCS-4 completeness; `RCS4_REQUIRED_ROLES` is the floor). */
+    evidenceRoles?: readonly string[];
+    /** The class the record is shaped for (default TC-2). The taxonomy is closed (TC-0..TC-4); a caller
+     *  at a trust boundary validates untyped input before calling (Zod there, not here). */
+    claimedClass?: TransactionClass;
+    /** Verification depth (default "structural"). Mechanical depth lets `verified` be raised honestly. */
+    depth?: VerifyDepth;
+    /** The TC-4 commerce-plane slots. Absent ⇒ the composition steps are NOT appended to the walk
+     *  (TC-0..TC-3 reports are byte-identical). Present ⇒ the four required composition steps + the
+     *  impeachment-only `frc-non-gating` step are appended and flow through the existing machinery. */
+    composition?: CompositionInput;
+    /** The reference recovered from a commerce protocol's own document. Absent ⇒ the
+     *  `reference-placement` step is NOT appended and every existing report stays byte-identical. Present ⇒
+     *  the step is appended and flows through the same machinery as every other: it impeaches when it FAILS
+     *  and never blocks by its absence. REPORTED, never REQUIRED — no class lists it. */
+    placement?: PlacementInput;
+}
+/** Run the walk at the caller-specified `depth` (default `"structural"`) and emit the vector-anchored, JCS-serializable report. */
+export declare function verify(input: VerifyInput): Promise<VerificationReport>;
+/** Discriminant helper — did any step fail (the honest impeachment signal)? */
+export declare function anyStepFailed(report: VerificationReport): boolean;
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AACH,OAAO,KAAK,EACV,MAAM,EACN,eAAe,EACf,iBAAiB,EACjB,gBAAgB,EACjB,MAAM,8BAA8B,CAAC;AACtC,OAAO,EACL,KAAK,gBAAgB,EAMtB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,KAAK,EAEV,kBAAkB,EAElB,WAAW,EACZ,MAAM,aAAa,CAAC;AACrB,OAAO,EAGL,KAAK,gBAAgB,EACtB,MAAM,eAAe,CAAC;AACvB,OAAO,EACL,KAAK,aAAa,EAMlB,KAAK,cAAc,EACnB,KAAK,cAAc,EAKpB,MAAM,YAAY,CAAC;AAEpB,OAAO,EACL,KAAK,gBAAgB,EACrB,KAAK,kBAAkB,EACvB,sBAAsB,EACtB,gBAAgB,EAChB,cAAc,EACd,cAAc,EACd,mBAAmB,EACnB,oBAAoB,GACrB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EACL,eAAe,EACf,KAAK,WAAW,EAChB,eAAe,EACf,KAAK,kBAAkB,EACvB,KAAK,gBAAgB,EACrB,KAAK,WAAW,GACjB,MAAM,aAAa,CAAC;AACrB,OAAO,EACL,eAAe,EACf,cAAc,EACd,KAAK,QAAQ,EACb,KAAK,gBAAgB,GACtB,MAAM,eAAe,CAAC;AACvB,OAAO,EACL,KAAK,aAAa,EAClB,cAAc,EACd,aAAa,EACb,qBAAqB,EACrB,cAAc,EACd,eAAe,EACf,KAAK,cAAc,EACnB,mBAAmB,EACnB,KAAK,cAAc,EACnB,YAAY,EACZ,sBAAsB,EACtB,gBAAgB,EAChB,cAAc,GACf,MAAM,YAAY,CAAC;AAEpB;;;;;;;;;GASG;AACH,MAAM,WAAW,WAAW;IAC1B,2FAA2F;IAC3F,IAAI,EAAE,MAAM,CAAC;IACb,qEAAqE;IACrE,QAAQ,EAAE;QAAE,KAAK,EAAE,MAAM,EAAE,CAAC;QAAC,QAAQ,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IAClD,gFAAgF;IAChF,QAAQ,CAAC,EAAE,UAAU,CAAC;IACtB,iGAAiG;IACjG,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,wFAAwF;IACxF,WAAW,CAAC,EAAE,OAAO,EAAE,CAAC;IACxB,4EAA4E;IAC5E,UAAU,CAAC,EAAE,gBAAgB,CAAC;IAC9B;2GACuG;IACvG,kBAAkB,CAAC,EAAE,iBAAiB,CAAC;IACvC;;;;;;OAMG;IACH,cAAc,CAAC,EAAE,aAAa,EAAE,CAAC;IACjC;;;;;;;;;;;;;OAaG;IACH,aAAa,CAAC,EAAE,eAAe,CAAC;IAChC,kEAAkE;IAClE,UAAU,CAAC,EAAE;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,CAAC;IACxD,0GAA0G;IAC1G,QAAQ,CAAC,EAAE,cAAc,CAAC;IAC1B,+GAA+G;IAC/G,aAAa,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC;4FACwF;IACxF,YAAY,CAAC,EAAE,gBAAgB,CAAC;IAChC,sGAAsG;IACtG,KAAK,CAAC,EAAE,WAAW,CAAC;IACpB;;uGAEmG;IACnG,WAAW,CAAC,EAAE,gBAAgB,CAAC;IAC/B;;;yFAGqF;IACrF,SAAS,CAAC,EAAE,cAAc,CAAC;CAC5B;AAED,mIAAmI;AACnI,wBAAsB,MAAM,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,CAAC,kBAAkB,CAAC,CAuG5E;AAED,+EAA+E;AAC/E,wBAAgB,aAAa,CAAC,MAAM,EAAE,kBAAkB,GAAG,OAAO,CAIjE"}