Wrapless: The trustless lending protocol on top of Bitcoin
- URL: http://arxiv.org/abs/2507.06064v3
- Date: Thu, 07 Aug 2025 13:32:08 GMT
- Title: Wrapless: The trustless lending protocol on top of Bitcoin
- Authors: Oleksandr Kurbatov, Kyrylo Baibula, Yaroslava Chopa, Sergey Kozlov, Oleh Komendant, Illia Dovhopolyi, Dmitrii Kurbatov, Zakhar Naumets, Yuliia Aritkulova, Pavel Kravchenko, Volodymyr Dubinin, Lasha Antadze, Yaroslav Panasenko, Mykhailo Velykodnyi,
- Abstract summary: Wrapless is a lending protocol that enables the collateralization of bitcoins without requiring a trusted wrapping mechanism.<n>The protocol facilitates a "loan channel" on the Bitcoin blockchain, allowing bitcoins to be locked as collateral for loans issued on any blockchain that supports Turing-complete smart contracts.
- Score: 10.898138943807599
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This paper presents Wrapless -- a lending protocol that enables the collateralization of bitcoins without requiring a trusted wrapping mechanism. The protocol facilitates a "loan channel" on the Bitcoin blockchain, allowing bitcoins to be locked as collateral for loans issued on any blockchain that supports Turing-complete smart contracts. The protocol is designed in a way that makes it economically irrational for each involved party to manipulate the loan rules. There is still a significant research area to bring the protocol closer to traditional AMM financial instruments.
Related papers
- Novel Blockchain-based Protocols for Electronic Voting and Auctions [0.0]
We consider several decentralized protocols to be built on blockchains, specifically using smart contracts on smart contracts.<n>We proposed a new approach called Blind Vote, which is untraceable, secure, efficient, secrecy-preserving, and fully on-chain electronic voting protocol.<n>On the other hand, we propose a new family of algorithms for private, trustless auctions that protect bidder identities and bid values.
arXiv Detail & Related papers (2025-07-04T02:26:04Z) - Emulating OP_RAND in Bitcoin [20.069861855710325]
This paper proposes a method of emulation of verb|OP_RAND| opcode on Bitcoin through a trustless interactive game between transaction counterparties.<n>The protocol can be organized in a way unrecognizable to any external party and doesn't require some specific scripts or Bitcoin protocol updates.
arXiv Detail & Related papers (2025-01-27T19:16:04Z) - Privacy-Preserving Smart Contracts for Permissioned Blockchains: A zk-SNARK-Based Recipe Part-1 [1.7265013728931]
This work proposes a solution utilizing zk-SNARKs to provide privacy in smart contracts and blockchains.<n>The proposal includes a new type of transactions, called delegated transactions, which enable use cases like Delivery vs Payment (DvP)
arXiv Detail & Related papers (2025-01-06T21:16:33Z) - Remote Staking with Optimal Economic Safety [9.685926828113631]
We introduce remote staking as a technique that allows Bitcoin holders to use their idle assets to secure PoS chains.<n>In the event of a safety violation on the PoS chain, at least one-third of the Bitcoin stake securing the chain is slashed.<n>A version of this protocol was deployed to mainnet in August 2024 and has since accumulated over 4.1 billion USD worth of staked bitcoins.
arXiv Detail & Related papers (2024-08-04T01:39:06Z) - The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.<n>Our measurements from the Aptos mainnet show that the optimistic approach reduces latency overhead by 71%.
arXiv Detail & Related papers (2024-07-16T20:53:04Z) - IT Strategic alignment in the decentralized finance (DeFi): CBDC and digital currencies [49.1574468325115]
Decentralized finance (DeFi) is a disruptive-based financial infrastructure.
This paper seeks to answer two main questions 1) What are the common IT elements in the DeFi?
And 2) How the elements to the IT strategic alignment in DeFi?
arXiv Detail & Related papers (2024-05-17T10:19:20Z) - How To Save Fees in Bitcoin Smart Contracts: a Simple Optimistic Off-chain Protocol [0.40964539027092906]
We consider the execution of smart contracts on Bitcoin.<n>We introduce a protocol that moves most of the execution of a Bitcoin contract off-chain.
arXiv Detail & Related papers (2024-03-14T21:20:36Z) - VeryFL: A Verify Federated Learning Framework Embedded with Blockchain [30.220495996821384]
Various blockchain-based federated learning algorithm, architecture and mechanism have been designed to solve issues like single point failure and data falsification.
Various centralized federated learning frameworks like FedML, have emerged in the community to help boost the research on FL.
Inspired by the above issues, we have designed and developed a blockchain-based federated learning framework by embedding network.
arXiv Detail & Related papers (2023-11-27T08:28:08Z) - Bitcoin-Enhanced Proof-of-Stake Security: Possibilities and Impossibilities [45.90740335615872]
Bitcoin is the most secure blockchain in the world, supported by the immense hash power of its Proof-of-Work miners.<n>Proof-of-Stake chains are energy-efficient, have fast finality but face several security issues.<n>We show that these security issues are inherent in any PoS chain without an external trusted source.<n>We propose a new protocol, Babylon, where an off-the-shelf PoS protocol checkpoints onto Bitcoin to resolve these issues.
arXiv Detail & Related papers (2022-07-18T06:01:25Z) - Quantum-resistance in blockchain networks [46.63333997460008]
This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Quantum Computing (CQC), and Tecnologico de Monterrey to identify and eliminate quantum threats in blockchain networks.
The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms.
arXiv Detail & Related papers (2021-06-11T23:39:25Z) - Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's
Post-Quantum Security [67.06003361150228]
A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task.
In this work, we examine the hardness of finding such chain of PoWs against quantum strategies.
We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
arXiv Detail & Related papers (2020-12-30T18:03:56Z)
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.