From traditional fault tolerance to blockchain / (Record no. 68346)

000 -LEADER
fixed length control field 03784cam a22005778i 4500
001 - CONTROL NUMBER
control field on1259688528
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20220711203149.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 210713s2021 nju ob 001 0 eng
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9781119682110
-- (epub)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 1119682118
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9781119682080
-- (adobe pdf)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 1119682088
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
-- (hardback)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9781119682127
-- (electronic bk. : oBook)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 1119682126
-- (electronic bk. : oBook)
029 1# - (OCLC)
OCLC library identifier AU@
System control number 000069691770
029 1# - (OCLC)
OCLC library identifier AU@
System control number 000069704206
082 00 - CLASSIFICATION NUMBER
Call Number 004/.36
100 1# - AUTHOR NAME
Author Zhao, Wenbing,
245 10 - TITLE STATEMENT
Title From traditional fault tolerance to blockchain /
300 ## - PHYSICAL DESCRIPTION
Number of Pages 1 online resource
520 ## - SUMMARY, ETC.
Summary, etc "The primary challenge in dependable distributed computing is the difficulty in achieving distributed consensus. Traditional consensus algorithms all depend on the knowledge of a membership and rely on multi-round voting, which are inevitably highly complex and non-scalable. Bitcoin completely abandoned the traditional approach by converting the leader election into a stochastic process where mining nodes compete to solve a puzzle and the one who solves the puzzle would proceed to creating the next block. Because the consensus is achieved probabilistically, it is unavoidable that sometimes two or more blocks are created at the same block height, in which case, nodes would follow a conflict resolution rule, where the branch that has the most cumulative difficulty would be selected as the main chain. This new way of reaching consensus opened the door for building large-scale systems that use consensus as their basis for operation. A few years later in 2015, Ethereum became the first platform that supports Turing-complete computing using smart contract, which made it possible to develop arbitrary complex decentralized applications. This book will explain in depth how blockchain consensus works and how the blockchain technology could be used to develop secure and dependable systems."--
505 0# - FORMATTED CONTENTS NOTE
Remark 2 Front Matter -- Introduction -- Logging and Checkpointing -- Recovery-Oriented Computing -- Data and Service Replication -- Group Communication Systems -- Consensus and the Paxos Algorithms -- Byzantine Fault Tolerance -- Cryptocurrency and Blockchain -- Consensus Algorithms for Blockchain -- Blockchain Applications -- Index
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
General subdivision Distributed processing.
650 #7 - SUBJECT ADDED ENTRY--SUBJECT 1
General subdivision Distributed processing
-- Reliability.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://doi.org/10.1002/9781119682127
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Hoboken, NJ :
-- Wiley-Scrivener,
-- 2021.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
520 ## - SUMMARY, ETC.
-- Provided by publisher.
588 ## -
-- Description based on print version record and CIP data provided by publisher; resource not viewed.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Electronic data processing
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Blockchains (Databases)
650 #7 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Blockchains (Databases)
-- (OCoLC)fst01981761
650 #7 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Electronic data processing
-- (OCoLC)fst00906993
650 #7 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Fault-tolerant computing.
-- (OCoLC)fst00921988
994 ## -
-- C0
-- DG1

No items available.