Pré-Publication, Document De Travail Année : 2025

Technical Report: Mining in Logarithmic Space with Variable Difficulty

Résumé

This paper presents the first non-interactive, succinct, and secure representation of a PoW-based blockchain that operates under variable mining difficulty while satisfying both completeness and onlineness properties. Completeness ensures that provers can update an existing NIPoPoW by incorporating a newly mined block, whereas onlineness ensures that miners can extend the chain directly from a NIPoPoW. The time complexity for both the prover (to update a NIPoPoW with a new block) and the verifier is logarithmic in the number of blocks of the underlying PoW blockchain. The communication complexity required for synchronization is polylogarithmic in the length of the blockchain. We prove the correctness of our scheme in the presence of a 1/3-bounded PPT adversary.

Fichier principal
Vignette du fichier
Tech_report_CCS_2025.pdf (1.11 Mo) Télécharger le fichier
Origine Publication financée par une institution
Licence

Dates et versions

hal-05138795 , version 1 (01-07-2025)

Licence

Identifiants

  • HAL Id : hal-05138795 , version 1

Citer

Loïc Miller, Dorian Pacaud, Nathanael Derousseaux, Emmanuelle Anceaume, Romaric Ludinard. Technical Report: Mining in Logarithmic Space with Variable Difficulty. 2025. ⟨hal-05138795⟩
155 Consultations
332 Téléchargements

Partager

  • More