Microsoft Word - 智能合约技术黄皮书0527.docx

Size: px

Start display at page:

Download "Microsoft Word - 智能合约技术黄皮书0527.docx"

羡堪李
5 years ago
Views:

1 Version 1.0 Smart contract 1994 Nick Szabo EOS : 1. e.g. /SDK 2., e.g. 3. e.g. Ultrain, Ultrain 1.

2 Ultrain Short-Range Transaction, 1ms Long-Range Transaction UGas e.g. Ultrain 3ms 2ms 1ms T1 T2 T3 Tn Ultrain 2/3

3 i.e. TransactionA Pending Excute Ready Block TransactionA OnStartOnRunning OnSuspend OnStop OnStart OnRunning OnSuspend OnStop TransactionA TransactionA Pending TransactionA LRT LRT = { lrt ), lrt *, lrt + lrt, } LRT time-sharing OnStart OnStart TransactionA TransactionA Excute OnRunning OnRunning OnRunning OnSuspend; OnSuspend sleep

4 OnRunning UGas OnStop ; OnStop ready UGas OnStop revert TransactionA OnStop TransactionA sleep UGas EOS 2. / code is law, one size fits all general, protected restrict general owner protected owner propose restrict owner restrict Dynamic-and-Adaptive Sharding ( ),. Scalability Security ( Decentralization ).

5 . trade-offe.g. vs, Scalability, Security Decentralization trilemma. Scalability sharding sidechain TPS (transactions per second). Security Decentralization Scalability. TPS Security Decentralization. TPS. Ultrain, 1) state-of-the-art sharding 2), trilemma anchor point; Dynamic-and-Adaptive Sharding.. Divide-and-Conquer. shard, ,. /, / 0 = 2 0, 4 0 5h747 8., 2 0 -, = :, ;, 5h747 : = 2 4, ; = ( = 1,2.} O( V + E ) G connected components,.,.....

6 ,.. ContractA --> ContractB -->. --> ContractY --> ContractZ, ContractZ, ContractZ restrict general,.. : ContractY ContractZ ContractZ ContractY ContractZ ContractA ContractB. :. : 1. ContractInstance. 2. e.g. Call ContractInstance, ContractInstance. 3. ContractInstance // TC-DIRTY TC-CLEAN. 4. TC-DIRTY TC-SHOULD-DIRTY, TC-SHOULD-CLEAN; 5. TC-SHOULD-CLEAN TC- DIRTY TC-BREAK. 6. C / = {E ), E * E, }, TC-SHOULD-CLEAN C. /. = {EF ), EF * EF,G }, TC- SHOULD-DIRTY CH /H = {EI ), EI * EI,J } 7. K_MNO/_PC;(E) E ContractInstance ( E ) 8. K_MNO/_-MM(E) : 8.1 /;RS = K_MNO/_PC;(E) 8.2 /;RS_;TS-CH = {K_MNO/_PC;(EUV ) ) K_MNO/_PC; EUV * EUV 0 /;RS} 8.3 /;RS == /;RS_;TS-CHK_MNO/_-MM E = /;RS, /;RS = /;RS_;TS-CH, 8.2, K_MNO/_-MM(E) E. : 1. TC-SHOULD-CLEAN EF 0 EF W K_MNO/_-MM( EF 0 ) K_MNO/_-MM( EF W ), = :, ;,

7 : = {K_MNO/_-MM EF ) K_MNO/_-MM EF * K_MNO/_-MM EF,G } ; XYZ = {[\\ 7I]72 ^_.^UV\7E7 94[Vh ^_ K_MNO/_-MM EF 0 } ; = {; XY` ; XYa ; XYbc }, O( V + E ) G connected components,.,. 3. TS-SHOULD-DIRTY EK_MNO/_-MM(E).. TS-SHOULD-DIRTY. 4. TC-BREAK... /. /9 = {/9 ), /9 *,, /9 d }, m.. (e.g. multiplecore, multiple-hyperthread). N, CORE = {.Ph; ),.Ph; *.Ph;, } m N. /9 0.Ph; 0 O(.Ph; 0 ) U8i djk 0l), O(.Ph; 0). N round-robin. sharding C^I7 = {C^I7 ), C^I7 *,, C^I7,_,mn } shard OC [1, C_CpR]. N SN Security, Scalability Decentralization triangle anchor point trilemma. anchor point. sharding

8 5 0W = 1 8_ / [228]i7I E^ 2h[4I W 0 ^Eh W = 1 8_C^I [228]i7I E^ 2h[4I W 0 ^Eh U8i (O7Fs48EtM^22 + v OF[\[x8\8EtM^22 + y H7F7iE4[\8z[E8^iM^22) C_CpR, OC, 5, 2 O7Fs48EtM^22 OF[\[x8\8EtM^22 H7F7iE4[\8z[E8^iM^22 (C_CpR, OC, 5, 2) untractable, C_CpR, OC: O7Fs48EtM^22 ~ (OC) OF[\[x8\8EtM^22 ~ (OC, 5) H7F7iE4[\8z[E8^iM^22 ~ (OC, 2) O7Fs48EtM^22 SN, e.g. SN=1,. OF[\[x8\8EtM^22. H7F7iE4[\8z[E8^iM^22., M^22, v y. M^22 v y trilemma. v y. v sharding v sharding ( shard ). y. v y Dynamic-and-Adaptive Sharding.

14 sig sk (m) =ED25519 sig (sk, m) res pk (sig sk (m),m)=ed25519 ver (pk, sig sk (m),m) SHA(m) :hash = SHA256(m) proof = VRF sk (seed)

15 hprev bh hroot bh hstate bh hproposer bh (bh, hprev bh,hroot bh, hstate bh, hproposer bh ) (0, 0,hroot 0, hstate 0, 0) hroot 0 hstate 0 w coin

16 w hardware w reputation w = r 1 w coin + r 2 w hardware + r 3 w reputation r 1,r 2,r 3 (pk, sk) Th min <f(sk, seed r )/2 256 <w s x s y p(s x )+p(s y )=p(s x + s y ) f(s) =B 1 (r; s, p) E(f(s)) = s p B(v 1 : s 1,p)+B(v 2 : s 2,p)=B(v 1 + v 2 : s 1 + s 2,p) s 1 s 2 E(f(s 1 )) = s 1 p E(f(s 2 )) = s 2 p s 1 p + s 2 p = s p s p

17 (P ROP OSE, shard, txs, bh, round, txshash, proof proposer, sig proposer, pk proposer ) sig proposer = SIG(bh, round, txshash) (ECHO, shard, bh, round, txshash, proof voter, sig voter, pk voter, proof proposer, sig proposer, pk proposer ) sig voter = SIG(bh, round, txshash) (proof proposer, sig proposer, pk proposer ) shard2 tx state shard3 shard1 shard0 shard0 shard01 shard03 shard1 shard12 shard2 shard23 shard12 shard3 shard31 shard0 shard01 shard03 shard1 shard12 shard2 shard23 shard12 shard3 shard31 shard i shard shard C 2 N C 2 N/N ((C 2 N)/N + N)/N

18 T PROP

19 round 0 round 1 round 2 round 3 Node 0 Proposers_sh1 Timeout TH1 votes exe() VRF Timeout TH2 votes VRF Timeout Timeout TH2 votes GetCoin() Voters_pro1_r3 Node 1 exe() Voters_sh2_r1 Voters_sh1_r1 Voters_pro1_r2 GetCoin() Voters_pro1_r3 Node 2 Proposers_sh2 exe() Voters_pro2_r1 Voters_pro1_r2 GetCoin() Voters_pro2_r3 Node 3 Relay exe() Voters_sh1_r1 Voters_pro2_r2 GetCoin() Voters_pro2_r3 Node 4 Node 5 Voters_sh1_r0 Node 6 Voters_sh2_r0 Vote exe() exe() exe() Voters_sh1_r1 Voters_sh2_r1 Voters_pro2_r2 Voters_pro1_r2 Voters_pro2_r2 GetCoin() Voters_pro1_r3 GetCoin() Voters_pro2_r3 T Bar

20 bh =1 state bh, block 0 =(Istake, Imember) N shard =16 (sk i, pk i )=KeyGen() queue txs = set EMPTY tx queue txs = tx round =0; res, hbatchtx, batchtx = ROUND(PROPOSE,hblock bh 1, shard, queue shard1, block r 1, round) round ++; res == TIMEOUT res = ROUND(ECHO, shard, set EMPTY, block bh 1, round) state bh 1 save(state bh 1 ) hstate bh hstate bh = exe(state bh 1, batchtx) res = ROUND(ECHO, shard, hbatchtx, block bh 1, round) res == TIMEOUTround < MAX r MAX r =7 round ++ CC = SHA(res hblock r 1 round) res = ROUND(ECHO, shard, hbatchtx, block bh 1, round) res = ROUND(ECHO, shard, set EMPTY, block bh 1, round) buildblock(state bh, hstate othershards, hbatchtx othershards )

21 Type shard batchtx block bh 1 round set ECHO = emtpy set txs = empty sent ECHO = empty proof = VRF sk (block prev shard round role) proof[193 : 256] <score sig = SIG sk (hbatchtxs) round! =0 shard shard shard set ECHO set txs [P ROP OSE.hbatchtxs] =P ROP OSE.batchtxs \ set txs [P ROP OSE.hbatchtxs] =P ROP OSE.batchtxs set ECHO [ECHO.hbatchtxs] = ECHO.pk TH2=Threshold2=2/3 N voters count(set ECHO [ECHO.hbatchtxs]) == TH2 round! =0 ECHO.hbatchtxs index(set txs ) TH1=Threshold1=1/3 N voters count(set ECHO [ECHO.hbatchtxs]) == TH1 ECHO.hbatchtxs sent ECHO sig msg sent ECHO = ECHO.hbatchtxs

22 Type,msg in, sk, pk send(type,msg in.msg, msg in.sig SIG(msg in.msg, sk), msg in.proof, msg.pk pk) msg in, sk, pk, block prev, pillar, role msg in.proof[193 : 256] >= score!ver msgin.pk(proof, block prev pillar role)!ver msgin.pk(msg in.sig, msg in.msg) o(n) o(c)

24 o(n 2 )

25 {}

1012

1012 公務赴大陸地區出國報告 ( 赴大陸出國類別赴大陸出國類別 : 其他活動 ) 赴大陸參加 2012 年動向杯廣州名將青少年足球錦標賽服務機關 : 臺北市文山區小姓名職稱 : 陳顯榮校長黃雯琳教師兼組長陳美秀教師派赴國家 : 中國大陸出