Skip to content
Conference

Safety and Liveness Failure Under Budget-Constrained Mining: Composing Backbone Proofs with Endogenous Honest Majority

Jul 2026 · International Conference on Smart Communications and Networking · pp. 1-12 · 0 citations · 19 references

Abstract

We prove that Nakamoto proof-of-work consensus has a budget-determined population structure with three security regimes. We compose three layers: the imported Garay-Kiayias-Leonardos (GKL) sufficiency theorem [3]; new attack constructions, native to the GKL round model, showing that when adversarial hashrate weakly exceeds honest hashrate the private-chain attack violates Persistence with probability one and a censorship attack violates Liveness; and an economic model of $n$ heterogeneous miners under an operational-security threshold that determines the honest/adversarial partition endogenously. The composition yields a safe region where GKL guarantees apply, a margin region where they fail although honest miners retain a hashrate majority, and a majority-loss region where the certainty-style attacks apply. The block-rate side of the GKL condition is derived from difficulty adjustment, not assumed. Extensions cover probabilistic compromise, mining-pool aggregation with both safety-positive and safety-negative effects, a conditional adaptive-corruption upper bound (when adaptive reach contains the budget-determined static compromised set), and post-halving entry-exit dynamics.

View source

Similar papers

Preprint Jul 2026

The Power of Backdoor Absorption in Community Training

It is proved that the success probability of any bounded adversary asymptotically collapses to zero under a defense strategy combining natural absorption, a randomized scheduler, and lazy verification oracle, which yields a provably sound and computationally efficient defense for safety-critical AI.

Issam Seddik, Sami Souihi, Mohamed Tamaazousti et al. · 0 citations
Review Aug 2026

Repeated-Game Security for Restaking-Based Verifiable Inference

A deployable mechanism combining history-dependent challenges, reputation-weighted slashing, and stake vesting is proposed, which restores infinite-horizon subgame-perfect incentive compatibility against stationary mixed-strategy deviations above an explicit discount-factor threshold without per-query cryptographic ver...

Zhen-Hang Shang, Yingzhe Yu, Kani Chen · 0 citations
#small language model Preprint Aug 2026

Safety Hacking in Constrained Best-of-$N$ Inference-time Scaling

It is shown that policies within a bounded $\chi^2$ divergence from the proxy-feasible reference distribution admit an $N$-independent safety-hacking bound, and instantiate this general coverage-control principle with constrained pessimistic sampling.

Akifumi Wachi, Takumi Tanabe, Youhei Akimoto · 0 citations
Preprint Aug 2026

Adversarial Entropy Inflation Against Gumbel-Based Inference Verification

The results indicate that static, benign-traffic-calibrated thresholds are insufficient for this defense, and that jitter-forgiveness thresholds should instead be calibrated dynamically against local token entropy.

Nikita Kezins · 0 citations
Preprint Aug 2026

Rational Dolev--Yao Attackers: Decidable Incentive-Aware Verification of Security Protocols in Strategic Logic

A rational Dolev--Yao attacker is introduced, a DY intruder whose actions carry costs and whose security-violating goals carry rewards, and a protocol is called rationally secure when no intruder strategy achieves a violation with strictly positive utility, expressed in a weighted fragment of ATL (WATL).

Ioana Boureanu, R. Ramanujam · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.