SLIDE 1
How Merkle trees enable the decentralized Web!
@taravancil taravancil.com
RESOURCES
How Merkle trees enable the decentralized Web! @taravancil - - PowerPoint PPT Presentation
How Merkle trees enable the decentralized Web! @taravancil - - PowerPoint PPT Presentation
How Merkle trees enable the decentralized Web! @taravancil taravancil.com RESOURCES Host-based addressing youtube.com/myvideo Host-based addressing youtube.com/myvideo -> vimeo.com/myvideo Content addressing - hash functions Content
SLIDE 2
SLIDE 3
youtube.com/myvideo
Host-based addressing
SLIDE 4
youtube.com/myvideo -> vimeo.com/myvideo Host-based addressing
SLIDE 5
Content addressing - hash functions
SLIDE 6
Content addressing - hash functions
hash( ) ->
2cf24dba5fb0a30e26e83b2ac5 b9e29e1b161e5c1fa7425e7304 3362938b9824
SLIDE 7
SLIDE 8
1 2 3 4 5 6 7 Regular binary tree
SLIDE 9
= hash(left, right)
= hash(data)
L R L R
L R
SLIDE 10
Merkle tree
1 3 2 4
SLIDE 11
h(1) h(2) h(3) h(4)
Merkle tree
1 3 2 4
SLIDE 12
h(1) h(2) h(3) h(4)
A B Merkle tree
h(h(1), h(2)) h(h(3), h(4))
1 3 2 4
SLIDE 13
h(1) h(2) h(3) h(4)
A B C Merkle tree
h(h(1), h(2)) h(h(3), h(4)) h(A, B)
1 3 2 4
SLIDE 14
h(1) h(2) h(3) h(4) A B C
Merkle tree
h(h(1), h(2)) h(h(3), h(4)) h(A, B)
Root hash
1 3 2 4
SLIDE 15
Checking for equality
h(1) h(2) h(3) h(5)
A E F
h(1) h(2) h(3) h(4)
A B C
C != F
SLIDE 16
h(1) h(2) h(3) h(4)
A B C
1 3 2 4
C
SLIDE 17
What if?
Root hash
=
hash( )
4 3 1 2
SLIDE 18
partial verification
SLIDE 19
C
UNTRUSTED PEER RECIPIENT
SLIDE 20
UNTRUSTED PEER RECIPIENT
4 C
SLIDE 21
UNTRUSTED PEER RECIPIENT
4
h(4)
C
SLIDE 22
h(4) B
C
h(3) UNTRUSTED PEER RECIPIENT h(3)
4
SLIDE 23
h(4) B
C
h(3) UNTRUSTED PEER RECIPIENT h(3)
4
A A
SLIDE 24
SLIDE 25
thanks!
@taravancil