Hypercube topology for byzantine fault tolerant solutions to reduce network communication overhead of PBFT-based protocols

A non-transitory storage medium having stored therein instructions that are executable by one or more hardware processors to perform operations comprising:

• receiving, by each node in a group of nodes that is organized in a logical hypercube topology, a message from a primary node that is a member of the group of nodes;
• when none of the nodes in the group of nodes are faulty, for each of ‘n’ prepare phases and ‘n’ commit phases of a communication protocol, where ‘n’ is an integer that is equal to, or greater than, 1:
• transmitting, by each node to only a first respective pair node, a first group of one or more messages accumulated by the node performing the transmitting;
• receiving, by each node from only a second respective pair node, a second group of one or more messages accumulated by the second respective pair node;
• and
• wherein after the ‘n’ prepare phases and ‘n’ commit phases have been completed, each of the nodes has accumulated at least a minimum number of total messages to declare consensus;
• and
• after the ‘n’ prepare phases and ‘n’ commit phases have been completed, transmitting, by each node to a client, a reply.