feat: blobless blocksync

[cmwaters]

Summary

Assuming that blobs dominate in size within a block yet aren't required for state execution, we could formulate a mode of blocksync whereby nodes request and respond with blocks in a reduced form (without any blobs). The nodes would perform some verification that the provided set of transactions in this reduced block was complete and exhaustive and simply execute and store the reduced block.

I haven't given much thought to verification. Roughly, the responding node would need to provide the transactions in share form including the padding or next share (to prove the end of transactions) and the requesting node would use the data availability header to prove inclusion of those transactions.

The benefits of such a feature are reduced bandwidth and disk space.

---

For Admin Use

• Not duplicate issue
• Appropriate labels applied
• Appropriate contributors tagged
• Contributor assigned/self-assigned

[cmwaters]

Closing this as a duplicate of #994