Each row expands the stages above it. Segment widths show their share of the parent time; colours distinguish branches and depth.
Packet work151.57s
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.04s
Check static-page renderer0.03s
Choose packet / resume position0.02s
Other preparation0.03s
KPI refresh150.65s
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 artifacts149.77s
Select sentences0.08s
Measure new patterns3.46s
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 sentences3.06s
Colouring and hypertrie143.09s
Prepare corpus input0.00s
Load Simplify modules0.00s
Set up sentence replay0.00s
Replay corpus sentences122.95s
Simplify122.06s
Coreference2.78s
Preprocess coreference2.78s
Preprocess and lineage0.15s
Preprocess layout and lineage0.15s
Tree++ and rule processing28.66s
Prime parser and build forests2.64s
A · Expand input0.01s
A · Build document packets0.00s
B · Apply rules / normalize25.88s
C · Join output surfaces0.00s
D · Build annotation cache0.12s
Build and emit output63.74s
Render simplified text0.01s
Build output annotations and Tree++ structure · after first: median 64–128 ms, p95 256–512 ms · slowest sentence #70: 727 ms (23 words, 130 characters) · 1001-stories-cc0-2026:L123563.73s
Produce semantic payload · after first: median 64–128 ms, p95 256–512 ms · slowest sentence #70: 684 ms (23 words, 130 characters) · 1001-stories-cc0-2026:L123554.22s
Legacy annotation assembly8.46s
Build WordNet profile0.19s
Apply authored-marker overlay0.04s
Build document units5.97s
Run final annotation passes2.22s
Other legacy annotation work0.03s
Other semantic production45.76s
Build typed document1.02s
Post-assembly8.48s
Complete annotation envelope0.01s
Other / not yet broken down26.74s
Convert annotations to JSON0.70s
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.27s
Prepare Hypertrie input3.21s
Hypertrie16.57s
Parse output clauses1.29s
Build trees and slices4.00s
Finish Rust aggregation3.31s
Compact and write indexes4.83s
Other hypertrie work0.01s
Worker overhead outside measured trie work3.14s
Setup before trie work0.10s
Worker dispatch / wrapper overhead3.04s
Validate Hypertrie output0.00s
Publish graph artifacts0.07s
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.11s
Publish latest KPI and manifest0.71s
Check KPI output is complete0.03s
Validate Hypertrie index0.07s
Audit rule ownership0.00s
Confirm engine stayed consistent0.01s
Write run manifest0.47s
Publish verified files · host I/O pressure during publish: some 0.000s, full 0.000s0.11s
First parse call: 0.10s; 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.16s (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.