Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 225

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Bitcoin blockchain dynamics: The selfish-mine strategy in the presence of propagation delay

Open access
Göbel, J., Keeler, H.P., Krzesinski, A.E., Taylor, P.G. · 2016 · Performance Evaluation

Abstract

In the context of the ‘selfish-mine’ strategy proposed by Eyal and Sirer, we study the effect of communication delay on the evolution of the Bitcoin blockchain. First, we use a simplified Markov model that tracks the contrasting states of belief about the blockchain of a small pool of dishonest miners and the ‘rest of the community’ to establish that the use of block-hiding strategies, such as selfish-mine, causes the rate of production of orphan blocks to increase. Then we use a spatial Poisson process model to study values of Eyal and Sirer’s parameter γ , which denotes the proportion of the honest community that mines on a previously-secret block released by the pool in response to the mining of a block by the honest community. Finally, we use discrete-event simulation to study the behaviour of a network of Bitcoin miners, a proportion of which is colluding in using the selfish-mine strategy, under the assumption that there is a delay in the communication of information between miners. The models indicate that both the dishonest and the honest miners were worse off than they would have been if no dishonest mining were present, and that it is possible for the mining community to detect block-hiding behaviour, such as that used in selfish-mine, by monitoring the rate of production of orphan blocks.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.peva.2016.07.001

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

  • Sustaining the Internet with hyperbolic mapping

    Boguñá, M., Papadopoulos, F., & Krioukov, D. (2010) · Nature Communications · doi:10.1038/ncomms1063 · Cited by 463 · cited 1×

    “dy the scalability of these networks. It has been remarked [13], [14] that the Poisson process in this model can be defined on other spaces more suitable for studying networks such as hyperbolic space [15], which offers a possible avenue for further research. Furthermore, we assume that the communication delay between…”
    Background

Show all 1 references

Cited by

See all 225

Metadata

Authors
Göbel, J., Keeler, H. P., Krzesinski, A. E., & Taylor, P. G.
Venue
Performance Evaluation
Publisher
Elsevier BV
Published
2016-10
Volume
104
Pages
23-41
ISSN
0166-5316 (ISSN-L)
OpenAlex
W2219152866
Cited by
225
References
1
FWCI
54.99
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Bitcoin blockchain dynamics: The selfish-mine strategy in the presence of propagation delay. https://app.cochat.ai/papers/10.1016/j.peva.2016.07.001
The paper
Göbel, J., Keeler, H. P., Krzesinski, A. E., & Taylor, P. G. (2016). Bitcoin blockchain dynamics: The selfish-mine strategy in the presence of propagation delay. Performance Evaluation. https://doi.org/10.1016/j.peva.2016.07.001

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.