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

Expand on reverse topological power ordering

Browse source
This commit is contained in:
Erik Johnston 2018-08-03 14:00:47 +01:00
parent 472f75d9a5
commit dc499bc440
1 changed files with 4 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

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

@ -257,7 +257,10 @@ First we define:
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.
This is also known as a lexicographical topological sort (i.e. this is the
unique topological ordering such that for an entry x all entries after it
must either have x in their auth chain or be greater than x as defined
above). This can be implemented using Kahn's algorithm.
* The **"mainline ordering"** based on a power level event P of a set of
events is calculated as follows: