{"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[5db58b98] Improve vote pair selection for spanning trees and rank refinement.\n\nPrefer attaching unranked items to established components before comparing\nisolates, then zip down adjacent rank-centrality pairs once the pool is fully\nconnected, skipping pairs that already have votes.\n\nCo-authored-by: Cursor <cursoragent@cursor.com>\n\nSide A — unified diff (full patch):\ndiff --git a/server/src/pair.rs b/server/src/pair.rs\nindex 54b5d2417e9dba04ed8df422156e274c2b2f76b2..c14de4b0502c8b5a17cddf3746077739d56e03e0 100644\n--- a/server/src/pair.rs\n+++ b/server/src/pair.rs\n@@ -3,13 +3,21 @@\n //! Pair selection prefers **bridge** votes — comparisons between items in\n //! different connected components of the voted-pairs graph — so the pool\n //! merges into one ranking group before refining within it.\n+//!\n+//! Among unvoted bridges, prefer merging established voted components, then\n+//! attaching a never-voted child to an established component, and only then\n+//! comparing two never-voted children (so the voted graph grows as one tree).\n+//!\n+//! Once every pool child sits in one voted component, refinement **zips** down\n+//! the rank-centrality order: prefer 1 vs 2, then 2 vs 3, and so on, skipping\n+//! pairs that already have a vote.\n \n use rand::seq::SliceRandom;\n use std::collections::{HashMap, HashSet};\n \n use crate::{\n     path_types::ItemId,\n-    ranking::connected_components_from_voted_pairs,\n+    ranking::{connected_components_from_voted_pairs, ranked_items},\n     reducer::{GlobalTree, GroupState},\n };\n \n@@ -28,36 +36,77 @@ fn pair_is_voted(group: &GroupState, a: &ItemId, b: &ItemId) -> bool {\n     group.voted_pairs.contains(&(i, j))\n }\n \n-/// Component id per pool item: voted-pairs graph components plus one id per\n-/// never-voted child.\n-fn component_ids(group: &GroupState, pool: &[ItemId]) -> HashMap<ItemId, usize> {\n+/// Voted-pairs layout for pool items: component id per item plus which ids are\n+/// multi-node voted components (ranked groups in the UI).\n+struct ComponentLayout {\n+    ids: HashMap<ItemId, usize>,\n+    established: HashSet<usize>,\n+}\n+\n+fn component_layout(group: &GroupState, pool: &[ItemId]) -> ComponentLayout {\n     let n = group.idx_to_item.len();\n     let (comps, isolates) =\n         connected_components_from_voted_pairs(n, group.voted_pairs.iter().copied());\n \n-    let mut out: HashMap<ItemId, usize> = HashMap::new();\n+    let mut established = HashSet::new();\n+    let mut ids: HashMap<ItemId, usize> = HashMap::new();\n     for (comp_idx, comp) in comps.iter().enumerate() {\n+        if comp.len() >= 2 {\n+            established.insert(comp_idx);\n+        }\n         for &idx in comp {\n             if idx < n {\n-                out.insert(group.idx_to_item[idx].clone(), comp_idx);\n+                ids.insert(group.idx_to_item[idx].clone(), comp_idx);\n             }\n         }\n     }\n     let mut next = comps.len();\n     for &idx in &isolates {\n         if idx < n {\n-            out.insert(group.idx_to_item[idx].clone(), next);\n+            ids.insert(group.idx_to_item[idx].clone(), next);\n             next += 1;\n         }\n     }\n     for item in pool {\n-        out.entry(item.clone()).or_insert_with(|| {\n+        ids.entry(item.clone()).or_insert_with(|| {\n             let id = next;\n             next += 1;\n             id\n         });\n     }\n-    out\n+    ComponentLayout { ids, established }\n+}\n+\n+/// Every pool child shares one multi-node voted component (spanning tree phase done).\n+fn pool_fully_connected(layout: &ComponentLayout, pool: &[ItemId]) -> bool {\n+    if pool.len() < 2 {\n+        return false;\n+    }\n+    let mut comp_id = None;\n+    for item in pool {\n+        let Some(id) = layout.ids.get(item) else {\n+            return false;\n+        };\n+        if !layout.established.contains(id) {\n+            return false;\n+        }\n+        match comp_id {\n+            None => comp_id = Some(*id),\n+            Some(expected) if expected == *id => {}\n+            _ => return false,\n+        }\n+    }\n+    comp_id.is_some()\n+}\n+\n+/// Pool children that appear in `group`, sorted best rank first.\n+fn ranked_pool_order(group: &GroupState, pool: &[ItemId]) -> Vec<ItemId> {\n+    let pool_set: HashSet<_> = pool.iter().collect();\n+    ranked_items(group)\n+        .into_iter()\n+        .map(|r| r.item)\n+        .filter(|id| pool_set.contains(id))\n+        .collect()\n }\n \n #[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord)]\n@@ -72,19 +121,108 @@ enum PairPriority {\n     WithinVoted = 3,\n }\n \n-fn pair_priority(\n+/// Tie-break among unvoted bridge pairs.\n+#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord)]\n+enum BridgeSubPriority {\n+    /// Both endpoints lie in established (multi-node) voted components.\n+    MergeEstablished = 0,\n+    /// One established component member and one never-voted child.\n+    AttachIsolate = 1,\n+    /// Two never-voted children (separate singleton components).\n+    IsolatePair = 2,\n+}\n+\n+/// Tie-break among within-component pairs once the pool is one connected group.\n+#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord)]\n+struct WithinSubPriority {\n+    /// 1 = adjacent ranks (i vs i+1); larger = farther apart in the order.\n+    rank_gap: usize,\n+    /// min rank index of the two — zip from the top (1 vs 2 before 2 vs 3).\n+    zip_index: usize,\n+}\n+\n+const WITHIN_SUB_WORST: WithinSubPriority = WithinSubPriority {\n+    rank_gap: usize::MAX,\n+    zip_index: usize::MAX,\n+};\n+\n+#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord)]\n+struct PairSortKey {\n+    priority: PairPriority,\n+    bridge_sub: BridgeSubPriority,\n+    within_sub: WithinSubPriority,\n+}\n+\n+fn item_in_established(layout: &ComponentLayout, item: &ItemId) -> bool {\n+    layout\n+        .ids\n+        .get(item)\n+        .is_some_and(|id| layout.established.contains(id))\n+}\n+\n+fn bridge_sub_priority(layout: &ComponentLayout, a: &ItemId, b: &ItemId) -> BridgeSubPriority {\n+    let a_est = item_in_established(layout, a);\n+    let b_est = item_in_established(layout, b);\n+    match (a_est, b_est) {\n+        (true, true) => BridgeSubPriority::MergeEstablished,\n+        (true, false) | (false, true) => BridgeSubPriority::AttachIsolate,\n+        (false, false) => BridgeSubPriority::IsolatePair,\n+    }\n+}\n+\n+fn within_sub_priority(\n+    group: &GroupState,\n+    pool: &[ItemId],\n+    layout: &ComponentLayout,\n+    a: &ItemId,\n+    b: &ItemId,\n+) -> WithinSubPriority {\n+    if !pool_fully_connected(layout, pool) {\n+        return WITHIN_SUB_WORST;\n+    }\n+    let order = ranked_pool_order(group, pool);\n+    let (Some(i), Some(j)) = (order.iter().position(|x| x == a), order.iter().position(|x| x == b))\n+    else {\n+        return WITHIN_SUB_WORST;\n+    };\n+    WithinSubPriority {\n+        rank_gap: i.abs_diff(j),\n+        zip_index: i.min(j),\n+    }\n+}\n+\n+fn pair_sort_key(\n     group: &GroupState,\n-    components: &HashMap<ItemId, usize>,\n+    pool: &[ItemId],\n+    layout: &ComponentLayout,\n     a: &ItemId,\n     b: &ItemId,\n-) -> PairPriority {\n+) -> PairSortKey {\n     let voted = pair_is_voted(group, a, b);\n-    let bridge = components.get(a) != components.get(b);\n-    match (bridge, voted) {\n+    let bridge = layout.ids.get(a) != layout.ids.get(b);\n+    let priority = match (bridge, voted) {\n         (true, false) => PairPriority::BridgeUnvoted,\n         (false, false) => PairPriority::WithinUnvoted,\n         (true, true) => PairPriority::BridgeVoted,\n         (false, true) => PairPriority::WithinVoted,\n+    };\n+    let bridge_sub = if priority == PairPriority::BridgeUnvoted {\n+        bridge_sub_priority(layout, a, b)\n+    } else {\n+        BridgeSubPriority::MergeEstablished\n+    };\n+    let within_sub = if matches!(\n+        priority,\n+        PairPriority::WithinUnvoted | PairPriority::WithinVoted\n+    ) {\n+        within_sub_priority(group, pool, layout, a, b)\n+    } else {\n+        WITHIN_SUB_WORST\n+    };\n+    PairSortKey {\n+        priority,\n+        bridge_sub,\n+        within_sub,\n     }\n }\n \n@@ -109,9 +247,12 @@ fn candidate_pairs(pool: &[ItemId], exclude: Option<(&ItemId, &ItemId)>) -> Vec<\n \n /// Pick the next pair to vote on within `pool`.\n ///\n-/// 1. Prefer unvoted **bridge** pairs (connect separate ranking components).\n-/// 2. Then unvoted within-component pairs (refinement).\n-/// 3. Then already-voted pairs (re-compare).\n+/// 1. Prefer unvoted **bridge** pairs (connect separate ranking components),\n+///    with sub-priority: merge established components, attach an isolate to\n+///    established, then compare two isolates.\n+/// 2. Then unvoted within-component pairs; when the pool is one connected group,\n+///    prefer adjacent ranks (1 vs 2, 2 vs 3, …) in order, skipping voted pairs.\n+/// 3. Then already-voted pairs (re-compare), with the same zip ordering.\n pub fn suggest_next_pair_in_pool(\n     group: &GroupState,\n     pool: &[ItemId],\n@@ -121,15 +262,15 @@ pub fn suggest_next_pair_in_pool(\n     if candidates.is_empty() {\n         return None;\n     }\n-    let components = component_ids(group, pool);\n+    let layout = component_layout(group, pool);\n     let best = candidates\n         .iter()\n-        .map(|(a, b)| (pair_priority(group, &components, a, b), (a, b)))\n-        .min_by_key(|(p, _)| *p)?\n+        .map(|(a, b)| (pair_sort_key(group, pool, &layout, a, b), (a, b)))\n+        .min_by_key(|(k, _)| *k)?\n         .0;\n     let best_pairs: Vec<(ItemId, ItemId)> = candidates\n         .into_iter()\n-        .filter(|(a, b)| pair_priority(group, &components, a, b) == best)\n+        .filter(|(a, b)| pair_sort_key(group, pool, &layout, a, b) == best)\n         .collect();\n     best_pairs.choose(&mut rand::thread_rng()).cloned()\n }\n@@ -303,6 +444,38 @@ mod tests {\n         assert!(from_ab && from_cd, \"expected bridge pair, got {:?}\", chosen);\n     }\n \n+    #[test]\n+    fn suggest_prefers_attach_over_isolate_pair_among_many_unranked() {\n+        let parent = ItemId::parse(\"reddit.com/r/rust\").unwrap();\n+        let mut tree = seed_children(\n+            &parent,\n+            &[\n+                \"reddit.com/r/rust/a\",\n+                \"reddit.com/r/rust/b\",\n+                \"reddit.com/r/rust/c\",\n+                \"reddit.com/r/rust/d\",\n+                \"reddit.com/r/rust/e\",\n+            ],\n+        );\n+        let ab =\n+            VoteData::from_recorded(1, \"reddit.com/r/rust/a\", \"reddit.com/r/rust/b\", 2, 1).unwrap();\n+        tree.apply_vote(&parent, ab);\n+        let group = tree.get(&parent).unwrap().local_ranking.clone();\n+        let pool = children_of(&tree, &parent);\n+        let pair = suggest_next_pair_in_pool(&group, &pool, None).unwrap();\n+        let chosen = pair_set(&pair);\n+        let from_ab =\n+            chosen.contains(\"reddit.com/r/rust/a\") || chosen.contains(\"reddit.com/r/rust/b\");\n+        let from_cde = chosen.contains(\"reddit.com/r/rust/c\")\n+            || chosen.contains(\"reddit.com/r/rust/d\")\n+            || chosen.contains(\"reddit.com/r/rust/e\");\n+        assert!(\n+            from_ab && from_cde,\n+            \"expected ranked+unranked attach, got {:?}\",\n+            chosen\n+        );\n+    }\n+\n     #[test]\n     fn suggest_connects_isolate_to_existing_component() {\n         let parent = ItemId::parse(\"reddit.com/r/rust\").unwrap();\n@@ -325,6 +498,65 @@ mod tests {\n         assert!(chosen.contains(\"reddit.com/r/rust/a\") || chosen.contains(\"reddit.com/r/rust/b\"));\n     }\n \n+    #[test]\n+    fn suggest_zips_adjacent_ranks_when_tree_complete() {\n+        let parent = ItemId::parse(\"reddit.com/r/rust\").unwrap();\n+        let mut tree = seed_children(\n+            &parent,\n+            &[\n+                \"reddit.com/r/rust/a\",\n+                \"reddit.com/r/rust/b\",\n+                \"reddit.com/r/rust/c\",\n+            ],\n+        );\n+        // Star at a connects all three; b-c is the only unvoted adjacent pair left.\n+        for (a, b, l, r) in [\n+            (\"reddit.com/r/rust/a\", \"reddit.com/r/rust/b\", 3, 1),\n+            (\"reddit.com/r/rust/a\", \"reddit.com/r/rust/c\", 2, 1),\n+        ] {\n+            let v = VoteData::from_recorded(1, a, b, l, r).unwrap();\n+            tree.apply_vote(&parent, v);\n+        }\n+        let group = tree.get(&parent).unwrap().local_ranking.clone();\n+        let pool = children_of(&tree, &parent);\n+        let pair = suggest_next_pair_in_pool(&group, &pool, None).unwrap();\n+        let chosen = pair_set(&pair);\n+        // a-b and a-c voted; b-c is the only unvoted adjacent pair in rank order.\n+        assert!(chosen.contains(\"reddit.com/r/rust/b\"));\n+        assert!(chosen.contains(\"reddit.com/r/rust/c\"));\n+    }\n+\n+    #[test]\n+    fn suggest_zip_prefers_1v2_before_2v3_when_both_unvoted() {\n+        let parent = ItemId::parse(\"reddit.com/r/rust\").unwrap();\n+        let mut tree = seed_children(\n+            &parent,\n+            &[\n+                \"reddit.com/r/rust/a\",\n+                \"reddit.com/r/rust/b\",\n+                \"reddit.com/r/rust/c\",\n+                \"reddit.com/r/rust/d\",\n+            ],\n+        );\n+        // Hub at c connects all four; leave rank-adjacent a-b and b-c unvoted.\n+        for (a, b, l, r) in [\n+            (\"reddit.com/r/rust/c\", \"reddit.com/r/rust/d\", 3, 1),\n+            (\"reddit.com/r/rust/b\", \"reddit.com/r/rust/c\", 2, 1),\n+            (\"reddit.com/r/rust/a\", \"reddit.com/r/rust/c\", 2, 1),\n+        ] {\n+            let v = VoteData::from_recorded(1, a, b, l, r).unwrap();\n+            tree.apply_vote(&parent, v);\n+        }\n+        let group = tree.get(&parent).unwrap().local_ranking.clone();\n+        let pool = children_of(&tree, &parent);\n+        assert!(pool_fully_connected(&component_layout(&group, &pool), &pool));\n+        let pair = suggest_next_pair_in_pool(&group, &pool, None).unwrap();\n+        let chosen = pair_set(&pair);\n+        // Top adjacent unvoted edge should be a-b (zip index 0), not b-c (index 1).\n+        assert!(chosen.contains(\"reddit.com/r/rust/a\"));\n+        assert!(chosen.contains(\"reddit.com/r/rust/b\"));\n+    }\n+\n     #[test]\n     fn resolve_pair_picks_from_pool() {\n         let parent = ItemId::parse(\"reddit.com/r/rust\").unwrap();\n\n\nSide B — contributor: tommy-mor\nSide B — commit message:\n[9acdf18a] feat: add RoomList RPC command and CLI room list subcommand\n\nReturns all rooms the authenticated principal has a grant in.\nIncludes integration tests proving per-user isolation: users only\nsee rooms they have been explicitly granted, not all rooms in the system.\n\nCo-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>\n\nSide B — unified diff (full patch):\ndiff --git a/bb.edn b/bb.edn\nindex f7c53eb2d5def514a8f2c480ac420416205db14e..8dc6a5be7321de198cbb5939842a33b8c5d52625 100644\n--- a/bb.edn\n+++ b/bb.edn\n@@ -47,16 +47,18 @@\n                                            \"RUST_LOG\"      \"info\"})})))}\n \n   test\n-  {:doc \"Full test suite: integration + auth + grants + invites\"\n+  {:doc \"Full test suite: integration + auth + grants + invites + room-list\"\n    :requires ([test.integration :as integration]\n               [test.auth :as auth]\n               [test.grants :as grants]\n-              [test.invites :as invites])\n+              [test.invites :as invites]\n+              [test.room-list :as room-list])\n    :task (do\n            (integration/integration)\n            (auth/auth-test)\n            (grants/grants-test)\n-           (invites/invites-test))}\n+           (invites/invites-test)\n+           (room-list/room-list-test))}\n \n   walkthrough-fixture\n   {:doc \"Run local server + mock OAuth + seeded walkthrough data for manual browser demos\"\ndiff --git a/cli/src/main.rs b/cli/src/main.rs\nindex 69492cb5417a0a19c38f8cacbeadd103bd905b6f..b008cf377bb360aaae666d2dfd4b5e13dedb204a 100644\n--- a/cli/src/main.rs\n+++ b/cli/src/main.rs\n@@ -219,6 +219,12 @@ enum RoomCmd {\n         #[arg(long)]\n         json: bool,\n     },\n+    /// List rooms the authenticated user has access to\n+    List {\n+        /// Output as JSON for agent parsing\n+        #[arg(long)]\n+        json: bool,\n+    },\n }\n \n #[derive(Subcommand, Debug)]\n@@ -1319,6 +1325,38 @@ async fn main() -> Result<()> {\n                     _ => return Err(anyhow!(\"unexpected RPC result\")),\n                 }\n             }\n+            RoomCmd::List { json } => {\n+                let client = http_client()?;\n+                let bearer = effective_bearer().ok_or_else(|| {\n+                    anyhow!(\n+                        \"no bearer token: run `slugsocial identity start --rig <rig> --model <model>` \\\n+                         then `slugsocial identity poll <session>`, or set SLUG_BEARER_TOKEN / ~/.config/slugsocial/token\"\n+                    )\n+                })?;\n+                let batch = send_rpc(\n+                    &client,\n+                    base,\n+                    Some(&bearer),\n+                    vec![RpcCommand::RoomList],\n+                )\n+                .await?;\n+                match rpc_line_ok(&batch.results[0])? {\n+                    RpcResult::RoomList(resp) => {\n+                        if json {\n+                            println!(\"{}\", serde_json::to_string_pretty(&resp)?);\n+                        } else {\n+                            if resp.rooms.is_empty() {\n+                                println!(\"no rooms\");\n+                            } else {\n+                                for room in &resp.rooms {\n+                                    println!(\"{room}\");\n+                                }\n+                            }\n+                        }\n+                    }\n+                    _ => return Err(anyhow!(\"unexpected RPC result\")),\n+                }\n+            }\n         },\n \n         Command::Healthz { json } => {\ndiff --git a/server/src/api/rpc.rs b/server/src/api/rpc.rs\nindex ed4800e7cbdeaf04e72192c191e71354e603c1fe..f1ee6d35b95a1a28490823e907b8f4dc5c091b94 100644\n--- a/server/src/api/rpc.rs\n+++ b/server/src/api/rpc.rs\n@@ -1345,6 +1345,25 @@ pub async fn handle_rpc_batch(\n                     }\n                 }\n             }\n+            RpcCommand::RoomList => {\n+                let principal = {\n+                    let reduced = state.reduced.read().await;\n+                    verify_bearer_principal(&headers, &*reduced)\n+                };\n+                match principal {\n+                    Err((_, m)) => line_err(m, None),\n+                    Ok(principal) => {\n+                        let reduced = state.reduced.read().await;\n+                        let rooms: Vec<String> = reduced\n+                            .grants\n+                            .iter()\n+                            .filter(|(_, members)| members.contains_key(&principal))\n+                            .map(|(room, _)| room.clone())\n+                            .collect();\n+                        line_ok(RpcResult::RoomList(RoomListResponse { rooms }))\n+                    }\n+                }\n+            }\n             RpcCommand::RoomRevoke {\n                 room,\n                 username,\ndiff --git a/test/room_list.clj b/test/room_list.clj\nnew file mode 100644\nindex 0000000000000000000000000000000000000000..a089a722ac8d5f822f47d5511a46f671d61d46cf\n--- /dev/null\n+++ b/test/room_list.clj\n@@ -0,0 +1,158 @@\n+(ns test.room-list\n+  \"Room list integration test: list rooms user has access to via POST /api/v0/rpc.\n+\n+  Covers:\n+  - user with no rooms -> empty list\n+  - user with one room -> list contains that room\n+  - user with multiple rooms -> list contains all rooms\"\n+  (:require [babashka.fs :as fs]\n+            [cheshire.core :as json]\n+            [clojure.set :as set]\n+            [test.common :as common]\n+            [test.oauth :as oauth]))\n+\n+(def ^:private counts (atom {:pass 0 :fail 0}))\n+\n+(defn- assert! [pred msg]\n+  (common/test-assert! counts pred msg))\n+\n+(defn- bearer [token] {\"Authorization\" (str \"Bearer \" token)})\n+\n+(defn- rpc-batch! [base-url token cmds]\n+  (let [resp (oauth/http-post-json (str base-url \"/api/v0/rpc\") cmds :headers (bearer token))]\n+    {:status (:status resp)\n+     :parsed (json/parse-string (:body resp) false)}))\n+\n+(defn- rpc-line-ok? [parsed]\n+  (true? (get-in parsed [\"results\" 0 \"ok\"])))\n+\n+(defn- register-user! [base-url session-agent username]\n+  (oauth/complete-registration! base-url\n+                                :agent session-agent\n+                                :username username\n+                                :assert! (fn [pred msg] (assert! pred msg))))\n+\n+(defn room-list-test [& _args]\n+  (println \"\\n━━━ room list integration check ━━━\\n\")\n+  (reset! counts {:pass 0 :fail 0})\n+\n+  (println \"building server binary…\")\n+  (common/letlocals\n+   (bind build (common/run-cargo-build-release! [\"slugsocial-server\"]))\n+   (assert! (zero? (:exit build)) \"cargo build succeeds\")\n+   (bind server-bin \"target/release/slugsocial-server\")\n+\n+   (bind tmp-dir (str (fs/create-temp-dir {:prefix \"slug-room-list-\"})))\n+   (bind slug-port (common/pick-port))\n+   (bind google-port (common/pick-port))\n+   (bind base-url (str \"http://127.0.0.1:\" slug-port))\n+   (bind google-url (str \"http://127.0.0.1:\" google-port))\n+\n+   (bind !server (atom nil))\n+   (bind !google (atom nil))\n+\n+   (bind server-env (common/slug-server-env tmp-dir base-url google-url slug-port))\n+   (try\n+     (println (str \"starting mock google on :\" google-port))\n+     (reset! !google (oauth/start-mock-google google-port\n+                                              :google-users [\"google-user-alice\"\n+                                                             \"google-user-bob\"\n+                                                             \"google-user-carol\"]))\n+\n+     (println (str \"starting server on :\" slug-port))\n+     (reset! !server (common/start-server server-bin server-env))\n+     (assert! (common/wait-for-server base-url 10000) \"server responds to /healthz\")\n+\n+     (println \"\\nregistering alice, bob, carol…\")\n+     (let [alice-token (register-user! base-url\n+                                       \"00000000-0000-0000-0000-000000000001:test:local/dev\"\n+                                       \"alice\")\n+           bob-token   (register-user! base-url\n+                                       \"00000000-0000-0000-0000-000000000002:test:local/dev\"\n+                                       \"bob\")\n+           carol-token (register-user! base-url\n+                                       \"00000000-0000-0000-0000-000000000003:test:local/dev\"\n+                                       \"carol\")\n+\n+           ;; Alice creates two private rooms\n+           _ (println \"\\nalice creates two rooms…\")\n+           room-id-1 (-> (rpc-batch! base-url alice-token [{\"RoomCreate\" {\"slug\" \"alice-room-one\"}}])\n+                         (get-in [:parsed \"results\" 0 \"result\" \"RoomCreated\" \"room_id\"]))\n+           _ (assert! (some? room-id-1) \"alice room-one created\")\n+           room-id-2 (-> (rpc-batch! base-url alice-token [{\"RoomCreate\" {\"slug\" \"alice-room-two\"}}])\n+                         (get-in [:parsed \"results\" 0 \"result\" \"RoomCreated\" \"room_id\"]))\n+           _ (assert! (some? room-id-2) \"alice room-two created\")\n+\n+           ;; Carol creates her own room\n+           _ (println \"carol creates her own room…\")\n+           carol-room (-> (rpc-batch! base-url carol-token [{\"RoomCreate\" {\"slug\" \"carol-room\"}}])\n+                          (get-in [:parsed \"results\" 0 \"result\" \"RoomCreated\" \"room_id\"]))\n+           _ (assert! (some? carol-room) \"carol room created\")]\n+\n+       ;; --- isolation: alice only sees her rooms, not carol's ---\n+       (println \"\\nalice sees her 2 rooms but not carol's…\")\n+       (let [rooms (-> (rpc-batch! base-url alice-token [\"RoomList\"])\n+                       (get-in [:parsed \"results\" 0 \"result\" \"RoomList\" \"rooms\"])\n+                       set)]\n+         (assert! (= #{room-id-1 room-id-2} rooms)\n+                  \"alice sees exactly her 2 rooms\")\n+         (assert! (not (contains? rooms carol-room))\n+                  \"alice does NOT see carol's room\"))\n+\n+       ;; --- isolation: carol only sees her room, not alice's ---\n+       (println \"carol sees only her room…\")\n+       (let [rooms (-> (rpc-batch! base-url carol-token [\"RoomList\"])\n+                       (get-in [:parsed \"results\" 0 \"result\" \"RoomList\" \"rooms\"])\n+                       set)]\n+         (assert! (= #{carol-room} rooms)\n+                  \"carol sees exactly her own room\")\n+         (assert! (not (contains? rooms room-id-1))\n+                  \"carol does NOT see alice's room-one\")\n+         (assert! (not (contains? rooms room-id-2))\n+                  \"carol does NOT see alice's room-two\"))\n+\n+       ;; --- bob sees nothing yet: alice has 3 rooms total but bob is in none ---\n+       (println \"bob (no grants) sees no rooms despite 3 existing…\")\n+       (let [rooms (-> (rpc-batch! base-url bob-token [\"RoomList\"])\n+                       (get-in [:parsed \"results\" 0 \"result\" \"RoomList\" \"rooms\"]))]\n+         (assert! (zero? (count rooms))\n+                  \"bob sees 0 rooms even though 3 exist in the system\"))\n+\n+       ;; --- partial grant: alice grants bob room-one only ---\n+       (println \"\\nalice grants bob view on room-one only…\")\n+       (assert! (rpc-line-ok? (:parsed (rpc-batch! base-url alice-token\n+                                                   [{\"RoomGrant\" {\"room\" room-id-1\n+                                                                  \"username\" \"bob\"\n+                                                                  \"capabilities\" [\"view\"]}}])))\n+                \"grant ok\")\n+\n+       ;; bob sees room-one but NOT room-two or carol's room\n+       (println \"bob sees room-one but not room-two or carol's room…\")\n+       (let [rooms (-> (rpc-batch! base-url bob-token [\"RoomList\"])\n+                       (get-in [:parsed \"results\" 0 \"result\" \"RoomList\" \"rooms\"])\n+                       set)]\n+         (assert! (= #{room-id-1} rooms)\n+                  \"bob sees exactly room-one\")\n+         (assert! (not (contains? rooms room-id-2))\n+                  \"bob does NOT see alice's room-two (not granted)\")\n+         (assert! (not (contains? rooms carol-room))\n+                  \"bob does NOT see carol's room (not granted)\"))\n+\n+       ;; alice's view is unchanged\n+       (println \"alice's view unchanged after granting bob…\")\n+       (let [rooms (-> (rpc-batch! base-url alice-token [\"RoomList\"])\n+                       (get-in [:parsed \"results\" 0 \"result\" \"RoomList\" \"rooms\"])\n+                       set)]\n+         (assert! (= #{room-id-1 room-id-2} rooms)\n+                  \"alice still sees exactly her 2 rooms after granting bob\")))\n+\n+     (finally\n+       (when-some [s @!server] (common/kill-server s))\n+       (when-some [g @!google] ((:stop-fn g)))\n+       (fs/delete-tree tmp-dir)))\n+\n+   (bind {pass :pass fail :fail} @counts)\n+   (if (zero? fail)\n+     (println (str \"\\n\" common/ansi-green \"━━━ \" pass \" room list checks passed ━━━\" common/ansi-reset \"\\n\"))\n+     (do (println (str \"\\n\" common/ansi-red \"━━━ \" fail \" room list checks FAILED ━━━\" common/ansi-reset \"\\n\"))\n+         (System/exit 1)))))\ndiff --git a/test/runner.clj b/test/runner.clj\nindex b5c5f1f839d51487e4dee00952c2339b586b7a97..365372a7d11ab7968aa981f9b246543e25decfea 100644\n--- a/test/runner.clj\n+++ b/test/runner.clj\n@@ -4,13 +4,15 @@\n             [test.auth :as auth]\n             [test.grants :as grants]\n             [test.invites :as invites]\n+            [test.room-list :as room-list]\n             [test.browser-sse :as browser-sse]))\n \n (defn run-core! []\n   (integration/integration)\n   (auth/auth-test)\n   (grants/grants-test)\n-  (invites/invites-test))\n+  (invites/invites-test)\n+  (room-list/room-list-test))\n \n (defn -main [& args]\n   (if (= [\"browser-sse\"] (vec args))\ndiff --git a/types/src/lib.rs b/types/src/lib.rs\nindex bb8586f1734f77d95598a9294bdb0de2d55bf715..341fff7be7f9b28abc79c738d84804f743ce5657 100644\n--- a/types/src/lib.rs\n+++ b/types/src/lib.rs\n@@ -260,6 +260,11 @@ pub struct RoomAuditResponse {\n     pub grants: Vec<RoomAuditEntry>,\n }\n \n+#[derive(Debug, Serialize, Deserialize)]\n+pub struct RoomListResponse {\n+    pub rooms: Vec<String>,\n+}\n+\n #[derive(Debug, Serialize, Deserialize)]\n #[serde(transparent)]\n pub struct RpcBatch(pub Vec<RpcCommand>);\n@@ -342,6 +347,8 @@ pub enum RpcCommand {\n     RoomAudit {\n         room: String,\n     },\n+    /// List rooms the authenticated principal has access to.\n+    RoomList,\n     GetGlobalRank {\n         room: String,\n         #[serde(default)]\n@@ -419,6 +426,7 @@ pub enum RpcResult {\n         max_uses: usize,\n     },\n     RoomAudit(RoomAuditResponse),\n+    RoomList(RoomListResponse),\n     GrantOk {},\n     GlobalRank(GlobalRankResponse),\n     Pair(PairResponse),\n","role":"user"}],"model":"~x-ai/grok-latest"}