Each row expands the stages above it. Segment widths show their share of the parent time; colours distinguish branches and depth.
Packet work137.91s
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 refresh137.10s
Prepare pinned engine0.01s
Check out required engine files0.00s
Link runtime data0.00s
Other snapshot preparation0.01s
Prepare worker0.10s
Identify engine and runtime0.06s
Retire previous worker0.00s
Remove previous engine snapshot0.00s
Write worker request0.02s
Model initialization0.00s
Other worker preparation0.02s
Compute KPIs and artifacts136.46s
Select sentences0.06s
Measure new patterns2.72s
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.49s
Colouring and hypertrie131.38s
Prepare corpus input0.00s
Load Simplify modules0.00s
Set up sentence replay0.00s
Replay corpus sentences116.69s
Simplify115.87s
Coreference2.88s
Preprocess coreference2.88s
Preprocess and lineage0.14s
Preprocess layout and lineage0.14s
Tree++ and rule processing26.68s
Prime parser and build forests2.51s
A · Expand input0.01s
A · Build document packets0.00s
B · Apply rules / normalize24.04s
C · Join output surfaces0.00s
D · Build annotation cache0.12s
Build and emit output61.04s
Render simplified text0.01s
Build output annotations and Tree++ structure · after first: median 64–128 ms, p95 256–512 ms · slowest sentence #182: 2,482 ms (27 words, 147 characters) · relational-together-apart:L10261.03s
Produce semantic payload · after first: median 64–128 ms, p95 128–256 ms · slowest sentence #182: 2,467 ms (27 words, 147 characters) · relational-together-apart:L10251.52s
Legacy annotation assembly10.74s
Build WordNet profile0.23s
Apply authored-marker overlay0.06s
Build document units7.40s
Run final annotation passes3.01s
Other legacy annotation work0.04s
Other semantic production40.78s
Build typed document1.11s
Post-assembly8.39s
Complete annotation envelope0.01s
Other / not yet broken down25.13s
Convert annotations to JSON0.66s
Visualizer bookkeeping0.03s
Count closed words0.02s
Attribute rule activity0.00s
Merge clauses and relations0.00s
Build output clauses0.00s
Other sentence replay work0.13s
Prepare replay output0.00s
Write annotations0.27s
Prepare Hypertrie input2.22s
Hypertrie10.88s
Parse output clauses1.27s
Build trees and slices2.70s
Finish Rust aggregation2.02s
Compact and write indexes2.59s
Other hypertrie work0.01s
Worker overhead outside measured trie work2.30s
Setup before trie work0.09s
Worker dispatch / wrapper overhead2.21s
Validate Hypertrie output0.00s
Publish graph artifacts0.05s
Check rule ownership1.25s
Unattributed coverage time0.01s
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 work2.28s
Publish latest KPI and manifest0.49s
Check KPI output is complete0.03s
Validate Hypertrie index0.06s
Audit rule ownership0.00s
Confirm engine stayed consistent0.01s
Write run manifest0.28s
Publish verified files · host I/O pressure during publish: some 0.000s, full 0.000s0.10s
First parse call: 0.21s; included in the steady rate.
Hypertrie aggregation: Rust backend · 1 disk shards
Enabled-rule inventory: reused the worker's in-memory inventory
Enabled-rule inventory parser: not used (process cache hit)
SpaCy parser timer: 2.12s (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.