Abstract
The paper describes the second part of the happy path of a user transaction through a Hyperledger Fabric Blockchain Network. The full cycle of a user transaction originates from the Client Application (an actor outside the Hyperledger Ledger Network but inside an organization that is part of a set of organizations that jointly run the Hyperledger Fabric Blockchain Network). In the process of making the Hyperledger Fabric Blockchain network knowledge explicit, essential parts of FBM were applied in cooperation with the developers of the Fabric Blockchain platform.
S. Nijssen—Retired from PNA, the Netherlands.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Nijssen, S., Bollen, P.: The lifecycle of a user transaction in a Hyperledger Fabric Blockchain Network part 1: Propose and Endorse 2018 (forthcoming)
Androulaki, E., et al.: Hyperledger Fabric: A Distributed Operating System for Permissioned Blockchains, 30 January 2018
The Hyperledger Vision: Hyperledger, Blockchain Technologies for Business (2017)
O’Dowd, A., Blockchain Explored A Technical Deep-Dive on Hyperledger Fabric v1, 29 November 2017
Vukolic, M.: Hyperledger Fabric an open source distributed operating system for permissioned blockchains. Swiss Blockchain Summer School, Lausanne, Switserland, 22 June 2017
Brakeville, S., Parepa, B: Blockchain basics: Introduction to distributed ledgers, 21 August 2017
Weed Cocco, S., Singh, G.: Top 6 technical advantages of Hyperledger Fabric for blockchain networks, 21 August 2017
Hyperledger-Fabricdocs Documentation, Release master, Key Concepts, sub section Peers, June 2018
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendix A
Appendix A
Example endorsement policies (Source: Fabric Docs 1.2, Architecture Reference, Sub Section Endorsement Policies, Sub Section Example Endorsement Policies) [8].
Suppose the endorsement policy specifies the endorser set E = {Alice, Bob, Charlie, Dave, Eve, Frank, George}. Some example policies:
-
A valid signature on the same tran-proposal from all members of E. [Please remember that tran-proposal means endorsement; hence is common language: all endorsers from set E have to endorse.]
-
A valid signature from any single member of E[on a tran-proposal].
-
Valid signatures on the same tran-proposal from endorsing peers according to the condition (Alice OR Bob) AND (any two of: Charlie, Dave, Eve, Frank, George).
-
Valid signatures on the same tran-proposal by any 5 out of the 7 endorsers. (More generally, for chaincode with n > 3f endorsers, id signatures by any 2f + 1 out of the n endorsers, or by any group of more than (n + f)/2 endorsers.)
-
Suppose there is an assignment of “stake” or “weights” to the endorsers, like
-
like {Alice = 49, Bob = 15, Charlie = 15, Dave = 10, Eve = 7, Frank = 3, George = 1}, where the total stake is 100: The policy requires valid signatures from a set that has a majority of the stake (i.e., a group with combined stake strictly more than 50), such as {Alice, X} with any X different from George, or {everyone together except Alice}. And so on.
-
The assignment of stake in the previous example condition could be static (fixed in the metadata of the chaincode) or dynamic (e.g., dependent on the state of the chaincode and be modified during the execution).
-
Valid signatures from (Alice OR Bob) on tran-proposal1 and valid signatures from (any two of: Charlie, Dave, Eve, Frank, George) on tran-proposal2, where tran-proposal1 and tran-proposal2 differ only in their endorsing peers and state updates.
-
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Nijssen, S., Bollen, P. (2019). The Lifecycle of a User Transaction in a Hyperledger Fabric Blockchain Network Part 2: Order and Validate. In: Debruyne, C., Panetto, H., Guédria, W., Bollen, P., Ciuciu, I., Meersman, R. (eds) On the Move to Meaningful Internet Systems: OTM 2018 Workshops. OTM 2018. Lecture Notes in Computer Science(), vol 11231. Springer, Cham. https://doi.org/10.1007/978-3-030-11683-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-030-11683-5_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-11682-8
Online ISBN: 978-3-030-11683-5
eBook Packages: Computer ScienceComputer Science (R0)