Class 23: Blooming Sidechains

Июль 23, 2022

Главная
Английский язык
Class 23: Blooming Sidechains

Содержание

2. Plan Bloom Filters Design and Analysis Use in Bitcoin Merged Mining Sidechains Thursday, 6pm Commerce School
3. 32 GB
5. SPV Nodes Simplified Payment Verification SPV Wallet Full Node filter blocks matching filter
8. Bloom Filters
10. Conventional Hash Table Store collection of N b-bit elements, using k > N cells. H is
11. Conventional Hash Table Store collection of N b-bit elements, using k > N cells. H is
13. How does Bloom’s application compare to use by bitcoin SPV nodes?
14. Bloom Filter Design
17. Probability of false match: (1 – (1 – 1/m)kn)k m: bits in array k: number of
18. Probability of false match: (1 – (1 – 1/m)kn)k m: bits in array k: number of
19. Do Bloom filters really provide privacy?
20. Merged Mining
21. Pointcoin 0 Pointcoin 1 Pointcoin 6764 … Bitcoin 0 Bitcoin 1 Bitcoin 351247 … Difficulty: 8,324,713
22. http://blockexplorer.bitcoin-class.org/
23. SHA-256 Proof-of-Work Cryptocurrency
24. Merged Mining Goal: Enable using same hashing power to mine both Bitcoin and Namecoin (with different
26. https://explorer.namecoin.info/blocks/block_225529.txt
28. Pointcoin 0 Pointcoin 1 Pointcoin 6764 … Bitcoin 0 Bitcoin 1 Bitcoin 351247 … Difficulty: 8,324,713
29. Namecoin Bug
30. https://github.com/namecoin/namecoin/commit/d70d01ff77310d3755891cb43cb2700b553019f4
32. Скачать презентацию

Слайд 2

Plan
Bloom Filters
Design and Analysis
Use in Bitcoin
Merged Mining
Sidechains
Thursday, 6pm Commerce School 223
“Entrepreneurial

and Career Ventures in the world of Digital Currency” Panel

Friday, 10:45am Rice 242
Suman Jana, “Rise of the Planet of the Apps: Security and Privacy in the Age of Bad Code”

Project Presentations will be April 20, 22 and 27.

Слайд 3

32 GB

Слайд 4

Слайд 5

SPV Nodes
Simplified Payment Verification
SPV Wallet
Full Node
filter
blocks matching filter

Слайд 6

Слайд 7

Слайд 8

Bloom Filters

Слайд 9

Слайд 10

Conventional Hash Table
Store collection of N b-bit elements, using k >

N cells.

H is pseudorandom function
H(x) ? [0, k)

Слайд 11

Conventional Hash Table
Store collection of N b-bit elements, using k >

N cells.

H is pseudorandom function
H(x) ? [0, k)

Слайд 12

Слайд 13

How does Bloom’s application compare to use by bitcoin SPV nodes?

Слайд 14

Bloom Filter Design

Слайд 15

Слайд 16

Слайд 17

Probability of false match:
(1 – (1 – 1/m)kn)k
m: bits in array
k:

number of hashes
n: number of elements

Слайд 18

Probability of false match:
(1 – (1 – 1/m)kn)k
m: bits in array
k:

number of hashes
n: number of elements

Слайд 19

Do Bloom filters really provide privacy?

Слайд 20

Merged Mining

Слайд 21

Pointcoin 0
Pointcoin 1
Pointcoin 6764
…
Bitcoin 0
Bitcoin 1
Bitcoin 351247
…
Difficulty: 8,324,713
Hash rate: ~0

TH/s

Difficulty: 49,446,390,688
Hash rate: 310K TH/s

Should PointCoin Pizza be worried?

Слайд 22

http://blockexplorer.bitcoin-class.org/

Слайд 23

SHA-256 Proof-of-Work Cryptocurrency

Слайд 24

Merged Mining
Goal: Enable using same hashing power to mine both Bitcoin

and Namecoin (with different difficulty)

Слайд 25

Слайд 26

https://explorer.namecoin.info/blocks/block_225529.txt

Слайд 27

Слайд 28

Pointcoin 0
Pointcoin 1
Pointcoin 6764
…
Bitcoin 0
Bitcoin 1
Bitcoin 351247
…
Difficulty: 8,324,713
Hash rate: ~0

TH/s

Difficulty: 49,446,390,688
Hash rate: 310K TH/s

Namecoin 0

Namecoin 1

Namecoin 225529

…

Difficulty: 16,527,985,062
Hash rate: 110K TH/s

Слайд 29

Namecoin Bug

Слайд 30

https://github.com/namecoin/namecoin/commit/d70d01ff77310d3755891cb43cb2700b553019f4