Metraipolis › archive › dc_e9deb97fc070

Scalable Exact Path Selection via Structure-Aware Search for Virtual Payment Channels — arXiv:2608.22276

Source: arXiv (en)
Original: https://arxiv.org/abs/2608.22276
License (as archived): CC0-1.0
Archived: 2026-10-18T07:50:11.167Z
SHA-256 of the archived text: 290dd623ae7065e8b502773006f1529170f5d5558d53110e9e9f8586c3ef2bf0
Stable URL of this page: https://metraipolis.com/documento/dc_e9deb97fc070

How to cite

Scalable Exact Path Selection via Structure-Aware Search for Virtual Payment Channels — arXiv:2608.22276 — arXiv (en), https://arxiv.org/abs/2608.22276 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e9deb97fc070 (Metraipolis archive dc_e9deb97fc070, sha256 290dd623ae7065e8b502773006f1529170f5d5558d53110e9e9f8586c3ef2bf0)

BibTeX

@misc{dce9deb97fc070,
  title = {Scalable Exact Path Selection via Structure-Aware Search for Virtual Payment Channels — arXiv:2608.22276},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.22276},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e9deb97fc070; sha256 290dd623ae7065e8b502773006f1529170f5d5558d53110e9e9f8586c3ef2bf0},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.22276. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Virtual Payment Channels (VPCs) enable efficient off-chain transactions in Payment Channel Networks (PCNs), but their performance depends on selecting high-quality underlying paths. Existing approaches either rely on simplified metrics or incur high computational cost. We study VPC path selection under generalized monotone metrics and propose a structure-aware exact solver based on quadtree search. By exploiting monotonicity and distance plateau properties, our method prunes large regions of the capacity-constrained search space while preserving optimality, significantly reducing the number of shortest-path computations. We further instantiate the framework with a composite metric that integrates economic cost and security risk, enabling flexible trade-offs across application scenarios. Experiments on synthetic graphs and real-world Lightning Network topologies (up to 12,552 nodes) show 2--5 orders of magnitude speedup over prior work, with consistent sub-100ms latency.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-25 in cs.DC).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC).
Pagina del lavoro: https://arxiv.org/abs/2608.22276 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T07:47:32.949Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).