We design and implement a simple zero-knowledge argument protocol for NP whose
communication complexity is proportional to the square-root of the verification circuit size …

In the past decade, blockchains have seen various financial and technological innovations,
with cryptocurrencies reaching a market cap of over 1 trillion dollars. However, scalability is …

The recent surge in artificial intelligence (AI), characterized by the prominence of large
language models (LLMs), has ushered in fundamental transformations across the globe …

A zero-knowledge proof of training (zkPoT) enables a party to prove that they have correctly
trained a committed model based on a committed dataset without revealing any additional …

This works introduces BaseFold, a new field-agnostic Polynomial Commitment Scheme
(PCS) for multilinear polynomials that has O (log 2 (n)) verifier costs and O (n log n) prover …

Interactive proofs (IPs) and arguments are cryptographic protocols that enable an untrusted
prover to provide a guarantee that it performed a requested computation correctly …