@zanii/decisions 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,49 @@
+# @zanii/decisions
+
+**Auditable algorithmic decisions about a person.** A driver, seller, or creator can't
+audit the decisions platforms' algorithms make about them — dispatch, ranking,
+demonetization, payout. `@zanii/subject` already gives them *their slice*; this adds the
+decision-shaped receipt and the one fairness claim cryptography can actually make.
+
+**What it truthfully proves:**
+1. **Completeness** — every decision about me is on the record, ordered, tamper-evident.
+2. **Rule-consistency** — every decision carries `manifest_hash` (which algorithm/policy
+   version governed it; the builder **rejects** a decision without a rulebook). A worker —
+   or a regulator across many workers — verifies the **same rulebook decided everyone**,
+   and exactly when it changed. `ruleConsistency` flags interleaved rulebooks: rules that
+   differed between people at the same time.
+3. **Factor commitment** — the inputs the algorithm used are salt-committed at decision
+   time; in a dispute the platform discloses *my* factors to me alone, provably what was
+   committed — not a post-hoc rationalization.
+
+**What it cannot prove (read this):** that the algorithm is *fair* — no receipt makes a
+bad rule good. It converts "trust our algorithm" into **same rules, complete record,
+committed inputs** — which is what platform-work transparency regulation actually asks for.
+
+```sh
+npm install @zanii/decisions @zanii/subject @zanii/core
+```
+
+```ts
+import { buildDecisionReceipt, ruleConsistency } from '@zanii/decisions';
+
+// platform side — at decision time:
+const d = buildDecisionReceipt({
+  subjectDid: driver.did, platform: 'gig.example.com',
+  kind: 'dispatch', manifestHash: deployedRulesHash,      // required — no rulebook, no receipt
+  outcome: { assigned: false }, factors: { rating: 4.9, distance_km: 2.1 }, ts,
+});
+await zanii.record({ target: d.target, payload: d.payload, subjectTag: d.subjectTag });
+// keep d.nonce — in a dispute, disclose the committed factors with verifyPayload
+
+// auditor side — over a slice (one worker, or many):
+ruleConsistency(payloads); // rulebook windows + the interleaving red flag
+```
+
+Reference kinds: `dispatch`, `rank`, `payout` — any string works.
+
+## Changelog
+- **0.1.0** — initial release: `buildDecisionReceipt`, `verifyDecision`, `ruleConsistency`.
+
+## License
+Apache-2.0.

package/dist/index.d.ts

@@ -0,0 +1,56 @@
+/** Reference kinds; any string works. */
+export type DecisionKind = 'dispatch' | 'rank' | 'payout' | (string & {});
+export interface DecisionInput {
+    /** The worker/creator the decision is about (their did:key)… */
+    subjectDid?: string;
+    platform?: string;
+    /** …or a precomputed subject tag. */
+    tag?: string;
+    kind: DecisionKind;
+    /** REQUIRED: hash of the algorithm/policy version that governed this decision. */
+    manifestHash: string;
+    /** The decision's outcome (visible on the receipt payload, e.g. `{ assigned: true }`). */
+    outcome: Record<string, unknown>;
+    /** The inputs the algorithm used — salt-committed, never raw on-ledger. */
+    factors?: Record<string, unknown>;
+    ts: string;
+}
+export interface DecisionReceipt {
+    /** `decision.<kind>` — pass to `agent.record({ target, payload, subjectTag })`. */
+    target: string;
+    payload: Record<string, unknown>;
+    /** Stamp this as the receipt's `subjectTag` so the worker's slice includes it. */
+    subjectTag: string;
+    /** REQUIRED for `provenance.manifestHash` on `record` too, if you want it receipt-level. */
+    manifestHash: string;
+    /** Keep to disclose the factors in a dispute (`verifyPayload`). Empty if no factors. */
+    nonce: string;
+}
+/** Build a decision receipt. A decision without a rulebook (`manifestHash`) is rejected. */
+export declare function buildDecisionReceipt(input: DecisionInput): DecisionReceipt;
+export interface DecisionCheck {
+    ok: boolean;
+    reasons: string[];
+}
+/** Structurally validate a decision payload (rulebook hash present, ts valid). */
+export declare function verifyDecision(payload: Record<string, unknown> | undefined): DecisionCheck;
+export interface RulebookWindow {
+    manifest_hash: string;
+    count: number;
+    first_ts: string;
+    last_ts: string;
+}
+export interface ConsistencyReport {
+    /** Rulebook windows ordered by first use. */
+    rulebooks: RulebookWindow[];
+    /** true iff rulebook usage windows don't interleave — one rulebook at a time, clean cutovers. */
+    consistent: boolean;
+    reasons: string[];
+}
+/**
+ * The audit artifact: group decision payloads by `manifest_hash` over time. Consistent =
+ * one rulebook at a time with clean cutovers (no per-person rule switching); an
+ * interleaved window is the red flag a regulator looks for.
+ */
+export declare function ruleConsistency(payloads: Array<Record<string, unknown>>): ConsistencyReport;
+//# 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":"AAyBA,yCAAyC;AACzC,MAAM,MAAM,YAAY,GAAG,UAAU,GAAG,MAAM,GAAG,QAAQ,GAAG,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC;AAE1E,MAAM,WAAW,aAAa;IAC5B,gEAAgE;IAChE,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,qCAAqC;IACrC,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,YAAY,CAAC;IACnB,kFAAkF;IAClF,YAAY,EAAE,MAAM,CAAC;IACrB,0FAA0F;IAC1F,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACjC,2EAA2E;IAC3E,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAClC,EAAE,EAAE,MAAM,CAAC;CACZ;AAED,MAAM,WAAW,eAAe;IAC9B,mFAAmF;IACnF,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACjC,kFAAkF;IAClF,UAAU,EAAE,MAAM,CAAC;IACnB,4FAA4F;IAC5F,YAAY,EAAE,MAAM,CAAC;IACrB,wFAAwF;IACxF,KAAK,EAAE,MAAM,CAAC;CACf;AAED,4FAA4F;AAC5F,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,aAAa,GAAG,eAAe,CAkB1E;AAED,MAAM,WAAW,aAAa;IAC5B,EAAE,EAAE,OAAO,CAAC;IACZ,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB;AAED,kFAAkF;AAClF,wBAAgB,cAAc,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,GAAG,aAAa,CAQ1F;AAED,MAAM,WAAW,cAAc;IAC7B,aAAa,EAAE,MAAM,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,iBAAiB;IAChC,6CAA6C;IAC7C,SAAS,EAAE,cAAc,EAAE,CAAC;IAC5B,iGAAiG;IACjG,UAAU,EAAE,OAAO,CAAC;IACpB,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,QAAQ,EAAE,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,GAAG,iBAAiB,CA2B3F"}

package/dist/index.js

@@ -0,0 +1,96 @@
+/**
+ * @zanii/decisions — gig/creator algorithmic fairness: auditable decisions about a person.
+ *
+ * A driver, seller, or creator can't audit the algorithmic decisions made about them —
+ * dispatch, ranking, demonetization, payout. Per-subject auditability (`@zanii/subject`)
+ * already gives them *their slice*; this adds the decision-shaped receipt and the one
+ * fairness claim cryptography can actually make.
+ *
+ * What it truthfully proves:
+ * 1. **Completeness** — every decision about me is on the record, ordered, tamper-evident.
+ * 2. **Rule-consistency** — every decision receipt MUST carry `manifest_hash` (which
+ *    algorithm/policy version governed it — the builder rejects a decision without a
+ *    rulebook). A worker, or a regulator across many workers, can verify the SAME
+ *    rulebook decided everyone in a period, and exactly when it changed.
+ * 3. **Factor commitment** — the inputs the platform claims it used are salt-committed at
+ *    decision time; in a dispute it discloses my factors to me alone (`@zanii/redact` /
+ *    `verifyPayload`) — provably what was committed, not a post-hoc rationalization.
+ *
+ * What it cannot prove (say it): that the algorithm is **fair** — no receipt makes a bad
+ * rule good. It converts "trust our algorithm" into "same rules, complete record,
+ * committed inputs" — which is what platform-work transparency regulation actually asks.
+ */
+import { saltedPayloadHash } from '@zanii/core';
+import { subjectTag } from '@zanii/subject';
+/** Build a decision receipt. A decision without a rulebook (`manifestHash`) is rejected. */
+export function buildDecisionReceipt(input) {
+    if (!input.kind)
+        throw new Error('kind is required');
+    if (!input.manifestHash)
+        throw new Error('manifestHash is required — a decision receipt without the governing rulebook is not auditable');
+    if (Number.isNaN(Date.parse(input.ts)))
+        throw new Error('ts must be an ISO timestamp');
+    const tag = input.tag ?? subjectTag(input.subjectDid ?? '', input.platform ?? '');
+    const { payload_hash, nonce } = input.factors !== undefined
+        ? saltedPayloadHash(JSON.stringify(input.factors))
+        : { payload_hash: undefined, nonce: '' };
+    const payload = {
+        _zr_kind: 'decision',
+        v: 1,
+        kind: input.kind,
+        manifest_hash: input.manifestHash,
+        outcome: input.outcome,
+        ...(payload_hash ? { factors_commitment: payload_hash } : {}),
+        ts: input.ts,
+    };
+    return { target: `decision.${input.kind}`, payload, subjectTag: tag, manifestHash: input.manifestHash, nonce };
+}
+/** Structurally validate a decision payload (rulebook hash present, ts valid). */
+export function verifyDecision(payload) {
+    const reasons = [];
+    const p = payload ?? {};
+    if (p._zr_kind !== 'decision' || p.v !== 1)
+        reasons.push('not a decision receipt (v1)');
+    if (!p.kind)
+        reasons.push('missing kind');
+    if (typeof p.manifest_hash !== 'string' || !p.manifest_hash)
+        reasons.push('missing manifest_hash (no governing rulebook)');
+    if (typeof p.ts !== 'string' || Number.isNaN(Date.parse(p.ts)))
+        reasons.push('missing/invalid ts');
+    return { ok: reasons.length === 0, reasons };
+}
+/**
+ * The audit artifact: group decision payloads by `manifest_hash` over time. Consistent =
+ * one rulebook at a time with clean cutovers (no per-person rule switching); an
+ * interleaved window is the red flag a regulator looks for.
+ */
+export function ruleConsistency(payloads) {
+    const reasons = [];
+    const windows = new Map();
+    const ordered = [...payloads].sort((a, b) => String(a.ts).localeCompare(String(b.ts)));
+    for (const p of ordered) {
+        const check = verifyDecision(p);
+        if (!check.ok) {
+            reasons.push(`invalid decision: ${check.reasons.join('; ')}`);
+            continue;
+        }
+        const h = p.manifest_hash;
+        const ts = p.ts;
+        const w = windows.get(h);
+        if (w) {
+            w.count += 1;
+            w.last_ts = ts;
+        }
+        else {
+            windows.set(h, { manifest_hash: h, count: 1, first_ts: ts, last_ts: ts });
+        }
+    }
+    const rulebooks = [...windows.values()].sort((a, b) => a.first_ts.localeCompare(b.first_ts));
+    for (let i = 1; i < rulebooks.length; i++) {
+        if (rulebooks[i].first_ts < rulebooks[i - 1].last_ts) {
+            reasons.push(`rulebooks ${rulebooks[i - 1].manifest_hash} and ${rulebooks[i].manifest_hash} interleave — rules differed between people at the same time`);
+        }
+    }
+    return { rulebooks, consistent: reasons.length === 0, reasons };
+}
+//# 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;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,OAAO,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAChD,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAiC5C,4FAA4F;AAC5F,MAAM,UAAU,oBAAoB,CAAC,KAAoB;IACvD,IAAI,CAAC,KAAK,CAAC,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,kBAAkB,CAAC,CAAC;IACrD,IAAI,CAAC,KAAK,CAAC,YAAY;QAAE,MAAM,IAAI,KAAK,CAAC,+FAA+F,CAAC,CAAC;IAC1I,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;IACvF,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,UAAU,IAAI,EAAE,EAAE,KAAK,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC;IAClF,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,OAAO,KAAK,SAAS;QACzD,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAClD,CAAC,CAAC,EAAE,YAAY,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;IAC3C,MAAM,OAAO,GAA4B;QACvC,QAAQ,EAAE,UAAU;QACpB,CAAC,EAAE,CAAC;QACJ,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,aAAa,EAAE,KAAK,CAAC,YAAY;QACjC,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,kBAAkB,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7D,EAAE,EAAE,KAAK,CAAC,EAAE;KACb,CAAC;IACF,OAAO,EAAE,MAAM,EAAE,YAAY,KAAK,CAAC,IAAI,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,EAAE,YAAY,EAAE,KAAK,CAAC,YAAY,EAAE,KAAK,EAAE,CAAC;AACjH,CAAC;AAOD,kFAAkF;AAClF,MAAM,UAAU,cAAc,CAAC,OAA4C;IACzE,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,CAAC,GAAG,OAAO,IAAI,EAAE,CAAC;IACxB,IAAI,CAAC,CAAC,QAAQ,KAAK,UAAU,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,6BAA6B,CAAC,CAAC;IACxF,IAAI,CAAC,CAAC,CAAC,IAAI;QAAE,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAC1C,IAAI,OAAO,CAAC,CAAC,aAAa,KAAK,QAAQ,IAAI,CAAC,CAAC,CAAC,aAAa;QAAE,OAAO,CAAC,IAAI,CAAC,+CAA+C,CAAC,CAAC;IAC3H,IAAI,OAAO,CAAC,CAAC,EAAE,KAAK,QAAQ,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;IACnG,OAAO,EAAE,EAAE,EAAE,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,OAAO,EAAE,CAAC;AAC/C,CAAC;AAiBD;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,QAAwC;IACtE,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,OAAO,GAAG,IAAI,GAAG,EAA0B,CAAC;IAClD,MAAM,OAAO,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACvF,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,KAAK,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC;YACd,OAAO,CAAC,IAAI,CAAC,qBAAqB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC9D,SAAS;QACX,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,CAAC,aAAuB,CAAC;QACpC,MAAM,EAAE,GAAG,CAAC,CAAC,EAAY,CAAC;QAC1B,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,EAAE,CAAC;YACN,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;YACb,CAAC,CAAC,OAAO,GAAG,EAAE,CAAC;QACjB,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;QAC5E,CAAC;IACH,CAAC;IACD,MAAM,SAAS,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC7F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,IAAI,SAAS,CAAC,CAAC,CAAE,CAAC,QAAQ,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,OAAO,EAAE,CAAC;YACvD,OAAO,CAAC,IAAI,CAAC,aAAa,SAAS,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,aAAa,QAAQ,SAAS,CAAC,CAAC,CAAE,CAAC,aAAa,8DAA8D,CAAC,CAAC;QAC9J,CAAC;IACH,CAAC;IACD,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,OAAO,EAAE,CAAC;AAClE,CAAC"}

package/package.json

@@ -0,0 +1,42 @@
+{
+  "name": "@zanii/decisions",
+  "version": "0.1.0",
+  "description": "Gig/creator algorithmic fairness: decision receipts a worker can audit — completeness (every decision about me, tamper-evident), rule-consistency (the same rulebook decided everyone, via manifest_hash), and committed factors (no post-hoc rationalization). Never claims 'the algorithm is fair'.",
+  "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/subject": "0.1.0",
+    "@zanii/core": "0.4.0"
+  },
+  "scripts": {
+    "build": "tsc -p tsconfig.build.json",
+    "test": "vitest run",
+    "typecheck": "tsc --noEmit"
+  }
+}

package/src/index.ts

@@ -0,0 +1,141 @@
+/**
+ * @zanii/decisions — gig/creator algorithmic fairness: auditable decisions about a person.
+ *
+ * A driver, seller, or creator can't audit the algorithmic decisions made about them —
+ * dispatch, ranking, demonetization, payout. Per-subject auditability (`@zanii/subject`)
+ * already gives them *their slice*; this adds the decision-shaped receipt and the one
+ * fairness claim cryptography can actually make.
+ *
+ * What it truthfully proves:
+ * 1. **Completeness** — every decision about me is on the record, ordered, tamper-evident.
+ * 2. **Rule-consistency** — every decision receipt MUST carry `manifest_hash` (which
+ *    algorithm/policy version governed it — the builder rejects a decision without a
+ *    rulebook). A worker, or a regulator across many workers, can verify the SAME
+ *    rulebook decided everyone in a period, and exactly when it changed.
+ * 3. **Factor commitment** — the inputs the platform claims it used are salt-committed at
+ *    decision time; in a dispute it discloses my factors to me alone (`@zanii/redact` /
+ *    `verifyPayload`) — provably what was committed, not a post-hoc rationalization.
+ *
+ * What it cannot prove (say it): that the algorithm is **fair** — no receipt makes a bad
+ * rule good. It converts "trust our algorithm" into "same rules, complete record,
+ * committed inputs" — which is what platform-work transparency regulation actually asks.
+ */
+import { saltedPayloadHash } from '@zanii/core';
+import { subjectTag } from '@zanii/subject';
+
+/** Reference kinds; any string works. */
+export type DecisionKind = 'dispatch' | 'rank' | 'payout' | (string & {});
+
+export interface DecisionInput {
+  /** The worker/creator the decision is about (their did:key)… */
+  subjectDid?: string;
+  platform?: string;
+  /** …or a precomputed subject tag. */
+  tag?: string;
+  kind: DecisionKind;
+  /** REQUIRED: hash of the algorithm/policy version that governed this decision. */
+  manifestHash: string;
+  /** The decision's outcome (visible on the receipt payload, e.g. `{ assigned: true }`). */
+  outcome: Record<string, unknown>;
+  /** The inputs the algorithm used — salt-committed, never raw on-ledger. */
+  factors?: Record<string, unknown>;
+  ts: string;
+}
+
+export interface DecisionReceipt {
+  /** `decision.<kind>` — pass to `agent.record({ target, payload, subjectTag })`. */
+  target: string;
+  payload: Record<string, unknown>;
+  /** Stamp this as the receipt's `subjectTag` so the worker's slice includes it. */
+  subjectTag: string;
+  /** REQUIRED for `provenance.manifestHash` on `record` too, if you want it receipt-level. */
+  manifestHash: string;
+  /** Keep to disclose the factors in a dispute (`verifyPayload`). Empty if no factors. */
+  nonce: string;
+}
+
+/** Build a decision receipt. A decision without a rulebook (`manifestHash`) is rejected. */
+export function buildDecisionReceipt(input: DecisionInput): DecisionReceipt {
+  if (!input.kind) throw new Error('kind is required');
+  if (!input.manifestHash) throw new Error('manifestHash is required — a decision receipt without the governing rulebook is not auditable');
+  if (Number.isNaN(Date.parse(input.ts))) throw new Error('ts must be an ISO timestamp');
+  const tag = input.tag ?? subjectTag(input.subjectDid ?? '', input.platform ?? '');
+  const { payload_hash, nonce } = input.factors !== undefined
+    ? saltedPayloadHash(JSON.stringify(input.factors))
+    : { payload_hash: undefined, nonce: '' };
+  const payload: Record<string, unknown> = {
+    _zr_kind: 'decision',
+    v: 1,
+    kind: input.kind,
+    manifest_hash: input.manifestHash,
+    outcome: input.outcome,
+    ...(payload_hash ? { factors_commitment: payload_hash } : {}),
+    ts: input.ts,
+  };
+  return { target: `decision.${input.kind}`, payload, subjectTag: tag, manifestHash: input.manifestHash, nonce };
+}
+
+export interface DecisionCheck {
+  ok: boolean;
+  reasons: string[];
+}
+
+/** Structurally validate a decision payload (rulebook hash present, ts valid). */
+export function verifyDecision(payload: Record<string, unknown> | undefined): DecisionCheck {
+  const reasons: string[] = [];
+  const p = payload ?? {};
+  if (p._zr_kind !== 'decision' || p.v !== 1) reasons.push('not a decision receipt (v1)');
+  if (!p.kind) reasons.push('missing kind');
+  if (typeof p.manifest_hash !== 'string' || !p.manifest_hash) reasons.push('missing manifest_hash (no governing rulebook)');
+  if (typeof p.ts !== 'string' || Number.isNaN(Date.parse(p.ts))) reasons.push('missing/invalid ts');
+  return { ok: reasons.length === 0, reasons };
+}
+
+export interface RulebookWindow {
+  manifest_hash: string;
+  count: number;
+  first_ts: string;
+  last_ts: string;
+}
+
+export interface ConsistencyReport {
+  /** Rulebook windows ordered by first use. */
+  rulebooks: RulebookWindow[];
+  /** true iff rulebook usage windows don't interleave — one rulebook at a time, clean cutovers. */
+  consistent: boolean;
+  reasons: string[];
+}
+
+/**
+ * The audit artifact: group decision payloads by `manifest_hash` over time. Consistent =
+ * one rulebook at a time with clean cutovers (no per-person rule switching); an
+ * interleaved window is the red flag a regulator looks for.
+ */
+export function ruleConsistency(payloads: Array<Record<string, unknown>>): ConsistencyReport {
+  const reasons: string[] = [];
+  const windows = new Map<string, RulebookWindow>();
+  const ordered = [...payloads].sort((a, b) => String(a.ts).localeCompare(String(b.ts)));
+  for (const p of ordered) {
+    const check = verifyDecision(p);
+    if (!check.ok) {
+      reasons.push(`invalid decision: ${check.reasons.join('; ')}`);
+      continue;
+    }
+    const h = p.manifest_hash as string;
+    const ts = p.ts as string;
+    const w = windows.get(h);
+    if (w) {
+      w.count += 1;
+      w.last_ts = ts;
+    } else {
+      windows.set(h, { manifest_hash: h, count: 1, first_ts: ts, last_ts: ts });
+    }
+  }
+  const rulebooks = [...windows.values()].sort((a, b) => a.first_ts.localeCompare(b.first_ts));
+  for (let i = 1; i < rulebooks.length; i++) {
+    if (rulebooks[i]!.first_ts < rulebooks[i - 1]!.last_ts) {
+      reasons.push(`rulebooks ${rulebooks[i - 1]!.manifest_hash} and ${rulebooks[i]!.manifest_hash} interleave — rules differed between people at the same time`);
+    }
+  }
+  return { rulebooks, consistent: reasons.length === 0, reasons };
+}