pub struct Update<T: BigInt> { /* private fields */ }Expand description
A sum of updates to be applied to witnesses.
Implementations§
source§impl<'u, T: 'u + BigInt> Update<T>
impl<'u, T: 'u + BigInt> Update<T>
sourcepub fn new(acc: &Accumulator<T>) -> Self
pub fn new(acc: &Accumulator<T>) -> Self
Create a new batched update.
sourcepub fn update_witness(&self, x: &T, w: &T) -> T
pub fn update_witness(&self, x: &T, w: &T) -> T
Update a witness. The update will include all additions and deletions previously absorbed into this update struct.
use clacc::{
Accumulator,
Update,
};
use num_bigint::BigInt;
// In this example, the update will include a deletion, so the
// accumulator must be created with a private key.
let p = vec![0x3d];
let q = vec![0x35];
let mut acc = Accumulator::<BigInt>::with_private_key(
<BigInt as clacc::BigInt>::from_bytes_be(p.as_slice()),
<BigInt as clacc::BigInt>::from_bytes_be(q.as_slice()),
);
// Create the static elements.
let xs = <BigInt as clacc::BigInt>::from_i64(5);
// Create the deletion.
let xd = <BigInt as clacc::BigInt>::from_i64(7);
// Create the addition.
let xa = <BigInt as clacc::BigInt>::from_i64(11);
// Add the deletion element.
acc.add(&xd);
// Add the static element to the accumulator.
let mut wxs = acc.add(&xs);
// Delete the deletion element from the accumulator.
acc.prove(&xd).unwrap();
acc.del(&xd).unwrap();
// Add the addition element to the accumulator.
acc.add(&xa);
// Create an update object and absorb the addition and deletion.
let mut u = Update::new(&acc);
u.del(&xd);
u.add(&xa);
// Update the static element's witness.
wxs = u.update_witness(&xs, &wxs);
assert!(acc.verify(&xs, &wxs).is_ok());sourcepub fn update_witnesses<IA: Iterator<Item = &'u mut (T, T)> + Send, IS: Iterator<Item = &'u mut (T, T)> + Send>(
&self,
additions: Arc<Mutex<IA>>,
staticels: Arc<Mutex<IS>>
)
pub fn update_witnesses<IA: Iterator<Item = &'u mut (T, T)> + Send, IS: Iterator<Item = &'u mut (T, T)> + Send>( &self, additions: Arc<Mutex<IA>>, staticels: Arc<Mutex<IS>> )
Thread-safe method that updates multiple witnesses.
It is assumed that the additional elements have been absorbed by the update and that their witnesses are the accumulator’s value before any of the additions or deletions absorbed by this update were applied. Updating the witnesses for each of these additional elements is thus achieved by simply removing its respective element from the update and applying the result to its witness.
This method operates on atomic references to iterators over collections of element-witness pairs. An invocation will run until the referenced iterators have reached the end of their collections. To update witnesses concurrently, simply invoke this method from multiple threads using references to the same iterators.
use clacc::{
Accumulator,
BigInt as BigIntTrait,
Update,
};
use num_bigint::BigInt;
use crossbeam::thread;
use num_cpus;
use rand::RngCore;
use std::sync::{Arc, Mutex};
// Create elements.
const BUCKET_SIZE: usize = 20;
const DELETIONS_COUNT: usize = 2;
const ADDITIONS_COUNT: usize = 10;
const STATICELS_COUNT: usize = BUCKET_SIZE - DELETIONS_COUNT;
let mut deletions: Vec<(BigInt, BigInt)> = vec![
Default::default(); DELETIONS_COUNT
];
let mut additions: Vec<(BigInt, BigInt)> = vec![
Default::default(); ADDITIONS_COUNT
];
let mut staticels: Vec<(BigInt, BigInt)> = vec![
Default::default(); STATICELS_COUNT
];
let mut rng = rand::thread_rng();
let mut bytes = vec![0; 8];
for deletion in deletions.iter_mut() {
rng.fill_bytes(&mut bytes);
let x = <BigInt as clacc::BigInt>::from_bytes_be(bytes.as_slice());
deletion.0 = x.next_prime();
}
for addition in additions.iter_mut() {
rng.fill_bytes(&mut bytes);
let x = <BigInt as clacc::BigInt>::from_bytes_be(bytes.as_slice());
addition.0 = x.next_prime();
}
for staticel in staticels.iter_mut() {
rng.fill_bytes(&mut bytes);
let x = <BigInt as clacc::BigInt>::from_bytes_be(bytes.as_slice());
staticel.0 = x.next_prime();
}
// Create accumulator with private key.
let p = vec![0x3d];
let q = vec![0x35];
let mut acc = Accumulator::<BigInt>::with_private_key(
<BigInt as clacc::BigInt>::from_bytes_be(p.as_slice()),
<BigInt as clacc::BigInt>::from_bytes_be(q.as_slice()),
);
// Accumulate elements.
for (x, _) in deletions.iter() {
acc.add(&x);
}
for (x, _) in staticels.iter() {
acc.add(&x);
}
// Generate witnesses for static elements.
for (x, w) in staticels.iter_mut() {
*w = acc.prove(&x).unwrap()
}
// Save accumulation at current state.
let prev = acc.clone();
// Accumulate deletions.
for (x, w) in deletions.iter_mut() {
*w = acc.prove(&x).unwrap();
acc.del(&x).unwrap();
}
// Accumulate additions.
for (x, w) in additions.iter_mut() {
acc.add(&x);
// Use the saved accumulation as the witness value.
*w = prev.get_value();
}
// Batch updates.
let mut update = Update::new(&acc);
for (x, _) in deletions.iter() {
update.del(&x);
}
for (x, _) in additions.iter() {
update.add(&x);
}
// Update all witnesses concurrently.
let additions_iter = Arc::new(Mutex::new(additions.iter_mut()));
let staticels_iter = Arc::new(Mutex::new(staticels.iter_mut()));
thread::scope(|scope| {
for _ in 0..num_cpus::get() {
let u = update.clone();
let add = Arc::clone(&additions_iter);
let sta = Arc::clone(&staticels_iter);
scope.spawn(move |_| u.update_witnesses(add, sta));
}
}).unwrap();
// Verify all updated witnesses.
for (x, w) in additions.iter() {
assert!(acc.verify(&x, &w).is_ok());
}
for (x, w) in staticels.iter() {
assert!(acc.verify(&x, &w).is_ok());
}Trait Implementations§
Auto Trait Implementations§
impl<T> RefUnwindSafe for Update<T>where T: RefUnwindSafe,
impl<T> Send for Update<T>
impl<T> Sync for Update<T>
impl<T> Unpin for Update<T>where T: Unpin,
impl<T> UnwindSafe for Update<T>where T: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
§impl<T> Conv for T
impl<T> Conv for T
§impl<T> FmtForward for T
impl<T> FmtForward for T
§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where Self: Binary,
self to use its Binary implementation when Debug-formatted.§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where Self: Display,
self to use its Display implementation when
Debug-formatted.§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where Self: LowerExp,
self to use its LowerExp implementation when
Debug-formatted.§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where Self: LowerHex,
self to use its LowerHex implementation when
Debug-formatted.§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where Self: Octal,
self to use its Octal implementation when Debug-formatted.§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where Self: Pointer,
self to use its Pointer implementation when
Debug-formatted.§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where Self: UpperExp,
self to use its UpperExp implementation when
Debug-formatted.§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where Self: UpperHex,
self to use its UpperHex implementation when
Debug-formatted.§fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
fn fmt_list(self) -> FmtList<Self>where &'a Self: for<'a> IntoIterator,
§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere T: ?Sized,
§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere Self: Sized,
§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere R: 'a,
self and passes that borrow into the pipe function. Read more§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere R: 'a,
self and passes that borrow into the pipe function. Read more§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> Rwhere
Self: Borrow<B>,
B: 'a + ?Sized,
R: 'a,
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> Rwhere Self: Borrow<B>, B: 'a + ?Sized, R: 'a,
§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R
) -> Rwhere
Self: BorrowMut<B>,
B: 'a + ?Sized,
R: 'a,
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R ) -> Rwhere Self: BorrowMut<B>, B: 'a + ?Sized, R: 'a,
§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> Rwhere
Self: AsRef<U>,
U: 'a + ?Sized,
R: 'a,
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> Rwhere Self: AsRef<U>, U: 'a + ?Sized, R: 'a,
self, then passes self.as_ref() into the pipe function.§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> Rwhere
Self: AsMut<U>,
U: 'a + ?Sized,
R: 'a,
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> Rwhere Self: AsMut<U>, U: 'a + ?Sized, R: 'a,
self, then passes self.as_mut() into the pipe
function.§impl<T> Tap for T
impl<T> Tap for T
§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Selfwhere
Self: Borrow<B>,
B: ?Sized,
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Selfwhere Self: Borrow<B>, B: ?Sized,
Borrow<B> of a value. Read more§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Selfwhere
Self: BorrowMut<B>,
B: ?Sized,
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Selfwhere Self: BorrowMut<B>, B: ?Sized,
BorrowMut<B> of a value. Read more§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Selfwhere
Self: AsRef<R>,
R: ?Sized,
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Selfwhere Self: AsRef<R>, R: ?Sized,
AsRef<R> view of a value. Read more§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Selfwhere
Self: AsMut<R>,
R: ?Sized,
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Selfwhere Self: AsMut<R>, R: ?Sized,
AsMut<R> view of a value. Read more§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Selfwhere
Self: Deref<Target = T>,
T: ?Sized,
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Selfwhere Self: Deref<Target = T>, T: ?Sized,
Deref::Target of a value. Read more§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Selfwhere
Self: DerefMut<Target = T> + Deref,
T: ?Sized,
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Selfwhere Self: DerefMut<Target = T> + Deref, T: ?Sized,
Deref::Target of a value. Read more§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
.tap() only in debug builds, and is erased in release builds.§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
.tap_mut() only in debug builds, and is erased in release
builds.§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Selfwhere
Self: Borrow<B>,
B: ?Sized,
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Selfwhere Self: Borrow<B>, B: ?Sized,
.tap_borrow() only in debug builds, and is erased in release
builds.§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Selfwhere
Self: BorrowMut<B>,
B: ?Sized,
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Selfwhere Self: BorrowMut<B>, B: ?Sized,
.tap_borrow_mut() only in debug builds, and is erased in release
builds.§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Selfwhere
Self: AsRef<R>,
R: ?Sized,
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Selfwhere Self: AsRef<R>, R: ?Sized,
.tap_ref() only in debug builds, and is erased in release
builds.§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Selfwhere
Self: AsMut<R>,
R: ?Sized,
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Selfwhere Self: AsMut<R>, R: ?Sized,
.tap_ref_mut() only in debug builds, and is erased in release
builds.