Each row expands the stages above it. Segment widths show their share of the parent time; colours distinguish branches and depth.
Packet work161.34s
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 refresh160.30s
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 initialization0.00s
Other worker preparation0.02s
Compute KPIs and artifacts159.06s
Select sentences0.06s
Measure new patterns2.93s
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.68s
Colouring and hypertrie152.28s
Prepare corpus input0.00s
Load Simplify modules0.00s
Set up sentence replay0.00s
Replay corpus sentences121.07s
Simplify120.22s
Coreference2.88s
Preprocess coreference2.88s
Preprocess and lineage0.08s
Preprocess layout and lineage0.08s
Tree++ and rule processing28.02s
Prime parser and build forests2.50s
A · Expand input0.01s
A · Build document packets0.00s
B · Apply rules / normalize25.34s
C · Join output surfaces0.00s
D · Build annotation cache0.17s
Build and emit output61.41s
Render simplified text0.01s
Build output annotations and Tree++ structure · after first: median 64–128 ms, p95 256–512 ms · slowest sentence #305: 3,747 ms (6 words, 30 characters) · 1001-stories-cc0-2026:L174161.41s
Produce semantic payload · after first: median 64–128 ms, p95 256–512 ms · slowest sentence #305: 3,736 ms (6 words, 30 characters) · 1001-stories-cc0-2026:L174151.80s
Legacy annotation assembly14.16s
Build WordNet profile0.22s
Apply authored-marker overlay0.05s
Build document units11.11s
Run final annotation passes2.74s
Other legacy annotation work0.04s
Other semantic production37.63s
Build typed document1.31s
Post-assembly8.29s
Complete annotation envelope0.01s
Other / not yet broken down27.83s
Convert annotations to JSON0.68s
Visualizer bookkeeping0.03s
Count closed words0.02s
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 input3.67s
Hypertrie27.13s
Parse output clauses1.35s
Build trees and slices6.70s
Finish Rust aggregation6.36s
Compact and write indexes8.93s
Other hypertrie work0.01s
Worker overhead outside measured trie work3.79s
Setup before trie work0.10s
Worker dispatch / wrapper overhead3.69s
Validate Hypertrie output0.01s
Publish graph artifacts0.10s
Check rule ownership0.00s
Unattributed coverage time0.01s
Measure rule activity0.02s
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 work3.77s
Publish latest KPI and manifest1.08s
Check KPI output is complete0.04s
Validate Hypertrie index0.08s
Audit rule ownership0.00s
Confirm engine stayed consistent0.01s
Write run manifest0.82s
Publish verified files · host I/O pressure during publish: some 0.000s, full 0.000s0.12s
First parse call: 0.52s; 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.11s (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.