Pith. sign in

REVIEW 1 cited by

Verilay: A Verifiable Proof of Stake Chain Relay

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2201.08697 v1 pith:C7X6ACRI submitted 2022-01-21 cs.CR

classification cs.CR
keywords blockchainchainrelayethereumproofprotocolsvalidationverilay
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Blockchain relay schemes enable cross-chain state proofs without requiring trusted intermediaries. This is achieved by applying the source blockchain's consensus validation protocol on the target blockchain. Existing chain relays allow for the validation of blocks created using the Proof of Work (PoW) protocol. Since PoW entails high energy consumption, limited throughput, and no guaranteed finality, Proof of Stake (PoS) blockchain protocols are increasingly popular for addressing these shortcomings. We propose Verilay, the first chain relay scheme that enables validating PoS protocols that produce finalized blocks, for example, Ethereum 2.0, Cosmos, and Polkadot. The concept does not require changes to the source blockchain protocols or validator operations. Signatures of block proposers are validated by a dedicated relay smart contract on the target blockchain. In contrast to basic PoW chain relays, Verilay requires only a subset of block headers to be submitted in order to maintain full verifiability. This yields enhanced scalability. We provide a prototypical implementation that facilitates the validation of Ethereum 2.0 beacon chain headers within the Ethereum Virtual Machine (EVM). Our evaluation proves the applicability to Ethereum 1.0's mainnet and confirms that only a fraction of transaction costs are required compared to PoW chain relay updates.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. SPID-Chain: Verifiable Polar-Coded State Validation for Cross-Chain DAG Settlement

    cs.DC 2025-01 reject novelty 4.0 of 10

    SPID-Chain combines Polar-coded distributed computation with an IOTA-style DAG to validate cross-chain transfers; the simulations claim gains, but the abstract's promised analytical results are absent from the text.

Pith tools