sdaveas / popow Goto Github PK

Possible reasons:

• implementation of EVM is slow
• proof is too big

Edit:
proof of 45.000 and 450.000 blocks takes around the same time

Ultimately, display gas-per-line

Operation from , Algorithm 1, line 10 is missing from

---------+---x1---->  Ca
         |
         +--->        Cb

and

---------+-------->   Ca
         |
         +--x2->      Cb

• Create chains Ca and Cb which have a common ancestor block
• Only Ca contains block x1 and only Cb contains x2
• Execute the following:
  1.|Ca| > |Cb|: Execute submit_event_proof(Ca, x1) and submit_contesting_proof(Cb, x1)
  2.|Ca| > |Cb|: Execute submit_event_proof(Cb, x2) and submit_contesting_proof(Ca, x2)

Update

Pn denotes the proof that was generated for chain Cn

x0 contained in Pa and Pb

---x0---+-------->  Ca
        |
        +--->       Cb

x1 contained in Pa but not in Pb

--------+---x1--->  Ca
        |
        +--->       Cb

x2 contained in Pb but not in Pb

--------+---------->  Ca
        |
        +--x2-->      Cb

Py-EVM's time should be displayed after Ganache's start message. Instead, we are getting this:

Testing Py-EVM
Deploying satellite connection
submit_event_proof  10888154
Testing ganache // This sould be displayed after the row below
Time elapsed: 7.63306736946106

Value has not been added to the function call of Web3. Due to this fact, the value of collateral to pay z in the contract manually becomes 0.

This issue was opened from the terminal!

Check if everything is legit in .

See a32079a.
This is also related to #9
(That was a false alarm, see #8 (comment))

After aae3a12 the gas results for submitting an invalid contesting_contesting_proof() were the following
see #8 (comment)

Issue #9 did some high level testing but there are more some case to be addressed.
This will close #2 as well

Check if nipopowContract.sol works correctly under in the following cases:

1. The interlinks are invalid
   1. Inclusion fail (wrong Merkle Tree) (see #13 (comment))
   2. Block(s) indicated by some interlink at some level is missing (see #13 (comment))
   3. Leaf of Merkle Tree does not point to the previous block
2. Proof succeeds at all cases regarding different μ s
   1. μ1 = μ2
   2. μ1 < μ2
   3. μ1 > μ2
3. Chain does not start from genesis (see #13 (comment))
4. Less collateral than needed is provided (see (#13 (comment)))
5. Check if each block has the difficulty of genesis target
   1. Contract should fail calling submit with insufficient funds
   2. Refund collateral to honest caller

struct Nipopow consists of various attributes, some of which are used only locally in functions. Check if they can be removed from the struct and used as local variables. This will save storage gas.

  // Nipopow proof.
  struct Nipopow {
    mapping (bytes32 => bool) curProofMap;       // <--- This one
    mapping (uint => uint) levelCounter;         // <--- This one
    mapping (bytes32 => mapping(bytes32 => bool)) blockPrecedence;
    mapping (bytes32 => bytes32[]) blockDAG;
    mapping (bytes32 => bool) visitedBlock;
    bytes32[] traversal_stack;
    bytes32[] ancestors;
    bytes32[] best_proof;
  }