|
| 1 | +use std::{cell::RefCell, rc::Rc, sync::Arc, time::Duration}; |
| 2 | + |
| 3 | +use anyhow::anyhow; |
| 4 | + |
| 5 | +use pasta_curves::pallas; |
| 6 | + |
1 | 7 | use lurk::{
|
| 8 | + eval::lang::{Coproc, Lang}, |
2 | 9 | field::LurkField,
|
3 |
| - lem::{eval::evaluate_simple, pointers::Ptr, store::Store}, |
4 |
| - {eval::lang::Coproc, state::State}, |
| 10 | + lem::{eval::evaluate, multiframe::MultiFrame, pointers::Ptr, store::Store}, |
| 11 | + proof::Prover, |
| 12 | + proof::{nova::NovaProver, RecursiveSNARKTrait}, |
| 13 | + public_parameters::{ |
| 14 | + instance::{Instance, Kind}, |
| 15 | + public_params, |
| 16 | + }, |
| 17 | + state::State, |
5 | 18 | };
|
6 |
| -use pasta_curves::Fq; |
7 | 19 |
|
8 |
| -fn fib_expr<F: LurkField>(store: &Store<F>) -> Ptr { |
| 20 | +use tracing_subscriber::{fmt, prelude::*, EnvFilter, Registry}; |
| 21 | +use tracing_texray::TeXRayLayer; |
| 22 | + |
| 23 | +fn fib<F: LurkField>(store: &Store<F>, state: Rc<RefCell<State>>, _a: u64) -> Ptr { |
9 | 24 | let program = r#"
|
10 | 25 | (letrec ((next (lambda (a b) (next b (+ a b))))
|
11 | 26 | (fib (next 0 1)))
|
12 | 27 | (fib))
|
13 | 28 | "#;
|
14 | 29 |
|
15 |
| - store.read_with_default_state(program).unwrap() |
| 30 | + store.read(state, program).unwrap() |
16 | 31 | }
|
17 | 32 |
|
18 |
| -// The env output in the `fib_frame`th frame of the above, infinite Fibonacci computation contains a binding of the |
| 33 | +// The env output in the `fib_frame`th frame of the above, infinite Fibonacci computation will contain a binding of the |
19 | 34 | // nth Fibonacci number to `a`.
|
| 35 | +// means of computing it.] |
20 | 36 | fn fib_frame(n: usize) -> usize {
|
21 | 37 | 11 + 16 * n
|
22 | 38 | }
|
23 | 39 |
|
24 | 40 | // Set the limit so the last step will be filled exactly, since Lurk currently only pads terminal/error continuations.
|
25 |
| -#[allow(dead_code)] |
26 | 41 | fn fib_limit(n: usize, rc: usize) -> usize {
|
27 | 42 | let frame = fib_frame(n);
|
28 | 43 | rc * (frame / rc + usize::from(frame % rc != 0))
|
29 | 44 | }
|
30 | 45 |
|
31 |
| -fn lurk_fib(store: &Store<Fq>, n: usize, _rc: usize) -> Ptr { |
32 |
| - let frame_idx = fib_frame(n); |
33 |
| - // let limit = fib_limit(n, rc); |
34 |
| - let limit = frame_idx; |
35 |
| - let fib_expr = fib_expr(store); |
36 |
| - |
37 |
| - let (output, ..) = evaluate_simple::<Fq, Coproc<Fq>>(None, fib_expr, store, limit).unwrap(); |
38 |
| - |
39 |
| - let target_env = &output[1]; |
40 |
| - |
41 |
| - // The result is the value of the second binding (of `A`), in the target env. |
42 |
| - // See relevant excerpt of execution trace below: |
43 |
| - // |
44 |
| - // INFO lurk::eval > Frame: 11 |
45 |
| - // Expr: (NEXT B (+ A B)) |
46 |
| - // Env: ((B . 1) (A . 0) ((NEXT . <FUNCTION (A) (LAMBDA (B) (NEXT B (+ A B)))>))) |
47 |
| - // Cont: Tail{ saved_env: (((NEXT . <FUNCTION (A) (LAMBDA (B) (NEXT B (+ A B)))>))), continuation: LetRec{var: FIB, |
48 |
| - // saved_env: (((NEXT . <FUNCTION (A) (LAMBDA (B) (NEXT B (+ A B)))>))), body: (FIB), continuation: Tail{ saved_env: |
49 |
| - // NIL, continuation: Outermost } } } |
50 |
| - |
51 |
| - let (_, rest_bindings) = store.car_cdr(target_env).unwrap(); |
52 |
| - let (second_binding, _) = store.car_cdr(&rest_bindings).unwrap(); |
53 |
| - store.car_cdr(&second_binding).unwrap().1 |
| 46 | +#[derive(Clone, Debug, Copy)] |
| 47 | +struct ProveParams { |
| 48 | + fib_n: usize, |
| 49 | + rc: usize, |
54 | 50 | }
|
55 | 51 |
|
| 52 | +fn rc_env() -> anyhow::Result<Vec<usize>> { |
| 53 | + std::env::var("LURK_RC") |
| 54 | + .map_err(|e| anyhow!("Reduction count env var isn't set: {e}")) |
| 55 | + .and_then(|rc| { |
| 56 | + let vec: anyhow::Result<Vec<usize>> = rc |
| 57 | + .split(',') |
| 58 | + .map(|rc| { |
| 59 | + rc.parse::<usize>() |
| 60 | + .map_err(|e| anyhow!("Failed to parse RC: {e}")) |
| 61 | + }) |
| 62 | + .collect(); |
| 63 | + vec |
| 64 | + }) |
| 65 | +} |
| 66 | + |
| 67 | +fn fibonacci_prove(prove_params: ProveParams, state: &Rc<RefCell<State>>) { |
| 68 | + let limit = fib_limit(prove_params.fib_n, prove_params.rc); |
| 69 | + let lang_pallas = Lang::<pallas::Scalar, Coproc<pallas::Scalar>>::new(); |
| 70 | + let lang_rc = Arc::new(lang_pallas.clone()); |
| 71 | + |
| 72 | + // use cached public params |
| 73 | + let instance = Instance::new( |
| 74 | + prove_params.rc, |
| 75 | + lang_rc.clone(), |
| 76 | + true, |
| 77 | + Kind::NovaPublicParams, |
| 78 | + ); |
| 79 | + let pp = public_params::<_, _, MultiFrame<'_, _, _>>(&instance).unwrap(); |
| 80 | + |
| 81 | + let store = Store::default(); |
| 82 | + |
| 83 | + let ptr = fib::<pasta_curves::Fq>(&store, state.clone(), prove_params.fib_n as u64); |
| 84 | + let prover = NovaProver::new(prove_params.rc, lang_rc.clone()); |
| 85 | + |
| 86 | + let frames = &evaluate::<pasta_curves::Fq, Coproc<pasta_curves::Fq>>(None, ptr, &store, limit) |
| 87 | + .unwrap() |
| 88 | + .0; |
| 89 | + let (proof, z0, zi, num_steps) = tracing_texray::examine(tracing::info_span!("bang!")) |
| 90 | + .in_scope(|| prover.prove(&pp, frames, &store).unwrap()); |
| 91 | + |
| 92 | + let res = proof.verify(&pp, &z0, &zi, num_steps).unwrap(); |
| 93 | + assert!(res); |
| 94 | +} |
| 95 | + |
| 96 | +/// RUST_LOG=info LURK_RC=900 LURK_PERF=max-parallel-simple cargo run --release --example fibonacci --features "cuda" |
56 | 97 | fn main() {
|
57 |
| - let store = &Store::<Fq>::default(); |
58 |
| - let n: usize = std::env::args().collect::<Vec<_>>()[1].parse().unwrap(); |
59 |
| - let state = State::init_lurk_state(); |
| 98 | + let subscriber = Registry::default() |
| 99 | + .with(fmt::layer().pretty()) |
| 100 | + .with(EnvFilter::from_default_env()) |
| 101 | + .with(TeXRayLayer::new().width(120)); |
| 102 | + tracing::subscriber::set_global_default(subscriber).unwrap(); |
| 103 | + |
| 104 | + let rcs = rc_env().unwrap_or_else(|_| vec![100]); |
| 105 | + let batch_sizes = [249]; |
| 106 | + |
| 107 | + let state = State::init_lurk_state().rccell(); |
60 | 108 |
|
61 |
| - let fib = lurk_fib(store, n, 100); |
| 109 | + for rc in rcs.iter() { |
| 110 | + for fib_n in batch_sizes.iter() { |
| 111 | + let prove_params = ProveParams { |
| 112 | + fib_n: *fib_n, |
| 113 | + rc: *rc, |
| 114 | + }; |
| 115 | + fibonacci_prove(prove_params, &state); |
| 116 | + } |
| 117 | + } |
62 | 118 |
|
63 |
| - println!("Fib({n}) = {}", fib.fmt_to_string(store, &state)); |
| 119 | + println!("success"); |
64 | 120 | }
|
0 commit comments