(project dev here) There are several levels of consensus. Parsec is a strict order (CP) algorithm. There are also AP (strongly eventually consistent) algorithms in play here. These are more concurrent consensus (think CRDT and causal order). Now if we back out a wee bit there are some places where strict order is an easy answer, but I personally feel these are all likely to become much more AP like in the future.

Then malice, it's a different module/behavior and requires we either prove the code (SGX etc. which currently is a bit too early) or we add malice detection across the board. This means nodes must not only be on-line or accepting messages, they must not create invalid messages etc. and this is not to difficult to deect. Then add to that the hard detection which is did the node process and forward/reply correctly? This is hard and requires a syncronicity assumption. I belive many projects focus on async everything meaning a node can reply at any time in the future and this is a bit tricky if you have memebrship changes (look at swim etc. for gossip). So for us we make the sync assumtion and have moved to allow a period (of events) that nodes must message (vote etc.) correctly. Then we apply the message malice detection. So malice detection is system wide and a very large area of decentralised networks at this level.