types.rs 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468
  1. use bellman::{gadgets::Assignment, groth16, Circuit, ConstraintSystem, SynthesisError};
  2. use sapvi::bls_extensions::BlsStringConversion;
  3. use std::{ops::{Add, AddAssign, MulAssign, SubAssign}, time::Instant};
  4. use std::rc::Rc;
  5. use std::{cell::RefCell, collections::HashMap};
  6. // use fnv::FnvHashMap;
  7. use itertools::Itertools;
  8. use crate::env::{env_bind, Env};
  9. use crate::types::MalErr::{ErrMalVal, ErrString};
  10. use crate::types::MalVal::{Atom, Bool, Func, Hash, Int, List, MalFunc, Nil, Str, Sym, Vector};
  11. use bellman::Variable;
  12. use bls12_381::Bls12;
  13. use bls12_381::Scalar;
  14. #[derive(Debug, Clone)]
  15. pub struct Allocation {
  16. pub symbol: String,
  17. pub value: Scalar,
  18. }
  19. #[derive(Debug, Clone)]
  20. pub struct EnforceAllocation {
  21. pub idx: usize,
  22. pub left: Vec<(String, String)>,
  23. pub right: Vec<(String, String)>,
  24. pub output: Vec<(String, String)>,
  25. }
  26. pub struct VerifyKeyParams {
  27. pub random_params: groth16::Parameters<Bls12>,
  28. pub verifying_key: groth16::PreparedVerifyingKey<Bls12>,
  29. }
  30. #[derive(Debug, Clone)]
  31. pub struct LispCircuit {
  32. pub params: HashMap<String, MalVal>,
  33. pub allocs: HashMap<String, MalVal>,
  34. pub alloc_inputs: HashMap<String, MalVal>,
  35. pub constraints: Vec<EnforceAllocation>,
  36. }
  37. #[derive(Debug, Clone)]
  38. pub enum MalVal {
  39. Nil,
  40. Bool(bool),
  41. Int(i64),
  42. Str(String),
  43. Sym(String),
  44. List(Rc<Vec<MalVal>>, Rc<MalVal>),
  45. Vector(Rc<Vec<MalVal>>, Rc<MalVal>),
  46. Hash(Rc<HashMap<String, MalVal>>, Rc<MalVal>),
  47. Func(fn(MalArgs) -> MalRet, Rc<MalVal>),
  48. MalFunc {
  49. eval: fn(ast: MalVal, env: Env) -> MalRet,
  50. ast: Rc<MalVal>,
  51. env: Env,
  52. params: Rc<MalVal>,
  53. is_macro: bool,
  54. meta: Rc<MalVal>,
  55. },
  56. Atom(Rc<RefCell<MalVal>>),
  57. Alloc(RefCell<HashMap<String, MalVal>>),
  58. Enforce(Rc<Vec<EnforceAllocation>>),
  59. ZKScalar(bls12_381::Scalar),
  60. }
  61. impl Circuit<bls12_381::Scalar> for LispCircuit {
  62. fn synthesize<CS: ConstraintSystem<bls12_381::Scalar>>(
  63. self,
  64. cs: &mut CS,
  65. ) -> Result<(), SynthesisError> {
  66. let mut variables: HashMap<String, Variable> = HashMap::default();
  67. let params_const = self.params;
  68. let circuitTime = Instant::now();
  69. let start = Instant::now();
  70. // println!("Allocations\n");
  71. for (k, v) in &self.allocs {
  72. match v {
  73. MalVal::ZKScalar(val) => {
  74. let var = cs.alloc(|| k, || Ok(*val))?;
  75. variables.insert(k.to_string(), var);
  76. }
  77. MalVal::Str(val) => {
  78. let val_scalar = bls12_381::Scalar::from_string(&*val);
  79. let var = cs.alloc(|| k, || Ok(val_scalar))?;
  80. variables.insert(k.to_string(), var);
  81. }
  82. MalVal::Vector(val, _) => {
  83. if let MalVal::ZKScalar(v) = &val.to_vec()[0] {
  84. let var = cs.alloc(|| k, || Ok(*v))?;
  85. variables.insert(k.to_string(), var);
  86. }
  87. }
  88. _ => {
  89. println!("not allocated k {:?} v {:?}", k, v);
  90. }
  91. }
  92. }
  93. println!("circuit alloc \t {:?}", start.elapsed());
  94. let start = Instant::now();
  95. // println!("Allocations Input\n");
  96. for (k, v) in &self.alloc_inputs {
  97. match v {
  98. MalVal::ZKScalar(val) => {
  99. let var = cs.alloc_input(|| k, || Ok(*val))?;
  100. variables.insert(k.to_string(), var);
  101. // println!("k {:?} v {:?} var {:?}", k, v, var);
  102. }
  103. MalVal::Str(val) => {
  104. let val_scalar = bls12_381::Scalar::from_string(&*val);
  105. let var = cs.alloc_input(|| k, || Ok(val_scalar))?;
  106. variables.insert(k.to_string(), var);
  107. // println!("k {:?} v {:?} var {:?}", k, v, var);
  108. }
  109. _ => {
  110. println!("not allocated k {:?} v {:?}", k, v);
  111. }
  112. }
  113. }
  114. println!("circuit alloc input \t {:?}", start.elapsed());
  115. let start = Instant::now();
  116. let mut enforce_sorted = self.constraints.clone();
  117. enforce_sorted.sort_by(|a, b| a.idx.cmp(&b.idx));
  118. for alloc_value in enforce_sorted.iter() {
  119. // println!("Enforce -> {:?}", alloc_value);
  120. let coeff = bls12_381::Scalar::one();
  121. let mut left = bellman::LinearCombination::<Scalar>::zero();
  122. let mut right = bellman::LinearCombination::<Scalar>::zero();
  123. let mut output = bellman::LinearCombination::<Scalar>::zero();
  124. for values in alloc_value.left.iter() {
  125. let (a, b) = values;
  126. let mut val_b = CS::one();
  127. if b != "cs::one" {
  128. // println!("{:?}", b);
  129. val_b = *variables.get(b).unwrap();
  130. }
  131. if a == "scalar::one" {
  132. left = left + (coeff, val_b);
  133. } else if a == "scalar::one::neg" {
  134. left = left + (coeff.neg(), val_b);
  135. } else {
  136. if let Some(value) = params_const.get(a) {
  137. match value {
  138. MalVal::ZKScalar(val) => {
  139. left = left + (*val, val_b);
  140. }
  141. MalVal::Str(s) => {
  142. let val = bls12_381::Scalar::from_string(&s.to_string());
  143. left = left + (val, val_b);
  144. }
  145. MalVal::Func(_, _) => {
  146. if let MalVal::Vector(val, _) = value.apply(vec![]).unwrap() {
  147. if let MalVal::ZKScalar(res) = val.to_vec()[0] {
  148. left = left + (res, val_b);
  149. }
  150. }
  151. }
  152. _ => {
  153. println!("not a valid param {:?}", value)
  154. }
  155. }
  156. }
  157. }
  158. // println!("left: a {:?} b {:?} val_b: {:?}", a, b, val_b);
  159. }
  160. for values in alloc_value.right.iter() {
  161. let (a, b) = values;
  162. let mut val_b = CS::one();
  163. if b != "cs::one" {
  164. val_b = *variables.get(b).unwrap();
  165. }
  166. if a == "scalar::one" {
  167. right = right + (coeff, val_b);
  168. } else if a == "scalar::one::neg" {
  169. right = right + (coeff.neg(), val_b);
  170. } else {
  171. if let Some(value) = params_const.get(a) {
  172. match value {
  173. MalVal::ZKScalar(val) => {
  174. right = right + (*val, val_b);
  175. }
  176. MalVal::Str(s) => {
  177. let val = bls12_381::Scalar::from_string(&s.to_string());
  178. right = right + (val, val_b);
  179. }
  180. MalVal::Func(_, _) => {
  181. if let MalVal::Vector(val, _) = value.apply(vec![]).unwrap() {
  182. if let MalVal::ZKScalar(res) = val.to_vec()[0] {
  183. right = right + (res, val_b);
  184. }
  185. }
  186. }
  187. _ => {
  188. println!("not a valid param {:?}", value)
  189. }
  190. }
  191. }
  192. }
  193. // println!("right: a {:?} b {:?} val_b: {:?}", a, b, val_b);
  194. }
  195. for values in alloc_value.output.iter() {
  196. let (a, b) = values;
  197. let mut val_b = CS::one();
  198. if b != "cs::one" {
  199. // println!("{:?}", b);
  200. val_b = *variables.get(b).unwrap();
  201. }
  202. if a == "scalar::one" {
  203. output = output + (coeff, val_b);
  204. } else if a == "scalar::one::neg" {
  205. output = output + (coeff.neg(), val_b);
  206. } else {
  207. if let Some(value) = params_const.get(a) {
  208. match value {
  209. MalVal::ZKScalar(val) => {
  210. output = output + (*val, val_b);
  211. }
  212. MalVal::Str(s) => {
  213. let val = bls12_381::Scalar::from_string(&s.to_string());
  214. output = output + (val, val_b);
  215. }
  216. MalVal::Func(_, _) => {
  217. if let MalVal::Vector(val, _) = value.apply(vec![]).unwrap() {
  218. if let MalVal::ZKScalar(res) = val.to_vec()[0] {
  219. output = output + (res, val_b);
  220. }
  221. }
  222. }
  223. _ => {
  224. println!("not a valid param {:?}", value)
  225. }
  226. }
  227. }
  228. }
  229. // println!("output: a {:?} b {:?} val_b: {:?}", a, b, val_b);
  230. }
  231. // println!("Enforcing ...");
  232. cs.enforce(
  233. || "constraint",
  234. |_| left.clone(),
  235. |_| right.clone(),
  236. |_| output.clone(),
  237. );
  238. }
  239. println!("circuit enforce \t {:?}", start.elapsed());
  240. println!("end circuit \t {:?}", circuitTime.elapsed());
  241. Ok(())
  242. }
  243. }
  244. #[derive(Debug)]
  245. pub enum MalErr {
  246. ErrString(String),
  247. ErrMalVal(MalVal),
  248. }
  249. impl From<SynthesisError> for MalErr {
  250. fn from(err: SynthesisError) -> MalErr {
  251. ErrString(err.to_string())
  252. }
  253. }
  254. pub type MalArgs = Vec<MalVal>;
  255. pub type MalRet = Result<MalVal, MalErr>;
  256. // type utility macros
  257. macro_rules! list {
  258. ($seq:expr) => {{
  259. List(Rc::new($seq),Rc::new(Nil))
  260. }};
  261. [$($args:expr),*] => {{
  262. let v: Vec<MalVal> = vec![$($args),*];
  263. List(Rc::new(v),Rc::new(Nil))
  264. }}
  265. }
  266. macro_rules! vector {
  267. ($seq:expr) => {{
  268. Vector(Rc::new($seq),Rc::new(Nil))
  269. }};
  270. [$($args:expr),*] => {{
  271. let v: Vec<MalVal> = vec![$($args),*];
  272. Vector(Rc::new(v),Rc::new(Nil))
  273. }}
  274. }
  275. // type utility functions
  276. pub fn error(s: &str) -> MalRet {
  277. Err(ErrString(s.to_string()))
  278. }
  279. pub fn format_error(e: MalErr) -> String {
  280. match e {
  281. ErrString(s) => s.clone(),
  282. ErrMalVal(mv) => mv.pr_str(true),
  283. }
  284. }
  285. pub fn atom(mv: &MalVal) -> MalVal {
  286. Atom(Rc::new(RefCell::new(mv.clone())))
  287. }
  288. impl MalVal {
  289. pub fn keyword(&self) -> MalRet {
  290. match self {
  291. Str(s) if s.starts_with("\u{29e}") => Ok(Str(s.to_string())),
  292. Str(s) => Ok(Str(format!("\u{29e}{}", s))),
  293. _ => error("invalid type for keyword"),
  294. }
  295. }
  296. pub fn empty_q(&self) -> MalRet {
  297. match self {
  298. List(l, _) | Vector(l, _) => Ok(Bool(l.len() == 0)),
  299. Nil => Ok(Bool(true)),
  300. _ => error("invalid type for empty?"),
  301. }
  302. }
  303. pub fn count(&self) -> MalRet {
  304. match self {
  305. List(l, _) | Vector(l, _) => Ok(Int(l.len() as i64)),
  306. Nil => Ok(Int(0)),
  307. _ => error("invalid type for count"),
  308. }
  309. }
  310. pub fn apply(&self, args: MalArgs) -> MalRet {
  311. match *self {
  312. Func(f, _) => f(args),
  313. MalFunc {
  314. eval,
  315. ref ast,
  316. ref env,
  317. ref params,
  318. ..
  319. } => {
  320. let a = &**ast;
  321. let p = &**params;
  322. let fn_env = env_bind(Some(env.clone()), p.clone(), args)?;
  323. Ok(eval(a.clone(), fn_env)?)
  324. }
  325. _ => error("attempt to call non-function"),
  326. }
  327. }
  328. pub fn keyword_q(&self) -> bool {
  329. match self {
  330. Str(s) if s.starts_with("\u{29e}") => true,
  331. _ => false,
  332. }
  333. }
  334. pub fn deref(&self) -> MalRet {
  335. match self {
  336. Atom(a) => Ok(a.borrow().clone()),
  337. _ => error("attempt to deref a non-Atom"),
  338. }
  339. }
  340. pub fn reset_bang(&self, new: &MalVal) -> MalRet {
  341. match self {
  342. Atom(a) => {
  343. *a.borrow_mut() = new.clone();
  344. Ok(new.clone())
  345. }
  346. _ => error("attempt to reset! a non-Atom"),
  347. }
  348. }
  349. pub fn swap_bang(&self, args: &MalArgs) -> MalRet {
  350. match self {
  351. Atom(a) => {
  352. let f = &args[0];
  353. let mut fargs = args[1..].to_vec();
  354. fargs.insert(0, a.borrow().clone());
  355. *a.borrow_mut() = f.apply(fargs)?;
  356. Ok(a.borrow().clone())
  357. }
  358. _ => error("attempt to swap! a non-Atom"),
  359. }
  360. }
  361. pub fn get_meta(&self) -> MalRet {
  362. match self {
  363. List(_, meta) | Vector(_, meta) | Hash(_, meta) => Ok((&**meta).clone()),
  364. Func(_, meta) => Ok((&**meta).clone()),
  365. MalFunc { meta, .. } => Ok((&**meta).clone()),
  366. _ => error("meta not supported by type"),
  367. }
  368. }
  369. pub fn with_meta(&mut self, new_meta: &MalVal) -> MalRet {
  370. match self {
  371. List(_, ref mut meta)
  372. | Vector(_, ref mut meta)
  373. | Hash(_, ref mut meta)
  374. | Func(_, ref mut meta)
  375. | MalFunc { ref mut meta, .. } => {
  376. *meta = Rc::new((&*new_meta).clone());
  377. }
  378. _ => return error("with-meta not supported by type"),
  379. };
  380. Ok(self.clone())
  381. }
  382. }
  383. impl PartialEq for MalVal {
  384. fn eq(&self, other: &MalVal) -> bool {
  385. match (self, other) {
  386. (Nil, Nil) => true,
  387. (Bool(ref a), Bool(ref b)) => a == b,
  388. (Int(ref a), Int(ref b)) => a == b,
  389. (Str(ref a), Str(ref b)) => a == b,
  390. (Sym(ref a), Sym(ref b)) => a == b,
  391. (List(ref a, _), List(ref b, _))
  392. | (Vector(ref a, _), Vector(ref b, _))
  393. | (List(ref a, _), Vector(ref b, _))
  394. | (Vector(ref a, _), List(ref b, _)) => a == b,
  395. (Hash(ref a, _), Hash(ref b, _)) => a == b,
  396. (MalFunc { .. }, MalFunc { .. }) => false,
  397. _ => false,
  398. }
  399. }
  400. }
  401. pub fn func(f: fn(MalArgs) -> MalRet) -> MalVal {
  402. Func(f, Rc::new(Nil))
  403. }
  404. pub fn _assoc(mut hm: HashMap<String, MalVal>, kvs: MalArgs) -> MalRet {
  405. if kvs.len() % 2 != 0 {
  406. return error("odd number of elements");
  407. }
  408. for (k, v) in kvs.iter().tuples() {
  409. match k {
  410. Str(s) => {
  411. hm.insert(s.to_string(), v.clone());
  412. }
  413. _ => return error("key is not string"),
  414. }
  415. }
  416. Ok(Hash(Rc::new(hm), Rc::new(Nil)))
  417. }
  418. pub fn _dissoc(mut hm: HashMap<String, MalVal>, ks: MalArgs) -> MalRet {
  419. for k in ks.iter() {
  420. match k {
  421. Str(ref s) => {
  422. hm.remove(s);
  423. }
  424. _ => return error("key is not string"),
  425. }
  426. }
  427. Ok(Hash(Rc::new(hm), Rc::new(Nil)))
  428. }
  429. pub fn hash_map(kvs: MalArgs) -> MalRet {
  430. let hm: HashMap<String, MalVal> = HashMap::default();
  431. _assoc(hm, kvs)
  432. }