types.rs 14 KB

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