types.rs 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413
  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. if let MalVal::ZKScalar(val) = value {
  130. left = left + (*val, val_b);
  131. }
  132. }
  133. }
  134. println!("left: a {:?} b {:?} val_b: {:?}", a, b, val_b);
  135. }
  136. for values in alloc_value.right.iter() {
  137. let (a, b) = values;
  138. let mut val_b = CS::one();
  139. if b != "cs::one" {
  140. println!("{:?}", b);
  141. val_b = *variables.get(b).unwrap();
  142. }
  143. if a == "scalar::one" {
  144. right = right + (coeff, val_b);
  145. } else if a == "scalar::one::neg" {
  146. right = right + (coeff.neg(), val_b);
  147. } else {
  148. if let Some(value) = params_const.get(a) {
  149. if let MalVal::ZKScalar(val) = value {
  150. right = right + (*val, val_b);
  151. }
  152. }
  153. }
  154. println!("right: a {:?} b {:?} val_b: {:?}", a, b, val_b);
  155. }
  156. for values in alloc_value.output.iter() {
  157. let (a, b) = values;
  158. let mut val_b = CS::one();
  159. if b != "cs::one" {
  160. val_b = *variables.get(b).unwrap();
  161. }
  162. if a == "scalar::one" {
  163. output = output + (coeff, val_b);
  164. } else if a == "scalar::one::neg" {
  165. output = output + (coeff.neg(), val_b);
  166. } else {
  167. if let Some(value) = params_const.get(a) {
  168. if let MalVal::ZKScalar(val) = value {
  169. output = output + (*val, val_b);
  170. }
  171. }
  172. }
  173. println!("output: a {:?} b {:?} val_b: {:?}", a, b, val_b);
  174. }
  175. // println!("Enforcing ...");
  176. cs.enforce(
  177. || "constraint",
  178. |_| left.clone(),
  179. |_| right.clone(),
  180. |_| output.clone(),
  181. );
  182. }
  183. Ok(())
  184. }
  185. }
  186. #[derive(Debug)]
  187. pub enum MalErr {
  188. ErrString(String),
  189. ErrMalVal(MalVal),
  190. }
  191. impl From<SynthesisError> for MalErr {
  192. fn from(err: SynthesisError) -> MalErr {
  193. ErrString(err.to_string())
  194. }
  195. }
  196. pub type MalArgs = Vec<MalVal>;
  197. pub type MalRet = Result<MalVal, MalErr>;
  198. // type utility macros
  199. macro_rules! list {
  200. ($seq:expr) => {{
  201. List(Rc::new($seq),Rc::new(Nil))
  202. }};
  203. [$($args:expr),*] => {{
  204. let v: Vec<MalVal> = vec![$($args),*];
  205. List(Rc::new(v),Rc::new(Nil))
  206. }}
  207. }
  208. macro_rules! vector {
  209. ($seq:expr) => {{
  210. Vector(Rc::new($seq),Rc::new(Nil))
  211. }};
  212. [$($args:expr),*] => {{
  213. let v: Vec<MalVal> = vec![$($args),*];
  214. Vector(Rc::new(v),Rc::new(Nil))
  215. }}
  216. }
  217. // type utility functions
  218. pub fn error(s: &str) -> MalRet {
  219. Err(ErrString(s.to_string()))
  220. }
  221. pub fn format_error(e: MalErr) -> String {
  222. match e {
  223. ErrString(s) => s.clone(),
  224. ErrMalVal(mv) => mv.pr_str(true),
  225. }
  226. }
  227. pub fn atom(mv: &MalVal) -> MalVal {
  228. Atom(Rc::new(RefCell::new(mv.clone())))
  229. }
  230. impl MalVal {
  231. pub fn keyword(&self) -> MalRet {
  232. match self {
  233. Str(s) if s.starts_with("\u{29e}") => Ok(Str(s.to_string())),
  234. Str(s) => Ok(Str(format!("\u{29e}{}", s))),
  235. _ => error("invalid type for keyword"),
  236. }
  237. }
  238. pub fn empty_q(&self) -> MalRet {
  239. match self {
  240. List(l, _) | Vector(l, _) => Ok(Bool(l.len() == 0)),
  241. Nil => Ok(Bool(true)),
  242. _ => error("invalid type for empty?"),
  243. }
  244. }
  245. pub fn count(&self) -> MalRet {
  246. match self {
  247. List(l, _) | Vector(l, _) => Ok(Int(l.len() as i64)),
  248. Nil => Ok(Int(0)),
  249. _ => error("invalid type for count"),
  250. }
  251. }
  252. pub fn apply(&self, args: MalArgs) -> MalRet {
  253. match *self {
  254. Func(f, _) => f(args),
  255. MalFunc {
  256. eval,
  257. ref ast,
  258. ref env,
  259. ref params,
  260. ..
  261. } => {
  262. let a = &**ast;
  263. let p = &**params;
  264. let fn_env = env_bind(Some(env.clone()), p.clone(), args)?;
  265. Ok(eval(a.clone(), fn_env)?)
  266. }
  267. _ => error("attempt to call non-function"),
  268. }
  269. }
  270. pub fn keyword_q(&self) -> bool {
  271. match self {
  272. Str(s) if s.starts_with("\u{29e}") => true,
  273. _ => false,
  274. }
  275. }
  276. pub fn deref(&self) -> MalRet {
  277. match self {
  278. Atom(a) => Ok(a.borrow().clone()),
  279. _ => error("attempt to deref a non-Atom"),
  280. }
  281. }
  282. pub fn reset_bang(&self, new: &MalVal) -> MalRet {
  283. match self {
  284. Atom(a) => {
  285. *a.borrow_mut() = new.clone();
  286. Ok(new.clone())
  287. }
  288. _ => error("attempt to reset! a non-Atom"),
  289. }
  290. }
  291. pub fn swap_bang(&self, args: &MalArgs) -> MalRet {
  292. match self {
  293. Atom(a) => {
  294. let f = &args[0];
  295. let mut fargs = args[1..].to_vec();
  296. fargs.insert(0, a.borrow().clone());
  297. *a.borrow_mut() = f.apply(fargs)?;
  298. Ok(a.borrow().clone())
  299. }
  300. _ => error("attempt to swap! a non-Atom"),
  301. }
  302. }
  303. pub fn get_meta(&self) -> MalRet {
  304. match self {
  305. List(_, meta) | Vector(_, meta) | Hash(_, meta) => Ok((&**meta).clone()),
  306. Func(_, meta) => Ok((&**meta).clone()),
  307. MalFunc { meta, .. } => Ok((&**meta).clone()),
  308. _ => error("meta not supported by type"),
  309. }
  310. }
  311. pub fn with_meta(&mut self, new_meta: &MalVal) -> MalRet {
  312. match self {
  313. List(_, ref mut meta)
  314. | Vector(_, ref mut meta)
  315. | Hash(_, ref mut meta)
  316. | Func(_, ref mut meta)
  317. | MalFunc { ref mut meta, .. } => {
  318. *meta = Rc::new((&*new_meta).clone());
  319. }
  320. _ => return error("with-meta not supported by type"),
  321. };
  322. Ok(self.clone())
  323. }
  324. }
  325. impl PartialEq for MalVal {
  326. fn eq(&self, other: &MalVal) -> bool {
  327. match (self, other) {
  328. (Nil, Nil) => true,
  329. (Bool(ref a), Bool(ref b)) => a == b,
  330. (Int(ref a), Int(ref b)) => a == b,
  331. (Str(ref a), Str(ref b)) => a == b,
  332. (Sym(ref a), Sym(ref b)) => a == b,
  333. (List(ref a, _), List(ref b, _))
  334. | (Vector(ref a, _), Vector(ref b, _))
  335. | (List(ref a, _), Vector(ref b, _))
  336. | (Vector(ref a, _), List(ref b, _)) => a == b,
  337. (Hash(ref a, _), Hash(ref b, _)) => a == b,
  338. (MalFunc { .. }, MalFunc { .. }) => false,
  339. _ => false,
  340. }
  341. }
  342. }
  343. pub fn func(f: fn(MalArgs) -> MalRet) -> MalVal {
  344. Func(f, Rc::new(Nil))
  345. }
  346. pub fn _assoc(mut hm: FnvHashMap<String, MalVal>, kvs: MalArgs) -> MalRet {
  347. if kvs.len() % 2 != 0 {
  348. return error("odd number of elements");
  349. }
  350. for (k, v) in kvs.iter().tuples() {
  351. match k {
  352. Str(s) => {
  353. hm.insert(s.to_string(), v.clone());
  354. }
  355. _ => return error("key is not string"),
  356. }
  357. }
  358. Ok(Hash(Rc::new(hm), Rc::new(Nil)))
  359. }
  360. pub fn _dissoc(mut hm: FnvHashMap<String, MalVal>, ks: MalArgs) -> MalRet {
  361. for k in ks.iter() {
  362. match k {
  363. Str(ref s) => {
  364. hm.remove(s);
  365. }
  366. _ => return error("key is not string"),
  367. }
  368. }
  369. Ok(Hash(Rc::new(hm), Rc::new(Nil)))
  370. }
  371. pub fn hash_map(kvs: MalArgs) -> MalRet {
  372. let hm: FnvHashMap<String, MalVal> = FnvHashMap::default();
  373. _assoc(hm, kvs)
  374. }