When a SPREAD action must be executed, one processpj β Ni is randomly chosen (Line 12), and the set of rumorsknown by process pi but not assumed to be known by pj issent to this process pj in Line 14.
6 Matching Annotations
- Feb 2025
-
Local file Local file
-
- Apr 2024
-
arxiv.org arxiv.org
-
Every so often, an agent πsends to every friend π every block π knows and believes that π needs, based on the last blockreceived from π.
^
-
-
-
for any p, q β P and anyp-block b β B there is a q-block bβ² β B such that bβ² β» b
Didn't get it. I'd expect that all blocks created by by these guys would refer to their previous blocks. Here the definition seems to say that one guy needs to ref to another's guys blocks, which is not "mutual".
-
-
www.swirlds.com www.swirlds.com
-
and gossips to him all the events thatshe knows. Bob then creates a new event to record the fact of that gossip
I guess Alice would only need to send Bob events that she knows he does not know.
-
-
arxiv.org arxiv.org
-
Contrary to current DAG-like structures that use hashesof content, a blocklace uses signed hashes from which theblock creator can be known. Not only this can aid dissemina-tion, by knowing which node is missing which blocks, butmore importantly, it can be used to detect equivocations andequivocators
Hashgraph gives all of that, as it has signatures. What's new here?
-
In-deed, the blocklace-based Cordial Dissemination protocol [7,12] employs the fact that a ν-block ν by a correct node ν ac-knowledges all the blocks known to ν at the time of blockcreation
Tags
Annotators
URL
-