@aztec-labs/p2p 6.0.0-nightly.20260829

package/dest/services/encoding.js

@@ -0,0 +1,152 @@
+// Taken from lodestar: https://github.com/ChainSafe/lodestar
+import { createLogger } from '@aztec-labs/foundation/log';
+import { MAX_TX_SIZE_KB, TopicType, getTopicFromString } from '@aztec-labs/stdlib/p2p';
+import { webcrypto } from 'node:crypto';
+import { compressSync, uncompressSync } from 'snappy';
+/**
+ * Fallback maximum response size (in KB) applied when no explicit per-request bound is supplied.
+ * Used both as the `SnappyTransform` default and as the reception-side fallback in `readMessage`.
+ */ export const DEFAULT_MAX_RESPONSE_SIZE_KB = 10 * 1024;
+/** Thrown when a Snappy-compressed response exceeds the allowed decompressed size. */ export class OversizedSnappyResponseError extends Error {
+    constructor(decompressedSize, maxSizeKb){
+        super(`Decompressed size ${decompressedSize} exceeds maximum allowed size of ${maxSizeKb}kb`);
+        this.name = 'OversizedSnappyResponseError';
+    }
+}
+/**
+ * Thrown when the compressed bytes accumulated while reading a response stream exceed the reception
+ * bound, before the full payload is buffered. Distinct from {@link OversizedSnappyResponseError},
+ * which guards the decompressed size after the stream has already been fully received.
+ */ export class ResponseSizeLimitExceededError extends Error {
+    constructor(accumulatedBytes, limitBytes){
+        super(`Accumulated response size ${accumulatedBytes} bytes exceeds reception limit of ${limitBytes} bytes`);
+        this.name = 'ResponseSizeLimitExceededError';
+    }
+}
+// Shared buffer to convert msgId to string
+const sharedMsgIdBuf = Buffer.alloc(20);
+export function msgIdToStrFn(msgId) {
+    // This happens serially, no need to reallocate the buffer
+    sharedMsgIdBuf.set(msgId);
+    return `0x${sharedMsgIdBuf.toString('hex')}`;
+}
+/**
+ * Get the message identifier from a libp2p message
+ *
+ * Follows similarly to:
+ * https://github.com/ethereum/consensus-specs/blob/v1.1.0-alpha.7/specs/altair/p2p-interface.md#topics-and-messages
+ *
+ * The topic length is framed into the hash input (`uint32be(topicLen) || topic || data`) so the
+ * `(topic, data)` boundary is unambiguous. A raw `topic || data` concatenation is not injective —
+ * shifting bytes across the boundary (e.g. `(topic + data[0], data[1:])`) yields the same bytes and
+ * thus the same id, letting an unsubscribed-topic message pre-occupy a real message's seenCache slot
+ * and suppress it as a duplicate.
+ *
+ * @param message - The libp2p message
+ * @returns The message identifier
+ */ export async function getMsgIdFn({ topic, data }) {
+    const topicBytes = Buffer.from(topic);
+    const framedTopicLength = Buffer.allocUnsafe(4);
+    framedTopicLength.writeUInt32BE(topicBytes.length);
+    const buffer = Buffer.concat([
+        framedTopicLength,
+        topicBytes,
+        data
+    ]);
+    const hash = await webcrypto.subtle.digest('SHA-256', buffer);
+    return Buffer.from(hash.slice(0, 20));
+}
+const DefaultMaxSizesKb = {
+    [TopicType.tx]: MAX_TX_SIZE_KB,
+    // An attestation has roughly 30 fields, which is 1kb, so 5x is plenty
+    [TopicType.checkpoint_attestation]: 5,
+    // Proposals may carry some tx objects, so we allow a larger size capped at 10mb
+    // Note this may not be enough for carrying all tx objects in a block
+    [TopicType.block_proposal]: 1024 * 10,
+    // Checkpoint proposals carry almost the same data as a block proposal (see the lastBlockProposal)
+    // Only diff is an additional header, which is pretty small compared to the 10mb limit
+    [TopicType.checkpoint_proposal]: 1024 * 10
+};
+/**
+ * Snappy transform for libp2p gossipsub
+ */ export class SnappyTransform {
+    maxSizesKb;
+    defaultMaxSizeKb;
+    logger;
+    constructor(maxSizesKb = DefaultMaxSizesKb, defaultMaxSizeKb = DEFAULT_MAX_RESPONSE_SIZE_KB, logger = createLogger('p2p:snappy-transform')){
+        this.maxSizesKb = maxSizesKb;
+        this.defaultMaxSizeKb = defaultMaxSizeKb;
+        this.logger = logger;
+    }
+    // Topic string included to satisfy DataTransform interface
+    inboundTransform(topicStr, data) {
+        const topic = getTopicFromString(topicStr);
+        return this.inboundTransformData(Buffer.from(data), topic);
+    }
+    inboundTransformData(data, topic, maxSizeKbOverride) {
+        if (data.length === 0) {
+            return data;
+        }
+        const maxSizeKb = maxSizeKbOverride ?? this.maxSizesKb[topic] ?? this.defaultMaxSizeKb;
+        const { decompressedSize } = readSnappyPreamble(data);
+        if (decompressedSize > maxSizeKb * 1024) {
+            this.logger.warn(`Decompressed size ${decompressedSize} exceeds maximum allowed size of ${maxSizeKb}kb`);
+            throw new OversizedSnappyResponseError(decompressedSize, maxSizeKb);
+        }
+        return Buffer.from(uncompressSync(data, {
+            asBuffer: true
+        }));
+    }
+    // Topic string included to satisfy DataTransform interface
+    outboundTransform(_topicStr, data) {
+        return this.outboundTransformData(Buffer.from(data));
+    }
+    outboundTransformData(data) {
+        if (data.length === 0) {
+            return data;
+        }
+        return Buffer.from(compressSync(data));
+    }
+}
+/**
+ * Reads the Snappy preamble from compressed data and returns the expected decompressed size.
+ *
+ * The Snappy format starts with a little-endian varint encoding the uncompressed length.
+ * Varints consist of a series of bytes where:
+ * - Lower 7 bits contain data
+ * - Upper bit (0x80) is set if more bytes follow
+ *
+ * @param data - The compressed data starting with the Snappy preamble
+ * @returns Object containing the decompressed size and the number of bytes read from the preamble
+ * @throws Error if the data is too short or the varint is invalid
+ */ export function readSnappyPreamble(data) {
+    if (data.length === 0) {
+        throw new Error('Cannot read preamble from empty data');
+    }
+    let result = 0;
+    let shift = 0;
+    let bytesRead = 0;
+    // Maximum varint length for 32-bit value is 5 bytes
+    // (7 bits per byte, so 5 bytes = 35 bits, enough for 2^32 - 1)
+    const maxBytes = 5;
+    for(let i = 0; i < Math.min(data.length, maxBytes); i++){
+        const byte = data[i];
+        bytesRead++;
+        // Extract lower 7 bits and add to result with appropriate shift
+        // Use >>> 0 to convert to unsigned 32-bit integer to avoid sign issues
+        result = (result | (byte & 0x7f) << shift) >>> 0;
+        // If upper bit is not set, we're done
+        if ((byte & 0x80) === 0) {
+            return {
+                decompressedSize: result,
+                bytesRead
+            };
+        }
+        shift += 7;
+    }
+    // If we get here, either we ran out of data or the varint is too long
+    if (bytesRead >= maxBytes) {
+        throw new Error('Varint is too long (max 5 bytes for 32-bit value)');
+    }
+    throw new Error('Incomplete varint: data ended before varint termination');
+}

package/dest/services/gossipsub/index.d.ts

@@ -0,0 +1,3 @@
+export * from './scoring.js';
+export * from './topic_score_params.js';
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uL3NyYy9zZXJ2aWNlcy9nb3NzaXBzdWIvaW5kZXgudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsY0FBYyxjQUFjLENBQUM7QUFDN0IsY0FBYyx5QkFBeUIsQ0FBQyJ9

package/dest/services/gossipsub/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/services/gossipsub/index.ts"],"names":[],"mappings":"AAAA,cAAc,cAAc,CAAC;AAC7B,cAAc,yBAAyB,CAAC"}

package/dest/services/gossipsub/index.js

@@ -0,0 +1,2 @@
+export * from './scoring.js';
+export * from './topic_score_params.js';

package/dest/services/gossipsub/scoring.d.ts

@@ -0,0 +1,25 @@
+import type { PeerScoreThresholds } from '@chainsafe/libp2p-gossipsub/score';
+/**
+ * Weight applied to application-level peer scores before contributing to gossipsub score.
+ *
+ * Note: positive topic scores can partially offset app penalties, so alignment with
+ * app-level thresholds is best-effort rather than strict.
+ */
+export declare const APP_SPECIFIC_WEIGHT = 10;
+/**
+ * Gossipsub peer score thresholds aligned with application-level scoring.
+ *
+ * These thresholds work with appSpecificWeight=10 to align gossipsub behavior
+ * with application-level peer states (Healthy → Disconnect → Banned).
+ *
+ * Alignment:
+ * - gossipThreshold (-500): Matches Disconnect state (app score -50 × weight 10)
+ * - publishThreshold (-1000): Matches Ban state (app score -100 × weight 10)
+ * - graylistThreshold (-2000): For severe attacks (ban + topic penalties)
+ *
+ * The 1:2:4 ratio follows Lodestar's approach and gossipsub spec recommendations.
+ *
+ * @see https://github.com/libp2p/specs/blob/master/pubsub/gossipsub/gossipsub-v1.1.md#peer-scoring
+ */
+export declare const gossipScoreThresholds: PeerScoreThresholds;
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoic2NvcmluZy5kLnRzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vLi4vc3JjL3NlcnZpY2VzL2dvc3NpcHN1Yi9zY29yaW5nLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiJBQUFBLE9BQU8sS0FBSyxFQUFFLG1CQUFtQixFQUFFLE1BQU0sbUNBQW1DLENBQUM7QUFFN0U7Ozs7O0dBS0c7QUFDSCxlQUFPLE1BQU0sbUJBQW1CLEtBQUssQ0FBQztBQUV0Qzs7Ozs7Ozs7Ozs7Ozs7R0FjRztBQUNILGVBQU8sTUFBTSxxQkFBcUIsRUFBRSxtQkFXbkMsQ0FBQyJ9

package/dest/services/gossipsub/scoring.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scoring.d.ts","sourceRoot":"","sources":["../../../src/services/gossipsub/scoring.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,mCAAmC,CAAC;AAE7E;;;;;GAKG;AACH,eAAO,MAAM,mBAAmB,KAAK,CAAC;AAEtC;;;;;;;;;;;;;;GAcG;AACH,eAAO,MAAM,qBAAqB,EAAE,mBAWnC,CAAC"}

package/dest/services/gossipsub/scoring.js

@@ -0,0 +1,27 @@
+/**
+ * Weight applied to application-level peer scores before contributing to gossipsub score.
+ *
+ * Note: positive topic scores can partially offset app penalties, so alignment with
+ * app-level thresholds is best-effort rather than strict.
+ */ export const APP_SPECIFIC_WEIGHT = 10;
+/**
+ * Gossipsub peer score thresholds aligned with application-level scoring.
+ *
+ * These thresholds work with appSpecificWeight=10 to align gossipsub behavior
+ * with application-level peer states (Healthy → Disconnect → Banned).
+ *
+ * Alignment:
+ * - gossipThreshold (-500): Matches Disconnect state (app score -50 × weight 10)
+ * - publishThreshold (-1000): Matches Ban state (app score -100 × weight 10)
+ * - graylistThreshold (-2000): For severe attacks (ban + topic penalties)
+ *
+ * The 1:2:4 ratio follows Lodestar's approach and gossipsub spec recommendations.
+ *
+ * @see https://github.com/libp2p/specs/blob/master/pubsub/gossipsub/gossipsub-v1.1.md#peer-scoring
+ */ export const gossipScoreThresholds = {
+    /** Below this, peer is not gossiped to (matches Disconnect state) */ gossipThreshold: -500,
+    /** Below this, self-published messages are not propagated to peer (matches Ban state) */ publishThreshold: -1000,
+    /** Below this, all RPCs from peer are ignored (severe attack scenario) */ graylistThreshold: -2000,
+    /** Above this, peer can offer peer exchange (PX) */ acceptPXThreshold: 100,
+    /** Above this, peer can be grafted to mesh opportunistically */ opportunisticGraftThreshold: 5
+};

package/dest/services/gossipsub/topic_score_params.d.ts

@@ -0,0 +1,167 @@
+import { TopicType } from '@aztec-labs/stdlib/p2p';
+import { createTopicScoreParams } from '@chainsafe/libp2p-gossipsub/score';
+/**
+ * Network parameters needed to compute topic-specific gossipsub scoring parameters.
+ */
+export type TopicScoringNetworkParams = {
+    /** L2 slot duration in milliseconds */
+    slotDurationMs: number;
+    /** Gossipsub heartbeat interval in milliseconds */
+    heartbeatIntervalMs: number;
+    /** Target committee size (number of validators expected to attest per slot) */
+    targetCommitteeSize: number;
+    /**
+     * Max blocks per checkpoint, the network-wide config value. Used to derive expected per-slot message rates
+     * for scoring; it is a peer-rate threshold input, not a consensus deadline.
+     */
+    maxBlocksPerCheckpoint: number;
+    /** Expected number of block proposals per slot for scoring override. 0 disables scoring, undefined falls back to blocksPerSlot - 1. */
+    expectedBlockProposalsPerSlot?: number;
+};
+/**
+ * Determines the decay window in slots based on expected message frequency.
+ * Low-frequency topics need longer decay windows to accumulate meaningful counter values.
+ *
+ * @param expectedMessagesPerSlot - Expected messages per slot for this topic
+ * @returns Number of slots over which the counter should decay to ~1%
+ */
+export declare function getDecayWindowSlots(expectedMessagesPerSlot: number): number;
+/**
+ * Computes the decay factor for exponential decay over a given window.
+ * After `heartbeatsInWindow` heartbeats, the counter decays to ~1% of its original value.
+ *
+ * @param heartbeatIntervalMs - Gossipsub heartbeat interval in milliseconds
+ * @param slotDurationMs - L2 slot duration in milliseconds
+ * @param decayWindowSlots - Number of slots over which to decay
+ * @returns Decay factor (0 < decay < 1), applied each heartbeat
+ */
+export declare function computeDecay(heartbeatIntervalMs: number, slotDurationMs: number, decayWindowSlots: number): number;
+/**
+ * Computes the steady-state convergence value for a decaying counter.
+ * If messages arrive at a constant rate and decay is applied each heartbeat,
+ * the counter converges to: rate / (1 - decay)
+ *
+ * @param messagesPerHeartbeat - Expected messages per heartbeat
+ * @param decay - Decay factor applied each heartbeat
+ * @returns Convergence value (steady-state counter value)
+ */
+export declare function computeConvergence(messagesPerHeartbeat: number, decay: number): number;
+/**
+ * Computes a conservative threshold for mesh message deliveries.
+ * The threshold should be low enough to avoid penalizing honest peers with normal variance.
+ *
+ * @param convergence - Steady-state counter value
+ * @param conservativeFactor - Fraction of convergence to use as threshold (e.g., 0.3)
+ * @returns Threshold value
+ */
+export declare function computeThreshold(convergence: number, conservativeFactor: number): number;
+/**
+ * Determines the effective expected block proposals per slot for scoring.
+ * Returns undefined if scoring should be disabled, or a positive number if enabled.
+ *
+ * @param blocksPerSlot - Number of blocks per slot from timetable
+ * @param expectedBlockProposalsPerSlot - Config override. 0 disables scoring, undefined falls back to blocksPerSlot - 1.
+ * @returns Positive number of expected block proposals, or undefined if scoring is disabled
+ */
+export declare function getEffectiveBlockProposalsPerSlot(blocksPerSlot: number, expectedBlockProposalsPerSlot?: number): number | undefined;
+/**
+ * Gets the expected messages per slot for a given topic type.
+ *
+ * @param topicType - The topic type
+ * @param targetCommitteeSize - Target committee size
+ * @param blocksPerSlot - Number of blocks per slot
+ * @param expectedBlockProposalsPerSlot - Override for block proposals. 0 disables scoring, undefined falls back to blocksPerSlot - 1.
+ * @returns Expected messages per slot, or undefined if unpredictable
+ */
+export declare function getExpectedMessagesPerSlot(topicType: TopicType, targetCommitteeSize: number, blocksPerSlot: number, expectedBlockProposalsPerSlot?: number): number | undefined;
+/** Maximum P1 score contribution per topic */
+export declare const MAX_P1_SCORE = 8;
+/** Maximum P2 score contribution per topic */
+export declare const MAX_P2_SCORE = 25;
+/** Maximum P3 penalty per topic (must exceed P1 + P2 to cause pruning) */
+export declare const MAX_P3_PENALTY_PER_TOPIC: number;
+/**
+ * Factory class for creating gossipsub topic scoring parameters.
+ * Computes shared values once and reuses them across all topics.
+ */
+export declare class TopicScoreParamsFactory {
+    private readonly params;
+    /** Number of blocks per slot based on timetable configuration */
+    readonly blocksPerSlot: number;
+    /** Decay factor for invalid message penalties (P4) */
+    readonly invalidDecay: number;
+    /** Number of heartbeats per slot */
+    readonly heartbeatsPerSlot: number;
+    /** P1: Time in mesh quantum (slot duration in ms - score increases by ~1 per slot) */
+    readonly timeInMeshQuantum: number;
+    /** P1: Time in mesh cap (number of slots to reach max score) */
+    readonly timeInMeshCap: number;
+    /** P1: Time in mesh weight (normalized so max P1 = MAX_P1_SCORE) */
+    readonly timeInMeshWeight: number;
+    /** P2: First message deliveries decay factor */
+    readonly firstMessageDeliveriesDecay: number;
+    /** P2: First message deliveries cap (convergence-based) */
+    readonly firstMessageDeliveriesCap: number;
+    /** P2: First message deliveries weight (normalized so max P2 = MAX_P2_SCORE) */
+    readonly firstMessageDeliveriesWeight: number;
+    /** Base parameters common to all topics */
+    private readonly baseParams;
+    constructor(params: TopicScoringNetworkParams);
+    /**
+     * Creates scoring parameters for topics with unpredictable or zero message rates.
+     * Disables P1, P2, P3, and P3b to avoid unbalanced positive score accumulation.
+     *
+     * Rationale: If P1/P2 were enabled without P3, the topic would contribute free
+     * positive scores that could offset penalties from other topics, preventing
+     * proper mesh pruning of non-contributing peers.
+     */
+    private createDisabledP3Params;
+    /**
+     * Creates scoring parameters for topics with predictable message rates.
+     * Enables P1, P2, P3, and P3b for balanced scoring.
+     *
+     * The scoring is designed so that:
+     * - P1 + P2 max = 8 + 25 = 33 (positive rewards for good behavior)
+     * - P3 max = -34 (penalty exceeds P1+P2 to ensure pruning of non-contributors)
+     * - After pruning: P1 resets, P2 decays, P3b persists with slow decay
+     *
+     * @param expectedPerSlot - Expected messages per slot
+     */
+    private createEnabledP3Params;
+    /** Number of topics with P3 enabled, computed from config. Always 2 (checkpoint_proposal + checkpoint_attestation) plus optionally block_proposal. */
+    get numP3EnabledTopics(): number;
+    /** Total maximum P3b penalty across all topics after pruning, computed from config */
+    get totalMaxP3bPenalty(): number;
+    /**
+     * Creates topic score parameters for a specific topic type.
+     *
+     * @param topicType - The topic type
+     * @returns TopicScoreParams for the topic
+     */
+    createForTopic(topicType: TopicType): ReturnType<typeof createTopicScoreParams>;
+    /**
+     * Creates all topic score parameters for gossipsub configuration.
+     *
+     * @param protocolVersion - Protocol version string for topic naming
+     * @returns Record mapping topic strings to their score parameters
+     */
+    createAll(protocolVersion: string): Record<string, ReturnType<typeof createTopicScoreParams>>;
+}
+/**
+ * Creates topic score parameters for a specific topic type.
+ * Convenience function that creates a factory internally.
+ *
+ * @param topicType - The topic type
+ * @param params - Network parameters for scoring calculation
+ * @returns TopicScoreParams for the topic
+ */
+export declare function createTopicScoreParamsForTopic(topicType: TopicType, params: TopicScoringNetworkParams): ReturnType<typeof createTopicScoreParams>;
+/**
+ * Creates all topic score parameters for gossipsub configuration.
+ *
+ * @param protocolVersion - Protocol version string for topic naming
+ * @param params - Network parameters for scoring calculation
+ * @returns Record mapping topic strings to their score parameters
+ */
+export declare function createAllTopicScoreParams(protocolVersion: string, params: TopicScoringNetworkParams): Record<string, ReturnType<typeof createTopicScoreParams>>;
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoidG9waWNfc2NvcmVfcGFyYW1zLmQudHMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi8uLi9zcmMvc2VydmljZXMvZ29zc2lwc3ViL3RvcGljX3Njb3JlX3BhcmFtcy50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFBQSxPQUFPLEVBQUUsU0FBUyxFQUFxQixNQUFNLHdCQUF3QixDQUFDO0FBQ3RFLE9BQU8sRUFBRSxzQkFBc0IsRUFBRSxNQUFNLG1DQUFtQyxDQUFDO0FBRTNFOztHQUVHO0FBQ0gsTUFBTSxNQUFNLHlCQUF5QixHQUFHO0lBQ3RDLHVDQUF1QztJQUN2QyxjQUFjLEVBQUUsTUFBTSxDQUFDO0lBQ3ZCLG1EQUFtRDtJQUNuRCxtQkFBbUIsRUFBRSxNQUFNLENBQUM7SUFDNUIsK0VBQStFO0lBQy9FLG1CQUFtQixFQUFFLE1BQU0sQ0FBQztJQUM1Qjs7O09BR0c7SUFDSCxzQkFBc0IsRUFBRSxNQUFNLENBQUM7SUFDL0IsdUlBQXVJO0lBQ3ZJLDZCQUE2QixDQUFDLEVBQUUsTUFBTSxDQUFDO0NBQ3hDLENBQUM7QUFFRjs7Ozs7O0dBTUc7QUFDSCx3QkFBZ0IsbUJBQW1CLENBQUMsdUJBQXVCLEVBQUUsTUFBTSxHQUFHLE1BQU0sQ0FRM0U7QUFFRDs7Ozs7Ozs7R0FRRztBQUNILHdCQUFnQixZQUFZLENBQUMsbUJBQW1CLEVBQUUsTUFBTSxFQUFFLGNBQWMsRUFBRSxNQUFNLEVBQUUsZ0JBQWdCLEVBQUUsTUFBTSxHQUFHLE1BQU0sQ0FPbEg7QUFFRDs7Ozs7Ozs7R0FRRztBQUNILHdCQUFnQixrQkFBa0IsQ0FBQyxvQkFBb0IsRUFBRSxNQUFNLEVBQUUsS0FBSyxFQUFFLE1BQU0sR0FBRyxNQUFNLENBRXRGO0FBRUQ7Ozs7Ozs7R0FPRztBQUNILHdCQUFnQixnQkFBZ0IsQ0FBQyxXQUFXLEVBQUUsTUFBTSxFQUFFLGtCQUFrQixFQUFFLE1BQU0sR0FBRyxNQUFNLENBRXhGO0FBRUQ7Ozs7Ozs7R0FPRztBQUNILHdCQUFnQixpQ0FBaUMsQ0FDL0MsYUFBYSxFQUFFLE1BQU0sRUFDckIsNkJBQTZCLENBQUMsRUFBRSxNQUFNLEdBQ3JDLE1BQU0sR0FBRyxTQUFTLENBUXBCO0FBRUQ7Ozs7Ozs7O0dBUUc7QUFDSCx3QkFBZ0IsMEJBQTBCLENBQ3hDLFNBQVMsRUFBRSxTQUFTLEVBQ3BCLG1CQUFtQixFQUFFLE1BQU0sRUFDM0IsYUFBYSxFQUFFLE1BQU0sRUFDckIsNkJBQTZCLENBQUMsRUFBRSxNQUFNLEdBQ3JDLE1BQU0sR0FBRyxTQUFTLENBb0JwQjtBQWtDRCw4Q0FBOEM7QUFDOUMsZUFBTyxNQUFNLFlBQVksSUFBSSxDQUFDO0FBZTlCLDhDQUE4QztBQUM5QyxlQUFPLE1BQU0sWUFBWSxLQUFLLENBQUM7QUE0Qi9CLDBFQUEwRTtBQUMxRSxlQUFPLE1BQU0sd0JBQXdCLFFBQXFDLENBQUM7QUFFM0U7OztHQUdHO0FBQ0gscUJBQWEsdUJBQXVCO0lBMkN0QixPQUFPLENBQUMsUUFBUSxDQUFDLE1BQU07SUExQ25DLGlFQUFpRTtJQUNqRSxTQUFnQixhQUFhLEVBQUUsTUFBTSxDQUFDO0lBRXRDLHNEQUFzRDtJQUN0RCxTQUFnQixZQUFZLEVBQUUsTUFBTSxDQUFDO0lBRXJDLG9DQUFvQztJQUNwQyxTQUFnQixpQkFBaUIsRUFBRSxNQUFNLENBQUM7SUFFMUMsc0ZBQXNGO0lBQ3RGLFNBQWdCLGlCQUFpQixFQUFFLE1BQU0sQ0FBQztJQUUxQyxnRUFBZ0U7SUFDaEUsU0FBZ0IsYUFBYSxFQUFFLE1BQU0sQ0FBQztJQUV0QyxvRUFBb0U7SUFDcEUsU0FBZ0IsZ0JBQWdCLEVBQUUsTUFBTSxDQUFDO0lBRXpDLGdEQUFnRDtJQUNoRCxTQUFnQiwyQkFBMkIsRUFBRSxNQUFNLENBQUM7SUFFcEQsMkRBQTJEO0lBQzNELFNBQWdCLHlCQUF5QixFQUFFLE1BQU0sQ0FBQztJQUVsRCxnRkFBZ0Y7SUFDaEYsU0FBZ0IsNEJBQTRCLEVBQUUsTUFBTSxDQUFDO0lBRXJELDJDQUEyQztJQUMzQyxPQUFPLENBQUMsUUFBUSxDQUFDLFVBQVUsQ0FZekI7SUFFRixZQUE2QixNQUFNLEVBQUUseUJBQXlCLEVBeUM3RDtJQUVEOzs7Ozs7O09BT0c7SUFDSCxPQUFPLENBQUMsc0JBQXNCO0lBMkI5Qjs7Ozs7Ozs7OztPQVVHO0lBQ0gsT0FBTyxDQUFDLHFCQUFxQjtJQXdDN0Isc0pBQXNKO0lBQ3RKLElBQUksa0JBQWtCLElBQUksTUFBTSxDQUkvQjtJQUVELHNGQUFzRjtJQUN0RixJQUFJLGtCQUFrQixJQUFJLE1BQU0sQ0FFL0I7SUFFRDs7Ozs7T0FLRztJQUNILGNBQWMsQ0FBQyxTQUFTLEVBQUUsU0FBUyxHQUFHLFVBQVUsQ0FBQyxPQUFPLHNCQUFzQixDQUFDLENBYzlFO0lBRUQ7Ozs7O09BS0c7SUFDSCxTQUFTLENBQUMsZUFBZSxFQUFFLE1BQU0sR0FBRyxNQUFNLENBQUMsTUFBTSxFQUFFLFVBQVUsQ0FBQyxPQUFPLHNCQUFzQixDQUFDLENBQUMsQ0FTNUY7Q0FDRjtBQUVEOzs7Ozs7O0dBT0c7QUFDSCx3QkFBZ0IsOEJBQThCLENBQzVDLFNBQVMsRUFBRSxTQUFTLEVBQ3BCLE1BQU0sRUFBRSx5QkFBeUIsR0FDaEMsVUFBVSxDQUFDLE9BQU8sc0JBQXNCLENBQUMsQ0FHM0M7QUFFRDs7Ozs7O0dBTUc7QUFDSCx3QkFBZ0IseUJBQXlCLENBQ3ZDLGVBQWUsRUFBRSxNQUFNLEVBQ3ZCLE1BQU0sRUFBRSx5QkFBeUIsR0FDaEMsTUFBTSxDQUFDLE1BQU0sRUFBRSxVQUFVLENBQUMsT0FBTyxzQkFBc0IsQ0FBQyxDQUFDLENBRzNEIn0=

package/dest/services/gossipsub/topic_score_params.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"topic_score_params.d.ts","sourceRoot":"","sources":["../../../src/services/gossipsub/topic_score_params.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAqB,MAAM,wBAAwB,CAAC;AACtE,OAAO,EAAE,sBAAsB,EAAE,MAAM,mCAAmC,CAAC;AAE3E;;GAEG;AACH,MAAM,MAAM,yBAAyB,GAAG;IACtC,uCAAuC;IACvC,cAAc,EAAE,MAAM,CAAC;IACvB,mDAAmD;IACnD,mBAAmB,EAAE,MAAM,CAAC;IAC5B,+EAA+E;IAC/E,mBAAmB,EAAE,MAAM,CAAC;IAC5B;;;OAGG;IACH,sBAAsB,EAAE,MAAM,CAAC;IAC/B,uIAAuI;IACvI,6BAA6B,CAAC,EAAE,MAAM,CAAC;CACxC,CAAC;AAEF;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,uBAAuB,EAAE,MAAM,GAAG,MAAM,CAQ3E;AAED;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAAC,mBAAmB,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,GAAG,MAAM,CAOlH;AAED;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAAC,oBAAoB,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAEtF;AAED;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAAC,WAAW,EAAE,MAAM,EAAE,kBAAkB,EAAE,MAAM,GAAG,MAAM,CAExF;AAED;;;;;;;GAOG;AACH,wBAAgB,iCAAiC,CAC/C,aAAa,EAAE,MAAM,EACrB,6BAA6B,CAAC,EAAE,MAAM,GACrC,MAAM,GAAG,SAAS,CAQpB;AAED;;;;;;;;GAQG;AACH,wBAAgB,0BAA0B,CACxC,SAAS,EAAE,SAAS,EACpB,mBAAmB,EAAE,MAAM,EAC3B,aAAa,EAAE,MAAM,EACrB,6BAA6B,CAAC,EAAE,MAAM,GACrC,MAAM,GAAG,SAAS,CAoBpB;AAkCD,8CAA8C;AAC9C,eAAO,MAAM,YAAY,IAAI,CAAC;AAe9B,8CAA8C;AAC9C,eAAO,MAAM,YAAY,KAAK,CAAC;AA4B/B,0EAA0E;AAC1E,eAAO,MAAM,wBAAwB,QAAqC,CAAC;AAE3E;;;GAGG;AACH,qBAAa,uBAAuB;IA2CtB,OAAO,CAAC,QAAQ,CAAC,MAAM;IA1CnC,iEAAiE;IACjE,SAAgB,aAAa,EAAE,MAAM,CAAC;IAEtC,sDAAsD;IACtD,SAAgB,YAAY,EAAE,MAAM,CAAC;IAErC,oCAAoC;IACpC,SAAgB,iBAAiB,EAAE,MAAM,CAAC;IAE1C,sFAAsF;IACtF,SAAgB,iBAAiB,EAAE,MAAM,CAAC;IAE1C,gEAAgE;IAChE,SAAgB,aAAa,EAAE,MAAM,CAAC;IAEtC,oEAAoE;IACpE,SAAgB,gBAAgB,EAAE,MAAM,CAAC;IAEzC,gDAAgD;IAChD,SAAgB,2BAA2B,EAAE,MAAM,CAAC;IAEpD,2DAA2D;IAC3D,SAAgB,yBAAyB,EAAE,MAAM,CAAC;IAElD,gFAAgF;IAChF,SAAgB,4BAA4B,EAAE,MAAM,CAAC;IAErD,2CAA2C;IAC3C,OAAO,CAAC,QAAQ,CAAC,UAAU,CAYzB;IAEF,YAA6B,MAAM,EAAE,yBAAyB,EAyC7D;IAED;;;;;;;OAOG;IACH,OAAO,CAAC,sBAAsB;IA2B9B;;;;;;;;;;OAUG;IACH,OAAO,CAAC,qBAAqB;IAwC7B,sJAAsJ;IACtJ,IAAI,kBAAkB,IAAI,MAAM,CAI/B;IAED,sFAAsF;IACtF,IAAI,kBAAkB,IAAI,MAAM,CAE/B;IAED;;;;;OAKG;IACH,cAAc,CAAC,SAAS,EAAE,SAAS,GAAG,UAAU,CAAC,OAAO,sBAAsB,CAAC,CAc9E;IAED;;;;;OAKG;IACH,SAAS,CAAC,eAAe,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,OAAO,sBAAsB,CAAC,CAAC,CAS5F;CACF;AAED;;;;;;;GAOG;AACH,wBAAgB,8BAA8B,CAC5C,SAAS,EAAE,SAAS,EACpB,MAAM,EAAE,yBAAyB,GAChC,UAAU,CAAC,OAAO,sBAAsB,CAAC,CAG3C;AAED;;;;;;GAMG;AACH,wBAAgB,yBAAyB,CACvC,eAAe,EAAE,MAAM,EACvB,MAAM,EAAE,yBAAyB,GAChC,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,OAAO,sBAAsB,CAAC,CAAC,CAG3D"}