Boosting Payment Channel Network Liquidity with Topology Optimization and Transaction Selection

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F25%3A00390071" target="_blank" >RIV/68407700:21240/25:00390071 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.4230/LIPIcs.DISC.2025.23" target="_blank" >https://doi.org/10.4230/LIPIcs.DISC.2025.23</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.4230/LIPIcs.DISC.2025.23" target="_blank" >10.4230/LIPIcs.DISC.2025.23</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Boosting Payment Channel Network Liquidity with Topology Optimization and Transaction Selection

Popis výsledku v původním jazyce

Payment channel networks (PCNs) are a promising technology that alleviates blockchain scalability by shifting the transaction load from the blockchain to the PCN. Nevertheless, the network topology has to be carefully designed to maximise the transaction throughput in PCNs. Additionally, users in PCNs also have to make optimal decisions on which transactions to forward and which to reject to prolong the lifetime of their channels. In this work, we consider an input sequence of transactions over parties. Each transaction consists of a transaction size, source, and target, and can be either accepted or rejected (entailing a cost). The goal is to design a PCN topology among the cooperating parties, along with the channel capacities, and then output a decision for each transaction in the sequence to minimise the cost of creating and augmenting channels, as well as the cost of rejecting transactions. Our main contribution is an approximation algorithm for the problem with parties. We further show that with some assumptions on the distribution of transactions, we can reduce the approximation ratio to . We complement our theoretical analysis with an empirical study of our assumptions and approach in the context of the Lightning Network.

Název v anglickém jazyce

Boosting Payment Channel Network Liquidity with Topology Optimization and Transaction Selection

Popis výsledku anglicky

Payment channel networks (PCNs) are a promising technology that alleviates blockchain scalability by shifting the transaction load from the blockchain to the PCN. Nevertheless, the network topology has to be carefully designed to maximise the transaction throughput in PCNs. Additionally, users in PCNs also have to make optimal decisions on which transactions to forward and which to reject to prolong the lifetime of their channels. In this work, we consider an input sequence of transactions over parties. Each transaction consists of a transaction size, source, and target, and can be either accepted or rejected (entailing a cost). The goal is to design a PCN topology among the cooperating parties, along with the channel capacities, and then output a decision for each transaction in the sequence to minimise the cost of creating and augmenting channels, as well as the cost of rejecting transactions. Our main contribution is an approximation algorithm for the problem with parties. We further show that with some assumptions on the distribution of transactions, we can reduce the approximation ratio to . We complement our theoretical analysis with an empirical study of our assumptions and approach in the context of the Lightning Network.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2025

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

39th International Symposium on Distributed Computing (DISC 2025)

ISBN

978-3-95977-402-4

ISSN

—

e-ISSN

—

Počet stran výsledku

22

Strana od-do

"23:1"-"23:22"

Název nakladatele

Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik

Místo vydání

Dagstuhl

Místo konání akce

Ihnestr. 16-20 - 14195 Berlin

Datum konání akce

27. 10. 2025

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—