Distributed computing system and method of operation thereof

1. A distributed computation system that establishes a consensus related to a computational value of a computational task, wherein the distributed computation system includes a plurality of computing nodes, wherein each of the plurality of computing nodes comprises at least one hardware processor, wherein:

the distributed computation system having plurality of computing nodes is configured to distribute the computational task to the plurality of computing nodes;

each of a first set of computing nodes, from the plurality of computing nodes, is configured to generate a partial evaluation of the computational task using a partial evaluation algorithm without any interaction among plurality of computing nodes, wherein the first set of computing nodes store the partial evaluations of the computational task in a ledger arrangement associated with the plurality of computing nodes;

each of a second set of computing nodes from the plurality of computing nodes is configured to generate a computational value corresponding to each of the partial evaluations stored in the ledger arrangement and determine a correctness proof of each of the computational values using a recovery algorithm without any interaction among plurality of computing nodes, such that the correctness proof eliminates a need to communicate with other computing nodes for validating the computational values generated by the second set of computing nodes;

each of a third set of computing nodes from the plurality of computing nodes is configured to validate the correctness proof of each of the computational value to establish consensus related to the computational values, such that a time required for validation is reduced thereof, and use of unsafe communication channels is eliminated due to the non-interactivity of the plurality of computing nodes, and a temporal responsiveness of the computation system is increased when executing various data processing tasks;

wherein the plurality of computing nodes participates in an interactive distributed key generation, wherein each of the plurality of computing nodes is configured to interact with other computing nodes using a confidential and authenticated communication channel.

2. The system of claim 1 , wherein the partial evaluation algorithm is a partial pseudorandom function computation, wherein given a plaintext input x, the pseudorandom function utilizes a cryptographically secure elliptic curve and a non-interactive zero-knowledge proof system to test that the partial computations of pseudo-random values provided by computing nodes are correct, without revealing the information itself or any additional information.

3. The system of claim 1 , wherein the recovery algorithm uses a public key, plaintext and list of partial evaluations as an input along with verification keys, the algorithm outputs either a corresponding pair of computational value and the correctness proof, or rejects the output and sets the computational value to being unconditionally false.

4. The system of claim 1 , wherein the third set of computing nodes verify correctness of the computational value of each of the partial evaluations of the computational task using a verification algorithm.

5. A method of operating a distributed computation system that establishes a consensus related to a computational value of a computational task, wherein the distributed computing system includes a plurality of computing nodes, wherein each of the plurality of computing nodes comprises at least one hardware processor, wherein the method includes:

distributing the computational task to the plurality of computing nodes;

generating a partial evaluation of the computational task using a partial evaluation algorithm without any interaction among plurality of computing nodes by each of a first set of computing nodes, from the plurality of computing nodes, wherein the first set of computing nodes store the partial evaluations of the computing task in a ledger arrangement associated with the plurality of computing nodes;

generating a computational value corresponding to each of the partial evaluations stored in the ledger arrangement and determine a correctness proof of each of the computational value using each of a second set of computing nodes from the plurality of computing nodes using a recovery algorithm without any interaction among plurality of computing nodes, such that the correctness proof eliminates a need to communicate with other computing nodes for validating the computational values generated by the second set of computing nodes; wherein using a public key, plaintext and list of partial evaluations as an input along with verification keys, the algorithm outputs either a corresponding pair of computational value and correctness proof, or rejects the output and sets the computational value to being unconditionally false and;

validating the correctness proof of each of the computational value to establish consensus related to the computational values using a third set of computing nodes from the plurality of computing nodes such that a time required for validation is reduced thereof, and use of unsafe communication channels is eliminated due to the non-interactivity of the plurality of computing nodes, and a temporal responsiveness of the computation system is increased when executing various data processing tasks;

wherein the method comprises the plurality of computing nodes participating in an interactive distributed key generation using a confidential and authenticated communication channel.

6. The method of claim 5 , wherein the partial evaluation algorithm is a partial pseudorandom function computation, wherein given a plaintext input x, the method comprises the pseudorandom function utilizing a cryptographically secure elliptic curve and a non-interactive zero-knowledge proof system to test that the partial computations of pseudo-random values provided by computing nodes are correct, without revealing the information itself or any additional information.

7. The method of claim 5 , wherein the method comprises the third set of computing nodes verifying the correctness of the computational value of each of the partial evaluations of the computational task using a verification algorithm.