Believe it or not this is Hashgraph 
The hash of that unsigned message identifies a random sample of
M validators (the closer M is to infinity, the better, but the more overhead)
What does prevent one from trying a message candidate many times until a favorable set of validators is derived (all bad guys) ?)))