False only when BOTH halves hold: depth sorting has GIVEN UP for this
session ('failed' — a dead worker script, or the starved retry budget
exhausted) AND something visible actually wants sorting right now
(anyNodeWantsSorting). A 'starved' init still reports available, because
a retry is armed and expected to recover.
The demand half is not cosmetic. The worker is warmed up unconditionally at
app init, so a CSP-blocked chunk latches 'failed' on a scene with NO
order-dependent geometry at all (all-additive points, an opaque mesh,
?debug with no dataset) — announcing a degrade there would report on a
subsystem that session never uses, and drag the performance panel out of its
"No timing data yet" empty state to do it. Sharing the predicate with the
retry gate is what keeps the two readings of "wants sorting" identical.
Exact contract, and it is asymmetric: a SHOWN note proves that visible,
committed, order-dependent geometry is being drawn in storage order. Its
ABSENCE proves nothing — a 'starved' init reports available for the whole
retry window while identity order is drawn, ?depthSort=0 pins identity
order and reports available by definition, and a node whose commit could not
reach a HEALTHY worker (detached buffer, throwing centers thunk) is
invisible here. getDepthSortWorkerStatus is the finer-grained read.
False only when BOTH halves hold: depth sorting has GIVEN UP for this session (
'failed'— a dead worker script, or the starved retry budget exhausted) AND something visible actually wants sorting right now (anyNodeWantsSorting). A'starved'init still reports available, because a retry is armed and expected to recover.The demand half is not cosmetic. The worker is warmed up unconditionally at app init, so a CSP-blocked chunk latches
'failed'on a scene with NO order-dependent geometry at all (all-additive points, an opaque mesh,?debugwith no dataset) — announcing a degrade there would report on a subsystem that session never uses, and drag the performance panel out of its "No timing data yet" empty state to do it. Sharing the predicate with the retry gate is what keeps the two readings of "wants sorting" identical.Exact contract, and it is asymmetric: a SHOWN note proves that visible, committed, order-dependent geometry is being drawn in storage order. Its ABSENCE proves nothing — a
'starved'init reports available for the whole retry window while identity order is drawn,?depthSort=0pins identity order and reports available by definition, and a node whose commit could not reach a HEALTHY worker (detached buffer, throwing centers thunk) is invisible here. getDepthSortWorkerStatus is the finer-grained read.