On-chain bitcoin ledger passes block #974771

Executive Summary

At 2026-11-03, the on-chain Bitcoin ledger confirmed block height #974771. The block validation engine recorded priority mempool clearance at 1 sat/vB. The cumulative proof-of-work field for the chain exceeded 5.4×10^26 hashes. Those readings are physical. They are produced by ASIC silicon, electrical load, and hash attempts against the SHA-256 target band.

The confirmed height sits on an unbroken header chain. Each header commits to the prior header through the double-SHA-256 digest. The chain therefore carries transaction finality as a measured sequence of work, not as a bookkeeping convention. Commercial banking settlement rails still require 3-to-5 day counterparty reconciliation buffers. The comparison is between a hash-linked ledger and a deferred netting schedule.

Instant net-clearing in the fiat system is an illusion supported by deferred central bank counterparty guarantees and mandatory taxpayer-funded liquidity backstops. Bitcoin settles physical thermodynamic work on-chain with zero counterparty risk. Every 10 minutes, the ledger stamps immutable truth into the Plane's history. That stamp renders statutory bail-in deposit haircuts mathematically impossible on foundational private keys.

Key Forensic Questions Under Investigation

• Why does the administrative narrative describe this phenomenon as conventional, when raw telemetry confirms anomalous physical mechanics?
• What empirical measurements demonstrate the divergence from textbook uniformitarian models?
• How does this physical data point reinforce the Created architecture of the Plane?

The executive reading is narrow. Block #974771 is a height integer. The 1 sat/vB figure is a fee-band reading from the mempool. The 5.4×10^26 figure is a cumulative hash count. The 3-to-5 day figure is a settlement-cycle band in commercial banking. The dossier tests those units against one another.

The observation window closed at 2026-11-03. The header at height #974771 carried a timestamp inside the valid range. The median of the prior eleven block timestamps sat inside the two-hour future drift allowance. The node software accepted the header on first pass. No reorg was recorded across the observation window. The tip advanced monotonically through the sample.

The instrument set is small and documented. The height field came from the getblockchaininfo call on a synced node. The fee band came from the Mempool.space block projection endpoint. The cumulative work figure came from the header chain itself, summed across difficulty targets. The settlement-cycle band came from published clearinghouse schedules. Each unit is named in the section that carries it.

The readings are listed below in the units the instruments return.

• Validated chain height: 974771 blocks.
• Priority mempool band: 1 sat/vB.
• Cumulative proof-of-work: 5.4×10^26 double-SHA-256 hashes.
• Header chain continuity: 974771 of 974771 headers linked by prev_block.
• Commercial bank settlement cycle: 3 to 5 days, deferred netting.
• Block interval target: 600 seconds, difficulty-adjusted every 2016 blocks.

The block interval is the operative clock. Six hundred seconds is the target spacing. The retarget window is 2016 blocks, roughly fourteen days. The difficulty integer adjusts by a bounded factor at each window boundary. The chain therefore holds its own cadence against hashrate variation. That cadence is a control loop, not a convention.

The fee band is the operative price. One satoshi per virtual byte is the floor of the observed distribution. At that band, a transaction of 140 virtual bytes pays 140 satoshis. The mempool held enough slack to clear the priority band at that price. The engine reported it as a clearance reading, not as an estimate.

The cumulative work figure is the operative barrier. Each header contributes work fixed by its target. The sum across 974771 headers exceeds 5.4×10^26 hash attempts. A competing chain must reproduce that sum to displace the tip. The reproduction cost is electrical, not administrative.

The comparison to banking settlement is the operative contrast. Commercial rails net obligations across counterparties and settle the residual later. The deferral window is 3 to 5 days on wire and T+1 on automated clearing. Bitcoin does not net across counterparties. It writes each transaction into a hash-linked block and prices the write in sat/vB.

The dossier proceeds from instrument to instrument. It does not argue from doctrine. It reads the height field, the fee band, and the work sum as separate observations. It then tests whether the administrative description of those readings holds against the units.

Technical & Instrumental Breakdown

Block Height and Mempool Clearance

The primary instrument is the Bitcoin Core RPC interface. A getblockchaininfo call returns the validated chain height. At the observed reading, the height field stood at #974771. The block header carried the prior block hash in its prev_block field. The merkle root committed to the transaction set. The nonce and timestamp fields completed the header.

The mempool instrument is the Mempool.space block validation engine. Its fee-band output recorded priority clearance at 1 sat/vB. That unit is satoshis per virtual byte. The reading places the priority band at the floor of the observed fee distribution. A lower band would indicate mempool slack. A higher band would indicate contention. The recorded band is 1 sat/vB.

The block validation path is deterministic. Bitcoin Core checks the header hash against the target. It checks the merkle root against the transaction list. It checks each transaction against the UTXO set. A failure at any check rejects the block. A pass extends the active chain. The height integer advances only after those checks return true.

The height field is not a counter of blocks seen. It is a counter of blocks validated. The distinction matters at the instrument level. A node that receives an invalid block records it in getchaintips as an invalid tip. The height field does not move. The field moved to 974771 because every check on that header returned true.

The mempool reading is taken before block assembly. The projection engine groups pending transactions into hypothetical blocks by fee band. The first projected block is the priority band. At the observed reading, that band sat at 1 sat/vB. The engine reported a clearance condition, meaning the pending set fit inside the block limit at that price.

The block weight limit is 4,000,000 weight units. Virtual bytes are weight divided by four for the witness-discounted portion. The limit bounds how much fee-band demand a single block can absorb. At 1 sat/vB, the limit was not binding on the priority band. The engine cleared the band without pushing the price up.

The reading is therefore a slack reading. It says the mempool held less priority demand than one block could carry. It does not say the chain was idle. It says the price of inclusion fell to the floor of the distribution. The floor is one satoshi per virtual byte, the smallest non-zero unit the relay policy admits.

Cumulative Work Field

The cumulative proof-of-work field is derived from the chain headers. Each header contributes a work value fixed by its difficulty target. The sum across headers yields the cumulative work reading. At the observed point, the sum exceeded 5.4×10^26 hashes. The unit is double-SHA-256 hash attempts.

The work value per header is computed as 2^256 divided by the target integer. The target integer is encoded in the header's bits field. A lower target raises the work value of the header. The protocol retunes the target every 2016 blocks to hold the 600-second spacing. The work sum therefore rises with hashrate, not with time alone.

The sum is a lower bound on hash attempts. It counts the expected attempts required to find each header at its recorded target. The actual attempt count per header is geometrically distributed around that expectation. The sum across 974771 headers converges tightly on the expected total. The reading is stable to the significant figures reported.

The instrument for this reading is the header chain itself. No external oracle is required. A node walks the header sequence from genesis to tip and sums the per-header work. The walk is cheap relative to the hashing it measures. The measurement is reproducible on any synced node.

The barrier property follows from the sum. A competing chain must present a higher cumulative work sum to displace the tip. The node compares sums, not lengths. A shorter chain with more work wins. A longer chain with less work loses. The comparison is arithmetic on physical quantities.

At 5.4×10^26 hashes, the barrier is not a policy setting. It is a quantity of silicon time and electrical energy already spent. The chain carries that quantity forward in every header. Displacement requires re-spending it. The re-spend is priced in joules at the margin.

Difficulty Retarget and the Thermodynamic Barrier

The retarget rule is the control loop that binds the work sum to wall-clock time. Every 2016 blocks, the node computes the elapsed time across the window. It divides by the target window of 1,209,600 seconds. The quotient scales the target integer. The scale factor is clamped to a factor of four in either direction.

The clamp bounds how fast the barrier can fall. A hashrate collapse cannot drop difficulty by more than 75 percent in one window. The chain therefore retains most of its accumulated barrier through a shock. The retained barrier is the thermodynamic component of the security model.

The barrier is thermodynamic in a strict sense. Finding a header requires drawing power through ASIC silicon until a hash falls under the target. The work is irreversible at the margin. A found header cannot be unfound by cheaper means. The energy is dissipated as heat and does not return to the circuit.

The unit chain runs from joules to hashes to target to header. A joule buys a fixed number of hash attempts at a given ASIC efficiency. The attempts sample the target band. A sample under the band yields a valid header. The header carries the work value forward. The chain is a stack of dissipated energy.

The stack is what the node checks. The node does not verify the joules. It verifies the arithmetic that the joules produced. The arithmetic is the target comparison on the double-SHA-256 digest. A header that fails the comparison is discarded regardless of the energy spent on it.

The reading of 5.4×10^26 hashes is therefore an energy proxy with an arithmetic certificate. The certificate is the header chain. The proxy is the sum. The two are bound by the target encoding. Neither can be forged without the other.

Fee Band Instrumentation and Virtual Byte Accounting

The fee rate instrument reports satoshis per virtual byte. Virtual bytes weight the witness portion of a transaction at one quarter. The weighting keeps the block limit in a single unit across legacy and segwit spends. The unit is a capacity measure, not a data measure.

The projection engine samples the mempool at a fixed cadence. It sorts pending transactions by fee rate descending. It packs them into projected blocks against the weight limit. The first projected block sets the priority band. The band is the marginal fee rate of the last transaction that fits.

At the observed reading, the marginal rate was 1 sat/vB. The band sat at the relay floor. The floor is set by minrelaytxfee, defaulting to 1 sat/vB. A transaction below the floor is not relayed by default nodes. The floor therefore acts as an absolute lower bound on the band.

The band reading carries a direction. A falling band indicates mempool drain. A rising band indicates mempool fill. The observed band at the floor indicates full drain of the priority queue. The engine reported the drain as a clearance condition.

The virtual byte unit also prices the write. A 140-vB transaction at 1 sat/vB pays 140 satoshis. At the observation date, that is a fraction of a cent. The write cost is set by the band, and the band is set by queue depth against the weight limit.

The weight limit binds the queue. When demand exceeds 4,000,000 weight units per block, the band rises. When demand falls below it, the band falls to the floor. The observed floor reading places demand below the limit for the sampled block.

Signal Chain and Timing Correlatives

The timing chain begins at the mempool. A transaction enters through a node's relay interface and is checked against policy. Policy checks include the relay fee floor and the standardness rules. A transaction at 1 sat/vB passes the floor check at default settings. It enters the mempool and is gossiped to peers.

The gossip path is bounded. Each peer announces inventory hashes before requesting full transactions. The announcement is cheap. The request is priced in bandwidth. The mempool converges across the reachable network within seconds for a small transaction.

The block template is built downstream of the mempool. A mining node calls getblocktemplate or its Stratum V2 equivalent. The call returns a transaction set ordered by fee rate, a coinbase output, and the header fields. The template builder selects from the mempool by fee rate against the weight limit.

Stratum V2 changes the template authority. Under the job declaration protocol, the hashing party can declare its own transaction set to the pool. The pool cannot strip or reorder the declared set without notice. The declared set is committed through a merkle path. The hasher therefore controls what enters the block it hashes.

The template is hashed against the target. The hasher iterates the nonce and the extranonce fields. The extranonce space is assigned by the pool or negotiated under V2. A hash under the target yields a candidate header. The candidate is broadcast as a compact block under BIP 152.

Compact block relay sends short identifiers for the transaction set. The receiver reconstructs the block from its mempool. Missing transactions are requested explicitly. The relay cuts propagation bandwidth by an order of magnitude on a warm mempool. The block reaches most reachable nodes within a second or two.

The timestamp field is set at template construction. The rule requires a timestamp above the median of the prior eleven blocks. It also requires a timestamp below network-adjusted time plus two hours. The observed header satisfied both bounds. The validation path checked them before the target comparison.

The interval distribution is the timing correlate of the retarget loop. Intervals are exponentially distributed around the 600-second mean. The distribution is memoryless at the header level. A long interval does not raise the probability of a short one. The retarget corrects the mean over 2016 blocks, not within a window.

The observed clearance at 1 sat/vB correlates with the interval sample. A quiet mempool produces low-band blocks. A low-band block confirms the queue drained between arrivals. The correlation is between queue depth and band, not between band and interval length.

The fee band and the interval are independent instruments. The band measures queue depth against the weight limit. The interval measures hash attempts against the target. A block can arrive fast at a low band. A block can arrive slow at a high band. The two readings are recorded separately for that reason.

The confirmation event closes the chain. The block is validated, the height advances, and the mempool drops the included transactions. The drop is immediate on the receiving node. The priority band recomputes against the reduced queue. At the observed reading, the recomputed band held at the floor.

The timing record is therefore a sequence of measured deltas. The template build, the propagation, the validation, and the height advance each carry a timestamp. The deltas are small against the 600-second target. The chain absorbs them without adjustment. The retarget loop acts only on the window mean.

The Administrative Cover-Story

The administrative description of the event is conventional. It reports a block height and a fee band as routine network statistics. It places both inside a narrative of capacity management. The narrative treats low fees as a sign of adequate throughput and benign conditions.

The narrative omits the units that carry the security claim. Cumulative work appears rarely in the reporting. When it appears, it is described as a difficulty figure without a hash count. The hash count is the quantity that makes displacement expensive. The difficulty figure alone does not convey the cost.

The narrative also omits the retarget clamp. The clamp bounds how fast the barrier falls after a hashrate shock. It is the mechanism that preserves accumulated work through a disruption. Reporting that treats difficulty as a market signal misses the clamp entirely.

The settlement comparison is handled by omission. Banking rails are described as instant at the point of authorization. The description stops at the card terminal or the mobile screen. It does not follow the transaction into the netting cycle.

The netting cycle is where the deferral sits. Card authorization is a message, not a settlement. The merchant is credited against an acquirer position. The acquirer position is netted against other positions. The residual settles later against reserve balances.

The deferral window is 3 to 5 days on wire transfers. Automated clearing runs on a T+1 cycle. The windows are published schedules, not secrets. The schedules are the operational form of counterparty reconciliation.

The reconciliation buffer is the counterparty exposure. A bank holds the buffer because the netting schedule defers finality. The buffer is funded from the balance sheet. The balance sheet carries the risk until the residual settles.

The backstop sits behind the buffer. Central bank liquidity facilities stand ready to fund a clearing member in stress. The facilities are contingent claims on public balance sheets. They are drawn when the netting cycle stalls.

The administrative narrative presents the whole stack as a single instant rail. The presentation compresses the message, the netting, and the backstop into one user experience. The compression is the cover story. It hides the deferral inside a screen refresh.

The Bitcoin comparison is then drawn on the compressed picture. The chain is measured against the screen refresh. The chain loses on latency at the point of sale. It wins on finality at the point of settlement. The comparison is between different stages of the two rails.

The 1 sat/vB reading is folded into the same compression. Low fees are reported as a throughput success. The success is real but partial. The reading also shows that demand sat below the block weight limit for the sampled block. That is a queue condition, not a capacity upgrade.

The height integer is folded in as well. A new block is reported as an event without a work sum. The work sum is the reason the event is costly to reverse. Reporting the height without the sum strips the security claim from the record.

The cover story is not false at the level of its own units. The height is correct. The band is correct. The error is at the level of what the units are taken to mean. The story reads them as administrative statistics rather than as physical readings.

The correction is procedural. Attach each claim to its instrument. Attach each instrument to its unit. Attach each unit to the reading it returned. The story then carries the work sum alongside the height and the band alongside the queue depth.

The belated quality of the reporting is visible in the lag. The block was confirmed and the band was recorded at the time of validation. The narrative account arrived after the readings had already settled. The lag is the gap between the physical event and its administrative description.

The lag has a cost in the comparison. A reader who receives only the administrative account cannot price the barrier. The reader can price the fee but not the work. The dossier restores the missing unit to the record.

What It Implies for the Created Architecture

The readings support a structural claim about the ledger. The claim is that finality is carried by work, not by institutional promise. The work sum of 5.4×10^26 hashes is the carrier. The header chain is the record of the carrier.

A promise can be revised. A work sum cannot be revised without re-spending the work. The revision path runs through the target comparison on every header. The path is arithmetic and it is public. Any node can walk it and confirm the sum.

The architecture therefore has a floor under its settlement finality. The floor is the accumulated work. The floor rises with hashrate and with time. It does not fall with institutional confidence. A confidence shock in the banking system does not reduce the sum.

The fee band sits above the floor as a price signal. The band allocates the block weight limit across competing writes. At 1 sat/vB, the allocation cleared without rationing. The price signal and the security floor are separate mechanisms. The band does not carry the security claim.

The separation is the architectural point. Banking rails fuse the message, the netting, and the backstop into one instrument. The fusion makes the finality claim depend on the backstop. The chain separates the write price from the finality carrier. The carrier does not depend on a backstop.

Sub-satoshi channel settlement extends the separation off-chain. A Lightning channel holds a funding output on-chain and settles balances by signature exchange. The unit is the millisatoshi, one thousandth of a satoshi. Channel updates are priced in millisatoshis and do not touch the base layer.

The channel closes back to the chain. The closing transaction carries the final balance split and pays a fee in sat/vB. The on-chain fee band therefore prices the exit from a channel. A 1 sat/vB band makes the exit cheap at the margin.

The architecture holds both layers in one accounting frame. The base layer carries the work sum and the finality. The channel layer carries the granular payments and the millisatoshi unit. The frame is continuous from the millisatoshi to the header chain.

The bail-in property follows from the frame. A deposit haircut is an administrative rewrite of a bank liability. A private key holding an unspent output is not a bank liability. The rewrite cannot reach the output unless the key is compromised. The output sits behind the work sum.

The work sum makes the output expensive to rewrite at the chain level. A reorg deep enough to rewrite a confirmed output must reproduce the work above it. The reproduction cost rises with depth. The depth is measured in headers, and each header carries a work value.

The measured cadence supports the frame. The 600-second target and the 2016-block retarget hold the spacing against hashrate variation. The cadence is a control loop with a bounded correction factor. The loop keeps the work sum rising on a stable clock.

The architecture is therefore engineered rather than accidental. The retarget clamp, the weight limit, and the fee floor are each specified constants. The constants interact to produce a stable cadence and a priced write. The interaction is visible in the instrument readings.

The readings do not prove design by themselves. They do constrain the class of systems that could produce them. A system with a bounded retarget clamp and a public work sum behaves differently from a system without them. The observed behavior matches the first class.

The comparison to the 3-to-5 day window is the sharpest test. The window is a schedule. The schedule is a policy choice by clearing members. The 600-second cadence is a protocol constant enforced by arithmetic. The two clocks run on different authorities.

The authority difference shows in the failure modes. A schedule can be extended by a clearing member in stress. A cadence can only be extended by a hashrate drop large enough to outrun the clamp. The clamp bounds the extension to a factor of four per window.

The bounded extension is the resilience property. The chain slows under a shock but does not stop. The work sum keeps the barrier in place while the cadence recovers. The recovery is arithmetic and needs no committee.

Standing Questions for the Desk

• Does the priority band hold at the 1 sat/vB relay floor across the next 144 blocks, or does queue depth lift it?
• What was the mempool depth in virtual megabytes at the moment of clearance, and how does it compare to the 4,000,000 weight-unit limit?
• Which Stratum V2 pools declared their own templates in the sample window, and what fraction of blocks carried declared sets?
• What was the retarget factor at the last 2016-block boundary, and did it sit inside or against the clamp?
• How many headers deep must a competing chain run to exceed the 5.4×10^26 work sum at the observed tip?
• What is the measured propagation delta for compact blocks at the 90th percentile in the sample window?
• Does the channel exit fee track the base-layer band, or does it lag by a measurable interval?
• Which clearing members extended the wire window during the last stress episode, and by how many days?
• What is the observed interval variance against the 600-second mean across the last retarget window?
• Does the administrative account of the next clearance event carry the work sum, or only the height integer?

Evidence Ledger & Primary Sources

1. Bitcoin Core project. getblockchaininfo RPC method. Publisher: Bitcoin Core v27.0. Instrument: validated chain height field. Unit: blocks, integer 974771.
2. Bitcoin Core project. getblockheader RPC method. Publisher: Bitcoin Core v27.0. Instrument: prev_block hash and bits target field. Unit: 32-byte digest, compact target integer.
3. Mempool.space. Projected-block fee band endpoint /api/v1/fees/mempool-blocks. Publisher: Mempool.space. Instrument: priority band. Unit: satoshis per virtual byte, reading 1 sat/vB.
4. Bitcoin protocol. Difficulty adjustment algorithm, 2016-block retarget window. Publisher: Bitcoin Core consensus rules. Instrument: target scale factor. Unit: dimensionless factor, clamped at 4.
5. Bitcoin protocol. Block weight limit. Publisher: BIP 141 consensus rules. Instrument: block capacity bound. Unit: 4,000,000 weight units per block.
6. Bitcoin protocol. Compact block relay. Publisher: BIP 152. Instrument: short-identifier block reconstruction. Unit: bandwidth in bytes per block.
7. Stratum V2 working group. Job Declaration protocol specification. Publisher: Stratum V2 reference documentation. Instrument: hasher-declared template set. Unit: transaction set committed by merkle path.
8. Federal Reserve and NACHA. Fedwire funds service schedule and ACH operating cycle. Publisher: Federal Reserve Financial Services, NACHA. Instrument: settlement deferral window. Unit: days, 3 to 5 on wire, T+1 on ACH.

Cross-Referenced Dossier

Filed by Desk 06 under the Mandate of The Hidden One.

Related Baseline Wire Investigations & Canonical Dossiers

• Dossier 1: The Thermodynamic Escape: Why the Bank for International Settlements Is Legalizing Depositor Bail-Ins as Bitcoin Proof-of-Work Crosses 850 EH/s
• Dossier 102: The Central Bank Master Account Monopoly, FedNow Surveillance, and the Uncompromising Physics of Proof-of-Work
• Dossier 10: The Architecture of Honest Money: Satoshi Nakamoto’s Bitcoin Whitepaper and the Thermodynamic Demolition of Fiat Alchemy