snark

1. (literary) The fictional creature of Lewis Carroll's poem, used allusively to refer to fruitless quest or search.Examples: "When the auctioneer had exhausted his vocabulary in describing the merits of an animal, his winding-up formula was "One times! two times! three times!" Then the hammer gave a tap, and he and our party would devote our energies to discovering the last bidder - a research which generally was as promising as the hunting of the snark."; "Remy said Dad was hunting snarks; at the time, she'd thought it was a euphemism."literary

2. (mathematics) A graph in which every node has three branches, and the edges cannot be coloured in fewer than four colours without two edges of the same colour meeting at a point.

3. (particle physics) A fluke or unrepeatable result or detection in an experiment.Examples: "Cabrera's Valentine's Day monopole detection or some extremely energetic cosmic rays could be examples of snarks."particle

1. (computing, cryptography) Acronym of succinct non-interactive argument of knowledge.Examples: "2019, Anca Nitulescu, Lattice-Based Zero-Knowledge SNARGs for Arithmetic Circuits, Peter Schwabe, Nicolas Thériault (editors), Progress in Cryptology – LATINCRYPT 2019: 6th International Conference, Proceedings, Springer, LNCS 11774, page 223, SNARG vs. SNARK. If we replace the computational soundness with computational Knowledge Soundness we obtain what we call a SNARK, a succinct non-interactive argument of knowledge."; "2020, Fuyuki Kitagawa, Takahiro Matsuda, Takashi Yamakawa, NIZK from SNARG, Rafael Pass, Krzysztof Pietrzak (editors), Theory of Cryptography: 18th International Conference, Proceedings, Part I, Springer, LNCS 12550, page 568, Actually, what is often used in blockchains is a SNARK [4], which is a stronger variant of a SNARG that satisfies extractability."; "2023, Matteo Campanelli, Chaya Ganesh, Hamidreza Khoshakhlagh, Janno Siim, Impossibilities in Succinct Arguments: Black-Box Extraction and More, Nadia El Mrabet, Luca De Feo, Sylvain Duquesne (editors), Progress in Cryptology - AFRICACRYPT 2023: 14th International Conference, Proceedings, Springer, LNCS 14064, page 467, Whether we can build SNARKs with black-box extraction in the standard model is an elusive problem. […] In particular, we show that a SNARG can be lifted to a SNARK with the features above for the class of languages FewP (roughly, NP with polynomial many witnesses)."abbreviationacronymalt-of