constitution · epochs · watch · epoch 4

ev_0e926a940e672bfe204d0eb1d975d9562e73f101ac8308eeecb470fd83dc4e37

links

• commit_id: c_5d4f3299fa6dd70fc6719c17ac0a411f1a93bdda18866baca081f0db3eab4a6f
• epoch 4

payload

{
  "commit_id": "c_5d4f3299fa6dd70fc6719c17ac0a411f1a93bdda18866baca081f0db3eab4a6f",
  "committer_timestamp_ms": 1785696815000,
  "contributor": "tommy-mor",
  "first_sources": [
    {
      "ref_name": "refs/heads/cursor/forum-sse-page-scoped-push-a3e4",
      "repository_id": "slug"
    },
    {
      "ref_name": "refs/heads/cursor/garden-recent-votes-star-22dc",
      "repository_id": "slug"
    },
    {
      "ref_name": "refs/heads/cursor/garden-vote-post-links-4ce1",
      "repository_id": "slug"
    },
    {
      "ref_name": "refs/heads/cursor/github-issues-sort-investigate-c2a6",
      "repository_id": "slug"
    },
    {
      "ref_name": "refs/heads/main",
      "repository_id": "slug"
    }
  ],
  "message": {
    "byte_length": 1919,
    "sha256": "1de568c5305966ba4c88b669d5029406efea9deda655fd6e6f532e86a7627e8c",
    "text_preview": "Solve Rank Centrality exactly instead of capping power iteration.\n\n`compute_scores_from_edges` ran power iteration for at most 10 000 sweeps and\nreturned whatever vector it had reached, with no signal when the cap bound. On\na preference chain the spectral gap is Theta(1/n^2), so the cap binds past\nn ~= 1500 -- and worse, the L1 *step* tolerance is an absolute test, so on a\n1024-node chain with mixed ratios it declared success after 4325 sweeps while\nleaving 486 of 1024 items at the wrong rank. A 1024-node star fails outright:\nit needs 14 154 sweeps.\n\nNew `stationary` module owns every candidate solver -- power, Aitken-accelerated\npower, Gauss-Seidel/SOR, preconditioned BiCGSTAB, dense LU, dense GTH, and a\nsparse GTH state reduction with minimum-degree elimination -- behind one `solve`\nthat splits disconnected components, tries the sparse direct path first (trees\nand chains reduce in O(n) with zero fill), and falls back to Gauss-Seidel then\npower iteration on the dense graphs elimination cannot help with. Every answer\ncarries its own recomputed residual and a `converged` flag; nothing comes back\nclaiming success it did not earn.\n\nScores are also produced in log space. A chain of n items each preferred 2:1\nspans 2^(n-1), which leaves the f64 range at n ~= 1075, so `pi` genuinely cannot\norder a long chain no matter how it is computed. `Solution::log_pi` stays exact\nthere and is what `ranked_items_subset` now sorts on.\n\nEdges are sorted before aggregation, so the result no longer depends on\n`HashMap` iteration order. The legacy builder produced a different bit pattern\non 7 of 7 rebuilds of the same graph; the sort costs ~10% of chain construction.\n\nAdds `benches/stationary_solvers.rs` (~80s) and `examples/solver_probe.rs`\n(~30s), which reports time, residual, and rank displacement against closed-form\nanswers per topology. No new dependencies.\n\nCo-authored-by: Cursor <cursoragent@cursor.com>"
  },
  "oid": "sha1:0e81b5e1958ca486bffe87c800cc68e389c9a810",
  "patch": {
    "byte_length": 105575,
    "encoding": "blob",
    "sha256": "24805f3d370fbd6c1ebb1d37b1a1289acfd8c6c1ff34cbf5f34714b2089cf485"
  },
  "patch_identity": "git-patch-id-stable-v1:7204da885d64bef5dbbd69b96716316e92661676",
  "patch_sha256": "24805f3d370fbd6c1ebb1d37b1a1289acfd8c6c1ff34cbf5f34714b2089cf485",
  "summary": "sha1:0e81b5e1958ca48 tommy-mor",
  "urls": {
    "commit": "https://token.slug.social/commits/c_5d4f3299fa6dd70fc6719c17ac0a411f1a93bdda18866baca081f0db3eab4a6f",
    "epoch": "https://token.slug.social/epochs/4"
  }
}