Small Boolean Minimization Workbench

How to use Small Boolean Minimization Workbench

Enumerate finite valid cubes and prime implicants, compare all bounded prime covers and verify the required rows for the selected SOP or POS expression.

1. Use the example as the schema; replace its labels and entered model assumptions.
2. Enumerate finite valid cubes and prime implicants, compare all bounded prime covers and verify the required rows for the selected SOP or POS expression.
3. Calculate, inspect the complete witnesses and limitations, then copy or download the JSON report.

Good to know

• 1–4 distinct ASCII variable names of at most 16 characters; exactly 2^n output symbols 0, 1 or uppercase X. Binary row order uses the first variable as the most significant bit.
• At most 81 cubes and 16 prime implicants in this bounded exact interface. Objective: fewest literal occurrences, then fewest terms/clauses. X rows are unconstrained; all-X can choose different constants by form. No entered-expression interpreter, circuit simulator or hazard/gate-delay certification.
• Local calculation with no upload, input persistence or outside lookup. Model JSON is limited to 30,000 characters and 10,000 values. Decimal quantities are strings with up to six places; count fields use plain JSON integers. Exact fractions are capped at 8,192 bits. The complete JSON output is limited to 1,000,000 characters; approximate numbers preserve their stored values. Unsupported states fail explicitly.