Each row expands the stages above it. Segment widths show their share of the parent time; colours distinguish branches and depth.
Packet work198.18s
Prepare packet0.19s
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.05s
Check static-page renderer0.03s
Choose packet / resume position0.02s
Other preparation0.03s
KPI refresh196.89s
Prepare pinned engine0.01s
Check out required engine files0.00s
Link runtime data0.00s
Other snapshot preparation0.01s
Prepare worker0.12s
Identify engine and runtime0.07s
Retire previous worker0.00s
Remove previous engine snapshot0.00s
Write worker request0.02s
Model initialization0.00s
Other worker preparation0.02s
Compute KPIs and artifacts195.10s
Select sentences0.05s
Measure new patterns3.10s
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.83s
Colouring and hypertrie186.18s
Prepare corpus input0.00s
Load Simplify modules0.00s
Set up sentence replay0.00s
Replay corpus sentences128.67s
Simplify121.71s
Coreference2.88s
Preprocess coreference2.88s
Preprocess and lineage0.11s
Preprocess layout and lineage0.11s
Tree++ and rule processing27.01s
Prime parser and build forests2.79s
A · Expand input0.01s
A · Build document packets0.00s
B · Apply rules / normalize24.06s
C · Join output surfaces0.00s
D · Build annotation cache0.15s
Build and emit output65.82s
Render simplified text0.01s
Build output annotations and Tree++ structure · after first: median 64–128 ms, p95 256–512 ms · slowest sentence #355: 579 ms (33 words, 172 characters) · 1001-stories-cc0-2026:L26465.82s
Produce semantic payload · after first: median 64–128 ms, p95 256–512 ms · slowest sentence #355: 535 ms (33 words, 172 characters) · 1001-stories-cc0-2026:L26456.46s
Legacy annotation assembly7.77s
Build WordNet profile0.16s
Apply authored-marker overlay0.03s
Build document units5.59s
Run final annotation passes1.96s
Other legacy annotation work0.03s
Other semantic production48.69s
Build typed document0.94s
Post-assembly8.40s
Complete annotation envelope0.01s
Other / not yet broken down25.89s
Convert annotations to JSON6.77s
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.28s
Prepare Hypertrie input5.60s
Hypertrie50.93s
Parse output clauses1.37s
Build trees and slices9.76s
Finish Rust aggregation13.56s
Compact and write indexes19.59s
Other hypertrie work0.01s
Worker overhead outside measured trie work6.63s
Setup before trie work0.09s
Worker dispatch / wrapper overhead6.54s
Validate Hypertrie output0.00s
Publish graph artifacts0.14s
Check rule ownership0.54s
Unattributed coverage time0.01s
Measure rule activity0.03s
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 work5.74s
Publish latest KPI and manifest1.62s
Check KPI output is complete0.04s
Validate Hypertrie index0.10s
Audit rule ownership0.00s
Confirm engine stayed consistent0.01s
Write run manifest1.31s
Publish verified files · host I/O pressure during publish: some 0.000s, full 0.000s0.14s
First parse call: 0.11s; 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.29s (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.