@zanii/succession 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,54 @@
+# @zanii/succession
+
+Agent lifecycle: **key rotation with signed continuity**. An agent's did:key IS its
+key, so rotating a compromised key normally kills its reputation, CV history, and
+counterparty trust. Succession fixes it: the **owner** — the same root authority whose
+delegation empowered the old key — signs "agent B is the successor of agent A", and
+verifiers follow the lineage instead of starting from zero.
+
+```sh
+npm install @zanii/succession @zanii/core @zanii/a2a-directory
+```
+
+```ts
+import { buildSuccessionBody, signSuccession, assembleSuccession, verifySuccession, verifyLineage, combinedSummary } from '@zanii/succession';
+
+// planned rotation — old key still safe, so it countersigns (the strong form)
+const body = buildSuccessionBody({ predecessor: oldAgent.did, successor: newAgent.did, owner: owner.did, reason: 'rotation', ts: now });
+const s = assembleSuccession(body, [
+  signSuccession(body, owner.did, ownerKey),        // REQUIRED — the trust anchor
+  signSuccession(body, oldAgent.did, oldAgentKey),  // optional — sets `cosigned`
+]);
+verifySuccession(s);          // { ok, reasons, cosigned }
+
+// after a compromise, compromised_at is REQUIRED — it brackets the trusted window
+buildSuccessionBody({ ..., reason: 'compromise', compromisedAt: '2026-07-20T00:00:00Z' });
+
+// walk a chain A→B→C and aggregate reputation across it (conservatively)
+verifyLineage(links, currentDid);                   // { ok, lineage: [oldest…newest] }
+combinedSummary(links, trusts, currentDid);         // sums + explicit caveats
+```
+
+Python: `from zanii.succession import build_succession_body, verify_lineage, combined_summary, ...`
+— byte-identical JCS objects and hashes.
+
+## The rules that keep it honest
+
+- **No owner, no succession** — anyone can *claim* to succeed anyone; only the owner's
+  signature makes it real. After a compromise the predecessor's signature is
+  deliberately NOT required (the attacker holds that key).
+- **`compromise` requires `compromised_at`** — history transfers, but receipts after
+  that instant under the old key may be the attacker's; `combinedSummary` says so in
+  its `caveats` instead of silently inheriting them. Pair with a revocation of the old
+  delegation: succession records continuity, revocation kills the old authority.
+- **One lineage, one owner** — a lineage spanning owners is refused; an ownership
+  transfer is a sale, not a succession, and conflating them would launder history.
+- **Conservative aggregation** — combined receipt counts are an upper bound and say
+  so; counterparties are deliberately not summed (overlap is unknowable).
+
+## The limit, stated up front
+
+Succession proves **continuity of authority** — the owner vouches that B carries A's
+mandate. It does NOT prove B runs the same code or behaves like A (`@zanii/attest` is
+for which-code-ran). And it is the owner's attestation: a lying owner's lie is signed
+and permanent — attributable, not impossible.

package/dist/index.d.ts

@@ -0,0 +1,83 @@
+import type { AgentTrust } from '@zanii/a2a-directory';
+export type SuccessionReason = 'rotation' | 'compromise' | 'retirement';
+export interface SuccessionBody {
+    v: 1;
+    type: 'succession';
+    /** The agent being succeeded (the old did:key). */
+    predecessor: string;
+    /** The agent taking over (the new did:key). */
+    successor: string;
+    /** The root authority attesting the handover — the trust anchor. */
+    owner: string;
+    reason: SuccessionReason;
+    /** REQUIRED when reason is 'compromise': receipts after this instant under the old key are suspect. */
+    compromised_at?: string;
+    ts: string;
+    note?: string;
+}
+export interface SuccessionSignature {
+    did: string;
+    /** `ed25519:<hex>` over the canonical (JCS) bytes of the body. */
+    sig: string;
+}
+export interface Succession {
+    body: SuccessionBody;
+    signatures: SuccessionSignature[];
+}
+export interface SuccessionInput {
+    predecessor: string;
+    successor: string;
+    owner: string;
+    reason: SuccessionReason;
+    compromisedAt?: string;
+    ts: string;
+    note?: string;
+}
+export declare function buildSuccessionBody(input: SuccessionInput): SuccessionBody;
+/** Sign as the owner (required) or as the predecessor (optional, strengthens a planned handover). */
+export declare function signSuccession(body: SuccessionBody, did: string, privateKey: Uint8Array): SuccessionSignature;
+export declare function assembleSuccession(body: SuccessionBody, signatures: SuccessionSignature[]): Succession;
+export declare function successionHash(s: Succession): string;
+export interface SuccessionCheck {
+    ok: boolean;
+    reasons: string[];
+    /** true when the predecessor ALSO signed — the strong (planned) form. */
+    cosigned: boolean;
+}
+/** Verify: structure sane + the OWNER signed. The predecessor's countersignature sets `cosigned`. */
+export declare function verifySuccession(s: Succession | undefined): SuccessionCheck;
+export interface LineageCheck {
+    ok: boolean;
+    reasons: string[];
+    /** Oldest → newest DIDs, ending at the queried agent when ok. */
+    lineage: string[];
+}
+/**
+ * Walk a chain of successions back from `did` (newest agent). Requires: every link
+ * verifies, links connect (predecessor of one = successor of the previous), and ALL
+ * links share one owner — a lineage is one authority's history. (An ownership transfer
+ * is a sale, not a succession; this deliberately refuses to conflate them.)
+ */
+export declare function verifyLineage(successions: Succession[], did: string): LineageCheck;
+export interface CombinedSummary {
+    /** Oldest → newest. */
+    lineage: string[];
+    /** Sum across the lineage — an UPPER BOUND (see caveats). */
+    receipts: number;
+    first_ts: string | null;
+    last_ts: string | null;
+    /** Current agent's status — a retired predecessor being revoked is normal. */
+    revoked: boolean;
+    fully_anchored: boolean;
+    /** Facts a reader must see before trusting the combined numbers. */
+    caveats: string[];
+}
+/**
+ * Aggregate ledger reputation across a verified lineage. Deliberately conservative:
+ * receipt counts SUM (an upper bound — cross-key duplicates can't be detected from
+ * aggregates), counterparties are NOT summed (overlap is unknowable here), and any
+ * compromise link adds a caveat that the predecessor's post-compromise receipts are
+ * suspect. Pass `trusts` in the same order as `lineage`.
+ */
+export declare function combinedSummary(successions: Succession[], trusts: AgentTrust[], did: string): CombinedSummary;
+//# 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":"AAkCA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AAGvD,MAAM,MAAM,gBAAgB,GAAG,UAAU,GAAG,YAAY,GAAG,YAAY,CAAC;AAExE,MAAM,WAAW,cAAc;IAC7B,CAAC,EAAE,CAAC,CAAC;IACL,IAAI,EAAE,YAAY,CAAC;IACnB,mDAAmD;IACnD,WAAW,EAAE,MAAM,CAAC;IACpB,+CAA+C;IAC/C,SAAS,EAAE,MAAM,CAAC;IAClB,oEAAoE;IACpE,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,gBAAgB,CAAC;IACzB,uGAAuG;IACvG,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,mBAAmB;IAClC,GAAG,EAAE,MAAM,CAAC;IACZ,kEAAkE;IAClE,GAAG,EAAE,MAAM,CAAC;CACb;AAED,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,cAAc,CAAC;IACrB,UAAU,EAAE,mBAAmB,EAAE,CAAC;CACnC;AAED,MAAM,WAAW,eAAe;IAC9B,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,gBAAgB,CAAC;IACzB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,eAAe,GAAG,cAAc,CAwB1E;AAgBD,qGAAqG;AACrG,wBAAgB,cAAc,CAAC,IAAI,EAAE,cAAc,EAAE,GAAG,EAAE,MAAM,EAAE,UAAU,EAAE,UAAU,GAAG,mBAAmB,CAE7G;AAED,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,cAAc,EAAE,UAAU,EAAE,mBAAmB,EAAE,GAAG,UAAU,CAEtG;AAED,wBAAgB,cAAc,CAAC,CAAC,EAAE,UAAU,GAAG,MAAM,CAEpD;AAED,MAAM,WAAW,eAAe;IAC9B,EAAE,EAAE,OAAO,CAAC;IACZ,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,yEAAyE;IACzE,QAAQ,EAAE,OAAO,CAAC;CACnB;AAED,qGAAqG;AACrG,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,UAAU,GAAG,SAAS,GAAG,eAAe,CAuB3E;AAED,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,OAAO,CAAC;IACZ,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,iEAAiE;IACjE,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,WAAW,EAAE,UAAU,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,YAAY,CA6BlF;AAED,MAAM,WAAW,eAAe;IAC9B,uBAAuB;IACvB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,6DAA6D;IAC7D,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IACvB,8EAA8E;IAC9E,OAAO,EAAE,OAAO,CAAC;IACjB,cAAc,EAAE,OAAO,CAAC;IACxB,oEAAoE;IACpE,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,WAAW,EAAE,UAAU,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,eAAe,CA4B7G"}

package/dist/index.js

@@ -0,0 +1,198 @@
+/**
+ * @zanii/succession — agent lifecycle: key rotation with signed continuity.
+ *
+ * An agent's did:key IS its key, so rotating a key normally means the reputation, CV
+ * history, and counterparty trust die with it. The first time a customer rotates a
+ * compromised key, that's an incident. Succession fixes it: the **owner** — the same
+ * root authority whose delegation gave the old key its power — signs a continuity
+ * certificate: "agent B is the successor of agent A." Verifiers, `@zanii/cv`, and
+ * reputation readers can then follow the lineage instead of starting from zero.
+ *
+ * Two signatures, two strengths:
+ * - **Owner signature (required)** — the trust anchor. Succession without the owner is
+ *   meaningless: anyone can claim to succeed anyone.
+ * - **Predecessor signature (optional, `cosigned`)** — when the old key is still safe
+ *   (planned rotation, retirement), the old agent countersigning is strictly stronger.
+ *   After a compromise it is deliberately NOT required — the attacker holds that key.
+ *
+ * ## The rule that keeps compromise honest
+ *
+ * A succession with `reason: 'compromise'` **requires `compromised_at`**. History
+ * transfers, but the compromise timestamp brackets the trusted window: receipts after
+ * `compromised_at` under the old key may be the attacker's, and `combinedSummary`
+ * surfaces that instead of silently inheriting them. (Pair with a revocation of the
+ * old delegation — succession records continuity; revocation kills the old authority.)
+ *
+ * ## The limit, stated up front
+ *
+ * Succession proves **continuity of authority** — the owner vouches that B carries A's
+ * mandate. It does NOT prove B runs the same code, weights, or behavior as A
+ * (`@zanii/attest` is for which-code-ran). And it is the owner's attestation: an owner
+ * can lie, in which case the lie is signed and permanent — attributable, not impossible.
+ */
+import { ed25519 } from '@noble/curves/ed25519';
+import { bytesToHex, hexToBytes } from '@noble/hashes/utils';
+import { canonicalBytes, jcsHash, publicKeyFromDid } from '@zanii/core';
+export function buildSuccessionBody(input) {
+    if (!input.predecessor || !input.successor || !input.owner)
+        throw new Error('predecessor, successor, and owner are required');
+    if (input.predecessor === input.successor)
+        throw new Error('an agent cannot succeed itself');
+    if (!['rotation', 'compromise', 'retirement'].includes(input.reason))
+        throw new Error(`invalid reason '${input.reason}'`);
+    if (Number.isNaN(Date.parse(input.ts)))
+        throw new Error('ts must be an ISO timestamp');
+    if (input.reason === 'compromise') {
+        if (!input.compromisedAt || Number.isNaN(Date.parse(input.compromisedAt))) {
+            throw new Error("a 'compromise' succession REQUIRES compromised_at — it brackets the trusted window; without it the inherited history cannot be honestly assessed");
+        }
+    }
+    else if (input.compromisedAt !== undefined) {
+        throw new Error("compromised_at is only meaningful with reason 'compromise'");
+    }
+    const body = {
+        v: 1,
+        type: 'succession',
+        predecessor: input.predecessor,
+        successor: input.successor,
+        owner: input.owner,
+        reason: input.reason,
+        ts: input.ts,
+    };
+    if (input.compromisedAt !== undefined)
+        body.compromised_at = input.compromisedAt;
+    if (input.note !== undefined)
+        body.note = input.note;
+    return body;
+}
+const sign = (obj, priv) => `ed25519:${bytesToHex(ed25519.sign(canonicalBytes(obj), priv))}`;
+const sigValid = (obj, did, sig) => {
+    const pub = publicKeyFromDid(did);
+    const hex = typeof sig === 'string' && sig.startsWith('ed25519:') ? sig.slice(8) : '';
+    if (!pub || !/^[0-9a-f]{128}$/.test(hex))
+        return false;
+    try {
+        return ed25519.verify(hexToBytes(hex), canonicalBytes(obj), pub);
+    }
+    catch {
+        return false;
+    }
+};
+/** Sign as the owner (required) or as the predecessor (optional, strengthens a planned handover). */
+export function signSuccession(body, did, privateKey) {
+    return { did, sig: sign(body, privateKey) };
+}
+export function assembleSuccession(body, signatures) {
+    return { body, signatures };
+}
+export function successionHash(s) {
+    return jcsHash(s);
+}
+/** Verify: structure sane + the OWNER signed. The predecessor's countersignature sets `cosigned`. */
+export function verifySuccession(s) {
+    const reasons = [];
+    const e = s ?? {};
+    const b = e.body ?? {};
+    if (b.v !== 1 || b.type !== 'succession')
+        reasons.push('not a succession (v1)');
+    if (!b.predecessor || !b.successor || !b.owner || b.predecessor === b.successor)
+        reasons.push('missing/invalid parties');
+    if (!['rotation', 'compromise', 'retirement'].includes(b.reason))
+        reasons.push('invalid reason');
+    if (b.reason === 'compromise' && (typeof b.compromised_at !== 'string' || Number.isNaN(Date.parse(b.compromised_at)))) {
+        reasons.push("a 'compromise' succession requires a valid compromised_at");
+    }
+    if (typeof b.ts !== 'string' || Number.isNaN(Date.parse(b.ts)))
+        reasons.push('missing/invalid ts');
+    let cosigned = false;
+    if (reasons.length === 0) {
+        const sigs = e.signatures ?? [];
+        const ownerSig = sigs.find((x) => x.did === b.owner);
+        if (!ownerSig || !sigValid(b, ownerSig.did, ownerSig.sig)) {
+            reasons.push('missing/invalid OWNER signature — succession without the owner is just a claim');
+        }
+        const predSig = sigs.find((x) => x.did === b.predecessor);
+        cosigned = !!predSig && sigValid(b, predSig.did, predSig.sig);
+    }
+    return { ok: reasons.length === 0, reasons, cosigned };
+}
+/**
+ * Walk a chain of successions back from `did` (newest agent). Requires: every link
+ * verifies, links connect (predecessor of one = successor of the previous), and ALL
+ * links share one owner — a lineage is one authority's history. (An ownership transfer
+ * is a sale, not a succession; this deliberately refuses to conflate them.)
+ */
+export function verifyLineage(successions, did) {
+    const reasons = [];
+    if (successions.length === 0)
+        return { ok: true, reasons: [], lineage: [did] };
+    const bySuccessor = new Map();
+    for (const s of successions) {
+        const check = verifySuccession(s);
+        if (!check.ok)
+            return { ok: false, reasons: check.reasons.map((r) => `link ${s?.body?.successor ?? '?'}: ${r}`), lineage: [] };
+        if (bySuccessor.has(s.body.successor))
+            return { ok: false, reasons: [`two successions claim successor ${s.body.successor}`], lineage: [] };
+        bySuccessor.set(s.body.successor, s);
+    }
+    const owner = successions[0].body.owner;
+    if (!successions.every((s) => s.body.owner === owner)) {
+        return { ok: false, reasons: ['lineage spans multiple owners — an ownership transfer is not a succession'], lineage: [] };
+    }
+    const lineage = [did];
+    const seen = new Set([did]);
+    let cursor = did;
+    while (bySuccessor.has(cursor)) {
+        const link = bySuccessor.get(cursor);
+        const prev = link.body.predecessor;
+        if (seen.has(prev))
+            return { ok: false, reasons: ['succession cycle detected'], lineage: [] };
+        seen.add(prev);
+        lineage.unshift(prev);
+        cursor = prev;
+    }
+    if (lineage.length !== successions.length + 1) {
+        reasons.push(`${successions.length + 1 - lineage.length} succession(s) do not connect to ${did}'s lineage`);
+    }
+    return { ok: reasons.length === 0, reasons, lineage };
+}
+/**
+ * Aggregate ledger reputation across a verified lineage. Deliberately conservative:
+ * receipt counts SUM (an upper bound — cross-key duplicates can't be detected from
+ * aggregates), counterparties are NOT summed (overlap is unknowable here), and any
+ * compromise link adds a caveat that the predecessor's post-compromise receipts are
+ * suspect. Pass `trusts` in the same order as `lineage`.
+ */
+export function combinedSummary(successions, trusts, did) {
+    const lin = verifyLineage(successions, did);
+    if (!lin.ok)
+        throw new Error(`lineage does not verify: ${lin.reasons.join('; ')}`);
+    if (trusts.length !== lin.lineage.length)
+        throw new Error(`need one AgentTrust per lineage member (${lin.lineage.length}), got ${trusts.length}`);
+    trusts.forEach((t, i) => {
+        if (t.agent_id !== lin.lineage[i])
+            throw new Error(`trusts[${i}] is for ${t.agent_id}, expected ${lin.lineage[i]}`);
+    });
+    const caveats = [
+        'receipt count is a sum across keys — an upper bound, not a deduplicated total',
+        'distinct counterparties are per-key and deliberately not summed (overlap unknowable)',
+    ];
+    for (const s of successions) {
+        if (s.body.reason === 'compromise') {
+            caveats.push(`${s.body.predecessor} was COMPROMISED at ${s.body.compromised_at} — its receipts after that instant may be an attacker's`);
+        }
+    }
+    const firsts = trusts.map((t) => t.first_ts).filter((x) => !!x);
+    const lasts = trusts.map((t) => t.last_ts).filter((x) => !!x);
+    const current = trusts[trusts.length - 1];
+    return {
+        lineage: lin.lineage,
+        receipts: trusts.reduce((n, t) => n + t.receipts, 0),
+        first_ts: firsts.length ? firsts.reduce((a, b) => (Date.parse(a) <= Date.parse(b) ? a : b)) : null,
+        last_ts: lasts.length ? lasts.reduce((a, b) => (Date.parse(a) >= Date.parse(b) ? a : b)) : null,
+        revoked: current.revoked,
+        fully_anchored: trusts.every((t) => t.fully_anchored),
+        caveats,
+    };
+}
+//# 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;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,OAAO,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAChD,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAE7D,OAAO,EAAE,cAAc,EAAE,OAAO,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAyCxE,MAAM,UAAU,mBAAmB,CAAC,KAAsB;IACxD,IAAI,CAAC,KAAK,CAAC,WAAW,IAAI,CAAC,KAAK,CAAC,SAAS,IAAI,CAAC,KAAK,CAAC,KAAK;QAAE,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;IAC9H,IAAI,KAAK,CAAC,WAAW,KAAK,KAAK,CAAC,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;IAC7F,IAAI,CAAC,CAAC,UAAU,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,mBAAmB,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAC1H,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;IACvF,IAAI,KAAK,CAAC,MAAM,KAAK,YAAY,EAAE,CAAC;QAClC,IAAI,CAAC,KAAK,CAAC,aAAa,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC;YAC1E,MAAM,IAAI,KAAK,CAAC,kJAAkJ,CAAC,CAAC;QACtK,CAAC;IACH,CAAC;SAAM,IAAI,KAAK,CAAC,aAAa,KAAK,SAAS,EAAE,CAAC;QAC7C,MAAM,IAAI,KAAK,CAAC,4DAA4D,CAAC,CAAC;IAChF,CAAC;IACD,MAAM,IAAI,GAAmB;QAC3B,CAAC,EAAE,CAAC;QACJ,IAAI,EAAE,YAAY;QAClB,WAAW,EAAE,KAAK,CAAC,WAAW;QAC9B,SAAS,EAAE,KAAK,CAAC,SAAS;QAC1B,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,EAAE,EAAE,KAAK,CAAC,EAAE;KACb,CAAC;IACF,IAAI,KAAK,CAAC,aAAa,KAAK,SAAS;QAAE,IAAI,CAAC,cAAc,GAAG,KAAK,CAAC,aAAa,CAAC;IACjF,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS;QAAE,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;IACrD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,IAAI,GAAG,CAAC,GAA4B,EAAE,IAAgB,EAAU,EAAE,CACtE,WAAW,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;AAEnE,MAAM,QAAQ,GAAG,CAAC,GAA4B,EAAE,GAAW,EAAE,GAAY,EAAW,EAAE;IACpF,MAAM,GAAG,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;IAClC,MAAM,GAAG,GAAG,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACtF,IAAI,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IACvD,IAAI,CAAC;QACH,OAAO,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,cAAc,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;IACnE,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC,CAAC;AAEF,qGAAqG;AACrG,MAAM,UAAU,cAAc,CAAC,IAAoB,EAAE,GAAW,EAAE,UAAsB;IACtF,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,IAA0C,EAAE,UAAU,CAAC,EAAE,CAAC;AACpF,CAAC;AAED,MAAM,UAAU,kBAAkB,CAAC,IAAoB,EAAE,UAAiC;IACxF,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;AAC9B,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,CAAa;IAC1C,OAAO,OAAO,CAAC,CAAuC,CAAC,CAAC;AAC1D,CAAC;AASD,qGAAqG;AACrG,MAAM,UAAU,gBAAgB,CAAC,CAAyB;IACxD,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,CAAC,GAAG,CAAC,IAAK,EAAiB,CAAC;IAClC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,IAAK,EAAqB,CAAC;IAC3C,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY;QAAE,OAAO,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;IAChF,IAAI,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,WAAW,KAAK,CAAC,CAAC,SAAS;QAAE,OAAO,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC;IACzH,IAAI,CAAC,CAAC,UAAU,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;IACjG,IAAI,CAAC,CAAC,MAAM,KAAK,YAAY,IAAI,CAAC,OAAO,CAAC,CAAC,cAAc,KAAK,QAAQ,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC;QACtH,OAAO,CAAC,IAAI,CAAC,2DAA2D,CAAC,CAAC;IAC5E,CAAC;IACD,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;IAEnG,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,CAAC,CAAC,UAAU,IAAI,EAAE,CAAC;QAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;QACrD,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,CAAuC,EAAE,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAChG,OAAO,CAAC,IAAI,CAAC,gFAAgF,CAAC,CAAC;QACjG,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC;QAC1D,QAAQ,GAAG,CAAC,CAAC,OAAO,IAAI,QAAQ,CAAC,CAAuC,EAAE,OAAO,CAAC,GAAG,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC;IACtG,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC;AACzD,CAAC;AASD;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAAC,WAAyB,EAAE,GAAW;IAClE,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;IAC/E,MAAM,WAAW,GAAG,IAAI,GAAG,EAAsB,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,CAAC,KAAK,CAAC,EAAE;YAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,SAAS,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;QAC/H,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC;YAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,mCAAmC,CAAC,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;QAC3I,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IACvC,CAAC;IACD,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,KAAK,CAAC;IACzC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,KAAK,KAAK,CAAC,EAAE,CAAC;QACtD,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,2EAA2E,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IAC5H,CAAC;IACD,MAAM,OAAO,GAAa,CAAC,GAAG,CAAC,CAAC;IAChC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5B,IAAI,MAAM,GAAG,GAAG,CAAC;IACjB,OAAO,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;QACtC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC;QACnC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,2BAA2B,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;QAC9F,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACf,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACtB,MAAM,GAAG,IAAI,CAAC;IAChB,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,KAAK,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC9C,OAAO,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,oCAAoC,GAAG,YAAY,CAAC,CAAC;IAC9G,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;AACxD,CAAC;AAgBD;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAAC,WAAyB,EAAE,MAAoB,EAAE,GAAW;IAC1F,MAAM,GAAG,GAAG,aAAa,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;IAC5C,IAAI,CAAC,GAAG,CAAC,EAAE;QAAE,MAAM,IAAI,KAAK,CAAC,4BAA4B,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnF,IAAI,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,OAAO,CAAC,MAAM;QAAE,MAAM,IAAI,KAAK,CAAC,2CAA2C,GAAG,CAAC,OAAO,CAAC,MAAM,UAAU,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAClJ,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACtB,IAAI,CAAC,CAAC,QAAQ,KAAK,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC,QAAQ,cAAc,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACtH,CAAC,CAAC,CAAC;IACH,MAAM,OAAO,GAAa;QACxB,+EAA+E;QAC/E,sFAAsF;KACvF,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC5B,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,YAAY,EAAE,CAAC;YACnC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,WAAW,uBAAuB,CAAC,CAAC,IAAI,CAAC,cAAc,yDAAyD,CAAC,CAAC;QAC3I,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7E,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3E,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;IAC3C,OAAO;QACL,OAAO,EAAE,GAAG,CAAC,OAAO;QACpB,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;QACpD,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;QAClG,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;QAC/F,OAAO,EAAE,OAAO,CAAC,OAAO;QACxB,cAAc,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC;QACrD,OAAO;KACR,CAAC;AACJ,CAAC"}

package/package.json

@@ -0,0 +1,44 @@
+{
+  "name": "@zanii/succession",
+  "version": "0.1.0",
+  "description": "Agent lifecycle and key rotation with signed continuity - the owner attests 'B succeeds A', so reputation and CV history transfer verifiably instead of dying with a key. A compromise succession REQUIRES the compromise timestamp, bracketing the trusted window. Continuity of authority, not identity of code.",
+  "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": {
+    "@noble/curves": "^1.8.1",
+    "@noble/hashes": "^1.7.1",
+    "@zanii/a2a-directory": "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,256 @@
+/**
+ * @zanii/succession — agent lifecycle: key rotation with signed continuity.
+ *
+ * An agent's did:key IS its key, so rotating a key normally means the reputation, CV
+ * history, and counterparty trust die with it. The first time a customer rotates a
+ * compromised key, that's an incident. Succession fixes it: the **owner** — the same
+ * root authority whose delegation gave the old key its power — signs a continuity
+ * certificate: "agent B is the successor of agent A." Verifiers, `@zanii/cv`, and
+ * reputation readers can then follow the lineage instead of starting from zero.
+ *
+ * Two signatures, two strengths:
+ * - **Owner signature (required)** — the trust anchor. Succession without the owner is
+ *   meaningless: anyone can claim to succeed anyone.
+ * - **Predecessor signature (optional, `cosigned`)** — when the old key is still safe
+ *   (planned rotation, retirement), the old agent countersigning is strictly stronger.
+ *   After a compromise it is deliberately NOT required — the attacker holds that key.
+ *
+ * ## The rule that keeps compromise honest
+ *
+ * A succession with `reason: 'compromise'` **requires `compromised_at`**. History
+ * transfers, but the compromise timestamp brackets the trusted window: receipts after
+ * `compromised_at` under the old key may be the attacker's, and `combinedSummary`
+ * surfaces that instead of silently inheriting them. (Pair with a revocation of the
+ * old delegation — succession records continuity; revocation kills the old authority.)
+ *
+ * ## The limit, stated up front
+ *
+ * Succession proves **continuity of authority** — the owner vouches that B carries A's
+ * mandate. It does NOT prove B runs the same code, weights, or behavior as A
+ * (`@zanii/attest` is for which-code-ran). And it is the owner's attestation: an owner
+ * can lie, in which case the lie is signed and permanent — attributable, not impossible.
+ */
+import { ed25519 } from '@noble/curves/ed25519';
+import { bytesToHex, hexToBytes } from '@noble/hashes/utils';
+import type { AgentTrust } from '@zanii/a2a-directory';
+import { canonicalBytes, jcsHash, publicKeyFromDid } from '@zanii/core';
+
+export type SuccessionReason = 'rotation' | 'compromise' | 'retirement';
+
+export interface SuccessionBody {
+  v: 1;
+  type: 'succession';
+  /** The agent being succeeded (the old did:key). */
+  predecessor: string;
+  /** The agent taking over (the new did:key). */
+  successor: string;
+  /** The root authority attesting the handover — the trust anchor. */
+  owner: string;
+  reason: SuccessionReason;
+  /** REQUIRED when reason is 'compromise': receipts after this instant under the old key are suspect. */
+  compromised_at?: string;
+  ts: string;
+  note?: string;
+}
+
+export interface SuccessionSignature {
+  did: string;
+  /** `ed25519:<hex>` over the canonical (JCS) bytes of the body. */
+  sig: string;
+}
+
+export interface Succession {
+  body: SuccessionBody;
+  signatures: SuccessionSignature[];
+}
+
+export interface SuccessionInput {
+  predecessor: string;
+  successor: string;
+  owner: string;
+  reason: SuccessionReason;
+  compromisedAt?: string;
+  ts: string;
+  note?: string;
+}
+
+export function buildSuccessionBody(input: SuccessionInput): SuccessionBody {
+  if (!input.predecessor || !input.successor || !input.owner) throw new Error('predecessor, successor, and owner are required');
+  if (input.predecessor === input.successor) throw new Error('an agent cannot succeed itself');
+  if (!['rotation', 'compromise', 'retirement'].includes(input.reason)) throw new Error(`invalid reason '${input.reason}'`);
+  if (Number.isNaN(Date.parse(input.ts))) throw new Error('ts must be an ISO timestamp');
+  if (input.reason === 'compromise') {
+    if (!input.compromisedAt || Number.isNaN(Date.parse(input.compromisedAt))) {
+      throw new Error("a 'compromise' succession REQUIRES compromised_at — it brackets the trusted window; without it the inherited history cannot be honestly assessed");
+    }
+  } else if (input.compromisedAt !== undefined) {
+    throw new Error("compromised_at is only meaningful with reason 'compromise'");
+  }
+  const body: SuccessionBody = {
+    v: 1,
+    type: 'succession',
+    predecessor: input.predecessor,
+    successor: input.successor,
+    owner: input.owner,
+    reason: input.reason,
+    ts: input.ts,
+  };
+  if (input.compromisedAt !== undefined) body.compromised_at = input.compromisedAt;
+  if (input.note !== undefined) body.note = input.note;
+  return body;
+}
+
+const sign = (obj: Record<string, unknown>, priv: Uint8Array): string =>
+  `ed25519:${bytesToHex(ed25519.sign(canonicalBytes(obj), priv))}`;
+
+const sigValid = (obj: Record<string, unknown>, did: string, sig: unknown): boolean => {
+  const pub = publicKeyFromDid(did);
+  const hex = typeof sig === 'string' && sig.startsWith('ed25519:') ? sig.slice(8) : '';
+  if (!pub || !/^[0-9a-f]{128}$/.test(hex)) return false;
+  try {
+    return ed25519.verify(hexToBytes(hex), canonicalBytes(obj), pub);
+  } catch {
+    return false;
+  }
+};
+
+/** Sign as the owner (required) or as the predecessor (optional, strengthens a planned handover). */
+export function signSuccession(body: SuccessionBody, did: string, privateKey: Uint8Array): SuccessionSignature {
+  return { did, sig: sign(body as unknown as Record<string, unknown>, privateKey) };
+}
+
+export function assembleSuccession(body: SuccessionBody, signatures: SuccessionSignature[]): Succession {
+  return { body, signatures };
+}
+
+export function successionHash(s: Succession): string {
+  return jcsHash(s as unknown as Record<string, unknown>);
+}
+
+export interface SuccessionCheck {
+  ok: boolean;
+  reasons: string[];
+  /** true when the predecessor ALSO signed — the strong (planned) form. */
+  cosigned: boolean;
+}
+
+/** Verify: structure sane + the OWNER signed. The predecessor's countersignature sets `cosigned`. */
+export function verifySuccession(s: Succession | undefined): SuccessionCheck {
+  const reasons: string[] = [];
+  const e = s ?? ({} as Succession);
+  const b = e.body ?? ({} as SuccessionBody);
+  if (b.v !== 1 || b.type !== 'succession') reasons.push('not a succession (v1)');
+  if (!b.predecessor || !b.successor || !b.owner || b.predecessor === b.successor) reasons.push('missing/invalid parties');
+  if (!['rotation', 'compromise', 'retirement'].includes(b.reason)) reasons.push('invalid reason');
+  if (b.reason === 'compromise' && (typeof b.compromised_at !== 'string' || Number.isNaN(Date.parse(b.compromised_at)))) {
+    reasons.push("a 'compromise' succession requires a valid compromised_at");
+  }
+  if (typeof b.ts !== 'string' || Number.isNaN(Date.parse(b.ts))) reasons.push('missing/invalid ts');
+
+  let cosigned = false;
+  if (reasons.length === 0) {
+    const sigs = e.signatures ?? [];
+    const ownerSig = sigs.find((x) => x.did === b.owner);
+    if (!ownerSig || !sigValid(b as unknown as Record<string, unknown>, ownerSig.did, ownerSig.sig)) {
+      reasons.push('missing/invalid OWNER signature — succession without the owner is just a claim');
+    }
+    const predSig = sigs.find((x) => x.did === b.predecessor);
+    cosigned = !!predSig && sigValid(b as unknown as Record<string, unknown>, predSig.did, predSig.sig);
+  }
+  return { ok: reasons.length === 0, reasons, cosigned };
+}
+
+export interface LineageCheck {
+  ok: boolean;
+  reasons: string[];
+  /** Oldest → newest DIDs, ending at the queried agent when ok. */
+  lineage: string[];
+}
+
+/**
+ * Walk a chain of successions back from `did` (newest agent). Requires: every link
+ * verifies, links connect (predecessor of one = successor of the previous), and ALL
+ * links share one owner — a lineage is one authority's history. (An ownership transfer
+ * is a sale, not a succession; this deliberately refuses to conflate them.)
+ */
+export function verifyLineage(successions: Succession[], did: string): LineageCheck {
+  const reasons: string[] = [];
+  if (successions.length === 0) return { ok: true, reasons: [], lineage: [did] };
+  const bySuccessor = new Map<string, Succession>();
+  for (const s of successions) {
+    const check = verifySuccession(s);
+    if (!check.ok) return { ok: false, reasons: check.reasons.map((r) => `link ${s?.body?.successor ?? '?'}: ${r}`), lineage: [] };
+    if (bySuccessor.has(s.body.successor)) return { ok: false, reasons: [`two successions claim successor ${s.body.successor}`], lineage: [] };
+    bySuccessor.set(s.body.successor, s);
+  }
+  const owner = successions[0]!.body.owner;
+  if (!successions.every((s) => s.body.owner === owner)) {
+    return { ok: false, reasons: ['lineage spans multiple owners — an ownership transfer is not a succession'], lineage: [] };
+  }
+  const lineage: string[] = [did];
+  const seen = new Set([did]);
+  let cursor = did;
+  while (bySuccessor.has(cursor)) {
+    const link = bySuccessor.get(cursor)!;
+    const prev = link.body.predecessor;
+    if (seen.has(prev)) return { ok: false, reasons: ['succession cycle detected'], lineage: [] };
+    seen.add(prev);
+    lineage.unshift(prev);
+    cursor = prev;
+  }
+  if (lineage.length !== successions.length + 1) {
+    reasons.push(`${successions.length + 1 - lineage.length} succession(s) do not connect to ${did}'s lineage`);
+  }
+  return { ok: reasons.length === 0, reasons, lineage };
+}
+
+export interface CombinedSummary {
+  /** Oldest → newest. */
+  lineage: string[];
+  /** Sum across the lineage — an UPPER BOUND (see caveats). */
+  receipts: number;
+  first_ts: string | null;
+  last_ts: string | null;
+  /** Current agent's status — a retired predecessor being revoked is normal. */
+  revoked: boolean;
+  fully_anchored: boolean;
+  /** Facts a reader must see before trusting the combined numbers. */
+  caveats: string[];
+}
+
+/**
+ * Aggregate ledger reputation across a verified lineage. Deliberately conservative:
+ * receipt counts SUM (an upper bound — cross-key duplicates can't be detected from
+ * aggregates), counterparties are NOT summed (overlap is unknowable here), and any
+ * compromise link adds a caveat that the predecessor's post-compromise receipts are
+ * suspect. Pass `trusts` in the same order as `lineage`.
+ */
+export function combinedSummary(successions: Succession[], trusts: AgentTrust[], did: string): CombinedSummary {
+  const lin = verifyLineage(successions, did);
+  if (!lin.ok) throw new Error(`lineage does not verify: ${lin.reasons.join('; ')}`);
+  if (trusts.length !== lin.lineage.length) throw new Error(`need one AgentTrust per lineage member (${lin.lineage.length}), got ${trusts.length}`);
+  trusts.forEach((t, i) => {
+    if (t.agent_id !== lin.lineage[i]) throw new Error(`trusts[${i}] is for ${t.agent_id}, expected ${lin.lineage[i]}`);
+  });
+  const caveats: string[] = [
+    'receipt count is a sum across keys — an upper bound, not a deduplicated total',
+    'distinct counterparties are per-key and deliberately not summed (overlap unknowable)',
+  ];
+  for (const s of successions) {
+    if (s.body.reason === 'compromise') {
+      caveats.push(`${s.body.predecessor} was COMPROMISED at ${s.body.compromised_at} — its receipts after that instant may be an attacker's`);
+    }
+  }
+  const firsts = trusts.map((t) => t.first_ts).filter((x): x is string => !!x);
+  const lasts = trusts.map((t) => t.last_ts).filter((x): x is string => !!x);
+  const current = trusts[trusts.length - 1]!;
+  return {
+    lineage: lin.lineage,
+    receipts: trusts.reduce((n, t) => n + t.receipts, 0),
+    first_ts: firsts.length ? firsts.reduce((a, b) => (Date.parse(a) <= Date.parse(b) ? a : b)) : null,
+    last_ts: lasts.length ? lasts.reduce((a, b) => (Date.parse(a) >= Date.parse(b) ? a : b)) : null,
+    revoked: current.revoked,
+    fully_anchored: trusts.every((t) => t.fully_anchored),
+    caveats,
+  };
+}