This is a special post for quick takes by Richard_Ngo. Only they can create top-level comments. Comments here also appear on the Quick Takes page and All Posts page.
IIRC in Byzantine fault tolerance the assumption usually is that cryptographic primitives can be trusted and for 3f+1 at most f nodes are corrupted. The corrupted nodes can output anything. E.g. the Dolev-Strong protocol only assumes (1) a known number of nodes, (2) a public key infrastructure and (3) synchronized communication. But I guess your thought is around someone corrupting a specific part of all nodes? Dolev-Strong assumes you run more rounds than there are corrupted nodes.