mirror of
https://github.com/logos-messaging/logos-messaging-nim.git
synced 2026-01-07 08:23:08 +00:00
chore: simplify process
This commit is contained in:
parent
0f52e537d3
commit
a3803ad20a
@ -98,11 +98,7 @@ proc uint64ToField*(n: uint64): array[32, byte] =
|
||||
result[0 ..< bytes.len] = bytes
|
||||
|
||||
proc UInt256ToField*(v: UInt256): array[32, byte] =
|
||||
var bytes: array[32, byte]
|
||||
let vBytes = v.toBytesBE()
|
||||
for i in 0 .. 31:
|
||||
bytes[i] = vBytes[31 - i]
|
||||
return bytes
|
||||
return cast[array[32, byte]](v)
|
||||
|
||||
proc seqToField*(s: seq[byte]): array[32, byte] =
|
||||
result = default(array[32, byte])
|
||||
@ -110,18 +106,6 @@ proc seqToField*(s: seq[byte]): array[32, byte] =
|
||||
for i in 0 ..< len:
|
||||
result[i] = s[i]
|
||||
|
||||
proc uint256ToBinarySeq*(value: UInt256, len: int): seq[byte] =
|
||||
result = newSeq[byte](len) # Create a sequence of specified length
|
||||
var v = value
|
||||
|
||||
# Fill from least significant bit (little-endian)
|
||||
for i in 0 ..< len:
|
||||
if v mod 2 == 1:
|
||||
result[i] = 1
|
||||
else:
|
||||
result[i] = 0
|
||||
v = v shr 1 # Shift right by 1 bit
|
||||
|
||||
proc fetchMerkleProofElements*(
|
||||
g: OnchainGroupManager
|
||||
): Future[Result[seq[byte], string]] {.async.} =
|
||||
@ -433,6 +417,7 @@ method generateProof*(
|
||||
)
|
||||
|
||||
let serializedWitness = serialize(witness)
|
||||
|
||||
debug "--- serializedWitness ---", before = witness, after = serializedWitness
|
||||
var input_witness_buffer = toBuffer(serializedWitness)
|
||||
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user