The Acks field, in bytes #
The executable codec for the Acks field, following katzenqt's ack_codec.py: the count less
one, the members named as a list or a bitmap, whichever is shorter, then each one's Idx64,
little-endian. Each definition follows its namesake in Cryptlib.Protocols.GroupComm.GroupChatKatzenqt1.AckCodec, whose
theorems AckBytesProofs carries over to this one. Reading is not strict: like katzenqt, it
accepts a list where the bitmap would have been shorter.
The longest naming: a bitmap reaching roster index 255.
Instances For
Bytes in a value: an Idx64.
Instances For
Bytes a bitmap needs to reach roster index i.
Equations
Instances For
Whether bit k of byte j marks a member of idx: index i is bit 7 - i % 8 of byte
i / 8.
Equations
Instances For
Equations
Instances For
Equations
- One or more equations did not get rendered due to their size.
- Cryptlib.Protocols.GroupComm.GroupChatKatzenqt1.Member.AckBytes.ascending x✝ = true
Instances For
The n values of v bytes that follow the naming.
Equations
Instances For
The k bytes of n, least significant first.
Equations
Instances For
The number little-endian bytes spell.
Equations
- Cryptlib.Protocols.GroupComm.GroupChatKatzenqt1.Member.AckBytes.fromLE l = List.foldr (fun (b n : Nat) => b + 256 * n) 0 l
Instances For
Equations
Instances For
The field for acks, pairs of roster index and Idx64 in ascending order of index, as
numbers below 256.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The acknowledgements a field carries, or none when it is malformed.