Description
Current implementation of the CQueue and Match performs decoding on each check of the message, this is may be a huge performance hit for messages that are expensive to decentralize. We may implement solution that will memoise deserialization result.
We may use following approach:
Match could return 3 possible cases Matched a | Decoded b | NotMatch, where Matched a stands for match success, Decoded b stands for - fingerprint matches, but not message, in and deserialised value is returned, NotMatch stands for a case when fingerprint was not match or message is already decoded. Then CQueue implementation will alter CQueue and put decoded message instead of encoded.
It's possible to use Either a b instead where instead of NotMatch Left input will be returned, so queue will always be altered if message was not matched. However we need to check what approach will be cheaper.
CC: @dcoutts, @facundominguez.