Each row expands the stages above it. Segment widths show their share of the parent time; colours distinguish branches and depth.
Packet work130.10s
Prepare packet0.18s
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 refresh128.72s
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 initialization11.76s
Other worker startup0.02s
Other worker preparation0.00s
Compute KPIs and artifacts128.19s
Select sentences0.05s
Measure new patterns2.31s
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.10s
Colouring and hypertrie113.24s
Prepare corpus input0.00s
Load Simplify modules0.23s
Set up sentence replay0.00s
Replay corpus sentences106.02s
Simplify104.64s
Coreference6.15s
Preprocess coreference6.15s
Preprocess and lineage0.12s
Preprocess layout and lineage0.12s
Tree++ and rule processing19.19s
Prime parser and build forests2.97s
A · Expand input0.01s
A · Build document packets0.00s
B · Apply rules / normalize16.10s
C · Join output surfaces0.00s
D · Build annotation cache0.11s
Build and emit output62.46s
Render simplified text0.01s
Build output annotations and Tree++ structure · after first: median 64–128 ms, p95 256–512 ms · slowest sentence #2: 1,220 ms (14 words, 85 characters) · five-minute-mysteries-pd-2026:L203962.45s
Produce semantic payload · after first: median 64–128 ms, p95 256–512 ms · slowest sentence #2: 1,200 ms (14 words, 85 characters) · five-minute-mysteries-pd-2026:L203953.06s
Legacy annotation assembly7.73s
Build WordNet profile0.15s
Apply authored-marker overlay0.04s
Build document units5.77s
Run final annotation passes1.76s
Other legacy annotation work0.03s
Other semantic production45.33s
Build typed document0.94s
Post-assembly8.40s
Complete annotation envelope0.01s
Other annotation work0.04s
Other / not yet broken down16.72s
Convert annotations to JSON1.23s
Visualizer bookkeeping0.04s
Count closed words0.03s
Attribute rule activity0.00s
Merge clauses and relations0.00s
Build output clauses0.01s
Other sentence replay work0.11s
Prepare replay output0.00s
Write annotations0.24s
Prepare Hypertrie input0.66s
Hypertrie6.04s
Parse output clauses1.07s
Build trees and slices1.68s
Finish Rust aggregation1.15s
Compact and write indexes1.35s
Other hypertrie work0.01s
Worker overhead outside measured trie work0.79s
Setup before trie work0.09s
Worker dispatch / wrapper overhead0.69s
Validate Hypertrie output0.01s
Publish graph artifacts0.04s
Check rule ownership0.00s
Unattributed coverage time0.00s
Measure rule activity0.04s
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.55s
Publish latest KPI and manifest0.36s
Check KPI output is complete0.03s
Validate Hypertrie index0.05s
Audit rule ownership0.00s
Confirm engine stayed consistent0.01s
Write run manifest0.18s
Publish verified files · host I/O pressure during publish: some 0.000s, full 0.000s0.08s
First parse call: 3.69s; 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.59s (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.