Pith. sign in

REVIEW 1 cited by

Lightning Creation Games

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2306.16006 v1 pith:XW5X4G5I submitted 2023-06-28 cs.GT cs.CR

classification cs.GTcs.CR
keywords channelnetworkpaymentuserconnectedcreationexpectedfunction
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Payment channel networks (PCNs) are a promising solution to the scalability problem of cryptocurrencies. Any two users connected by a payment channel in the network can theoretically send an unbounded number of instant, costless transactions between them. Users who are not directly connected can also transact with each other in a multi-hop fashion. In this work, we study the incentive structure behind the creation of payment channel networks, particularly from the point of view of a single user that wants to join the network. We define a utility function for a new user in terms of expected revenue, expected fees, and the cost of creating channels, and then provide constant factor approximation algorithms that optimise the utility function given a certain budget. Additionally, we take a step back from a single user to the whole network and examine the parameter spaces under which simple graph topologies form a Nash equilibrium.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Boosting Payment Channel Network Liquidity with Topology Optimization and Transaction Selection

    cs.DC 2025-08 conditional novelty 6.0 of 10

    A joint topology-optimization and transaction-selection problem for payment channel networks is approximated within O(p), and within O(sqrt(p)) under a stochastic-block-model clustering assumption.

Pith tools