MerkleTree/main2.cpp at master · thebevrishot/MerkleTree · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
#include "merkletree.h"
#include <time.h>

#define TEST_INSERT 1
#define DUMP_TREE

using namespace std;

void calSHA256(char* inp,char out_buff[65]){
  unsigned char hash[SHA256_DIGEST_LENGTH];
  SHA256_CTX sha256;
  SHA256_Init(&sha256);
  SHA256_Update(&sha256, inp, strlen(inp));
  SHA256_Final(hash, &sha256);

  //char buffx[65];
  for(int i = 0; i < SHA256_DIGEST_LENGTH; i++)
  {
    sprintf(out_buff + (i * 2), "%02x", hash[i]);
  }
  out_buff[65] = 0;
  //memcpy(out_buff,buffx,65);
}

int main(){

  int Leaf;
  scanf("%d",&Leaf);
//  for(int i=0;i<33554432;i++);


  vector<char*> v(Leaf-TEST_INSERT);

  for(int i =0;i<Leaf-TEST_INSERT;i++){
    char *buff = new char[65];
    scanf("%65s\n",buff );
    v[i] = buff;
  }

	clock_t t;
	t = clock();
  merkletree mtree = merkletree(v);

  printf("maked merkle\n");


  for(int i=Leaf-TEST_INSERT;i<Leaf;i++){
	  char* buff = new char[65];
	  scanf("%65s\n",buff);
	  v.push_back(buff);
	  mtree.pushleaf(v[i]);

  }

#ifdef DUMP_TREE
  for(int i=0;i<v.size();i++)
      printf("leave : %s\n",v[i]);
  for(int i=0;i<mtree.tree.size();i++)
      printf("node : %s\n",mtree.tree[i]);
#endif


  printf("root : %s\n",mtree.root());
	t = clock() - t;
	printf("[build mtree] took %d clocks (%f secs)\n",t,(float)t/CLOCKS_PER_SEC);

	t = clock();


  for(int i=0;i<v.size();i++){
	    char* leaf = v[i];
//	printf("leaf : %s\nroot : %s\n",leaf,mtree.root());
      vector<ProofNode> proof = mtree.proof(leaf);

//	for(int i = 0 ;i<proof.size();i++){
//		printf("parent : %s\nleft : %s\nright : %s\n",proof[i].parent,proof[i].right,proof[i].left);
//	}

	t = clock() - t;
	printf("[get proof] took %d clocks (%f secs)\n",t,(float)t/CLOCKS_PER_SEC);

	t = clock();

        bool verproof = verifyProof(leaf,mtree.root(),proof);

        t = clock() - t;
        printf("[verify proof][ => %d ] took %d clocks (%f secs)\n",verproof,t,(float)t/CLOCKS_PER_SEC);
      }


      for(int i=0;i<mtree.size();i++){
        char* leaf = mtree.tree[i];
        vector<ProofNode> proof = mtree.proof(leaf);

      //	for(int i = 0 ;i<proof.size();i++){
      //		printf("parent : %s\nleft : %s\nright : %s\n",proof[i].parent,proof[i].right,proof[i].left);
      //

//	char *sr = serialize(old_proof);
//	vector<ProofNode> proof = deserialize(sr);

        t = clock() - t;
        //printf("[get proof] took %d clocks (%f secs)\n",t,(float)t/CLOCKS_PER_SEC);

        t = clock();

    //          bool verproof = verifyProof(leaf,mtree.root(),proof);

              bool verproof = verifyProof(leaf,mtree.root(),proof);

              t = clock() - t;
              printf("[verify proof][ =< %d ] took %d clocks (%f secs)\n",verproof,t,(float)t/CLOCKS_PER_SEC);
      }


}