Findings

CVE-2026-41197

Noir is a Domain Specific Language for SNARK proving systems that is designed to use any ACIR compatible proving system, and Brillig is the bytecode ACIR uses for non-determinism.

Published Apr 23, 2026 · updated Jun 17, 2026

Noir is a Domain Specific Language for SNARK proving systems that is designed to use any ACIR compatible proving system, and Brillig is the bytecode ACIR uses for non-determinism. Noir programs can invoke external functions through foreign calls. When compiling to Brillig bytecode, the SSA instructions are processed block-by-block in . When the compiler encounters an with a target, it invokes in , which dispatches to . Before emitting the foreign call opcode, the compiler must pre-allocate memory for any array results the call will return. This happens through , which iterates over the result types. For results, it delegates to to recursively allocate memory on the heap for nested arrays. The struct is the internal representation of a Noir array in Brillig IR. Its field represents the semi-flattened size, the total number of memory slots the array occupies, accounting for the fact that composite types like tuples consume multiple slots per element. This size is computed by in . For the outer array, correctly uses , which internally calls . This function applies the formula above, producing the correct semi-flattened size. However, for nested arrays, contains a bug. The pattern discards the inner types with and uses only , the semantic length of the nested array (the number of logical elements), not the semi-flattened size. For simple element types this works correctly, but for composite element types it under-allocates. Foreign calls returning nested arrays of tuples or other composite types corrupt the Brillig VM heap. Version 1.0.0-beta.19 fixes this issue.