Hypergraph based Multi-Party Payment Channel

• URL: http://arxiv.org/abs/2512.11775v1
• Date: Fri, 12 Dec 2025 18:37:28 GMT
• Title: Hypergraph based Multi-Party Payment Channel
• Authors: Ayush Nainwal, Atharva Kamble, Nitin Awathare,
• Abstract summary: We introduce Hypergraph-based Multi-Party Payment Channels (H-MPCs)<n>MPCs replace bilateral channels with collectively funded hyperedges.<n>Our implementation on a 150-node network demonstrates a transaction success rate of approximately 94%.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Public blockchains inherently offer low throughput and high latency, motivating off-chain scalability solutions such as Payment Channel Networks (PCNs). However, existing PCNs suffer from liquidity fragmentation-funds locked in one channel cannot be reused elsewhere-and channel depletion, both of which limit routing efficiency and reduce transaction success rates. Multi-party channel (MPC) constructions mitigate these issues, but they typically rely on leaders or coordinators, creating single points of failure and providing only limited flexibility for inter-channel payments. We introduce Hypergraph-based Multi-Party Payment Channels (H-MPCs), a new off-chain construction that replaces bilateral channels with collectively funded hyperedges. These hyperedges enable fully concurrent, leaderless intra- and inter-hyperedge payments through verifiable, proposer-ordered DAG updates, offering significantly greater flexibility and concurrency than prior designs. Our implementation on a 150-node network demonstrates a transaction success rate of approximately 94% without HTLC expiry or routing failures, highlighting the robustness of H-MPCs.

Related papers

• Blockchain-Enabled Routing for Zero-Trust Low-Altitude Intelligent Networks [77.17664010626726]
  We focus on the routing with multiple UAV clusters in low-altitude intelligent networks (LAINs)<n>To minimize the damage caused by potential threats, we present the zero-trust architecture with the software-defined perimeter and blockchain techniques.<n>We show that the proposed framework reduces the average E2E delay by 59% and improves the TSR by 29% on average compared to benchmarks.
  arXiv  Detail & Related papers  (2026-02-27T04:30:35Z)
• A Proof of Success and Reward Distribution Protocol for Multi-bridge Architecture in Cross-chain Communication [3.6704226968275253]
  This paper proposes Proof of Success and Reward Distribution (PSCRD), a novel multi-bridge response coordination and incentive distribution protocol.<n> PSCRD introduces a fair reward distribution system that equitably distributes the transfer fee among participating bridges.<n>The purpose is to encourage bridge participation for higher decentralization and lower single-point-of-failure risks.
  arXiv  Detail & Related papers  (2025-12-11T14:15:36Z)
• Starfish: Rebalancing Multi-Party Off-Chain Payment Channels [23.267347756758618]
  We propose Starfish, a rebalancing approach that captures the star-shaped network structure to provide high rebalancing efficiency and large channel capacity.<n>Starfish requires only $N$-time on-chain operations to connect independent channels and aggregate the total budget of all channels.
  arXiv  Detail & Related papers  (2025-04-29T08:30:33Z)
• Zaptos: Towards Optimal Blockchain Latency [52.30047458198369]
  We introduce Zaptos, a parallel pipelined architecture designed to minimize end-to-end latency.<n>Zaptos achieves a throughput of 20,000 transactions per second with sub-second latency.
  arXiv  Detail & Related papers  (2025-01-18T00:22:22Z)
• Your Trust, Your Terms: A General Paradigm for Near-Instant Cross-Chain Transfer [26.61748905524824]
  We introduce the Delegated Ownership Transfer (DOT) paradigm to enable secure, high-performance cross-chain payments.<n>DOT decouples key ownership from value ownership to enable secure, high-performance cross-chain payments.<n>Our prototype shows that cross-chain payments complete in under 16.70 ms and atomic swaps in under 33.09 ms, with costs fully decoupled from Layer-1 gas fees.
  arXiv  Detail & Related papers  (2024-03-22T13:21:09Z)
• Deep Reinforcement Learning-based Rebalancing Policies for Profit Maximization of Relay Nodes in Payment Channel Networks [7.168126766674749]
  We study how a relay node can maximize its profits from fees by using the rebalancing method of submarine swaps. We formulate the problem of the node's fortune over time over all rebalancing policies, and approximate the optimal solution by designing a Deep Reinforcement Learning-based rebalancing policy.
  arXiv  Detail & Related papers  (2022-10-13T19:11:10Z)
• High fidelity two-qubit gates on fluxoniums using a tunable coupler [47.187609203210705]
  Superconducting fluxonium qubits provide a promising alternative to transmons on the path toward large-scale quantum computing. A major challenge for multi-qubit fluxonium devices is the experimental demonstration of a scalable crosstalk-free multi-qubit architecture. Here, we present a two-qubit fluxonium-based quantum processor with a tunable coupler element.
  arXiv  Detail & Related papers  (2022-03-30T13:44:52Z)
• Low-Latency Federated Learning over Wireless Channels with Differential Privacy [142.5983499872664]
  In federated learning (FL), model training is distributed over clients and local models are aggregated by a central server. In this paper, we aim to minimize FL training delay over wireless channels, constrained by overall training performance as well as each client's differential privacy (DP) requirement.
  arXiv  Detail & Related papers  (2021-06-20T13:51:18Z)
• Decentralized Learning for Channel Allocation in IoT Networks over Unlicensed Bandwidth as a Contextual Multi-player Multi-armed Bandit Game [134.88020946767404]
  We study a decentralized channel allocation problem in an ad-hoc Internet of Things network underlaying on the spectrum licensed to a primary cellular network. Our study maps this problem into a contextual multi-player, multi-armed bandit game, and proposes a purely decentralized, three-stage policy learning algorithm through trial-and-error.
  arXiv  Detail & Related papers  (2020-03-30T10:05:35Z)
• Channel Equilibrium Networks for Learning Deep Representation [63.76618960820138]
  This work shows that the combination of normalization and rectified linear function leads to inhibited channels. Unlike prior arts that simply removed the inhibited channels, we propose to "wake them up" during training by designing a novel neural building block. Channel Equilibrium (CE) block enables channels at the same layer to contribute equally to the learned representation.
  arXiv  Detail & Related papers  (2020-02-29T09:02:31Z)
• Discrimination-aware Network Pruning for Deep Model Compression [79.44318503847136]
  Existing pruning methods either train from scratch with sparsity constraints or minimize the reconstruction error between the feature maps of the pre-trained models and the compressed ones. We propose a simple-yet-effective method called discrimination-aware channel pruning (DCP) to choose the channels that actually contribute to the discriminative power. Experiments on both image classification and face recognition demonstrate the effectiveness of our methods.
  arXiv  Detail & Related papers  (2020-01-04T07:07:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.