BIP 143 Signature Hashing Explained for SegWit Validation

BIP 143 signature hashing explained: learn the SegWit digest fields, input amount commitment, performance gains and validation requirements.

What the proposal changes

BIP 143 defines a new signature digest for version-zero SegWit witness programs. It reorganises the data committed by a signature so shared transaction components can be hashed once and reused across inputs. At the same time, explicitly committing to the value of the output being spent.

The rule should be read from the primary specification and tested against the exact node release used in production.

Start with the validating node, because the ASIC only hashes the candidate header it receives. Record the node release and the pool component that assembled the block. If those facts are unknown, the operator cannot show which rules were actually applied before electricity was committed to the work.

Fields and encoding

The preimage includes version, hashed previous outpoints, hashed sequences, the current outpoint, scriptCode, input amount, current sequence, hashed outputs, locktime and sighash type. ANYONECANPAY, SINGLE and NONE determine which aggregate hashes are zeroed or scoped. Byte order, length and units matter. A plausible human-readable value can still encode a different consensus or protocol meaning.

Treat status dashboards as observations, not as the source of truth. Compare them with an independently operated node and retain the raw deployment or template response. Period boundaries, chain reorganisations and cached pool pages can otherwise make a correct-looking percentage describe the wrong state.

Validation boundary

A node reconstructs the exact digest, verifies the witness signature and enforces the referenced amount from its UTXO view. Supplying a false amount creates a different digest and fails verification. Legacy inputs retain legacy hashing. Software must select rules from the actual spend type. ASICs hash work derived from this decision.

At the same time, the validating node or pool service remains responsible for accepting the underlying block and transactions.

Build the failure response before the boundary arrives. Define which rejection messages trigger an alert, who can pause a template source and how failover is prevented from returning miners to the same faulty validation stack. A second hostname is not independent when both endpoints share one node.

Why miners care

The old algorithm could repeatedly hash most of a large transaction for every signature, creating quadratic verification cost. Reusable component hashes make work roughly linear for typical transactions. Faster predictable validation helps template refreshes and limits a denial-of-service surface. The practical effects include template correctness, propagation latency, stale-share exposure and whether a solved candidate earns a recognised reward.

Separate readiness, signalling and enforcement in the operating log. Readiness is a claim about software and process, signalling is data carried by blocks, and enforcement is a validation result. Combining them into a single supported or unsupported label hides the point at which revenue is actually at risk.

Failure modes

Wrong scriptCode construction, byte order, sighash flag handling or input amount produces a signature that a wallet may display but every validating node rejects. SIGHASH_SINGLE retains specific output-index semantics. Custom signing devices need official test vectors, not self-consistent code alone. Monitoring should preserve raw messages and rejection reasons so an operator can distinguish a network delay from malformed work or incompatible policy.

Map responsibility across the full path: validating node, template server, pool protocol, proxy, firmware and ASIC. For each layer, state what it can alter and what it merely relays. This prevents a version-bit setting in firmware from being mistaken for complete consensus-rule support. Relate that responsibility map to the pool and job-control boundary in our Stratum V2 guide.

Deployment and compatibility

BIP 143 activated with SegWit and applies specifically to version-zero witness programs. Taproot uses BIP 341 and BIP 342 signature hashing instead. A modern transaction can contain different input types, each requiring the matching digest algorithm during validation. Historical assignment dates anchor these articles. But current deployments may have extra later standards. Pin versions rather than assuming uniform peer support.

Test the primary and failover paths with the same checks. Compare chain tip, chainwork, deployment state, required rules and template age, then save the result with a timestamp. The process should be repeatable by another operator without relying on an undocumented pool conversation.

Operator verification checklist

Run official vectors and independently serialise each preimage field. Mutate the amount, one previous outpoint, a sequence and an output to confirm which signatures break under each flag. Use final node acceptance and block proposal checks across every template backend. Repeat the same test across primary and failover paths, retain timestamps and define a pause condition before changing production mining configuration.

Turn the conclusion into a business decision. State which chain and settlement venues the operation intends to serve, the maximum acceptable stale-block exposure and the point at which mining pauses. This connects protocol evidence to electricity cost, pool revenue and payout finality.

Operator decision record

A concise decision record for BIP 143 signature hashing should name the source documents, their dates, the node release tested, the responsible pool or template provider and the exact trigger for action. Include screenshots or machine-readable output for the deployment state. But keep the raw node response as the stronger evidence.

State whether a change affects policy, block construction or consensus validity, because those layers have different failure costs.

Run the check on every production and failover path. Confirm that monitoring alerts on stale templates, unexpected chain tips, rejected proposals and a rise in stale shares. Keep rollback instructions for node and pool configuration. But do not roll back across an active consensus boundary without understanding the rules the older release enforces.

If the evidence conflicts, pause the affected path and investigate before committing more electricity to uncertain work.

For related background, read our plain-English BIP-110 guide and technical BIP-110 review. Those articles use a modern proposal to show why signalling, activation, template construction and accepted chain history must be examined separately.

Conclusion

Bip 143 signature hashing is best understood as a defined interaction between validating software, mining infrastructure and economic acceptance. The safest operator does not infer consensus from a dashboard percentage or a pool slogan. They verify the rule source, the activation boundary, the template fields and the chain their payouts ultimately settle on.

That discipline reduces the chance of hashing an invalid or commercially unwanted block.