solana/src/accountant.rs

632 lines
22 KiB
Rust
Raw Normal View History

2018-03-30 10:43:38 -07:00
//! The `accountant` module tracks client balances, and the progress of pending
2018-03-29 11:20:54 -07:00
//! transactions. It offers a high-level public API that signs transactions
2018-03-30 10:43:38 -07:00
//! on behalf of the caller, and a private low-level API for when they have
2018-03-29 11:20:54 -07:00
//! already been signed and verified.
2018-02-23 13:08:19 -08:00
2018-03-26 21:07:11 -07:00
extern crate libc;
use chrono::prelude::*;
use entry::Entry;
2018-03-06 11:18:17 -08:00
use event::Event;
use hash::Hash;
use mint::Mint;
2018-04-02 12:51:44 -07:00
use plan::{Payment, Plan, Witness};
use rayon::prelude::*;
use signature::{KeyPair, PublicKey, Signature};
use std::collections::hash_map::Entry::Occupied;
use std::collections::{HashMap, HashSet, VecDeque};
use std::result;
2018-05-11 11:38:52 -07:00
use std::sync::RwLock;
2018-05-11 12:06:05 -07:00
use std::sync::atomic::{AtomicIsize, Ordering};
use transaction::Transaction;
2018-04-11 13:05:29 -07:00
pub const MAX_ENTRY_IDS: usize = 1024 * 4;
#[derive(Debug, PartialEq, Eq)]
pub enum AccountingError {
AccountNotFound,
InsufficientFunds,
InvalidTransferSignature,
}
pub type Result<T> = result::Result<T, AccountingError>;
2018-02-23 13:08:19 -08:00
/// Commit funds to the 'to' party.
fn apply_payment(balances: &RwLock<HashMap<PublicKey, AtomicIsize>>, payment: &Payment) {
// First we check balances with a read lock to maximize potential parallelization.
2018-05-11 11:38:52 -07:00
if balances
.read()
.expect("'balances' read lock in apply_payment")
.contains_key(&payment.to)
{
let bals = balances.read().expect("'balances' read lock");
bals[&payment.to].fetch_add(payment.tokens as isize, Ordering::Relaxed);
} else {
// Now we know the key wasn't present a nanosecond ago, but it might be there
// by the time we aquire a write lock, so we'll have to check again.
let mut bals = balances.write().expect("'balances' write lock");
if bals.contains_key(&payment.to) {
bals[&payment.to].fetch_add(payment.tokens as isize, Ordering::Relaxed);
} else {
bals.insert(payment.to, AtomicIsize::new(payment.tokens as isize));
}
}
}
2018-02-23 13:08:19 -08:00
pub struct Accountant {
balances: RwLock<HashMap<PublicKey, AtomicIsize>>,
pending: RwLock<HashMap<Signature, Plan>>,
last_ids: RwLock<VecDeque<(Hash, RwLock<HashSet<Signature>>)>>,
time_sources: RwLock<HashSet<PublicKey>>,
last_time: RwLock<DateTime<Utc>>,
2018-02-23 13:08:19 -08:00
}
impl Accountant {
2018-04-02 12:51:44 -07:00
/// Create an Accountant using a deposit.
pub fn new_from_deposit(deposit: &Payment) -> Self {
let balances = RwLock::new(HashMap::new());
apply_payment(&balances, deposit);
2018-04-02 12:51:44 -07:00
Accountant {
balances,
pending: RwLock::new(HashMap::new()),
last_ids: RwLock::new(VecDeque::new()),
time_sources: RwLock::new(HashSet::new()),
last_time: RwLock::new(Utc.timestamp(0, 0)),
2018-04-02 12:51:44 -07:00
}
}
/// Create an Accountant with only a Mint. Typically used by unit tests.
pub fn new(mint: &Mint) -> Self {
2018-04-02 12:51:44 -07:00
let deposit = Payment {
to: mint.pubkey(),
tokens: mint.tokens,
};
let accountant = Self::new_from_deposit(&deposit);
accountant.register_entry_id(&mint.last_id());
accountant
2018-04-02 12:51:44 -07:00
}
2018-05-03 12:24:35 -07:00
/// Return the last entry ID registered
pub fn last_id(&self) -> Hash {
let last_ids = self.last_ids.read().expect("'last_ids' read lock");
2018-05-09 17:19:12 -07:00
let last_item = last_ids.iter().last().expect("empty 'last_ids' list");
2018-05-03 12:24:35 -07:00
last_item.0
}
fn reserve_signature(signatures: &RwLock<HashSet<Signature>>, sig: &Signature) -> bool {
2018-05-11 11:38:52 -07:00
if signatures
.read()
.expect("'signatures' read lock")
.contains(sig)
{
return false;
}
2018-05-11 11:38:52 -07:00
signatures
.write()
.expect("'signatures' write lock")
.insert(*sig);
true
}
2018-04-26 04:22:11 -07:00
fn forget_signature(signatures: &RwLock<HashSet<Signature>>, sig: &Signature) -> bool {
2018-05-11 11:38:52 -07:00
signatures
.write()
.expect("'signatures' write lock in forget_signature")
.remove(sig)
2018-04-26 04:22:11 -07:00
}
fn forget_signature_with_last_id(&self, sig: &Signature, last_id: &Hash) -> bool {
if let Some(entry) = self.last_ids
.read()
.expect("'last_ids' read lock in forget_signature_with_last_id")
2018-04-26 04:22:11 -07:00
.iter()
.rev()
.find(|x| x.0 == *last_id)
{
return Self::forget_signature(&entry.1, sig);
}
return false;
}
fn reserve_signature_with_last_id(&self, sig: &Signature, last_id: &Hash) -> bool {
if let Some(entry) = self.last_ids
.read()
.expect("'last_ids' read lock in reserve_signature_with_last_id")
.iter()
.rev()
.find(|x| x.0 == *last_id)
{
return Self::reserve_signature(&entry.1, sig);
}
false
}
/// Tell the accountant which Entry IDs exist on the ledger. This function
/// assumes subsequent calls correspond to later entries, and will boot
/// the oldest ones once its internal cache is full. Once boot, the
/// accountant will reject transactions using that `last_id`.
pub fn register_entry_id(&self, last_id: &Hash) {
2018-05-11 11:38:52 -07:00
let mut last_ids = self.last_ids
.write()
.expect("'last_ids' write lock in register_entry_id");
if last_ids.len() >= MAX_ENTRY_IDS {
last_ids.pop_front();
}
last_ids.push_back((*last_id, RwLock::new(HashSet::new())));
}
/// Deduct tokens from the 'from' address the account has sufficient
/// funds and isn't a duplicate.
pub fn process_verified_transaction_debits(&self, tr: &Transaction) -> Result<()> {
2018-05-11 11:38:52 -07:00
let bals = self.balances
.read()
.expect("'balances' read lock in process_verified_transaction_debits");
let option = bals.get(&tr.from);
if option.is_none() {
return Err(AccountingError::AccountNotFound);
}
2018-03-26 21:07:11 -07:00
if !self.reserve_signature_with_last_id(&tr.sig, &tr.data.last_id) {
return Err(AccountingError::InvalidTransferSignature);
}
loop {
let bal = option.expect("assignment of option to bal");
let current = bal.load(Ordering::Relaxed) as i64;
if current < tr.data.tokens {
self.forget_signature_with_last_id(&tr.sig, &tr.data.last_id);
return Err(AccountingError::InsufficientFunds);
}
let result = bal.compare_exchange(
current as isize,
(current - tr.data.tokens) as isize,
Ordering::Relaxed,
Ordering::Relaxed,
);
match result {
Ok(_) => return Ok(()),
Err(_) => continue,
};
}
}
pub fn process_verified_transaction_credits(&self, tr: &Transaction) {
2018-03-26 21:07:11 -07:00
let mut plan = tr.data.plan.clone();
2018-05-11 11:38:52 -07:00
plan.apply_witness(&Witness::Timestamp(*self.last_time
.read()
.expect("timestamp creation in process_verified_transaction_credits")));
2018-03-10 23:30:01 -08:00
2018-04-02 12:51:44 -07:00
if let Some(ref payment) = plan.final_payment() {
apply_payment(&self.balances, payment);
} else {
2018-05-11 11:38:52 -07:00
let mut pending = self.pending
.write()
.expect("'pending' write lock in process_verified_transaction_credits");
pending.insert(tr.sig, plan);
}
}
/// Process a Transaction that has already been verified.
pub fn process_verified_transaction(&self, tr: &Transaction) -> Result<()> {
2018-05-02 07:44:41 -07:00
self.process_verified_transaction_debits(tr)?;
self.process_verified_transaction_credits(tr);
Ok(())
2018-02-23 13:08:19 -08:00
}
/// Process a batch of verified transactions.
2018-04-11 10:17:00 -07:00
pub fn process_verified_transactions(&self, trs: Vec<Transaction>) -> Vec<Result<Transaction>> {
// Run all debits first to filter out any transactions that can't be processed
// in parallel deterministically.
let results: Vec<_> = trs.into_par_iter()
2018-05-02 07:44:41 -07:00
.map(|tr| self.process_verified_transaction_debits(&tr).map(|_| tr))
.collect(); // Calling collect() here forces all debits to complete before moving on.
results
.into_par_iter()
2018-04-11 10:17:00 -07:00
.map(|result| {
result.map(|tr| {
self.process_verified_transaction_credits(&tr);
tr
})
})
.collect()
}
fn partition_events(events: Vec<Event>) -> (Vec<Transaction>, Vec<Event>) {
let mut trs = vec![];
let mut rest = vec![];
for event in events {
match event {
Event::Transaction(tr) => trs.push(tr),
_ => rest.push(event),
}
}
(trs, rest)
}
pub fn process_verified_events(&self, events: Vec<Event>) -> Vec<Result<Event>> {
let (trs, rest) = Self::partition_events(events);
let mut results: Vec<_> = self.process_verified_transactions(trs)
.into_iter()
.map(|x| x.map(Event::Transaction))
.collect();
for event in rest {
results.push(self.process_verified_event(event));
}
results
}
pub fn process_verified_entries(&self, entries: Vec<Entry>) -> Result<()> {
for entry in entries {
self.register_entry_id(&entry.id);
for result in self.process_verified_events(entry.events) {
result?;
}
}
Ok(())
}
2018-03-29 11:20:54 -07:00
/// Process a Witness Signature that has already been verified.
fn process_verified_sig(&self, from: PublicKey, tx_sig: Signature) -> Result<()> {
2018-05-11 11:38:52 -07:00
if let Occupied(mut e) = self.pending
.write()
.expect("write() in process_verified_sig")
.entry(tx_sig)
{
2018-03-22 13:38:06 -07:00
e.get_mut().apply_witness(&Witness::Signature(from));
2018-04-02 12:51:44 -07:00
if let Some(ref payment) = e.get().final_payment() {
apply_payment(&self.balances, payment);
e.remove_entry();
}
2018-03-10 23:11:08 -08:00
};
Ok(())
}
2018-03-29 11:20:54 -07:00
/// Process a Witness Timestamp that has already been verified.
fn process_verified_timestamp(&self, from: PublicKey, dt: DateTime<Utc>) -> Result<()> {
2018-03-08 09:05:00 -08:00
// If this is the first timestamp we've seen, it probably came from the genesis block,
// so we'll trust it.
2018-05-11 11:38:52 -07:00
if *self.last_time
.read()
.expect("'last_time' read lock on first timestamp check")
== Utc.timestamp(0, 0)
{
self.time_sources
.write()
.expect("'time_sources' write lock on first timestamp")
.insert(from);
2018-03-08 09:05:00 -08:00
}
2018-05-11 11:38:52 -07:00
if self.time_sources
.read()
.expect("'time_sources' read lock")
.contains(&from)
{
if dt > *self.last_time.read().expect("'last_time' read lock") {
*self.last_time.write().expect("'last_time' write lock") = dt;
2018-03-08 09:05:00 -08:00
}
} else {
return Ok(());
2018-03-08 09:05:00 -08:00
}
// Check to see if any timelocked transactions can be completed.
let mut completed = vec![];
// Hold 'pending' write lock until the end of this function. Otherwise another thread can
// double-spend if it enters before the modified plan is removed from 'pending'.
2018-05-11 11:38:52 -07:00
let mut pending = self.pending
.write()
.expect("'pending' write lock in process_verified_timestamp");
for (key, plan) in pending.iter_mut() {
2018-05-11 11:38:52 -07:00
plan.apply_witness(&Witness::Timestamp(*self.last_time
.read()
.expect("'last_time' read lock when creating timestamp")));
2018-04-02 12:51:44 -07:00
if let Some(ref payment) = plan.final_payment() {
apply_payment(&self.balances, payment);
2018-03-10 23:30:01 -08:00
completed.push(key.clone());
}
}
for key in completed {
pending.remove(&key);
}
Ok(())
}
2018-03-29 11:20:54 -07:00
/// Process an Transaction or Witness that has already been verified.
pub fn process_verified_event(&self, event: Event) -> Result<Event> {
match event {
Event::Transaction(ref tr) => self.process_verified_transaction(tr),
Event::Signature { from, tx_sig, .. } => self.process_verified_sig(from, tx_sig),
Event::Timestamp { from, dt, .. } => self.process_verified_timestamp(from, dt),
}?;
Ok(event)
}
2018-03-29 11:20:54 -07:00
/// Create, sign, and process a Transaction from `keypair` to `to` of
/// `n` tokens where `last_id` is the last Entry ID observed by the client.
2018-02-23 13:08:19 -08:00
pub fn transfer(
&self,
n: i64,
keypair: &KeyPair,
2018-02-28 09:07:54 -08:00
to: PublicKey,
2018-03-20 22:15:44 -07:00
last_id: Hash,
) -> Result<Signature> {
2018-03-20 22:15:44 -07:00
let tr = Transaction::new(keypair, to, n, last_id);
let sig = tr.sig;
self.process_verified_transaction(&tr).map(|_| sig)
2018-02-23 13:08:19 -08:00
}
2018-03-29 11:20:54 -07:00
/// Create, sign, and process a postdated Transaction from `keypair`
/// to `to` of `n` tokens on `dt` where `last_id` is the last Entry ID
/// observed by the client.
pub fn transfer_on_date(
&self,
n: i64,
keypair: &KeyPair,
to: PublicKey,
dt: DateTime<Utc>,
2018-03-20 22:15:44 -07:00
last_id: Hash,
) -> Result<Signature> {
2018-03-20 22:15:44 -07:00
let tr = Transaction::new_on_date(keypair, to, dt, n, last_id);
let sig = tr.sig;
self.process_verified_transaction(&tr).map(|_| sig)
}
pub fn get_balance(&self, pubkey: &PublicKey) -> Option<i64> {
2018-05-11 11:38:52 -07:00
let bals = self.balances
.read()
.expect("'balances' read lock in get_balance");
bals.get(pubkey).map(|x| x.load(Ordering::Relaxed) as i64)
2018-02-23 13:08:19 -08:00
}
}
#[cfg(test)]
mod tests {
use super::*;
use bincode::serialize;
use hash::hash;
use signature::KeyPairUtil;
2018-02-23 13:08:19 -08:00
#[test]
fn test_accountant() {
let alice = Mint::new(10_000);
let bob_pubkey = KeyPair::new().pubkey();
let accountant = Accountant::new(&alice);
assert_eq!(accountant.last_id(), alice.last_id());
2018-05-03 12:24:35 -07:00
accountant
.transfer(1_000, &alice.keypair(), bob_pubkey, alice.last_id())
2018-03-20 22:15:44 -07:00
.unwrap();
assert_eq!(accountant.get_balance(&bob_pubkey).unwrap(), 1_000);
2018-02-23 13:08:19 -08:00
accountant
.transfer(500, &alice.keypair(), bob_pubkey, alice.last_id())
2018-03-20 22:15:44 -07:00
.unwrap();
assert_eq!(accountant.get_balance(&bob_pubkey).unwrap(), 1_500);
2018-02-23 13:08:19 -08:00
}
2018-02-27 10:28:10 -08:00
#[test]
fn test_account_not_found() {
let mint = Mint::new(1);
let accountant = Accountant::new(&mint);
assert_eq!(
accountant.transfer(1, &KeyPair::new(), mint.pubkey(), mint.last_id()),
Err(AccountingError::AccountNotFound)
);
}
2018-02-27 10:28:10 -08:00
#[test]
fn test_invalid_transfer() {
let alice = Mint::new(11_000);
let accountant = Accountant::new(&alice);
let bob_pubkey = KeyPair::new().pubkey();
accountant
.transfer(1_000, &alice.keypair(), bob_pubkey, alice.last_id())
2018-03-20 22:15:44 -07:00
.unwrap();
assert_eq!(
accountant.transfer(10_001, &alice.keypair(), bob_pubkey, alice.last_id()),
Err(AccountingError::InsufficientFunds)
);
let alice_pubkey = alice.keypair().pubkey();
assert_eq!(accountant.get_balance(&alice_pubkey).unwrap(), 10_000);
assert_eq!(accountant.get_balance(&bob_pubkey).unwrap(), 1_000);
2018-02-27 10:28:10 -08:00
}
#[test]
fn test_transfer_to_newb() {
let alice = Mint::new(10_000);
let accountant = Accountant::new(&alice);
let alice_keypair = alice.keypair();
let bob_pubkey = KeyPair::new().pubkey();
accountant
.transfer(500, &alice_keypair, bob_pubkey, alice.last_id())
2018-03-20 22:15:44 -07:00
.unwrap();
assert_eq!(accountant.get_balance(&bob_pubkey).unwrap(), 500);
2018-02-27 10:28:10 -08:00
}
#[test]
fn test_transfer_on_date() {
let alice = Mint::new(1);
let accountant = Accountant::new(&alice);
let alice_keypair = alice.keypair();
let bob_pubkey = KeyPair::new().pubkey();
let dt = Utc::now();
accountant
.transfer_on_date(1, &alice_keypair, bob_pubkey, dt, alice.last_id())
.unwrap();
// Alice's balance will be zero because all funds are locked up.
assert_eq!(accountant.get_balance(&alice.pubkey()), Some(0));
// Bob's balance will be None because the funds have not been
// sent.
assert_eq!(accountant.get_balance(&bob_pubkey), None);
// Now, acknowledge the time in the condition occurred and
// that bob's funds are now available.
accountant
.process_verified_timestamp(alice.pubkey(), dt)
.unwrap();
assert_eq!(accountant.get_balance(&bob_pubkey), Some(1));
accountant
.process_verified_timestamp(alice.pubkey(), dt)
.unwrap(); // <-- Attack! Attempt to process completed transaction.
assert_ne!(accountant.get_balance(&bob_pubkey), Some(2));
}
2018-03-08 14:39:03 -08:00
#[test]
fn test_transfer_after_date() {
let alice = Mint::new(1);
let accountant = Accountant::new(&alice);
2018-03-08 14:39:03 -08:00
let alice_keypair = alice.keypair();
let bob_pubkey = KeyPair::new().pubkey();
let dt = Utc::now();
accountant
.process_verified_timestamp(alice.pubkey(), dt)
.unwrap();
2018-03-08 14:39:03 -08:00
// It's now past now, so this transfer should be processed immediately.
accountant
.transfer_on_date(1, &alice_keypair, bob_pubkey, dt, alice.last_id())
2018-03-08 14:39:03 -08:00
.unwrap();
assert_eq!(accountant.get_balance(&alice.pubkey()), Some(0));
assert_eq!(accountant.get_balance(&bob_pubkey), Some(1));
2018-03-08 14:39:03 -08:00
}
#[test]
fn test_cancel_transfer() {
let alice = Mint::new(1);
let accountant = Accountant::new(&alice);
let alice_keypair = alice.keypair();
let bob_pubkey = KeyPair::new().pubkey();
let dt = Utc::now();
let sig = accountant
.transfer_on_date(1, &alice_keypair, bob_pubkey, dt, alice.last_id())
.unwrap();
// Alice's balance will be zero because all funds are locked up.
assert_eq!(accountant.get_balance(&alice.pubkey()), Some(0));
// Bob's balance will be None because the funds have not been
// sent.
assert_eq!(accountant.get_balance(&bob_pubkey), None);
// Now, cancel the trancaction. Alice gets her funds back, Bob never sees them.
accountant
.process_verified_sig(alice.pubkey(), sig)
.unwrap();
assert_eq!(accountant.get_balance(&alice.pubkey()), Some(1));
assert_eq!(accountant.get_balance(&bob_pubkey), None);
accountant
.process_verified_sig(alice.pubkey(), sig)
.unwrap(); // <-- Attack! Attempt to cancel completed transaction.
assert_ne!(accountant.get_balance(&alice.pubkey()), Some(2));
}
#[test]
fn test_duplicate_event_signature() {
let alice = Mint::new(1);
let accountant = Accountant::new(&alice);
let sig = Signature::default();
assert!(accountant.reserve_signature_with_last_id(&sig, &alice.last_id()));
assert!(!accountant.reserve_signature_with_last_id(&sig, &alice.last_id()));
}
2018-04-26 04:22:11 -07:00
#[test]
fn test_forget_signature() {
let alice = Mint::new(1);
let accountant = Accountant::new(&alice);
2018-04-26 04:22:11 -07:00
let sig = Signature::default();
accountant.reserve_signature_with_last_id(&sig, &alice.last_id());
assert!(accountant.forget_signature_with_last_id(&sig, &alice.last_id()));
assert!(!accountant.forget_signature_with_last_id(&sig, &alice.last_id()));
2018-04-26 04:22:11 -07:00
}
#[test]
fn test_max_entry_ids() {
let alice = Mint::new(1);
let accountant = Accountant::new(&alice);
let sig = Signature::default();
for i in 0..MAX_ENTRY_IDS {
let last_id = hash(&serialize(&i).unwrap()); // Unique hash
accountant.register_entry_id(&last_id);
}
// Assert we're no longer able to use the oldest entry ID.
assert!(!accountant.reserve_signature_with_last_id(&sig, &alice.last_id()));
}
#[test]
fn test_debits_before_credits() {
let mint = Mint::new(2);
let accountant = Accountant::new(&mint);
let alice = KeyPair::new();
let tr0 = Transaction::new(&mint.keypair(), alice.pubkey(), 2, mint.last_id());
let tr1 = Transaction::new(&alice, mint.pubkey(), 1, mint.last_id());
let trs = vec![tr0, tr1];
assert!(accountant.process_verified_transactions(trs)[1].is_err());
}
2018-02-23 13:08:19 -08:00
}
#[cfg(all(feature = "unstable", test))]
mod bench {
extern crate test;
use self::test::Bencher;
use accountant::*;
use bincode::serialize;
use hash::hash;
use signature::KeyPairUtil;
#[bench]
fn process_verified_event_bench(bencher: &mut Bencher) {
2018-04-04 15:01:43 -07:00
let mint = Mint::new(100_000_000);
let accountant = Accountant::new(&mint);
2018-04-04 15:01:43 -07:00
// Create transactions between unrelated parties.
let transactions: Vec<_> = (0..4096)
.into_par_iter()
.map(|i| {
// Seed the 'from' account.
2018-04-04 15:01:43 -07:00
let rando0 = KeyPair::new();
let tr = Transaction::new(&mint.keypair(), rando0.pubkey(), 1_000, mint.last_id());
accountant.process_verified_transaction(&tr).unwrap();
// Seed the 'to' account and a cell for its signature.
let last_id = hash(&serialize(&i).unwrap()); // Unique hash
accountant.register_entry_id(&last_id);
2018-04-04 15:01:43 -07:00
let rando1 = KeyPair::new();
let tr = Transaction::new(&rando0, rando1.pubkey(), 1, last_id);
accountant.process_verified_transaction(&tr).unwrap();
// Finally, return a transaction that's unique
Transaction::new(&rando0, rando1.pubkey(), 1, last_id)
})
.collect();
bencher.iter(|| {
// Since benchmarker runs this multiple times, we need to clear the signatures.
for sigs in accountant.last_ids.read().unwrap().iter() {
2018-04-11 15:40:25 -07:00
sigs.1.write().unwrap().clear();
}
assert!(
accountant
.process_verified_transactions(transactions.clone())
.iter()
.all(|x| x.is_ok())
);
});
}
}