Each row expands the stages above it. Segment widths show their share of the parent time; colours distinguish branches and depth.
Packet work148.70s
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.02s
KPI refresh148.11s
Prepare pinned engine0.31s
Create detached engine worktree0.01s
Check out required engine files0.29s
Link runtime data0.01s
Other snapshot preparation0.01s
Prepare worker0.11s
Identify engine and runtime0.06s
Retire previous worker0.00s
Remove previous engine snapshot0.00s
Write worker request0.02s
Model initialization11.59s
Other worker startup0.15s
Other worker preparation0.00s
Compute KPIs and artifacts147.30s
Select sentences0.07s
Measure new patterns2.81s
Check whether these sentences were already counted0.00s
Parse uncached sentences2.61s
Colouring and hypertrie129.06s
Prepare corpus input0.00s
Load Simplify modules0.47s
Set up sentence replay0.00s
Replay corpus sentences120.88s
Simplify119.47s
Coreference6.38s
Preprocess coreference6.38s
Preprocess and lineage0.13s
Preprocess layout and lineage0.13s
Tree++ and rule processing28.84s
Prime parser and build forests2.61s
A · Expand input0.01s
A · Build document packets0.00s
B · Apply rules / normalize26.09s
C · Join output surfaces0.00s
D · Build annotation cache0.13s
Build and emit output59.86s
Render simplified text0.01s
Build output annotations and Tree++ structure · after first: median 64–128 ms, p95 256–512 ms · slowest sentence #1: 1,900 ms (31 words, 178 characters) · relational-together-apart:L2059.85s
Produce semantic payload · after first: median 64–128 ms, p95 128–256 ms · slowest sentence #1: 1,813 ms (31 words, 178 characters) · relational-together-apart:L2048.89s
Legacy annotation assembly12.28s
Build WordNet profile0.23s
Apply authored-marker overlay0.06s
Build document units8.93s
Run final annotation passes3.02s
Other legacy annotation work0.04s
Other semantic production36.61s
Build typed document1.70s
Post-assembly9.22s
Complete annotation envelope0.01s
Other annotation work0.04s
Other / not yet broken down24.25s
Convert annotations to JSON1.24s
Visualizer bookkeeping0.04s
Count closed words0.02s
Attribute rule activity0.00s
Merge clauses and relations0.00s
Build output clauses0.01s
Other sentence replay work0.14s
Prepare replay output0.00s
Write annotations0.27s
Prepare Hypertrie input0.67s
Hypertrie6.04s
Parse output clauses1.22s
Build trees and slices1.63s
Finish Rust aggregation1.06s
Compact and write indexes1.28s
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.69s
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 work12.72s
Publish latest KPI and manifest0.35s
Check KPI output is complete0.03s
Validate Hypertrie index0.05s
Audit rule ownership0.00s
Confirm engine stayed consistent0.01s
Write run manifest0.17s
Publish verified files · host I/O pressure during publish: some 0.000s, full 0.000s0.08s
SpaCy parser timer: 2.18s (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.