When participants in a game channel distribute state proofs to each other (when they send moves around), it is not necessary to include/sign full states, which might be big. Instead, signatures can be made on hashes of states, and states that are known to every participant already can be left out, too.
When putting data on chain for a dispute, the participant filing it can fill in any states matching the signed hashes. This would save bandwidth on the off-chain communication.
Note that this requires deterministic serialisation of states (instead of ParsedBoardState::Equals to allow for non-deterministic serialisation of e.g. protocol buffers), so that the signing of hashes works.
When participants in a game channel distribute state proofs to each other (when they send moves around), it is not necessary to include/sign full states, which might be big. Instead, signatures can be made on hashes of states, and states that are known to every participant already can be left out, too.
When putting data on chain for a dispute, the participant filing it can fill in any states matching the signed hashes. This would save bandwidth on the off-chain communication.
Note that this requires deterministic serialisation of states (instead of
ParsedBoardState::Equalsto allow for non-deterministic serialisation of e.g. protocol buffers), so that the signing of hashes works.