Skip to content

Commit

Permalink
Update definition as per Leemon's suggestion
Browse files Browse the repository at this point in the history
  • Loading branch information
Neeharika-Sompalli committed Nov 7, 2024
1 parent ea9d8da commit fafb83f
Showing 1 changed file with 5 additions and 2 deletions.
7 changes: 5 additions & 2 deletions HIP/hip-1064.md
Original file line number Diff line number Diff line change
Expand Up @@ -24,8 +24,11 @@ governance of the deployed network. This minimum reward may be adjusted based on

<dl>
<dt>Judge</dt>
<dd>In the hashgraph algorithm, honest nodes that are online and contributing to consensus will regularly create unique
famous witnesses, called judges, in nearly every round.</dd>
<dd>An event that wins the election to be made a judge. It must be a witness, and it will have tended to have been
gossiped to most of the other nodes quickly (otherwise it would have lost the election). An event reaches consensus
when it is an ancestor of all judges in a given round. The first round where that happens is its consensus round.
It’s a math theorem that every round is guaranteed to have at least one judge, and a math conjecture that every round
is guaranteed to have judges created by a supermajority of nodes (>2/3 of weight).</dd>
<dt>Active Node</dt>
<dd>A node is an *Active Node* if it creates a "judge" in a significant fraction of rounds during a staking period,
for example 80%. Any node that is trustworthy and submits events will create judges. If the node doesn’t submit events
Expand Down

0 comments on commit fafb83f

Please sign in to comment.