[HN Gopher] Lurk - Language for Recursive ZK-SNARKs Inspired by ...
       ___________________________________________________________________
        
       Lurk - Language for Recursive ZK-SNARKs Inspired by Common Lisp and
       Scheme
        
       Author : diggan
       Score  : 3 points
       Date   : 2022-07-05 22:37 UTC (24 minutes ago)
        
 (HTM) web link (github.com)
 (TXT) w3m dump (github.com)
        
       | diggan wrote:
       | Multiple interesting features:
       | 
       | - Lurk program execution can be proved in zero knowledge.
       | 
       | - Lurk proofs support multiple backend SNARK proving systems.
       | 
       | - Lurk enables incremental computation and proofs in unbounded
       | loops.
       | 
       | - Lurk provides conditional control flow.
       | 
       | - Lurk programs are data and vice versa.
       | 
       | - Lurk data is content-addressable for compatibility with
       | IPLD/IPFS.
       | 
       | That it's a lisp just makes it all better as well.
       | 
       | Here's a Fibonacci example:                   ;; (FIB TARGET)
       | computes the element of the Fibonacci sequence at TARGET (zero-
       | indexed).         (letrec ((next (lambda (a b n target)
       | (if (eq n target)                              a
       | (next b                                    (+ a b)
       | (+ 1 n)                                    target))))
       | (fib (next 0 1 0)))                 (fib 1))
        
       ___________________________________________________________________
       (page generated 2022-07-05 23:01 UTC)