Zerocheckさん！ フォローありがとうございます！よろしくお願いします✨✨お互い頑張りましょう🔥

પેટ્રોલ પંપ પર છેતરપિંડીથી બચવા આ ખાસ ધ્યાન રાખો.. #petrol #scam #PetrolPump #FuelFraud #FuelCheck #DensityCheck #ZeroCheck #IndianOil #Diesel #Petrol #FuelQuality #ConsumerRights #OnlineComplaint #PGPortal #FuelScam #VTVDigital #InformativeVideo #dailydose

પેટ્રોલ પંપ પર છેતરપિંડીથી બચવા '00' નહીં, આ ચેક કરવું જરુરી। Daily Dose #petrol #scam #PetrolPump #FuelFraud #FuelCheck #DensityCheck #ZeroCheck #IndianOil #Diesel #Petrol #FuelQuality #ConsumerRights #OnlineComplaint #PGPortal #FuelScam #VTVDigital #InformativeVideo #dailydose

પેટ્રોલ પંપ પર છેતરપિંડીથી બચવા '00' નહીં, આ ચેક કરવું જરુરી। Daily Dose #petrol #scam #PetrolPump #FuelFraud #FuelCheck #DensityCheck #ZeroCheck #IndianOil #Diesel #Petrol #FuelQuality #ConsumerRights #OnlineComplaint #PGPortal #FuelScam #VTVDigital #InformativeVideo #dailydose

The protocol in the paper does not, fair point. You can run a zerocheck on `in * (1 - in)`, which will result in another opening obligation on `in`, which you can then combine with the one coming from GKR. So 2 more sumchecks, not noticeable given we've already run ~250.

Post ZK-bootcamp day 39: -ProductCheck proves that a claimed product over Boolean hypercube values is correct ∏x​f1​(x) = ∏x​f2​(x) = s -How to reduce the multiplicative check to a ZeroCheck instance by constructing a recursive polynomial V

Post ZK-bootcamp day 38: How ZeroCheck reduces to Sumcheck using a random equality polynomial -Why non-zero values of f imply g(Y) is a non-zero polynomial, not just a non-zero value -How the μ=1 case shows ZeroCheck is really random interpolation checking

He didn't just "research" AI. He founded ScrutinAI to create intelligent audit trails. He didn't just "learn" about blockchain vulnerabilities. He built ZeroCheck to solve them.

It's old, but it's still the most (prover) efficient way to do zero-check on a range with succinct verifier that we know. In particular O(n) time instead of O(nlogn) for the traditional univariate FFT-based solution (We do have a way to do zerocheck on univariates with O(n) prover work, but it's still less efficient than sumcheck hackmd.io/glcndcBGQrOYwM_-Fp…) Folding that you mention elsewhere on this thread doesn't have succinct verifier so it's not a replacement for it.

Research: Multivariate Sumcheck (Part 3) We showed how diverse constraints reduce to the Multivariate Sumcheck Protocol using techniques including ZeroCheck, Rational Sumcheck, multiset equality, permutation checks, and LogUp lookups: zkm.io/blog/multivariate-sum… This unifies pointwise checks into efficient global verifications used in systems such as Plonk/HyperPlonk, Halo2, and zkVM frameworks.

Here’s the third installment of our series on the Multivariate Sumcheck Protocol: a compact guide to reducing real protocol constraints to sumcheck: zkm.io/blog/multivariate-sum… In this edition we cover ZeroCheck for vanishing assertions, Rational Sumcheck for division/rational relations, multiset equality and permutation checks via logarithmic-derivative identities, and the LogUp lookup argument - tying each to practical use in Plonk/HyperPlonk/Halo2 and zkVM settings.

thanks for sharing! you're claiming a zerocheck with constant round count and only a polylog amount of non-witness data communication (eg cross terms, quotients)? I feel that's a heuristic impossibility. your diagonalization trick looks suspicious

Spartan reduces ZeroCheck to SumCheck by using eq(X, β) as a random linear-combination coefficient. Because β ∈ 𝔽^ℓ, generating ℓ random values each step is expensive. ZeroFold of NeutronNova instead uses τ^X, which raises the security requirement to 256 bits.

81. SwapEasy: An AI-powered platform that autonomously manages and optimizes crypto portfolios by leveraging secure MPC, real-time market data, and user-friendly features for seamless investment growth. devfolio.co/projects/swapeas… 82. Winfinity: Where Every Play Wins Beyond Limits! - devfolio.co/projects/winfini… 83. OrbitUs: Decentralized drop servicing platform that bridges the gap between freelancers and clients - devfolio.co/projects/orbitus… 84. TheXAgent: Empowering DeFi Conversations with Social X – Your All-in-One AI-Powered Trading Assistant - devfolio.co/projects/thexage… 85. DESPLIT: Join, Split, Settle – All Onchain - devfolio.co/projects/desplit… 86. ZKP2PPhonePe: Secure, Trustless Crypto-Fiat Transactions with Zero-Knowledge Proofs - devfolio.co/projects/zkpppho… 87. EVNotify: Decentralized AI-based solution for EVs - devfolio.co/projects/evnotif… 88. CryptoBuddy: Simplifying Crypto Management - devfolio.co/projects/cryptob… 89. Swap-Trade: Stateless Decentralized Order Matching DEX on Base - devfolio.co/projects/swaptra… 90. ETHSapien: Decentralized AI-Powered Credentialing System for Onchain Identity Verification and Reputation - devfolio.co/projects/ethsapi… 91. ZeroCheck: Verify Age and Identity, Safely and Privately, with Zero-Knowledge Proofs - devfolio.co/projects/zeroche… 92. FortressAI: Consumer App for Trustless AI Agents that run inside TEEs - devfolio.co/projects/fortres… 93. PredictChain: AI-Powered Stock Predictions: Bringing off-chain stock market predictions to the blockchain for secure and transparent trading insights - devfolio.co/projects/predict… 94. BondApp: Dapp that facilitates friend discovery in shared physical locations, such as a mall etc. - devfolio.co/projects/bondapp… 95. Bounty-Birbal: Revolutionizing open-source bounty management with blockchain-powered payments, privacy-first KYC, and GitHub-centric AI workflows - devfolio.co/projects/bountyb… 96. MemoraAi: Bringing Memories OnChain 🤳🏻 - devfolio.co/projects/memoraa… 97. AttestAI: Decentralized AI framework with EAS verification to ensure data integrity, detect model poisoning, and securely store trained models on Walrus for trusted, tamper-proof machine learning solutions - devfolio.co/projects/attesta… 98. BasedBets-Alpha: AI & Blockchain powered betting agent for Realtime Events - devfolio.co/projects/basedbe… 99. Silkroad: Sell digital products in a Farcaster Mini App (frames v2) - devfolio.co/projects/silkroa… 100. ValuesDAO: Preserving and Tokenizing Community Culture/Lore On-Chain with AI and Social Consensus. devfolio.co/projects/valuesd…

I guess I'm having my own ZKHack here, but still: Problem 1: Break GKR. Simple as that, provide an example of a GKR circuit which has nonzero polynomial on the outer layer, and successfully passes zerocheck. For simplicity, assume that commitment scheme is Poseidon-Basefold.

We implemented FRI-Binius, Lasso lookups using the Thaler13 GKR grand product argument, and small field-optimized zerocheck with univariate skip technique from Gruen24 gitlab.com/IrreducibleOSS/bi…

In continuation of our previous research on STARK, the Bitlayer research team has conducted a deep dive on the Binius STARK proof system. Our findings are as follows: 1⃣Previous STARK systems (252, 64, 32-bit) improved the encoding process yet continued to waste space. Binius employs compact bit-level operations, potentially positioning it as the next-generation STARK. 2⃣Binius boosts efficiency with binary field arithmetic, enhanced HyperPlonk checks, and small-field polynomial commitments. 3⃣Further optimization in binary multiplication, ZeroCheck, SumCheck, and PCS may increase speed and reduce proof size. 👉For details, see Dr. Lynndell's (@lynndell11) latest article. blog.bitlayer.org/Binius_STA…

New paper from Angus Gruen @0xpolygon on improvements to zerocheck! Angus joined us after finishing his math PhD at Caltech and we're extremely lucky to have him - he optimized our keccak circuit by 4x as an intern! eprint.iacr.org/2024/108

Hey @nico_mnbl , @kobigurk said you would be better suited to answer this question. (as well as @srinathtv if you are around). I am struggling with understanding sumcheck folding from HyperNova. I get the progression of folding schemes with Sangria being witness aggregation via random linear combination which yields error terms, then the use of boolean hypercubes in Hyperplonk to transform the execution trace into a multivariate polynomial thats linear in each term to remove FFTs then use zerocheck and sumcheck to prove they hold to the gate equation. But where I struggle is how you use these to fold witness data from one instance into another. Since you have a polynomial linear in each variable does that mean you can follow the same process as Sangria and commit to them, add them together with additive homomorphic commits and just do a new sumcheck over the combined hypercube with a check that the combined witness commit is valid?