libp2p
    Preparing search index...

    Interface SingleKadDHT

    interface SingleKadDHT {
        a: number;
        d: number;
        k: number;
        routingTable: RoutingTable;
        cancelReprovide(key: CID, options?: AbortOptions): Promise<void>;
        findPeer(id: PeerId, options?: RoutingOptions): AsyncIterable<QueryEvent>;
        findProviders(
            key: CID,
            options?: RoutingOptions,
        ): AsyncIterable<QueryEvent>;
        get(key: Uint8Array, options?: RoutingOptions): AsyncIterable<QueryEvent>;
        getClosestPeers(
            key: Uint8Array,
            options?: RoutingOptions,
        ): AsyncIterable<QueryEvent>;
        getMode(): "client" | "server";
        provide(key: CID, options?: RoutingOptions): AsyncIterable<QueryEvent>;
        put(
            key: Uint8Array,
            value: Uint8Array,
            options?: RoutingOptions,
        ): AsyncIterable<QueryEvent>;
        refreshRoutingTable(options?: AbortOptions): Promise<void>;
        setMode(mode: "client" | "server", options?: SetModeOptions): Promise<void>;
    }

    Hierarchy (View Summary)

    Index

    Properties

    a d k routingTable

    Methods

    cancelReprovide findPeer findProviders get getClosestPeers getMode provide put refreshRoutingTable setMode

    Properties

    a: number

    Query concurrency factor - this controls how many peers we contact in parallel during a query.

    d: number

    From section 4.4 of the S/Kademlia paper - this is how many disjoint paths are used during a query.

    k: number

    This is the maximum size of the k-buckets and how many peers are looked up when searching for peers close to a key.

    routingTable: RoutingTable

    Methods

    Settings

    Member Visibility

    On This Page

    Properties
    Methods