"SNARK" meaning in All languages combined

{
  "forms": [
    {
      "form": "SNARKs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "SNARK (plural SNARKs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "alt_of": [
        {
          "word": "succinct non-interactive argument of knowledge"
        }
      ],
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computing",
          "orig": "en:Computing",
          "parents": [
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Cryptography",
          "orig": "en:Cryptography",
          "parents": [
            "Computer science",
            "Formal sciences",
            "Mathematics",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "text": "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,\nSNARG 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."
        },
        {
          "text": "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,\nActually, what is often used in blockchains is a SNARK [4], which is a stronger variant of a SNARG that satisfies extractability."
        },
        {
          "text": "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,\nWhether 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)."
        }
      ],
      "glosses": [
        "Acronym of succinct non-interactive argument of knowledge."
      ],
      "id": "en-SNARK-en-noun-j1s2fM8J",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "cryptography",
          "cryptography"
        ],
        [
          "succinct non-interactive argument of knowledge",
          "succinct non-interactive argument of knowledge#English"
        ]
      ],
      "raw_glosses": [
        "(computing, cryptography) Acronym of succinct non-interactive argument of knowledge."
      ],
      "related": [
        {
          "word": "SNARG"
        }
      ],
      "tags": [
        "abbreviation",
        "acronym",
        "alt-of"
      ],
      "topics": [
        "computing",
        "cryptography",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "SNARK"
}

{
  "forms": [
    {
      "form": "SNARKs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "SNARK (plural SNARKs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "SNARG"
    }
  ],
  "senses": [
    {
      "alt_of": [
        {
          "word": "succinct non-interactive argument of knowledge"
        }
      ],
      "categories": [
        "English acronyms",
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "en:Computing",
        "en:Cryptography"
      ],
      "examples": [
        {
          "text": "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,\nSNARG 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."
        },
        {
          "text": "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,\nActually, what is often used in blockchains is a SNARK [4], which is a stronger variant of a SNARG that satisfies extractability."
        },
        {
          "text": "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,\nWhether 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)."
        }
      ],
      "glosses": [
        "Acronym of succinct non-interactive argument of knowledge."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "cryptography",
          "cryptography"
        ],
        [
          "succinct non-interactive argument of knowledge",
          "succinct non-interactive argument of knowledge#English"
        ]
      ],
      "raw_glosses": [
        "(computing, cryptography) Acronym of succinct non-interactive argument of knowledge."
      ],
      "tags": [
        "abbreviation",
        "acronym",
        "alt-of"
      ],
      "topics": [
        "computing",
        "cryptography",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "SNARK"
}