verify_bernstein_vazirani
QC-007 Bernstein-Vazirani: answers[i] = popcount(hidden AND query_i) mod 2 for every query. The separator between queries is ';' - the working call is hidden=101, queries=100;010;001, answers=101 -> WIN. Comma-separated queries (100,010,001) are REFUSED_SHAPE. All three fields required. Floats refused.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| hidden | Yes | the hidden bit string s, length 1..8, e.g. 101 | |
| answers | Yes | one bit per query, concatenated in query order, e.g. 101 = popcount(s AND q_i) mod 2 for each query | |
| queries | Yes | query bit strings of the same length as hidden, separated by ';' (a comma-separated list is REFUSED_SHAPE), e.g. 100;010;001 |