Each row expands the stages above it. Segment widths show their share of the parent time; colours distinguish branches and depth.
Packet work137.33s
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 refresh136.40s
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 initialization0.00s
Other worker preparation0.02s
Compute KPIs and artifacts135.68s
Select sentences0.06s
Measure new patterns2.85s
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.61s
Colouring and hypertrie129.76s
Prepare corpus input0.00s
Load Simplify modules0.00s
Set up sentence replay0.00s
Replay corpus sentences110.04s
Simplify109.24s
Coreference2.82s
Preprocess coreference2.82s
Preprocess and lineage0.14s
Preprocess layout and lineage0.14s
Tree++ and rule processing22.95s
Prime parser and build forests2.47s
A · Expand input0.01s
A · Build document packets0.00s
B · Apply rules / normalize20.32s
C · Join output surfaces0.00s
D · Build annotation cache0.15s
Build and emit output57.76s
Render simplified text0.01s
Build output annotations and Tree++ structure · after first: median 64–128 ms, p95 256–512 ms · slowest sentence #260: 3,197 ms (15 words, 84 characters) · five-minute-mysteries-pd-2026:L491857.75s
Produce semantic payload · after first: median 64–128 ms, p95 128–256 ms · slowest sentence #260: 3,183 ms (15 words, 84 characters) · five-minute-mysteries-pd-2026:L491848.51s
Legacy annotation assembly13.57s
Build WordNet profile0.20s
Apply authored-marker overlay0.05s
Build document units10.53s
Run final annotation passes2.75s
Other legacy annotation work0.04s
Other semantic production34.94s
Build typed document1.03s
Post-assembly8.20s
Complete annotation envelope0.01s
Other / not yet broken down25.57s
Convert annotations to JSON0.63s
Visualizer bookkeeping0.03s
Count closed words0.02s
Attribute rule activity0.00s
Merge clauses and relations0.00s
Build output clauses0.00s
Other sentence replay work0.14s
Prepare replay output0.00s
Write annotations0.26s
Prepare Hypertrie input3.07s
Hypertrie14.48s
Parse output clauses1.23s
Build trees and slices3.29s
Finish Rust aggregation3.00s
Compact and write indexes3.96s
Worker overhead outside measured trie work2.99s
Setup before trie work0.08s
Worker dispatch / wrapper overhead2.91s
Validate Hypertrie output0.00s
Publish graph artifacts0.06s
Check rule ownership1.85s
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 work2.98s
Publish latest KPI and manifest0.56s
Check KPI output is complete0.03s
Validate Hypertrie index0.06s
Audit rule ownership0.00s
Confirm engine stayed consistent0.01s
Write run manifest0.36s
Publish verified files · host I/O pressure during publish: some 0.000s, full 0.000s0.08s
First parse call: 0.08s; 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.09s (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.