{"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[1531154d] dequeue -> vec\n\nSide A — 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\n\nSide B — contributor: tommy-mor\nSide B — commit message:\n[5350388a] Add pool-scoped voting: /vote?pool=<parent> picks pairs from children.\n\n- /vote now accepts an optional `pool` param (parent item path). When\n  provided without left/right, it picks the first unvoted pair from the\n  pool's children. When provided alongside left/right, it constrains\n  \"next pair\" navigation to siblings within the pool.\n- \"vote on children\" button appears on item pages with ≥2 children,\n  linking to /vote?pool=<item>.\n- Pool is threaded through VoteComparePost → success JS so in-page\n  morph after voting keeps the pool context for next-pair navigation.\n\nCo-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>\n\nSide B — unified diff (full patch):\ndiff --git a/server/src/api/ui_html.rs b/server/src/api/ui_html.rs\nindex 5faa642451d69555cb391974beb0ad22c9355c8c..b79efdb4d52bd445a67f38cbfd61d3507d2b3014 100644\n--- a/server/src/api/ui_html.rs\n+++ b/server/src/api/ui_html.rs\n@@ -193,6 +193,7 @@ async fn dispatch_ui_action(\n             ratio_right,\n             explanation,\n             next,\n+            pool,\n             form_action,\n         } => {\n             if form_action != \"/ui\" {\n@@ -239,6 +240,9 @@ async fn dispatch_ui_action(\n                         .into_response();\n                 }\n             };\n+            let pool_id = pool.as_deref().and_then(|p| {\n+                crate::path_types::ItemId::parse(p.trim()).map(|i| i.normalized_storage())\n+            });\n             let mut rl = ratio_left.trim().parse::<i32>().unwrap_or(0).max(0);\n             let mut rr = ratio_right.trim().parse::<i32>().unwrap_or(0).max(0);\n             if rl == 0 && rr == 0 {\n@@ -294,6 +298,7 @@ async fn dispatch_ui_action(\n                         &thread_tag,\n                         &left_id,\n                         &right_id,\n+                        pool_id.as_ref(),\n                         pid.as_str(),\n                         post_index,\n                     )\ndiff --git a/server/src/html/garden/pin.rs b/server/src/html/garden/pin.rs\nindex 5865cfdbc06aeb6555c97380e25591fae6b3d125..1820d7fe7ee167ecbf5ad5124f23b2ab92ffb01f 100644\n--- a/server/src/html/garden/pin.rs\n+++ b/server/src/html/garden/pin.rs\n@@ -79,7 +79,7 @@ pub(super) fn ont_pin_vote_controls(\n                         }\n                     }\n                 } @else {\n-                    a class=\"ont-vote-compare-btn\" href=(vote_compare_href(nav, pi, &current, None)) title=\"Compare and vote\" {\n+                    a class=\"ont-vote-compare-btn\" href=(vote_compare_href(nav, pi, &current, None, None)) title=\"Compare and vote\" {\n                         span class=\"ont-vote-glyph\" aria-hidden=\"true\" { \"⚖\" }\n                         span { \"vote\" }\n                     }\n@@ -121,7 +121,7 @@ pub(super) fn child_row_pin_or_vote(\n                         if nv == 1 { \"\" } else { \"s\" },\n                     );\n                     @let aria = format!(\"Vote; {} pairwise {}\", nv, if nv == 1 { \"vote\" } else { \"votes\" });\n-                    a class=\"ont-garden-vote-ico\" href=(vote_compare_href(nav, pi, row_item, None)) title=(tip) aria-label=(aria) {\n+                    a class=\"ont-garden-vote-ico\" href=(vote_compare_href(nav, pi, row_item, None, None)) title=(tip) aria-label=(aria) {\n                         span class=\"ont-garden-vote-glyph\" aria-hidden=\"true\" { \"⚖\" }\n                         span class=\"ont-garden-vote-count\" { (format!(\"{}\", nv)) }\n                     }\ndiff --git a/server/src/html/garden/render.rs b/server/src/html/garden/render.rs\nindex 5c3986ca36902f6c9019a4b5590f0b3b9d2cb4ff..bd8cbce059ee789de6e8dc9b6f69f54beee2f994 100644\n--- a/server/src/html/garden/render.rs\n+++ b/server/src/html/garden/render.rs\n@@ -29,6 +29,7 @@ use super::{\n     item::{child_depth_from_uri, item_code_label, item_display_path, item_href},\n     item_page::{build_item_page_view_model, sibling_nav_markup},\n     pin::{child_row_pin_or_vote, ont_pin_vote_controls, pinned_item_from_jar},\n+    vote::vote_pool_href,\n };\n \n pub(super) async fn render_scope_view(\n@@ -186,12 +187,21 @@ pub(super) async fn render_scope_view(\n             }\n \n             section class=\"ont-tab-panel ont-tab-panel-children\" {\n+                @let total_children = model.child_rankings.component_rankings\n+                    .iter().map(|c| c.ranked.len()).sum::<usize>()\n+                    + model.child_rankings.unranked_items.len();\n                 h3 {\n                     \"ranked child groups\"\n                     @if model.child_depth > 1 {\n                         \" \"\n                         span class=\"muted\" { (format!(\"(depth {})\", model.child_depth)) }\n                     }\n+                    @if total_children >= 2 {\n+                        \" \"\n+                        a class=\"ont-vote-children-btn\" href=(vote_pool_href(&nav, &model.item)) {\n+                            \"vote on children\"\n+                        }\n+                    }\n                 }\n                 @if model.child_rankings.component_rankings.is_empty() {\n                     p class=\"muted\" { \"no voted pairs yet in this scope\" }\ndiff --git a/server/src/html/garden/tests.rs b/server/src/html/garden/tests.rs\nindex 6900a6795bcde866a176722149d6378e5127b4c3..c2036fca7752aef63d260e36cfe9649f63b5c550 100644\n--- a/server/src/html/garden/tests.rs\n+++ b/server/src/html/garden/tests.rs\n@@ -105,7 +105,7 @@ fn suggest_next_vote_pair_prefers_unvoted_sibling_pair() {\n     let content = content_for_garden_view(&reduced, &ScopeId::Public);\n     let a = ItemId::parse(\"~/topic/a\").unwrap().normalized_storage();\n     let b = ItemId::parse(\"~/topic/b\").unwrap().normalized_storage();\n-    let next = suggest_next_vote_pair(content, &a, &b).expect(\"next sibling pair\");\n+    let next = suggest_next_vote_pair(content, &a, &b, None).expect(\"next sibling pair\");\n     assert_ne!(\n         canonical_edge_items(&next.0, &next.1),\n         canonical_edge_items(&a, &b)\ndiff --git a/server/src/html/garden/vote.rs b/server/src/html/garden/vote.rs\nindex 1d7fc8aa7436bfa9c1186dfd940a8d751ab7e088..2682cfcbd2f834b56459a02831aa225cffe67c58 100644\n--- a/server/src/html/garden/vote.rs\n+++ b/server/src/html/garden/vote.rs\n@@ -211,14 +211,15 @@ pub(crate) async fn vote_compare_post_success_js(\n     _thread_tag: &str,\n     left: &ItemId,\n     right: &ItemId,\n+    pool: Option<&ItemId>,\n     _post_id: &str,\n     _post_idx: Option<usize>,\n ) -> String {\n     let reduced = state.reduced.read().await;\n     let content = content_for_garden_view(&reduced, &nav.scope());\n     let edge_history = vote_edge_history_markup(content, left, right);\n-    let next_pair = suggest_next_vote_pair(content, left, right);\n-    let nav_markup = vote_compare_nav_markup(nav, next_pair.as_ref());\n+    let next_pair = suggest_next_vote_pair(content, left, right, pool);\n+    let nav_markup = vote_compare_nav_markup(nav, next_pair.as_ref(), pool);\n     drop(reduced);\n     JsBuilder::new()\n         .morph_inner_selector(\"#vote-edge-history-region\", edge_history)\n@@ -231,27 +232,39 @@ pub(super) fn vote_compare_href(\n     left: &ItemId,\n     right: &ItemId,\n     thread_override: Option<&str>,\n+    pool: Option<&ItemId>,\n ) -> String {\n     let left_q = urlencoding::encode(left.as_str());\n     let right_q = urlencoding::encode(right.as_str());\n-    let base = format!(\n+    let mut base = format!(\n         \"{}/vote?left={}&right={}\",\n         nav.room_path_prefix_for_vote_compare(),\n         left_q,\n         right_q\n     );\n     if let Some(t) = thread_override.filter(|s| !s.is_empty()) {\n-        format!(\"{}&thread={}\", base, urlencoding::encode(t))\n-    } else {\n-        base\n+        base = format!(\"{}&thread={}\", base, urlencoding::encode(t));\n+    }\n+    if let Some(p) = pool {\n+        base = format!(\"{}&pool={}\", base, urlencoding::encode(p.as_str()));\n     }\n+    base\n+}\n+\n+pub(super) fn vote_pool_href(nav: &ThreadNav, pool_item_str: &str) -> String {\n+    format!(\n+        \"{}/vote?pool={}\",\n+        nav.room_path_prefix_for_vote_compare(),\n+        urlencoding::encode(pool_item_str)\n+    )\n }\n \n fn vote_compare_nav_markup(\n     nav: &ThreadNav,\n     next_pair: Option<&(ItemId, ItemId)>,\n+    pool: Option<&ItemId>,\n ) -> maud::Markup {\n-    let next_pair_href = next_pair.map(|(nl, nr)| vote_compare_href(nav, nl, nr, None));\n+    let next_pair_href = next_pair.map(|(nl, nr)| vote_compare_href(nav, nl, nr, None, pool));\n     html! {\n         div class=\"vote-compare-nav\" {\n             @if let Some(href) = &next_pair_href {\n@@ -267,8 +280,15 @@ pub(super) fn suggest_next_vote_pair(\n     content: &ContentState,\n     current_left: &ItemId,\n     current_right: &ItemId,\n+    pool_parent: Option<&ItemId>,\n ) -> Option<(ItemId, ItemId)> {\n-    let pool: Vec<ItemId> = if current_left.parent().as_ref().map(|p| p.as_str())\n+    let pool: Vec<ItemId> = if let Some(parent) = pool_parent {\n+        content\n+            .item_children\n+            .get(parent)\n+            .map(|s| s.iter().cloned().collect())\n+            .unwrap_or_default()\n+    } else if current_left.parent().as_ref().map(|p| p.as_str())\n         == current_right.parent().as_ref().map(|p| p.as_str())\n     {\n         current_left\n@@ -322,10 +342,14 @@ pub(super) fn vote_compare_item_card(\n }\n #[derive(Debug, Deserialize)]\n pub struct VoteCompareQuery {\n-    pub left: String,\n-    pub right: String,\n+    #[serde(default)]\n+    pub left: Option<String>,\n+    #[serde(default)]\n+    pub right: Option<String>,\n     #[serde(default)]\n     pub thread: Option<String>,\n+    #[serde(default)]\n+    pub pool: Option<String>,\n }\n \n /// Public pairwise vote UI — `/vote?left=&right=&thread=`.\n@@ -376,17 +400,53 @@ async fn vote_compare_inner(\n     jar: CookieJar,\n     uri: Uri,\n ) -> axum::response::Response {\n-    let left = match ItemId::parse(q.left.trim()) {\n-        Some(i) => i.normalized_storage(),\n-        None => return (StatusCode::NOT_FOUND, \"bad left item\").into_response(),\n+    let pool_id: Option<ItemId> = match q.pool.as_deref() {\n+        Some(p) => match ItemId::parse(p.trim()) {\n+            Some(i) => Some(i.normalized_storage()),\n+            None => return (StatusCode::BAD_REQUEST, \"bad pool item\").into_response(),\n+        },\n+        None => None,\n     };\n-    let right = match ItemId::parse(q.right.trim()) {\n-        Some(i) => i.normalized_storage(),\n-        None => return (StatusCode::NOT_FOUND, \"bad right item\").into_response(),\n+\n+    let (left, right) = match (q.left.as_deref(), q.right.as_deref()) {\n+        (Some(l), Some(r)) => {\n+            let left = match ItemId::parse(l.trim()) {\n+                Some(i) => i.normalized_storage(),\n+                None => return (StatusCode::NOT_FOUND, \"bad left item\").into_response(),\n+            };\n+            let right = match ItemId::parse(r.trim()) {\n+                Some(i) => i.normalized_storage(),\n+                None => return (StatusCode::NOT_FOUND, \"bad right item\").into_response(),\n+            };\n+            if left == right {\n+                return (StatusCode::BAD_REQUEST, \"items must differ\").into_response();\n+            }\n+            (left, right)\n+        }\n+        (None, None) => {\n+            let Some(pool) = pool_id.as_ref() else {\n+                return (StatusCode::BAD_REQUEST, \"provide left+right or pool\").into_response();\n+            };\n+            let reduced = state.reduced.read().await;\n+            let content = content_for_garden_view(&reduced, &nav.scope());\n+            let children: Vec<ItemId> = content\n+                .item_children\n+                .get(pool)\n+                .map(|s| s.iter().cloned().collect())\n+                .unwrap_or_default();\n+            if children.len() < 2 {\n+                drop(reduced);\n+                return (StatusCode::BAD_REQUEST, \"pool has fewer than 2 children to compare\").into_response();\n+            }\n+            let pair = suggest_next_pair_in_pool(&content.ranking_group, &children, None);\n+            drop(reduced);\n+            match pair {\n+                Some(p) => p,\n+                None => return (StatusCode::BAD_REQUEST, \"no pairs available in pool\").into_response(),\n+            }\n+        }\n+        _ => return (StatusCode::BAD_REQUEST, \"provide both left and right, or just pool\").into_response(),\n     };\n-    if left == right {\n-        return (StatusCode::BAD_REQUEST, \"items must differ\").into_response();\n-    }\n \n     let reduced = state.reduced.read().await;\n     let content = content_for_garden_view(&reduced, &nav.scope());\n@@ -409,7 +469,7 @@ async fn vote_compare_inner(\n     let left_body = content.item_bodies.get(&left).cloned();\n     let right_body = content.item_bodies.get(&right).cloned();\n     let item_bodies_for_cards = content.item_bodies.clone();\n-    let next_pair = suggest_next_vote_pair(content, &left, &right);\n+    let next_pair = suggest_next_vote_pair(content, &left, &right, pool_id.as_ref());\n     drop(reduced);\n \n     let title = format!(\n@@ -432,6 +492,7 @@ async fn vote_compare_inner(\n         \"ratio_right\": {\"$form\": \"ratio_right\"},\n         \"explanation\": {\"$form\": \"explanation\"},\n         \"next\": next_path,\n+        \"pool\": pool_id.as_ref().map(|p| p.as_str()),\n         \"form_action\": \"/ui\",\n     }))\n     .expect(\"vote compare rpc json\");\n@@ -456,7 +517,7 @@ async fn vote_compare_inner(\n                 Some(&item_bodies_for_cards),\n             ))\n         }\n-        (vote_compare_nav_markup(&nav, next_pair.as_ref()))\n+        (vote_compare_nav_markup(&nav, next_pair.as_ref(), pool_id.as_ref()))\n         div id=\"vote-edge-history-region\" {\n             (edge_history)\n         }\ndiff --git a/server/src/html/ui_action.rs b/server/src/html/ui_action.rs\nindex dd5294202569454acf9f41b458718700bbf96f39..2589a2cc00bb7b18cd19ebcbb938083122d6921d 100644\n--- a/server/src/html/ui_action.rs\n+++ b/server/src/html/ui_action.rs\n@@ -50,6 +50,9 @@ pub enum HtmlUiAction {\n         explanation: String,\n         /// Same-origin path after successful post (JS redirect).\n         next: String,\n+        /// Pool parent item path, if the vote was initiated from a pool URL.\n+        #[serde(default)]\n+        pool: Option<String>,\n         #[serde(default = \"default_ui_form_action\")]\n         form_action: String,\n     },\n","role":"user"}],"model":"~x-ai/grok-latest"}