def lit

bend-collections-laws-crypto@1.0.0.0 · src/crypto/ed25519/point.bend:46

import Base

46# k itself; taking an input list xs keeps the proof checker from computing
47# with the constant k while xs is unknown (it would otherwise evaluate the
48# whole field arithmetic on constants whenever it compares two terms)
49def lit(xs: List<&2, U32>, k: List<&2, U32>) -> List<&2, U32>:
50  match xs:
51    case Nil{}:
52      k
53    case Con{h, t}:
54      k