@typeberry/lib 0.8.4-7a69737 → 0.8.4-7d1719f

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@typeberry/lib",
-  "version": "0.8.4-7a69737",
+  "version": "0.8.4-7d1719f",
   "description": "Typeberry Library",
   "main": "./bin/lib/index.js",
   "types": "./bin/lib/index.d.ts",
@@ -216,6 +216,8 @@
     "#@typeberry/config-node/*": "./packages/jam/config-node/*",
     "#@typeberry/database": "./packages/jam/database/index.js",
     "#@typeberry/database/*": "./packages/jam/database/*",
+    "#@typeberry/database-fjall": "./packages/jam/database-fjall/index.js",
+    "#@typeberry/database-fjall/*": "./packages/jam/database-fjall/*",
     "#@typeberry/database-lmdb": "./packages/jam/database-lmdb/index.js",
     "#@typeberry/database-lmdb/*": "./packages/jam/database-lmdb/*",
     "#@typeberry/executor": "./packages/jam/executor/index.js",
@@ -244,6 +246,8 @@
     "#@typeberry/state-merkleization/*": "./packages/jam/state-merkleization/*",
     "#@typeberry/state-vectors": "./packages/jam/state-vectors/index.js",
     "#@typeberry/state-vectors/*": "./packages/jam/state-vectors/*",
+    "#@typeberry/ticket-pool": "./packages/jam/ticket-pool/index.js",
+    "#@typeberry/ticket-pool/*": "./packages/jam/ticket-pool/*",
     "#@typeberry/transition": "./packages/jam/transition/index.js",
     "#@typeberry/transition/*": "./packages/jam/transition/*",
     "#@typeberry/disputes": "./packages/jam/transition/disputes/index.js",

package/packages/jam/database-fjall/hybrid-states.d.ts

@@ -0,0 +1,45 @@
+import type { HeaderHash, StateRootHash } from "#@typeberry/block";
+import type { ChainSpec } from "#@typeberry/config";
+import { type InitStatesDb, LeafDb, type StatesDb, StateUpdateError } from "#@typeberry/database";
+import type { Blake2b } from "#@typeberry/hash";
+import type { ServicesUpdate, State } from "#@typeberry/state";
+import { SerializedState, type StateEntries } from "#@typeberry/state-merkleization";
+import { OK, Result } from "#@typeberry/utils";
+/**
+ * Hybrid serialized-states db (fjall variant).
+ *
+ * States (leafs) are kept in-memory, but large values are persisted to fjall.
+ * Reads go straight to fjall, which keeps its own (bounded) block cache.
+ * Designed for long fuzzing, used with pruning to keep heap usage bounded.
+ *
+ * Behaviourally identical to the LMDB hybrid db; differences are mechanical:
+ * construction is async, and value writes are ordered + flushed explicitly
+ * because fjall has no transaction primitive.
+ */
+export declare class HybridSerializedStates implements StatesDb<SerializedState<LeafDb>>, InitStatesDb<StateEntries> {
+    private readonly spec;
+    private readonly blake2b;
+    private readonly root;
+    private readonly values;
+    static new({ spec, blake2b, dbPath, ephemeral, }: {
+        spec: ChainSpec;
+        blake2b: Blake2b;
+        dbPath: string;
+        ephemeral?: boolean;
+    }): Promise<HybridSerializedStates>;
+    private readonly inMemStates;
+    private readonly valuesDb;
+    private constructor();
+    insertInitialState(headerHash: HeaderHash, entries: StateEntries): Promise<Result<OK, StateUpdateError>>;
+    updateAndSetState(header: HeaderHash, state: SerializedState<LeafDb>, update: Partial<State & ServicesUpdate>): Promise<Result<OK, StateUpdateError>>;
+    getStateRoot(state: SerializedState<LeafDb>): Promise<StateRootHash>;
+    getState(header: HeaderHash): SerializedState<LeafDb> | null;
+    markUnused(header: HeaderHash): void;
+    diskSizeInBytes(): number | null;
+    close(): Promise<void>;
+    /** Write new large values to fjall, then flush. */
+    private writeValues;
+    /** Read a value from fjall. */
+    private readValue;
+}
+//# sourceMappingURL=hybrid-states.d.ts.map

package/packages/jam/database-fjall/hybrid-states.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hybrid-states.d.ts","sourceRoot":"","sources":["../../../../../packages/jam/database-fjall/hybrid-states.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAGlE,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EACL,KAAK,YAAY,EACjB,MAAM,EACN,KAAK,QAAQ,EACb,gBAAgB,EAGjB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,iBAAiB,CAAC;AAE/C,OAAO,KAAK,EAAE,cAAc,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAC9D,OAAO,EACL,eAAe,EACf,KAAK,YAAY,EAGlB,MAAM,gCAAgC,CAAC;AAExC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAK9C;;;;;;;;;;GAUG;AACH,qBAAa,sBAAuB,YAAW,QAAQ,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,EAAE,YAAY,CAAC,YAAY,CAAC;IAsBxG,OAAO,CAAC,QAAQ,CAAC,IAAI;IACrB,OAAO,CAAC,QAAQ,CAAC,OAAO;IACxB,OAAO,CAAC,QAAQ,CAAC,IAAI;IACrB,OAAO,CAAC,QAAQ,CAAC,MAAM;WAxBZ,GAAG,CAAC,EACf,IAAI,EACJ,OAAO,EACP,MAAM,EACN,SAAS,GACV,EAAE;QACD,IAAI,EAAE,SAAS,CAAC;QAChB,OAAO,EAAE,OAAO,CAAC;QACjB,MAAM,EAAE,MAAM,CAAC;QACf,SAAS,CAAC,EAAE,OAAO,CAAC;KACrB,GAAG,OAAO,CAAC,sBAAsB,CAAC;IAMnC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAyE;IAErG,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAW;IAEpC,OAAO;IASD,kBAAkB,CAAC,UAAU,EAAE,UAAU,EAAE,OAAO,EAAE,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,gBAAgB,CAAC,CAAC;IAcxG,iBAAiB,CACrB,MAAM,EAAE,UAAU,EAClB,KAAK,EAAE,eAAe,CAAC,MAAM,CAAC,EAC9B,MAAM,EAAE,OAAO,CAAC,KAAK,GAAG,cAAc,CAAC,GACtC,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,gBAAgB,CAAC,CAAC;IAkBlC,YAAY,CAAC,KAAK,EAAE,eAAe,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,aAAa,CAAC;IAI1E,QAAQ,CAAC,MAAM,EAAE,UAAU,GAAG,eAAe,CAAC,MAAM,CAAC,GAAG,IAAI;IAS5D,UAAU,CAAC,MAAM,EAAE,UAAU,GAAG,IAAI;IAMpC,eAAe,IAAI,MAAM,GAAG,IAAI;IAI1B,KAAK;IAIX,mDAAmD;YACrC,WAAW;IAgBzB,+BAA+B;IAC/B,OAAO,CAAC,SAAS;CAOlB"}

package/packages/jam/database-fjall/hybrid-states.js

@@ -0,0 +1,113 @@
+import { HashDictionary, SortedSet } from "#@typeberry/collections";
+import { LeafDb, StateUpdateError, updateLeafs, } from "#@typeberry/database";
+import { Logger } from "#@typeberry/logger";
+import { SerializedState, StateEntryUpdateAction, serializeStateUpdate, } from "#@typeberry/state-merkleization";
+import { leafComparator } from "#@typeberry/trie";
+import { OK, Result } from "#@typeberry/utils";
+import { FjallRoot, toUint8Array } from "./root.js";
+const logger = Logger.new(import.meta.filename, "db");
+/**
+ * Hybrid serialized-states db (fjall variant).
+ *
+ * States (leafs) are kept in-memory, but large values are persisted to fjall.
+ * Reads go straight to fjall, which keeps its own (bounded) block cache.
+ * Designed for long fuzzing, used with pruning to keep heap usage bounded.
+ *
+ * Behaviourally identical to the LMDB hybrid db; differences are mechanical:
+ * construction is async, and value writes are ordered + flushed explicitly
+ * because fjall has no transaction primitive.
+ */
+export class HybridSerializedStates {
+    spec;
+    blake2b;
+    root;
+    values;
+    static async new({ spec, blake2b, dbPath, ephemeral, }) {
+        const root = await FjallRoot.open(dbPath, { ephemeral });
+        const values = await root.partition("values");
+        return new HybridSerializedStates(spec, blake2b, root, values);
+    }
+    inMemStates = HashDictionary.new();
+    // A single shared values accessor reused by every `LeafDb` we hand out.
+    valuesDb;
+    constructor(spec, blake2b, root, values) {
+        this.spec = spec;
+        this.blake2b = blake2b;
+        this.root = root;
+        this.values = values;
+        this.valuesDb = { get: (key) => this.readValue(key) };
+    }
+    async insertInitialState(headerHash, entries) {
+        const { values, leafs } = updateLeafs(SortedSet.fromArray(leafComparator, []), this.blake2b, Array.from(entries, (x) => [StateEntryUpdateAction.Insert, x[0], x[1]]));
+        const res = await this.writeValues(values);
+        if (res.isError) {
+            return res;
+        }
+        this.inMemStates.set(headerHash, leafs);
+        return Result.ok(OK);
+    }
+    async updateAndSetState(header, state, update) {
+        const updatedValues = serializeStateUpdate(this.spec, this.blake2b, update);
+        // Clone the leaf set before mutating: the previous state keeps using its own.
+        const newLeafs = SortedSet.fromSortedArray(leafComparator, state.backend.leafs.array);
+        const { values, leafs } = updateLeafs(newLeafs, this.blake2b, updatedValues);
+        const res = await this.writeValues(values);
+        if (res.isError) {
+            // Leave the caller's state untouched: its new leaves would reference
+            // values that never reached disk.
+            return res;
+        }
+        // Re-create the lookup with the shared values accessor only once the new
+        // values are durably written.
+        state.updateBackend(LeafDb.fromLeaves(leafs, this.valuesDb));
+        this.inMemStates.set(header, leafs);
+        return Result.ok(OK);
+    }
+    async getStateRoot(state) {
+        return state.backend.getStateRoot(this.blake2b);
+    }
+    getState(header) {
+        const leafs = this.inMemStates.get(header);
+        if (leafs === undefined) {
+            return null;
+        }
+        const leafDb = LeafDb.fromLeaves(leafs, this.valuesDb);
+        return SerializedState.new(this.spec, this.blake2b, leafDb);
+    }
+    markUnused(header) {
+        // We only remove the state from memory - values are not pruned at all,
+        // but since they are stored on disk we should be safe.
+        this.inMemStates.delete(header);
+    }
+    diskSizeInBytes() {
+        return this.root.sizeInBytes();
+    }
+    async close() {
+        await this.root.close();
+    }
+    /** Write new large values to fjall, then flush. */
+    async writeValues(values) {
+        if (values.length === 0) {
+            return Result.ok(OK);
+        }
+        try {
+            for (const [hash, val] of values) {
+                await this.values.insert(hash.raw, val.raw);
+            }
+            await this.root.persist();
+        }
+        catch (e) {
+            logger.error `${e}`;
+            return Result.error(StateUpdateError.Commit, () => `Failed to commit values: ${e}`);
+        }
+        return Result.ok(OK);
+    }
+    /** Read a value from fjall. */
+    readValue(key) {
+        const val = toUint8Array(this.values.get(key.raw));
+        if (val === null) {
+            throw new Error(`Missing value at key: ${key}`);
+        }
+        return val;
+    }
+}

package/packages/jam/database-fjall/hybrid-states.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=hybrid-states.test.d.ts.map

package/packages/jam/database-fjall/hybrid-states.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hybrid-states.test.d.ts","sourceRoot":"","sources":["../../../../../packages/jam/database-fjall/hybrid-states.test.ts"],"names":[],"mappings":""}

package/packages/jam/database-fjall/hybrid-states.test.js

@@ -0,0 +1,83 @@
+import assert from "node:assert";
+import * as fs from "node:fs";
+import { afterEach, before, beforeEach, describe, it } from "node:test";
+import { Bytes, BytesBlob } from "#@typeberry/bytes";
+import { tinyChainSpec } from "#@typeberry/config";
+import { Blake2b, HASH_SIZE } from "#@typeberry/hash";
+import { InMemoryState } from "#@typeberry/state";
+import { StateEntries } from "#@typeberry/state-merkleization";
+import { deepEqual, OK, Result } from "#@typeberry/utils";
+import { HybridSerializedStates } from "./hybrid-states.js";
+let blake2b;
+before(async () => {
+    blake2b = await Blake2b.createHasher();
+});
+function createTempDir(suffix = "fjall-hybrid") {
+    return fs.mkdtempSync(`typeberry-${suffix}`);
+}
+describe("Fjall hybrid serialized states", () => {
+    const spec = tinyChainSpec;
+    const headerHash = Bytes.zero(HASH_SIZE).asOpaque();
+    let dbPath = "";
+    beforeEach(() => {
+        dbPath = createTempDir();
+    });
+    afterEach(() => {
+        fs.rmSync(dbPath, { recursive: true });
+    });
+    it("round-trips an initial state through the on-disk values store", async () => {
+        const states = await HybridSerializedStates.new({ spec, blake2b, dbPath });
+        try {
+            const empty = InMemoryState.empty(spec);
+            const serialized = StateEntries.serializeInMemory(spec, blake2b, empty);
+            const expectedRoot = serialized.getRootHash(blake2b);
+            const res = await states.insertInitialState(headerHash, serialized);
+            deepEqual(res, Result.ok(OK));
+            const state = states.getState(headerHash);
+            assert.ok(state !== null);
+            const stateRoot = await states.getStateRoot(state);
+            assert.strictEqual(`${stateRoot}`, `${expectedRoot}`);
+            deepEqual(InMemoryState.copyFrom(spec, state, new Map()), empty);
+        }
+        finally {
+            await states.close();
+        }
+    });
+    it("reads large values back from disk", async () => {
+        const states = await HybridSerializedStates.new({ spec, blake2b, dbPath });
+        try {
+            // > 32 bytes => stored in the values db (not embedded in the leaf).
+            const big1 = BytesBlob.blobFromString("x".repeat(100));
+            const big2 = BytesBlob.blobFromString("y".repeat(100));
+            const key1 = Bytes.fill(HASH_SIZE, 1).asOpaque();
+            const key2 = Bytes.fill(HASH_SIZE, 2).asOpaque();
+            const entries = StateEntries.fromEntriesUnsafe([
+                [key1, big1],
+                [key2, big2],
+            ]);
+            const res = await states.insertInitialState(headerHash, entries);
+            deepEqual(res, Result.ok(OK));
+            const state = states.getState(headerHash);
+            assert.ok(state !== null);
+            assert.strictEqual(`${state.backend.get(key2)}`, `${big2}`);
+            assert.strictEqual(`${state.backend.get(key1)}`, `${big1}`);
+        }
+        finally {
+            await states.close();
+        }
+    });
+    it("drops the leaf set on markUnused while values stay on disk", async () => {
+        const states = await HybridSerializedStates.new({ spec, blake2b, dbPath });
+        try {
+            const empty = InMemoryState.empty(spec);
+            const serialized = StateEntries.serializeInMemory(spec, blake2b, empty);
+            await states.insertInitialState(headerHash, serialized);
+            assert.ok(states.getState(headerHash) !== null);
+            states.markUnused(headerHash);
+            assert.strictEqual(states.getState(headerHash), null);
+        }
+        finally {
+            await states.close();
+        }
+    });
+});

package/packages/jam/database-fjall/index.d.ts

@@ -0,0 +1,3 @@
+export * from "./hybrid-states.js";
+export * from "./root.js";
+//# sourceMappingURL=index.d.ts.map

package/packages/jam/database-fjall/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../packages/jam/database-fjall/index.ts"],"names":[],"mappings":"AAAA,cAAc,oBAAoB,CAAC;AACnC,cAAc,WAAW,CAAC"}

package/packages/jam/database-fjall/index.js

@@ -0,0 +1,2 @@
+export * from "./hybrid-states.js";
+export * from "./root.js";

package/packages/jam/database-fjall/root.d.ts

@@ -0,0 +1,52 @@
+import { type Partition } from "@fjall-js/fjall";
+export type { Partition };
+/**
+ * Normalize a value read from fjall (a Node `Buffer`) into a plain `Uint8Array`.
+ */
+export declare function toUint8Array(value: Buffer | null): Uint8Array | null;
+export type FjallRootOptions = {
+    /**
+     * When set, durability flushes (`persist`) are skipped entirely.
+     *
+     * Only safe for throwaway databases (e.g. the fuzz target, which wipes on
+     * every reset). Mirrors LMDB's `noSync`.
+     */
+    ephemeral?: boolean;
+};
+/**
+ * A thin abstraction over the fjall keyspace.
+ *
+ * Unlike LMDB (a memory-mapped B-tree), fjall is an LSM-tree that reads/writes
+ * through regular file I/O, so its working set is bounded by an explicit block
+ * cache rather than the whole mmap. LMDB has been causing oom issues because
+ * of that.
+ */
+export declare class FjallRoot {
+    private readonly keyspace;
+    /** Path of the underlying keyspace directory, used to report on-disk usage. */
+    private readonly dbPath;
+    private readonly options;
+    private constructor();
+    /** Open (or create) a fjall keyspace at the given path. */
+    static open(dbPath: string, options: FjallRootOptions): Promise<FjallRoot>;
+    /** Open (or create) a partition under this keyspace. */
+    partition(name: string): Promise<Partition>;
+    /**
+     * Flush the journal to disk so prior writes survive a crash.
+     *
+     * Call after a logically-complete unit of work (one block, one state commit).
+     * A no-op for ephemeral databases.
+     */
+    persist(): Promise<void>;
+    /**
+     * Apparent on-disk size of the keyspace directory, in bytes.
+     *
+     * Returns `null` if the directory cannot be walked (e.g. not yet created).
+     * Unlike LMDB's single `data.mdb`, a fjall keyspace is a directory of
+     * partition and journal files, so we sum it recursively.
+     */
+    sizeInBytes(): number | null;
+    /** Persist with `sync-all` and release the keyspace handle. */
+    close(): Promise<void>;
+}
+//# sourceMappingURL=root.d.ts.map

package/packages/jam/database-fjall/root.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"root.d.ts","sourceRoot":"","sources":["../../../../../packages/jam/database-fjall/root.ts"],"names":[],"mappings":"AAEA,OAAO,EAAuB,KAAK,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAEtE,YAAY,EAAE,SAAS,EAAE,CAAC;AAE1B;;GAEG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,GAAG,UAAU,GAAG,IAAI,CAKpE;AAED,MAAM,MAAM,gBAAgB,GAAG;IAC7B;;;;;OAKG;IACH,SAAS,CAAC,EAAE,OAAO,CAAC;CACrB,CAAC;AAEF;;;;;;;GAOG;AACH,qBAAa,SAAS;IAElB,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,+EAA+E;IAC/E,OAAO,CAAC,QAAQ,CAAC,MAAM;IACvB,OAAO,CAAC,QAAQ,CAAC,OAAO;IAJ1B,OAAO;IAOP,2DAA2D;WAC9C,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,gBAAgB,GAAG,OAAO,CAAC,SAAS,CAAC;IAKhF,wDAAwD;IAClD,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC;IAIjD;;;;;OAKG;IACG,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC;IAO9B;;;;;;OAMG;IACH,WAAW,IAAI,MAAM,GAAG,IAAI;IAQ5B,+DAA+D;IACzD,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;CAG7B"}

package/packages/jam/database-fjall/root.js

@@ -0,0 +1,85 @@
+import * as fs from "node:fs";
+import * as path from "node:path";
+import { open } from "@fjall-js/fjall";
+/**
+ * Normalize a value read from fjall (a Node `Buffer`) into a plain `Uint8Array`.
+ */
+export function toUint8Array(value) {
+    if (value === null) {
+        return null;
+    }
+    return new Uint8Array(value.buffer, value.byteOffset, value.byteLength);
+}
+/**
+ * A thin abstraction over the fjall keyspace.
+ *
+ * Unlike LMDB (a memory-mapped B-tree), fjall is an LSM-tree that reads/writes
+ * through regular file I/O, so its working set is bounded by an explicit block
+ * cache rather than the whole mmap. LMDB has been causing oom issues because
+ * of that.
+ */
+export class FjallRoot {
+    keyspace;
+    dbPath;
+    options;
+    constructor(keyspace, 
+    /** Path of the underlying keyspace directory, used to report on-disk usage. */
+    dbPath, options) {
+        this.keyspace = keyspace;
+        this.dbPath = dbPath;
+        this.options = options;
+    }
+    /** Open (or create) a fjall keyspace at the given path. */
+    static async open(dbPath, options) {
+        const keyspace = await open(dbPath);
+        return new FjallRoot(keyspace, dbPath, options);
+    }
+    /** Open (or create) a partition under this keyspace. */
+    async partition(name) {
+        return this.keyspace.partition(name);
+    }
+    /**
+     * Flush the journal to disk so prior writes survive a crash.
+     *
+     * Call after a logically-complete unit of work (one block, one state commit).
+     * A no-op for ephemeral databases.
+     */
+    async persist() {
+        if (this.options.ephemeral === true) {
+            return;
+        }
+        await this.keyspace.persist();
+    }
+    /**
+     * Apparent on-disk size of the keyspace directory, in bytes.
+     *
+     * Returns `null` if the directory cannot be walked (e.g. not yet created).
+     * Unlike LMDB's single `data.mdb`, a fjall keyspace is a directory of
+     * partition and journal files, so we sum it recursively.
+     */
+    sizeInBytes() {
+        try {
+            return dirSizeInBytes(this.dbPath);
+        }
+        catch {
+            return null;
+        }
+    }
+    /** Persist with `sync-all` and release the keyspace handle. */
+    async close() {
+        await this.keyspace.close();
+    }
+}
+function dirSizeInBytes(dir) {
+    let total = 0;
+    for (const entry of fs.readdirSync(dir, { withFileTypes: true })) {
+        const full = path.join(dir, entry.name);
+        if (entry.isDirectory()) {
+            total += dirSizeInBytes(full);
+        }
+        else if (entry.isFile()) {
+            total += fs.statSync(full).size;
+        }
+    }
+    return total;
+}

package/packages/jam/jamnp-s/tasks/ticket-distribution.d.ts

@@ -1,6 +1,7 @@
 import type { Epoch } from "#@typeberry/block";
 import type { SignedTicket } from "#@typeberry/block/tickets.js";
 import type { ChainSpec } from "#@typeberry/config";
+import { type TicketValidator } from "#@typeberry/ticket-pool";
 import type { Connections } from "../peers.js";
 import type { StreamManager } from "../stream-manager.js";
 /**
@@ -9,33 +10,40 @@ import type { StreamManager } from "../stream-manager.js";
  * Uses CE-132 (proxy-to-all) for direct broadcast to all peers.
  * Implements a maintain pattern similar to SyncTask: tickets are collected
  * and periodically distributed to peers that haven't received them yet.
+ *
+ * Incoming tickets from peers are first run through a {@link TicketValidator};
+ * only validated tickets are added to the redistribution pool. The default
+ * validator denies everything, so callers must wire a real one via
+ * {@link setTicketValidator} before any networked ticket can be redistributed.
  */
 export declare class TicketDistributionTask {
     private readonly streamManager;
     private readonly connections;
     static start(streamManager: StreamManager, connections: Connections, chainSpec: ChainSpec): TicketDistributionTask;
-    /** Pending tickets waiting to be distributed to peers */
-    private pendingTickets;
-    /** Current epoch being tracked (cleared when epoch changes) */
-    private currentEpoch;
+    private readonly pool;
+    private validator;
     private constructor();
     /**
      * Should be called periodically to distribute pending tickets to connected peers.
      */
     maintainDistribution(): void;
     /**
-     * Add a ticket to the pending queue for distribution.
+     * Add a ticket to the redistribution pool.
      * Clears pending tickets when epoch changes.
      * Deduplicates tickets based on signature.
      */
     addTicket(epochIndex: Epoch, ticket: SignedTicket): void;
-    private onTicketReceivedCallback;
     /**
-     * Register a callback that validates a received ticket.
-     * The ticket is only added to the redistribution pool if the callback returns `true`.
-     * This prevents redistribution of invalid tickets (e.g. those with a tampered `attempt` field).
+     * Replace the redistribution pool for the given epoch with the supplied tickets.
+     * Used when the authorship worker dumps the authoritative pool on an epoch boundary.
+     */
+    replacePool(epochIndex: Epoch, tickets: readonly SignedTicket[]): void;
+    /**
+     * Register the validator that decides whether tickets received from peers should be
+     * accepted (and therefore redistributed). The default is {@link DenyTicketsValidator},
+     * so the caller must install a real validator for any peer ticket to make it through.
      */
-    setOnTicketReceived(cb: (epochIndex: Epoch, ticket: SignedTicket) => Promise<boolean>): void;
+    setTicketValidator(validator: TicketValidator): void;
     private onTicketReceived;
 }
 //# sourceMappingURL=ticket-distribution.d.ts.map

package/packages/jam/jamnp-s/tasks/ticket-distribution.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ticket-distribution.d.ts","sourceRoot":"","sources":["../../../../../../packages/jam/jamnp-s/tasks/ticket-distribution.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAC9C,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAChE,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAGnD,OAAO,KAAK,EAAW,WAAW,EAAE,MAAM,aAAa,CAAC;AAExD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAe1D;;;;;;GAMG;AACH,qBAAa,sBAAsB;IAuB/B,OAAO,CAAC,QAAQ,CAAC,aAAa;IAC9B,OAAO,CAAC,QAAQ,CAAC,WAAW;IAvB9B,MAAM,CAAC,KAAK,CAAC,aAAa,EAAE,aAAa,EAAE,WAAW,EAAE,WAAW,EAAE,SAAS,EAAE,SAAS;IAgBzF,yDAAyD;IACzD,OAAO,CAAC,cAAc,CAA0D;IAChF,+DAA+D;IAC/D,OAAO,CAAC,YAAY,CAAsB;IAE1C,OAAO;IAKP;;OAEG;IACH,oBAAoB;IAkDpB;;;;OAIG;IACH,SAAS,CAAC,UAAU,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY;IAsCjD,OAAO,CAAC,wBAAwB,CAAgF;IAEhH;;;;OAIG;IACH,mBAAmB,CAAC,EAAE,EAAE,CAAC,UAAU,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,KAAK,OAAO,CAAC,OAAO,CAAC;IAIrF,OAAO,CAAC,gBAAgB;CAsBzB"}
+{"version":3,"file":"ticket-distribution.d.ts","sourceRoot":"","sources":["../../../../../../packages/jam/jamnp-s/tasks/ticket-distribution.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAC9C,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAChE,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAEnD,OAAO,EAA2C,KAAK,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAEvG,OAAO,KAAK,EAAW,WAAW,EAAE,MAAM,aAAa,CAAC;AAExD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAe1D;;;;;;;;;;;GAWG;AACH,qBAAa,sBAAsB;IAqB/B,OAAO,CAAC,QAAQ,CAAC,aAAa;IAC9B,OAAO,CAAC,QAAQ,CAAC,WAAW;IArB9B,MAAM,CAAC,KAAK,CAAC,aAAa,EAAE,aAAa,EAAE,WAAW,EAAE,WAAW,EAAE,SAAS,EAAE,SAAS;IAgBzF,OAAO,CAAC,QAAQ,CAAC,IAAI,CAA2B;IAChD,OAAO,CAAC,SAAS,CAA+C;IAEhE,OAAO;IAKP;;OAEG;IACH,oBAAoB;IAgDpB;;;;OAIG;IACH,SAAS,CAAC,UAAU,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY;IAIjD;;;OAGG;IACH,WAAW,CAAC,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,YAAY,EAAE;IAI/D;;;;OAIG;IACH,kBAAkB,CAAC,SAAS,EAAE,eAAe;IAI7C,OAAO,CAAC,gBAAgB;CAkBzB"}