aph virtual voting algorithm. Additionally, it
will be paid to serve as a node, with that payment proportional to the amount of hbars in those accounts.
It is still free to spend those hbars at any time. Consequently, a potential disincentive of bonded proof-of-
stake models — that of nodes unwilling to stake for fear of the associated loss of liquidity — is avoided.
In addition, a mechanism called “proxy staking” will allow a person who owns hbars but does not run a
node to nevertheless stake those hbars and earn a small amount of hbars for contributing to network
operation by “proxy staking” their account to a node. That means giving another account credit for
their hbars and allowing the node to use that stake when it contributes to consensus. The payments for
running the node (proportional to the amount staked) are then split between the node and the owner of
the hbars being proxy staked. The hbars that are being proxy staked still remain under the control of their
owner. The owner will be able to turn off or redirect the proxy staking to another node at any time. They
will also be able to spend the proxy staked hbars at any time, though again that will reduce the amount
they receive in payment for staking. Note that the node to which the hbars are proxy staked cannot spend
those hbars. This proxy-staking feature for network users will not be available initially, and will be added
in a subsequent phase of the platform’s development.
A node must have at least some hbars in its account for it to be able to influence consensus or to pay fees
associated with sending transactions to the ledger.
OWNER NODE
PROXY
STAKE
PROXY STAKE
NODE PAYMEN TS
PROXY PAYMEN TS
STAKE
OWNED
PROXIED
36CRYPTOECONOMICS
The proxy staking model is shown below.
A node’s stake towards consensus will
reflect both the hbars it owns and has
staked and those hbars proxied to it.
The payments associated with that
staking will be shared between the node
and those proxy staking accounts. In
practice, a node is expected to have
many accounts proxying their stake to it.
Proxy staking will allow those who do not run nodes to earn a small amount of hbars by contributing the
weight of their hbars to a node’s vote. By encouraging this practice, the network makes it more difficult
for a bad actor to gain influence over a third of the entire stake. And those who do run nodes will be able
to increase their revenue.
37CRYPTOECONOMICS
Payments and fees
Users pay fees to use the Hedera platform for activities like transferring cryptocurrency or adding items
to the ledger. Because the Hedera network has high throughput and does not require proof-of-work, we
anticipate the fees to be a small fraction of other public DLT platforms in the market today.
Nodes in the Hedera ledger are compensated for the computing, bandwidth, and storage resources they
use in establishing consensus and providing services. There are several types of payments and fees:
1. NODE FEE - A user or application seeking to complete an action on the platform will send
the corresponding transaction to a single node, which will then submit that transaction
to the network. In doing so, the node will expend a small amount of resources and energy.
Node Fees compensate nodes for those resources and incentivize nodes to take on this
critical role. Initially, the Hedera Governing Council will set the amount of the Node Fees,
but Node Fee amounts will eventually be left to each node to determine. Node fees are paid
by end users directly to the account of the node that submits the user’s transaction to the
network.
2. NETWORK FEE - After a transaction is submitted to the network, it is communicated to
nodes that validate any digital signatures. The transaction is then further communicated
to other nodes, which temporarily store it in their memory while the network reaches
consensus. Users pay a Network Fee that compensates all participating nodes for this
activity of calculating consensus on the transaction. The resources required to validate a
transaction can vary based on the particulars of the transaction, but generally depend on
the transaction’s file size and number of digital signatures. Network Fees are paid by users
into a Hedera Treasury account and a portion of such collected amounts are subsequently
distributed daily to participating nodes as Node Reward Payments.
3. SERVICE FEE - Service Fees compensate nodes for the ongoing burden of maintaining
or supporting the transaction. As an example, for a file storage transaction, all nodes
will store the file on their hard drives for a specified period of time and the Service Fee
for that transaction will reflect the size of the file and duration of time it’s stored. For a
transaction that requests a smart contract function be executed, the Service Fee will be
based on the processing power required by network nodes to perform that computation
and any associated storage burden, e.g., storing the results of the contract execution.
Service Fees are paid by users into a Hedera Treasury account, and a portion of such
collected amounts are subsequently distributed daily to participating nodes as Node
Reward Payments.
The three different fee types are shown in the diagram below, indicating from which account they are
taken, and to which they are added. Clients pay nodes fees directly to the node that they requested to
process their transaction. Clients pay network fees to the same node, but those fees will be passed on to
the Hedera Treasury. Clients pay service fees directly to Hedera. All fee payments are made through the
network coming to consensus on a gossiped transaction that authorized the payment.
38CRYPTOECONOMICS
Hedera collects services and transaction fees on behalf of all the nodes processing the transactions and
performing the services. Hedera uses those collected fees to fund incentive payments to nodes:
NODE REWARD PAYMENT – Once a day, payments are made from the Hedera account to nodes, to
incentivize them to serve as nodes. To be paid, a node must have been online for the full day, according to
thresholds defined by the Hedera Governing Council (e.g., requiring that the node contribute at least one
event each to at least 90% of the rounds during that 24 hour period). A node will be paid proportional to
the amount of cryptocurrency it is staking (both owned by itself and proxy staked to it by others).
The fee model is designed to allocate costs and risks appropriately.
39CRYPTOECONOMICS
The biggest resource costs are paid for by service fees, and those resource costs (e.g., storing a large file)
are never incurred until proper payment has been made by the client. As an example, a client must pay
for the storage of a file for 30 days in advance at the time of the transaction that creates the file on the
network.
The smaller resource costs of gossiping and reaching consensus on the transactions themselves are paid
for by the network fees. The node that submits a transaction will first verify that the account paying the
fees has sufficient funds, but there is a small risk that the balance will drop below this level in the short
period of time it takes for the transaction to be processed Into consensus. In this case, the network will
have spent resources but will not be paid for that effort.
So at each level of the system, costs are paid for, and economic incentives are aligned.
When a client contacts a node for help submitting a transaction to the network to perform some service
for the client, the client stipulates on the transaction a transaction fee parameter – this is the maximum
amount the client is willing to pay for the requested service.
The node performs a precheck by analyzing the transaction to determine the amounts of the various
network resources (bandwidth, CPU, storage, etc.) the associated service will require and multiplies those
amounts by coefficients in a published fee schedule to determine the total transaction fee. The node
compares this calculated transaction fee to the client’s stipulated maximum transaction fee as well as to
the client’s balance to determine if the transaction should be submitted to the network.
Once the transaction is submitted, all nodes process it into consensus order, calculate the transaction
fee, determine if the client account still has a sufficient balance and, if so, applies the transaction to the
consensus state, and finally process fees as described above.
The fees incentivize the node to submit a transaction correctly as it will not be paid if it fails to do so.
The service fee is only paid if the service is performed so the risk to the client is minimal. And because the
service is only performed if the payment occurs, there is not a risk to the Hedera network.
40CRYPTOECONOMICS
The Roadmap to Scale
The following are the phases by which we expect the network will grow from concentrated nodes and
stake to widespread nodes and stake. These phases will not be distinct but represent the expected
evolution of the network and its currency.
PHASE 1 The Hedera Treasury holds most of the coins, and the Treasury will begin to “proxy
stake” coins to the nodes managed by the Hedera Council Members. Some coins from the
Hedera Treasury will also be distributed to the general population for use on the network.
Individuals that use the Hedera-provided wallet software may also proxy their coins to the
Council Member-managed nodes.
PHASE 2 In addition to Hedera Governing Council Members, additional trusted parties will become
able to stand up nodes. The Hedera Treasury and Hedera-provided wallet software used
by hbar holders (by default) will proxy stake coins to both the Council Member nodes and
these additional trusted node operators. Over time the distribution of coins will become
more widely spread out across a greater number of nodes. More coins continue to be
distributed from the Hedera Treasury to the general population of network users.
PHASE 3 Individuals who are interested may go through a Know-Your-Customer process and then
also stand up nodes and receive staking of coins from the Hedera Treasury and the default
Hedera wallet software. More coins will continue to be distributed out of the Hedera
Treasury to the general population. Anonymous individuals can begin to run nodes and
receive proxy-staked coins. The Hedera Treasury and Hedera wallet software will not
proxy coins to those anonymous nodes, but those nodes may be able to receive proxied
coins from 3rd-party wallet software.
PHASE 4 As the coins are distributed widely and competing wallet software programs arise, there
will be a market for proxying coins that is independent of the Hedera Governing Council.
Eventually all of the coins are widely distributed, there is a market of wallet software, and a
market of nodes competing for proxy staking.
In this way, all of the coins start in the Hedera Treasury account, and the initial Hedera wallet software
defaults to proxying just to members of the Hedera Governing Council. Over time, however, both the coins
and the proxying gain wider and wider distribution until they are distributed across millions of nodes and
accounts.
41ACKNOWLEDGEMENTS
Acknowledgements
We gratefully acknowledge the contributions and help from our advisors, Natalie Furman,
Tom Trowbridge, Edgar Seah, Jordan Fried, Christian Hasker, Arlan Harris, Paul Bugeja, Alex Godwin,
Ken Anderson, Patrick Harding, Zenobia Godschalk, George Samman, Sam Brylski, Tom Sylvester, and
Rachel Epstein.
This document is issued by Hedera Hashgraph, LLC, a company incorporated in Delaware, United States.
It constitutes general information only and may be updated. It also contains forward-looking statements
that are based on the beliefs and intentions of the authors, as well as certain assumptions made by and
information available to them. Such statements, assumptions and information are based on analysis
and sources considered appropriate and reliable, but there is no assurance as to their accuracy or
completeness.
This document does not constitute an offer or sale of securities. Any offer or sale will occur only based on
definitive offering documents.
The project as envisioned in this document is under development, is subject to change and may not
be available in all jurisdictions. No representation or warranty is given as to the achievement or
reasonableness of any plans, future projections or prospects. This document does not constitute any
advice or offer of any kind, nor should it be relied upon for any purpose. This document is issued in English
only. Any translation is for reference purposes only and is not certified by Hedera Hashgraph, LLC or any
other person. The English version of this document prevails to the extent of any inconsistency with any
translation. Please obtain any necessary professional advice.
© 2018-2019 Hedera Hashgraph, LLC. All rights reserved.
42
Appendices
APPENDICES
43
Appendix 1: Team
APPENDICES
DR. LEEMON BAIRD, CO -FOUNDER
Leemon is the inventor of the hashgraph distributed consensus algorithm,
and is the Co-Founder and Chief Scientist of Hedera. With over 20 years of
technology and startup experience, he has held positions as a Professor of
Computer Science at the US Air Force Academy and as a senior scientist
in several labs. He has been the Co-Founder of several startups, including
two identity-related startups, both of which were acquired. Leemon
received his PhD in Computer Science from Carnegie Mellon University
and has multiple patents and publications in peer-reviewed journals and
conferences in computer security, machine learning, and mathematics.
MANCE HARMON, CO -FOUNDER
Mance is an experienced technology executive and entrepreneur with
more than 20 years of strategic leadership experience in multi-national
corporations, government agencies, and high-tech startups, and is Co-
Founder and CEO of Hedera. His prior experience includes serving as the
Head of Architecture and Labs at Ping Identity, Founder and CEO of two
tech startups, the senior executive for product security at a $1.7B revenue
organization, Program Manager for a very-large scale software program
for the Missile Defense Agency, the Course Director for Cybersecurity at
the US Air Force Academy, and research scientist in Machine Learning at
Wright Laboratory. Mance received a MS in Computer Science from the
University of Massachusetts and a BS in Computer Science from
Mississippi State University.
Note that as part o f the Hedera Governing Council’s decisions to enable broader mark et participation on the Hedera
network, Mance Harmon and Dr. Leemon Baird have left their roles a s CEO and Chief Sc ientist of Hedera Hashgraph,
LLC, respectively, and have assumed new roles as co-CEOs of Swirlds Labs, effective as of May 1, 2022.
47
Appendix 2: Sharding
Initially, the network will consist of a relatively small number of nodes in a single shard. As the network
grows, it will gain sufficient nodes to support multiple shards. Those shards will work in the following way.
A transaction is always submitted to a specific shard. Within a shard, every node receives all of that
shard’s transactions, and every node maintains an identical shared state. Each shard can store both
cryptocurrency accounts and files. Every shard can run smart contracts.
A shard uses the hashgraph consensus algorithm to reach a consensus order for its transactions. Each
shard must be able to trust the consensus decision of each of the other shards. Therefore, each shard
must be composed of randomly chosen nodes, and must be large enough so that it can be trusted to never
have 1/3 of its staked cryptocurrency being owned by malicious nodes.
If a transaction involves only resources within a given shard, then when that point in the consensus order
is reached, the transaction performs its effect. For example, a transaction might move cryptocurrency
between two accounts within the same shard. Or it might save a file within that shard and pay for it with
an account in that shard. In those cases, the cryptocurrency transfers or the file is stored immediately, at
the point where the transaction occurs in the consensus order.
If a transaction involves resources in different shards, then it will trigger inter-shard messages. For
example, if the cryptocurrency account Alice is in shard Alpha, and account Bob is in shard Beta, then
Alice creates and signs a transaction to move cryptocurrency from Alice to Bob. She submits that
transaction to a node in the Alpha shard, and all of the nodes in Alpha reach consensus on its order. At the
point where this event occurs in the consensus order, Alice’s account balance is decreased by the amount
being sent, and a message to the Beta shard is generated. Each shard maintains a queue of outgoing
messages to be sent to each of the other shards. So this new message is added to the queue that Alpha
maintains for messages to send to Beta. Each message in a given queue has a 64-bit sequence number,
which starts at zero when the network is first created and then increments with each new message sent.
Each member of Alpha will, at random intervals, check to see if there are any messages in any outgoing
queues and attempt to send one of the queues. When they see that there are messages intended for
Beta, they will call a random member of Beta and give them all messages in the queue, along with the
proof that this queue is part of the current signed state for Alpha.
When a member of Beta receives such a list of messages from the member of Alpha, the Beta member
submits a transaction to Beta that has the messages and the proof that they are part of the signed
state. If they see that a message has already been submitted, then they won’t submit it again, although
sometimes the same message may be submitted twice at the same time. In that case, the sequence
numbers will match, so the duplicate will be ignored, and no harm is done.
APPENDICES
48
All messages between two particular shards will be processed in order of sequence number. If Alpha
sends a message to Beta, and it is added to a transaction within Beta, the sequence will be checked when
the transaction reaches consensus. If it is the next message in sequence, then its effect is performed
immediately. If the sequence number shows that one or more other messages have been skipped, then it
has no effect and is ignored. In that case, the other messages will eventually reach consensus, and then
the skipped message will be submitted again, and will have an effect.
When Beta processes a message with Alpha with the expected next sequence number from Alpha, then
it increments the count of the number of messages from Alpha that have been processed. So each shard
maintains a single number for each of the other shards, which is the latest sequence number from that
other shard that has been processed.
After Alpha has sent to the message to Beta, that message remains in the outgoing queue, and attempts
will repeatedly be made to send it. Eventually, a member of Apha will contact a member of Beta to send
that message, but will receive back a proof that the message has already been processed. That proof
shows that the signed state contains Beta’s sequence count for messages received from Alpha, and that
the count is now higher than the message in the queue. At that point, the member of Alpha wraps the
proof in a transaction and gossips it out to Alpha. When it reaches consensus order, at that point the
message is deleted from the outgoing queue in the shared state.
For the example of transferring cryptocurrency from Alice to Bob, we could say that there is “finality”
when we know that the transfer is valid, that Alice had sufficient funds, and that Bob will certainly receive
the funds. If this transfer is for Alice to buy a product from Bob프로젝트로 돌아가기