@ainize/core 0.1.0

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,eAAe,CAAC;AAC9B,cAAc,UAAU,CAAC;AACzB,cAAc,WAAW,CAAC;AAC1B,cAAc,aAAa,CAAC;AAC5B,cAAc,mBAAmB,CAAC;AAClC,cAAc,iBAAiB,CAAC;AAChC,cAAc,cAAc,CAAC;AAC7B,cAAc,cAAc,CAAC;AAC7B,cAAc,aAAa,CAAC;AAC5B,cAAc,oBAAoB,CAAC;AACnC,cAAc,aAAa,CAAC;AAC5B,cAAc,YAAY,CAAC;AAC3B,cAAc,iBAAiB,CAAC;AAChC,cAAc,UAAU,CAAC"}

package/dist/index.js

@@ -0,0 +1,17 @@
+export * from './types.js';
+export * from './canonical.js';
+export * from './identity.js';
+export * from './npz.js';
+export * from './x402.js';
+export * from './ledger.js';
+export * from './local-ledger.js';
+export * from './ain-ledger.js';
+export * from './catalog.js';
+export * from './lineage.js';
+export * from './config.js';
+export * from './config-schema.js';
+export * from './events.js';
+export * from './bytes.js';
+export * from './teach-auth.js';
+export * from './ops.js';
+//# 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,cAAc,YAAY,CAAC;AAC3B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,eAAe,CAAC;AAC9B,cAAc,UAAU,CAAC;AACzB,cAAc,WAAW,CAAC;AAC1B,cAAc,aAAa,CAAC;AAC5B,cAAc,mBAAmB,CAAC;AAClC,cAAc,iBAAiB,CAAC;AAChC,cAAc,cAAc,CAAC;AAC7B,cAAc,cAAc,CAAC;AAC7B,cAAc,aAAa,CAAC;AAC5B,cAAc,oBAAoB,CAAC;AACnC,cAAc,aAAa,CAAC;AAC5B,cAAc,YAAY,CAAC;AAC3B,cAAc,iBAAiB,CAAC;AAChC,cAAc,UAAU,CAAC"}

package/dist/ledger.d.ts

@@ -0,0 +1,134 @@
+/**
+ * Ledger abstraction (원장 130).
+ *
+ * Two backends implement it:
+ *  - LocalLedger  — signed, content-addressed record DAG in SQLite, replicated peer-to-peer by set
+ *                   reconciliation (zero-config; the reference prototype's ledger.jsonl imports into it).
+ *  - AinLedger    — AI Network blockchain via @ainblockchain/ain-js: anchors are `knowledge.explore()`
+ *                   entries (graph edges = lineage), attestations/settlements/branches/nodes live under
+ *                   /apps/knowledge/market/* guarded by write rules, payments are AIN transfers (x402).
+ *
+ * The node derives catalog state (status machine, quorum, lineage, supersede) from the records —
+ * "카탈로그 = 원장의 anchor 블록 집합" (청구항 19).
+ */
+import type { Attestation, BranchInfo, Challenge, Dispute, LedgerRecord, PatchAnchor, PeerInfo, RecordKind, Settlement } from './types.js';
+export interface SupersedeRecord {
+    old_patch_id: string;
+    new_patch_id: string;
+    overlap_rows: number;
+    reason: string;
+    /** When the supersede was written (ms). Older on-chain records lack it — readers fall back to the new patch's attest/anchor time. */
+    created_at?: number;
+}
+/**
+ * Author's takedown of their own knowledge (`retire` record). The anchor is immutable and stays on the record —
+ * this is the only way a publisher stops selling it: the catalogue drops it, the x402 gateway answers 410, and
+ * buyers who already paid keep their download rights. Only a record signed by the anchor's own author counts.
+ */
+export interface RetireRecord {
+    patch_id: string;
+    /** Why it was taken down, in the publisher's words (shown to buyers; may be empty). */
+    reason: string;
+    created_at: number;
+}
+/**
+ * A price change, signed by the anchor's own author (`price` record, finding 278).
+ *
+ * The anchor is immutable, so before this the only way to re-price a listing was to publish a new one that
+ * superseded it — which restarts verification, splits the sales history and makes a discount indistinguishable
+ * from a new version. A seller who took the 0.1 default on a first listing, or who wants to run a launch price,
+ * or to make an obsolete knowledge free, had no path at all. The newest record by the anchor's author wins; every
+ * one of them stays on the ledger, so a claimed discount can be checked against the price it was discounted from.
+ */
+export interface PriceRecord {
+    patch_id: string;
+    /** The new price in the anchor's currency, as a decimal string ('0' makes it free). */
+    price: string;
+    currency: string;
+    /** Why, in the seller's words (shown to buyers on the price history; may be empty). */
+    reason: string;
+    created_at: number;
+}
+export interface SubscriptionRecord {
+    node: string;
+    branch: string;
+    action: 'subscribe' | 'unsubscribe';
+    patch_ids: string[];
+    /** When the (un)subscribe was written (ms). Older on-chain records lack it — readers fall back to the branch's creation time. */
+    created_at?: number;
+}
+/**
+ * A royalty transfer the seller actually made (`payout` record, finding 314).
+ *
+ * The buyer pays the seller in full and the seller then sends one transfer per creator, with no memo and nothing
+ * tying it to the sale — 34 reported royalties, 29 the seller claimed and 8 visible in chain state could be
+ * reconciled by nobody. A payout record joins the two by settle hash, so an ancestor has evidence to dispute with
+ * and an honest seller has evidence to show. It is written by the SELLER after the transfer returns.
+ */
+export interface PayoutRecord {
+    settle_hash: string;
+    patch_id: string;
+    /** Who was paid, and how much, in the settlement's currency. */
+    to: string;
+    amount: string;
+    currency: string;
+    /** The chain transfer: its hash, and the deterministic key it was written under (`/transfer/$from/$to/$key`). */
+    tx_hash: string;
+    transfer_key: string;
+    created_at: number;
+}
+export type RecordBody = PatchAnchor | Attestation | Settlement | Challenge | BranchInfo | PeerInfo | SupersedeRecord | SubscriptionRecord | RetireRecord | PriceRecord | PayoutRecord;
+export interface LedgerInfo {
+    kind: 'local' | 'ain';
+    network: string;
+    head?: string;
+    height?: number;
+    valid?: boolean;
+    records: number;
+    app?: string;
+    provider?: string;
+}
+export interface Ledger {
+    readonly kind: 'local' | 'ain';
+    init(): Promise<void>;
+    close(): Promise<void>;
+    info(): Promise<LedgerInfo>;
+    /** Append a record authored by this node (signed) and return it. */
+    append<T extends RecordBody>(kind: RecordKind, body: T): Promise<LedgerRecord<T>>;
+    /** Ingest a record received from a peer (signature is verified). Returns true if new. */
+    ingest(record: LedgerRecord): Promise<boolean>;
+    /** All records, oldest first (optionally after a timestamp). */
+    list(opts?: {
+        since?: number;
+        kind?: RecordKind;
+        limit?: number;
+    }): Promise<LedgerRecord[]>;
+    get(hash: string): Promise<LedgerRecord | null>;
+    hashes(since?: number): Promise<string[]>;
+    /** Local-ledger replication: records received after a peer-local cursor. */
+    sync?(since?: number, limit?: number): Promise<{
+        records: LedgerRecord[];
+        cursor: number;
+    }>;
+    /** Convenience typed views. */
+    anchors(): Promise<LedgerRecord<PatchAnchor>[]>;
+    attestations(patchId?: string): Promise<LedgerRecord<Attestation>[]>;
+    settlements(patchId?: string): Promise<LedgerRecord<Settlement>[]>;
+    challenges(patchId?: string): Promise<LedgerRecord<Challenge>[]>;
+    /** Contested sales and the sellers' answers (item 347). Optional: a ledger written before the kind existed has none. */
+    disputes?(patchId?: string): Promise<LedgerRecord<Dispute>[]>;
+    branches(): Promise<LedgerRecord<BranchInfo>[]>;
+    nodes(): Promise<LedgerRecord<PeerInfo>[]>;
+    supersedes(): Promise<LedgerRecord<SupersedeRecord>[]>;
+    subscriptions(): Promise<LedgerRecord<SubscriptionRecord>[]>;
+    /** Integrity check (hash + signature of every record; chain linkage for imported linear chains). */
+    verify(): Promise<{
+        valid: boolean;
+        checked: number;
+        errors: string[];
+    }>;
+}
+export interface LedgerEvents {
+    onRecord?: (record: LedgerRecord) => void;
+}
+//# sourceMappingURL=ledger.d.ts.map

package/dist/ledger.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ledger.d.ts","sourceRoot":"","sources":["../src/ledger.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,OAAO,KAAK,EACV,WAAW,EAAE,UAAU,EAAE,SAAS,EAAE,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE,UAAU,EACzG,MAAM,YAAY,CAAC;AAEpB,MAAM,WAAW,eAAe;IAC9B,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,MAAM,EAAE,MAAM,CAAC;IACf,qIAAqI;IACrI,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;;;;GAIG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,EAAE,MAAM,CAAC;IACjB,uFAAuF;IACvF,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;;;;;;;GAQG;AACH,MAAM,WAAW,WAAW;IAC1B,QAAQ,EAAE,MAAM,CAAC;IACjB,uFAAuF;IACvF,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,uFAAuF;IACvF,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,kBAAkB;IACjC,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,WAAW,GAAG,aAAa,CAAC;IACpC,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,iIAAiI;IACjI,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,YAAY;IAC3B,WAAW,EAAE,MAAM,CAAC;IACpB,QAAQ,EAAE,MAAM,CAAC;IACjB,gEAAgE;IAChE,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,iHAAiH;IACjH,OAAO,EAAE,MAAM,CAAC;IAChB,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,MAAM,UAAU,GAClB,WAAW,GAAG,WAAW,GAAG,UAAU,GAAG,SAAS,GAAG,UAAU,GAAG,QAAQ,GAAG,eAAe,GAAG,kBAAkB,GAAG,YAAY,GAChI,WAAW,GAAG,YAAY,CAAC;AAE/B,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,OAAO,GAAG,KAAK,CAAC;IACtB,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,KAAK,CAAC,EAAE,OAAO,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,MAAM;IACrB,QAAQ,CAAC,IAAI,EAAE,OAAO,GAAG,KAAK,CAAC;IAC/B,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACtB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACvB,IAAI,IAAI,OAAO,CAAC,UAAU,CAAC,CAAC;IAE5B,oEAAoE;IACpE,MAAM,CAAC,CAAC,SAAS,UAAU,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;IAClF,yFAAyF;IACzF,MAAM,CAAC,MAAM,EAAE,YAAY,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IAE/C,gEAAgE;IAChE,IAAI,CAAC,IAAI,CAAC,EAAE;QAAE,KAAK,CAAC,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,UAAU,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC;IAC5F,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,CAAC;IAChD,MAAM,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IAC1C,4EAA4E;IAC5E,IAAI,CAAC,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;QAAE,OAAO,EAAE,YAAY,EAAE,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAE5F,+BAA+B;IAC/B,OAAO,IAAI,OAAO,CAAC,YAAY,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;IAChD,YAAY,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;IACrE,WAAW,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;IACnE,UAAU,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IACjE,wHAAwH;IACxH,QAAQ,CAAC,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC9D,QAAQ,IAAI,OAAO,CAAC,YAAY,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;IAChD,KAAK,IAAI,OAAO,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IAC3C,UAAU,IAAI,OAAO,CAAC,YAAY,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;IACvD,aAAa,IAAI,OAAO,CAAC,YAAY,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC;IAE7D,oGAAoG;IACpG,MAAM,IAAI,OAAO,CAAC;QAAE,KAAK,EAAE,OAAO,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC,CAAC;CAC1E;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,EAAE,CAAC,MAAM,EAAE,YAAY,KAAK,IAAI,CAAC;CAC3C"}

package/dist/ledger.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=ledger.js.map

package/dist/ledger.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ledger.js","sourceRoot":"","sources":["../src/ledger.ts"],"names":[],"mappings":""}

package/dist/lineage.d.ts

@@ -0,0 +1,63 @@
+import type { BenchmarkSample, DatasetAccess, DerivationKind, PatchAnchor } from './types.js';
+export declare const DERIVATION_KINDS: readonly DerivationKind[];
+/** sha256 over the canonical full sample list — the commit the ≤ 32 on-chain samples are a slice of (§5.1). */
+export declare function answersHash(samples: BenchmarkSample[]): string;
+/**
+ * The samples that go on the ledger for a teach anchor: the child's own first (in order), then one per parent
+ * (`source` = the parent id), never more than `cap`. Returns the capped list and the hash of the FULL list.
+ */
+export declare function capBenchmarkSamples(own: BenchmarkSample[], perParent?: {
+    patch_id: string;
+    sample?: BenchmarkSample;
+}[], cap?: number): {
+    samples: BenchmarkSample[];
+    full: BenchmarkSample[];
+    answers_hash: string;
+};
+export declare const accessRank: (a: DatasetAccess | undefined) => number;
+export declare const accessOf: (a: {
+    dataset?: {
+        access?: DatasetAccess;
+    };
+} | undefined | null) => DatasetAccess;
+/**
+ * May a child with `child` licence / access build on a parent with `parent` licence / access (§6.4)?
+ *  - CC0 / CC-BY / ODC-By parent → any child licence;
+ *  - CC-BY-SA parent → the child must be CC-BY-SA with access at least the parent's;
+ *  - Proprietary parent → allowed (delta-only blob: no inherited rows, no inherited on-chain samples).
+ */
+export declare function licenseCompatible(parent: {
+    license?: string;
+    access?: DatasetAccess;
+}, child: {
+    license: string;
+    access: DatasetAccess;
+}): {
+    ok: true;
+} | {
+    ok: false;
+    reason: string;
+};
+/** Rows a child may publish from a Proprietary parent: none (delta-only, §6.4). */
+export declare const deltaOnlyParent: (license: string | undefined) => boolean;
+/**
+ * The anchor invariant validated for anchors this node writes (§5.1; readers stay tolerant): every id in
+ * `base.stack`, `dataset.parents` and `derivation.bases` is in `parents[]`; kinds, access and licence are known;
+ * the on-chain sample list of a teach anchor respects the cap. Returns the problems, empty when fine.
+ */
+export declare function lineageProblems(a: Pick<PatchAnchor, 'parents' | 'derivation' | 'base' | 'dataset' | 'benchmark' | 'origin' | 'id'>): string[];
+/** Ids this anchor was trained on top of / built from (ordered stack first, then the other lineage ids), de-duplicated. */
+export declare function lineageIds(a: Pick<PatchAnchor, 'parents' | 'derivation' | 'base' | 'dataset'>): string[];
+/**
+ * bfloat16 rounding of float32 values (round-to-nearest-even on the dropped 16 bits) — the representation the table
+ * holds, so equality checks between a delta's `before` and a parent's `after` are exact (§5.4, §8).
+ */
+export declare function bf16Bits(f32: number): number;
+/**
+ * `pre_state_sha256` (§5.1): sha256 over the rows sorted by address, each contributing `addr` as int64 LE followed by
+ * the bf16 bits (uint16 LE) of every `before` value. `before` is float32 row-major, `dim` values per row.
+ */
+export declare function preStateSha256(addrs: BigInt64Array, before: Float32Array, dim: number): string;
+/** Merkle root over canonical row lines (leaf = sha256(line)); a single leaf is its own root, an empty set hashes ''. */
+export declare function merkleRoot(leaves: string[]): string;
+//# sourceMappingURL=lineage.d.ts.map

package/dist/lineage.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lineage.d.ts","sourceRoot":"","sources":["../src/lineage.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAE,eAAe,EAAE,aAAa,EAAE,cAAc,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE9F,eAAO,MAAM,gBAAgB,EAAE,SAAS,cAAc,EAA4D,CAAC;AAEnH,+GAA+G;AAC/G,wBAAgB,WAAW,CAAC,OAAO,EAAE,eAAe,EAAE,GAAG,MAAM,CAE9D;AAED;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,eAAe,EAAE,EAAE,SAAS,GAAE;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,eAAe,CAAA;CAAE,EAAO,EAAE,GAAG,SAAyB,GAAG;IAAE,OAAO,EAAE,eAAe,EAAE,CAAC;IAAC,IAAI,EAAE,eAAe,EAAE,CAAC;IAAC,YAAY,EAAE,MAAM,CAAA;CAAE,CAOzO;AAGD,eAAO,MAAM,UAAU,GAAI,GAAG,aAAa,GAAG,SAAS,KAAG,MAAqC,CAAC;AAChG,eAAO,MAAM,QAAQ,GAAI,GAAG;IAAE,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,aAAa,CAAA;KAAE,CAAA;CAAE,GAAG,SAAS,GAAG,IAAI,KAAG,aAAgD,CAAC;AAE3I;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE;IAAE,OAAO,CAAC,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,aAAa,CAAA;CAAE,EAAE,KAAK,EAAE;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,aAAa,CAAA;CAAE,GAAG;IAAE,EAAE,EAAE,IAAI,CAAA;CAAE,GAAG;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAOvL;AAED,mFAAmF;AACnF,eAAO,MAAM,eAAe,GAAI,SAAS,MAAM,GAAG,SAAS,KAAG,OAAoC,CAAC;AAEnG;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,EAAE,SAAS,GAAG,YAAY,GAAG,MAAM,GAAG,SAAS,GAAG,WAAW,GAAG,QAAQ,GAAG,IAAI,CAAC,GAAG,MAAM,EAAE,CAsB7I;AAED,2HAA2H;AAC3H,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,EAAE,SAAS,GAAG,YAAY,GAAG,MAAM,GAAG,SAAS,CAAC,GAAG,MAAM,EAAE,CAOxG;AAED;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAS5C;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,aAAa,EAAE,MAAM,EAAE,YAAY,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAU9F;AAED,yHAAyH;AACzH,wBAAgB,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CASnD"}

package/dist/lineage.js

@@ -0,0 +1,156 @@
+/**
+ * Lineage helpers shared by the node, the CLI and the verifier (docs/lineage-teach-design.md §5, §6, §12.6):
+ * the on-chain sample cap, the answers hash, licence compatibility and the anchor invariant.
+ * Pure functions — no I/O.
+ */
+import { canonicalJson, sha256Hex } from './canonical.js';
+import { DATASET_ACCESS_LEVELS, DATASET_LICENSES, TEACH_SAMPLES_ON_CHAIN, isDatasetLicense } from './types.js';
+export const DERIVATION_KINDS = ['extend', 'update', 'contradict', 'merge', 'transfer'];
+/** sha256 over the canonical full sample list — the commit the ≤ 32 on-chain samples are a slice of (§5.1). */
+export function answersHash(samples) {
+    return sha256Hex(canonicalJson(samples.map((s) => ({ prompt: s.prompt, expect: s.expect, ...(s.source ? { source: s.source } : {}) }))));
+}
+/**
+ * The samples that go on the ledger for a teach anchor: the child's own first (in order), then one per parent
+ * (`source` = the parent id), never more than `cap`. Returns the capped list and the hash of the FULL list.
+ */
+export function capBenchmarkSamples(own, perParent = [], cap = TEACH_SAMPLES_ON_CHAIN) {
+    const seen = new Set();
+    const full = [];
+    const push = (s) => { const k = `${s.prompt}\u0000${s.expect}\u0000${s.source ?? ''}`; if (seen.has(k))
+        return; seen.add(k); full.push(s); };
+    for (const s of own)
+        push({ prompt: s.prompt, expect: s.expect });
+    for (const p of perParent)
+        if (p.sample)
+            push({ prompt: p.sample.prompt, expect: p.sample.expect, source: p.patch_id });
+    return { samples: full.slice(0, cap), full, answers_hash: answersHash(full) };
+}
+const ACCESS_RANK = { private: 0, derivative: 1, public: 2 };
+export const accessRank = (a) => ACCESS_RANK[a ?? 'private'];
+export const accessOf = (a) => a?.dataset?.access ?? 'private';
+/**
+ * May a child with `child` licence / access build on a parent with `parent` licence / access (§6.4)?
+ *  - CC0 / CC-BY / ODC-By parent → any child licence;
+ *  - CC-BY-SA parent → the child must be CC-BY-SA with access at least the parent's;
+ *  - Proprietary parent → allowed (delta-only blob: no inherited rows, no inherited on-chain samples).
+ */
+export function licenseCompatible(parent, child) {
+    if (!isDatasetLicense(child.license))
+        return { ok: false, reason: `bad_license: "${child.license}" is not one of ${DATASET_LICENSES.join(', ')}` };
+    if (parent.license === 'CC-BY-SA-4.0') {
+        if (child.license !== 'CC-BY-SA-4.0')
+            return { ok: false, reason: 'license_incompatible: the base is CC-BY-SA-4.0, so this training set must be CC-BY-SA-4.0 too' };
+        if (accessRank(child.access) < accessRank(parent.access))
+            return { ok: false, reason: `license_incompatible: the base is CC-BY-SA-4.0 with "${parent.access}" access, so this training set must be at least as open` };
+    }
+    return { ok: true };
+}
+/** Rows a child may publish from a Proprietary parent: none (delta-only, §6.4). */
+export const deltaOnlyParent = (license) => license === 'Proprietary';
+/**
+ * The anchor invariant validated for anchors this node writes (§5.1; readers stay tolerant): every id in
+ * `base.stack`, `dataset.parents` and `derivation.bases` is in `parents[]`; kinds, access and licence are known;
+ * the on-chain sample list of a teach anchor respects the cap. Returns the problems, empty when fine.
+ */
+export function lineageProblems(a) {
+    const out = [];
+    const parents = new Set(a.parents ?? []);
+    if (parents.has(a.id))
+        out.push('base_cycle: an anchor cannot list itself as a parent');
+    if (a.derivation) {
+        if (!DERIVATION_KINDS.includes(a.derivation.kind))
+            out.push(`derivation.kind must be one of ${DERIVATION_KINDS.join(', ')}`);
+        for (const b of a.derivation.bases ?? [])
+            if (!parents.has(b.patch_id))
+                out.push(`derivation.bases names ${b.patch_id}, which is not in parents`);
+        for (const k of ['added_rows', 'changed_rows', 'removed_rows'])
+            if (!Number.isInteger(a.derivation[k]) || a.derivation[k] < 0)
+                out.push(`derivation.${k} must be a non-negative integer`);
+    }
+    if (a.base) {
+        if (a.base.export !== 'delta' && a.base.export !== 'squash')
+            out.push('base.export must be "delta" or "squash"');
+        for (const b of a.base.stack ?? [])
+            if (!parents.has(b.patch_id))
+                out.push(`base.stack names ${b.patch_id}, which is not in parents`);
+        if (a.base.export === 'delta' && !(a.base.stack ?? []).length)
+            out.push('a delta needs a non-empty base.stack');
+        if (typeof a.base.pre_state_sha256 !== 'string' || !/^[0-9a-f]{64}$/.test(a.base.pre_state_sha256))
+            out.push('base.pre_state_sha256 must be a sha256 hex');
+    }
+    if (a.dataset) {
+        if (a.dataset.access !== undefined && !DATASET_ACCESS_LEVELS.includes(a.dataset.access))
+            out.push(`dataset.access must be one of ${DATASET_ACCESS_LEVELS.join(', ')}`);
+        if (a.dataset.license !== undefined && !isDatasetLicense(a.dataset.license))
+            out.push(`bad_license: dataset.license must be one of ${DATASET_LICENSES.join(', ')}`);
+        for (const p of a.dataset.parents ?? [])
+            if (!parents.has(p.patch_id))
+                out.push(`dataset.parents names ${p.patch_id}, which is not in parents`);
+    }
+    if (a.origin === 'teach' && (a.benchmark?.samples?.length ?? 0) > TEACH_SAMPLES_ON_CHAIN)
+        out.push(`a taught anchor carries at most ${TEACH_SAMPLES_ON_CHAIN} benchmark samples on the ledger (answers_hash commits to the rest)`);
+    return out;
+}
+/** Ids this anchor was trained on top of / built from (ordered stack first, then the other lineage ids), de-duplicated. */
+export function lineageIds(a) {
+    const out = [];
+    const add = (id) => { if (id && !out.includes(id))
+        out.push(id); };
+    for (const b of a.base?.stack ?? [])
+        add(b.patch_id);
+    for (const b of a.derivation?.bases ?? [])
+        add(b.patch_id);
+    for (const p of a.dataset?.parents ?? [])
+        add(p.patch_id);
+    return out;
+}
+/**
+ * bfloat16 rounding of float32 values (round-to-nearest-even on the dropped 16 bits) — the representation the table
+ * holds, so equality checks between a delta's `before` and a parent's `after` are exact (§5.4, §8).
+ */
+export function bf16Bits(f32) {
+    const buf = new ArrayBuffer(4);
+    const dv = new DataView(buf);
+    dv.setFloat32(0, f32, true);
+    const bits = dv.getUint32(0, true);
+    if ((bits & 0x7f800000) === 0x7f800000)
+        return (bits >>> 16) & 0xffff; // NaN / Inf: truncate
+    const lower = bits & 0xffff;
+    const upper = bits >>> 16;
+    const round = lower > 0x8000 || (lower === 0x8000 && (upper & 1) === 1) ? 1 : 0;
+    return (upper + round) & 0xffff;
+}
+/**
+ * `pre_state_sha256` (§5.1): sha256 over the rows sorted by address, each contributing `addr` as int64 LE followed by
+ * the bf16 bits (uint16 LE) of every `before` value. `before` is float32 row-major, `dim` values per row.
+ */
+export function preStateSha256(addrs, before, dim) {
+    const n = addrs.length;
+    const order = [...Array(n).keys()].sort((i, j) => (addrs[i] < addrs[j] ? -1 : addrs[i] > addrs[j] ? 1 : 0));
+    const buf = Buffer.alloc(n * (8 + 2 * dim));
+    let o = 0;
+    for (const i of order) {
+        buf.writeBigInt64LE(addrs[i], o);
+        o += 8;
+        for (let d = 0; d < dim; d++) {
+            buf.writeUInt16LE(bf16Bits(before[i * dim + d]), o);
+            o += 2;
+        }
+    }
+    return sha256Hex(buf);
+}
+/** Merkle root over canonical row lines (leaf = sha256(line)); a single leaf is its own root, an empty set hashes ''. */
+export function merkleRoot(leaves) {
+    if (!leaves.length)
+        return sha256Hex('');
+    let level = leaves.map((l) => sha256Hex(l));
+    while (level.length > 1) {
+        const next = [];
+        for (let i = 0; i < level.length; i += 2)
+            next.push(i + 1 < level.length ? sha256Hex(level[i] + level[i + 1]) : level[i]);
+        level = next;
+    }
+    return level[0];
+}
+//# sourceMappingURL=lineage.js.map

package/dist/lineage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lineage.js","sourceRoot":"","sources":["../src/lineage.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAC1D,OAAO,EAAE,qBAAqB,EAAE,gBAAgB,EAAE,sBAAsB,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAG/G,MAAM,CAAC,MAAM,gBAAgB,GAA8B,CAAC,QAAQ,EAAE,QAAQ,EAAE,YAAY,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;AAEnH,+GAA+G;AAC/G,MAAM,UAAU,WAAW,CAAC,OAA0B;IACpD,OAAO,SAAS,CAAC,aAAa,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3I,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAAC,GAAsB,EAAE,YAA8D,EAAE,EAAE,GAAG,GAAG,sBAAsB;IACxJ,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,IAAI,GAAsB,EAAE,CAAC;IACnC,MAAM,IAAI,GAAG,CAAC,CAAkB,EAAE,EAAE,GAAG,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,SAAS,CAAC,CAAC,MAAM,SAAS,CAAC,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9J,KAAK,MAAM,CAAC,IAAI,GAAG;QAAE,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IAClE,KAAK,MAAM,CAAC,IAAI,SAAS;QAAE,IAAI,CAAC,CAAC,MAAM;YAAE,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;IACxH,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;AAChF,CAAC;AAED,MAAM,WAAW,GAAkC,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;AAC5F,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,CAA4B,EAAU,EAAE,CAAC,WAAW,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC;AAChG,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,CAA8D,EAAiB,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,IAAI,SAAS,CAAC;AAE3I;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAAC,MAAoD,EAAE,KAAiD;IACvI,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,OAAO,CAAC;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,iBAAiB,KAAK,CAAC,OAAO,mBAAmB,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;IACnJ,IAAI,MAAM,CAAC,OAAO,KAAK,cAAc,EAAE,CAAC;QACtC,IAAI,KAAK,CAAC,OAAO,KAAK,cAAc;YAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,+FAA+F,EAAE,CAAC;QACpK,IAAI,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC;YAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,wDAAwD,MAAM,CAAC,MAAM,yDAAyD,EAAE,CAAC;IACzN,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;AACtB,CAAC;AAED,mFAAmF;AACnF,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,OAA2B,EAAW,EAAE,CAAC,OAAO,KAAK,aAAa,CAAC;AAEnG;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,CAAmG;IACjI,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;IACzC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QAAE,GAAG,CAAC,IAAI,CAAC,sDAAsD,CAAC,CAAC;IACxF,IAAI,CAAC,CAAC,UAAU,EAAE,CAAC;QACjB,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,kCAAkC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC7H,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,KAAK,IAAI,EAAE;YAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAC,QAAQ,2BAA2B,CAAC,CAAC;QAClJ,KAAK,MAAM,CAAC,IAAI,CAAC,YAAY,EAAE,cAAc,EAAE,cAAc,CAAU;YAAE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,iCAAiC,CAAC,CAAC;IACrM,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QACX,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,OAAO,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,QAAQ;YAAE,GAAG,CAAC,IAAI,CAAC,yCAAyC,CAAC,CAAC;QACjH,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE;YAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,QAAQ,2BAA2B,CAAC,CAAC;QACtI,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,MAAM;YAAE,GAAG,CAAC,IAAI,CAAC,sCAAsC,CAAC,CAAC;QAChH,IAAI,OAAO,CAAC,CAAC,IAAI,CAAC,gBAAgB,KAAK,QAAQ,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,4CAA4C,CAAC,CAAC;IAC7J,CAAC;IACD,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;QACd,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,SAAS,IAAI,CAAE,qBAA2C,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,iCAAiC,qBAAqB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC9L,IAAI,CAAC,CAAC,OAAO,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,+CAA+C,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACpK,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,OAAO,IAAI,EAAE;YAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC,QAAQ,2BAA2B,CAAC,CAAC;IAClJ,CAAC;IACD,IAAI,CAAC,CAAC,MAAM,KAAK,OAAO,IAAI,CAAC,CAAC,CAAC,SAAS,EAAE,OAAO,EAAE,MAAM,IAAI,CAAC,CAAC,GAAG,sBAAsB;QAAE,GAAG,CAAC,IAAI,CAAC,mCAAmC,sBAAsB,qEAAqE,CAAC,CAAC;IACnO,OAAO,GAAG,CAAC;AACb,CAAC;AAED,2HAA2H;AAC3H,MAAM,UAAU,UAAU,CAAC,CAAmE;IAC5F,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,GAAG,GAAG,CAAC,EAAU,EAAE,EAAE,GAAG,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;QAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3E,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,IAAI,EAAE;QAAE,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACrD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,KAAK,IAAI,EAAE;QAAE,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IAC3D,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,OAAO,IAAI,EAAE;QAAE,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IAC1D,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,QAAQ,CAAC,GAAW;IAClC,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IAAC,MAAM,EAAE,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC;IAC7D,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;IAC5B,MAAM,IAAI,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACnC,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC,KAAK,UAAU;QAAE,OAAO,CAAC,IAAI,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC,CAAG,sBAAsB;IAC/F,MAAM,KAAK,GAAG,IAAI,GAAG,MAAM,CAAC;IAC5B,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;IAC1B,MAAM,KAAK,GAAG,KAAK,GAAG,MAAM,IAAI,CAAC,KAAK,KAAK,MAAM,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChF,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,MAAM,CAAC;AAClC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,KAAoB,EAAE,MAAoB,EAAE,GAAW;IACpF,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5G,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAC5C,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,GAAG,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAAC,CAAC,IAAI,CAAC,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAAC,GAAG,CAAC,aAAa,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAAC,CAAC,IAAI,CAAC,CAAC;QAAC,CAAC;IAChG,CAAC;IACD,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;AACxB,CAAC;AAED,yHAAyH;AACzH,MAAM,UAAU,UAAU,CAAC,MAAgB;IACzC,IAAI,CAAC,MAAM,CAAC,MAAM;QAAE,OAAO,SAAS,CAAC,EAAE,CAAC,CAAC;IACzC,IAAI,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5C,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1H,KAAK,GAAG,IAAI,CAAC;IACf,CAAC;IACD,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC"}

package/dist/local-ledger.d.ts

@@ -0,0 +1,74 @@
+import type { Ledger, LedgerEvents, LedgerInfo, RecordBody, SubscriptionRecord, SupersedeRecord } from './ledger.js';
+import type { Attestation, BranchInfo, Challenge, Dispute, LedgerRecord, PatchAnchor, PeerInfo, RecordKind, Settlement } from './types.js';
+import type { Identity } from './identity.js';
+export declare function recordHash(kind: RecordKind, body: unknown, author: string, ts: number, parents: string[]): string;
+/**
+ * A record this ledger will never accept, however often it is offered — a hash that does not match its body, a
+ * signature that is not its author's.
+ *
+ * The distinction matters to whoever is feeding records in: a refusal is final, so a sync may pass over it, while
+ * anything else (a busy database, a write that threw part-way) is this node's problem and the record must be
+ * offered again rather than skipped for ever.
+ */
+export declare class RecordRefused extends Error {
+    readonly refused: true;
+    constructor(message: string);
+}
+/** Is this the ledger saying "never", rather than "not now"? */
+export declare function isRecordRefusal(e: unknown): boolean;
+export declare class LocalLedger implements Ledger {
+    private readonly path;
+    private readonly identity;
+    private readonly events;
+    private readonly network;
+    readonly kind: "local";
+    private db;
+    constructor(path: string, identity: Identity, events?: LedgerEvents, network?: string);
+    init(): Promise<void>;
+    close(): Promise<void>;
+    info(): Promise<LedgerInfo>;
+    private frontier;
+    append<T extends RecordBody>(kind: RecordKind, body: T): Promise<LedgerRecord<T>>;
+    ingest(record: LedgerRecord): Promise<boolean>;
+    static validate(record: LedgerRecord): boolean;
+    /** Legacy prototype block: {i,t,kind,body,prev,hash,sig(HMAC)} mapped into a record. */
+    private static validateLegacy;
+    private has;
+    private insert;
+    private rowToRecord;
+    list(opts?: {
+        since?: number;
+        kind?: RecordKind;
+        limit?: number;
+    }): Promise<LedgerRecord[]>;
+    get(hash: string): Promise<LedgerRecord | null>;
+    /** Records received after `since` (peer-local receive clock) plus the cursor to continue from. */
+    sync(since?: number, limit?: number): Promise<{
+        records: LedgerRecord[];
+        cursor: number;
+    }>;
+    hashes(since?: number): Promise<string[]>;
+    private byKind;
+    anchors(): Promise<LedgerRecord<PatchAnchor>[]>;
+    attestations(patchId?: string): Promise<LedgerRecord<Attestation>[]>;
+    settlements(patchId?: string): Promise<LedgerRecord<Settlement>[]>;
+    challenges(patchId?: string): Promise<LedgerRecord<Challenge>[]>;
+    disputes(patchId?: string): Promise<LedgerRecord<Dispute>[]>;
+    branches(): Promise<LedgerRecord<BranchInfo>[]>;
+    nodes(): Promise<LedgerRecord<PeerInfo>[]>;
+    supersedes(): Promise<LedgerRecord<SupersedeRecord>[]>;
+    subscriptions(): Promise<LedgerRecord<SubscriptionRecord>[]>;
+    verify(): Promise<{
+        valid: boolean;
+        checked: number;
+        errors: string[];
+    }>;
+    /**
+     * Import the reference prototype's ledger.jsonl (Python HMAC chain). Blocks become records whose
+     * `hash` is the original block hash; their Python-shaped bodies are normalised onto our schema by the
+     * caller (see node/seed.ts) — here we only preserve them verbatim so `verify()` can re-check the chain.
+     */
+    importPrototypeLedger(file: string): Promise<number>;
+}
+export type { SupersedeRecord, SubscriptionRecord };
+//# sourceMappingURL=local-ledger.d.ts.map

package/dist/local-ledger.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"local-ledger.d.ts","sourceRoot":"","sources":["../src/local-ledger.ts"],"names":[],"mappings":"AAiBA,OAAO,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,UAAU,EAAE,UAAU,EAAE,kBAAkB,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AACrH,OAAO,KAAK,EACV,WAAW,EAAE,UAAU,EAAE,SAAS,EAAE,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE,UAAU,EACzG,MAAM,YAAY,CAAC;AACpB,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAM9C,wBAAgB,UAAU,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,CAEjH;AAED;;;;;;;GAOG;AACH,qBAAa,aAAc,SAAQ,KAAK;IACtC,QAAQ,CAAC,OAAO,EAAG,IAAI,CAAU;gBACrB,OAAO,EAAE,MAAM;CAC5B;AAED,gEAAgE;AAChE,wBAAgB,eAAe,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAEnD;AAED,qBAAa,WAAY,YAAW,MAAM;IAKtC,OAAO,CAAC,QAAQ,CAAC,IAAI;IACrB,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,OAAO,CAAC,QAAQ,CAAC,MAAM;IACvB,OAAO,CAAC,QAAQ,CAAC,OAAO;IAP1B,QAAQ,CAAC,IAAI,EAAG,OAAO,CAAU;IACjC,OAAO,CAAC,EAAE,CAAgB;gBAGP,IAAI,EAAE,MAAM,EACZ,QAAQ,EAAE,QAAQ,EAClB,MAAM,GAAE,YAAiB,EACzB,OAAO,SAAU;IAG9B,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAuBrB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAEtB,IAAI,IAAI,OAAO,CAAC,UAAU,CAAC;IAMjC,OAAO,CAAC,QAAQ;IAKV,MAAM,CAAC,CAAC,SAAS,UAAU,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAWjF,MAAM,CAAC,MAAM,EAAE,YAAY,GAAG,OAAO,CAAC,OAAO,CAAC;IAQpD,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,YAAY,GAAG,OAAO;IAO9C,wFAAwF;IACxF,OAAO,CAAC,MAAM,CAAC,cAAc;IAU7B,OAAO,CAAC,GAAG;IAIX,OAAO,CAAC,MAAM;IAMd,OAAO,CAAC,WAAW;IAYb,IAAI,CAAC,IAAI,GAAE;QAAE,KAAK,CAAC,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,UAAU,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAO,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IAS/F,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC;IAKrD,kGAAkG;IAC5F,IAAI,CAAC,KAAK,SAAI,EAAE,KAAK,SAAM,GAAG,OAAO,CAAC;QAAE,OAAO,EAAE,YAAY,EAAE,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IAOlF,MAAM,CAAC,KAAK,SAAI,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;YAI5B,MAAM;IAKpB,OAAO;IACP,YAAY,CAAC,OAAO,CAAC,EAAE,MAAM;IAC7B,WAAW,CAAC,OAAO,CAAC,EAAE,MAAM;IAC5B,UAAU,CAAC,OAAO,CAAC,EAAE,MAAM;IAC3B,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM;IACzB,QAAQ;IACR,KAAK;IACL,UAAU;IACV,aAAa;IAEP,MAAM,IAAI,OAAO,CAAC;QAAE,KAAK,EAAE,OAAO,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IAgB9E;;;;OAIG;IACG,qBAAqB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;CAoB3D;AAED,YAAY,EAAE,eAAe,EAAE,kBAAkB,EAAE,CAAC"}