Struct schnorrkel::derive::ChainCode

pub struct ChainCode(pub [u8; 32]);

[−] Expand description

We cannot assume the original public key is secret and additional inputs might have low entropy, like i in BIP32. As in BIP32, chain codes fill this gap by being a high entropy secret shared between public and private key holders. These are produced by key derivations and can be incorporated into subsequence key derivations. See https://github.com/bitcoin/bips/blob/master/bip-0032.mediawiki#extended-keys

Trait Implementations

impl Clone for ChainCode

[+] Show hidden undocumented items

fn clone(&self) -> ChainCode[−]

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)[−]

Performs copy-assignment from source.

impl Debug for ChainCode

[+] Show hidden undocumented items

fn fmt(&self, f: &mut Formatter<'_>) -> Result[−]

Formats the value using the given formatter.

impl Hash for ChainCode

[+] Show hidden undocumented items

fn hash<__H: Hasher>(&self, state: &mut __H)[−]

Feeds this value into the given Hasher.

pub fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, [−]

Feeds a slice of this type into the given Hasher.

impl PartialEq<ChainCode> for ChainCode

[+] Show hidden undocumented items

fn eq(&self, other: &ChainCode) -> bool[−]

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &ChainCode) -> bool[−]

This method tests for !=.

impl Copy for ChainCode

impl Eq for ChainCode

impl StructuralEq for ChainCode

impl StructuralPartialEq for ChainCode