g0ph3r byzantine (dissarange class exercise)
	The Byzantine Generals Problem - 	http://www.cs.cornell.edu/gupta/byzantine.htm
	The setting: There are n generals, one of them the commanding general. Generals can send (and receive) messages from other generals.
	The problem: Develop a communication protocol for the commanding general to send an order to the n-1 lieutenant generals so that
   		1. All loyal lieutenants obey the same order
   		2. If the commanding general is loyal, every loyal lieutenant obeys the order he sends.
	Adversary: Any of the generals could be traitors i.e., could send inconsistent messages regarding the order to other generals.
	>> written in Java. A solution with (unforgable) signed messages