úÎ#\´WÜP      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNONone.HmUÐ-bip32A derivation path .bip32 Chain code.Construct with '.Pbip3220-byte key identifier.bip324-byte fingerprint of a Q key.bip32Derivation path depth.0 for master nodes  m1 for level-1 derived keys  m/0', or m/13, or &2 for level-2 derived keys  m/0'/28, or m/44'/0', or & & up to 255. bip32Version bytes.Rbip32*The 33-byte serialized contents of either Q or S. bip32Extended private key.bip32Extended private key.bip32 Obtain the   corresponding to a particular , at a particular  .bip32 0x0488ade4", xprv , Bitcoin mainnet private.bip32 0x0488b21e!, xpub , Bitcoin mainnet public. bip32 0x04358394", tprv , Bitcoin testnet private.!bip32 0x043587cf!, tpub , Bitcoin testnet public."bip32 0x019d9cfe#, Ltpv , Litecoin mainnet private.#bip32 0x019da462", Ltub , Litecoin mainnet public.$bip32 0x0436ef7d#, ttpv , Litecoin testnet private.%bip32 0x0436f6e1", ttub , Litecoin testnet public.'bip32 Construct a  code.See Bitcoin's  >https://github.com/bitcoin/bips/blob/master/bip-0032.mediawikiBIP-0032 for details.T if the U length is not 32.(bip32!Obtain the 32 raw bytes inside a .)bip32Whether a derivation path  is hardened. That is, 2^{31} or larger.*bip32Increment the given 5 by one, but only if doing so would result in a new D in the same index group (normal vs. hardened). Otherwise, returns T.+bip32 Derive a  subkey from a parent  key.Returns T. if the given inputs result in an invalid key.,bip32 Derive a   subkey from a parent   key. The given  is expected to not be hardened.Returns T. if the given inputs result in an invalid key.-bip32Derive   subkey from a parent  key.Notice that while , ( v) xprv i will fail with a hardened , - v xprv i may succeed.Returns T. if the given inputs result in an invalid key..bip32Behaves exactly like +, but deals with  and S, rather than an ./bip32Behaves exactly like ,, but deals with  and Q, rather than an  .0bip32Behaves exactly like -, but deals with , S and Q, rather than an  and  .1bip32Lazily derive all the child  subkeys from a parent's .1The first child returned is the one at the given I, if any, and the subsequent childs are those immediately after it (see *). The returned 3es are not necessarily consecutive, since not all  and D combinations are able to derive valid keys. However, the produced es do increase monotonically. If the given = is hardened, then all produced children will have hardened es too. If the given 0 is normal, then all children will have normal Aes too. That is, this function will never produce children with 4es belonging to another group (normal vs. hardened).2bip32Lazily derive all the   subkeys from a parent's  .1The first child returned is the one at the given I, if any, and the subsequent childs are those immediately after it (see *). The returned 3es are not necessarily consecutive, since not all   and D combinations are able to derive valid keys. However, the produced es do increase monotonically.0The produced list will never include a hardened . If a hardened 7 is provided as input, the produced list will be empty.3bip32Lazily derive all the   subkeys from a parent  key.1The first child returned is the one at the given I, if any, and the subsequent childs are those immediately after it (see *). The returned 3es are not necessarily consecutive, since not all  and D combinations are able to derive valid keys. However, the produced es do increase monotonically. If the given = is hardened, then all produced children will have hardened es too. If the given 0 is normal, then all children will have normal Aes too. That is, this function will never produce children with 4es belonging to another group (normal vs. hardened).Notice that while 2 ( v) xprv i will fail with a hardened , 3 v xprv i may succeed.4bip32Behaves exactly like 1, but deals with  and S, rather than an .5bip32Behaves exactly like 2, but deals with  and Q, rather than an  .6bip32Behaves exactly like 3, but deals with , S and Q, rather than an  and  .7bip32(Obtain the Base58 representation for an  .fIt can be either 111 or 112 bytes in length, and when rendered as ASCII it looks something like this: pxpub661MyMwAqRbcFtXgS5sYJABqqG9YLmC4Q1Rdap9gSE8NqtwybGhePY2gZ29ESFjqJoCu1Rupje8YtGqsefD265TMg7usUDFdp6W1EGMcet8 8bip32(Obtain the Base58 representation for an .fIt can be either 111 or 112 bytes in length, and when rendered as ASCII it looks something like this: pxprv9s21ZrQH143K3QTDL4LXw2F7HEK3wJUD2nW2nRk4stbPy6cq3jPPqjiChkVvvNKmPGJxWUtg6LnF5kejMRNNU3TGtRBeJgk33yuGBxrMPHi 9bip32Encode the 78 raw   bytes.:bip32Encode the 78 raw  bytes.Vbip32%Encode the 78 raw extended key bytes.;bip32Decode the Base58-encoded   representation. See 7.<bip32Decode the Base58-encoded  representation. See 8.=bip327Decode the Base58-encoded representation of either and   or an  .>bip32Decode the 78 raw   bytes.?bip32Decode the 78 raw  bytes.@bip32Encode the 78 raw   or  bytes.Wbip324 bytes.A  !"#$%&'()*+,-./0123456789:;<=>?@A87<;=:9?>@+.14-036 ,/25'()* &  !"#$%X        !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPMNQRSTUVWXYZbip32-0.2-inplaceBIP32IndexunIndexChain Fingerprint unFingerprintDepthunDepthVersion unVersionXPub xpub_version xpub_depthxpub_fingerprint xpub_index xpub_chainxpub_pubXPrv xprv_version xprv_depthxprv_fingerprint xprv_index xprv_chainxprv_prv xprvToXPub version_xprv version_xpub version_tprv version_tpub version_Ltpv version_Ltub version_ttpv version_ttub fingerprintchainunChainindexIsHardened indexNext subXPrvXPrv subXPubXPub subXPrvXPub subPrvPrv subPubPub subPrvPub subsXPrvXPrv subsXPubXPub subsXPrvXPub subsPrvPrv subsPubPub subsPrvPub encodeXPub encodeXPrv encodeXPubRaw encodeXPrvRaw decodeXPub decodeXPrvdecode decodeXPubRaw decodeXPrvRaw decodeRaw $fShowChain $fEqVersion $fShowVersion $fEqDepth $fShowDepth$fEqFingerprint$fShowFingerprint $fEqChain $fEqIndex $fOrdIndex $fShowIndex$fEqXPub $fShowXPub$fEqXPrv $fShowXPrvKeyId'bitcoin-keys-0.1-Kv02UDWoOOV24RgtwYXF6FBitcoin.Keys.GHCPubKeyPrvbase GHC.MaybeNothingbytestring-0.10.10.0Data.ByteString.Internal ByteString encodeRawword32BE