{"messages":[{"content":"You are a constitutional council ranking individual git commits for ownership allocation.\n\nCompare these two commits. Decide which contributed more lasting value to the project.\n\nJudge substance, not spectacle:\n- Prefer correct, lasting design and real bugfixes over churn, formatting, renames, or generated noise.\n- Prefer clarity and necessity over sheer line count. A small precise change can beat a large diffuse one.\n- Do not favor a side merely because its patch is longer or noisier.\n- Weight what the change does for the project, not the contributor's name.\n\nReturn ONLY a JSON object: {\"winner\": \"A\" or \"B\", \"ratio\": \"N:M\", \"explanation\": \"...\"}\nThe explanation must cite concrete differences in the patches (1-3 sentences).\n\nSide A — contributor: tommy-mor\nSide A — commit message:\n[0366806e] Color rank rows by vote mass within each group, not list position.\n\nMin–max normalization keeps similar scores visually close while still\nusing the full gradient as groups grow and absolute mass dilutes.\n\nCo-authored-by: Cursor <cursoragent@cursor.com>\n\nSide A — unified diff (full patch):\ndiff --git a/server/src/html/mod.rs b/server/src/html/mod.rs\nindex a58cbbee3490a08a625cb06df06848c59a615d65..4eff2e19ed4d303ff8e80c1eabd8a15b4990e643 100644\n--- a/server/src/html/mod.rs\n+++ b/server/src/html/mod.rs\n@@ -264,12 +264,19 @@ pub fn scope_theme_style(parent: &ItemId) -> String {\n     )\n }\n \n-fn rank_row_style(parent: &ItemId, ordinal: usize, total: usize) -> String {\n-    let t = if total <= 1 {\n-        0.0\n-    } else {\n-        ordinal as f64 / (total - 1) as f64\n-    };\n+/// Map vote mass to gradient position using the group's score range, not raw mass or\n+/// list position. Vote mass sums to 1 across the component, so absolute values dilute\n+/// as N grows; min–max within the visible list preserves similar scores → similar colors.\n+fn score_gradient_t(score: f64, min_score: f64, max_score: f64) -> f64 {\n+    let spread = max_score - min_score;\n+    if spread < 1e-9 {\n+        return 0.5;\n+    }\n+    ((max_score - score) / spread).clamp(0.0, 1.0)\n+}\n+\n+fn rank_row_style(parent: &ItemId, score: f64, min_score: f64, max_score: f64) -> String {\n+    let t = score_gradient_t(score, min_score, max_score);\n     let base_hue = scope_base_hue(parent);\n     let hue = (base_hue + 118.0 * t) % 360.0;\n     let lightness = 0.74 - 0.34 * t;\n@@ -295,14 +302,15 @@ fn rank_list(\n     highlighted: &HashSet<ItemId>,\n     tree: &GlobalTree,\n ) -> Markup {\n-    let group_len = items.len();\n+    let min_score = items.iter().map(|r| r.score).fold(f64::INFINITY, f64::min);\n+    let max_score = items.iter().map(|r| r.score).fold(f64::NEG_INFINITY, f64::max);\n     html! {\n         @if !items.is_empty() {\n             h3 class=\"rank-heading muted small\" { (label) }\n             ol class=\"rank-list\" {\n                 @for (i, r) in items.iter().enumerate() {\n                     @let href = item_href(&r.item);\n-                    @let style = rank_row_style(parent, i, group_len);\n+                    @let style = rank_row_style(parent, r.score, min_score, max_score);\n                     @let class = rank_row_class(&r.item, highlighted);\n                     li class=(class)\n                         data-rank-item=(r.item.as_str())\n@@ -517,19 +525,37 @@ pub async fn browse(State(state): State<AppState>, uri: Uri) -> impl IntoRespons\n \n #[cfg(test)]\n mod tests {\n-    use super::{rank_row_style, SORTER_UI_JS};\n+    use super::{rank_row_style, score_gradient_t, SORTER_UI_JS};\n     use crate::path_types::ItemId;\n \n     #[test]\n-    fn rank_row_style_gradients_per_group_not_globally() {\n+    fn score_gradient_t_uses_group_range_not_absolute_mass() {\n+        assert!((score_gradient_t(0.12, 0.08, 0.12) - 0.0).abs() < 1e-9);\n+        assert!((score_gradient_t(0.08, 0.08, 0.12) - 1.0).abs() < 1e-9);\n+        // Raw 12% mass would map near the dark end globally; within this group it's the top.\n+        assert!(score_gradient_t(0.12, 0.08, 0.12) < score_gradient_t(0.12, 0.0, 1.0));\n+    }\n+\n+    #[test]\n+    fn score_gradient_t_similar_scores_similar_t() {\n+        let a = score_gradient_t(0.41, 0.20, 0.60);\n+        let b = score_gradient_t(0.40, 0.20, 0.60);\n+        assert!((a - b).abs() < 0.05);\n+        assert!((a - score_gradient_t(0.60, 0.20, 0.60)).abs() > 0.3);\n+    }\n+\n+    #[test]\n+    fn score_gradient_t_tied_scores_neutral() {\n+        assert!((score_gradient_t(0.25, 0.25, 0.25) - 0.5).abs() < 1e-9);\n+    }\n+\n+    #[test]\n+    fn rank_row_style_same_inputs_same_color() {\n         let parent = ItemId::opaque(\"test-scope\");\n-        let first_in_four = rank_row_style(&parent, 0, 4);\n-        let last_in_four = rank_row_style(&parent, 3, 4);\n-        let first_in_two = rank_row_style(&parent, 0, 2);\n-        let last_in_two = rank_row_style(&parent, 1, 2);\n-        assert_eq!(first_in_four, first_in_two);\n-        assert_eq!(last_in_four, last_in_two);\n-        assert_ne!(first_in_four, last_in_four);\n+        assert_eq!(\n+            rank_row_style(&parent, 0.33, 0.20, 0.60),\n+            rank_row_style(&parent, 0.33, 0.20, 0.60),\n+        );\n     }\n \n     #[test]\n\n\nSide B — contributor: tommy-mor\nSide B — commit message:\n[1531154d] dequeue -> vec\n\nSide B — unified diff (full patch):\ndiff --git a/server/src/projection_apply.rs b/server/src/projection_apply.rs\nindex 9c8990a8af927f35d3344c8d0872a516aba56b86..ad404bacb8bcdd5ae0e682cff97f974fd44528ea 100644\n--- a/server/src/projection_apply.rs\n+++ b/server/src/projection_apply.rs\n@@ -6,8 +6,6 @@\n //! batch as the (non-idempotent) edge merges guarantees exactly-once application\n //! across replay.\n \n-use std::collections::BTreeSet;\n-\n use crate::{\n     event_log::EventLogError,\n     events::{Event, EventRecord},\n@@ -44,7 +42,6 @@ pub fn apply_records(\n \n     let db = projection_store.db();\n     let mut batch = db.batch();\n-    let mut vote_parents: BTreeSet<ItemId> = BTreeSet::new();\n     let mut last_seq = 0u64;\n \n     for record in records {\n@@ -70,7 +67,6 @@ pub fn apply_records(\n                     *ts,\n                 )\n                 .map_err(|e| EventLogError::Apply(e.to_string()))?;\n-                vote_parents.insert(parent);\n             }\n             Event::NodeEnsured { id } => {\n                 let parsed = parse_event_id(id)?;\n@@ -85,11 +81,5 @@ pub fn apply_records(\n         .commit_with(durable::Durability::DisableWal)\n         .map_err(|e| EventLogError::Apply(e.to_string()))?;\n \n-    for parent in vote_parents {\n-        projection_store\n-            .trim_recent_votes(&parent)\n-            .map_err(|e| EventLogError::Apply(e.to_string()))?;\n-    }\n-\n     Ok(())\n }\ndiff --git a/server/src/projection_store.rs b/server/src/projection_store.rs\nindex 8576d671f351004426207894ac35594ddb0f70cf..9a8953d010029d3639dc3987687554bab8b7663e 100644\n--- a/server/src/projection_store.rs\n+++ b/server/src/projection_store.rs\n@@ -18,7 +18,7 @@ use crate::{\n \n const PROJECTION_CURSOR_KEY: &str = \"cursor\";\n const PROJECTION_SCHEMA_KEY: &str = \"schema_version\";\n-const PROJECTION_SCHEMA_VERSION: u64 = 3;\n+const PROJECTION_SCHEMA_VERSION: u64 = 4;\n \n #[derive(Debug, thiserror::Error)]\n pub enum ProjectionStoreError {\n@@ -142,16 +142,6 @@ impl ProjectionStore {\n         Ok(tree)\n     }\n \n-    /// Cap a node's recent-vote window after applying votes (best-effort, blind).\n-    pub(crate) fn trim_recent_votes(&self, parent: &ItemId) -> Result<(), ProjectionStoreError> {\n-        node(parent).recent_votes().truncate_back(\n-            &self.db,\n-            crate::storage_schema::RECENT_VOTES_CAP,\n-            Durability::DisableWal,\n-        )?;\n-        Ok(())\n-    }\n-\n     /// Cache Reddit display content outside the event log (must be evicted per policy).\n     pub fn put_ephemeral_content(\n         &self,\ndiff --git a/server/src/reducer.rs b/server/src/reducer.rs\nindex 0c75c85150bb9e5f578bbadf58b3e43f8a80be4b..759918b8c0eb8f8bf1ed0911d8877adaa55c8ea6 100644\n--- a/server/src/reducer.rs\n+++ b/server/src/reducer.rs\n@@ -1,4 +1,4 @@\n-use std::collections::{HashMap, HashSet, VecDeque};\n+use std::collections::{HashMap, HashSet};\n \n use serde::{Deserialize, Serialize};\n \n@@ -52,7 +52,7 @@ pub struct GroupState {\n     pub idx_to_item: Vec<ItemId>,\n     pub edges: HashMap<(usize, usize), f64>,\n     pub voted_pairs: HashSet<(usize, usize)>,\n-    pub recent_votes: VecDeque<VoteData>,\n+    pub recent_votes: Vec<VoteData>,\n }\n \n impl GroupState {\n@@ -62,7 +62,7 @@ impl GroupState {\n             idx_to_item: Vec::new(),\n             edges: HashMap::new(),\n             voted_pairs: HashSet::new(),\n-            recent_votes: VecDeque::with_capacity(200),\n+            recent_votes: Vec::new(),\n         }\n     }\n \n@@ -111,10 +111,7 @@ impl GroupState {\n         self.add_edge_weight(b_idx, a_idx, w_a);\n         self.add_edge_weight(a_idx, b_idx, w_b);\n \n-        self.recent_votes.push_front(vote);\n-        while self.recent_votes.len() > 200 {\n-            self.recent_votes.pop_back();\n-        }\n+        self.recent_votes.push(vote);\n     }\n }\n \ndiff --git a/server/src/storage_dto.rs b/server/src/storage_dto.rs\nindex 9dfb13c53efe4389277625a6ab3bfc18f566a453..3fd6db5cb909ac4896bd8a3ecace796de5f08781 100644\n--- a/server/src/storage_dto.rs\n+++ b/server/src/storage_dto.rs\n@@ -39,7 +39,7 @@ pub struct StoredEntityDataV1 {\n     pub link_url: Option<String>,\n }\n \n-/// One vote stored in a node's `recent_votes` deque.\n+/// One vote stored in a node's `recent_votes` list.\n #[derive(Debug, Clone, Serialize, Deserialize)]\n pub struct StoredVoteV1 {\n     pub version: u32,\ndiff --git a/server/src/storage_schema.rs b/server/src/storage_schema.rs\nindex bd26e665e084b95b10fdfff091c31e8dc84d07b8..5d2bb1d56927fb61c7c6d2d8602bd6882327f862 100644\n--- a/server/src/storage_schema.rs\n+++ b/server/src/storage_schema.rs\n@@ -2,13 +2,13 @@\n //! durable collections instead of one blob per node.\n //!\n //! A vote updates a handful of keys: a few edge-weight merges, a voted-pair flag,\n-//! a recent-vote deque push, and child-link set entries. The in-memory\n+//! a recent-vote list append, and child-link set entries. The in-memory\n //! [`crate::reducer::GroupState`] is reconstructed from these keys on read for\n //! rank-centrality.\n \n use std::collections::{BTreeSet, HashMap, HashSet};\n \n-use durable::{Batch, Db, Deque, Durable, Leaf, Map, Sum};\n+use durable::{Batch, Db, Durable, Leaf, List, Map, Sum};\n \n use crate::{\n     path_types::ItemId,\n@@ -38,8 +38,8 @@ pub struct NodeSchema {\n     pub edges: Map<EdgeKey, Sum<f64>>,\n     /// Voted pairs `(min, max) -> true`.\n     pub voted_pairs: Map<PairKey, Leaf<bool>>,\n-    /// Recent votes, newest at the front (capped on write).\n-    pub recent_votes: Deque<Leaf<StoredVoteV1>>,\n+    /// Recent votes, append-only oldest-first (cap applied on read).\n+    pub recent_votes: List<Leaf<StoredVoteV1>>,\n     /// When ephemeral Reddit display content was last fetched (ms); absent after eviction.\n     pub fetched_at: Leaf<i64>,\n }\n@@ -55,7 +55,7 @@ pub struct Store {\n     pub view_meta: Map<String, Leaf<u64>>,\n }\n \n-/// Cap on the per-node recent-vote window (matches the in-memory reducer).\n+/// Max recent votes returned when loading a node (query-time cap only).\n pub const RECENT_VOTES_CAP: u64 = 200;\n \n fn id_key(id: &ItemId) -> String {\n@@ -148,11 +148,14 @@ fn build_group_state(\n         }\n     }\n \n-    // Deque is front=newest; in-memory VecDeque is also front=newest.\n-    let mut recent_votes = std::collections::VecDeque::new();\n-    for stored in np.recent_votes().iter(db)? {\n-        recent_votes.push_back(decode_vote(stored).map_err(durable::Error::Deserialize)?);\n-    }\n+    // List is index order (oldest first); keep the newest RECENT_VOTES_CAP entries.\n+    let stored = np.recent_votes().iter(db)?;\n+    let cap = RECENT_VOTES_CAP as usize;\n+    let start = stored.len().saturating_sub(cap);\n+    let recent_votes = stored[start..]\n+        .iter()\n+        .map(|s| decode_vote(s.clone()).map_err(durable::Error::Deserialize))\n+        .collect::<Result<Vec<_>, _>>()?;\n \n     Ok(GroupState {\n         item_to_idx,\n@@ -248,7 +251,7 @@ pub fn vote_writes(\n     };\n     batch.write(pnode.voted_pairs().key(&(lo, hi)).set(&true));\n \n-    // Recent votes (newest at front).\n+    // Recent votes (append-only; cap on read).\n     let stored = encode_vote(&VoteData {\n         ts,\n         a: a_id,\n@@ -260,7 +263,7 @@ pub fn vote_writes(\n         delegate: None,\n         thread_tag: \"default\".to_string(),\n     });\n-    batch.push_front(&pnode.recent_votes(), &stored)?;\n+    batch.push(&pnode.recent_votes(), &stored)?;\n     Ok(())\n }\n \n@@ -314,6 +317,35 @@ mod tests {\n         assert!(load_node_state(&db, &parent).unwrap().is_none());\n     }\n \n+    #[test]\n+    fn load_caps_recent_votes_at_query_time() {\n+        let dir = tempfile::tempdir().unwrap();\n+        let db = Db::open(dir.path()).unwrap();\n+        let parent = ItemId::root();\n+\n+        let mut batch = db.batch();\n+        for i in 0..RECENT_VOTES_CAP + 10 {\n+            vote_writes(&mut batch, &parent, \"alpha\", \"beta\", 1, 0, i as i64).unwrap();\n+        }\n+        batch.commit().unwrap();\n+\n+        assert_eq!(\n+            node(&parent).recent_votes().len(&db).unwrap(),\n+            RECENT_VOTES_CAP + 10\n+        );\n+\n+        let node_state = load_node_state(&db, &parent).unwrap().unwrap();\n+        assert_eq!(node_state.local_ranking.recent_votes.len(), RECENT_VOTES_CAP as usize);\n+        assert_eq!(\n+            node_state.local_ranking.recent_votes.first().map(|v| v.ts),\n+            Some(10)\n+        );\n+        assert_eq!(\n+            node_state.local_ranking.recent_votes.last().map(|v| v.ts),\n+            Some(RECENT_VOTES_CAP as i64 + 9)\n+        );\n+    }\n+\n     #[test]\n     fn missing_node_is_none() {\n         let dir = tempfile::tempdir().unwrap();\n","role":"user"}],"model":"~x-ai/grok-latest"}