machankura/mempool
3
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Move max cpfp graph size to named const

Browse Source
This commit is contained in:
Mononaut 2024-01-06 22:41:03 +00:00
parent 0533953f54
commit b10bd05207
No known key found for this signature in database
GPG Key ID: A3F058E41374C04E
1 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
backend/src/api/cpfp.ts
View File

@ -1,6 +1,7 @@
import { CpfpInfo, MempoolTransactionExtended } from '../mempool.interfaces'; import { CpfpInfo, MempoolTransactionExtended } from '../mempool.interfaces';
const CPFP_UPDATE_INTERVAL = 60_000; // update CPFP info at most once per 60s per transaction const CPFP_UPDATE_INTERVAL = 60_000; // update CPFP info at most once per 60s per transaction
const MAX_GRAPH_SIZE = 50; // the maximum number of in-mempool relatives to consider
interface GraphTx extends MempoolTransactionExtended { interface GraphTx extends MempoolTransactionExtended {
depends: string[]; depends: string[];
@ -92,13 +93,13 @@ function mempoolToGraphTx(tx: MempoolTransactionExtended): GraphTx {
} }
/** /**
* Takes a map of transaction ancestors, and expands it into a full graph of up to 50 in-mempool relatives * Takes a map of transaction ancestors, and expands it into a full graph of up to MAX_GRAPH_SIZE in-mempool relatives
*/ */
function expandRelativesGraph(mempool: { [txid: string]: MempoolTransactionExtended }, ancestors: Map<string, GraphTx>): Map<string, GraphTx> { function expandRelativesGraph(mempool: { [txid: string]: MempoolTransactionExtended }, ancestors: Map<string, GraphTx>): Map<string, GraphTx> {
const relatives: Map<string, GraphTx> = new Map(); const relatives: Map<string, GraphTx> = new Map();
const stack: GraphTx[] = Array.from(ancestors.values()); const stack: GraphTx[] = Array.from(ancestors.values());
while (stack.length > 0) { while (stack.length > 0) {
if (relatives.size > 50) { if (relatives.size > MAX_GRAPH_SIZE) {
return relatives; return relatives;
} }
@ -170,7 +171,7 @@ function calculateCpfpCluster(txid: string, graph: Map<string, GraphTx>): Map<st
let sortedRelatives = Array.from(graph.values()).sort(mempoolComparator); let sortedRelatives = Array.from(graph.values()).sort(mempoolComparator);
// Iterate until we reach a cluster that includes our target tx // Iterate until we reach a cluster that includes our target tx
let maxIterations = 50; let maxIterations = MAX_GRAPH_SIZE;
let best = sortedRelatives.shift(); let best = sortedRelatives.shift();
let bestCluster = new Map<string, GraphTx>(best?.ancestorMap?.entries() || []); let bestCluster = new Map<string, GraphTx>(best?.ancestorMap?.entries() || []);
while (sortedRelatives.length && best && (best.txid !== tx.txid && !best.ancestorMap.has(tx.txid)) && maxIterations > 0) { while (sortedRelatives.length && best && (best.txid !== tx.txid && !best.ancestorMap.has(tx.txid)) && maxIterations > 0) {
@ -236,7 +237,7 @@ function calculateCpfpCluster(txid: string, graph: Map<string, GraphTx>): Map<st
*/ */
function setAncestors(tx: GraphTx, all: Map<string, GraphTx>, visited: Map<string, Map<string, GraphTx>>, depth: number = 0): Map<string, GraphTx> { function setAncestors(tx: GraphTx, all: Map<string, GraphTx>, visited: Map<string, Map<string, GraphTx>>, depth: number = 0): Map<string, GraphTx> {
// sanity check for infinite recursion / too many ancestors (should never happen) // sanity check for infinite recursion / too many ancestors (should never happen)
if (depth > 50) { if (depth > MAX_GRAPH_SIZE) {
return tx.ancestorMap; return tx.ancestorMap;
} }