Good morning Matt,
> While I admit I haven’t analyzed the feasibility, I want to throw one
> additional design consideration into the ring.
>
> Namely, it would ideally be trivial, at the p2p protocol layer, to relay a
> transaction to a full node without knowing exactly which input transaction
While I admit I haven’t analyzed the feasibility, I want to throw one
additional design consideration into the ring.
Namely, it would ideally be trivial, at the p2p protocol layer, to relay a
transaction to a full node without knowing exactly which input transaction that
full node has in its me
Good morning Richard,
> Thanks AJ for the updated BIP - very exciting!
>
> I'm also interested in this in the context of a Taproot version of
> Decker-Russell-Osuntokun (eltoo). Thanks ZmnSCPxj for summarizing your
> thoughts on how this would work. I have had some difficulty understanding
> wh
With the help of Pieter I've recently made some interesting mathematical
observations about Bech32 codewords and Shamir's secret sharing:
(1) Affine combinations of two Bech32 codewords is again a valid Bech32
codeword.
(2) Lagrange polynomials form a partition of unity.
The consequences of these
Thanks AJ for the updated BIP - very exciting!
I'm also interested in this in the context of a Taproot version of
Decker-Russell-Osuntokun (eltoo). Thanks ZmnSCPxj for summarizing your
thoughts on how this would work. I have had some difficulty understanding
when someone might want to use ANYPREVO
