domain-scheduling-engine-rules

Deterministic scheduling logic requires pure functions where identical inputs always yield identical outputs. You must ensure all functions in the scheduling engine are stateless with no external dependencies to maintain reproducibility and prevent silent decay of memorized content.

A trust clamp algorithm prevents scheduling drift by enforcing strict invariants. It ensures the algorithm can only pull a page forward, never lets it drift past the cycle, and never marks a memorized page as done, maintaining the integrity and honesty of the scheduling process.

Updating track and phase transitions safely requires checking specific rules and invariants governing the scheduling engine. You must verify that modifications to the scheduling logic, transitions, and engine output adhere to purity and determinism principles to preserve integrity.

Pure functions in a scheduling engine cannot rely on external state or dependencies, limiting their ability to directly mutate application state. They are restricted to deterministic calculations where identical inputs must produce identical outputs, requiring state management to happen externally.

You need to review code for scheduling engine determinism whenever modifying the engine package or any logic touching scheduling math, track/phase transitions, or engine output. This review ensures adherence to required principles and prevents silent decay of memorized content.