types.rs 15 KB

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