bitpro가 원문에서 글자만 모은 내용이에요. 표·그림·수식은 빠지거나 깨질 수 있어요. 전체 3쪽 중 3쪽
0 31 63 95 127 159 191 223 255
Ripemd of Users Public Key Account unused
For a total of 32 bytes.
Proof of Stake bonds table contains:
0 31 63 95 127 159 191 223 255
Ripemd of Users Public Key Bond
Last Vote
unused
For a total of 64 bytes.
7.1.3 Verifier, State Replication
The Verifier nodes replicate the blockchain state and provide high availability
of the blockchain state. The replication target is selected by the consensus
algorithm, and the validators in the consensus algorithm select and vote the
Proof of Replication nodes they approve of based on off-chain defined criteria.
The network could be configured with a minimum Proof of Stake bond
size, and a requirement for a single replicator identity per bond.
7.1.4 Validators
These nodes are consuming bandwidth from Verifiers. They are virtual nodes,
and can run on the same machines as the Verifiers or the Leader, or on
separate machines that are specific to the consensus algorithm configured for
this network.
7.2 Network Limits
Leader is expected to be able to take incoming user packets, orders them
the most efficient way possible, and sequences them into a Proof of History
sequence that is published to downstream Verifiers. Efficiency is based on
27
Figure 10: Generator network limits
memory access patterns of the transactions, so the transactions are ordered
to minimize faults and to maximize prefetching.
Incoming packet format:
0 31 63 95 127 159 191 223 255
Last Valid Hash Counter u s
Fee
From
Signed
Signature 1 of 2
Signature 2 of 2
Size 20 + 8 + 16 + 8 + 32 + 3232 = 148 bytes.
28
The minimal payload that can be supported would be 1 destination ac-
count. With payload:
0 31 63 95 127 159 191 223 255
Last Valid Hash Counter u s
To Amount
Counter Fee
From
Signed
Signature 1 of 2
Signature 2 of 2
With payload the minimum size: 176 bytes
The Proof of History sequence packet contains the current hash, counter,
and the hash of all the new messages added to the PoH sequence and the
state signature after processing all the messages. This packet is sent once
every N messages are broadcast.
Proof of History packet:
0 31 63 95 127 159 191 223 255
Current Hash Counter
Messages Hash
State Hash
Signed
Signature 1 of 2
Signature 2 of 2
Minimum size of the output packet is: 132 bytes
On a 1gbps network connection the maximum number of transactions
29
possible is 1 gigabit per second / 176 bytes = 710k tps max. Some loss 1−4%
is expected due to Ethernet framing. The spare capacity over the target
amount for the network can be used to increase availability by coding the
output with Reed-Solomon codes and striping it to the available downstream
Verifiers.
7.3 Computational Limits
Each transaction requires a digest verification. This operation does not use
any memory outside of the transaction message itself and can be parallelized
independently. Thus throughput is expected to be limited by the number of
cores available on the system.
GPU based ECDSA verification servers have had experimental results of
900k operations per second [9].
7.4 Memory Limits
A naive implementation of the state as a 50% full hashtable with 32 byte en-
tries for each account, would theoretically fit 10 billion accounts into 640GB.
Steady state random access to this table is measured at 1 .1∗ 107 writes or
reads per second. Based on 2 reads and two writes per transaction, memory
throughput can handle 2.75m transactions per second. This was measured
on an Amazon Web Services 1TB x1.16xlarge instance.
7.5 High Performance Smart Contracts
Smart contracts are a generalized form of transactions. These are programs
that run on each node and modify the state. This design leverages extended
Berkeley Packet Filter bytecode as fast and easy to analyze and JIT bytecode
as the smart contracts language.
One of its main advantages is a zero cost Foreign Function Interface.
Intrinsics, or functions that are implemented on the platform directly, are
callable by programs. Calling the intrinsics suspends that program and
schedules the intrinsic on a high performance server. Intrinsics are batched
together to execute in parallel on the GPU.
In the above example, two different user programs call the same intrinsic.
Each program is suspended until the batch execution of the intrinsics is
30
Figure 11: Executing BPF programs.
complete. An example intrinsic is ECDSA verification. Batching these calls
to execute on the GPU can increase throughput by thousands of times.
This trampoline requires no native operating system thread context switches,
since the BPF bytecode has a well defined context for all the memory that
it is using.
eBPF backend has been included in LLVM since 2015, so any LLVM
frontend language can be used to write smart contracts. Its been in the
Linux kernel since 2015, and the first iterations of the bytecode have been
around since 1992. A single pass can check eBPF for correctness, ascertain
its runtime and memory requirements and convert it to x86 instructions.
References
[1] Liskov, Practical use of Clocks
http://www.dainf.cefetpr.br/ tacla/SDII/PracticalUseOfClocks.pdf
[2] Google Spanner TrueTime consistency
https://cloud.google.com/spanner/docs/true-time-external-consistency
[3] Solving Agreement with Ordering Oracles
http://www.inf.usi.ch/faculty/pedone/Paper/2002/2002EDCCb.pdf
31
[4] Tendermint: Consensus without Mining
https://tendermint.com/static/docs/tendermint.pdf
[5] Hedera: A Governing Council & Public Hashgraph Network
https://s3.amazonaws.com/hedera-hashgraph/hh-whitepaper-v1.0-180313.pdf
[6] Filecoin, proof of replication,
https://filecoin.io/proof-of-replication.pdf
[7] Slasher, A punative Proof of Stake algorithm
https://blog.ethereum.org/2014/01/15/slasher-a-punitive-proof-of-stake-algorithm/
[8] BitShares Delegated Proof of Stake
https://github.com/BitShares/bitshares/wiki/Delegated-Proof-of-Stake
[9] An Efficient Elliptic Curve Cryptography Signature Server With GPU
Acceleration
http://ieeexplore.ieee.org/document/7555336/
[10] Casper the Friendly Finality Gadget
https://arxiv.org/pdf/1710.09437.pdf
32프로젝트로 돌아가기