@streamr/trackerless-network 0.0.1-tatum.0

package/dist/src/NetworkStack.js

@@ -0,0 +1,108 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.NetworkStack = void 0;
+const dht_1 = require("@streamr/dht");
+const StreamrNode_1 = require("./logic/StreamrNode");
+const utils_1 = require("@streamr/utils");
+const eventemitter3_1 = require("eventemitter3");
+class ReadynessListener {
+    constructor(networkStack, dhtNode) {
+        this.emitter = new eventemitter3_1.EventEmitter();
+        this.onConnected = () => {
+            this.networkStack.off('stopped', this.onStopped);
+            this.dhtNode.off('connected', this.onConnected);
+            this.emitter.emit('done');
+        };
+        this.onStopped = () => {
+            this.networkStack.off('stopped', this.onStopped);
+            this.dhtNode.off('connected', this.onConnected);
+            this.emitter.emit('done');
+        };
+        this.networkStack = networkStack;
+        this.dhtNode = dhtNode;
+        this.networkStack.on('stopped', this.onStopped);
+        this.dhtNode.on('connected', this.onConnected);
+    }
+    async waitUntilReady(timeout) {
+        if (this.dhtNode.getNumberOfConnections() > 0) {
+            return;
+        }
+        else {
+            await (0, utils_1.waitForEvent3)(this.emitter, 'done', timeout);
+        }
+    }
+}
+class NetworkStack extends eventemitter3_1.EventEmitter {
+    constructor(options) {
+        super();
+        this.dhtJoinRequired = true;
+        this.options = options;
+        this.metricsContext = options.metricsContext ?? new utils_1.MetricsContext();
+        this.layer0DhtNode = new dht_1.DhtNode({
+            ...options.layer0,
+            metricsContext: this.metricsContext
+        });
+        this.streamrNode = new StreamrNode_1.StreamrNode({
+            ...options.networkNode,
+            nodeName: options.networkNode.nodeName ?? options.layer0.nodeName,
+            metricsContext: this.metricsContext
+        });
+        this.firstConnectionTimeout = options.networkNode.firstConnectionTimeout ?? 5000;
+    }
+    async start(doJoin = true) {
+        await this.layer0DhtNode.start();
+        this.connectionManager = this.layer0DhtNode.getTransport();
+        if (this.options.layer0.entryPoints.some((entryPoint) => (0, dht_1.isSamePeerDescriptor)(entryPoint, this.layer0DhtNode.getPeerDescriptor()))) {
+            this.dhtJoinRequired = false;
+            await this.layer0DhtNode?.joinDht(this.options.layer0.entryPoints);
+            await this.streamrNode?.start(this.layer0DhtNode, this.connectionManager, this.connectionManager);
+        }
+        else {
+            if (doJoin) {
+                this.dhtJoinRequired = false;
+                await this.joinDht();
+            }
+            await this.streamrNode?.start(this.layer0DhtNode, this.connectionManager, this.connectionManager);
+        }
+    }
+    async joinDht() {
+        setImmediate(() => {
+            this.layer0DhtNode?.joinDht(this.options.layer0.entryPoints);
+        });
+        await this.waitForFirstConnection();
+    }
+    async waitForFirstConnection() {
+        const readynessListener = new ReadynessListener(this, this.layer0DhtNode);
+        await readynessListener.waitUntilReady(this.firstConnectionTimeout);
+    }
+    async joinLayer0IfRequired(streamPartId) {
+        if (this.isJoinRequired(streamPartId)) {
+            this.dhtJoinRequired = false;
+            await this.joinDht();
+        }
+        else if (this.layer0DhtNode.getNumberOfConnections() < 1) {
+            await this.waitForFirstConnection();
+        }
+    }
+    isJoinRequired(streamPartId) {
+        return this.dhtJoinRequired && !this.layer0DhtNode.hasJoined() && this.streamrNode.isJoinRequired(streamPartId);
+    }
+    getStreamrNode() {
+        return this.streamrNode;
+    }
+    getLayer0DhtNode() {
+        return this.layer0DhtNode;
+    }
+    getMetricsContext() {
+        return this.metricsContext;
+    }
+    async stop() {
+        await this.streamrNode.destroy();
+        this.streamrNode = undefined;
+        this.layer0DhtNode = undefined;
+        this.connectionManager = undefined;
+        this.emit('stopped');
+    }
+}
+exports.NetworkStack = NetworkStack;
+//# sourceMappingURL=NetworkStack.js.map

package/dist/src/NetworkStack.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"NetworkStack.js","sourceRoot":"","sources":["../../src/NetworkStack.ts"],"names":[],"mappings":";;;AAAA,sCAA+F;AAC/F,qDAAoE;AACpE,0CAA8D;AAC9D,iDAA4C;AAO5C,MAAM,iBAAiB;IAMnB,YAAY,YAA0B,EAAE,OAAgB;QAJvC,YAAO,GAAG,IAAI,4BAAY,EAAmB,CAAA;QAWtD,gBAAW,GAAG,GAAG,EAAE;YACvB,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,CAAA;YAChD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,CAAC,CAAA;YAC/C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QAC7B,CAAC,CAAA;QAEO,cAAS,GAAG,GAAG,EAAE;YACrB,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,CAAA;YAChD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,CAAC,CAAA;YAC/C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QAC7B,CAAC,CAAA;QAhBG,IAAI,CAAC,YAAY,GAAG,YAAY,CAAA;QAChC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;QACtB,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,CAAA;QAC/C,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,CAAC,CAAA;IAClD,CAAC;IAcM,KAAK,CAAC,cAAc,CAAC,OAAe;QACvC,IAAI,IAAI,CAAC,OAAO,CAAC,sBAAsB,EAAE,GAAG,CAAC,EAAE;YAC3C,OAAM;SACT;aAAM;YACH,MAAM,IAAA,qBAAa,EAAkB,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,CAAA;SACtE;IACL,CAAC;CACJ;AAYD,MAAa,YAAa,SAAQ,4BAAgC;IAU9D,YAAY,OAAuB;QAC/B,KAAK,EAAE,CAAA;QAHH,oBAAe,GAAG,IAAI,CAAA;QAI1B,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;QACtB,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,IAAI,sBAAc,EAAE,CAAA;QACpE,IAAI,CAAC,aAAa,GAAG,IAAI,aAAO,CAAC;YAC7B,GAAG,OAAO,CAAC,MAAM;YACjB,cAAc,EAAE,IAAI,CAAC,cAAc;SACtC,CAAC,CAAA;QACF,IAAI,CAAC,WAAW,GAAG,IAAI,yBAAW,CAAC;YAC/B,GAAG,OAAO,CAAC,WAAW;YACtB,QAAQ,EAAE,OAAO,CAAC,WAAW,CAAC,QAAQ,IAAI,OAAO,CAAC,MAAM,CAAC,QAAQ;YACjE,cAAc,EAAE,IAAI,CAAC,cAAc;SACtC,CAAC,CAAA;QACF,IAAI,CAAC,sBAAsB,GAAG,OAAO,CAAC,WAAW,CAAC,sBAAsB,IAAI,IAAI,CAAA;IACpF,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI;QACrB,MAAM,IAAI,CAAC,aAAc,CAAC,KAAK,EAAE,CAAA;QACjC,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC,aAAc,CAAC,YAAY,EAAuB,CAAA;QAChF,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,WAAY,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,EAAE,CACrD,IAAA,0BAAoB,EAAC,UAAU,EAAE,IAAI,CAAC,aAAc,CAAC,iBAAiB,EAAE,CAAC,CAC5E,EAAE;YACC,IAAI,CAAC,eAAe,GAAG,KAAK,CAAA;YAC5B,MAAM,IAAI,CAAC,aAAa,EAAE,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,WAAY,CAAC,CAAA;YACnE,MAAM,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC,IAAI,CAAC,aAAc,EAAE,IAAI,CAAC,iBAAkB,EAAE,IAAI,CAAC,iBAAkB,CAAC,CAAA;SACvG;aAAM;YACH,IAAI,MAAM,EAAE;gBACR,IAAI,CAAC,eAAe,GAAG,KAAK,CAAA;gBAC5B,MAAM,IAAI,CAAC,OAAO,EAAE,CAAA;aACvB;YACD,MAAM,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC,IAAI,CAAC,aAAc,EAAE,IAAI,CAAC,iBAAkB,EAAE,IAAI,CAAC,iBAAkB,CAAC,CAAA;SACvG;IACL,CAAC;IAEO,KAAK,CAAC,OAAO;QACjB,YAAY,CAAC,GAAG,EAAE;YACd,IAAI,CAAC,aAAa,EAAE,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,WAAY,CAAC,CAAA;QACjE,CAAC,CAAC,CAAA;QACF,MAAM,IAAI,CAAC,sBAAsB,EAAE,CAAA;IACvC,CAAC;IAEO,KAAK,CAAC,sBAAsB;QAChC,MAAM,iBAAiB,GAAG,IAAI,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC,aAAc,CAAC,CAAA;QAC1E,MAAM,iBAAiB,CAAC,cAAc,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAA;IACvE,CAAC;IAED,KAAK,CAAC,oBAAoB,CAAC,YAA0B;QACjD,IAAI,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,EAAE;YACnC,IAAI,CAAC,eAAe,GAAG,KAAK,CAAA;YAC5B,MAAM,IAAI,CAAC,OAAO,EAAE,CAAA;SACvB;aAAM,IAAI,IAAI,CAAC,aAAc,CAAC,sBAAsB,EAAE,GAAG,CAAC,EAAE;YACzD,MAAM,IAAI,CAAC,sBAAsB,EAAE,CAAA;SACtC;IACL,CAAC;IAEO,cAAc,CAAC,YAA0B;QAC7C,OAAO,IAAI,CAAC,eAAe,IAAI,CAAC,IAAI,CAAC,aAAc,CAAC,SAAS,EAAE,IAAI,IAAI,CAAC,WAAY,CAAC,cAAc,CAAC,YAAY,CAAC,CAAA;IACrH,CAAC;IAED,cAAc;QACV,OAAO,IAAI,CAAC,WAAY,CAAA;IAC5B,CAAC;IAED,gBAAgB;QACZ,OAAO,IAAI,CAAC,aAAc,CAAA;IAC9B,CAAC;IAED,iBAAiB;QACb,OAAO,IAAI,CAAC,cAAc,CAAA;IAC9B,CAAC;IAED,KAAK,CAAC,IAAI;QACN,MAAM,IAAI,CAAC,WAAY,CAAC,OAAO,EAAE,CAAA;QACjC,IAAI,CAAC,WAAW,GAAG,SAAS,CAAA;QAC5B,IAAI,CAAC,aAAa,GAAG,SAAS,CAAA;QAC9B,IAAI,CAAC,iBAAiB,GAAG,SAAS,CAAA;QAClC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;IACxB,CAAC;CAEJ;AAzFD,oCAyFC"}

package/dist/src/exports.d.ts

@@ -0,0 +1,6 @@
+export { NetworkStack, NetworkOptions } from './NetworkStack';
+export { NetworkNode } from './NetworkNode';
+export { StreamrNodeConfig } from './logic/StreamrNode';
+export { NameDirectory } from './NameDirectory';
+export { NodeId } from './identifiers';
+export { ProxyDirection } from './proto/packages/trackerless-network/protos/NetworkRpc';

package/dist/src/exports.js

@@ -0,0 +1,12 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ProxyDirection = exports.NameDirectory = exports.NetworkNode = exports.NetworkStack = void 0;
+var NetworkStack_1 = require("./NetworkStack");
+Object.defineProperty(exports, "NetworkStack", { enumerable: true, get: function () { return NetworkStack_1.NetworkStack; } });
+var NetworkNode_1 = require("./NetworkNode");
+Object.defineProperty(exports, "NetworkNode", { enumerable: true, get: function () { return NetworkNode_1.NetworkNode; } });
+var NameDirectory_1 = require("./NameDirectory");
+Object.defineProperty(exports, "NameDirectory", { enumerable: true, get: function () { return NameDirectory_1.NameDirectory; } });
+var NetworkRpc_1 = require("./proto/packages/trackerless-network/protos/NetworkRpc");
+Object.defineProperty(exports, "ProxyDirection", { enumerable: true, get: function () { return NetworkRpc_1.ProxyDirection; } });
+//# sourceMappingURL=exports.js.map

package/dist/src/exports.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"exports.js","sourceRoot":"","sources":["../../src/exports.ts"],"names":[],"mappings":";;;AAAA,+CAA6D;AAApD,4GAAA,YAAY,OAAA;AACrB,6CAA2C;AAAlC,0GAAA,WAAW,OAAA;AAEpB,iDAA+C;AAAtC,8GAAA,aAAa,OAAA;AAEtB,qFAAuF;AAA9E,4GAAA,cAAc,OAAA"}

package/dist/src/identifiers.d.ts

@@ -0,0 +1 @@
+export type NodeId = string;

package/dist/src/identifiers.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=identifiers.js.map

package/dist/src/identifiers.js.map

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

package/dist/src/logic/DuplicateMessageDetector.d.ts

@@ -0,0 +1,55 @@
+/**
+ * Represent a pair of numbers (a,b). Ordering between two pairs is defined as
+ * follows. First compare first numbers. Compare second numbers if first are
+ * equal.
+ */
+export declare class NumberPair {
+    private readonly a;
+    private readonly b;
+    constructor(a: number, b: number);
+    greaterThanOrEqual(otherPair: NumberPair): boolean;
+    greaterThan(otherPair: NumberPair): boolean;
+    equalTo(otherPair: NumberPair): boolean;
+    private compareTo;
+    toString(): string;
+}
+export declare class InvalidNumberingError extends Error {
+    constructor();
+}
+export declare class GapMisMatchError extends Error {
+    constructor(state: string, previousNumber: NumberPair, number: NumberPair);
+}
+/**
+ *
+ * Keeps track of a stream's message numbers and reports already seen numbers
+ * as duplicates.
+ *
+ * Leverages the fact that message are assigned numbers from a strictly
+ * increasing integer sequence for lowered space complexity. For example,
+ * if we know that all messages up to number N have been seen, we can only
+ * store the number N to provide message identity check. This is because
+ * anything less than N can be deemed a duplicate.
+ *
+ * Messages arriving out-of-order makes this a bit harder since gaps form.
+ * Most of the code in this class is built to deal with this complexity.
+ * Basically, we need to keep track of which intervals [N,M] could still
+ * contain unseen messages. We should also remove intervals after we are sure
+ * that they contain no unseen messages.
+ *
+ * In addition to the above, there needs to be a limit to the number of
+ * intervals we store, as it could well be that some messages never
+ * arrive. The strategy is to start removing the lowest numbered
+ * intervals when storage limits are hit.
+ *
+ */
+export declare class DuplicateMessageDetector {
+    private readonly maxNumberOfGaps;
+    private readonly gaps;
+    constructor(maxNumberOfGaps?: number);
+    /**
+     * returns true if number has not yet been seen (i.e. is not a duplicate)
+     */
+    markAndCheck(previousNumber: NumberPair | null, number: NumberPair): boolean | never;
+    private dropLowestGapIfOverMaxNumberOfGaps;
+    toString(): string;
+}

package/dist/src/logic/DuplicateMessageDetector.js

@@ -0,0 +1,155 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DuplicateMessageDetector = exports.GapMisMatchError = exports.InvalidNumberingError = exports.NumberPair = void 0;
+/**
+ * Represent a pair of numbers (a,b). Ordering between two pairs is defined as
+ * follows. First compare first numbers. Compare second numbers if first are
+ * equal.
+ */
+class NumberPair {
+    constructor(a, b) {
+        this.a = a;
+        this.b = b;
+    }
+    greaterThanOrEqual(otherPair) {
+        return this.greaterThan(otherPair) || this.equalTo(otherPair);
+    }
+    greaterThan(otherPair) {
+        return this.compareTo(otherPair) === 1;
+    }
+    equalTo(otherPair) {
+        return this.compareTo(otherPair) === 0;
+    }
+    compareTo(otherPair) {
+        if (this.a > otherPair.a) {
+            return 1;
+        }
+        if (this.a < otherPair.a) {
+            return -1;
+        }
+        if (this.b > otherPair.b) {
+            return 1;
+        }
+        if (this.b < otherPair.b) {
+            return -1;
+        }
+        return 0;
+    }
+    toString() {
+        return `${this.a}|${this.b}`;
+    }
+}
+exports.NumberPair = NumberPair;
+class InvalidNumberingError extends Error {
+    constructor() {
+        super('pre-condition: previousNumber < number');
+    }
+}
+exports.InvalidNumberingError = InvalidNumberingError;
+class GapMisMatchError extends Error {
+    constructor(state, previousNumber, number) {
+        super('pre-condition: gap overlap in given numbers:'
+            + ` previousNumber=${previousNumber}, number=${number}, state=${state}`);
+    }
+}
+exports.GapMisMatchError = GapMisMatchError;
+/**
+ *
+ * Keeps track of a stream's message numbers and reports already seen numbers
+ * as duplicates.
+ *
+ * Leverages the fact that message are assigned numbers from a strictly
+ * increasing integer sequence for lowered space complexity. For example,
+ * if we know that all messages up to number N have been seen, we can only
+ * store the number N to provide message identity check. This is because
+ * anything less than N can be deemed a duplicate.
+ *
+ * Messages arriving out-of-order makes this a bit harder since gaps form.
+ * Most of the code in this class is built to deal with this complexity.
+ * Basically, we need to keep track of which intervals [N,M] could still
+ * contain unseen messages. We should also remove intervals after we are sure
+ * that they contain no unseen messages.
+ *
+ * In addition to the above, there needs to be a limit to the number of
+ * intervals we store, as it could well be that some messages never
+ * arrive. The strategy is to start removing the lowest numbered
+ * intervals when storage limits are hit.
+ *
+ */
+class DuplicateMessageDetector {
+    constructor(maxNumberOfGaps = 10000) {
+        this.maxNumberOfGaps = maxNumberOfGaps;
+        this.gaps = []; // ascending order of half-closed intervals (x,y] representing gaps that contain unseen message(s)
+    }
+    /**
+     * returns true if number has not yet been seen (i.e. is not a duplicate)
+     */
+    markAndCheck(previousNumber, number) {
+        if (previousNumber && previousNumber.greaterThanOrEqual(number)) {
+            throw new InvalidNumberingError();
+        }
+        if (this.gaps.length === 0) {
+            this.gaps.push([number, new NumberPair(Infinity, Infinity)]);
+            return true;
+        }
+        // Handle special case where previousNumber is not provided. Only
+        // minimal duplicate detection is provided (comparing against latest
+        // known message number).
+        if (previousNumber === null) {
+            if (number.greaterThan(this.gaps[this.gaps.length - 1][0])) {
+                this.gaps[this.gaps.length - 1][0] = number;
+                return true;
+            }
+            return false;
+        }
+        for (let i = this.gaps.length - 1; i >= 0; --i) {
+            const [lowerBound, upperBound] = this.gaps[i]; // invariant: upperBound > lowerBound
+            // implies number > upperBound (would've been handled in previous iteration if gap exists)
+            if (previousNumber.greaterThanOrEqual(upperBound)) {
+                return false;
+            }
+            if (previousNumber.greaterThanOrEqual(lowerBound)) {
+                if (number.greaterThan(upperBound)) {
+                    throw new GapMisMatchError(this.toString(), previousNumber, number);
+                }
+                if (previousNumber.equalTo(lowerBound)) {
+                    if (number.equalTo(upperBound)) {
+                        this.gaps.splice(i, 1);
+                    }
+                    else {
+                        this.gaps[i] = [number, upperBound];
+                    }
+                }
+                else if (number.equalTo(upperBound)) {
+                    this.gaps[i] = [lowerBound, previousNumber];
+                }
+                else {
+                    this.gaps.splice(i, 1, [lowerBound, previousNumber], [number, upperBound]);
+                }
+                // invariants after:
+                //   - gaps are in ascending order
+                //   - the intersection between any two gaps is empty
+                //   - there are no gaps that define the empty set
+                //   - last gap is [n, Infinity]
+                //   - anything not covered by a gap is considered seen
+                this.dropLowestGapIfOverMaxNumberOfGaps();
+                return true;
+            }
+            if (number.greaterThan(lowerBound)) {
+                throw new GapMisMatchError(this.toString(), previousNumber, number);
+            }
+        }
+        return false;
+    }
+    dropLowestGapIfOverMaxNumberOfGaps() {
+        // invariant: this.gaps.length <= this.maxNumberOfGaps + 1
+        if (this.gaps.length > this.maxNumberOfGaps) {
+            this.gaps.shift();
+        }
+    }
+    toString() {
+        return this.gaps.map(([lower, upper]) => `(${lower}, ${upper}]`).join(', ');
+    }
+}
+exports.DuplicateMessageDetector = DuplicateMessageDetector;
+//# sourceMappingURL=DuplicateMessageDetector.js.map

package/dist/src/logic/DuplicateMessageDetector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DuplicateMessageDetector.js","sourceRoot":"","sources":["../../../src/logic/DuplicateMessageDetector.ts"],"names":[],"mappings":";;;AAAA;;;;GAIG;AACH,MAAa,UAAU;IAInB,YAAY,CAAS,EAAE,CAAS;QAC5B,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;QACV,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;IACd,CAAC;IAED,kBAAkB,CAAC,SAAqB;QACpC,OAAO,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAA;IACjE,CAAC;IAED,WAAW,CAAC,SAAqB;QAC7B,OAAO,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;IAC1C,CAAC;IAED,OAAO,CAAC,SAAqB;QACzB,OAAO,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;IAC1C,CAAC;IAEO,SAAS,CAAC,SAAqB;QACnC,IAAI,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE;YACtB,OAAO,CAAC,CAAA;SACX;QACD,IAAI,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE;YACtB,OAAO,CAAC,CAAC,CAAA;SACZ;QACD,IAAI,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE;YACtB,OAAO,CAAC,CAAA;SACX;QACD,IAAI,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE;YACtB,OAAO,CAAC,CAAC,CAAA;SACZ;QACD,OAAO,CAAC,CAAA;IACZ,CAAC;IAED,QAAQ;QACJ,OAAO,GAAG,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,CAAA;IAChC,CAAC;CACJ;AAxCD,gCAwCC;AAED,MAAa,qBAAsB,SAAQ,KAAK;IAC5C;QACI,KAAK,CAAC,wCAAwC,CAAC,CAAA;IACnD,CAAC;CACJ;AAJD,sDAIC;AAED,MAAa,gBAAiB,SAAQ,KAAK;IACvC,YAAY,KAAa,EAAE,cAA0B,EAAE,MAAkB;QACrE,KAAK,CAAC,8CAA8C;cAC9C,mBAAmB,cAAc,YAAY,MAAM,WAAW,KAAK,EAAE,CAAC,CAAA;IAChF,CAAC;CACJ;AALD,4CAKC;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAa,wBAAwB;IAIjC,YAAY,eAAe,GAAG,KAAK;QAC/B,IAAI,CAAC,eAAe,GAAG,eAAe,CAAA;QACtC,IAAI,CAAC,IAAI,GAAG,EAAE,CAAA,CAAC,kGAAkG;IACrH,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,cAAiC,EAAE,MAAkB;QAC9D,IAAI,cAAc,IAAI,cAAc,CAAC,kBAAkB,CAAC,MAAM,CAAC,EAAE;YAC7D,MAAM,IAAI,qBAAqB,EAAE,CAAA;SACpC;QAED,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE;YACxB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,IAAI,UAAU,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAA;YAC5D,OAAO,IAAI,CAAA;SACd;QAED,iEAAiE;QACjE,oEAAoE;QACpE,yBAAyB;QACzB,IAAI,cAAc,KAAK,IAAI,EAAE;YACzB,IAAI,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;gBACxD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAA;gBAC3C,OAAO,IAAI,CAAA;aACd;YACD,OAAO,KAAK,CAAA;SACf;QAED,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;YAC5C,MAAM,CAAC,UAAU,EAAE,UAAU,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA,CAAC,qCAAqC;YAEnF,0FAA0F;YAC1F,IAAI,cAAc,CAAC,kBAAkB,CAAC,UAAU,CAAC,EAAE;gBAC/C,OAAO,KAAK,CAAA;aACf;YACD,IAAI,cAAc,CAAC,kBAAkB,CAAC,UAAU,CAAC,EAAE;gBAC/C,IAAI,MAAM,CAAC,WAAW,CAAC,UAAU,CAAC,EAAE;oBAChC,MAAM,IAAI,gBAAgB,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,cAAc,EAAE,MAAM,CAAC,CAAA;iBACtE;gBACD,IAAI,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE;oBACpC,IAAI,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE;wBAC5B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;qBACzB;yBAAM;wBACH,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAA;qBACtC;iBACJ;qBAAM,IAAI,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE;oBACnC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,EAAE,cAAc,CAAC,CAAA;iBAC9C;qBAAM;oBACH,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,UAAU,EAAE,cAAc,CAAC,EAAE,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAA;iBAC7E;gBAED,oBAAoB;gBACpB,kCAAkC;gBAClC,qDAAqD;gBACrD,kDAAkD;gBAClD,gCAAgC;gBAChC,uDAAuD;gBAEvD,IAAI,CAAC,kCAAkC,EAAE,CAAA;gBACzC,OAAO,IAAI,CAAA;aACd;YACD,IAAI,MAAM,CAAC,WAAW,CAAC,UAAU,CAAC,EAAE;gBAChC,MAAM,IAAI,gBAAgB,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,cAAc,EAAE,MAAM,CAAC,CAAA;aACtE;SACJ;QACD,OAAO,KAAK,CAAA;IAChB,CAAC;IAEO,kCAAkC;QACtC,0DAA0D;QAC1D,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,eAAe,EAAE;YACzC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAA;SACpB;IACL,CAAC;IAED,QAAQ;QACJ,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,IAAI,KAAK,KAAK,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC/E,CAAC;CACJ;AAnFD,4DAmFC"}

package/dist/src/logic/ILayer0.d.ts

@@ -0,0 +1,13 @@
+import { DataEntry, ITransport, PeerDescriptor, PeerID, RecursiveFindResult } from '@streamr/dht';
+import { Any } from '../proto/google/protobuf/any';
+export interface ILayer0 extends ITransport {
+    getPeerDescriptor(): PeerDescriptor;
+    getNodeId(): PeerID;
+    getDataFromDht(key: Uint8Array): Promise<RecursiveFindResult>;
+    findDataViaPeer(key: Uint8Array, peer: PeerDescriptor): Promise<DataEntry[]>;
+    storeDataToDht(key: Uint8Array, data: Any): Promise<PeerDescriptor[]>;
+    deleteDataFromDht(key: Uint8Array): Promise<void>;
+    getKnownEntryPoints(): PeerDescriptor[];
+    isJoinOngoing(): boolean;
+    stop(): Promise<void>;
+}

package/dist/src/logic/ILayer0.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=ILayer0.js.map

package/dist/src/logic/ILayer0.js.map

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

package/dist/src/logic/IStreamNode.d.ts

@@ -0,0 +1,12 @@
+import { PeerIDKey } from '@streamr/dht';
+import { ProxyDirection, StreamMessage } from '../proto/packages/trackerless-network/protos/NetworkRpc';
+export interface IStreamNode {
+    on(event: 'message', listener: (message: StreamMessage) => void): this;
+    once(event: 'message', listener: (message: StreamMessage) => void): this;
+    off(event: 'message', listener: (message: StreamMessage) => void): void;
+    broadcast(msg: StreamMessage, previousPeer?: string): void;
+    hasProxyConnection(peerKey: PeerIDKey, direction: ProxyDirection): boolean;
+    stop(): void;
+    start(): Promise<void>;
+    getTargetNeighborStringIds(): string[];
+}

package/dist/src/logic/IStreamNode.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=IStreamNode.js.map

package/dist/src/logic/IStreamNode.js.map

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

package/dist/src/logic/PeerList.d.ts

@@ -0,0 +1,27 @@
+import { PeerDescriptor, PeerID } from '@streamr/dht';
+import { RemoteRandomGraphNode } from './RemoteRandomGraphNode';
+import { EventEmitter } from 'eventemitter3';
+export interface Events {
+    peerAdded: (id: string, remote: RemoteRandomGraphNode) => any;
+}
+export declare class PeerList extends EventEmitter<Events> {
+    private readonly peers;
+    private readonly limit;
+    private ownPeerID;
+    constructor(ownPeerId: PeerID, limit: number);
+    add(remote: RemoteRandomGraphNode): void;
+    remove(peerDescriptor: PeerDescriptor): void;
+    removeById(stringId: string): void;
+    hasPeer(peerDescriptor: PeerDescriptor): boolean;
+    hasPeerWithStringId(stringId: string): boolean;
+    replaceAll(neighbors: RemoteRandomGraphNode[]): void;
+    getStringIds(): string[];
+    getNeighborById(id: string): RemoteRandomGraphNode | undefined;
+    size(exclude?: string[]): number;
+    getRandom(exclude: string[]): RemoteRandomGraphNode | undefined;
+    getClosest(exclude: string[]): RemoteRandomGraphNode | undefined;
+    getClosestAndFurthest(exclude: string[]): RemoteRandomGraphNode[];
+    getFurthest(exclude: string[]): RemoteRandomGraphNode | undefined;
+    getPeers(): RemoteRandomGraphNode[];
+    stop(): void;
+}

package/dist/src/logic/PeerList.js

@@ -0,0 +1,84 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PeerList = void 0;
+const dht_1 = require("@streamr/dht");
+const lodash_1 = require("lodash");
+const eventemitter3_1 = require("eventemitter3");
+const getValuesOfIncludedKeys = (peers, exclude) => {
+    return Array.from(peers.entries())
+        .filter(([id, _peer]) => !exclude.includes(id))
+        .map(([_id, peer]) => peer);
+};
+class PeerList extends eventemitter3_1.EventEmitter {
+    constructor(ownPeerId, limit) {
+        super();
+        this.peers = new Map();
+        this.limit = limit;
+        this.ownPeerID = ownPeerId;
+    }
+    add(remote) {
+        if (!this.ownPeerID.equals((0, dht_1.peerIdFromPeerDescriptor)(remote.getPeerDescriptor())) && this.peers.size < this.limit) {
+            const stringId = (0, dht_1.keyFromPeerDescriptor)(remote.getPeerDescriptor());
+            const isExistingPeer = this.peers.has(stringId);
+            this.peers.set(stringId, remote);
+            if (!isExistingPeer) {
+                this.emit('peerAdded', stringId, remote);
+            }
+        }
+    }
+    remove(peerDescriptor) {
+        this.peers.delete((0, dht_1.keyFromPeerDescriptor)(peerDescriptor));
+    }
+    removeById(stringId) {
+        this.peers.delete(stringId);
+    }
+    hasPeer(peerDescriptor) {
+        return this.peers.has((0, dht_1.keyFromPeerDescriptor)(peerDescriptor));
+    }
+    hasPeerWithStringId(stringId) {
+        return this.peers.has(stringId);
+    }
+    replaceAll(neighbors) {
+        this.peers.clear();
+        const limited = neighbors.splice(0, this.limit);
+        limited.forEach((remote) => {
+            this.add(remote);
+        });
+    }
+    getStringIds() {
+        return Array.from(this.peers.keys());
+    }
+    getNeighborById(id) {
+        return this.peers.get(id);
+    }
+    size(exclude = []) {
+        return Array.from(this.peers.keys()).filter((peer) => !exclude.includes(peer)).length;
+    }
+    getRandom(exclude) {
+        return (0, lodash_1.sample)(getValuesOfIncludedKeys(this.peers, exclude));
+    }
+    getClosest(exclude) {
+        const included = getValuesOfIncludedKeys(this.peers, exclude);
+        return included[0];
+    }
+    getClosestAndFurthest(exclude) {
+        const included = getValuesOfIncludedKeys(this.peers, exclude);
+        if (included.length === 0) {
+            return [];
+        }
+        return included.length > 1 ? [this.getClosest(exclude), this.getFurthest(exclude)] : [this.getClosest(exclude)];
+    }
+    getFurthest(exclude) {
+        const included = getValuesOfIncludedKeys(this.peers, exclude);
+        return included[included.length - 1];
+    }
+    getPeers() {
+        return Array.from(this.peers.values());
+    }
+    stop() {
+        this.peers.clear();
+        this.removeAllListeners();
+    }
+}
+exports.PeerList = PeerList;
+//# sourceMappingURL=PeerList.js.map

package/dist/src/logic/PeerList.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PeerList.js","sourceRoot":"","sources":["../../../src/logic/PeerList.ts"],"names":[],"mappings":";;;AAAA,sCAAsG;AACtG,mCAA+B;AAE/B,iDAA4C;AAM5C,MAAM,uBAAuB,GAAG,CAAC,KAAyC,EAAE,OAAiB,EAA2B,EAAE;IACtH,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;SAC7B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;SAC9C,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAA;AACnC,CAAC,CAAA;AAED,MAAa,QAAS,SAAQ,4BAAoB;IAK9C,YAAY,SAAiB,EAAE,KAAa;QACxC,KAAK,EAAE,CAAA;QACP,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,EAAE,CAAA;QACtB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;QAClB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAA;IAC9B,CAAC;IAED,GAAG,CAAC,MAA6B;QAC7B,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAA,8BAAwB,EAAC,MAAM,CAAC,iBAAiB,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE;YAC9G,MAAM,QAAQ,GAAG,IAAA,2BAAqB,EAAC,MAAM,CAAC,iBAAiB,EAAE,CAAC,CAAA;YAClE,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;YAC/C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAA;YAEhC,IAAI,CAAC,cAAc,EAAE;gBACjB,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAA;aAC3C;SACJ;IACL,CAAC;IAED,MAAM,CAAC,cAA8B;QACjC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAA,2BAAqB,EAAC,cAAc,CAAC,CAAC,CAAA;IAC5D,CAAC;IAED,UAAU,CAAC,QAAgB;QACvB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAA;IAC/B,CAAC;IAED,OAAO,CAAC,cAA8B;QAClC,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAA,2BAAqB,EAAC,cAAc,CAAC,CAAC,CAAA;IAChE,CAAC;IAED,mBAAmB,CAAC,QAAgB;QAChC,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;IACnC,CAAC;IAED,UAAU,CAAC,SAAkC;QACzC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAA;QAClB,MAAM,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;QAC/C,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE;YACvB,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACpB,CAAC,CAAC,CAAA;IACN,CAAC;IAED,YAAY;QACR,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAA;IACxC,CAAC;IAED,eAAe,CAAC,EAAU;QACtB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;IAC7B,CAAC;IAED,IAAI,CAAC,UAAoB,EAAE;QACvB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAA;IACzF,CAAC;IAED,SAAS,CAAC,OAAiB;QACvB,OAAO,IAAA,eAAM,EAAC,uBAAuB,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAA;IAC/D,CAAC;IAED,UAAU,CAAC,OAAiB;QACxB,MAAM,QAAQ,GAAG,uBAAuB,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAA;QAC7D,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAA;IACtB,CAAC;IAED,qBAAqB,CAAC,OAAiB;QACnC,MAAM,QAAQ,GAAG,uBAAuB,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAA;QAC7D,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE;YACvB,OAAO,EAAE,CAAA;SACZ;QACD,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAE,EAAE,IAAI,CAAC,WAAW,CAAC,OAAO,CAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAE,CAAC,CAAA;IACtH,CAAC;IAED,WAAW,CAAC,OAAiB;QACzB,MAAM,QAAQ,GAAG,uBAAuB,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAA;QAC7D,OAAO,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IACxC,CAAC;IAED,QAAQ;QACJ,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAA;IAC1C,CAAC;IAED,IAAI;QACA,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAA;QAClB,IAAI,CAAC,kBAAkB,EAAE,CAAA;IAC7B,CAAC;CACJ;AA1FD,4BA0FC"}

package/dist/src/logic/RandomGraphNode.d.ts

@@ -0,0 +1,68 @@
+import { EventEmitter } from 'eventemitter3';
+import { DhtNode, PeerDescriptor, ListeningRpcCommunicator, ITransport, ConnectionLocker, PeerIDKey } from '@streamr/dht';
+import { StreamMessage } from '../proto/packages/trackerless-network/protos/NetworkRpc';
+import { PeerList } from './PeerList';
+import { IHandshaker } from './neighbor-discovery/Handshaker';
+import { Propagation } from './propagation/Propagation';
+import { INeighborFinder } from './neighbor-discovery/NeighborFinder';
+import { INeighborUpdateManager } from './neighbor-discovery/NeighborUpdateManager';
+import { IStreamNode } from './IStreamNode';
+import { ProxyStreamConnectionServer } from './proxy/ProxyStreamConnectionServer';
+import { IInspector } from './inspect/Inspector';
+import { TemporaryConnectionRpcServer } from './temporary-connection/TemporaryConnectionRpcServer';
+export interface Events {
+    message: (message: StreamMessage) => void;
+    targetNeighborConnected: (stringId: string) => void;
+    nearbyContactPoolIdAdded: () => void;
+}
+export interface StrictRandomGraphNodeConfig {
+    randomGraphId: string;
+    layer1: DhtNode;
+    P2PTransport: ITransport;
+    connectionLocker: ConnectionLocker;
+    ownPeerDescriptor: PeerDescriptor;
+    peerViewSize: number;
+    nearbyContactPool: PeerList;
+    randomContactPool: PeerList;
+    targetNeighbors: PeerList;
+    handshaker: IHandshaker;
+    neighborFinder: INeighborFinder;
+    neighborUpdateManager: INeighborUpdateManager;
+    propagation: Propagation;
+    rpcCommunicator: ListeningRpcCommunicator;
+    numOfTargetNeighbors: number;
+    maxNumberOfContacts: number;
+    minPropagationTargets: number;
+    name: string;
+    acceptProxyConnections: boolean;
+    neighborUpdateInterval: number;
+    inspector: IInspector;
+    temporaryConnectionServer: TemporaryConnectionRpcServer;
+    proxyConnectionServer?: ProxyStreamConnectionServer;
+}
+export declare class RandomGraphNode extends EventEmitter<Events> implements IStreamNode {
+    private stopped;
+    private started;
+    private readonly duplicateDetectors;
+    private config;
+    private readonly server;
+    constructor(config: StrictRandomGraphNodeConfig);
+    start(): Promise<void>;
+    private registerDefaultServerMethods;
+    private newContact;
+    private removedContact;
+    private newRandomContact;
+    private removedRandomContact;
+    private onPeerDisconnected;
+    private getNewNeighborCandidates;
+    hasProxyConnection(peerKey: PeerIDKey): boolean;
+    stop(): void;
+    broadcast(msg: StreamMessage, previousPeer?: string): void;
+    inspect(peerDescriptor: PeerDescriptor): Promise<boolean>;
+    private getPropagationTargets;
+    getOwnStringId(): PeerIDKey;
+    getNumberOfOutgoingHandshakes(): number;
+    getTargetNeighborStringIds(): string[];
+    getNearbyContactPoolIds(): string[];
+    getRandomContactPoolIds(): string[];
+}