Skip to content

solvi.core.slow.proposals

One count of what a proposer offered and what the checks did with it — proposed = dropped + refuted + admitted — named the same in laws, the refine loop and compiled specifications.

One count of what a proposer offered and what the checks did with it, named the same wherever a model proposes and code checks: laws (solvi.experimental.laws.LawSet), the refine loop (Refinement.proposals) and compiled specifications (Compiled.proposals, solvi.experimental.compile).

proposed = dropped + refuted + admitted

dropped: refused before any check could judge it (laws: a condition the grammar refuses; refine: a reply the generator rejected, or a proposer that failed; compile: a draft with no module, one that breaks the module contract, or one the sandbox could not run); refuted: a check judged it and said no (laws: a candidate proposed for a mismatch and not accepted; refine: a round not accepted; compile: a draft that ran and was sent back — tests, examples, a disagreement, an abstention); admitted: it passed (laws: accepted; refine: the accepted round; compile: a draft that passed every check in its round). proposals_of(x) reads it off any of the three; the share the checks refused is (dropped + refuted) / proposed.

Proposals dataclass

Proposals(proposed: int, dropped: int, refuted: int, admitted: int)

proposed = dropped + refuted + admitted (see the module docs).

refused property

refused: float | None

The share of the proposals the checks refused (dropped or refuted); None with no proposal.

proposals_of

proposals_of(x) -> Proposals

The count of a LawSet, a Refinement or a Compiled (anything with a proposals attribute, or a law set's cost and proposer).