@andre @alcinnz ... the actual order of events rather than a logical order, kind of.
This is relying on the fact that siblings nodes in the DAG that share a common ancestor must have synchronized state in order to be able to share an ancestor. And so within each generation you can argue that each node counting monotonically can be considered synchronized from that time point where the ancestor was received.
I wrote this up in a lot more detail: https://interpeer.org/blog/2024/01/comparing-vessel-to-a-merkle-dag/
(First of several posts)
GNU social JP is a social network, courtesy of GNU social JP管理人. It runs on GNU social, version 2.0.2-dev, available under the GNU Affero General Public License.
All GNU social JP content and data are available under the Creative Commons Attribution 3.0 license.