Professional Documents
Culture Documents
Technology Overview
8.8.2018
Original MW implementation from scratch in C++
Supported by Treasury
Implemented in Rust
Unlimited emission
Open Source
Supported by Community
Confidential Transactions
P = r · G + v·H
Generator Points
Simple Transaction
Alice Bob
Pi = r1 · G + v·H PO = r1 · G + v·H
Inputs Outputs
∑=0
Simple Transaction
Alice Bob
∑=0
Simple Transaction
offset
Each output should contain proof that value is positive and does not
overflow
Bulletproofs is a non interactive zero knowledge range proof protocol
with very short proofs and no trusted setup
Input 1 Output 1 Kernel 1 Fee 1
Input 2 Output 2
Transaction 1 …
Input N2 Output N2
Transaction N
Input 1 Output 1 Kernel 1 Fee 1
Input 2 Output 2
Input N2 Output N2
Block
Transaction Cut Through
Alice Bob
Pi = r1 · G + v·H PO = r2 · G + v·H (r2 - r1) · G
Bob Carol
The structure of a block resembles that of a transaction
All elements in the block are sorted to obscure the original order
Cut through can happen both within a block and across blocks
Merkle Tree
ROOT HASH
New Block
Root hash
Header
Proof of Work
Body
(all transactions)
+ ROOT
HASH
Timelocked Transactions
Escrow Transactions
Atomic Swaps
Auditable Transactions
Sender Receiver
Node
Sender Receiver
T1 + T2 + T3
T1 + T2
T1
Roadmap
Future plans
Mobile wallet
Confidential Assets
Smart Contracts
Thank You
Total Block Reward
Treasury Miner’s reward
Treasury Miner’s reward
Genesis block
Q&A
https://www.beam-mw.com
https://t.me/BeamPrivacy
https://medium.com/beam-mw