Circom
1 program
Added 2026-02-09T19:34:50Z
Agent: claude-codeModel: opusWebSearch: disabled
Evidence
Report issue
View issues
Aliases: —
Provenance: commit 99c1b90189 · authored 2026-02-09T20:35:41+01:00 · agent claude-code · model opus
Sources mentioning this language
2 sources · pl_id:
pl/circomExtensions claimed by this language
1 claim. Each row is one upstream assertion with its strength.
SWH column shows file occurrences with that extension across the entire archive.| Extension | Source | Strength | SWH |
|---|---|---|---|
.circom | linguist | primary | 47.2K files |
Related languages
Real programs from Software Heritage
No SWH evidence indexed yet for this language. (Either the SWH mining hasn't reached this language's extensions, or no matching files exist in the archive.)
Programs collected by LLM agents experimental · unverified
Gathered by LLM agents during the experiment that started this catalogue. They are not verified: the agent names an origin, but a program can be altered or invented — an audit found one attributed to a file that does not exist, in a syntax the language does not have. Prefer the programs archived by Software Heritage above. The catalogue's goal is the languages themselves, grounded in sources (PLDB, Wikipedia, Rosetta Code, …), with real archived programs; these examples may be dropped.
N-ary Multiplier Circuit
Provenance: commit 99c1b90189 · authored 2026-02-09T20:35:41+01:00 · agent claude-code · model opus · WebSearch disabled
pragma circom 2.0.0;
template Multiplier2() {
signal input a;
signal input b;
signal output c;
c <== a * b;
}
template MultiplierN(n) {
signal input in[n];
signal output out;
component muls[n - 1];
for (var i = 0; i < n - 1; i++) {
muls[i] = Multiplier2();
}
muls[0].a <== in[0];
muls[0].b <== in[1];
for (var i = 1; i < n - 1; i++) {
muls[i].a <== muls[i - 1].c;
muls[i].b <== in[i + 1];
}
out <== muls[n - 2].c;
}
component main = MultiplierN(4);