1 files changed, 20 insertions, 2 deletions
diff --git a/lib/kernel/precedence.ml b/lib/kernel/precedence.ml
index 05ad69f..2c55817 100644
--- a/lib/kernel/precedence.ml
+++ b/lib/kernel/precedence.ml
@@ -17,8 +17,14 @@ type ('s, 'r) rules = {
   disposition : winner:'r candidate -> loser:'r candidate -> disposition;
   admit :
     observed:'r candidate ->
-    ('r candidate * privilege) list ->
+    temporal:'r candidate ->
+    ('r candidate * privilege * int) list ->
     ('r candidate * privilege) list;
+      (** the trailing [int] on each input triple is that candidate's own
+          [band] value, computed once by {!resolve} below (a rite's [admit]
+          has no [context] of its own to compute it with) -- see [resolve]'s
+          own comment for why this is a KERNEL-level policy, not a rite-
+          specific rule threaded in as data. *)
 }
 
 type 'r resolution = {
@@ -55,7 +61,19 @@ let resolve rules ctx ~temporal ~sanctoral =
       ([], [], []) losers
   in
   let comms = List.rev comms and deferred = List.rev deferred in
-  let admitted = rules.admit ~observed comms in
+  (* RG 113 (EF; docs/research/rules-register.md §4 "Commemorations"): "in
+     admittendis et ordinandis aliis commemorationibus, servetur ordo
+     tabellae praecedentiae" -- admitting AND ordering commemorations both
+     run on the rite's own table of precedence, the same [band] already
+     used above to pick [observed]. Computed here, once, generically (a
+     rite's own [admit] has no [ctx] of its own to call [band] with) rather
+     than inside every rite's [admit] separately -- a kernel-level POLICY
+     ("commemorations are ordered by the rite's own band"), not a
+     rite-specific RULE baked into the kernel: the actual [band] function,
+     and whether a rite's [admit] even uses the value it is handed, both
+     stay entirely rite-supplied. *)
+  let comms_by_precedence = List.map (fun (c, p) -> (c, p, rules.band ctx c)) comms in
+  let admitted = rules.admit ~observed ~temporal comms_by_precedence in
   let dropped =
     List.filter (fun c -> not (List.exists (fun a -> fst a == fst c) admitted)) comms
   in