Datasets:
bitcoin-mempool-lifecycle: 2026-09-15
Browse files- README.md +107 -65
- e0_run_manifest/2026/09/2026-09-15T0614Z.parquet +3 -0
README.md
CHANGED
|
@@ -1,6 +1,6 @@
|
|
| 1 |
---
|
| 2 |
license: odc-by
|
| 3 |
-
pretty_name: "Bitcoin and Litecoin
|
| 4 |
tags:
|
| 5 |
- mempool
|
| 6 |
- bitcoin
|
|
@@ -14,98 +14,140 @@ task_categories:
|
|
| 14 |
- time-series-forecasting
|
| 15 |
size_categories:
|
| 16 |
- 1M<n<10M
|
| 17 |
-
configs:
|
| 18 |
-
- config_name: bitcoin_transaction_lifecycle
|
| 19 |
-
data_files:
|
| 20 |
-
- split: train
|
| 21 |
-
path: e8_btc_mempool_lifecycle/**/*.parquet
|
| 22 |
-
default: true
|
| 23 |
-
- config_name: bitcoin_mempool_comparison
|
| 24 |
-
data_files:
|
| 25 |
-
- split: train
|
| 26 |
-
path: e9_btc_mempool_divergence/**/*.parquet
|
| 27 |
-
- config_name: litecoin_transaction_lifecycle
|
| 28 |
-
data_files:
|
| 29 |
-
- split: train
|
| 30 |
-
path: e11_ltc_mempool_lifecycle/**/*.parquet
|
| 31 |
-
- config_name: bitcoin_block_composition
|
| 32 |
-
data_files:
|
| 33 |
-
- split: train
|
| 34 |
-
path: e8_btc_block_composition/**/*.parquet
|
| 35 |
-
- config_name: collection_runs
|
| 36 |
-
data_files:
|
| 37 |
-
- split: train
|
| 38 |
-
path: e0_run_manifest/**/*.parquet
|
| 39 |
---
|
| 40 |
|
| 41 |
-
# Bitcoin
|
| 42 |
|
| 43 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
| 44 |
|
| 45 |
## Contents
|
| 46 |
|
| 47 |
-
|
|
| 48 |
|---|---|
|
| 49 |
-
| `
|
| 50 |
-
| `
|
| 51 |
-
| `
|
| 52 |
-
| `
|
| 53 |
|
| 54 |
-
|
|
|
|
| 55 |
|
| 56 |
-
|
| 57 |
|
| 58 |
-
`fee_rate_sat_vb` is
|
|
|
|
| 59 |
|
| 60 |
-
|
| 61 |
|
| 62 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 63 |
|
| 64 |
-
|
|
|
|
| 65 |
|
| 66 |
-
|
|
|
|
| 67 |
|
| 68 |
-
|
|
|
|
|
|
|
|
|
|
| 69 |
|
| 70 |
-
|
|
|
|
| 71 |
|
| 72 |
-
|
| 73 |
|
| 74 |
-
|
|
|
|
|
|
|
|
|
|
| 75 |
|
| 76 |
-
|
|
|
|
| 77 |
|
| 78 |
-
##
|
| 79 |
|
| 80 |
-
|
|
|
|
| 81 |
|
| 82 |
-
|
| 83 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
| 84 |
|
| 85 |
-
|
| 86 |
-
|
| 87 |
-
|
| 88 |
-
|
|
|
|
| 89 |
|
| 90 |
-
|
|
|
|
|
|
|
|
|
|
| 91 |
|
| 92 |
-
|
| 93 |
|
| 94 |
-
|
|
|
|
|
|
|
| 95 |
|
| 96 |
-
|
|
|
|
|
|
|
|
|
|
| 97 |
|
| 98 |
-
|
| 99 |
-
|
| 100 |
|
| 101 |
-
|
|
|
|
|
|
|
| 102 |
|
| 103 |
-
|
| 104 |
-
|
| 105 |
-
|
| 106 |
-
|
| 107 |
-
|
| 108 |
-
|
| 109 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 110 |
|
| 111 |
-
|
|
|
|
|
|
| 1 |
---
|
| 2 |
license: odc-by
|
| 3 |
+
pretty_name: "Bitcoin and Litecoin mempool: dwell times, drops, and block composition"
|
| 4 |
tags:
|
| 5 |
- mempool
|
| 6 |
- bitcoin
|
|
|
|
| 14 |
- time-series-forecasting
|
| 15 |
size_categories:
|
| 16 |
- 1M<n<10M
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 17 |
---
|
| 18 |
|
| 19 |
+
# Bitcoin mempool lifecycle
|
| 20 |
|
| 21 |
+
Transactions from the moment they appear in the mempool to whatever happens to them: mined,
|
| 22 |
+
still waiting, or dropped without ever reaching a block.
|
| 23 |
+
|
| 24 |
+
A confirmed transaction keeps its contents forever but loses its timing. One that is never mined
|
| 25 |
+
leaves no record at all. Both are recorded here as they happen.
|
| 26 |
|
| 27 |
## Contents
|
| 28 |
|
| 29 |
+
| name | one row is |
|
| 30 |
|---|---|
|
| 31 |
+
| `e8_btc_mempool_lifecycle` | a Bitcoin transaction: first seen, fee rate, mined height, blocks waited, fate |
|
| 32 |
+
| `e9_btc_mempool_divergence` | one view of the pending set at one instant, sized and compared against the others |
|
| 33 |
+
| `e11_ltc_mempool_lifecycle` | the same, for Litecoin |
|
| 34 |
+
| `e8_btc_block_composition` | one block: how much of it we had already seen pending |
|
| 35 |
|
| 36 |
+
Ethereum moved to its own repo, `ethereum-mempool`, rather than sitting inside a Bitcoin panel.
|
| 37 |
+
Peer-to-peer propagation and relay floors likewise moved to `bitcoin-network-propagation`.
|
| 38 |
|
| 39 |
+
## Fee rate coverage
|
| 40 |
|
| 41 |
+
`fee_rate_sat_vb` is present on a portion of rows and that portion changes over time. It is
|
| 42 |
+
sampled, never estimated: a guessed fee rate would ruin the analyses the column exists for.
|
| 43 |
|
| 44 |
+
Coverage by day, as a share of transactions observed arriving (`pre_existing == False`):
|
| 45 |
|
| 46 |
+
| date | coverage |
|
| 47 |
+
|---|---|
|
| 48 |
+
| 2026-08-25 | none |
|
| 49 |
+
| 2026-08-26 | ~4% |
|
| 50 |
+
| 2026-08-27 | ~14% |
|
| 51 |
+
| 2026-08-28 | ~16% early, ~67% late |
|
| 52 |
+
| 2026-08-29 onward | ~67% |
|
| 53 |
|
| 54 |
+
Coverage of transactions already pending when a collection window opened moved from about 1% to
|
| 55 |
+
about 99% on 2026-08-28. Dropped rows inherit that figure and reached 94% on 2026-08-29.
|
| 56 |
|
| 57 |
+
Partitions from 2026-08-29 are substantially denser than earlier ones. Compute coverage per
|
| 58 |
+
partition rather than assuming a constant:
|
| 59 |
|
| 60 |
+
```python
|
| 61 |
+
obs = df[~df.pre_existing.astype(bool)]
|
| 62 |
+
coverage = obs.fee_rate_sat_vb.notna().mean()
|
| 63 |
+
```
|
| 64 |
|
| 65 |
+
Rows without a fee rate are complete in every other respect, so they remain usable for lifecycle
|
| 66 |
+
work. Only fee-conditioned analysis is affected.
|
| 67 |
|
| 68 |
+
## Reading the fate column
|
| 69 |
|
| 70 |
+
`dropped` means the transaction was confirmed absent from the chain, absent from every pending
|
| 71 |
+
view held, and stayed absent through a debounce period. It is not inferred from a single
|
| 72 |
+
observation. `unresolved` means it went missing but could not be confirmed, and is never counted
|
| 73 |
+
as a drop.
|
| 74 |
|
| 75 |
+
Bitcoin `fate = "dropped"` begins 2026-08-26. Earlier partitions contain no drops because a
|
| 76 |
+
defect made them impossible to record, not because none occurred.
|
| 77 |
|
| 78 |
+
## How much of a block did we already know about
|
| 79 |
|
| 80 |
+
`e8_btc_block_composition` counts, for every block, how many of its transactions were already in
|
| 81 |
+
our mempool view and how many appeared for the first time in the block itself.
|
| 82 |
|
| 83 |
+
The second number is the interesting one. A transaction that reaches a miner without crossing the
|
| 84 |
+
public relay network looks exactly like this, which is what direct-to-pool submission is. So does
|
| 85 |
+
a transaction broadcast in the seconds between two of our polls, and so does one our providers
|
| 86 |
+
simply never held. **The column is therefore an upper bound on out-of-band submission, not a
|
| 87 |
+
measurement of it**, and `polls_so_far`, `poll_failures` and `pool_size_at_block` travel on every
|
| 88 |
+
row so the bound can be tightened or discarded.
|
| 89 |
|
| 90 |
+
It doubles as a coverage statement for the rest of this repo. If you want to know how complete
|
| 91 |
+
the mempool view behind `e8_btc_mempool_lifecycle` is, this is the answer, block by block, in the
|
| 92 |
+
data rather than in a claim. One observed block held 4,823 transactions excluding the coinbase,
|
| 93 |
+
of which 4,804 were already in view: 99.6% captured, and 19 seen for the first time in the block
|
| 94 |
+
itself.
|
| 95 |
|
| 96 |
+
The coinbase is excluded, since it is created by the miner and never broadcast; counting it would
|
| 97 |
+
add one guaranteed unseen transaction to every block. Blocks mined before a run's baseline was
|
| 98 |
+
established are not recorded at all, because none of their transactions could have been seen and
|
| 99 |
+
the row would read 100% unseen for a reason that has nothing to do with the network.
|
| 100 |
|
| 101 |
+
## Package fee rates
|
| 102 |
|
| 103 |
+
A transaction's own fee rate is not what decides whether it is mined. A miner sorts by the
|
| 104 |
+
ANCESTOR fee rate, so a transaction with an unconfirmed low-fee parent is worth less than it
|
| 105 |
+
appears, and a child paying a large fee lifts its parent with it.
|
| 106 |
|
| 107 |
+
`effective_fee_rate_sat_vb` is `ancestor_fees_sat / ancestor_vsize`. For a transaction with no
|
| 108 |
+
unconfirmed parents it equals `fee_rate_sat_vb` exactly; where they diverge, the effective rate
|
| 109 |
+
is the one that governs inclusion. One snapshot held a transaction paying 28.4 sat/vB whose
|
| 110 |
+
effective rate was 2.1.
|
| 111 |
|
| 112 |
+
`ancestor_count` above 1 marks membership in an unconfirmed chain, which is how fee bumping by
|
| 113 |
+
a child shows up. The descendant columns are the mirror: what is waiting on this transaction.
|
| 114 |
|
| 115 |
+
These come from a full node's own view, so they are null for transactions it never held, and
|
| 116 |
+
they are recorded as first observed. Package structure changes as parents confirm, so treat
|
| 117 |
+
them as the state at first sight rather than a running value.
|
| 118 |
|
| 119 |
+
## Before you build on this
|
| 120 |
+
|
| 121 |
+
- Pending sets are node-local. What one view holds is not what the network holds, and retention
|
| 122 |
+
is a configuration choice rather than a protocol rule. `e9` exists to size that disagreement,
|
| 123 |
+
and it is large: at one instant the views ranged from about 6,000 to about 87,000 pending
|
| 124 |
+
transactions, with only 7% common to all of them.
|
| 125 |
+
- Dropped rows carry a fee rate far less often than mined rows. Every drop observed so far was
|
| 126 |
+
already pending when its window opened, and fee sampling favours arrivals.
|
| 127 |
+
- A fee rate of exactly 0 is real and rare. Filter on `fee_rate_sat_vb > 0` if a zero would
|
| 128 |
+
break your arithmetic rather than treating it as a decode fault.
|
| 129 |
+
- Timestamps are ours, taken at observation. They are not consensus timestamps and carry our
|
| 130 |
+
network distance to whatever served the data.
|
| 131 |
+
|
| 132 |
+
Partitions are parquet, one file per collection window, under `dataset/YYYY/MM/`. Every dataset here carries a FIXED 7-day sample WINDOW starting at its own first day of collection, together spanning 2026-08-25 to 2026-09-05, so you can check schema, coverage and quality before asking for more. It does not advance, so there is nothing to gain by re-downloading it. The full history is held privately, available on request.
|
| 133 |
+
|
| 134 |
+
```python
|
| 135 |
+
from huggingface_hub import snapshot_download
|
| 136 |
+
import pandas as pd, glob
|
| 137 |
+
|
| 138 |
+
path = snapshot_download("dataforge-labs/bitcoin-mempool-lifecycle", repo_type="dataset",
|
| 139 |
+
allow_patterns="e8_btc_mempool_lifecycle/**")
|
| 140 |
+
df = pd.concat(map(pd.read_parquet,
|
| 141 |
+
glob.glob(f"{path}/e8_btc_mempool_lifecycle/**/*.parquet", recursive=True)))
|
| 142 |
+
```
|
| 143 |
+
|
| 144 |
+
## Coverage
|
| 145 |
+
|
| 146 |
+
`e0_run_manifest` lists every collection window with its poll counts and failure counts, and is
|
| 147 |
+
published in full rather than windowed. Gaps between windows are real, cannot be filled in
|
| 148 |
+
afterwards, and nothing here is interpolated.
|
| 149 |
+
|
| 150 |
+
## License and contact
|
| 151 |
|
| 152 |
+
ODC-BY: use it freely, credit "DataForge (dataforge-labs)". Questions and requests for the full
|
| 153 |
+
history via the discussions tab.
|
e0_run_manifest/2026/09/2026-09-15T0614Z.parquet
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:ce4aa936b71bce832631c826a92fce496172d7d07141dcbbdd04965393fc7bc1
|
| 3 |
+
size 13290
|