AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
The Sum Check Protocol and the Evolution of No-Wap
The CCS abstraction existed, one of the natural questions was can we apply this to NOAA? Can we build NOAA that can prove CCS? I think around the same time, Sangria came out. It was also using this error vectors or slack vectors. So we could do the same in CCS where if we introduce relaxed CCS, you could apply know what to this relaxed CCS. But because the proverse is actually committing to D terms, it does not actually give benefits over just using R1CS. The goal in hypernova was actually to be able to prove CCS without requiring the pro verse to send this order D cross terms. And then comes the mighty sum check