cron: update bips submodule and build

Author: github-actions[bot]

bips

@@ -223,9 +223,9 @@ <h2>Specification</h2>
 <tr><td>Taproot Key BIP 32 Derivation Path</td><td><tt>PSBT_IN_TAP_BIP32_DERIVATION = 0x16</tt></td><td><tt>&lt;32 byte xonlypubkey&gt;</tt></td><td>A 32 byte X-only public key involved in this input. It may be the output key, the internal key, or a key present in a leaf script.</td><td><tt><compact size uint number of hashes> &lt;32 byte leaf hash&gt;* &lt;4 byte fingerprint&gt; &lt;32-bit little endian uint path element&gt;*</tt></td><td>A compact size unsigned integer representing the number of leaf hashes, followed by a list of leaf hashes, followed by the 4 byte master key fingerprint concatenated with the derivation path of the public key. The derivation path is represented as 32-bit little endian unsigned integer indexes concatenated with each other. Public keys are those needed to spend this output. The leaf hashes are of the leaves which involve this public key. The internal key does not have leaf hashes, so can be indicated with a <tt>hashes len</tt> of 0. Finalizers should remove this field after <tt>PSBT_IN_FINAL_SCRIPTWITNESS</tt> is constructed.</td><td></td><td></td><td>0, 2</td><td><a href="/371" target="_blank">371</a></td></tr>
 <tr><td>Taproot Internal Key</td><td><tt>PSBT_IN_TAP_INTERNAL_KEY = 0x17</tt></td><td>None</td><td>No key data</td><td><tt>&lt;32 byte xonlypubkey&gt;</tt></td><td>The X-only pubkey used as the internal key in this output. Finalizers should remove this field after <tt>PSBT_IN_FINAL_SCRIPTWITNESS</tt> is constructed.</td><td></td><td></td><td>0, 2</td><td><a href="/371" target="_blank">371</a></td></tr>
 <tr><td>Taproot Merkle Root</td><td><tt>PSBT_IN_TAP_MERKLE_ROOT = 0x18</tt></td><td>None</td><td>No key data</td><td><tt>&lt;32-byte hash&gt;</tt></td><td>The 32 byte Merkle root hash. Finalizers should remove this field after <tt>PSBT_IN_FINAL_SCRIPTWITNESS</tt> is constructed.</td><td></td><td></td><td>0, 2</td><td><a href="/371" target="_blank">371</a></td></tr>
-<tr><td>MuSig2 Participant Public Keys</td><td><tt>PSBT_IN_MUSIG2_PARTICIPANT_PUBKEYS = 0x1a</tt></td><td>&lt;33 byte plain aggregate pubkey&gt;</td><td>The MuSig2 aggregate plain public key from the <tt>KeyAgg</tt> algorithm. This key may or may not</td><td><tt>&lt;33 byte compressed pubkey&gt;*</tt></td><td>A list of the compressed public keys of the participants in the MuSig2 aggregate key in the order</td><td></td><td></td><td>0, 2</td><td><a href="/373" target="_blank">373</a></td></tr>
-<tr><td>MuSig2 Public Nonce</td><td><tt>PSBT_IN_MUSIG2_PUB_NONCE = 0x1b</tt></td><td><tt>&lt;33 byte compressed pubkey&gt; &lt;33 byte plain pubkey&gt; &lt;32 byte hash or omitted&gt;</tt></td><td>The compressed public key of the participant providing this nonce, followed by the plain public</td><td><tt>&lt;66 byte public nonce&gt;</tt></td><td>The public nonce produced by the <tt>NonceGen</tt> algorithm.</td><td></td><td></td><td>0, 2</td><td><a href="/373" target="_blank">373</a></td></tr>
-<tr><td>MuSig2 Participant Partial Signature</td><td><tt>PSBT_IN_MUSIG2_PARTIAL_SIG = 0x1c</tt></td><td><tt>&lt;33 byte compressed pubkey&gt; &lt;33 byte plain pubkey&gt; &lt;32 byte hash or omitted&gt;</tt></td><td>The compressed public key of the participant providing this partial signature, followed by the</td><td><tt>&lt;32 byte partial signature&gt;</tt></td><td>The partial signature produced by the <tt>Sign</tt> algorithm.</td><td></td><td></td><td>0, 2</td><td><a href="/373" target="_blank">373</a></td></tr>
+<tr><td>MuSig2 Participant Public Keys</td><td><tt>PSBT_IN_MUSIG2_PARTICIPANT_PUBKEYS = 0x1a</tt></td><td>&lt;33 byte aggregate pubkey (compressed)&gt;</td><td>The MuSig2 aggregate public key (compressed) from the <tt>KeyAgg</tt> algorithm. This key may or may not</td><td><tt>&lt;33 byte participant pubkey (compressed)&gt;*</tt></td><td>A list of the compressed public keys of the participants in the MuSig2 aggregate key in the order</td><td></td><td></td><td>0, 2</td><td><a href="/373" target="_blank">373</a></td></tr>
+<tr><td>MuSig2 Public Nonce</td><td><tt>PSBT_IN_MUSIG2_PUB_NONCE = 0x1b</tt></td><td><tt>&lt;33 byte participant pubkey (compressed)&gt; &lt;33 byte aggregate pubkey (compressed)&gt; &lt;32 byte hash or omitted&gt;</tt></td><td>The compressed public key of the participant providing this nonce, followed by the compressed aggregate public</td><td><tt>&lt;66 byte public nonce&gt;</tt></td><td>The public nonce produced by the <tt>NonceGen</tt> algorithm.</td><td></td><td></td><td>0, 2</td><td><a href="/373" target="_blank">373</a></td></tr>
+<tr><td>MuSig2 Participant Partial Signature</td><td><tt>PSBT_IN_MUSIG2_PARTIAL_SIG = 0x1c</tt></td><td><tt>&lt;33 byte participant pubkey (compressed)&gt; &lt;33 byte aggregate pubkey (compressed)&gt; &lt;32 byte hash or omitted&gt;</tt></td><td>The compressed public key of the participant providing this partial signature, followed by the</td><td><tt>&lt;32 byte partial signature&gt;</tt></td><td>The partial signature produced by the <tt>Sign</tt> algorithm.</td><td></td><td></td><td>0, 2</td><td><a href="/373" target="_blank">373</a></td></tr>
 <tr><td>Silent Payment Input ECDH Share</td><td><tt>PSBT_IN_SP_ECDH_SHARE = 0x1d</tt></td><td><tt>&lt;33 byte scan key&gt;</tt></td><td>The scan key that this ECDH share is for.</td><td><tt>&lt;33 byte share&gt;</tt></td><td>An ECDH share for a scan key. The ECDH shared is computed with <em>a * B_scan</em>, where <em>a</em> is the private key of the corresponding prevout public key, and <em>B_scan</em> is the scan key of a recipient.</td><td></td><td>0</td><td>2</td><td><a href="/375" target="_blank">375</a></td></tr>
 <tr><td>Silent Payment Input DLEQ Proof</td><td><tt>PSBT_IN_SP_DLEQ = 0x1e</tt></td><td><tt>&lt;33 byte scan key&gt;</tt></td><td>The scan key that this proof covers.</td><td><tt>&lt;64-byte proof&gt;</tt></td><td>A BIP374 DLEQ proof computed for the matching ECDH share.</td><td></td><td>0</td><td>2</td><td><a href="/375" target="_blank">375</a></td></tr>
 <tr><td>Proprietary Use Type</td><td><tt>PSBT_IN_PROPRIETARY = 0xFC</tt></td><td><tt><compact size uint identifier length> <bytes identifier> <compact size uint subtype> <bytes subkeydata></tt></td><td>Compact size unsigned integer of the length of the identifier, followed by identifier prefix, followed by a compact size unsigned integer subtype, followed by the key data itself.</td><td><tt><bytes data></tt></td><td>Any value data as defined by the proprietary type user.</td><td></td><td></td><td>0, 2</td><td>174</td></tr>
@@ -242,7 +242,7 @@ <h2>Specification</h2>
 <tr><td>Taproot Internal Key</td><td><tt>PSBT_OUT_TAP_INTERNAL_KEY = 0x05</tt></td><td>None</td><td>No key data</td><td><tt>&lt;32 byte xonlypubkey&gt;</tt></td><td>The X-only pubkey used as the internal key in this output.</td><td></td><td></td><td>0, 2</td><td><a href="/371" target="_blank">371</a></td></tr>
 <tr><td>Taproot Tree</td><td><tt>PSBT_OUT_TAP_TREE = 0x06</tt></td><td>None</td><td>No key data</td><td><tt>{&lt;8-bit uint depth&gt; &lt;8-bit uint leaf version&gt; <compact size uint scriptlen> <bytes script>}*</tt></td><td>One or more tuples representing the depth, leaf version, and script for a leaf in the Taproot tree, allowing the entire tree to be reconstructed. The tuples must be in depth first search order so that the tree is correctly reconstructed. Each tuple is an 8-bit unsigned integer representing the depth in the Taproot tree for this script, an 8-bit unsigned integer representing the leaf version, the length of the script as a compact size unsigned integer, and the script itself.</td><td></td><td></td><td>0, 2</td><td><a href="/371" target="_blank">371</a></td></tr>
 <tr><td>Taproot Key BIP 32 Derivation Path</td><td><tt>PSBT_OUT_TAP_BIP32_DERIVATION = 0x07</tt></td><td><tt>&lt;32 byte xonlypubkey&gt;</tt></td><td>A 32 byte X-only public key involved in this output. It may be the output key, the internal key, or a key present in a leaf script.</td><td><tt><compact size uint number of hashes> &lt;32 byte leaf hash&gt;* &lt;4 byte fingerprint&gt; &lt;32-bit little endian uint path element&gt;*</tt></td><td>A compact size unsigned integer representing the number of leaf hashes, followed by a list of leaf hashes, followed by the 4 byte master key fingerprint concatenated with the derivation path of the public key. The derivation path is represented as 32-bit little endian unsigned integer indexes concatenated with each other. Public keys are those needed to spend this output. The leaf hashes are of the leaves which involve this public key. The internal key does not have leaf hashes, so can be indicated with a <tt>hashes len</tt> of 0. Finalizers should remove this field after <tt>PSBT_IN_FINAL_SCRIPTWITNESS</tt> is constructed.</td><td></td><td></td><td>0, 2</td><td><a href="/371" target="_blank">371</a></td></tr>
-<tr><td>MuSig2 Participant Public Keys</td><td><tt>PSBT_OUT_MUSIG2_PARTICIPANT_PUBKEYS = 0x08</tt></td><td>&lt;33 byte plain aggregate pubkey&gt;</td><td>The MuSig2 aggregate plain public key from the <tt>KeyAgg</tt> algorithm. This key may or may not</td><td><tt>&lt;33 byte compressed pubkey&gt;*</tt></td><td>A list of the compressed public keys of the participants in the MuSig2 aggregate key in the order</td><td></td><td></td><td>0, 2</td><td><a href="/373" target="_blank">373</a></td></tr>
+<tr><td>MuSig2 Participant Public Keys</td><td><tt>PSBT_OUT_MUSIG2_PARTICIPANT_PUBKEYS = 0x08</tt></td><td><tt>&lt;33 byte aggregate pubkey (compressed)&gt;</tt></td><td>The MuSig2 compressed aggregate public key from the <tt>KeyAgg</tt> algorithm. This key may or may not</td><td><tt>&lt;33 byte participant pubkey (compressed)&gt;*</tt></td><td>A list of the compressed public keys of the participants in the MuSig2 aggregate key in the order</td><td></td><td></td><td>0, 2</td><td><a href="/373" target="_blank">373</a></td></tr>
 <tr><td>Silent Payment Data</td><td><tt>PSBT_OUT_SP_V0_INFO = 0x09</tt></td><td>None</td><td>No key data</td><td><tt>&lt;33 byte scan key&gt; &lt;33 byte spend key&gt;</tt></td><td>The scan and spend public keys from the silent payments address.</td><td></td><td>0</td><td>2</td><td><a href="/375" target="_blank">375</a></td></tr>
 <tr><td>Silent Payment Label</td><td><tt>PSBT_OUT_SP_V0_LABEL = 0x0a</tt></td><td>None</td><td>No key data</td><td><tt>&lt;32-bit little endian uint label&gt;</tt></td><td>The label to use to compute the spend key of the silent payments address to verify change.</td><td></td><td>0</td><td>2</td><td><a href="/375" target="_blank">375</a></td></tr>
 <tr><td>BIP 353 DNSSEC proof</td><td><tt>PSBT_OUT_DNSSEC_PROOF = 0x35</tt></td><td>None</td><td>No key data</td><td><tt>&lt;1-byte-length-prefixed BIP 353 human-readable name&gt;&lt;RFC 9102-formatted AuthenticationChain DNSSEC Proof&gt;</tt></td><td>A BIP 353 human-readable name (without the ₿ prefix), prefixed by a 1-byte length.</td><td></td><td></td><td>0, 2</td><td><a href="/353" target="_blank">353</a></td></tr>