Class BinarysearchVerifier

bitvm/src/signatures/winternitz.rs:528–528

Winternitz signature verification using binary search. ## Verification Algorithm Simulates a for loop of hashing using binary search on the digit. ## Signature Format - `hash(digits[0])` - `digits[0]` - `hash(digits[1])` - `digits[1]` - ... - `hash(digits[n + m - 1])` - `digits[n + m - 1]` There are `n` message digits followed by `m` checksum digits. ## Approximate Max Stack Depth Used Durin

///
/// 2 * `total_length()`
pub struct BinarysearchVerifier {}

impl Verifier for BinarysearchVerifier {
    fn verify_digits(ps: &Parameters, public_key: &PublicKey) -> Script {