Each row expands the stages above it. Segment widths show their share of the parent time; colours distinguish branches and depth.
Packet work277.69s
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.00s
Fingerprint previous grammar and parser0.00s
Fingerprint visualizer pipeline0.04s
Check static-page renderer0.02s
Choose packet / resume position0.02s
Other preparation0.02s
KPI refresh277.03s
Prepare pinned engine0.01s
Check out required engine files0.00s
Link runtime data0.00s
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.81s
Other worker startup0.02s
Other worker preparation0.00s
Compute KPIs and artifacts273.76s
Select sentences0.06s
Measure new patterns2.81s
Check whether these sentences were already counted0.00s
Check indexed sentence records · read 0 bytes · host I/O stall some 0 ms, full 0 ms0.00s
Open acquisition ledger0.00s
Read ledger schema0.00s
Close acquisition ledger0.00s
Parse uncached sentences2.60s
Colouring and hypertrie257.82s
Prepare corpus input0.00s
Load Simplify modules0.23s
Set up sentence replay0.00s
Replay corpus sentences142.31s
Simplify140.02s
Coreference6.38s
Preprocess coreference6.38s
Preprocess and lineage0.12s
Preprocess layout and lineage0.12s
Tree++ and rule processing31.90s
Prime parser and build forests2.64s
A · Expand input0.01s
A · Build document packets0.00s
B · Apply rules / normalize29.09s
C · Join output surfaces0.00s
D · Build annotation cache0.16s
Build and emit output76.41s
Render simplified text0.01s
Build output annotations and Tree++ structure · after first: median 64–128 ms, p95 256–512 ms · slowest sentence #424: 1,629 ms (43 words, 220 characters) · formal-finally:L22276.41s
Produce semantic payload · after first: median 64–128 ms, p95 256–512 ms · slowest sentence #424: 1,543 ms (43 words, 220 characters) · formal-finally:L22265.48s
Legacy annotation assembly9.89s
Build WordNet profile0.22s
Apply authored-marker overlay0.05s
Build document units6.99s
Run final annotation passes2.60s
Other legacy annotation work0.03s
Other semantic production55.59s
Build typed document1.02s
Post-assembly9.86s
Complete annotation envelope0.01s
Other annotation work0.04s
Other / not yet broken down25.21s
Convert annotations to JSON2.12s
Visualizer bookkeeping0.04s
Count closed words0.02s
Attribute rule activity0.00s
Merge clauses and relations0.00s
Build output clauses0.01s
Other sentence replay work0.13s
Prepare replay output0.00s
Write annotations0.29s
Prepare Hypertrie input0.75s
Hypertrie113.91s
Parse output clauses1.43s
Build trees and slices36.60s
Finish Rust aggregation34.03s
Compact and write indexes40.64s
Other hypertrie work0.01s
Worker overhead outside measured trie work1.21s
Setup before trie work0.10s
Worker dispatch / wrapper overhead1.10s
Validate Hypertrie output0.01s
Publish graph artifacts0.29s
Check rule ownership0.00s
Unattributed coverage time0.02s
Measure rule activity0.01s
Update shape ledger0.00s
Measure rule-message context0.00s
Load enabled-rule inventory0.00s
Inspect rule-work queues0.00s
Compare full-corpus progress0.00s
Compare ready-to-test rules0.00s
Other KPI work13.07s
Publish latest KPI and manifest3.11s
Check KPI output is complete0.03s
Validate Hypertrie index0.16s
Audit rule ownership0.00s
Confirm engine stayed consistent0.02s
Write run manifest2.63s
Publish verified files · host I/O pressure during publish: some 0.000s, full 0.000s0.25s
First parse call: 4.14s; excluded from the steady rate.
Hypertrie aggregation: Rust backend · 1 disk shards
Enabled-rule inventory: reused the saved inventory for this engine
Enabled-rule inventory parser: not used (disk cache hit)
SpaCy parser timer: 2.23s (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.