[cryptography] [tahoe-dev] SNARKs, constant-time proofs of computation

Steve Weis steveweis at gmail.com
Thu Nov 7 12:54:16 EST 2013

Hi Andrew. You may be interested in contacting an early-phase startup
called Tegos:

They're in stealth mode and haven't posted any info online, but they are
legitimate and relevant to this work.

On Thu, Nov 7, 2013 at 8:39 AM, Andrew Miller <amiller at cs.ucf.edu> wrote:

> Here's a possible Tesla Coils and Corpses discussion I'd like to have
> sometime a few weeks from now maybe:
>    SNARKs (Succinct Non-interactive Arguments of Knowledge) are a
> recent hot topic in modern cryptography. A generic SNARK scheme lets
> you can take an arbitrary computation (e.g., the routine that checks a
> signature and a merkle tree branch) and compile it to a *constant
> size* compressed representation, called the verification key. An
> untrusted server can execute the computation on behalf of the client,
> and produce a *constant size* proof that it was carried out correctly.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.randombit.net/pipermail/cryptography/attachments/20131107/37785e33/attachment.html>

More information about the cryptography mailing list