I don't believe any of the code would change, except for .len calls (which simply transform to .card). That said, adding to the group would never require a resize, and we can check for existing inclusion in O(1) instead of O(n). We already don't expect this to be sorted, and call sort where needed (serialization for merkle proofs). That should remain unchanged.
If we also edit VerificationPacket objects, combing them into existing statuses also becomes much more efficient.
I don't believe any of the code would change, except for
.lencalls (which simply transform to.card). That said, adding to the group would never require a resize, and we can check for existing inclusion in O(1) instead of O(n). We already don't expect this to be sorted, and call sort where needed (serialization for merkle proofs). That should remain unchanged.If we also edit VerificationPacket objects, combing them into existing statuses also becomes much more efficient.