Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 47 tok/s
Gemini 2.5 Pro 44 tok/s Pro
GPT-5 Medium 13 tok/s Pro
GPT-5 High 12 tok/s Pro
GPT-4o 64 tok/s Pro
Kimi K2 160 tok/s Pro
GPT OSS 120B 452 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Refined Bitcoin Security-Latency Under Network Delay (2212.01372v4)

Published 2 Dec 2022 in cs.CR, cs.DC, cs.DM, cs.IT, and math.IT

Abstract: We study security-latency bounds for Nakamoto consensus, i.e., how secure a block is after it becomes $k$-deep in the chain. We improve the state-of-the-art bounds by analyzing the race between adversarial and honest chains in three different phases. We find the probability distribution of the growth of the adversarial chains under models similar to those in [Guo, Ren; AFT 2022] when a target block becomes $k$-deep in the chain. We analyze certain properties of this race to model each phase with random walks that provide tighter bounds than the existing results. Combining all three phases provides novel upper and lower bounds for blockchains with small $\lambda\Delta$.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (10)
  1. D. Guo and L. Ren, “Bitcoin’s latency–security analysis made simple,” in ACM AFT 2022, September 2023.
  2. S. Nakamoto, “Bitcoin: A peer-to-peer electronic cash system.” https://bitcoin.org/bitcoin.pdf, March 2008.
  3. J. Garay, A. Kiayias, and N. Leonardos, “The bitcoin backbone protocol: Analysis and applications,” in EUROCRYPT 2015, April 2015.
  4. R. Pass and E. Shi, “Rethinking large-scale consensus,” in IEEE CSF 2017, August 2017.
  5. J. Li, D. Guo, and L. Ren, “Close latency-security trade-off for the nakamoto consensus,” in ACM AFT 2021, November 2021.
  6. P. Gazi, L. Ren, and A. Russell, “Practical settlement bounds for proof-of-work blockchains,” in ACM CCS 2022, November 2022.
  7. A. Dembo, S. Kannan, E. Tas, D. Tse, P. Viswanath, X. Wang, and O. Zeitouni, “Everything is a race and nakamoto always wins,” in ACM CCS 2020, November 2020.
  8. V. Ramaswami, “A stable recursion for the steady state vector in markov chains of m/g/1 type,” Communications in Statistics. Stochastic Models, vol. 4, no. 1, pp. 183–188, 1988.
  9. S. Ross, Stochastic processes. John Wiley & Sons, Inc., second ed., 1996.
  10. “DSN Bitcoin Monitoring.” https://dsn.tm.kit.edu/bitcoin/. Accessed: 2021-07-30.
Citations (4)

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.