Each row expands the stages above it. Segment widths show their share of the parent time; colours distinguish branches and depth.
Packet work160.10s
Prepare packet0.17s
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 refresh159.52s
Prepare pinned engine0.32s
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.07s
Retire previous worker0.00s
Remove previous engine snapshot0.00s
Write worker request0.02s
Model initialization11.69s
Other worker startup0.02s
Other worker preparation0.00s
Compute KPIs and artifacts158.69s
Select sentences0.06s
Measure new patterns2.80s
Check whether these sentences were already counted0.00s
Parse uncached sentences2.60s
Colouring and hypertrie140.55s
Prepare corpus input0.00s
Load Simplify modules0.23s
Set up sentence replay0.00s
Replay corpus sentences132.36s
Simplify131.44s
Coreference6.24s
Preprocess coreference6.24s
Preprocess and lineage0.13s
Preprocess layout and lineage0.13s
Tree++ and rule processing27.95s
Prime parser and build forests2.70s
A · Expand input0.01s
A · Build document packets0.00s
B · Apply rules / normalize25.11s
C · Join output surfaces0.00s
D · Build annotation cache0.13s
Build and emit output69.07s
Render simplified text0.01s
Build output annotations and Tree++ structure · after first: median 64–128 ms, p95 256–512 ms · slowest sentence #1: 1,869 ms (31 words, 178 characters) · relational-together-apart:L2069.06s
Produce semantic payload · after first: median 64–128 ms, p95 256–512 ms · slowest sentence #1: 1,788 ms (31 words, 178 characters) · relational-together-apart:L2056.62s
Legacy annotation assembly9.31s
Build WordNet profile0.22s
Apply authored-marker overlay0.05s
Build document units6.40s
Run final annotation passes2.61s
Other legacy annotation work0.03s
Other semantic production47.31s
Build typed document1.45s
Post-assembly10.95s
Complete annotation envelope0.01s
Other annotation work0.04s
Other / not yet broken down28.06s
Convert annotations to JSON0.73s
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.26s
Prepare Hypertrie input0.69s
Hypertrie6.21s
Parse output clauses1.24s
Build trees and slices1.68s
Finish Rust aggregation1.07s
Compact and write indexes1.36s
Worker overhead outside measured trie work0.84s
Setup before trie work0.10s
Worker dispatch / wrapper overhead0.75s
Validate Hypertrie output0.00s
Publish graph artifacts0.04s
Check rule ownership0.75s
Unattributed coverage time0.00s
Measure rule activity0.00s
Update shape ledger0.00s
Measure rule-message context2.75s
Load enabled-rule inventory2.75s
Inspect rule-work queues0.00s
Compare full-corpus progress0.00s
Compare ready-to-test rules0.00s
Other KPI work12.54s
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.25s (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.