From dc499bc440ae38422f2041e4b2534579940c7756 Mon Sep 17 00:00:00 2001 From: Erik Johnston Date: Fri, 3 Aug 2018 14:00:47 +0100 Subject: [PATCH] Expand on reverse topological power ordering --- proposals/1442-state-resolution.md | 5 ++++- 1 file changed, 4 insertions(+), 1 deletion(-) diff --git a/proposals/1442-state-resolution.md b/proposals/1442-state-resolution.md index 9fd7da8a..1a2e82a3 100644 --- a/proposals/1442-state-resolution.md +++ b/proposals/1442-state-resolution.md @@ -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: