Newsletters: add 392 (2026-02-13)#2642
Conversation
jirijakes
left a comment
There was a problem hiding this comment.
Maybe also use K<sub>max</sub>?
| and adds an auxiliary file to [BIP324][] tracking one-byte ID | ||
| assignments across BIPs to help developers avoid conflicts. The file | ||
| also records [utreexo][topic utreexo]'s proposed assignments from | ||
| [BIP183][]. |
|
Added lede, topics, some changes to the SP news item. |
theStack
left a comment
There was a problem hiding this comment.
Thanks for covering the BIP-352 K_max protocol restriction topic! Left some late nits about that, feel free to ignore.
e3c3d74 to
1d93bc1
Compare
1d93bc1 to
74fcfdf
Compare
| constructs a transaction with a large number of taproot outputs (23255 max outputs per | ||
| block according to current consensus rules) that all target the same entity. |
There was a problem hiding this comment.
| constructs a transaction with a large number of taproot outputs (23255 max outputs per | |
| block according to current consensus rules) that all target the same entity. | |
| constructs a transaction with a large number of taproot outputs (up to 23255 outputs per | |
| block, the current consensus limit) that all target the same entity. |
| If there were no limit on group size, it would take several minutes | ||
| to process, rather than tens of seconds. | ||
|
|
||
| This motivated a mitigation to add a new parameter, `K_max`, that limits the |
There was a problem hiding this comment.
| This motivated a mitigation to add a new parameter, `K_max`, that limits the | |
| This motivated the addition of a new parameter, `K_max`, that limits the |
| to process, rather than tens of seconds. | ||
|
|
||
| This motivated a mitigation to add a new parameter, `K_max`, that limits the | ||
| number of per-group recipients within a single transaction. In theory, this |
There was a problem hiding this comment.
| number of per-group recipients within a single transaction. In theory, this | |
| number of per-group recipients in a single transaction. In theory, this |
| protocols, such as [ECDH][ecdh wiki], in which any participant can derive a shared | ||
| secret using their private key and the other participant's public key. It also applies | ||
| a [Non-interactive Zero Knowledge proof][nizk wiki] to make circuit resolution | ||
| verifiable and to prevent cheating. |
There was a problem hiding this comment.
| verifiable and to prevent cheating. | |
| verifiable and prevent cheating. |
| Another important advantage of BLISK with respect to other approaches is | ||
| eliminating the need to generate a fresh key pair. In fact, it allows connecting an |
There was a problem hiding this comment.
| Another important advantage of BLISK with respect to other approaches is | |
| eliminating the need to generate a fresh key pair. In fact, it allows connecting an | |
| Another important advantage of BLISK over other approaches is the | |
| elimination of the need to generate a fresh key pair. In fact, it allows connecting an |
| Kurbatov provided a [proof-of-concept][blisk gh] for the protocol, although he stated | ||
| that the framework has not reached production maturity yet. |
There was a problem hiding this comment.
| Kurbatov provided a [proof-of-concept][blisk gh] for the protocol, although he stated | |
| that the framework has not reached production maturity yet. | |
| Kurbatov provided a [proof-of-concept][blisk gh] for the protocol, though he stated | |
| that the framework has not yet reached production maturity. |
|
Added a topic entry for the consensus cleanup Thank you @Gustavojfe @TumaBitcoiner @kevkevinpal for authoring and @LarryRuane @theStack @jirijakes for reviewing! |
Note: no PR Review Club this week as there was no recent meeting