{"id":51051088,"url":"https://github.com/tompassarelli/chartroom","last_synced_at":"2026-06-22T17:01:18.401Z","repository":{"id":365395061,"uuid":"1271857740","full_name":"tompassarelli/chartroom","owner":"tompassarelli","description":"Code as claims, on Fram — projects a beagle source tree into a reified claim graph and derives call graphs, scope-correct callers, and transitive leverage as queries.","archived":false,"fork":false,"pushed_at":"2026-06-17T05:52:01.000Z","size":60,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2026-06-17T07:23:47.615Z","etag":null,"topics":["babashka","beagle","call-graph","claim-graph","clojure","code-as-data","code-intelligence","datalog","graph-algorithms","knowledge-graph","metaprogramming","refactoring","static-analysis"],"latest_commit_sha":null,"homepage":"","language":"Clojure","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/tompassarelli.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2026-06-17T04:31:01.000Z","updated_at":"2026-06-17T05:52:40.000Z","dependencies_parsed_at":null,"dependency_job_id":null,"html_url":"https://github.com/tompassarelli/chartroom","commit_stats":null,"previous_names":["tompassarelli/chartroom"],"tags_count":null,"template":false,"template_full_name":null,"purl":"pkg:github/tompassarelli/chartroom","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tompassarelli%2Fchartroom","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tompassarelli%2Fchartroom/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tompassarelli%2Fchartroom/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tompassarelli%2Fchartroom/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/tompassarelli","download_url":"https://codeload.github.com/tompassarelli/chartroom/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tompassarelli%2Fchartroom/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34657902,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-22T02:00:06.391Z","response_time":106,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["babashka","beagle","call-graph","claim-graph","clojure","code-as-data","code-intelligence","datalog","graph-algorithms","knowledge-graph","metaprogramming","refactoring","static-analysis"],"created_at":"2026-06-22T17:01:16.647Z","updated_at":"2026-06-22T17:01:18.389Z","avatar_url":"https://github.com/tompassarelli.png","language":"Clojure","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Chartroom\n\n\u003e **⚠️ FOLDED INTO FRAM.** As of 2026-06-18 the canonical home of this engine is\n\u003e [`fram/chartroom`](https://github.com/tompassarelli/fram) (build target\n\u003e *\"beagle source code-intelligence, renting fram's public claim+Datalog API\"*).\n\u003e The fold was licensed by lockstep cadence + cross-repo friction relief (no\n\u003e version pin; beagle CI dropped a checkout), not by dependency-direction. The\n\u003e seam is guarded structurally in fram (`core_code_blind_test` keeps the generic\n\u003e core blind to beagle-as-subject; `chartroom_seam_test` keeps this module on\n\u003e fram's public surface). This repo is retained for history; do not edit here.\n\n**Code as claims, on [Fram](https://github.com/tompassarelli/fram).** Chartroom\nprojects a beagle source tree into the same reified claim graph that Lodestar\nuses for life and work, then *derives* code intelligence — call graphs, scope-correct caller\nresolution, transitive leverage — as queries over that graph instead of as\nbespoke passes over text.\n\nThe bet is the same one Lodestar makes, pointed at source: **a flat,\ntext-and-grep view of a codebase rots and can't compute relational questions;\nthe graph is always current and answers them for free.** The question Chartroom\nexists to settle is whether that actually buys anything over the cold-parse,\none-hop tools we already have — or not.\n\n## The pipeline\n\n```\n*.bjs ──beagle-claims──▶ CNF triples ──load──▶ Fram claim store ──Datalog──▶ leverage / callers\n  (AST as claims)         [s \"p\" o]        (interned graph)      (transitive closure)\n```\n\n1. **`beagle-claims`** (in [beagle](https://github.com/tompassarelli/beagle), `bin/beagle-claims`) reflects a\n   file's AST into newline-separated EDN claim triples `[subj \"pred\" obj]` —\n   `form-kind`, `name`, `calls`, and a uniform **`child`** containment edge.\n   It's a cross-cutting *analysis* projection, not a compile target: it claims\n   `.bjs` / `.bclj` / `.bnix` alike, ignoring each file's `#lang`.\n2. **`bin/emit-corpus`** runs that over a source tree → `build/\u003cname\u003e.claims`.\n3. **`src/chartroom.clj`** folds the triples into a Fram store, derives the\n   **namespace-correct** function call graph (a call binds the defn in its own\n   module — the scope a bare-symbol match ignores), and runs the benchmarks.\n\n## Prerequisites\n\nChartroom is the glue layer over three sibling projects; clone them next to this\nrepo (the `~/code/\u003cname\u003e` layout the commands below assume) and have\n[Babashka](https://github.com/babashka/babashka) (`bb`) on `PATH`:\n\n- **[fram](https://github.com/tompassarelli/fram)** — the claim store + Datalog\n  engine. Build its classpath dir (`fram/out`); the runner loads `-cp ~/code/fram/out`.\n- **[beagle](https://github.com/tompassarelli/beagle)** — provides `bin/beagle-claims`\n  and `bin/beagle-roundtrip` (the AST→claims projectors). `bin/*` here resolve it\n  via `$BEAGLE` (default `$HOME/code/beagle`); override if you check it out elsewhere.\n- **[gjoa](https://github.com/tompassarelli/gjoa)** — the live corpus the benchmarks\n  in RESULTS.md run against. Any beagle source tree works; gjoa is just the one measured.\n\n## Run it\n\n```sh\nbin/emit-corpus  ~/code/gjoa/src ~/code/gjoa/tools ~/code/gjoa/tests  build/gjoa.claims\nbb -cp ~/code/fram/out:src  src/chartroom.clj  build/gjoa.claims\n```\n\n## What it proves (and doesn't)\n\nSee **[RESULTS.md](RESULTS.md)** for the measured verdict. In short: on the live\ngjoa corpus the graph answers two questions the incumbent cannot — **scope-correct\ncallers** (perfect precision where bare-symbol match is 33–67% wrong) and\n**transitive blast radius** (the keystone a one-hop tool structurally can't\nsurface) — and Fram's Datalog computes the real call-graph closure correctly.\n\nTwo projections, two jobs (both derived from the same source):\n- **Query projection** (`beagle-claims`) — compact AST claims with semantic\n  overlays (`calls`/`name`/`child`). Great for leverage queries; lossy (drops\n  types/params). ~18 triples/form.\n- **Truth projection** (`beagle-roundtrip`) — verbose reader-datum claims that\n  round-trip the program **losslessly** (types survive as tokens, comments as\n  resolved references). The graph as a *source of truth*; text as a regenerable\n  view. ~238 triples/form.\n\n## Status\n\nBuilt and validated in stages: projection → leverage benchmark → lossless\nround-trip → graph-native rename → a shadow-correct lexical resolver →\nrename-correct comments. Headline gates hold at **1100/1100 forms, 97/97 files**.\nMeasured results are in **[RESULTS.md](RESULTS.md)**; the stage-by-stage build\nlog is in **[docs/build-log.md](docs/build-log.md)**.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftompassarelli%2Fchartroom","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftompassarelli%2Fchartroom","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftompassarelli%2Fchartroom/lists"}