types.rs 14 KB

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