module Language.Bitcoin.Script.Descriptors.Syntax (
    ScriptDescriptor (..),
    KeyDescriptor (..),
    Origin (..),
    Key (..),
    KeyCollection (..),
    pubKey,
    secKey,
    keyDescPubKey,
    keyBytes,
) where

import Data.ByteString (ByteString)
import Haskoin.Address (Address)
import Haskoin.Keys (
    DerivPath,
    Fingerprint,
    PubKeyI (..),
    SecKeyI,
    XPubKey,
    derivePubKeyI,
    exportPubKey,
 )

data ScriptDescriptor
    = -- | P2SH embed the argument.
      Sh ScriptDescriptor
    | -- | P2WSH embed the argument.
      Wsh ScriptDescriptor
    | -- | P2PK output for the given public key.
      Pk KeyDescriptor
    | -- | P2PKH output for the given public key (use 'Addr' if you only know the pubkey hash).
      Pkh KeyDescriptor
    | -- | P2WPKH output for the given compressed pubkey.
      Wpkh KeyDescriptor
    | -- | An alias for the collection of pk(KEY) and pkh(KEY). If the key is
      -- compressed, it also includes wpkh(KEY) and sh(wpkh(KEY)).
      Combo KeyDescriptor
    | -- | k-of-n multisig script.
      Multi Int [KeyDescriptor]
    | -- | k-of-n multisig script with keys sorted lexicographically in the resulting script.
      SortedMulti Int [KeyDescriptor]
    | -- | the script which ADDR expands to.
      Addr Address
    | -- | the script whose hex encoding is HEX.
      Raw ByteString
    deriving (ScriptDescriptor -> ScriptDescriptor -> Bool
(ScriptDescriptor -> ScriptDescriptor -> Bool)
-> (ScriptDescriptor -> ScriptDescriptor -> Bool)
-> Eq ScriptDescriptor
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: ScriptDescriptor -> ScriptDescriptor -> Bool
$c/= :: ScriptDescriptor -> ScriptDescriptor -> Bool
== :: ScriptDescriptor -> ScriptDescriptor -> Bool
$c== :: ScriptDescriptor -> ScriptDescriptor -> Bool
Eq, Int -> ScriptDescriptor -> ShowS
[ScriptDescriptor] -> ShowS
ScriptDescriptor -> String
(Int -> ScriptDescriptor -> ShowS)
-> (ScriptDescriptor -> String)
-> ([ScriptDescriptor] -> ShowS)
-> Show ScriptDescriptor
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [ScriptDescriptor] -> ShowS
$cshowList :: [ScriptDescriptor] -> ShowS
show :: ScriptDescriptor -> String
$cshow :: ScriptDescriptor -> String
showsPrec :: Int -> ScriptDescriptor -> ShowS
$cshowsPrec :: Int -> ScriptDescriptor -> ShowS
Show)

data KeyDescriptor = KeyDescriptor
    { KeyDescriptor -> Maybe Origin
origin :: Maybe Origin
    , KeyDescriptor -> Key
keyDef :: Key
    }
    deriving (KeyDescriptor -> KeyDescriptor -> Bool
(KeyDescriptor -> KeyDescriptor -> Bool)
-> (KeyDescriptor -> KeyDescriptor -> Bool) -> Eq KeyDescriptor
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: KeyDescriptor -> KeyDescriptor -> Bool
$c/= :: KeyDescriptor -> KeyDescriptor -> Bool
== :: KeyDescriptor -> KeyDescriptor -> Bool
$c== :: KeyDescriptor -> KeyDescriptor -> Bool
Eq, Int -> KeyDescriptor -> ShowS
[KeyDescriptor] -> ShowS
KeyDescriptor -> String
(Int -> KeyDescriptor -> ShowS)
-> (KeyDescriptor -> String)
-> ([KeyDescriptor] -> ShowS)
-> Show KeyDescriptor
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [KeyDescriptor] -> ShowS
$cshowList :: [KeyDescriptor] -> ShowS
show :: KeyDescriptor -> String
$cshow :: KeyDescriptor -> String
showsPrec :: Int -> KeyDescriptor -> ShowS
$cshowsPrec :: Int -> KeyDescriptor -> ShowS
Show)

data Origin = Origin
    { Origin -> Fingerprint
fingerprint :: Fingerprint
    , Origin -> DerivPath
derivation :: DerivPath
    }
    deriving (Origin -> Origin -> Bool
(Origin -> Origin -> Bool)
-> (Origin -> Origin -> Bool) -> Eq Origin
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Origin -> Origin -> Bool
$c/= :: Origin -> Origin -> Bool
== :: Origin -> Origin -> Bool
$c== :: Origin -> Origin -> Bool
Eq, Eq Origin
Eq Origin =>
(Origin -> Origin -> Ordering)
-> (Origin -> Origin -> Bool)
-> (Origin -> Origin -> Bool)
-> (Origin -> Origin -> Bool)
-> (Origin -> Origin -> Bool)
-> (Origin -> Origin -> Origin)
-> (Origin -> Origin -> Origin)
-> Ord Origin
Origin -> Origin -> Bool
Origin -> Origin -> Ordering
Origin -> Origin -> Origin
forall a.
Eq a =>
(a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
min :: Origin -> Origin -> Origin
$cmin :: Origin -> Origin -> Origin
max :: Origin -> Origin -> Origin
$cmax :: Origin -> Origin -> Origin
>= :: Origin -> Origin -> Bool
$c>= :: Origin -> Origin -> Bool
> :: Origin -> Origin -> Bool
$c> :: Origin -> Origin -> Bool
<= :: Origin -> Origin -> Bool
$c<= :: Origin -> Origin -> Bool
< :: Origin -> Origin -> Bool
$c< :: Origin -> Origin -> Bool
compare :: Origin -> Origin -> Ordering
$ccompare :: Origin -> Origin -> Ordering
$cp1Ord :: Eq Origin
Ord, Int -> Origin -> ShowS
[Origin] -> ShowS
Origin -> String
(Int -> Origin -> ShowS)
-> (Origin -> String) -> ([Origin] -> ShowS) -> Show Origin
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Origin] -> ShowS
$cshowList :: [Origin] -> ShowS
show :: Origin -> String
$cshow :: Origin -> String
showsPrec :: Int -> Origin -> ShowS
$cshowsPrec :: Int -> Origin -> ShowS
Show)

data Key
    = -- | DER-hex encoded secp256k1 public key
      Pubkey PubKeyI
    | -- | (de)serialized as WIF
      SecretKey SecKeyI
    | XPub XPubKey DerivPath KeyCollection
    deriving (Key -> Key -> Bool
(Key -> Key -> Bool) -> (Key -> Key -> Bool) -> Eq Key
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Key -> Key -> Bool
$c/= :: Key -> Key -> Bool
== :: Key -> Key -> Bool
$c== :: Key -> Key -> Bool
Eq, Int -> Key -> ShowS
[Key] -> ShowS
Key -> String
(Int -> Key -> ShowS)
-> (Key -> String) -> ([Key] -> ShowS) -> Show Key
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Key] -> ShowS
$cshowList :: [Key] -> ShowS
show :: Key -> String
$cshow :: Key -> String
showsPrec :: Int -> Key -> ShowS
$cshowsPrec :: Int -> Key -> ShowS
Show)

-- | Simple explicit public key with no origin information
pubKey :: PubKeyI -> KeyDescriptor
pubKey :: PubKeyI -> KeyDescriptor
pubKey = Maybe Origin -> Key -> KeyDescriptor
KeyDescriptor Maybe Origin
forall a. Maybe a
Nothing (Key -> KeyDescriptor)
-> (PubKeyI -> Key) -> PubKeyI -> KeyDescriptor
forall b c a. (b -> c) -> (a -> b) -> a -> c
. PubKeyI -> Key
Pubkey

-- | Simple explicit secret key with no origin information
secKey :: SecKeyI -> KeyDescriptor
secKey :: SecKeyI -> KeyDescriptor
secKey = Maybe Origin -> Key -> KeyDescriptor
KeyDescriptor Maybe Origin
forall a. Maybe a
Nothing (Key -> KeyDescriptor)
-> (SecKeyI -> Key) -> SecKeyI -> KeyDescriptor
forall b c a. (b -> c) -> (a -> b) -> a -> c
. SecKeyI -> Key
SecretKey

-- | Represent whether the key corresponds to a collection (and how) or a single key.
data KeyCollection
    = Single
    | -- | immediate hardened children
      HardKeys
    | -- | immediate non-hardened children
      SoftKeys
    deriving (KeyCollection -> KeyCollection -> Bool
(KeyCollection -> KeyCollection -> Bool)
-> (KeyCollection -> KeyCollection -> Bool) -> Eq KeyCollection
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: KeyCollection -> KeyCollection -> Bool
$c/= :: KeyCollection -> KeyCollection -> Bool
== :: KeyCollection -> KeyCollection -> Bool
$c== :: KeyCollection -> KeyCollection -> Bool
Eq, Eq KeyCollection
Eq KeyCollection =>
(KeyCollection -> KeyCollection -> Ordering)
-> (KeyCollection -> KeyCollection -> Bool)
-> (KeyCollection -> KeyCollection -> Bool)
-> (KeyCollection -> KeyCollection -> Bool)
-> (KeyCollection -> KeyCollection -> Bool)
-> (KeyCollection -> KeyCollection -> KeyCollection)
-> (KeyCollection -> KeyCollection -> KeyCollection)
-> Ord KeyCollection
KeyCollection -> KeyCollection -> Bool
KeyCollection -> KeyCollection -> Ordering
KeyCollection -> KeyCollection -> KeyCollection
forall a.
Eq a =>
(a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
min :: KeyCollection -> KeyCollection -> KeyCollection
$cmin :: KeyCollection -> KeyCollection -> KeyCollection
max :: KeyCollection -> KeyCollection -> KeyCollection
$cmax :: KeyCollection -> KeyCollection -> KeyCollection
>= :: KeyCollection -> KeyCollection -> Bool
$c>= :: KeyCollection -> KeyCollection -> Bool
> :: KeyCollection -> KeyCollection -> Bool
$c> :: KeyCollection -> KeyCollection -> Bool
<= :: KeyCollection -> KeyCollection -> Bool
$c<= :: KeyCollection -> KeyCollection -> Bool
< :: KeyCollection -> KeyCollection -> Bool
$c< :: KeyCollection -> KeyCollection -> Bool
compare :: KeyCollection -> KeyCollection -> Ordering
$ccompare :: KeyCollection -> KeyCollection -> Ordering
$cp1Ord :: Eq KeyCollection
Ord, Int -> KeyCollection -> ShowS
[KeyCollection] -> ShowS
KeyCollection -> String
(Int -> KeyCollection -> ShowS)
-> (KeyCollection -> String)
-> ([KeyCollection] -> ShowS)
-> Show KeyCollection
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [KeyCollection] -> ShowS
$cshowList :: [KeyCollection] -> ShowS
show :: KeyCollection -> String
$cshow :: KeyCollection -> String
showsPrec :: Int -> KeyCollection -> ShowS
$cshowsPrec :: Int -> KeyCollection -> ShowS
Show)

-- | Produce a key literal if possible
keyBytes :: KeyDescriptor -> Maybe ByteString
keyBytes :: KeyDescriptor -> Maybe ByteString
keyBytes = (PubKeyI -> ByteString) -> Maybe PubKeyI -> Maybe ByteString
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap PubKeyI -> ByteString
toBytes (Maybe PubKeyI -> Maybe ByteString)
-> (KeyDescriptor -> Maybe PubKeyI)
-> KeyDescriptor
-> Maybe ByteString
forall b c a. (b -> c) -> (a -> b) -> a -> c
. KeyDescriptor -> Maybe PubKeyI
keyDescPubKey
  where
    toBytes :: PubKeyI -> ByteString
toBytes (PubKeyI pk :: PubKey
pk c :: Bool
c) = Bool -> PubKey -> ByteString
exportPubKey Bool
c PubKey
pk

-- | Produce a pubkey if possible
keyDescPubKey :: KeyDescriptor -> Maybe PubKeyI
keyDescPubKey :: KeyDescriptor -> Maybe PubKeyI
keyDescPubKey (KeyDescriptor _ k :: Key
k) = case Key
k of
    Pubkey pk :: PubKeyI
pk -> PubKeyI -> Maybe PubKeyI
forall a. a -> Maybe a
Just PubKeyI
pk
    SecretKey sk :: SecKeyI
sk -> PubKeyI -> Maybe PubKeyI
forall a. a -> Maybe a
Just (PubKeyI -> Maybe PubKeyI) -> PubKeyI -> Maybe PubKeyI
forall a b. (a -> b) -> a -> b
$ SecKeyI -> PubKeyI
derivePubKeyI SecKeyI
sk
    _ -> Maybe PubKeyI
forall a. Maybe a
Nothing