bitpro가 원문에서 글자만 모은 내용이에요. 표·그림·수식은 빠지거나 깨질 수 있어요. 전체 4쪽 중 4쪽
des the order lock map) are very loose, allowing scalable dis-
tributed key-value stores to be used internally by each authority.
Execution is idempotent, making even crashes or hardware failures
on components handling execution easy to recover from.
As a result, execution for transactions that are not causally re-
lated to each other can proceed in parallel. Smart contract design-
ers may therefore design the data model of objects and operations
within their contracts to take advantage of this parallelism.
Check-pointing and state commitments are computed off the
critical transaction processing path to not block the handling of
fresh transactions. These involve read operations on committed
data rather than requiring computation and agreement before a
transaction reaches finality. Therefore they do not affect the latency
or throughput of processing new transactions, and can themselves
be distributed across available resources.
Reads can benefit from very aggressive, and scalable caching.
Authorities sign and make available all data that light clients require
for reads, which may be served by distributed stores as static data.
Certificates act as roots of trust for their full causal history of
transactions and objects. State commitments further allow for the
whole system to have regular global roots of trust for all state and
transactions processed, at least every epoch or more frequently.
Latency. Smart contract designers are given the flexibility to con-
trol the latency of operations they define, depending on whether
they involve owned or shared objects. Owned objects rely on a reli-
able broadcast before execution and commit, which requires two
round trips to a quorum of authorities to reach finality. Operations
involving shared objects, on the other hand, require a a consistent
broadcast to create a certificate, and then be processed within a
consensus protocol, leading to increased latency (4 to 8 round trips
to quorums as of [9]).
REFERENCES
[1] Mustafa Al-Bassam, Alberto Sonnino, Vitalik Buterin, and Ismail Khoffi. 2021.
Fraud and Data Availability Proofs: Detecting Invalid Blocks in Light Clients.
In Financial Cryptography and Data Security - 25th International Conference, FC
2021, Virtual Event, March 1-5, 2021, Revised Selected Papers, Part II (Lecture Notes
in Computer Science, Vol. 12675), Nikita Borisov and Claudia Diaz (Eds.). Springer,
279–298.
[2] Shehar Bano, Alberto Sonnino, Mustafa Al-Bassam, Sarah Azouvi, Patrick Mc-
Corry, Sarah Meiklejohn, and George Danezis. 2019. SoK: Consensus in the Age
of Blockchains. In Proceedings of the 1st ACM Conference on Advances in Financial
Technologies, AFT 2019, Zurich, Switzerland, October 21-23, 2019 . ACM, 183–198.
[3] Mathieu Baudet, George Danezis, and Alberto Sonnino. 2020. FastPay: High-
Performance Byzantine Fault Tolerant Settlement. In AFT ’20: 2nd ACM Confer-
ence on Advances in Financial Technologies, New York, NY, USA, October 21-23,
2020. ACM, 163–177.
[4] Sam Blackshear, Evan Cheng, David L. Dill, Victor Gao, Ben Maurer, Todd
Nowacki, Alistair Pott, Shaz Qadeer, Ra in, Dario Russi, Stephane Sezer, Tim Za-
kian, and Runtian Zhou. 2019. Move: A Language With Programmable Resources.
https://developers.libra.org/docs/move-paper.
[5] Sam Blackshear, David L. Dill, Shaz Qadeer, Clark W. Barrett, John C. Mitchell,
Oded Padon, and Yoni Zohar. 2020. Resources: A Safe Language Abstraction for
Money. CoRR abs/2004.05106 (2020). arXiv:2004.05106 https://arxiv.org/abs/
2004.05106
[6] Christian Cachin, Rachid Guerraoui, and Luís Rodrigues. 2011. Introduction to
reliable and secure distributed programming. Springer Science & Business Media.
[7] Panagiotis Chatzigiannis, Foteini Baldimtsi, and Konstantinos Chalkias. 2021.
SoK: Blockchain Light Clients. IACR Cryptol. ePrint Arch. (2021), 1657.
[8] Daniel Collins, Rachid Guerraoui, Jovan Komatovic, Petr Kuznetsov, Matteo
Monti, Matej Pavlovic, Yvonne-Anne Pignolet, Dragos-Adrian Seredinschi, An-
drei Tonkikh, and Athanasios Xygkis. 2020. Online Payments by Merely Broad-
casting Messages. In50th Annual IEEE/IFIP International Conference on Dependable
Systems and Networks, DSN 2020, Valencia, Spain, June 29 - July 2, 2020 . IEEE,
26–38.
[9] George Danezis, Eleftherios Kokoris-Kogias, Alberto Sonnino, and Alexander
Spiegelman. 2021. Narwhal and Tusk: A DAG-based Mempool and Efficient BFT
Consensus. CoRR abs/2105.11827 (2021).
[10] David L. Dill, Wolfgang Grieskamp, Junkil Park, Shaz Qadeer, Meng Xu, and
Jingyi Emma Zhong. 2021. Fast and Reliable Formal Verification of Smart Con-
tracts with the Move Prover. CoRR abs/2110.08362 (2021). arXiv:2110.08362
https://arxiv.org/abs/2110.08362
[11] Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, and Dragos-
Adrian Seredinschi. 2018. AT2: Asynchronous Trustworthy Transfers. CoRR
abs/1812.10844 (2018).
[12] Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, and Dragos-
Adrian Seredinschi. 2019. The Consensus Number of a Cryptocurrency. In
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing,
PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019 , Peter Robinson and
Faith Ellen (Eds.). ACM, 307–316.
[13] Patrick McCorry, Chris Buckland, Bennet Yee, and Dawn Song. 2021. SoK:
Validating Bridges as a Scaling Solution for Blockchains. IACR Cryptol. ePrint
Arch. (2021), 1589.
[14] Marco Patrignani and Sam Blackshear. 2021. Robust Safety for Move. CoRR
abs/2110.05043 (2021). arXiv:2110.05043 https://arxiv.org/abs/2110.05043
[15] Jerome H Saltzer and Michael D Schroeder. 1975. The protection of information
in computer systems. Proc. IEEE 63, 9 (1975), 1278–1308.
[16] Jingyi Emma Zhong, Kevin Cheang, Shaz Qadeer, Wolfgang Grieskamp, Sam
Blackshear, Junkil Park, Yoni Zohar, Clark W. Barrett, and David L. Dill. 2020.
The Move Prover. In Computer Aided Verification - 32nd International Conference,
CA V 2020, Los Angeles, CA, USA, July 21-24, 2020, Proceedings, Part I (Lecture
Notes in Computer Science, Vol. 12224), Shuvendu K. Lahiri and Chao Wang (Eds.).
Springer, 137–150. https://doi.org/10.1007/978-3-030-53288-8_7프로젝트로 돌아가기