Jeff Burdges

As an aside, it's plausible a soundness proof for some flavor of this winds up being an interesting paper for some academics.

As only a node of the parachain not a collator?

We could replicate a subtree between the relay chain and parachain, which helps non-collator parachain full nodes do not require being relay chain full nodes. We do simplify several important...

At present [a code block can appear as a match expression](https://is.gd/gi12sp), like if you write a `do .. while` loop as `while { body; condition } { }`, but a...

Would `fn foo(..) = ..;` infer the return type? Or do you mean more like ``` fn foo(x: X, y: Y) -> Z = Z::Initial(match x { ... }?); ```

Afaik you'd almost always want arity aka rate four in practice, not the two [here](https://github.com/arkworks-rs/crypto-primitives/blob/623962969dce8c5a9f928c3ef3df16550150eb6a/src/merkle_tree/tests/test_utils.rs#L654), but that'll never work with the Merkle tree here

Afaik, binary fields need many custom optimizations, both in the field itself and in the algorithms that use them. See https://github.com/AndersTrier/reed-solomon-simd or [Binus [DP] SNARK](https://eprint.iacr.org/2023/1784), which both depend upon the...

We think nodes could determine when they're fully synced using this, which benefits the relative time or and approval assignments subprotocols. As discussed in https://github.com/w3f/polkadot-spec/pull/168 we'll need to expand upon...

I think this superseds paritytech/polkadot-sdk#93

This seems fine imho. There is techncially a DoS vector here of course, but mostly we design messaging and bridges to prefent exploiting that sort of thing.