Expand description
Rustev’s deterministic rules backend (spec 005).
A RulesBackend answers classify, proposition and rubric
requests with authored logits computed by a bounded, identified rules
program (RulesProgram, rustev.rules/1). Pointwise rank requests
return the authored score for the presented candidate (spec 039).
Its descriptor is derived
from the program, and the program’s digest is the artifact identity a
plan binds, so a changed rule, coefficient, lookup value, option mapping,
limit or cost can never answer for a plan compiled against the old
program.
Setup is explicit (spec 005, 3.11): the host reads the program bytes,
parses them with RulesProgram::parse,
builds the backend with RulesBackend::new, compiles plans against
descriptor, checks them with
RulesBackend::check_plan and registers the backend with a runtime.
Inference performs no I/O and reads no clock.
Outputs are authored heuristics over the projected inputs: not calibrated probabilities, not evidence of semantic understanding, and not independent evidence about the claims the inputs describe.
Re-exports§
pub use program::ProgramError;pub use program::ProgramErrorKind;pub use program::RulesProgram;
Modules§
- program
- The rules program,
rustev.rules/1(spec 005, 3.2 and 3.3): the document a host supplies, its validation and the checked form the evaluator runs.
Structs§
- Plan
Mismatch - One way a plan’s use of this backend does not match its program.
- Rules
Backend - A validated rules program, ready to answer requests.
Enums§
- Evaluated
- What one evaluation produced.
- Plan
Mismatch Kind