How To Save Fees in Bitcoin Smart Contracts: a Simple Optimistic Off-chain Protocol
- URL: http://arxiv.org/abs/2403.09880v2
- Date: Mon, 29 Apr 2024 11:47:27 GMT
- Title: How To Save Fees in Bitcoin Smart Contracts: a Simple Optimistic Off-chain Protocol
- Authors: Dario Maddaloni, Riccardo Marchesin, Roberto Zunino,
- Abstract summary: We consider the execution of smart contracts on Bitcoin.
We introduce a protocol that moves most of the execution of a Bitcoin contract off-chain.
- Score: 0.40964539027092906
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We consider the execution of smart contracts on Bitcoin. There, every contract step corresponds to appending to the blockchain a new transaction that spends the output representing the old contract state, creating a new one for the updated state. This standard procedure requires the contract participants to pay transaction fees for every execution step. In this paper, we introduce a protocol that moves most of the execution of a Bitcoin contract off-chain. When all participants follow this protocol, they are able to save on transaction fees. By contrast, in the presence of adversaries, any honest participant is still able to enforce the correct execution of the contract, according to its original semantics.
Related papers
- 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.
Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol.
We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
arXiv Detail & Related papers (2024-07-16T20:53:04Z) - Towards Secure and Trusted-by-Design Smart Contracts [0.3499870393443268]
Evidential transactions involve the exchange of any form of physical evidence, such as money, birth certificate, visas, tickets, etc.
Most of the time, evidential transactions occur in the context of complex procedures, called evidential protocols, among physical agents.
The blockchain provides the mechanisms to transfer evidence, while smart contracts allow encoding evidential protocols on top of a blockchain.
As a smart contract foregoes trusted third-parties and runs on several machines anonymously, it constitutes a highly critical program that has to be secure and trusted-by-design.
arXiv Detail & Related papers (2024-03-25T16:14:22Z) - Lazy Contracts: Alleviating High Gas Costs by Secure and Trustless Off-chain Execution of Smart Contracts [0.0]
In most programmable blockchains, the notion of gas is introduced to prevent DoS attacks.
A fixed cost to each atomic operation, and the initiator of a function call pays the total gas cost as a transaction fee.
This thesis proposes "lazy contracts" as a solution to alleviate these costs.
arXiv Detail & Related papers (2023-09-20T13:41:45Z) - Masquerade: Simple and Lightweight Transaction Reordering Mitigation in Blockchains [5.690884793952696]
We propose an MEV aware protocol design called Masquerade to increase user satisfaction and confidence in the system.
We introduce the notion of a "token" to mitigate the actions taken by an adversary in an attack scenario.
arXiv Detail & Related papers (2023-08-29T14:42:43Z) - Secure compilation of rich smart contracts on poor UTXO blockchains [0.8192907805418581]
We present ILLUM, an Intermediate-Level Language for the UTXO Model.
We define a compiler from ILLUM to a bare-bone UTXO blockchain with loop-free scripts.
We exploit covenants, a mechanism for preserving scripts along chains of transactions.
arXiv Detail & Related papers (2023-05-16T15:40:18Z) - An Empirical Study on Real Bug Fixes from Solidity Smart Contract
Projects [37.39791127265096]
We conduct an empirical study on historical bug fixes from 46 real-world Solidity smart contract projects.
We distill four findings during the process to explore these four questions.
We provide actionable implications to improve the current approaches to fixing bugs in Solidity smart contracts.
arXiv Detail & Related papers (2022-10-21T14:26:53Z) - Light Clients for Lazy Blockchains [12.330989180881701]
We devise a protocol that enables the creation of efficient light clients for lazy blockchains.
Our construction is based on a bisection game that traverses the Merkle tree containing the ledger of all - valid or invalid - transactions.
arXiv Detail & Related papers (2022-03-30T00:58:40Z) - Detecting Logical Relation In Contract Clauses [94.85352502638081]
We develop an approach to automate the extraction of logical relations between clauses in a contract.
The resulting approach should help contract authors detecting potential logical conflicts between clauses.
arXiv Detail & Related papers (2021-11-02T19:26:32Z) - ContractNLI: A Dataset for Document-level Natural Language Inference for
Contracts [39.75232199445175]
We propose "document-level natural language inference (NLI) for contracts"
A system is given a set of hypotheses and a contract, and it is asked to classify whether each hypothesis is "entailed by", "contradicting to" or "not mentioned by" (neutral to) the contract.
We release the largest corpus to date consisting of 607 annotated contracts.
arXiv Detail & Related papers (2021-10-05T03:22:31Z) - Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback [46.30924494799245]
We develop Ditto, a Byzantine SMR protocol that enjoys the best of both worlds: optimal communication on and off the happy path and progress guarantee under asynchrony and DDoS attacks.
Specifically, we start from HotStuff, a state-of-the-art linear protocol, and gradually build Ditto. As a separate contribution and an intermediate step, we design a 2-chain version of HotStuff, Jolteon.
We implement and experimentally evaluate all our systems. Notably, Jolteon's commit latency outperforms HotStuff by 200-300ms with varying system size.
arXiv Detail & Related papers (2021-06-18T21:34:17Z) - 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.