@zanii/redact 0.1.0

package/LICENSE

@@ -0,0 +1,159 @@
+                                 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; 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.
+
+   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.
+
+   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.
+
+   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.
+
+   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.
+
+   END OF TERMS AND CONDITIONS
+
+   Copyright 2026 Zanii
+
+   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/README.md

@@ -0,0 +1,48 @@
+# @zanii/redact
+
+**Selective disclosure** for Zanii receipts — prove an agent acted on specific
+data *without revealing the rest*. Each payload field is salted and committed; the
+commitments form a Merkle tree whose **root becomes the receipt payload**. Later
+you disclose individual fields with an inclusion proof that anyone verifies against
+the immutable, anchored ledger entry — while the undisclosed fields stay hidden.
+
+For privacy-preserving audits and cross-org sharing. **No server change** — the
+log only ever sees the root.
+
+```sh
+npm install @zanii/redact @zanii/sdk
+```
+
+## Usage
+
+```ts
+import { commit, disclose, verifyDisclosure } from '@zanii/redact';
+import { ZaniiAgent } from '@zanii/sdk';
+
+const agent = new ZaniiAgent({ /* … */ });
+
+// 1. Commit the sensitive payload; record the envelope (root only):
+const c = commit({ customer: 'acme-corp', amount: 4999, ssn: '123-45-6789' });
+await agent.record({ target: 'billing.charge', payload: c.envelope });
+// keep c.secrets private
+
+// 2. Later, disclose just one field to an auditor:
+const d = disclose(c, 'amount');
+
+// 3. Anyone verifies it against the on-ledger envelope — the other fields stay hidden:
+verifyDisclosure(d, c.envelope); // → true
+```
+
+The recorded envelope contains only the Merkle root and the field *names* — never
+the values. A disclosure reveals exactly one field; a tampered value, index, or
+root fails verification. Reuses `@zanii/core`'s audited Merkle + JCS, so TS and
+Python produce identical roots and proofs (format: "Zanii Selective Disclosure v1",
+SPEC.md §12).
+
+## Changelog
+
+- **0.1.0** — initial release: `commit`, `disclose`, `verifyDisclosure`.
+
+## License
+
+Apache-2.0.

package/dist/index.d.ts

@@ -0,0 +1,47 @@
+/** The public envelope — this becomes the receipt payload. Reveals field *names*, not values. */
+export interface RedactEnvelope {
+    _zr: 'sd-v1';
+    /** `sha256:<hex>` Merkle root over the sorted field commitments. */
+    root: string;
+    /** Field names in sorted order (their index in the tree). */
+    keys: string[];
+}
+export interface CommitSecrets {
+    fields: Record<string, {
+        value: unknown;
+        salt: string;
+        index: number;
+    }>;
+    size: number;
+    keys: string[];
+    /** Hex leaf hashes, sorted by key — kept privately to produce disclosures. */
+    leaves: string[];
+}
+export interface CommitResult {
+    envelope: RedactEnvelope;
+    secrets: CommitSecrets;
+}
+/** A single-field disclosure — reveals one field + a proof it's in the committed set. */
+export interface Disclosure {
+    _zr: 'sd-disclosure-v1';
+    key: string;
+    value: unknown;
+    salt: string;
+    index: number;
+    size: number;
+    proof: string[];
+    root: string;
+}
+/**
+ * Commit to a set of fields. Record `result.envelope` as the receipt payload; keep
+ * `result.secrets` private to disclose fields later.
+ */
+export declare function commit(fields: Record<string, unknown>): CommitResult;
+/** Produce a disclosure proof for one field. */
+export declare function disclose(result: CommitResult, key: string): Disclosure;
+/**
+ * Verify a disclosure against the envelope that was recorded on the ledger. Returns
+ * true only if the revealed `(key, value)` is provably one of the committed fields.
+ */
+export declare function verifyDisclosure(d: Disclosure, envelope: RedactEnvelope): 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":"AAwBA,iGAAiG;AACjG,MAAM,WAAW,cAAc;IAC7B,GAAG,EAAE,OAAO,CAAC;IACb,oEAAoE;IACpE,IAAI,EAAE,MAAM,CAAC;IACb,6DAA6D;IAC7D,IAAI,EAAE,MAAM,EAAE,CAAC;CAChB;AAED,MAAM,WAAW,aAAa;IAC5B,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE;QAAE,KAAK,EAAE,OAAO,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACxE,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,8EAA8E;IAC9E,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,EAAE,cAAc,CAAC;IACzB,OAAO,EAAE,aAAa,CAAC;CACxB;AAED,yFAAyF;AACzF,MAAM,WAAW,UAAU;IACzB,GAAG,EAAE,kBAAkB,CAAC;IACxB,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,OAAO,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;CACd;AAED;;;GAGG;AACH,wBAAgB,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,YAAY,CAYpE;AAED,gDAAgD;AAChD,wBAAgB,QAAQ,CAAC,MAAM,EAAE,YAAY,EAAE,GAAG,EAAE,MAAM,GAAG,UAAU,CAMtE;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,UAAU,EAAE,QAAQ,EAAE,cAAc,GAAG,OAAO,CAWjF"}

package/dist/index.js

@@ -0,0 +1,69 @@
+/**
+ * @zanii/redact — selective disclosure for Zanii receipts.
+ *
+ * Prove an agent acted on specific data *without revealing the rest*. Each payload
+ * field is salted and committed; the commitments form a Merkle tree whose **root
+ * becomes the receipt payload** (so the ledger sees only the root — no server
+ * change). Later you disclose individual fields with an inclusion proof that anyone
+ * verifies against the immutable, anchored entry, while the undisclosed fields stay
+ * hidden. Privacy-preserving audits and cross-org sharing.
+ *
+ * Reuses `@zanii/core`'s audited Merkle + JCS, so TS and Python produce identical
+ * roots and proofs. Format: "Zanii Selective Disclosure v1" (see SPEC.md §12).
+ */
+import { canonicalBytes, inclusionProof, leafHash, merkleRoot, verifyInclusion } from '@zanii/core';
+import { randomBytes } from 'node:crypto';
+const hex = (b) => Buffer.from(b).toString('hex');
+const unhex = (h) => new Uint8Array(Buffer.from(h, 'hex'));
+/** Domain-separated field commitment leaf: leafHash(JCS(["zr-field-v1", key, value, salt])). */
+function fieldLeaf(key, value, saltHex) {
+    return leafHash(canonicalBytes(['zr-field-v1', key, value, saltHex]));
+}
+/**
+ * Commit to a set of fields. Record `result.envelope` as the receipt payload; keep
+ * `result.secrets` private to disclose fields later.
+ */
+export function commit(fields) {
+    const keys = Object.keys(fields).sort();
+    if (keys.length === 0)
+        throw new Error('commit requires at least one field');
+    const salts = keys.map(() => randomBytes(16).toString('hex'));
+    const leaves = keys.map((k, i) => fieldLeaf(k, fields[k], salts[i]));
+    const root = merkleRoot(leaves);
+    const secretFields = {};
+    keys.forEach((k, i) => { secretFields[k] = { value: fields[k], salt: salts[i], index: i }; });
+    return {
+        envelope: { _zr: 'sd-v1', root: `sha256:${hex(root)}`, keys },
+        secrets: { fields: secretFields, size: keys.length, keys, leaves: leaves.map(hex) },
+    };
+}
+/** Produce a disclosure proof for one field. */
+export function disclose(result, key) {
+    const f = result.secrets.fields[key];
+    if (!f)
+        throw new Error(`unknown field '${key}'`);
+    const leaves = result.secrets.leaves.map(unhex);
+    const proof = inclusionProof(f.index, leaves).map(hex);
+    return { _zr: 'sd-disclosure-v1', key, value: f.value, salt: f.salt, index: f.index, size: result.secrets.size, proof, root: result.envelope.root };
+}
+/**
+ * Verify a disclosure against the envelope that was recorded on the ledger. Returns
+ * true only if the revealed `(key, value)` is provably one of the committed fields.
+ */
+export function verifyDisclosure(d, envelope) {
+    if (d.root !== envelope.root)
+        return false;
+    if (d.size !== envelope.keys.length)
+        return false;
+    if (envelope.keys[d.index] !== d.key)
+        return false;
+    const leaf = fieldLeaf(d.key, d.value, d.salt);
+    const rootBytes = unhex(envelope.root.replace('sha256:', ''));
+    try {
+        return verifyInclusion(leaf, d.index, d.size, d.proof.map(unhex), rootBytes);
+    }
+    catch {
+        return false;
+    }
+}
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,QAAQ,EAAE,UAAU,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AACpG,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAE1C,MAAM,GAAG,GAAG,CAAC,CAAa,EAAU,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AACtE,MAAM,KAAK,GAAG,CAAC,CAAS,EAAc,EAAE,CAAC,IAAI,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;AAE/E,gGAAgG;AAChG,SAAS,SAAS,CAAC,GAAW,EAAE,KAAc,EAAE,OAAe;IAC7D,OAAO,QAAQ,CAAC,cAAc,CAAC,CAAC,aAAa,EAAE,GAAG,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;AACxE,CAAC;AAoCD;;;GAGG;AACH,MAAM,UAAU,MAAM,CAAC,MAA+B;IACpD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;IACxC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;IAC7E,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IAC9D,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;IACtE,MAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;IAChC,MAAM,YAAY,GAA4B,EAAE,CAAC;IACjD,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/F,OAAO;QACL,QAAQ,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE;QAC7D,OAAO,EAAE,EAAE,MAAM,EAAE,YAAY,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;KACpF,CAAC;AACJ,CAAC;AAED,gDAAgD;AAChD,MAAM,UAAU,QAAQ,CAAC,MAAoB,EAAE,GAAW;IACxD,MAAM,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACrC,IAAI,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,kBAAkB,GAAG,GAAG,CAAC,CAAC;IAClD,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAChD,MAAM,KAAK,GAAG,cAAc,CAAC,CAAC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACvD,OAAO,EAAE,GAAG,EAAE,kBAAkB,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;AACtJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAa,EAAE,QAAwB;IACtE,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IAC3C,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IAClD,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG;QAAE,OAAO,KAAK,CAAC;IACnD,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IAC/C,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC;IAC9D,IAAI,CAAC;QACH,OAAO,eAAe,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,SAAS,CAAC,CAAC;IAC/E,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC"}

package/package.json

@@ -0,0 +1,41 @@
+{
+  "name": "@zanii/redact",
+  "version": "0.1.0",
+  "description": "Selective disclosure for Zanii receipts - prove an agent acted on specific data without revealing the rest, via salted field commitments and Merkle inclusion proofs.",
+  "license": "Apache-2.0",
+  "homepage": "https://ledger.zanii.agency",
+  "type": "module",
+  "main": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js"
+    }
+  },
+  "files": [
+    "dist",
+    "src",
+    "README.md",
+    "LICENSE"
+  ],
+  "publishConfig": {
+    "access": "public"
+  },
+  "engines": {
+    "node": ">=18"
+  },
+  "devDependencies": {
+    "@types/node": "^26.1.0",
+    "typescript": "^5.8.2",
+    "vitest": "^3.0.9"
+  },
+  "dependencies": {
+    "@zanii/core": "0.2.0"
+  },
+  "scripts": {
+    "build": "tsc -p tsconfig.build.json",
+    "test": "vitest run",
+    "typecheck": "tsc --noEmit"
+  }
+}

package/src/index.ts

@@ -0,0 +1,101 @@
+/**
+ * @zanii/redact — selective disclosure for Zanii receipts.
+ *
+ * Prove an agent acted on specific data *without revealing the rest*. Each payload
+ * field is salted and committed; the commitments form a Merkle tree whose **root
+ * becomes the receipt payload** (so the ledger sees only the root — no server
+ * change). Later you disclose individual fields with an inclusion proof that anyone
+ * verifies against the immutable, anchored entry, while the undisclosed fields stay
+ * hidden. Privacy-preserving audits and cross-org sharing.
+ *
+ * Reuses `@zanii/core`'s audited Merkle + JCS, so TS and Python produce identical
+ * roots and proofs. Format: "Zanii Selective Disclosure v1" (see SPEC.md §12).
+ */
+import { canonicalBytes, inclusionProof, leafHash, merkleRoot, verifyInclusion } from '@zanii/core';
+import { randomBytes } from 'node:crypto';
+
+const hex = (b: Uint8Array): string => Buffer.from(b).toString('hex');
+const unhex = (h: string): Uint8Array => new Uint8Array(Buffer.from(h, 'hex'));
+
+/** Domain-separated field commitment leaf: leafHash(JCS(["zr-field-v1", key, value, salt])). */
+function fieldLeaf(key: string, value: unknown, saltHex: string): Uint8Array {
+  return leafHash(canonicalBytes(['zr-field-v1', key, value, saltHex]));
+}
+
+/** The public envelope — this becomes the receipt payload. Reveals field *names*, not values. */
+export interface RedactEnvelope {
+  _zr: 'sd-v1';
+  /** `sha256:<hex>` Merkle root over the sorted field commitments. */
+  root: string;
+  /** Field names in sorted order (their index in the tree). */
+  keys: string[];
+}
+
+export interface CommitSecrets {
+  fields: Record<string, { value: unknown; salt: string; index: number }>;
+  size: number;
+  keys: string[];
+  /** Hex leaf hashes, sorted by key — kept privately to produce disclosures. */
+  leaves: string[];
+}
+
+export interface CommitResult {
+  envelope: RedactEnvelope;
+  secrets: CommitSecrets;
+}
+
+/** A single-field disclosure — reveals one field + a proof it's in the committed set. */
+export interface Disclosure {
+  _zr: 'sd-disclosure-v1';
+  key: string;
+  value: unknown;
+  salt: string;
+  index: number;
+  size: number;
+  proof: string[];
+  root: string;
+}
+
+/**
+ * Commit to a set of fields. Record `result.envelope` as the receipt payload; keep
+ * `result.secrets` private to disclose fields later.
+ */
+export function commit(fields: Record<string, unknown>): CommitResult {
+  const keys = Object.keys(fields).sort();
+  if (keys.length === 0) throw new Error('commit requires at least one field');
+  const salts = keys.map(() => randomBytes(16).toString('hex'));
+  const leaves = keys.map((k, i) => fieldLeaf(k, fields[k], salts[i]!));
+  const root = merkleRoot(leaves);
+  const secretFields: CommitSecrets['fields'] = {};
+  keys.forEach((k, i) => { secretFields[k] = { value: fields[k], salt: salts[i]!, index: i }; });
+  return {
+    envelope: { _zr: 'sd-v1', root: `sha256:${hex(root)}`, keys },
+    secrets: { fields: secretFields, size: keys.length, keys, leaves: leaves.map(hex) },
+  };
+}
+
+/** Produce a disclosure proof for one field. */
+export function disclose(result: CommitResult, key: string): Disclosure {
+  const f = result.secrets.fields[key];
+  if (!f) throw new Error(`unknown field '${key}'`);
+  const leaves = result.secrets.leaves.map(unhex);
+  const proof = inclusionProof(f.index, leaves).map(hex);
+  return { _zr: 'sd-disclosure-v1', key, value: f.value, salt: f.salt, index: f.index, size: result.secrets.size, proof, root: result.envelope.root };
+}
+
+/**
+ * Verify a disclosure against the envelope that was recorded on the ledger. Returns
+ * true only if the revealed `(key, value)` is provably one of the committed fields.
+ */
+export function verifyDisclosure(d: Disclosure, envelope: RedactEnvelope): boolean {
+  if (d.root !== envelope.root) return false;
+  if (d.size !== envelope.keys.length) return false;
+  if (envelope.keys[d.index] !== d.key) return false;
+  const leaf = fieldLeaf(d.key, d.value, d.salt);
+  const rootBytes = unhex(envelope.root.replace('sha256:', ''));
+  try {
+    return verifyInclusion(leaf, d.index, d.size, d.proof.map(unhex), rootBytes);
+  } catch {
+    return false;
+  }
+}