mirror of
https://github.com/circify/circ.git
synced 2026-01-12 15:18:22 -05:00
406 lines
13 KiB
Rust
406 lines
13 KiB
Rust
#![allow(unused_imports)]
|
|
#[cfg(feature = "r1cs")]
|
|
use bellman::gadgets::test::TestConstraintSystem;
|
|
#[cfg(feature = "r1cs")]
|
|
use bellman::groth16::{
|
|
create_random_proof, generate_parameters, generate_random_parameters, prepare_verifying_key,
|
|
verify_proof, Parameters, Proof, VerifyingKey,
|
|
};
|
|
#[cfg(feature = "r1cs")]
|
|
use bellman::Circuit;
|
|
use bls12_381::{Bls12, Scalar};
|
|
#[cfg(feature = "c")]
|
|
use circ::front::c::{self, C};
|
|
use circ::front::datalog::{self, Datalog};
|
|
#[cfg(all(feature = "smt", feature = "zok"))]
|
|
use circ::front::zsharp::{self, ZSharpFE};
|
|
use circ::front::{FrontEnd, Mode};
|
|
use circ::ir::{
|
|
opt::{opt, Opt},
|
|
term::extras::Letified,
|
|
};
|
|
use circ::target::aby::trans::to_aby;
|
|
use circ::target::fhe::trans::to_fhe;
|
|
#[cfg(feature = "lp")]
|
|
use circ::target::ilp::trans::to_ilp;
|
|
#[cfg(feature = "r1cs")]
|
|
use circ::target::r1cs::bellman::parse_instance;
|
|
use circ::target::r1cs::opt::reduce_linearities;
|
|
use circ::target::r1cs::trans::to_r1cs;
|
|
#[cfg(feature = "smt")]
|
|
use circ::target::smt::find_model;
|
|
use circ::util::field::DFL_T;
|
|
use circ_fields::FieldT;
|
|
#[cfg(feature = "lp")]
|
|
use good_lp::default_solver;
|
|
use std::fs::File;
|
|
use std::io::Read;
|
|
use std::io::Write;
|
|
use std::path::{Path, PathBuf};
|
|
use structopt::clap::arg_enum;
|
|
use structopt::StructOpt;
|
|
|
|
#[derive(Debug, StructOpt)]
|
|
#[structopt(name = "circ", about = "CirC: the circuit compiler")]
|
|
struct Options {
|
|
/// Input file
|
|
#[structopt(parse(from_os_str), name = "PATH")]
|
|
path: PathBuf,
|
|
|
|
#[structopt(flatten)]
|
|
frontend: FrontendOptions,
|
|
|
|
/// Number of parties for an MPC.
|
|
#[structopt(long, default_value = "2", name = "PARTIES")]
|
|
parties: u8,
|
|
|
|
#[structopt(subcommand)]
|
|
backend: Backend,
|
|
}
|
|
|
|
#[derive(Debug, StructOpt)]
|
|
struct FrontendOptions {
|
|
/// Input language
|
|
#[structopt(long, default_value = "auto", name = "LANG")]
|
|
language: Language,
|
|
|
|
/// Value threshold
|
|
#[structopt(long)]
|
|
value_threshold: Option<u64>,
|
|
|
|
/// File with input witness
|
|
#[allow(dead_code)]
|
|
#[structopt(long, name = "FILE", parse(from_os_str))]
|
|
inputs: Option<PathBuf>,
|
|
|
|
/// How many recursions to allow (datalog)
|
|
#[structopt(short, long, name = "N", default_value = "5")]
|
|
rec_limit: usize,
|
|
|
|
/// Lint recursions that are allegedly primitive recursive (datalog)
|
|
#[structopt(long)]
|
|
lint_prim_rec: bool,
|
|
}
|
|
|
|
#[derive(Debug, StructOpt)]
|
|
enum Backend {
|
|
#[allow(dead_code)]
|
|
R1cs {
|
|
#[structopt(long, default_value = "P", parse(from_os_str))]
|
|
prover_key: PathBuf,
|
|
#[structopt(long, default_value = "V", parse(from_os_str))]
|
|
verifier_key: PathBuf,
|
|
#[structopt(long, default_value = "pi", parse(from_os_str))]
|
|
proof: PathBuf,
|
|
#[structopt(long, default_value = "x", parse(from_os_str))]
|
|
instance: PathBuf,
|
|
#[structopt(long, default_value = "50")]
|
|
/// linear combination constraints up to this size will be eliminated
|
|
lc_elimination_thresh: usize,
|
|
#[structopt(long, default_value = "count")]
|
|
action: ProofAction,
|
|
},
|
|
Smt {},
|
|
Ilp {},
|
|
Fhe {},
|
|
Mpc {
|
|
#[structopt(long, default_value = "hycc", name = "cost_model")]
|
|
cost_model: String,
|
|
#[structopt(long, default_value = "lp", name = "selection_scheme")]
|
|
selection_scheme: String,
|
|
},
|
|
}
|
|
|
|
arg_enum! {
|
|
#[derive(PartialEq, Debug)]
|
|
enum Language {
|
|
Zsharp,
|
|
Datalog,
|
|
C,
|
|
Auto,
|
|
}
|
|
}
|
|
|
|
#[derive(PartialEq, Debug)]
|
|
pub enum DeterminedLanguage {
|
|
Zsharp,
|
|
Datalog,
|
|
C,
|
|
}
|
|
|
|
#[derive(PartialEq, Debug)]
|
|
pub enum CostModelType {
|
|
Opa,
|
|
Hycc,
|
|
}
|
|
|
|
arg_enum! {
|
|
#[derive(PartialEq, Debug)]
|
|
enum ProofAction {
|
|
Count,
|
|
Prove,
|
|
Setup,
|
|
Verify,
|
|
}
|
|
}
|
|
|
|
arg_enum! {
|
|
#[derive(PartialEq, Debug)]
|
|
enum ProofOption {
|
|
Count,
|
|
Prove,
|
|
}
|
|
}
|
|
|
|
fn determine_language(l: &Language, input_path: &Path) -> DeterminedLanguage {
|
|
match *l {
|
|
Language::Datalog => DeterminedLanguage::Datalog,
|
|
Language::Zsharp => DeterminedLanguage::Zsharp,
|
|
Language::C => DeterminedLanguage::C,
|
|
Language::Auto => {
|
|
let p = input_path.to_str().unwrap();
|
|
if p.ends_with(".zok") {
|
|
DeterminedLanguage::Zsharp
|
|
} else if p.ends_with(".pl") {
|
|
DeterminedLanguage::Datalog
|
|
} else if p.ends_with(".c") || p.ends_with(".cpp") || p.ends_with(".cc") {
|
|
DeterminedLanguage::C
|
|
} else {
|
|
println!("Could not deduce the input language from path '{}', please set the language manually", p);
|
|
std::process::exit(2)
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
fn main() {
|
|
env_logger::Builder::from_default_env()
|
|
.format_level(false)
|
|
.format_timestamp(None)
|
|
.init();
|
|
let options = Options::from_args();
|
|
let path_buf = options.path.clone();
|
|
println!("{:?}", options);
|
|
let mode = match options.backend {
|
|
Backend::R1cs { .. } => match options.frontend.value_threshold {
|
|
Some(t) => Mode::ProofOfHighValue(t),
|
|
None => Mode::Proof,
|
|
},
|
|
Backend::Ilp { .. } => Mode::Opt,
|
|
Backend::Mpc { .. } => Mode::Mpc(options.parties),
|
|
Backend::Smt { .. } => Mode::Proof,
|
|
Backend::Fhe { .. } => Mode::Fhe,
|
|
};
|
|
let language = determine_language(&options.frontend.language, &options.path);
|
|
let cs = match language {
|
|
#[cfg(all(feature = "smt", feature = "zok"))]
|
|
DeterminedLanguage::Zsharp => {
|
|
let inputs = zsharp::Inputs {
|
|
file: options.path,
|
|
inputs: options.frontend.inputs,
|
|
mode,
|
|
};
|
|
ZSharpFE::gen(inputs)
|
|
}
|
|
#[cfg(not(all(feature = "smt", feature = "zok")))]
|
|
DeterminedLanguage::Zsharp => {
|
|
panic!("Missing feature: smt,zok");
|
|
}
|
|
DeterminedLanguage::Datalog => {
|
|
let inputs = datalog::Inputs {
|
|
file: options.path,
|
|
rec_limit: options.frontend.rec_limit,
|
|
lint_prim_rec: options.frontend.lint_prim_rec,
|
|
};
|
|
Datalog::gen(inputs)
|
|
}
|
|
#[cfg(feature = "c")]
|
|
DeterminedLanguage::C => {
|
|
let inputs = c::Inputs {
|
|
file: options.path,
|
|
inputs: options.frontend.inputs,
|
|
mode,
|
|
};
|
|
C::gen(inputs)
|
|
}
|
|
#[cfg(not(feature = "c"))]
|
|
DeterminedLanguage::C => {
|
|
panic!("Missing feature: c");
|
|
}
|
|
};
|
|
let cs = match mode {
|
|
Mode::Opt => opt(cs, vec![Opt::ScalarizeVars, Opt::ConstantFold]),
|
|
Mode::Mpc(_) => opt(
|
|
cs,
|
|
vec![
|
|
Opt::Sha,
|
|
Opt::ConstantFold,
|
|
Opt::ScalarizeVars,
|
|
Opt::ConstantFold,
|
|
// The obliv elim pass produces more tuples, that must be eliminated
|
|
Opt::Obliv,
|
|
Opt::Tuple,
|
|
// The linear scan pass produces more tuples, that must be eliminated
|
|
Opt::LinearScan,
|
|
Opt::Tuple,
|
|
Opt::ConstantFold,
|
|
// Binarize nary terms
|
|
Opt::Binarize,
|
|
],
|
|
// vec![Opt::Sha, Opt::ConstantFold, Opt::Mem, Opt::ConstantFold],
|
|
),
|
|
Mode::Fhe => opt(cs, vec![Opt::ConstantFold]),
|
|
Mode::Proof | Mode::ProofOfHighValue(_) => opt(
|
|
cs,
|
|
vec![
|
|
Opt::ScalarizeVars,
|
|
Opt::Flatten,
|
|
Opt::Sha,
|
|
Opt::ConstantFold,
|
|
Opt::Flatten,
|
|
Opt::Inline,
|
|
// Tuples must be eliminated before oblivious array elim
|
|
Opt::Tuple,
|
|
Opt::ConstantFold,
|
|
Opt::Obliv,
|
|
// The obliv elim pass produces more tuples, that must be eliminated
|
|
Opt::Tuple,
|
|
Opt::LinearScan,
|
|
// The linear scan pass produces more tuples, that must be eliminated
|
|
Opt::Tuple,
|
|
Opt::Flatten,
|
|
Opt::ConstantFold,
|
|
Opt::Inline,
|
|
],
|
|
),
|
|
};
|
|
println!("Done with IR optimization");
|
|
|
|
match options.backend {
|
|
#[cfg(feature = "r1cs")]
|
|
Backend::R1cs {
|
|
action,
|
|
proof,
|
|
prover_key,
|
|
verifier_key,
|
|
instance,
|
|
lc_elimination_thresh,
|
|
..
|
|
} => {
|
|
println!("Converting to r1cs");
|
|
let r1cs = to_r1cs(cs, FieldT::from(DFL_T.modulus()));
|
|
println!("Pre-opt R1cs size: {}", r1cs.constraints().len());
|
|
let r1cs = reduce_linearities(r1cs, Some(lc_elimination_thresh));
|
|
println!("Final R1cs size: {}", r1cs.constraints().len());
|
|
match action {
|
|
ProofAction::Count => (),
|
|
ProofAction::Prove => {
|
|
println!("Proving");
|
|
r1cs.check_all();
|
|
let rng = &mut rand::thread_rng();
|
|
let mut pk_file = File::open(prover_key).unwrap();
|
|
let pk = Parameters::<Bls12>::read(&mut pk_file, false).unwrap();
|
|
let pf = create_random_proof(&r1cs, &pk, rng).unwrap();
|
|
let mut pf_file = File::create(proof).unwrap();
|
|
pf.write(&mut pf_file).unwrap();
|
|
}
|
|
ProofAction::Setup => {
|
|
let rng = &mut rand::thread_rng();
|
|
let p =
|
|
generate_random_parameters::<bls12_381::Bls12, _, _>(&r1cs, rng).unwrap();
|
|
let mut pk_file = File::create(prover_key).unwrap();
|
|
p.write(&mut pk_file).unwrap();
|
|
let mut vk_file = File::create(verifier_key).unwrap();
|
|
p.vk.write(&mut vk_file).unwrap();
|
|
}
|
|
ProofAction::Verify => {
|
|
println!("Verifying");
|
|
let mut vk_file = File::open(verifier_key).unwrap();
|
|
let vk = VerifyingKey::<Bls12>::read(&mut vk_file).unwrap();
|
|
let pvk = prepare_verifying_key(&vk);
|
|
let mut pf_file = File::open(proof).unwrap();
|
|
let pf = Proof::read(&mut pf_file).unwrap();
|
|
let instance_vec = parse_instance(&instance);
|
|
verify_proof(&pvk, &pf, &instance_vec).unwrap();
|
|
}
|
|
}
|
|
}
|
|
#[cfg(not(feature = "r1cs"))]
|
|
Backend::R1cs { .. } => {
|
|
panic!("Missing feature: r1cs");
|
|
}
|
|
Backend::Mpc {
|
|
cost_model,
|
|
selection_scheme,
|
|
} => {
|
|
println!("Converting to aby");
|
|
let lang_str = match language {
|
|
DeterminedLanguage::C => "c".to_string(),
|
|
DeterminedLanguage::Zsharp => "zok".to_string(),
|
|
_ => panic!("Language isn't supported by MPC backend: {:#?}", language),
|
|
};
|
|
println!("Cost model: {}", cost_model);
|
|
println!("Selection scheme: {}", selection_scheme);
|
|
to_aby(cs, &path_buf, &lang_str, &cost_model, &selection_scheme);
|
|
}
|
|
#[cfg(feature = "lp")]
|
|
Backend::Ilp { .. } => {
|
|
println!("Converting to ilp");
|
|
let ilp = to_ilp(cs);
|
|
let solver_result = ilp.solve(default_solver);
|
|
let (max, vars) = solver_result.expect("ILP could not be solved");
|
|
println!("Max value: {}", max.round() as u64);
|
|
println!("Assignment:");
|
|
for (var, val) in &vars {
|
|
println!(" {}: {}", var, val.round() as u64);
|
|
}
|
|
let mut f = File::create("assignment.txt").unwrap();
|
|
for (var, val) in &vars {
|
|
if var.contains("f0") {
|
|
let i = var.find("f0").unwrap();
|
|
let s = &var[i + 8..];
|
|
let e = s.find('_').unwrap();
|
|
writeln!(f, "{} {}", &s[..e], val.round() as u64).unwrap();
|
|
}
|
|
}
|
|
}
|
|
#[cfg(not(feature = "lp"))]
|
|
Backend::Ilp { .. } => {
|
|
panic!("Missing feature: lp");
|
|
}
|
|
#[cfg(feature = "smt")]
|
|
Backend::Smt { .. } => {
|
|
if options.frontend.lint_prim_rec {
|
|
assert_eq!(cs.outputs.len(), 1);
|
|
match find_model(&cs.outputs[0]) {
|
|
Some(m) => {
|
|
println!("Not primitive recursive!");
|
|
for (var, val) in m {
|
|
println!("{} -> {}", var, val);
|
|
}
|
|
std::process::exit(1)
|
|
}
|
|
None => {
|
|
println!("Primitive recursive");
|
|
}
|
|
}
|
|
} else {
|
|
todo!()
|
|
}
|
|
}
|
|
Backend::Fhe { .. } => {
|
|
println!("Converting to fhe");
|
|
let lang_str = match language {
|
|
DeterminedLanguage::C => "c".to_string(),
|
|
DeterminedLanguage::Zsharp => "zok".to_string(),
|
|
_ => panic!("Language isn't supported by FHE backend: {:#?}", language),
|
|
};
|
|
to_fhe(cs, &path_buf, &lang_str);
|
|
}
|
|
#[cfg(not(feature = "smt"))]
|
|
Backend::Smt { .. } => {
|
|
panic!("Missing feature: smt");
|
|
}
|
|
}
|
|
}
|