Non-Interactive Proofs of Proof-of-Work

@article{Kiayias2017NonInteractivePO,
  title={Non-Interactive Proofs of Proof-of-Work},
  author={A. Kiayias and Andrew K. Miller and Dionysis Zindros},
  journal={IACR Cryptol. ePrint Arch.},
  year={2017},
  volume={2017},
  pages={963}
}
Decentralized consensus protocols based on proof-of-work (PoW) mining require nodes to download data linear in the size of the blockchain even if they make use of Simplified Payment Verification (SPV). In this work, we put forth a new formalization of proof-of-work verification by introducing a primitive called Non-Interactive Proofs of Proof-of-Work (NIPoPoWs). We improve upon the previously known SPV NIPoPoW by proposing a novel NIPoPoW construction using superblocks, blocks that are much… Expand
Proof of Necessary Work: Succinct State Verification with Fairness Guarantees
TLDR
This work proposes a new distributed payment system which uses Incrementally Verifiable Computation (IVC) to enable constant-time verification and introduces the notion of Proof of Necessary Work (PoNW), in which proof generation is an integral part of the proof-of-work used in Nakamoto consensus. Expand
Superlight – A Permissionless, Light-client Only Blockchain with Self-Contained Proofs and BLS Signatures
  • R. Blum, T. Bocek
  • Computer Science
  • 2019 IFIP/IEEE Symposium on Integrated Network and Service Management (IM)
  • 2019
TLDR
This work presents the concept Superlight with self-contained proofs, which is designed to improve scalability of a public blockchain, while preserving security and decentralization. Expand
zkRelay: Facilitating Sidechains using zkSNARK-based Chain-Relays
TLDR
This work proposes the utilization of off-chain computations through zkSNARKs to provide a cryptographically secure and highly scalable sidechain mechanism that requires constant verification costs and releases the target ledger from processing and storing every single block header of the source blockchain. Expand
CoVer: Collaborative Light-Node-Only Verification and Data Availability for Blockchains
TLDR
CoVer is proposed, a decentralized protocol that allows a group of light nodes to collaboratively verify blocks even under a dishonest majority, achieving the same level of security for block validation as full nodes while only requiring a fraction of the work. Expand
Weight-Based Nakamoto-Style Blockchains
We propose a framework for building Nakamoto-style proof-of-work blockchains where blocks are treated differently in the “longest chain rule”. The crucial parameter is a weight function assigningExpand
The Velvet Path to Superlight Blockchain Clients
TLDR
This paper investigates how a blockchain can be upgraded to support superblock clients without a soft fork and shows that it is possible to implement the needed changes without modifying the consensus protocol and by requiring only a minority of miners to upgrade, a process termed a “velvet fork” in the literature. Expand
Proof-of-Work Sidechains
TLDR
This paper puts forth the first side chains construction that allows communication between proof-of-work blockchains without trusted intermediaries, and uses a recently introduced cryptographic primitive, Non-Interactive Proofs of Proof- of-Work (NIPoPoWs). Expand
Flux: Revisiting Near Blocks for Proof-of-Work Blockchains
TLDR
Flux is presented, a protocol extension for proof-of-work blockchains that leverages on near blocks, a new block reward distribution mechanism, and an improved branch selection policy to incentivize honest participation of miners. Expand
A Gas-Efficient Superlight Bitcoin Client in Solidity
TLDR
This work puts forth the first practical Solidity implementation of a superlight client which implements the NIPoPoW superblocks protocol and allows it to calculate concrete cryptoeconomic parameters for the superblocks NipoPoWs protocol and in particular to make recommendations about the monetary value of the collateral parameters. Expand
Mining in Logarithmic Space
TLDR
This work presents a protocol which allows pruning the blockchain by garbage collecting old blocks as they become unnecessary, and is the first to achieve always secure, always succinct, and online Non-Interactive Proofs of Proof-of-Work. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 54 REFERENCES
FruitChains: A Fair Blockchain
TLDR
The FruitChain protocol is presented, which satisfies the same consistency and liveness properties as Nakamoto's protocol, and additionally is δ-approximately fair: with overwhelming probability, any honest set of players controlling a φ fraction of computational power is guaranteed to get at least a fraction of the blocks in any Ω(κ/δ) length segment of the chain. Expand
Proofs of Proofs of Work with Sublinear Complexity
TLDR
In the setting of blockchain based transaction ledgers the problem of “simplified payment verification” (SPV) is studied which refers to theSetting of a transaction verifier that wishes to examine the last k blocks of the blockchain using as only advice the genesis block. Expand
(Short Paper) A Wild Velvet Fork Appears! Inclusive Blockchain Protocol Changes in Practice
TLDR
This work exposes examples where velvet forks or similar constructions are already actively employed in Bitcoin and other cryptocurrencies and expands upon the concept of velvet forks by proposing possible applications and discussing potentially arising security implications. Expand
Catena: Efficient Non-equivocation via Bitcoin
TLDR
Catena enables any number of thin clients, such as mobile phones, to efficiently agree on a log of application-specific statements managed by an adversarial server, and increases the bandwidth requirements of log auditors from 90GB to only tens of megabytes. Expand
The Bitcoin Backbone Protocol with Chains of Variable Difficulty
TLDR
As the miners’ population evolves over time, so should the difficulty of these proofs, and Bitcoin provides this adjustment mechanism, with empirical evidence of a constant block generation rate against such population changes. Expand
Analysis of the Blockchain Protocol in Asynchronous Networks
Nakamoto’s famous blockchain protocol enables achieving consensus in a so-called permissionless setting—anyone can join (or leave) the protocol execution, and the protocol instructions do not dependExpand
Proof-of-Stake Sidechains
TLDR
A security definition is put forth that augments the known transaction ledger properties of liveness and safety to hold across multiple ledgers and enhance them with a new “firewall” security property which safeguards each blockchain from its sidechains, limiting the impact of an otherwise catastrophic sidechain failure. Expand
A Next-Generation Smart Contract and Decentralized Application Platform
When Satoshi Nakamoto first set the Bitcoin blockchain into motion in January 2009, he was simultaneously introducing two radical and untested concepts. The first is the "bitcoin", a decentralized Expand
POLKADOT: VISION FOR A HETEROGENEOUS MULTI-CHAIN FRAMEWORK
  • 2016
Present-day blockchain architectures all suffer from a number of issues not least practical means of extensibility and scalability. We believe this stems from tying two very important parts of theExpand
Strong Federations: An Interoperable Blockchain Solution to Centralized Third Party Risks
TLDR
This work describes the first implementation of Strong Federations, publicly verifiable, Byzantine-robust transaction networks that facilitate movement of any asset between disparate markets, without requiring third-party trust. Expand
...
1
2
3
4
5
...