Function zebra_chain::orchard::sinsemilla::sinsemilla_hash_to_point

pub fn sinsemilla_hash_to_point(D: &[u8], M: &BitVec<u8, Lsb0>) -> Option<Point>

“…an algebraic hash function with collision resistance (for fixed input length) derived from assumed hardness of the Discrete Logarithm Problem on the Pallas curve.”

SinsemillaHash is used in the definitions of Sinsemilla commitments and of the Sinsemilla hash for the Orchard incremental Merkle tree (§ 5.4.1.3 ‘MerkleCRH^Orchard Hash Function’).

SinsemillaHashToPoint(𝐷: B^Y^[N] , 𝑀 : B ^[{0 .. 𝑘·𝑐}] ) → P ∪ {⊥}

https://zips.z.cash/protocol/nu5.pdf#concretesinsemillahash

Panics

If M is greater than k*c = 2530 bits.