With respect to the free DA problem could you have something like the following ?:
- The proposers submit transaction payloads
- There is some deterministic concatenation of the two that also throws out invalid txs
- The proposers review the resulting block and only sign if all their txs were included and the dedupe was done properly
Iiuc the free DA problem would be mitigated because any invalid txs would be removed as a prerequisite to signing the concatenated block.
In @mikeneuder 's post on No Free Lunch, the free DA problem is said to exist if the following conditions are met :
Observation 1) Any inclusion list scheme that
- allows proposers to commit to specific transactions before seeing their payload, and
- relies on the state-transition function to enforce the IL commitments,
admits free DA.
In this case the proposers wouldn’t commit to specific transactions before seeing their payload so it wouldn’t be a problem. Consensus could also check to see if the concatenation was done properly and reject the block if not. Could have missed some important details so any clarification would be appreciated.