mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-05-06 19:38:02 +00:00
002d9260f9
**Update:** Pushed additional changes based on the review comments. **This pull request fixes various spelling mistakes in this repository.** Most of the changes are contained in the first **3** commits: - `Fix spelling mistakes in comments and docs` - `Fix spelling mistakes in test names` - `Fix spelling mistakes in error messages, panic messages, logs and tracing` Other source code spelling mistakes are separated into individual commits for easier reviewing: - `Fix the spelling of 'authority'` - `Fix the spelling of 'REASONABLE_HEADERS_IN_JUSTIFICATION_ANCESTRY'` - `Fix the spelling of 'prev_enqueud_messages'` - `Fix the spelling of 'endpoint'` - `Fix the spelling of 'children'` - `Fix the spelling of 'PenpalSiblingSovereignAccount'` - `Fix the spelling of 'PenpalSudoAccount'` - `Fix the spelling of 'insufficient'` - `Fix the spelling of 'PalletXcmExtrinsicsBenchmark'` - `Fix the spelling of 'subtracted'` - `Fix the spelling of 'CandidatePendingAvailability'` - `Fix the spelling of 'exclusive'` - `Fix the spelling of 'until'` - `Fix the spelling of 'discriminator'` - `Fix the spelling of 'nonexistent'` - `Fix the spelling of 'subsystem'` - `Fix the spelling of 'indices'` - `Fix the spelling of 'committed'` - `Fix the spelling of 'topology'` - `Fix the spelling of 'response'` - `Fix the spelling of 'beneficiary'` - `Fix the spelling of 'formatted'` - `Fix the spelling of 'UNKNOWN_PROOF_REQUEST'` - `Fix the spelling of 'succeeded'` - `Fix the spelling of 'reopened'` - `Fix the spelling of 'proposer'` - `Fix the spelling of 'InstantiationNonce'` - `Fix the spelling of 'depositor'` - `Fix the spelling of 'expiration'` - `Fix the spelling of 'phantom'` - `Fix the spelling of 'AggregatedKeyValue'` - `Fix the spelling of 'randomness'` - `Fix the spelling of 'defendant'` - `Fix the spelling of 'AquaticMammal'` - `Fix the spelling of 'transactions'` - `Fix the spelling of 'PassingTracingSubscriber'` - `Fix the spelling of 'TxSignaturePayload'` - `Fix the spelling of 'versioning'` - `Fix the spelling of 'descendant'` - `Fix the spelling of 'overridden'` - `Fix the spelling of 'network'` Let me know if this structure is adequate. **Note:** The usage of the words `Merkle`, `Merkelize`, `Merklization`, `Merkelization`, `Merkleization`, is somewhat inconsistent but I left it as it is. ~~**Note:** In some places the term `Receival` is used to refer to message reception, IMO `Reception` is the correct word here, but I left it as it is.~~ ~~**Note:** In some places the term `Overlayed` is used instead of the more acceptable version `Overlaid` but I also left it as it is.~~ ~~**Note:** In some places the term `Applyable` is used instead of the correct version `Applicable` but I also left it as it is.~~ **Note:** Some usage of British vs American english e.g. `judgement` vs `judgment`, `initialise` vs `initialize`, `optimise` vs `optimize` etc. are both present in different places, but I suppose that's understandable given the number of contributors. ~~**Note:** There is a spelling mistake in `.github/CODEOWNERS` but it triggers errors in CI when I make changes to it, so I left it as it is.~~
241 lines
5.8 KiB
Rust
241 lines
5.8 KiB
Rust
// This file is part of Substrate.
|
|
|
|
// Copyright (C) Parity Technologies (UK) Ltd.
|
|
// SPDX-License-Identifier: GPL-3.0-or-later WITH Classpath-exception-2.0
|
|
|
|
// This program 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.
|
|
|
|
// This program 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 this program. If not, see <https://www.gnu.org/licenses/>.
|
|
|
|
//! implementation of the `vanity` subcommand
|
|
|
|
use crate::{
|
|
error, utils, with_crypto_scheme, CryptoSchemeFlag, NetworkSchemeFlag, OutputTypeFlag,
|
|
};
|
|
use clap::Parser;
|
|
use rand::{rngs::OsRng, RngCore};
|
|
use sp_core::crypto::{unwrap_or_default_ss58_version, Ss58AddressFormat, Ss58Codec};
|
|
use sp_runtime::traits::IdentifyAccount;
|
|
use utils::print_from_uri;
|
|
|
|
/// The `vanity` command
|
|
#[derive(Debug, Clone, Parser)]
|
|
#[command(name = "vanity", about = "Generate a seed that provides a vanity address")]
|
|
pub struct VanityCmd {
|
|
/// Desired pattern
|
|
#[arg(long, value_parser = assert_non_empty_string)]
|
|
pattern: String,
|
|
|
|
#[allow(missing_docs)]
|
|
#[clap(flatten)]
|
|
network_scheme: NetworkSchemeFlag,
|
|
|
|
#[allow(missing_docs)]
|
|
#[clap(flatten)]
|
|
output_scheme: OutputTypeFlag,
|
|
|
|
#[allow(missing_docs)]
|
|
#[clap(flatten)]
|
|
crypto_scheme: CryptoSchemeFlag,
|
|
}
|
|
|
|
impl VanityCmd {
|
|
/// Run the command
|
|
pub fn run(&self) -> error::Result<()> {
|
|
let formatted_seed = with_crypto_scheme!(
|
|
self.crypto_scheme.scheme,
|
|
generate_key(
|
|
&self.pattern,
|
|
unwrap_or_default_ss58_version(self.network_scheme.network)
|
|
),
|
|
)?;
|
|
|
|
with_crypto_scheme!(
|
|
self.crypto_scheme.scheme,
|
|
print_from_uri(
|
|
&formatted_seed,
|
|
None,
|
|
self.network_scheme.network,
|
|
self.output_scheme.output_type,
|
|
),
|
|
);
|
|
Ok(())
|
|
}
|
|
}
|
|
|
|
/// genertae a key based on given pattern
|
|
fn generate_key<Pair>(
|
|
desired: &str,
|
|
network_override: Ss58AddressFormat,
|
|
) -> Result<String, &'static str>
|
|
where
|
|
Pair: sp_core::Pair,
|
|
Pair::Public: IdentifyAccount,
|
|
<Pair::Public as IdentifyAccount>::AccountId: Ss58Codec,
|
|
{
|
|
println!("Generating key containing pattern '{}'", desired);
|
|
|
|
let top = 45 + (desired.len() * 48);
|
|
let mut best = 0;
|
|
let mut seed = Pair::Seed::default();
|
|
let mut done = 0;
|
|
|
|
loop {
|
|
if done % 100000 == 0 {
|
|
OsRng.fill_bytes(seed.as_mut());
|
|
} else {
|
|
next_seed(seed.as_mut());
|
|
}
|
|
|
|
let p = Pair::from_seed(&seed);
|
|
let ss58 = p.public().into_account().to_ss58check_with_version(network_override);
|
|
let score = calculate_score(desired, &ss58);
|
|
if score > best || desired.len() < 2 {
|
|
best = score;
|
|
if best >= top {
|
|
println!("best: {} == top: {}", best, top);
|
|
return Ok(utils::format_seed::<Pair>(seed.clone()))
|
|
}
|
|
}
|
|
done += 1;
|
|
|
|
if done % good_waypoint(done) == 0 {
|
|
println!("{} keys searched; best is {}/{} complete", done, best, top);
|
|
}
|
|
}
|
|
}
|
|
|
|
fn good_waypoint(done: u64) -> u64 {
|
|
match done {
|
|
0..=1_000_000 => 100_000,
|
|
1_000_001..=10_000_000 => 1_000_000,
|
|
10_000_001..=100_000_000 => 10_000_000,
|
|
100_000_001.. => 100_000_000,
|
|
}
|
|
}
|
|
|
|
fn next_seed(seed: &mut [u8]) {
|
|
for s in seed {
|
|
match s {
|
|
255 => {
|
|
*s = 0;
|
|
},
|
|
_ => {
|
|
*s += 1;
|
|
break
|
|
},
|
|
}
|
|
}
|
|
}
|
|
|
|
/// Calculate the score of a key based on the desired
|
|
/// input.
|
|
fn calculate_score(_desired: &str, key: &str) -> usize {
|
|
for truncate in 0.._desired.len() {
|
|
let snip_size = _desired.len() - truncate;
|
|
let truncated = &_desired[0..snip_size];
|
|
if let Some(pos) = key.find(truncated) {
|
|
return (47 - pos) + (snip_size * 48)
|
|
}
|
|
}
|
|
0
|
|
}
|
|
|
|
/// checks that `pattern` is non-empty
|
|
fn assert_non_empty_string(pattern: &str) -> Result<String, &'static str> {
|
|
if pattern.is_empty() {
|
|
Err("Pattern must not be empty")
|
|
} else {
|
|
Ok(pattern.to_string())
|
|
}
|
|
}
|
|
|
|
#[cfg(test)]
|
|
mod tests {
|
|
use super::*;
|
|
use sp_core::{
|
|
crypto::{default_ss58_version, Ss58AddressFormatRegistry, Ss58Codec},
|
|
sr25519, Pair,
|
|
};
|
|
#[cfg(feature = "bench")]
|
|
use test::Bencher;
|
|
|
|
#[test]
|
|
fn vanity() {
|
|
let vanity = VanityCmd::parse_from(&["vanity", "--pattern", "j"]);
|
|
assert!(vanity.run().is_ok());
|
|
}
|
|
|
|
#[test]
|
|
fn test_generation_with_single_char() {
|
|
let seed = generate_key::<sr25519::Pair>("ab", default_ss58_version()).unwrap();
|
|
assert!(sr25519::Pair::from_seed_slice(&array_bytes::hex2bytes_unchecked(&seed))
|
|
.unwrap()
|
|
.public()
|
|
.to_ss58check()
|
|
.contains("ab"));
|
|
}
|
|
|
|
#[test]
|
|
fn generate_key_respects_network_override() {
|
|
let seed =
|
|
generate_key::<sr25519::Pair>("ab", Ss58AddressFormatRegistry::PolkadotAccount.into())
|
|
.unwrap();
|
|
assert!(sr25519::Pair::from_seed_slice(&array_bytes::hex2bytes_unchecked(&seed))
|
|
.unwrap()
|
|
.public()
|
|
.to_ss58check_with_version(Ss58AddressFormatRegistry::PolkadotAccount.into())
|
|
.contains("ab"));
|
|
}
|
|
|
|
#[test]
|
|
fn test_score_1_char_100() {
|
|
let score = calculate_score("j", "5jolkadotwHY5k9GpdTgpqs9xjuNvtv8EcwCFpEeyEf3KHim");
|
|
assert_eq!(score, 94);
|
|
}
|
|
|
|
#[test]
|
|
fn test_score_100() {
|
|
let score = calculate_score("Polkadot", "5PolkadotwHY5k9GpdTgpqs9xjuNvtv8EcwCFpEeyEf3KHim");
|
|
assert_eq!(score, 430);
|
|
}
|
|
|
|
#[test]
|
|
fn test_score_50_2() {
|
|
// 50% for the position + 50% for the size
|
|
assert_eq!(
|
|
calculate_score("Polkadot", "5PolkXXXXwHY5k9GpdTgpqs9xjuNvtv8EcwCFpEeyEf3KHim"),
|
|
238
|
|
);
|
|
}
|
|
|
|
#[test]
|
|
fn test_score_0() {
|
|
assert_eq!(
|
|
calculate_score("Polkadot", "5GUWv4bLCchGUHJrzULXnh4JgXsMpTKRnjuXTY7Qo1Kh9uYK"),
|
|
0
|
|
);
|
|
}
|
|
|
|
#[cfg(feature = "bench")]
|
|
#[bench]
|
|
fn bench_paranoiac(b: &mut Bencher) {
|
|
b.iter(|| generate_key("polk"));
|
|
}
|
|
|
|
#[cfg(feature = "bench")]
|
|
#[bench]
|
|
fn bench_not_paranoiac(b: &mut Bencher) {
|
|
b.iter(|| generate_key("polk"));
|
|
}
|
|
}
|