The Science of The Blockchain pdf epub mobi txt 电子书下载 2025

简体网页||繁体网页

☆☆☆☆☆

出版者:CreateSpace Independent Publishing Platform

作者:Roger Wattenhofer

出品人:

页数:124

译者:

出版时间:2016-1-27

价格:USD 15.88

装帧:Paperback

isbn号码:9781522751830

丛书系列:

图书标签:

计算机
算法
区块链
英文原版
瑞士
歐洲
區域鏈
分布式
Blockchain
Cryptography
Distributed Ledger
Decentralization
Smart Contracts
Bitcoin
Ethereum
Digital Trust
Consensus Algorithms
Blockchain Technology

下载链接在页面底部

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 复制链接

想要找书就要到小美书屋

book.quotespace.org

立刻按 ctrl+D收藏本页

你会得到大惊喜!!

具体描述

FinTech developers and managers understand that the blockchain has the potential to disrupt the financial world. The blockchain allows the participants of a distributed system to agree on a common view of the system, to track changes in the system, in a reliable way. In the distributed systems community, agreement techniques have been known long before cryptocurrencies such as Bitcoin (where the term blockchain is borrowed) emerged. Various concepts and protocols exist, each with its own advantages and disadvantages. This book introduces the basic techniques when building fault-tolerant distributed systems, in a scientific way. We will present different protocols and algorithms that allow for fault-tolerant operation, and we will discuss practical systems that implement these techniques.

作者简介

oger Wattenhofer is a professor at ETH Zurich. Before joining ETH Zurich, he was at Brown University and Microsoft Research. His research interests include fault-tolerant distributed systems, efficient network algorithms, and cryptocurrencies such as Bitcoin. He has published more than 250 scientific articles.

目录信息

读后感

评分☆☆☆☆☆

------------------------------------------------------------------------------------------------------------------------------ 定理 6.35 的证明中，LZ(Qi) 应该是 PZ(Qi)。因为根本就没有 LZ(Qi) 这个东西，load（负载）只能针对节点（v）或系统（S），不能针对仲裁（...

评分☆☆☆☆☆

P53 页，国王算法的第7步，原文是 if some propose(z) received more than f times then ，被翻译成了 if 接收到 propose(z) 至少 f 次 then 。这里翻译有误，如果是至少 f 次，那就是包含 f 次了，对于引理 4.15 （算法实现了全部相同有效性）如果 f 个拜占庭节点都发送一个相...

评分☆☆☆☆☆

P57 页的译注5的说明有点复杂，且用了不必要用的条件。实际上因为 Su 和 Sv 的大小都是 n - f，假设它们不同的部分为 d，则它们相同的部分为 n - f - d，由于它们总的个数（相同部分不重复记）为 n - f - d + 2d = n - f + d 必须小于或等于 n，也即 d ≤ f。这就是两个集合 S...

评分☆☆☆☆☆