types.rs 16 KB

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