<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://161.35.113.184/index.php?action=history&amp;feed=atom&amp;title=Computation_Commitments</id>
	<title>Computation Commitments - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://161.35.113.184/index.php?action=history&amp;feed=atom&amp;title=Computation_Commitments"/>
	<link rel="alternate" type="text/html" href="http://161.35.113.184/index.php?title=Computation_Commitments&amp;action=history"/>
	<updated>2026-04-06T18:20:59Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.33.0</generator>
	<entry>
		<id>http://161.35.113.184/index.php?title=Computation_Commitments&amp;diff=109&amp;oldid=prev</id>
		<title>Srikar: Created page with &quot;First introduced in SPARTAN, this method involves the verifier $V$ committing to the structure of the NP statement that is to be proved. While this requires at least linear co...&quot;</title>
		<link rel="alternate" type="text/html" href="http://161.35.113.184/index.php?title=Computation_Commitments&amp;diff=109&amp;oldid=prev"/>
		<updated>2020-10-16T22:45:34Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;First introduced in SPARTAN, this method involves the verifier $V$ committing to the structure of the NP statement that is to be proved. While this requires at least linear co...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;First introduced in SPARTAN, this method involves the verifier $V$ committing to the structure of the NP statement that is to be proved. While this requires at least linear cost in the size of the statement, it is amortized over all future statements of the same form. This method is used in Fractal and Supersonic.&lt;/div&gt;</summary>
		<author><name>Srikar</name></author>
		
	</entry>
</feed>