Arguably Adequate Aqueduct Algorithm: Crossing A Bridge-Less Block-Chain Chasm
- URL: http://arxiv.org/abs/2311.10717v1
- Date: Tue, 12 Sep 2023 03:24:57 GMT
- Title: Arguably Adequate Aqueduct Algorithm: Crossing A Bridge-Less Block-Chain Chasm
- Authors: Ravi Kashyap,
- Abstract summary: We discuss the need for blockchain bridges to facilitate fund flows across platforms.
We develop an algorithm that dynamically changes the utilization of bridge capacities and hence the amounts to be transferred across networks.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We consider the problem of being a cross-chain wealth management platform with deposits, redemptions and investment assets across multiple networks. We discuss the need for blockchain bridges to facilitates fund flows across platforms. We point out several issues with existing bridges. We develop an algorithm - tailored to overcome current constraints - that dynamically changes the utilization of bridge capacities and hence the amounts to be transferred across networks. We illustrate several scenarios using numerical simulations.
Related papers
- SmartAxe: Detecting Cross-Chain Vulnerabilities in Bridge Smart Contracts via Fine-Grained Static Analysis [28.420618636956924]
Cross-chain bridge is a decentralized application for asset exchange across different blockchain platforms.
There are a number of recent security incidents with heavy financial losses caused by vulnerabilities in bridge smart contracts.
We propose SmartAxe, a new framework to identify vulnerabilities in cross-chain bridge smart contracts.
arXiv Detail & Related papers (2024-06-23T03:25:27Z) - On Replacing Cryptopuzzles with Useful Computation in Blockchain Proof-of-Work Protocols [0.12289361708127873]
Researchers have been pursuing the idea of replacing cryptopuzzles with useful computing tasks for over a decade.
We provide insight into the effect of introducing "usefulness" and of transitioning to task classes other than cryptopuzzles.
We discuss pertinent techniques and present research gaps in the current state-of-the-art.
arXiv Detail & Related papers (2024-04-24T08:49:41Z) - An attempt to generate new bridge types from latent space of generative
adversarial network [2.05750372679553]
Symmetric structured image dataset of three-span beam bridge, arch bridge, cable-stayed bridge and suspension bridge are used.
Based on Python programming language, and Keras deep learning platform framework, generative adversarial network is constructed and trained.
arXiv Detail & Related papers (2024-01-01T08:46:29Z) - SoK: Security of Cross-chain Bridges: Attack Surfaces, Defenses, and Open Problems [43.80265187232706]
Cross-chain bridges are used to facilitate token and data exchanges across blockchains.
Although bridges are becoming increasingly popular, they are still in their infancy and have been attacked multiple times recently.
This paper analyzes the security landscape of cross-chain bridges in a holistic manner.
arXiv Detail & Related papers (2023-12-19T20:13:21Z) - MBQuant: A Novel Multi-Branch Topology Method for Arbitrary Bit-width Network Quantization [51.85834744835766]
We propose MBQuant, a novel method for arbitrary bit-width quantization.
We show that MBQuant achieves significant performance gains compared to existing arbitrary bit-width quantization methods.
arXiv Detail & Related papers (2023-05-14T10:17:09Z) - Energy Regularized RNNs for Solving Non-Stationary Bandit Problems [97.72614340294547]
We present an energy term that prevents the neural network from becoming too confident in support of a certain action.
We demonstrate that our method is at least as effective as methods suggested to solve the sub-problem of Rotting Bandits.
arXiv Detail & Related papers (2023-03-12T03:32:43Z) - Blockchain Framework for Artificial Intelligence Computation [1.8148198154149393]
We design the block verification and consensus mechanism as a deep reinforcement-learning process.
Our method is used to design the next generation of public blockchain networks.
arXiv Detail & Related papers (2022-02-23T01:44:27Z) - Routing with Self-Attention for Multimodal Capsule Networks [108.85007719132618]
We present a new multimodal capsule network that allows us to leverage the strength of capsules in the context of a multimodal learning framework.
To adapt the capsules to large-scale input data, we propose a novel routing by self-attention mechanism that selects relevant capsules.
This allows not only for robust training with noisy video data, but also to scale up the size of the capsule network compared to traditional routing methods.
arXiv Detail & Related papers (2021-12-01T19:01:26Z) - All at Once Network Quantization via Collaborative Knowledge Transfer [56.95849086170461]
We develop a novel collaborative knowledge transfer approach for efficiently training the all-at-once quantization network.
Specifically, we propose an adaptive selection strategy to choose a high-precision enquoteteacher for transferring knowledge to the low-precision student.
To effectively transfer knowledge, we develop a dynamic block swapping method by randomly replacing the blocks in the lower-precision student network with the corresponding blocks in the higher-precision teacher network.
arXiv Detail & Related papers (2021-03-02T03:09:03Z) - A Non-Stationary Bandit-Learning Approach to Energy-Efficient
Femto-Caching with Rateless-Coded Transmission [98.47527781626161]
We study a resource allocation problem for joint caching and transmission in small cell networks.
We then formulate the problem as to select a file from the cache together with a transmission power level for every broadcast round.
In contrast to the state-of-the-art research, the proposed approach is especially suitable for networks with time-variant statistical properties.
arXiv Detail & Related papers (2020-04-13T09:07:17Z)
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.