Cover Image

Double Spending Analysis of Nakamoto Consensus for Time-Varying Mining Rates with Ruin Theory

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Doger, Mustafa, Ulukus, Sennur, Akar, Nail
Format:	Preprint
Published:	2024
Subjects:	Cryptography and Security Distributed, Parallel, and Cluster Computing Discrete Mathematics Information Theory Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

When Should Selfish Miners Double-Spend?
by: Doger, Mustafa, et al.
Published: (2025)

PoW Security-Latency under Random Delays and the Effect of Transaction Fees
by: Doger, Mustafa, et al.
Published: (2024)

An Incentive-Compatible Semi-Parallel Proof-of-Work Protocol
by: Doger, Mustafa, et al.
Published: (2025)

Transaction Capacity, Security and Latency in Blockchains
by: Doger, Mustafa, et al.
Published: (2024)

Refined Bitcoin Security-Latency Under Network Delay
by: Doger, Mustafa, et al.
Published: (2022)

Temporary Power Adjusting Withholding Attack
by: Doger, Mustafa, et al.
Published: (2026)

SEDULity: A Proof-of-Learning Framework for Distributed and Secure Blockchains with Efficient Useful Work
by: Cao, Weihang, et al.
Published: (2025)

Nakamoto Consensus from Multiple Resources
by: Baig, Mirza Ahad, et al.
Published: (2025)

Nakamoto Consensus under Bounded Processing Capacity
by: Kiffer, Lucianna, et al.
Published: (2023)

Optimal Multilevel Slashing for Blockchains
by: Wood, Kenan, et al.
Published: (2024)

Effect of Full Common Randomness Replication in Symmetric PIR on Graph-Based Replicated Systems
by: Meel, Shreya, et al.
Published: (2025)

Theoretical Analysis on Block Time Distributions in Byzantine Fault-Tolerant Consensus Blockchains
by: Fujihara, Akihiro
Published: (2024)

Automated Selfish Mining Analysis for DAG-Based PoW Consensus Protocols
by: Keller, Patrik
Published: (2025)

Incentive Attacks in BTC: Short-Term Revenue Changes and Long-Term Efficiencies
by: Doger, Mustafa, et al.
Published: (2025)

StealthDust: Secret Quorums for Faster Fractional Spending
by: Perion, Maxence, et al.
Published: (2024)

Bullshark on Narwhal: Implementation-level Workflow Analysis of Round-based DAG Consensus in Theory and Practice
by: Tanaka, Yusei
Published: (2025)

Real-Time Service Subscription and Adaptive Offloading Control in Vehicular Edge Computing
by: Gao, Chuanchao, et al.
Published: (2025)

A Randomised Approach to Distributed Sorting
by: Olesker-Taylor, Sam
Published: (2025)

Multi-Agent Distributed Optimization With Feasible Set Privacy
by: Meel, Shreya, et al.
Published: (2025)

Differentially Private Federated Learning With Time-Adaptive Privacy Spending
by: Kiani, Shahrzad, et al.
Published: (2025)

Fully-Fluctuating Participation in Sleepy Consensus
by: Efron, Yuval, et al.
Published: (2025)

Asynchronous BFT Consensus Made Wireless
by: Liu, Shuo, et al.
Published: (2025)

Distance-based certification for leader election in meshed graphs and local recognition of their subclasses
by: Chalopin, Jérémie, et al.
Published: (2026)

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs
by: Döring, Michelle
Published: (2025)

On Completely Edge-Independent Spanning Trees in Locally Twisted Cubes
by: Li, Xiaorui, et al.
Published: (2024)

SPHERE: Spherical partitioning for large-scale routing optimization
by: Lindermann, Robert Fabian, et al.
Published: (2025)

Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors
by: Bonamy, Marthe, et al.
Published: (2025)

Improved Distributed Algorithms for Random Colorings
by: Carlson, Charlie, et al.
Published: (2023)

Jet: Multilevel Graph Partitioning on Graphics Processing Units
by: Gilbert, Michael S., et al.
Published: (2023)

Lower bound for constant-size local certification
by: Martínez, Virgina Ardévol, et al.
Published: (2022)

Convergence Sans Synchronization
by: Gupta, Arya Tanmay
Published: (2025)

Efficient Computation in Congested Anonymous Dynamic Networks
by: Di Luna, Giuseppe A., et al.
Published: (2023)

Asynchronous Cooperative Optimization of a Capacitated Vehicle Routing Problem Solution
by: Accorsi, Luca, et al.
Published: (2025)

3-Majority and 2-Choices with Many Opinions
by: Shimizu, Nobutaka, et al.
Published: (2025)

Optimal Computation in Anonymous Dynamic Networks
by: Di Luna, Giuseppe A., et al.
Published: (2022)

Learning-Based Approaches for Job Shop Scheduling Problems: A Review
by: Rihane, Karima, et al.
Published: (2025)

Non-trivial automata networks do exist that solve the global majority problem with the local majority rule
by: Balbi, Pedro Paulo, et al.
Published: (2026)

Efficient Approximation of Centrality Measures in Uncertain Graphs
by: Ketels, Daniel
Published: (2024)

Asynchronous 3-Majority Dynamics with Many Opinions
by: Cooper, Colin, et al.
Published: (2024)

A Fair and Lightweight Consensus Algorithm for IoT
by: Vavilis, Sokratis, et al.
Published: (2025)