wholetrans/docs-matrix-spec
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Fixup definition of reverse topological power ordering

Browse source
This commit is contained in:
Erik Johnston 2018-08-02 14:24:25 +01:00
parent 67757a3027
commit 9af5ecd080
1 changed files with 5 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

10
proposals/1442-state-resolution.md
View file

@ -233,13 +233,13 @@ First we define:
auth difference.
* The **"reverse topological power ordering"**[^4] of a set of events is an
ordering of the given events, plus any events in their auth chains that
appear in the auth difference, ordered such that x < y if:
appear in the auth difference, topologically ordered by their auth chains
with ties broken such that x < y if:
1. x is in the auth chain of y, or if
2. x's sender has a greater power level than y (calculated by looking at
1. x's sender has a greater power level than y (calculated by looking at
their respective auth events, or if
3. x's origin_server_ts is less than y's, or if
4. x's event_id is lexicographically less than y's
2. x's origin_server_ts is less than y's, or if
3. x's event_id is lexicographically less than y's
This is also known as a lexicographical topological sort.