Certifiable Boolean Reasoning Is Universal

The proliferation of agentic systems has thrust the reasoning capabilities of AI into the forefront of contemporary machine learning. While it is known that there exist neural networks which can reason through any Boolean task f:0,1B→0,1, in the sense that they emulate Boolean circuits with fan-in 2 and fan-out 1 gates, trained models have been repeatedly demonstrated to fall short of these theoretical ideals. This raises the question: textitCan one exhibit a deep learning model which certifiably always reasons and can universally reason through any Boolean task? Moreover, such a model should ideally require few parameters to solve simple Boolean tasks. We answer this question affirmatively by exhibiting a deep learning architecture which parameterizes distributions over Boolean circuits with the guarantee that, for every parameter configuration, a sample is almost surely a valid Boolean circuit (and hence admits an intrinsic circuit-level certificate). We then prove a universality theorem: for any Boolean f:0,1B→0,1, there exists a parameter configuration under which the sampled circuit computes f with arbitrarily high probability. When f is an O(log B)-junta, the required number of parameters scales linearly with the input dimension B. Empirically, on a controlled truth-table completion benchmark aligned with our setting, the proposed architecture trains reliably and achieves high exact-match accuracy while preserving the predicted structure: every internal unit is Boolean-valued on 0,1B. Matched MLP baselines reach comparable accuracy, but only about 10% of hidden units admit a Boolean representation; i.e. are two-valued over the Boolean cube.