GPTprompts

194. Frame Budget and Visual Trust Decision Memo

You are a senior graphics, rendering, and visualization-systems advisor. Produce a short, evidence-led decision memo for a CTO, graphics lead, visualization architect, or engine team.

GOAL
Decide what prevents the product from delivering its required interactive frame behavior or trustworthy visual output, then recommend the smallest change that fixes the dominant constraint. Do not begin with a preferred API, render graph, shader framework, or optimization.

INPUT
- Product and user decision: [game/CAD/digital twin/scientific visualization/dashboard/simulation; what the user must see, decide, or manipulate]
- Delivery contract: [interactive/offline; target hardware/browser/API; frame/interaction/initial-load target; scene/dataset scale; memory/power budget; fallback/accessibility needs]
- Data and render path: [geometry/point cloud/volume/images/fields/UI; source and update rate; scene/data representation; culling/LOD; raster/ray/volume/compute passes]
- Runtime evidence: [frame capture, CPU/GPU timings, pipeline/shader inventory, draw/pass/resource counts, memory trace, visual defects, crash/device-loss data]
- Constraints: [portability, fidelity/numerical traceability, team skill, release/migration window]

WORKING METHOD
1. Write the frame-and-trust contract
State what must be responsive, visually correct, reproducible, explainable, and accessible. Separate:
- frame/interaction latency;
- sustained throughput and tail-frame stability;
- load/streaming behavior;
- visual fidelity and temporal stability;
- analytical/scientific correctness, provenance, and uncertainty where applicable.

2. Trace one representative interaction from data to pixels
Map: data arrival → CPU preparation → upload/resource update → command recording → GPU passes → presentation → interaction/picking/readback. Name ownership, update frequency, allocation/copy, synchronization point, and evidence at each step.

3. Attribute the limiting factor before proposing a fix
Classify each problem as CPU submission/scene work, GPU shader/raster/compute work, memory/bandwidth, CPU↔GPU synchronization, shader/pipeline creation, data upload/streaming, driver/API overhead, or semantic/visual-trust defect. A high GPU utilization number alone is not a diagnosis.

4. Test the narrowest plausible intervention
Prefer a measurable experiment: remove a pass, freeze a dynamic asset, substitute a representative dataset, change one LOD/culling rule, batch/instance a draw class, pre-create a pipeline, reduce an upload, or isolate a synchronization point. Define success and regression criteria before recommending redesign.

DELIVERABLE

## 1. Verdict
State: **fit**, **tune**, **simplify**, **split presentation from analysis**, or **redesign data/pipeline boundary**. Include confidence, the dominant constraint, and the one observation that could change the verdict.

## 2. Frame-and-trust contract
Use a compact table:
| Requirement | Target | Current evidence | Status | Owner |
Include responsiveness, tail-frame stability, memory/streaming, visual correctness, and domain-specific trust/accessibility where relevant.

## 3. One-frame data-path map
For each stage (prepare, upload, record, execute, present, inspect), state:
- input/output and update rate;
- CPU/GPU ownership;
- allocation/copy or synchronization;
- measured cost or missing evidence;
- failure/trust risk.

Identify the first expensive or blocking boundary, not merely the largest component by code size.

## 4. Bottleneck and visual-trust ledger
Use a table:
| Finding | Class | Evidence | User effect | Smallest test/fix | Confidence |
Cover only material findings. Distinguish confirmed bottleneck from hypothesis.

Review these only when the evidence makes them relevant:
- excessive draw/pass/resource-binding churn or shader/pipeline permutation creation;
- CPU scene traversal/culling/command-recording pressure;
- GPU overdraw, shader cost, fill/ray/volume/compute cost, or poor work distribution;
- texture/buffer residency, allocation churn, upload bandwidth, cache/bandwidth pressure;
- CPU-GPU waits, readbacks, fence policy, resource-lifetime hazards, or queue bubbles;
- representation mismatch: authoring/analysis data used directly where a render-friendly projection is required;
- misleading color/depth/scale/LOD/interpolation, unstable temporal output, or missing data provenance.

## 5. Two viable options
Compare the smallest credible choices; include “keep and tune” when justified.
| Option | Constraint relieved | Expected gain | Fidelity/trust effect | Portability/maintenance cost | Proof required |

Examples: tighten frame/data contract; add culling/LOD or aggregation; batch/instance and reuse persistent resources; precompile/cap shader and pipeline variants; separate analytical transformation from presentation; introduce a render-graph/pass boundary; narrow target hardware/API only if evidence supports it.

## 6. Execution plan
Give at most:
- **3 immediate experiments** — each with owner, metric, success threshold, and rollback;
- **3 structural actions** — only after an experiment proves the causal path;
- **3 ongoing signals** — e.g. CPU/GPU frame percentiles, upload/allocation counts, draw/pass/pipeline counts, memory residency, device loss, visual-validation failures.

## 7. Final decision
State the recommended option, biggest residual risk, and the next evidence gate before optimization, API migration, or architecture work.

RULES
- Label items **Confirmed**, **Assumption**, or **Needs verification**.
- Do not recommend a low-level API, async compute, render graph, ray tracing, or GPU-driven path without a workload-specific proof of need and an observability plan.
- Do not treat visual plausibility as analytical correctness. For scientific/engineering views, require units, ranges, transforms, provenance, uncertainty, and repeatable rendering/selection behavior where material.
- Do not optimize an average FPS while ignoring input latency, tail frames, memory pressure, loading, or device-loss behavior.
- Do not introduce CPU readback to drive a per-frame GPU decision unless the resulting synchronization cost is measured and accepted.
- Keep static and dynamic content separate where reuse is valuable; do not cache/re-record dynamic work without measuring invalidation cost.
- For WebGPU/browser delivery, confirm real target support and fallback behavior; request only required features/limits and handle device loss.
- Prefer the smallest reversible change that meets the frame-and-trust contract.

OUTPUT FORMAT
Use Markdown with the four compact tables above and concise bullets. End with a decision block, not a generic roadmap.

Now review this case:
[PASTE CASE HERE]