Impact of Node Churn in the Bitcoin Network
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The aim of this work is to evaluate the impact of node churn -nodes leaving and rejoining the network- on the Bitcoin network. We provide a comprehensive analytical model for the churning process. We use a Continuous Time Markov Chain (CTMC) to describe the behavior of a node, and then apply the results to model the changes in connectivity and the impact on network performance. We analyze the time needed to resynchronize a node upon rejoining the network and find that sleep times of the order of hours require synchronization times limited by a minute. We estimate the impact of sleep and synchronization time on overall network connectivity and block/transaction distribution time. Our results show that networks with less than 4000 nodes are sensitive to churn. This occurs due to opposing impact of decrease in network size (and diameter) due to sleep time and increase of communication load per node. However, the impact of churn on network with more than 4000 nodes is noticeable but small enough to make a large Bitcoin network fairly resilient to churn.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.003 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it