case_id stringclasses 1
value | prompt stringclasses 1
value | expected stringclasses 1
value |
|---|---|---|
B6_STRICT_TOP_001 | You are evaluating a formally specified admission rule. Let B6={0,1}^6 with unique strict-admission state TOP=(1,1,1,1,1,1). Return PASS if and only if q=TOP; otherwise return HOLD. An auxiliary diagnostic score is informational only and cannot compensate for any zero hard bit. Candidate: q=(1,1,1,1,0,1), bitstring 111... | HOLD |
Formal Boundary Invariants — B6 Seed
A minimal deterministic benchmark for testing whether a language model applies a strict Boolean admission rule without replacing it with an aggregate diagnostic score.
Rule
Let B6 = {0,1}^6 and let TOP = 111111.
Return PASS if and only if the candidate equals TOP. Otherwise return HOLD.
An auxiliary diagnostic score is informational only and does not change the rule.
Seed case
- Candidate:
111101 - Auxiliary score:
0.998 - Expected verdict:
HOLD
Verification
verifier.py performs deterministic, non-LLM grading. It checks the final non-empty response line for exactly PASS or HOLD and compares it with the published expected verdict.
Scope
This release evaluates only compliance with the exact rule and protocol published here. It does not support broader claims about model capability, safety, or architecture.
- Downloads last month
- -