惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

IT之家
IT之家
H
Help Net Security
GbyAI
GbyAI
博客园_首页
G
Google Developers Blog
Microsoft Security Blog
Microsoft Security Blog
博客园 - 【当耐特】
月光博客
月光博客
美团技术团队
B
Blog RSS Feed
博客园 - 三生石上(FineUI控件)
WordPress大学
WordPress大学
博客园 - 叶小钗
有赞技术团队
有赞技术团队
T
The Blog of Author Tim Ferriss
Engineering at Meta
Engineering at Meta
Google DeepMind News
Google DeepMind News
Y
Y Combinator Blog
宝玉的分享
宝玉的分享
Microsoft Azure Blog
Microsoft Azure Blog
罗磊的独立博客
云风的 BLOG
云风的 BLOG
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
P
Proofpoint News Feed

Cryptology ePrint Archive

Formalizing and Strengthening the Security Proof of NTOR Verifiable Anomaly and Similarity Detection Using Matrix Profile in Private Time-series Adaptor Signature Schemes with Deniable Presignatures Privacy Coins Under Viewing Key Compromise On the (Privacy) Harms of the European Digital Identity Framework Adaptively-Secure Flexible and Identity-Based Broadcast Encryption from Decomposed LWE MERIDIAN: A Toroid-Inspired Permutation Block Cipher for Constrained Environments Toward Practical Fair Data Exchange: Eliminating In-Circuit Public-Key Operations Fault Injection Attacks Against zkSTARKs Scale, Round, Break: Simple Leakage Attacks on Secret Sharing Schemes Private Delegation of (Non-)Membership Proof Updates in Cryptographic Accumulators Beyond Binary: crosscorrelation of Cubic, Quartic and Quintic Character Sequences ZEE200: Zero Knowledge for Everything and Everyone @ 200 KHz A Post-Quantum Accountable Sanitizable Signature Scheme Based on Unbalanced Oil and Vinegar Better Usability: Leakage-Resistant AEADs from Single-length Blockciphers TieredOMap: Skewness-Aware Oblivious Map From Rerandtopia to Interceptopia, the Anamorphic Encryption Saga Rises Non-Adaptive Programmable PRFs and Applications to Stacked Garbling Practical Post-Quantum Secure Publicly Verifiable Secret Sharing and Applications Mosaic: Practical Malicious Security for Garbled Circuits on Bitcoin Efficient Bootstrapping of Matrices in FHE Decomposing Multiplication: A Vertical Packing Approach for Faster TFHE Formal Verification, Integration and Physical Evaluation of Prime-Field Masking on Silicon New Techniques for Communication-Efficient Secure Comparison Protocols Pairing-Based Verifiable Shuffles with Logarithmic-Size Proofs Verifying Provenance of Digital Media: Security Analysis of C2PA and its Implementation EQuADiSE: Efficient Quantum-safe Adaptive Distributed Symmetric-key Encryption Secure and Updatable Single Password Authentication Batch-Puncturing Circuit CP-ABE (and More) from Lattices Panther: Robust Hybrid KEM Combiners via Structural Splicing
Fast Difficulty Adjustment in Proof-of-Work Consensus
Juan Garay, Texas A&M University · 2026-05-31 · via Cryptology ePrint Archive

Paper 2026/1116

Fast Difficulty Adjustment in Proof-of-Work Consensus

Aggelos Kiayias, University of Edinburgh, IOG

Yu Shen, Hong Kong Polytechnic University

Abstract

One of the main hallmarks of proof-of-work (PoW) consensus protocols is their ability to adjust the difficulty of the PoW, so that it accurately reflects the level of participation and hence maintains security in a setting where protocol participation is unknown and may over time change dramatically. Importantly, this enables the protocol to retain its fundamental characteristics (such as the regularity of dispensing new tokens) irrespectively of the number of parties running the protocol (also known as ``miners'') at any given time. The speed with which difficulty can be adjusted is a fundamental feature of a blockchain protocol: The faster the rate with which the difficulty is adjusted, the more agile the protocol is in the face of fluctuating participation. In this work, we put forward, for the first time, a blockchain protocol that performs difficulty adjustment in constant time; prior provably secure designs only offered protocols with, at best, poly-logarithmic overhead for difficulty adjustment. Our construction is based on the parallel-chain approach and a new target recalculation function that adjusts mining difficulty making use of information from all chains in the past epoch via a novel application of approximate-agreement techniques that may be of independent interest.

BibTeX

@misc{cryptoeprint:2026/1116,
      author = {Juan Garay and Aggelos Kiayias and Yu Shen},
      title = {Fast Difficulty Adjustment in Proof-of-Work Consensus},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/1116},
      year = {2026},
      doi = {10.1007/978-3-032-35428-0_4},
      url = {https://eprint.iacr.org/2026/1116}
}