VerifyContent indicates whether a given content is in the tree and the hashes are valid for that content.Returns true if the expected Merkle Root is equivalent to the Merkle root calculated on the critical pathfor a given content.

Serializes the input and returns the sha3 hash function applied on ths input.

1min.

24 hours.

2^60.

100MB.

2^60.

1000 Blocks (totally random).

2^60.

semi-synchronous time difference between local clock of validators.

30 seconds.

1KB.

All fixed sizes form the Block struct are 254.

amount in seconds.

reward for providing a valid slashing proof.

window size where a node has to commit itself to a competing branch in case of a fork.

minimum number of coins for staking.

number of blocks that must a new validator must wait before it can start validating.

MerkleTree is the container for the tree.

Node represents a node, root, or leaf in the tree.