Each row expands the stages above it. Segment widths show their share of the parent time; colours distinguish branches and depth.
Packet work157.26s
Prepare packet0.18s
Resolve current engine0.00s
Fetch latest Simplify main0.00s
Resolve selected commit0.00s
Check / refresh corpus index0.00s
Read corpus identity0.04s
Resolve previous engine0.02s
Fingerprint current grammar and parser0.01s
Fingerprint previous grammar and parser0.00s
Fingerprint visualizer pipeline0.04s
Check static-page renderer0.02s
Choose packet / resume position0.02s
Other preparation0.03s
KPI refresh156.67s
Prepare pinned engine0.33s
Create detached engine worktree0.01s
Check out required engine files0.31s
Link runtime data0.01s
Other snapshot preparation0.01s
Prepare worker0.11s
Identify engine and runtime0.07s
Retire previous worker0.00s
Remove previous engine snapshot0.00s
Write worker request0.02s
Model initialization12.09s
Other worker startup0.16s
Other worker preparation0.00s
Compute KPIs and artifacts155.83s
Select sentences0.06s
Measure new patterns3.03s
Check whether these sentences were already counted0.00s
Parse uncached sentences2.82s
Colouring and hypertrie136.99s
Prepare corpus input0.00s
Load Simplify modules0.24s
Set up sentence replay0.00s
Replay corpus sentences128.88s
Simplify127.28s
Coreference6.40s
Preprocess coreference6.40s
Preprocess and lineage0.13s
Preprocess layout and lineage0.13s
Tree++ and rule processing27.60s
Prime parser and build forests2.56s
A · Expand input0.01s
A · Build document packets0.00s
B · Apply rules / normalize24.89s
C · Join output surfaces0.00s
D · Build annotation cache0.13s
Build and emit output67.00s
Render simplified text0.01s
Build output annotations and Tree++ structure · after first: median 64–128 ms, p95 256–512 ms · slowest sentence #1: 1,877 ms (31 words, 178 characters) · relational-together-apart:L2066.99s
Produce semantic payload · after first: median 64–128 ms, p95 256–512 ms · slowest sentence #1: 1,795 ms (31 words, 178 characters) · relational-together-apart:L2057.02s
Legacy annotation assembly9.12s
Build WordNet profile0.22s
Apply authored-marker overlay0.04s
Build document units6.37s
Run final annotation passes2.46s
Other legacy annotation work0.03s
Other semantic production47.90s
Build typed document1.41s
Post-assembly8.52s
Complete annotation envelope0.01s
Other annotation work0.03s
Other / not yet broken down26.16s
Convert annotations to JSON1.41s
Visualizer bookkeeping0.04s
Count closed words0.03s
Attribute rule activity0.00s
Merge clauses and relations0.00s
Build output clauses0.01s
Other sentence replay work0.15s
Prepare replay output0.00s
Write annotations0.27s
Prepare Hypertrie input0.73s
Hypertrie6.13s
Parse output clauses1.24s
Build trees and slices1.69s
Finish Rust aggregation1.03s
Compact and write indexes1.32s
Worker overhead outside measured trie work0.83s
Setup before trie work0.10s
Worker dispatch / wrapper overhead0.73s
Validate Hypertrie output0.00s
Publish graph artifacts0.04s
Check rule ownership0.71s
Unattributed coverage time0.00s
Measure rule activity0.00s
Update shape ledger0.00s
Measure rule-message context2.66s
Load enabled-rule inventory2.66s
Inspect rule-work queues0.00s
Compare full-corpus progress0.00s
Compare ready-to-test rules0.00s
Other KPI work13.10s
Publish latest KPI and manifest0.36s
Check KPI output is complete0.03s
Validate Hypertrie index0.05s
Audit rule ownership0.00s
Confirm engine stayed consistent0.01s
Write run manifest0.18s
Publish verified files · host I/O pressure during publish: some 0.000s, full 0.000s0.07s
SpaCy parser timer: 2.13s (diagnostic; overlaps the engine phases above and is not added again)
Simplify phases are summed across this packet. The listed top-level engine phases are additive; some diagnostic subtimers overlap them and are intentionally omitted. Tree++ relation-only time is not measured separately.