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

// Copyright 2015-2019 Parity Technologies (UK) Ltd.
// This file is part of Parity Ethereum.

// Parity Ethereum is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.

// Parity Ethereum is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with Parity Ethereum.  If not, see <http://www.gnu.org/licenses/>.

use super::{Error, KeyPair, KeyPairGenerator, Random};

/// Tries to find keypair with address starting with given prefix.
pub struct Prefix {
    prefix: Vec<u8>,
    iterations: usize,
}

impl Prefix {
    pub fn new(prefix: Vec<u8>, iterations: usize) -> Self {
        Prefix { prefix, iterations }
    }
}

impl KeyPairGenerator for Prefix {
    type Error = Error;

    fn generate(&mut self) -> Result<KeyPair, Error> {
        for _ in 0..self.iterations {
            let keypair = Random.generate()?;
            if keypair.address().as_ref().starts_with(&self.prefix) {
                return Ok(keypair);
            }
        }

        Err(Error::Custom("Could not find keypair".into()))
    }
}

#[cfg(test)]
mod tests {
    use crate::{KeyPairGenerator, Prefix};

    #[test]
    fn prefix_generator() {
        let prefix = vec![0x1fu8];
        let keypair = Prefix::new(prefix.clone(), usize::max_value())
            .generate()
            .unwrap();
        assert!(keypair.address().as_bytes().starts_with(&prefix));
    }
}