From 40d86f37561ba6691e0d1848d3507b69df7cb9fd Mon Sep 17 00:00:00 2001 From: David Robertson Date: Tue, 14 Jun 2022 17:12:44 +0100 Subject: [PATCH] Suggestions from RIch Co-authored-by: Richard van der Hoff <1389908+richvdh@users.noreply.github.com> --- content/rooms/fragments/v2-state-res.md | 7 +++++-- 1 file changed, 5 insertions(+), 2 deletions(-) diff --git a/content/rooms/fragments/v2-state-res.md b/content/rooms/fragments/v2-state-res.md index c7773986..c0ddfb12 100644 --- a/content/rooms/fragments/v2-state-res.md +++ b/content/rooms/fragments/v2-state-res.md @@ -45,7 +45,9 @@ whereas the conflicted state set may associate multiple events to the same key. The *auth chain* of an event *E* is the set containing all of *E*'s auth events, all of *their* auth events, and so on recursively, stretching back to the start of the room. Put differently, these are the events reachable by walking -the graph induced by an event's `auth_events` links. If *S* is a collection of +the graph induced by an event's `auth_events` links. + +If *S* is a collection of events, the *full auth chain of S* is the union of the auth chains of every event *E* in *S*. @@ -55,7 +57,8 @@ chain for each state *S**i*, and then discarding the events belonging to each full auth chain. In symbols: if *F*(*S*) is the full auth chain of a collection of events *S*, the auth difference is ∪*i* *F*(*Si*) - ∩*i* *F*(*Si*). -This can be [computed more efficiently](https://github.com/matrix-org/matrix-spec/issues/1118) as + +This can be computed more efficiently as *F*(*C*) - ∩*i* *F*(*Si* - *C*) , where *C* is the conflicted state set.