As reported on November 18, 2026, BIP 461 specifies a deterministic ECDSA signing algorithm: for a given private key and message, the signature is determined by those inputs rather than by a signer’s choice of nonce or s value.
The specification uses RFC 6979 to derive the nonce, then applies low-r grinding and low-s normalization. It states that the resulting DER-encoded signature is at most 70 bytes, or 71 bytes with a sighash byte.
What can be checked? Two independent signers can produce signatures for the same key and message and compare their results. Removing the signer’s freedom to choose the nonce and s value is intended to help detect behavior that could leak key material; a matching result alone does not establish that a signer is secure.
BIP 461 also describes nonce derivation, signing, verification and a DeterministicSign algorithm. It discusses backward compatibility with existing consensus rules and provides a reference implementation. These are elements of the specification, not evidence that the proposal has been adopted.

