M0: compilable skeleton — Kigi 0.1.0 fork surgery

Hard fork of xai-org/grok-build (Apache-2.0) re-targeted as Kigi, an unofficial Kimi Code CLI community build. Rename & identity - 72 xai-*/xai-grok-* crates -> kigi-* (explicit: xai-grok-pager-bin -> kigi-bin [binary `kigi`], xai-grok-pager -> kigi-tui; rest mechanical); ptyctl, ptyctl-cli, third_party/ unchanged; proto package xai.grok.tools.v1 -> kigi.tools.v1 - Config home ~/.kigi (KIGI_SHARE_DIR override), env prefix GROK_* -> KIGI_*, `kigi --version` carries the unofficial-community-build notice - clap identity, help text, startup banner, prompt templates rebranded (templates re-encrypted) Deletions (PRD removal list #5/#6/#7/#9/#10) - voice input (xai-grok-voice) and all TUI wiring - telemetry: Mixpanel client, external OTel stream, Sentry, OTLP layers, trace/GCS/S3 upload queues (kigi-file-utils halved), workspace upload module & dc_log, heap-profile uploader, auth-diagnostics uploader, session-analytics halves of feedback; local zero-egress observability preserved in new kigi-log crate (unified log, --debug firehose, subsystem file logs, opt-in instrumentation) - announcements (crate, remote-settings fields, TUI surfaces) - plugin marketplace (crate, sources/browse/CTA/extensions-modal tab); direct plugin install/uninstall/update via kigi-agent git_install kept - relay/gateway/assets endpoints and features (agent relay, headless relay transport, gateway bridge, LeaderEnvUrls); leader IPC socket now ~/.kigi/leader.sock + KIGI_LEADER_SOCKET, no ws-url derivation - functional types rehomed instead of deleted: PermissionMode -> kigi-config-types, McpInitStrategy -> kigi-mcp, PrCreationSource -> session signals, TerminalDiagnostics -> kigi-pager-render, agent_id -> shell util Endpoints - kigi-env rewritten: single production KigiEndpoints {coding_api_base_url https://api.kimi.com/coding/v1 (KIGI_CODE_BASE_URL), oauth_host https://auth.kimi.com (KIGI_OAUTH_HOST), update_base_url (GitHub Releases API), upgrade_page_url}; GrokBuildEnvironment enum deleted Toolchain & workspace hygiene - Rust 1.97.0 pinned; edition 2024; full cargo update; git2 hoisted to workspace at 0.21 (Option->Result API migration), quick-xml 0.41 - Root Cargo.toml hand-maintained (PRD §8.1): version 0.1.0 inherited by all members, members sorted, unused deps pruned - cargo-deny advisories gate (deny.toml with documented transitive exceptions); CI workflow (check/clippy/fmt/deny/test, macOS+Linux) - cross-crate test seams re-gated behind `test-support` cargo feature; insta snapshot baselines renamed to the kigi_tui prefix - clippy --workspace --all-targets: zero warnings; fmt clean Fixes surfaced by the port - updater probe/installer divergence (bin/kigi vs bin/grok symlink set) - idle model-metadata refresh dead under KIGI_CODE_BASE_URL override (new is_effective_coding_endpoint_url, loopback+override aware) - macOS symlinked-TMPDIR fixture canonicalization (foreign_sessions, fast-worktree); RSS measurement tests serialized via serial_test Docs & legal (Apache §4) - NOTICE added (upstream attribution + change statement); THIRD-PARTY notices sustained; kigi-tools ported-code notices extended; README, CONTRIBUTING, SECURITY, AGENTS.md rewritten Out of scope for M0 (tracked): Kimi auth/inference (M1), search/fetch, command parity, config import (M2), Computer Hub excision & final brand-token sweep (M2), distribution & self-update rewrite (M3).
2026-07-17 05:31:01 -04:00
commit d6c20fc13f
2612 changed files with 1353757 additions and 0 deletions
@@ -0,0 +1,99 @@
+use crate::{GraphConfig, GraphEdge, GraphNode};
+use graphlib_rust::{Edge, Graph};
+use ordered_hashmap::OrderedHashMap;
+
+/*
+ * Initializes ranks for the input graph using the longest path algorithm. This
+ * algorithm scales well and is fast in practice, it yields rather poor
+ * solutions. Nodes are pushed to the lowest layer possible, leaving the bottom
+ * ranks wide and leaving edges longer than necessary. However, due to its
+ * speed, this algorithm is good for getting an initial ranking that can be fed
+ * into other algorithms.
+ *
+ * This algorithm does not normalize layers because it will be used by other
+ * algorithms in most cases. If using this algorithm directly, be sure to
+ * run normalize at the end.
+ *
+ * Pre-conditions:
+ *
+ *    1. Input graph is a DAG.
+ *    2. Input graph node labels can be assigned properties.
+ *
+ * Post-conditions:
+ *
+ *    1. Each node will be assign an (unnormalized) "rank" property.
+ */
+
+pub fn longest_path(g: &mut Graph<GraphConfig, GraphNode, GraphEdge>) {
+    let mut visited: OrderedHashMap<String, bool> = OrderedHashMap::new();
+
+    fn dfs(
+        v: &String,
+        g: &mut Graph<GraphConfig, GraphNode, GraphEdge>,
+        visited: &mut OrderedHashMap<String, bool>,
+    ) -> i32 {
+        let node_label = g.node(v);
+        if visited.contains_key(v) {
+            return node_label
+                .cloned()
+                .unwrap_or(GraphNode::default())
+                .rank
+                .unwrap_or(0);
+        }
+        visited.insert(v.clone(), true);
+
+        let ranks: Vec<i32> = g
+            .out_edges(v, None)
+            .unwrap_or(vec![])
+            .iter()
+            .map(|e| {
+                dfs(&e.w, g, visited)
+                    - (g.edge_with_obj(&e)
+                        .cloned()
+                        .unwrap_or(GraphEdge::default())
+                        .minlen
+                        .unwrap_or(0.0)
+                        .round() as i32)
+            })
+            .collect();
+        let rank: i32 = ranks.iter().min().cloned().unwrap_or(0) as i32;
+        {
+            let _node_label = g.node_mut(v);
+            if let Some(node_label) = _node_label {
+                node_label.rank = Some(rank.clone());
+            }
+        }
+        return rank;
+    }
+
+    for node_id in g.sources().into_iter() {
+        dfs(&node_id, g, &mut visited);
+    }
+}
+
+/*
+ * Returns the amount of slack for the given edge. The slack is defined as the
+ * difference between the length of the edge and its minimum length.
+ */
+pub fn slack(g: &Graph<GraphConfig, GraphNode, GraphEdge>, e: &Edge) -> i32 {
+    let w_rank = g
+        .node(&e.w)
+        .cloned()
+        .unwrap_or(GraphNode::default())
+        .rank
+        .unwrap_or(0);
+    let v_rank = g
+        .node(&e.v)
+        .cloned()
+        .unwrap_or(GraphNode::default())
+        .rank
+        .unwrap_or(0);
+    let minlen = g
+        .edge_with_obj(e)
+        .cloned()
+        .unwrap_or(GraphEdge::default())
+        .minlen
+        .unwrap_or(10.0)
+        .round() as i32;
+    return w_rank - v_rank - minlen;
+}