types.rs 16 KB

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