Each row expands the stages above it. Segment widths show their share of the parent time; colours distinguish branches and depth.
Packet work236.45s
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.03s
KPI refresh235.81s
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.07s
Retire previous worker0.00s
Remove previous engine snapshot0.00s
Write worker request0.02s
Model initialization11.46s
Other worker startup0.02s
Other worker preparation0.00s
Compute KPIs and artifacts233.15s
Select sentences0.06s
Measure new patterns2.80s
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.59s
Colouring and hypertrie217.62s
Prepare corpus input0.00s
Load Simplify modules0.45s
Set up sentence replay0.00s
Replay corpus sentences134.95s
Simplify133.34s
Coreference6.52s
Preprocess coreference6.52s
Preprocess and lineage0.15s
Preprocess layout and lineage0.15s
Tree++ and rule processing29.62s
Prime parser and build forests2.82s
A · Expand input0.01s
A · Build document packets0.00s
B · Apply rules / normalize26.63s
C · Join output surfaces0.00s
D · Build annotation cache0.16s
Build and emit output68.50s
Render simplified text0.01s
Build output annotations and Tree++ structure · after first: median 64–128 ms, p95 256–512 ms · slowest sentence #9: 1,470 ms (6 words, 39 characters) · love-of-convenience:L25068.49s
Produce semantic payload · after first: median 64–128 ms, p95 256–512 ms · slowest sentence #9: 1,455 ms (6 words, 39 characters) · love-of-convenience:L25057.84s
Legacy annotation assembly13.26s
Build WordNet profile0.24s
Apply authored-marker overlay0.06s
Build document units9.45s
Run final annotation passes3.46s
Other legacy annotation work0.04s
Other semantic production44.58s
Build typed document1.25s
Post-assembly9.36s
Complete annotation envelope0.01s
Other annotation work0.04s
Other / not yet broken down28.56s
Convert annotations to JSON1.44s
Visualizer bookkeeping0.04s
Count closed words0.03s
Attribute rule activity0.00s
Merge clauses and relations0.00s
Build output clauses0.01s
Other sentence replay work0.13s
Prepare replay output0.00s
Write annotations0.28s
Prepare Hypertrie input0.74s
Hypertrie80.93s
Parse output clauses1.39s
Build trees and slices22.01s
Finish Rust aggregation24.17s
Compact and write indexes32.19s
Other hypertrie work0.01s
Worker overhead outside measured trie work1.16s
Setup before trie work0.10s
Worker dispatch / wrapper overhead1.05s
Validate Hypertrie output0.01s
Publish graph artifacts0.24s
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 work12.67s
Publish latest KPI and manifest2.50s
Check KPI output is complete0.03s
Validate Hypertrie index0.14s
Audit rule ownership0.00s
Confirm engine stayed consistent0.01s
Write run manifest2.17s
Publish verified files · host I/O pressure during publish: some 0.000s, full 0.000s0.13s
First parse call: 4.54s; 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.37s (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.