Size can be used to simulate large transactions in the network.

removeOldEpochs removes the ACS instances that have already been terminated.

sample will return (n) elements from the buffer with (m) as its maximum upperbound. [ a ] [ b ] [ c ] m [ d ] In the above example there can be only s

tryOutputAgreement waits until at least (N - f) output messages received, once the (N - f) messages are received, make a common coin and uses it to co

Loop that is creating bunch of random transactions.

Addr implements the Transport interface.

Connect implements the Transport interface.

Consume implements the Transport interface.

HandleMessage will process the given rpc message and will return a possible outcome. The caller is resposible to make sure only RPC messages are passe

HandleMessage will process the given ACSMessage for the given epoch.

Hash implements the hbbft.Transaction interface.

Hash implements the hbbft.Transaction interface.

LenMempool returns the number of transactions in the buffer.

Messages returns all the internal messages from the message que. Note that the que will be empty after invoking this method.

SendMessage implements the transport interface.

Test ACS with 4 good nodes. The result should be that at least the output of (N - f) nodes has been provided.

Test BBA with 2 false and 2 true nodes, cause binary agreement is not a majority vote it guarantees that all good nodes output a least the output of o

Testing BBA should cover all of the following specifications. 1. If a correct node outputs the value (b), then every good node outputs (b). 2. If all

Test RBC where 1 node will not provide its value. We use 4 nodes that will tolerate 1 faulty node. The 3 good nodes should be able te reconstruct the

Test RBC with 4 good nodes in the network. We expect all 4 nodes to output the proposed value.