summaryrefslogtreecommitdiff
path: root/tools/certtools.py
diff options
context:
space:
mode:
authorMagnus Ahltorp <map@kth.se>2015-02-20 01:58:17 +0100
committerLinus Nordberg <linus@nordberg.se>2015-02-20 14:12:48 +0100
commit81a35a696d813ac5803afe602e549b56a9dfd9c4 (patch)
tree287a984d768938160cd91439d3c55a3b5211be9c /tools/certtools.py
parent8fa65d708aa1bb44609c2fdc755520e21328b175 (diff)
testcase1: Actually verify inclusion proof
Diffstat (limited to 'tools/certtools.py')
-rw-r--r--tools/certtools.py26
1 files changed, 24 insertions, 2 deletions
diff --git a/tools/certtools.py b/tools/certtools.py
index 11e09bb..fdff0e1 100644
--- a/tools/certtools.py
+++ b/tools/certtools.py
@@ -512,10 +512,11 @@ def path_as_string(pos, level, treesize):
return ""
return path
-def nodes_for_pos(pos, treesize):
+def nodes_for_subtree(subtreesize, treesize):
height = merkle_height(treesize)
nodes = []
level = 0
+ pos = subtreesize
while pos > 0 and pos & 1 == 0:
pos >>= 1
level += 1
@@ -532,8 +533,29 @@ def nodes_for_pos(pos, treesize):
level += 1
return nodes
+def nodes_for_index(pos, treesize):
+ height = merkle_height(treesize)
+ nodes = []
+ level = 0
+ pos ^= 1
+ #print pos, level
+ while level < height:
+ pos_level0 = pos * (2 ** level)
+ #print pos, level
+ if pos_level0 < treesize:
+ nodes.append((pos, level))
+ pos >>= 1
+ pos ^= 1
+ level += 1
+ return nodes
+
def verify_consistency_proof(consistency_proof, first, second):
- chain = zip(nodes_for_pos(first, second), consistency_proof)
+ chain = zip(nodes_for_subtree(first, second), consistency_proof)
(_, hash) = reduce(lambda e1, e2: combine_two_hashes(e1, e2, second), chain)
(_, oldhash) = reduce(lambda e1, e2: combine_two_hashes(e1, e2, first), chain)
return (oldhash, hash)
+
+def verify_inclusion_proof(inclusion_proof, index, treesize, leafhash):
+ chain = zip([(index, 0)] + nodes_for_index(index, treesize), [leafhash] + inclusion_proof)
+ (_, hash) = reduce(lambda e1, e2: combine_two_hashes(e1, e2, treesize), chain)
+ return hash