This is a news story, published by Quanta Magazine, that relates primarily to Tom Gur news.
For more Tom Gur news, you can click here:
more Tom Gur newsFor more Ai research news, you can click here:
more Ai research newsFor more news from Quanta Magazine, you can click here:
more news from Quanta MagazineOtherweb, Inc is a public benefit corporation, dedicated to improving the quality of news people consume. We are non-partisan, junk-free, and ad-free. We use artificial intelligence (AI) to remove junk from your news feed, and allow you to select the best tech news, business news, entertainment news, and much more. If you like this article about Ai research, you might also like this article about
knowledge proofs. We are dedicated to bringing you the highest-quality news, junk-free and ad-free, about your favorite topics. Please come every day to read the latest checkable proofs news, ordinary proofs news, news about Ai research, and other high-quality news about any topic that interests you. We are working hard to create the best news aggregator on the web, and to put you in control of your news feed - whether you choose to read the latest news through our website, our news app, or our daily newsletter - all free!
New proof methodsQuanta Magazine
•
76% Informative
Mathematicians have been following this basic approach for well over 2,000 years .
In the 1980s and 1990s , computer scientists reimagined what a proof could be.
In a paper that marks the culmination of seven years of work, Tom Gur and two other computer scientists have finally combined the ideal versions of the two kinds of proof for an important class of problems.
In 1992 , computer scientists Sanjeev Arora and Shmuel Safra defined a new class of noninteractive proofs: probabilistically checkable proofs.
PCPs effectively multiplies and distributes any error in an ordinary proof.
But PCPs can be rigorously vetted by a verifier who only reads small snippets.
In 1997 , researchers built a type of zero -knowledge PCP that worked for any problem in NEXP , but at a cost.
The verifier had to add a whiff of interactivity back into how the verifier vets the proof.
This is good enough for all practical applications of PCPs in cryptography, but some researchers can’t resist the allure of “perfect zero knowledge”.
VR Score
80
Informative language
85
Neutral language
33
Article tone
informal
Language
English
Language complexity
50
Offensive language
not offensive
Hate speech
not hateful
Attention-grabbing headline
detected
Known propaganda techniques
not detected
Time-value
long-living
External references
11
Source diversity
7
Affiliate links
no affiliate links