@typeberry/lib 0.8.4 → 0.9.0-3f2c45b

package/packages/jam/node/main-importer.js

@@ -6,7 +6,7 @@ import { Blake2b, HASH_SIZE } from "#@typeberry/hash";
 import { createImporter, ImporterConfig } from "#@typeberry/importer";
 import { tryAsU16 } from "#@typeberry/numbers";
 import { CURRENT_SUITE, CURRENT_VERSION, Result, resultToString, version } from "#@typeberry/utils";
-import { HybridWorkerConfig, InMemWorkerConfig, LmdbWorkerConfig } from "#@typeberry/workers-api-node";
+import { HybridWorkerConfig, InMemWorkerConfig, LmdbWorkerConfig, } from "#@typeberry/workers-api-node";
 import { getChainSpec, getDatabasePath, initializeDatabase, logger } from "./common.js";
 const zeroHash = Bytes.zero(HASH_SIZE).asOpaque();
 export async function mainImporter(config, withRelPath, options = {}) {
@@ -39,8 +39,8 @@ export async function mainImporter(config, withRelPath, options = {}) {
             blake2b,
             workerParams,
         })
-        : dbBackend === "hybrid"
-            ? HybridWorkerConfig.new({
+        : dbBackend === "lmdb-hybrid" || dbBackend === "fjall-hybrid"
+            ? await HybridWorkerConfig.new({
                 nodeName,
                 chainSpec,
                 blake2b,
@@ -48,6 +48,8 @@ export async function mainImporter(config, withRelPath, options = {}) {
                 workerParams,
                 ephemeral,
                 compression,
+                backend: dbBackend === "lmdb-hybrid" ? "lmdb" : "fjall",
+                sharedFjallSession: options.sharedFjallSession,
             })
             : LmdbWorkerConfig.new({
                 nodeName,

package/packages/jam/safrole/bandersnatch-vrf.d.ts

@@ -21,13 +21,33 @@ declare function verifySeal(bandersnatch: BandernsatchWasm, authorKey: Bandersna
 declare function getRingCommitment(bandersnatch: BandernsatchWasm, validators: BandersnatchKey[]): Promise<Result<BandersnatchRingRoot, null>>;
 declare function verifyTickets(bandersnatch: BandernsatchWasm, numberOfValidators: number, epochRoot: BandersnatchRingRoot, tickets: readonly SignedTicket[], entropy: EntropyHash): Promise<{
     isValid: boolean;
-    entropyHash: EntropyHash;
-}[]>;
+    tickets: EntropyHash[];
+}>;
 declare function generateSeal(bandersnatch: BandernsatchWasm, authorKey: BandersnatchSecretSeed, input: BytesBlob, auxData: BytesBlob): Promise<Result<BandersnatchVrfSignature, null>>;
 export type VrfOutputHash = Opaque<OpaqueHash, "VRF Output Hash">;
 declare function getVrfOutputHash(bandersnatch: BandernsatchWasm, authorKey: BandersnatchSecretSeed, input: BytesBlob): Promise<Result<VrfOutputHash, null>>;
 /**
- * Generates signed tickets for all attempts at once using batch ring VRF.
+ * Batch-generate signed tickets for multiple validators in a single native call,
+ * reusing the ring prover setup across all of them. Returns one ticket list per
+ * validator, in the same order as `proverKeyIndices`/`secrets`.
  */
-declare function generateTickets(bandersnatch: BandernsatchWasm, ringKeys: BandersnatchKey[], proverKeyIndex: number, key: BandersnatchSecretSeed, entropy: EntropyHash, ticketsPerValidator: number): Promise<Result<SignedTicket[], null>>;
+declare function generateTickets(bandersnatch: BandernsatchWasm, ringKeys: BandersnatchKey[], proverKeyIndices: readonly number[], secrets: readonly BandersnatchSecretSeed[], entropy: EntropyHash, ticketsPerValidator: number): Promise<Result<SignedTicket[][], null>>;
+/**
+ * Build the concatenated ring-VRF inputs for ticket generation: one
+ * `JAM_TICKET_SEAL || entropy || attempt_byte` input per attempt.
+ *
+ * Exposed so the worker-pool path can build the same inputs to hand off to a
+ * worker thread without re-deriving the layout.
+ */
+export declare function buildTicketVrfInputs(entropy: EntropyHash, ticketsPerValidator: number): {
+    inputsData: Uint8Array;
+    vrfInputDataLen: number;
+};
+/**
+ * Parse the raw output of `batchGenerateRingVrfForValidators` into per-validator
+ * ticket lists. Records are ordered validator-major, then attempt-major; each
+ * record is `status byte || signature`. A malformed batch yields a single error
+ * byte. Exposed so the worker-pool path can parse a worker's raw result.
+ */
+export declare function parseTicketsBatchOutput(result: Uint8Array, numValidators: number, ticketsPerValidator: number): Result<SignedTicket[][], null>;
 //# sourceMappingURL=bandersnatch-vrf.d.ts.map

package/packages/jam/safrole/bandersnatch-vrf.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bandersnatch-vrf.d.ts","sourceRoot":"","sources":["../../../../../packages/jam/safrole/bandersnatch-vrf.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,EAAE,YAAY,EAAsB,MAAM,6BAA6B,CAAC;AAC/E,OAAO,EAAS,SAAS,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,KAAK,EAAE,eAAe,EAAE,sBAAsB,EAAE,MAAM,mBAAmB,CAAC;AACjF,OAAO,EAIL,KAAK,oBAAoB,EACzB,KAAK,wBAAwB,EAC9B,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EAAa,KAAK,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7D,OAAO,EAAE,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AACvD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAwC/D,QAAA,MAAM,SAAS;;;;;;;;CAQd,CAAC;AAKF,eAAe,SAAS,CAAC;AAIzB,iBAAe,iBAAiB,CAC9B,YAAY,EAAE,gBAAgB,EAC9B,SAAS,EAAE,eAAe,EAC1B,SAAS,EAAE,wBAAwB,EACnC,OAAO,EAAE,SAAS,EAClB,qBAAqB,EAAE,SAAS,EAChC,gBAAgB,EAAE,wBAAwB,EAC1C,oBAAoB,EAAE,SAAS,GAC9B,OAAO,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,WAAW,CAAC,EAAE,IAAI,CAAC,CAAC,CAkBnD;AAED,iBAAe,UAAU,CACvB,YAAY,EAAE,gBAAgB,EAC9B,SAAS,EAAE,eAAe,EAC1B,SAAS,EAAE,wBAAwB,EACnC,OAAO,EAAE,SAAS,EAClB,qBAAqB,EAAE,SAAS,GAC/B,OAAO,CAAC,MAAM,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC,CAapC;AAED,iBAAS,iBAAiB,CACxB,YAAY,EAAE,gBAAgB,EAC9B,UAAU,EAAE,eAAe,EAAE,GAC5B,OAAO,CAAC,MAAM,CAAC,oBAAoB,EAAE,IAAI,CAAC,CAAC,CAe7C;AAmBD,iBAAe,aAAa,CAC1B,YAAY,EAAE,gBAAgB,EAC9B,kBAAkB,EAAE,MAAM,EAC1B,SAAS,EAAE,oBAAoB,EAC/B,OAAO,EAAE,SAAS,YAAY,EAAE,EAChC,OAAO,EAAE,WAAW,GACnB,OAAO,CAAC;IAAE,OAAO,EAAE,OAAO,CAAC;IAAC,WAAW,EAAE,WAAW,CAAA;CAAE,EAAE,CAAC,CAqB3D;AAGD,iBAAe,YAAY,CACzB,YAAY,EAAE,gBAAgB,EAC9B,SAAS,EAAE,sBAAsB,EACjC,KAAK,EAAE,SAAS,EAChB,OAAO,EAAE,SAAS,GACjB,OAAO,CAAC,MAAM,CAAC,wBAAwB,EAAE,IAAI,CAAC,CAAC,CAQjD;AAED,MAAM,MAAM,aAAa,GAAG,MAAM,CAAC,UAAU,EAAE,iBAAiB,CAAC,CAAC;AAGlE,iBAAe,gBAAgB,CAC7B,YAAY,EAAE,gBAAgB,EAC9B,SAAS,EAAE,sBAAsB,EACjC,KAAK,EAAE,SAAS,GACf,OAAO,CAAC,MAAM,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC,CAQtC;AAKD;;GAEG;AACH,iBAAe,eAAe,CAC5B,YAAY,EAAE,gBAAgB,EAC9B,QAAQ,EAAE,eAAe,EAAE,EAC3B,cAAc,EAAE,MAAM,EACtB,GAAG,EAAE,sBAAsB,EAC3B,OAAO,EAAE,WAAW,EACpB,mBAAmB,EAAE,MAAM,GAC1B,OAAO,CAAC,MAAM,CAAC,YAAY,EAAE,EAAE,IAAI,CAAC,CAAC,CA0CvC"}
+{"version":3,"file":"bandersnatch-vrf.d.ts","sourceRoot":"","sources":["../../../../../packages/jam/safrole/bandersnatch-vrf.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,EAAE,YAAY,EAAsB,MAAM,6BAA6B,CAAC;AAC/E,OAAO,EAAS,SAAS,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,KAAK,EAAE,eAAe,EAAE,sBAAsB,EAAE,MAAM,mBAAmB,CAAC;AAEjF,OAAO,EAIL,KAAK,oBAAoB,EACzB,KAAK,wBAAwB,EAC9B,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EAAa,KAAK,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7D,OAAO,EAAE,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AACvD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AA4C/D,QAAA,MAAM,SAAS;;;;;;;;CAQd,CAAC;AAKF,eAAe,SAAS,CAAC;AAIzB,iBAAe,iBAAiB,CAC9B,YAAY,EAAE,gBAAgB,EAC9B,SAAS,EAAE,eAAe,EAC1B,SAAS,EAAE,wBAAwB,EACnC,OAAO,EAAE,SAAS,EAClB,qBAAqB,EAAE,SAAS,EAChC,gBAAgB,EAAE,wBAAwB,EAC1C,oBAAoB,EAAE,SAAS,GAC9B,OAAO,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,WAAW,CAAC,EAAE,IAAI,CAAC,CAAC,CAkBnD;AAED,iBAAe,UAAU,CACvB,YAAY,EAAE,gBAAgB,EAC9B,SAAS,EAAE,eAAe,EAC1B,SAAS,EAAE,wBAAwB,EACnC,OAAO,EAAE,SAAS,EAClB,qBAAqB,EAAE,SAAS,GAC/B,OAAO,CAAC,MAAM,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC,CAapC;AAED,iBAAS,iBAAiB,CACxB,YAAY,EAAE,gBAAgB,EAC9B,UAAU,EAAE,eAAe,EAAE,GAC5B,OAAO,CAAC,MAAM,CAAC,oBAAoB,EAAE,IAAI,CAAC,CAAC,CAe7C;AAgBD,iBAAe,aAAa,CAC1B,YAAY,EAAE,gBAAgB,EAC9B,kBAAkB,EAAE,MAAM,EAC1B,SAAS,EAAE,oBAAoB,EAC/B,OAAO,EAAE,SAAS,YAAY,EAAE,EAChC,OAAO,EAAE,WAAW,GACnB,OAAO,CAAC;IAAE,OAAO,EAAE,OAAO,CAAC;IAAC,OAAO,EAAE,WAAW,EAAE,CAAA;CAAE,CAAC,CA0BvD;AAGD,iBAAe,YAAY,CACzB,YAAY,EAAE,gBAAgB,EAC9B,SAAS,EAAE,sBAAsB,EACjC,KAAK,EAAE,SAAS,EAChB,OAAO,EAAE,SAAS,GACjB,OAAO,CAAC,MAAM,CAAC,wBAAwB,EAAE,IAAI,CAAC,CAAC,CAQjD;AAED,MAAM,MAAM,aAAa,GAAG,MAAM,CAAC,UAAU,EAAE,iBAAiB,CAAC,CAAC;AAGlE,iBAAe,gBAAgB,CAC7B,YAAY,EAAE,gBAAgB,EAC9B,SAAS,EAAE,sBAAsB,EACjC,KAAK,EAAE,SAAS,GACf,OAAO,CAAC,MAAM,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC,CAQtC;AAKD;;;;GAIG;AACH,iBAAe,eAAe,CAC5B,YAAY,EAAE,gBAAgB,EAC9B,QAAQ,EAAE,eAAe,EAAE,EAC3B,gBAAgB,EAAE,SAAS,MAAM,EAAE,EACnC,OAAO,EAAE,SAAS,sBAAsB,EAAE,EAC1C,OAAO,EAAE,WAAW,EACpB,mBAAmB,EAAE,MAAM,GAC1B,OAAO,CAAC,MAAM,CAAC,YAAY,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC,CAsBzC;AAED;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAClC,OAAO,EAAE,WAAW,EACpB,mBAAmB,EAAE,MAAM,GAC1B;IAAE,UAAU,EAAE,UAAU,CAAC;IAAC,eAAe,EAAE,MAAM,CAAA;CAAE,CASrD;AAED;;;;;GAKG;AACH,wBAAgB,uBAAuB,CACrC,MAAM,EAAE,UAAU,EAClB,aAAa,EAAE,MAAM,EACrB,mBAAmB,EAAE,MAAM,GAC1B,MAAM,CAAC,YAAY,EAAE,EAAE,EAAE,IAAI,CAAC,CAoBhC"}

package/packages/jam/safrole/bandersnatch-vrf.js

@@ -1,5 +1,6 @@
 import { SignedTicket, tryAsTicketAttempt } from "#@typeberry/block/tickets.js";
 import { Bytes, BytesBlob } from "#@typeberry/bytes";
+import { SEED_SIZE } from "#@typeberry/crypto";
 import { BANDERSNATCH_PROOF_BYTES, BANDERSNATCH_RING_ROOT_BYTES, BANDERSNATCH_VRF_SIGNATURE_BYTES, } from "#@typeberry/crypto/bandersnatch.js";
 import { HASH_SIZE } from "#@typeberry/hash";
 import { Result } from "#@typeberry/utils";
@@ -33,6 +34,10 @@ const ringCommitmentCache = [
         keys: BytesBlob.empty(),
         value: Promise.resolve(Result.error(null, () => "")),
     },
+    {
+        keys: BytesBlob.empty(),
+        value: Promise.resolve(Result.error(null, () => "")),
+    },
 ];
 const FUNCTIONS = {
     verifySeal,
@@ -88,17 +93,20 @@ async function getRingCommitmentNoCache(bandersnatch, keys) {
     }
     return Result.ok(Bytes.fromBlob(commitmentResult.subarray(1), BANDERSNATCH_RING_ROOT_BYTES).asOpaque());
 }
-// One byte for result discriminator (`ResultValues`) and the rest is entropy hash.
-const TICKET_RESULT_LENGTH = 1 + HASH_SIZE;
 async function verifyTickets(bandersnatch, numberOfValidators, epochRoot, tickets, entropy) {
     const contextLength = entropy.length + JAM_TICKET_SEAL.length + 1;
     const ticketsData = BytesBlob.blobFromParts(tickets.map((ticket) => BytesBlob.blobFromParts([ticket.signature.raw, JAM_TICKET_SEAL, entropy.raw, Uint8Array.of(ticket.attempt)])
         .raw)).raw;
     const verificationResult = await bandersnatch.batchVerifyTicket(numberOfValidators, epochRoot.raw, ticketsData, contextLength);
-    return Array.from(BytesBlob.blobFrom(verificationResult).chunks(TICKET_RESULT_LENGTH)).map((result) => ({
-        isValid: result.raw[RESULT_INDEX] === ResultValues.Ok,
-        entropyHash: Bytes.fromBlob(result.raw.subarray(1, TICKET_RESULT_LENGTH), HASH_SIZE).asOpaque(),
-    }));
+    const isValid = verificationResult[RESULT_INDEX] === ResultValues.Ok;
+    // NOTE: in case of failure, the hashes will be all zeros, but we can safely
+    // keep the same code path.
+    const chunks = BytesBlob.blobFrom(verificationResult.subarray(1)).chunks(HASH_SIZE);
+    const results = [];
+    for (const entropyHash of chunks) {
+        results.push(Bytes.fromBlob(entropyHash.raw, HASH_SIZE).asOpaque());
+    }
+    return { isValid, tickets: results };
 }
 const SEAL_FAILED_ERROR = () => "Seal generation failed";
 async function generateSeal(bandersnatch, authorKey, input, auxData) {
@@ -119,31 +127,60 @@ async function getVrfOutputHash(bandersnatch, authorKey, input) {
 // One byte for result discriminator and the rest is the ring VRF signature.
 const GENERATE_RESULT_ENTRY_LENGTH = 1 + BANDERSNATCH_PROOF_BYTES;
 /**
- * Generates signed tickets for all attempts at once using batch ring VRF.
+ * Batch-generate signed tickets for multiple validators in a single native call,
+ * reusing the ring prover setup across all of them. Returns one ticket list per
+ * validator, in the same order as `proverKeyIndices`/`secrets`.
+ */
+async function generateTickets(bandersnatch, ringKeys, proverKeyIndices, secrets, entropy, ticketsPerValidator) {
+    if (proverKeyIndices.length !== secrets.length) {
+        return Result.error(null, () => "proverKeyIndices and secrets must have the same length");
+    }
+    if (proverKeyIndices.length === 0) {
+        return Result.ok([]);
+    }
+    const { inputsData, vrfInputDataLen } = buildTicketVrfInputs(entropy, ticketsPerValidator);
+    const ringKeysData = BytesBlob.blobFromParts(ringKeys.map((k) => k.raw)).raw;
+    const secretSeedsData = BytesBlob.blobFromParts(secrets.map((s) => s.raw)).raw;
+    const result = await bandersnatch.batchGenerateRingVrfForValidators(ringKeysData, Uint32Array.from(proverKeyIndices), secretSeedsData, SEED_SIZE, inputsData, vrfInputDataLen);
+    return parseTicketsBatchOutput(result, proverKeyIndices.length, ticketsPerValidator);
+}
+/**
+ * Build the concatenated ring-VRF inputs for ticket generation: one
+ * `JAM_TICKET_SEAL || entropy || attempt_byte` input per attempt.
+ *
+ * Exposed so the worker-pool path can build the same inputs to hand off to a
+ * worker thread without re-deriving the layout.
  */
-async function generateTickets(bandersnatch, ringKeys, proverKeyIndex, key, entropy, ticketsPerValidator) {
-    // Build VRF inputs: JAM_TICKET_SEAL || entropy || attempt_byte for each attempt
+export function buildTicketVrfInputs(entropy, ticketsPerValidator) {
     const vrfInputParts = [];
     for (let attempt = 0; attempt < ticketsPerValidator; attempt++) {
         vrfInputParts.push(BytesBlob.blobFromParts([JAM_TICKET_SEAL, entropy.raw, Uint8Array.of(attempt)]).raw);
     }
-    const attemptLength = 1;
-    const vrfInputDataLen = JAM_TICKET_SEAL.length + entropy.length + attemptLength;
-    const inputsData = BytesBlob.blobFromParts(vrfInputParts).raw;
-    const ringKeysData = BytesBlob.blobFromParts(ringKeys.map((k) => k.raw)).raw;
-    const result = await bandersnatch.batchGenerateRingVrf(ringKeysData, proverKeyIndex, key.raw, inputsData, vrfInputDataLen);
-    const tickets = [];
-    for (let attempt = 0; attempt < ticketsPerValidator; attempt++) {
-        const offset = attempt * GENERATE_RESULT_ENTRY_LENGTH;
-        const resultByte = result[offset];
-        if (resultByte === ResultValues.Error) {
-            return Result.error(null, () => `Ring VRF proof generation failed for attempt ${attempt}`);
+    return {
+        inputsData: BytesBlob.blobFromParts(vrfInputParts).raw,
+        vrfInputDataLen: JAM_TICKET_SEAL.length + entropy.length + 1,
+    };
+}
+/**
+ * Parse the raw output of `batchGenerateRingVrfForValidators` into per-validator
+ * ticket lists. Records are ordered validator-major, then attempt-major; each
+ * record is `status byte || signature`. A malformed batch yields a single error
+ * byte. Exposed so the worker-pool path can parse a worker's raw result.
+ */
+export function parseTicketsBatchOutput(result, numValidators, ticketsPerValidator) {
+    const perValidator = [];
+    let offset = 0;
+    for (let v = 0; v < numValidators; v++) {
+        const tickets = [];
+        for (let attempt = 0; attempt < ticketsPerValidator; attempt++) {
+            if (result[offset] === ResultValues.Error) {
+                return Result.error(null, () => `Ring VRF proof generation failed for validator ${v}, attempt ${attempt}`);
+            }
+            const signature = Bytes.fromBlob(result.subarray(offset + 1, offset + GENERATE_RESULT_ENTRY_LENGTH), BANDERSNATCH_PROOF_BYTES).asOpaque();
+            tickets.push(SignedTicket.create({ attempt: tryAsTicketAttempt(attempt), signature }));
+            offset += GENERATE_RESULT_ENTRY_LENGTH;
         }
-        const signature = Bytes.fromBlob(new Uint8Array(result.subarray(offset + 1, offset + GENERATE_RESULT_ENTRY_LENGTH)), BANDERSNATCH_PROOF_BYTES).asOpaque();
-        tickets.push(SignedTicket.create({
-            attempt: tryAsTicketAttempt(attempt),
-            signature,
-        }));
+        perValidator.push(tickets);
     }
-    return Result.ok(tickets);
+    return Result.ok(perValidator);
 }

package/packages/jam/safrole/bandersnatch-vrf.test.js

@@ -71,8 +71,8 @@ describe("Bandersnatch verification", () => {
                 "0x3a5d10abc80dda33fe3f40b3bb2e3eefd3e97dda3d617a860c9d94eb70b832ad",
             ].map((x) => Bytes.parseBytes(x, HASH_SIZE));
             const result = await bandersnatchVrf.verifyTickets(await bandersnatchWasm, bandersnatchKeys.length, commitment, tickets, entropy);
-            assert.strictEqual(result.every((x) => x.isValid), true);
-            assert.deepStrictEqual(result.map((x) => x.entropyHash.toString()), expectedIds.map((x) => x.toString()));
+            assert.strictEqual(result.isValid, true);
+            assert.deepStrictEqual(result.tickets.map((x) => x.toString()), expectedIds.map((x) => x.toString()));
         });
         it("should detect that one signature is incorrect", async () => {
             const tickets = [
@@ -90,14 +90,16 @@ describe("Bandersnatch verification", () => {
                 },
             ];
             const entropy = Bytes.parseBytes("0xbb30a42c1e62f0afda5f0a4e8a562f7a13a24cea00ee81917b86b89e801314aa", HASH_SIZE).asOpaque();
+            // Batch verification fails as a whole when any signature is invalid,
+            // and in that case all returned entropy hashes are zeroed out.
             const expectedIds = [
                 "0x0000000000000000000000000000000000000000000000000000000000000000",
-                "0x13fecb426e0a73b84b58b9a0832b11582dc971e79c5399e69f0baf1a244c7787",
-                "0x3a5d10abc80dda33fe3f40b3bb2e3eefd3e97dda3d617a860c9d94eb70b832ad",
+                "0x0000000000000000000000000000000000000000000000000000000000000000",
+                "0x0000000000000000000000000000000000000000000000000000000000000000",
             ].map((x) => Bytes.parseBytes(x, HASH_SIZE));
             const result = await bandersnatchVrf.verifyTickets(await bandersnatchWasm, bandersnatchKeys.length, commitment, tickets, entropy);
-            assert.deepStrictEqual(result.map((x) => x.isValid), [false, true, true]);
-            assert.deepStrictEqual(result.map((x) => x.entropyHash.toString()), expectedIds.map((x) => x.toString()));
+            assert.strictEqual(result.isValid, false);
+            assert.deepStrictEqual(result.tickets.map((x) => x.toString()), expectedIds.map((x) => x.toString()));
         });
     });
     describe("verifySeal", () => {
@@ -163,12 +165,13 @@ describe("Bandersnatch verification", () => {
             const ringKeys = secrets.map((secret) => deriveBandersnatchPublicKey(secret));
             const proverIndex = 0;
             const entropy = Bytes.fill(HASH_SIZE, 123).asOpaque();
-            const genResult = await bandersnatchVrf.generateTickets(await bandersnatchWasm, ringKeys, proverIndex, secrets[proverIndex], entropy, 2);
+            const genResult = await bandersnatchVrf.generateTickets(await bandersnatchWasm, ringKeys, [proverIndex], [secrets[proverIndex]], entropy, 2);
             assert.ok(genResult.isOk);
             const commitment = await bandersnatchVrf.getRingCommitment(await bandersnatchWasm, ringKeys);
             assert.ok(commitment.isOk);
-            const verifyResult = await bandersnatchVrf.verifyTickets(await bandersnatchWasm, ringKeys.length, commitment.ok, genResult.ok, entropy);
-            assert.ok(verifyResult.every((r) => r.isValid), "Generated tickets should pass verification");
+            assert.strictEqual(genResult.ok.length, 1);
+            const verifyResult = await bandersnatchVrf.verifyTickets(await bandersnatchWasm, ringKeys.length, commitment.ok, genResult.ok[0], entropy);
+            assert.ok(verifyResult.isValid, "Generated tickets should pass verification");
         });
     });
 });

package/packages/jam/safrole/bandersnatch-wasm.d.ts

@@ -8,5 +8,15 @@ export declare class BandernsatchWasm {
     generateSeal(authorKey: Uint8Array, input: Uint8Array, auxData: Uint8Array): Promise<Uint8Array<ArrayBufferLike>>;
     getVrfOutputHash(authorKey: Uint8Array, input: Uint8Array): Promise<Uint8Array<ArrayBufferLike>>;
     batchGenerateRingVrf(ringKeys: Uint8Array, proverKeyIndex: number, secretSeed: Uint8Array, inputsData: Uint8Array, vrfInputDataLen: number): Promise<Uint8Array<ArrayBufferLike>>;
+    /**
+     * Batch-generate ring VRF tickets for multiple validators in a single call,
+     * reusing the ring prover setup across all of them.
+     *
+     * `secretSeedsData` is the fixed-width concatenation of the validators' secret
+     * seeds (each `secretSeedDataLen` bytes); `proverKeyIndices` are their indices
+     * within the ring and must have the same count. Output records are ordered
+     * validator-major then input-major, each `status byte || signature`.
+     */
+    batchGenerateRingVrfForValidators(ringKeys: Uint8Array, proverKeyIndices: Uint32Array, secretSeedsData: Uint8Array, secretSeedDataLen: number, inputsData: Uint8Array, vrfInputDataLen: number): Promise<Uint8Array<ArrayBufferLike>>;
 }
 //# sourceMappingURL=bandersnatch-wasm.d.ts.map

package/packages/jam/safrole/bandersnatch-wasm.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bandersnatch-wasm.d.ts","sourceRoot":"","sources":["../../../../../packages/jam/safrole/bandersnatch-wasm.ts"],"names":[],"mappings":"AAEA,qBAAa,gBAAgB;IAC3B,OAAO;WAEM,GAAG;IAKV,UAAU,CAAC,SAAS,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,UAAU;IAIjG,iBAAiB,CACrB,SAAS,EAAE,UAAU,EACrB,UAAU,EAAE,UAAU,EACtB,iBAAiB,EAAE,UAAU,EAC7B,cAAc,EAAE,UAAU,EAC1B,WAAW,EAAE,UAAU,EACvB,oBAAoB,EAAE,UAAU;IAY5B,iBAAiB,CAAC,IAAI,EAAE,UAAU;IAIlC,iBAAiB,CAAC,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM;IAI1G,YAAY,CAAC,SAAS,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,OAAO,EAAE,UAAU;IAI1E,gBAAgB,CAAC,SAAS,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU;IAIzD,oBAAoB,CACxB,QAAQ,EAAE,UAAU,EACpB,cAAc,EAAE,MAAM,EACtB,UAAU,EAAE,UAAU,EACtB,UAAU,EAAE,UAAU,EACtB,eAAe,EAAE,MAAM;CAI1B"}
+{"version":3,"file":"bandersnatch-wasm.d.ts","sourceRoot":"","sources":["../../../../../packages/jam/safrole/bandersnatch-wasm.ts"],"names":[],"mappings":"AAEA,qBAAa,gBAAgB;IAC3B,OAAO;WAEM,GAAG;IAKV,UAAU,CAAC,SAAS,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,UAAU;IAIjG,iBAAiB,CACrB,SAAS,EAAE,UAAU,EACrB,UAAU,EAAE,UAAU,EACtB,iBAAiB,EAAE,UAAU,EAC7B,cAAc,EAAE,UAAU,EAC1B,WAAW,EAAE,UAAU,EACvB,oBAAoB,EAAE,UAAU;IAY5B,iBAAiB,CAAC,IAAI,EAAE,UAAU;IAIlC,iBAAiB,CAAC,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM;IAI1G,YAAY,CAAC,SAAS,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,OAAO,EAAE,UAAU;IAI1E,gBAAgB,CAAC,SAAS,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU;IAIzD,oBAAoB,CACxB,QAAQ,EAAE,UAAU,EACpB,cAAc,EAAE,MAAM,EACtB,UAAU,EAAE,UAAU,EACtB,UAAU,EAAE,UAAU,EACtB,eAAe,EAAE,MAAM;IAKzB;;;;;;;;OAQG;IACG,iCAAiC,CACrC,QAAQ,EAAE,UAAU,EACpB,gBAAgB,EAAE,WAAW,EAC7B,eAAe,EAAE,UAAU,EAC3B,iBAAiB,EAAE,MAAM,EACzB,UAAU,EAAE,UAAU,EACtB,eAAe,EAAE,MAAM;CAW1B"}

package/packages/jam/safrole/bandersnatch-wasm.js

@@ -26,4 +26,16 @@ export class BandernsatchWasm {
     async batchGenerateRingVrf(ringKeys, proverKeyIndex, secretSeed, inputsData, vrfInputDataLen) {
         return bandersnatchWasm.batchGenerateRingVrf(ringKeys, proverKeyIndex, secretSeed, inputsData, vrfInputDataLen);
     }
+    /**
+     * Batch-generate ring VRF tickets for multiple validators in a single call,
+     * reusing the ring prover setup across all of them.
+     *
+     * `secretSeedsData` is the fixed-width concatenation of the validators' secret
+     * seeds (each `secretSeedDataLen` bytes); `proverKeyIndices` are their indices
+     * within the ring and must have the same count. Output records are ordered
+     * validator-major then input-major, each `status byte || signature`.
+     */
+    async batchGenerateRingVrfForValidators(ringKeys, proverKeyIndices, secretSeedsData, secretSeedDataLen, inputsData, vrfInputDataLen) {
+        return bandersnatchWasm.batchGenerateRingVrfForValidators(ringKeys, proverKeyIndices, secretSeedsData, secretSeedDataLen, inputsData, vrfInputDataLen);
+    }
 }

package/packages/jam/safrole/safrole.js

@@ -260,15 +260,15 @@ export class Safrole {
          */
         // TODO [ToDr] Verify that ticket attempt is in correct range.
         const verificationResult = extrinsic.length === 0
-            ? []
+            ? { isValid: true, tickets: [] }
             : await bandersnatchVrf.verifyTickets(await this.bandersnatch, validators.length, epochRoot, extrinsic, entropy);
+        if (!verificationResult.isValid) {
+            return Result.error(SafroleErrorCode.BadTicketProof, () => "Safrole: invalid ticket proof in extrinsic");
+        }
         const tickets = extrinsic.map((ticket, i) => ({
-            id: verificationResult[i].entropyHash,
+            id: verificationResult.tickets[i],
             attempt: ticket.attempt,
         }));
-        if (!verificationResult.every((x) => x.isValid)) {
-            return Result.error(SafroleErrorCode.BadTicketProof, () => "Safrole: invalid ticket proof in extrinsic");
-        }
         /**
          * Verify if tickets are sorted and unique
          *

package/packages/jam/safrole/safrole.test.js

@@ -67,10 +67,10 @@ const fakeSealingKeys = {
 describe("Safrole", () => {
     let blake2b;
     beforeEach(async () => {
-        mock.method(bandersnatchVrf, "verifyTickets", () => Promise.resolve([
-            { isValid: true, entropyHash: Bytes.zero(HASH_SIZE) },
-            { isValid: true, entropyHash: Bytes.fill(HASH_SIZE, 1) },
-        ]));
+        mock.method(bandersnatchVrf, "verifyTickets", () => Promise.resolve({
+            isValid: true,
+            tickets: [Bytes.zero(HASH_SIZE), Bytes.fill(HASH_SIZE, 1)],
+        }));
         blake2b = await Blake2b.createHasher();
     });
     afterEach(() => {
@@ -146,7 +146,7 @@ describe("Safrole", () => {
         }
     });
     it("should return bad ticket proof error", async () => {
-        mock.method(bandersnatchVrf, "verifyTickets", () => Promise.resolve([{ isValid: false, entropyHash: Bytes.zero(HASH_SIZE) }]));
+        mock.method(bandersnatchVrf, "verifyTickets", () => Promise.resolve({ isValid: false, tickets: [Bytes.zero(HASH_SIZE)] }));
         const punishSet = SortedSet.fromArray(hashComparator);
         const state = {
             timeslot: tryAsTimeSlot(1),
@@ -188,10 +188,10 @@ describe("Safrole", () => {
         }
     });
     it("should return duplicated ticket error", async () => {
-        mock.method(bandersnatchVrf, "verifyTickets", () => Promise.resolve([
-            { isValid: true, entropyHash: Bytes.zero(HASH_SIZE) },
-            { isValid: true, entropyHash: Bytes.zero(HASH_SIZE) },
-        ]));
+        mock.method(bandersnatchVrf, "verifyTickets", () => Promise.resolve({
+            isValid: true,
+            tickets: [Bytes.zero(HASH_SIZE), Bytes.zero(HASH_SIZE)],
+        }));
         const punishSet = SortedSet.fromArray(hashComparator);
         const state = {
             timeslot: tryAsTimeSlot(1),
@@ -237,10 +237,10 @@ describe("Safrole", () => {
         }
     });
     it("should return bad ticket order error", async () => {
-        mock.method(bandersnatchVrf, "verifyTickets", () => Promise.resolve([
-            { isValid: true, entropyHash: Bytes.fill(HASH_SIZE, 1) },
-            { isValid: true, entropyHash: Bytes.zero(HASH_SIZE) },
-        ]));
+        mock.method(bandersnatchVrf, "verifyTickets", () => Promise.resolve({
+            isValid: true,
+            tickets: [Bytes.fill(HASH_SIZE, 1), Bytes.zero(HASH_SIZE)],
+        }));
         const punishSet = SortedSet.fromArray(hashComparator);
         const state = {
             timeslot: tryAsTimeSlot(1),

package/packages/jam/ticket-pool/index.d.ts

@@ -0,0 +1,4 @@
+export * from "./pending-ticket-pool.js";
+export * from "./ticket-validator.js";
+export * from "./verified-ticket-pool.js";
+//# sourceMappingURL=index.d.ts.map

package/packages/jam/ticket-pool/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../packages/jam/ticket-pool/index.ts"],"names":[],"mappings":"AAAA,cAAc,0BAA0B,CAAC;AACzC,cAAc,uBAAuB,CAAC;AACtC,cAAc,2BAA2B,CAAC"}

package/packages/jam/ticket-pool/index.js

@@ -0,0 +1,3 @@
+export * from "./pending-ticket-pool.js";
+export * from "./ticket-validator.js";
+export * from "./verified-ticket-pool.js";

package/packages/jam/ticket-pool/pending-ticket-pool.d.ts

@@ -0,0 +1,30 @@
+import type { Epoch } from "#@typeberry/block";
+import type { SignedTicket } from "#@typeberry/block/tickets.js";
+/**
+ * An ordered, signature-deduplicated pool of tickets waiting to be redistributed to peers.
+ *
+ * Used on the networking side. Indices are stable within an epoch so callers can track
+ * per-peer "sent" sets by index. The pool is cleared whenever a new epoch is observed,
+ * and tickets for older epochs are dropped (can happen when an async validation completes
+ * after the epoch already advanced).
+ */
+export declare class PendingTicketPool {
+    private tickets;
+    private currentEpochValue;
+    /** Epoch the pool is currently holding tickets for, or `null` if empty. */
+    get currentEpoch(): Epoch | null;
+    /** Returns the ordered tickets currently in the pool. Caller must not mutate the array. */
+    getTickets(): readonly {
+        epochIndex: Epoch;
+        ticket: SignedTicket;
+    }[];
+    /** Returns true if the ticket was added, false if it was a duplicate or dropped (old epoch). */
+    addTicket(epochIndex: Epoch, ticket: SignedTicket): boolean;
+    /**
+     * Replace the pool contents for the given epoch with the supplied tickets. Used when the
+     * authorship worker pushes an authoritative pool dump on an epoch boundary; any tickets
+     * that aren't in the dump are dropped, and dedup runs over the new set.
+     */
+    replace(epochIndex: Epoch, tickets: readonly SignedTicket[]): void;
+}
+//# sourceMappingURL=pending-ticket-pool.d.ts.map

package/packages/jam/ticket-pool/pending-ticket-pool.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pending-ticket-pool.d.ts","sourceRoot":"","sources":["../../../../../packages/jam/ticket-pool/pending-ticket-pool.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAC9C,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAKhE;;;;;;;GAOG;AACH,qBAAa,iBAAiB;IAC5B,OAAO,CAAC,OAAO,CAA0D;IACzE,OAAO,CAAC,iBAAiB,CAAsB;IAE/C,2EAA2E;IAC3E,IAAI,YAAY,IAAI,KAAK,GAAG,IAAI,CAE/B;IAED,2FAA2F;IAC3F,UAAU,IAAI,SAAS;QAAE,UAAU,EAAE,KAAK,CAAC;QAAC,MAAM,EAAE,YAAY,CAAA;KAAE,EAAE;IAIpE,gGAAgG;IAChG,SAAS,CAAC,UAAU,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,GAAG,OAAO;IAyB3D;;;;OAIG;IACH,OAAO,CAAC,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,YAAY,EAAE,GAAG,IAAI;CAWnE"}

package/packages/jam/ticket-pool/pending-ticket-pool.js

@@ -0,0 +1,56 @@
+import { Logger } from "#@typeberry/logger";
+const logger = Logger.new(import.meta.filename, "pending-pool");
+/**
+ * An ordered, signature-deduplicated pool of tickets waiting to be redistributed to peers.
+ *
+ * Used on the networking side. Indices are stable within an epoch so callers can track
+ * per-peer "sent" sets by index. The pool is cleared whenever a new epoch is observed,
+ * and tickets for older epochs are dropped (can happen when an async validation completes
+ * after the epoch already advanced).
+ */
+export class PendingTicketPool {
+    tickets = [];
+    currentEpochValue = null;
+    /** Epoch the pool is currently holding tickets for, or `null` if empty. */
+    get currentEpoch() {
+        return this.currentEpochValue;
+    }
+    /** Returns the ordered tickets currently in the pool. Caller must not mutate the array. */
+    getTickets() {
+        return this.tickets;
+    }
+    /** Returns true if the ticket was added, false if it was a duplicate or dropped (old epoch). */
+    addTicket(epochIndex, ticket) {
+        if (this.currentEpochValue !== null && epochIndex < this.currentEpochValue) {
+            return false;
+        }
+        if (this.currentEpochValue !== null && epochIndex > this.currentEpochValue) {
+            logger.log `Epoch changed from ${this.currentEpochValue} to ${epochIndex}, clearing ${this.tickets.length} old tickets`;
+            this.tickets = [];
+        }
+        this.currentEpochValue = epochIndex;
+        const isDuplicate = this.tickets.some((pending) => pending.epochIndex === epochIndex && pending.ticket.signature.isEqualTo(ticket.signature));
+        if (isDuplicate) {
+            return false;
+        }
+        this.tickets.push({ epochIndex, ticket });
+        logger.info `[addTicket] Added ticket for epoch ${epochIndex}, total: ${this.tickets.length}`;
+        return true;
+    }
+    /**
+     * Replace the pool contents for the given epoch with the supplied tickets. Used when the
+     * authorship worker pushes an authoritative pool dump on an epoch boundary; any tickets
+     * that aren't in the dump are dropped, and dedup runs over the new set.
+     */
+    replace(epochIndex, tickets) {
+        this.tickets = [];
+        this.currentEpochValue = epochIndex;
+        for (const ticket of tickets) {
+            const isDuplicate = this.tickets.some((pending) => pending.ticket.signature.isEqualTo(ticket.signature));
+            if (!isDuplicate) {
+                this.tickets.push({ epochIndex, ticket });
+            }
+        }
+        logger.log `Pool replaced for epoch ${epochIndex} with ${this.tickets.length} tickets`;
+    }
+}

package/packages/jam/ticket-pool/pending-ticket-pool.test.d.ts

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

package/packages/jam/ticket-pool/pending-ticket-pool.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pending-ticket-pool.test.d.ts","sourceRoot":"","sources":["../../../../../packages/jam/ticket-pool/pending-ticket-pool.test.ts"],"names":[],"mappings":""}

package/packages/jam/ticket-pool/pending-ticket-pool.test.js

@@ -0,0 +1,67 @@
+import assert from "node:assert";
+import { describe, it } from "node:test";
+import { tryAsEpoch } from "#@typeberry/block";
+import { SignedTicket, tryAsTicketAttempt } from "#@typeberry/block/tickets.js";
+import { Bytes } from "#@typeberry/bytes";
+import { BANDERSNATCH_PROOF_BYTES } from "#@typeberry/crypto";
+import { PendingTicketPool } from "./pending-ticket-pool.js";
+const E1 = tryAsEpoch(1);
+const E2 = tryAsEpoch(2);
+function makeTicket(seed, attempt = 0) {
+    const sig = Bytes.zero(BANDERSNATCH_PROOF_BYTES);
+    sig.raw[0] = seed;
+    return SignedTicket.create({
+        attempt: tryAsTicketAttempt(attempt),
+        signature: sig.asOpaque(),
+    });
+}
+describe("PendingTicketPool", () => {
+    it("starts empty with no current epoch", () => {
+        const pool = new PendingTicketPool();
+        assert.strictEqual(pool.currentEpoch, null);
+        assert.deepStrictEqual(pool.getTickets(), []);
+    });
+    it("adds a ticket and tracks the epoch", () => {
+        const pool = new PendingTicketPool();
+        const t = makeTicket(1);
+        assert.strictEqual(pool.addTicket(E1, t), true);
+        assert.strictEqual(pool.currentEpoch, E1);
+        assert.strictEqual(pool.getTickets().length, 1);
+    });
+    it("dedups by signature within an epoch", () => {
+        const pool = new PendingTicketPool();
+        const t = makeTicket(1);
+        pool.addTicket(E1, t);
+        assert.strictEqual(pool.addTicket(E1, t), false);
+        assert.strictEqual(pool.getTickets().length, 1);
+    });
+    it("clears tickets when a newer epoch arrives", () => {
+        const pool = new PendingTicketPool();
+        pool.addTicket(E1, makeTicket(1));
+        pool.addTicket(E1, makeTicket(2));
+        pool.addTicket(E2, makeTicket(3));
+        const tickets = pool.getTickets();
+        assert.strictEqual(tickets.length, 1);
+        assert.strictEqual(tickets[0].epochIndex, E2);
+        assert.strictEqual(pool.currentEpoch, E2);
+    });
+    it("drops late tickets for older epochs", () => {
+        const pool = new PendingTicketPool();
+        pool.addTicket(E2, makeTicket(1));
+        assert.strictEqual(pool.addTicket(E1, makeTicket(2)), false);
+        assert.strictEqual(pool.getTickets().length, 1);
+        assert.strictEqual(pool.currentEpoch, E2);
+    });
+    it("replace clears existing tickets and dedups the new set", () => {
+        const pool = new PendingTicketPool();
+        pool.addTicket(E1, makeTicket(1));
+        pool.addTicket(E1, makeTicket(2));
+        const dump = [makeTicket(3), makeTicket(4), makeTicket(3)];
+        pool.replace(E2, dump);
+        const tickets = pool.getTickets();
+        assert.strictEqual(tickets.length, 2);
+        assert.strictEqual(pool.currentEpoch, E2);
+        assert.strictEqual(tickets[0].ticket.signature.raw[0], 3);
+        assert.strictEqual(tickets[1].ticket.signature.raw[0], 4);
+    });
+});

package/packages/jam/ticket-pool/ticket-validator.d.ts

@@ -0,0 +1,47 @@
+import type { EntropyHash, Epoch } from "#@typeberry/block";
+import type { SignedTicket } from "#@typeberry/block/tickets.js";
+import { Result } from "#@typeberry/utils";
+/**
+ * Outcome of a successful validation.
+ *
+ * `id` is the entropy hash the validator computed for this ticket. It is `null` when the
+ * concrete validator doesn't actually verify (e.g. {@link AcceptTicketsValidator}) or when
+ * it delegates to another process that doesn't bother to send the id back over the wire.
+ */
+export type ValidatedTicket = {
+    ticket: SignedTicket;
+    id: EntropyHash;
+};
+/** Reasons a ticket may fail validation. */
+export declare enum ValidationError {
+    /** Verifier rejected the signature / proof. */
+    InvalidProof = "invalid_proof",
+    /** Validator could not run (e.g. state unavailable, transient internal failure). */
+    ValidatorUnavailable = "validator_unavailable",
+    /** Ticket is for an epoch outside the validator's window of interest. */
+    WrongEpoch = "wrong_epoch"
+}
+/**
+ * Strategy for verifying tickets arriving from peers.
+ *
+ * The concrete implementation may call into the bandersnatch verifier, defer to another
+ * worker via IPC, or short-circuit (Accept/Deny defaults for tests).
+ */
+export interface TicketValidator {
+    validate(epochIndex: Epoch, tickets: SignedTicket[]): Promise<Result<ValidatedTicket[], ValidationError>>;
+}
+/**
+ * Accepts every ticket without inspection. Useful for unit tests where the validator
+ * isn't the subject under test. Must never be used in production.
+ */
+export declare class AcceptTicketsValidator implements TicketValidator {
+    validate(_epochIndex: Epoch, ticket: SignedTicket[]): Promise<Result<ValidatedTicket[], ValidationError>>;
+}
+/**
+ * Rejects every ticket. Used as the default for any task that needs an explicit, real
+ * validator wired in before it will accept anything from the network.
+ */
+export declare class DenyTicketsValidator implements TicketValidator {
+    validate(_epochIndex: Epoch, _tickets: SignedTicket[]): Promise<Result<ValidatedTicket[], ValidationError>>;
+}
+//# sourceMappingURL=ticket-validator.d.ts.map

package/packages/jam/ticket-pool/ticket-validator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ticket-validator.d.ts","sourceRoot":"","sources":["../../../../../packages/jam/ticket-pool/ticket-validator.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAC3D,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAGhE,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAE1C;;;;;;GAMG;AACH,MAAM,MAAM,eAAe,GAAG;IAC5B,MAAM,EAAE,YAAY,CAAC;IACrB,EAAE,EAAE,WAAW,CAAC;CACjB,CAAC;AAEF,4CAA4C;AAC5C,oBAAY,eAAe;IACzB,+CAA+C;IAC/C,YAAY,kBAAkB;IAC9B,oFAAoF;IACpF,oBAAoB,0BAA0B;IAC9C,yEAAyE;IACzE,UAAU,gBAAgB;CAC3B;AAED;;;;;GAKG;AACH,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,YAAY,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,eAAe,EAAE,EAAE,eAAe,CAAC,CAAC,CAAC;CAC3G;AAED;;;GAGG;AACH,qBAAa,sBAAuB,YAAW,eAAe;IACtD,QAAQ,CAAC,WAAW,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,eAAe,EAAE,EAAE,eAAe,CAAC,CAAC;CAQhH;AAED;;;GAGG;AACH,qBAAa,oBAAqB,YAAW,eAAe;IACpD,QAAQ,CAAC,WAAW,EAAE,KAAK,EAAE,QAAQ,EAAE,YAAY,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,eAAe,EAAE,EAAE,eAAe,CAAC,CAAC;CAGlH"}