When adding the signer field to the shares, we could add an additional rule to the namespace, which is sorting the namespace by the signer.
This CIP aims to make zk proving the fork choice rule easier by limiting how much you have to prove from the namespace.
In the original proposal, Sovereign would have to go through all the blobs of a namespace and look at the first share of each blob. If you sort it by the signer, you would only have to provide the blobs of a particular signer.
We can prove completeness by showing the first share of the left and right blob adjacent to the blobs of the signer we want to prove against.
This would solve the Woods Attack, where the set of signers is limited.
1 Like