1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302
//! Used to express relation between `Statement`s
use ark_serialize::{CanonicalDeserialize, CanonicalSerialize, SerializationError};
use ark_std::{
collections::BTreeSet,
io::{Read, Write},
vec,
vec::Vec,
};
use serde::{Deserialize, Serialize};
/// Reference to a witness described as the tuple (`statement_id`, `witness_id`)
pub type WitnessRef = (usize, usize);
/// Statement describing relation between statements
#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]
pub enum MetaStatement {
WitnessEquality(EqualWitnesses),
}
#[derive(
Clone, Debug, PartialEq, Eq, CanonicalSerialize, CanonicalDeserialize, Serialize, Deserialize,
)]
pub struct MetaStatements(pub Vec<MetaStatement>);
/// Describes equality between one or more witnesses across statements. Eg. if witness 3 of statement
/// 0 is to be proven equal to witness 5 of statement 1, then its written as
/// ```
/// use ark_std::collections::BTreeSet;
/// use proof_system::statement::EqualWitnesses;
/// let mut eq = BTreeSet::new();
/// eq.insert((0, 3));
/// eq.insert((1, 5));
/// let eq_w = EqualWitnesses(eq);
/// ```
///
/// Multiple such equalities can be represented as separate `EqualWitnesses` and each will be a separate
/// `MetaStatement`
/// ```
/// // 1st witness equality
/// let mut eq_1 = BTreeSet::new();
/// eq_1.insert((0, 3));
/// eq_1.insert((1, 5));
/// let eq_1_w = EqualWitnesses(eq_1);
///
/// // 2nd witness equality
/// let mut eq_2 = BTreeSet::new();
/// eq_2.insert((0, 4));
/// eq_2.insert((1, 9));
/// let eq_2_w = EqualWitnesses(eq_2);
///
/// let mut meta_statements = MetaStatements::new();
/// meta_statements.add_witness_equality(eq_1_w);
/// meta_statements.add_witness_equality(eq_2_w);
/// ```
///
#[derive(
Clone, Debug, PartialEq, Eq, CanonicalSerialize, CanonicalDeserialize, Serialize, Deserialize,
)]
pub struct EqualWitnesses(pub BTreeSet<WitnessRef>);
impl EqualWitnesses {
/// A witness equality should have at least 2 witness references.
pub fn is_valid(&self) -> bool {
self.0.len() > 1
}
}
impl MetaStatements {
pub fn new() -> Self {
Self(Vec::new())
}
pub fn add(&mut self, item: MetaStatement) -> usize {
self.0.push(item);
self.0.len() - 1
}
pub fn add_witness_equality(&mut self, item: EqualWitnesses) -> usize {
self.add(MetaStatement::WitnessEquality(item))
}
pub fn is_empty(&self) -> bool {
self.0.is_empty()
}
pub fn len(&self) -> usize {
self.0.len()
}
/// Given multiple `MetaStatement::WitnessEquality` which might have common witness references,
/// return a list of `EqualWitnesses` with no common references. The objective is the same as
/// when given a collection of sets, return a new collection of sets such that all sets in the new
/// collection are pairwise distinct.
pub fn disjoint_witness_equalities(&self) -> Vec<EqualWitnesses> {
let mut equalities = vec![];
let mut disjoints = vec![];
for stmt in &self.0 {
match stmt {
MetaStatement::WitnessEquality(eq_wits) => {
equalities.push(eq_wits);
}
}
}
while !equalities.is_empty() {
// Traverse `equalities` in reverse as that doesn't change index on removal
let mut current_set = equalities.pop().unwrap().0.clone();
if !equalities.is_empty() {
let mut i = equalities.len() - 1;
loop {
if !current_set.is_disjoint(&equalities[i].0) {
current_set = current_set
.union(&equalities.remove(i).0)
.cloned()
.collect();
// Found new members for the current set so traverse previously traversed sets
// as well to find any sets that overlap with the newly found set
if !equalities.is_empty() {
i = equalities.len() - 1;
} else {
break;
}
continue;
}
if i == 0 {
break;
}
i -= 1;
}
}
disjoints.push(EqualWitnesses(current_set));
}
disjoints
}
}
mod serialization {
use super::*;
use ark_serialize::{Compress, Valid, Validate};
impl Valid for MetaStatement {
fn check(&self) -> Result<(), SerializationError> {
Ok(())
}
}
impl CanonicalSerialize for MetaStatement {
fn serialize_with_mode<W: Write>(
&self,
mut writer: W,
compress: Compress,
) -> Result<(), SerializationError> {
match self {
Self::WitnessEquality(s) => {
CanonicalSerialize::serialize_with_mode(&0u8, &mut writer, compress)?;
CanonicalSerialize::serialize_with_mode(s, &mut writer, compress)
}
}
}
fn serialized_size(&self, compress: Compress) -> usize {
match self {
Self::WitnessEquality(s) => {
0u8.serialized_size(compress) + s.serialized_size(compress)
}
}
}
}
impl CanonicalDeserialize for MetaStatement {
fn deserialize_with_mode<R: Read>(
mut reader: R,
compress: Compress,
validate: Validate,
) -> Result<Self, SerializationError> {
let t: u8 =
CanonicalDeserialize::deserialize_with_mode(&mut reader, compress, validate)?;
match t {
0u8 => Ok(Self::WitnessEquality(
CanonicalDeserialize::deserialize_with_mode(&mut reader, compress, validate)?,
)),
_ => Err(SerializationError::InvalidData),
}
}
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn disjoint_witness_equality() {
macro_rules! check {
($input:expr, $output: expr) => {
let mut meta_statements = MetaStatements::new();
for i in $input.into_iter() {
meta_statements.add(MetaStatement::WitnessEquality(EqualWitnesses(
i.into_iter().collect::<BTreeSet<WitnessRef>>(),
)));
}
let disjoints = meta_statements.disjoint_witness_equalities();
assert_eq!(disjoints.len(), $output.len());
for o in $output.into_iter() {
assert!(disjoints.contains({
let mut set = BTreeSet::new();
for r in o.clone().into_iter() {
set.insert(r);
}
&EqualWitnesses(set)
}));
}
};
}
check!(
vec![
vec![(0, 1), (1, 1)],
vec![(0, 1), (1, 2)],
vec![(0, 3), (1, 4)]
],
vec![vec![(0, 1), (1, 1), (1, 2)], vec![(0, 3), (1, 4)],]
);
check!(
vec![
vec![(0, 1), (1, 1)],
vec![(0, 5), (1, 2)],
vec![(0, 3), (1, 4)],
],
vec![
vec![(0, 1), (1, 1)],
vec![(0, 5), (1, 2)],
vec![(0, 3), (1, 4)]
]
);
check!(
vec![
vec![(0, 1), (1, 1), (2, 1)],
vec![(0, 5), (1, 2), (3, 1)],
vec![(0, 3), (1, 4), (1, 1), (3, 1)],
],
vec![vec![
(0, 1),
(1, 1),
(2, 1),
(0, 5),
(1, 2),
(3, 1),
(0, 3),
(1, 4)
]]
);
check!(
vec![
vec![(1, 1), (4, 1)],
vec![(1, 2), (6, 5)],
vec![(0, 3), (1, 4), (2, 1), (3, 1), (5, 2)],
vec![(0, 0), (1, 9), (5, 5), (6, 1)],
vec![(0, 0), (1, 9), (5, 6), (6, 6)]
],
vec![
vec![(4, 1), (1, 1)],
vec![(6, 5), (1, 2)],
vec![(0, 3), (1, 4), (2, 1), (3, 1), (5, 2)],
vec![(0, 0), (1, 9), (5, 5), (5, 6), (6, 1), (6, 6)],
]
);
check!(
vec![
vec![(0, 2), (1, 3)],
vec![(0, 3), (1, 4), (2, 0), (5, 0)],
vec![(2, 0), (5, 0)],
vec![(3, 0), (6, 0)],
vec![(4, 0), (7, 0)]
],
vec![
vec![(0, 2), (1, 3)],
vec![(0, 3), (1, 4), (2, 0), (5, 0)],
vec![(3, 0), (6, 0)],
vec![(4, 0), (7, 0)],
]
);
check!(
vec![
vec![(0, 1), (2, 0)],
vec![(0, 5), (1, 2)],
vec![(0, 5), (3, 0)],
vec![(1, 3), (5, 0)],
vec![(1, 2), (4, 0)],
],
vec![
vec![(0, 1), (2, 0)],
vec![(0, 5), (1, 2), (3, 0), (4, 0)],
vec![(1, 3), (5, 0)]
]
);
}
}