mirror of
https://github.com/logos-storage/plonky2.git
synced 2026-01-10 17:53:06 +00:00
new padding
This commit is contained in:
Nicholas Ward
parent
476e769153
commit
89c79208fe
@ -1,391 +1,118 @@
|
||||
global count_bits:
|
||||
JUMPDEST
|
||||
// stack: n (assumed to be > 0)
|
||||
push 0
|
||||
// stack: 0, n
|
||||
swap1
|
||||
// stack: n, 0
|
||||
%jump(count_bits_loop)
|
||||
count_bits_loop:
|
||||
JUMPDEST
|
||||
// stack: k, bits
|
||||
%div2
|
||||
// stack: k//2, bits
|
||||
swap1
|
||||
// stack: bits, k//2
|
||||
%increment
|
||||
// stack: bits+1, k//2
|
||||
swap1
|
||||
// stack: k//2, bits+1
|
||||
%jumpi(count_bits_loop)
|
||||
// stack: 0, bits
|
||||
pop
|
||||
// stack: bits
|
||||
|
||||
global sha2_store:
|
||||
JUMPDEST
|
||||
// stack: num_u256s, x[0], x[1], x[2], ... , x[num_u256s-1]
|
||||
dup1
|
||||
// stack: num_u256s, num_u256s, x[0], x[1], x[2], ... , x[num_u256s-1]
|
||||
// TODO: use kernel memory, and start address not at 0
|
||||
push 0
|
||||
// stack: addr=0, num_u256s, num_u256s, x[0], x[1], x[2], ... , x[num_u256s-1]
|
||||
mstore
|
||||
// stack: num_u256s, x[0], x[1], x[2], ... , x[num_u256s-1]
|
||||
push 1
|
||||
// stack: addr=1, counter=num_u256s, x[0], x[1], x[2], ... , x[num_u256s-1]
|
||||
sha2_store_loop:
|
||||
JUMPDEST
|
||||
// stack: addr, counter, x[num_u256s-counter], ... , x[num_u256s-1]
|
||||
dup1
|
||||
// stack: addr, addr, counter, x[num_u256s-counter], ... , x[num_u256s-1]
|
||||
swap3
|
||||
// stack: x[num_u256s-counter], addr, counter, addr, ... , x[num_u256s-1]
|
||||
swap1
|
||||
// stack: addr, x[num_u256s-counter], counter, addr, ... , x[num_u256s-1]
|
||||
mstore
|
||||
// stack: counter, addr, ... , x[num_u256s-1]
|
||||
%decrement
|
||||
// stack: counter-1, addr, ... , x[num_u256s-1]
|
||||
iszero
|
||||
%jumpi(sha2_store_end)
|
||||
swap1
|
||||
// stack: addr, counter-1, ... , x[num_u256s-1]
|
||||
%increment
|
||||
// stack: addr+1, counter-1, ... , x[num_u256s-1]
|
||||
%jump(sha2_store_loop)
|
||||
sha2_store_end:
|
||||
JUMPDEST
|
||||
|
||||
// Precodition: input is in memory, starting at [TODO: fix] 0, of the form
|
||||
// num_u256s, x[0], x[1], ..., x[num_u256s-1]
|
||||
// Postcodition: input is in memory, starting at [TODO: fix] 0, of the form
|
||||
// num_bytes, x[0], x[1], ..., x[(num_bytes+31)/32-1]
|
||||
// Postcodition: output is in memory, starting at [TODO: fix] 0, of the form
|
||||
// num_blocks, block0[0], block0[1], block1[0], ..., blocklast[1]
|
||||
global sha2_pad:
|
||||
// TODO: use kernel memory, and start address not at 0
|
||||
push 0
|
||||
mload
|
||||
// stack: num_u256s
|
||||
// stack: num_bytes
|
||||
// STEP 1: append 1
|
||||
// add 1 << (8*(32-k)-1) to x[num_bytes//32], where k := num_bytes%32
|
||||
dup1
|
||||
// stack: num_u256s, num_u256s
|
||||
%iseven
|
||||
// stack: is_even, num_u256s
|
||||
// stack: num_bytes, num_bytes
|
||||
dup1
|
||||
// stack: num_bytes, num_bytes, num_bytes
|
||||
push 32
|
||||
// stack: 32, num_bytes, num_bytes, num_bytes
|
||||
swap1
|
||||
// stack: num_u256s, is_even
|
||||
dup1
|
||||
// stack: num_u256s, num_u256s, is_even
|
||||
mload
|
||||
// stack: x[num_u256s-1], num_u256s, is_even
|
||||
dup1
|
||||
// stack: x[num_u256s-1], x[num_u256s-1], num_u256s, is_even
|
||||
%count_bits
|
||||
// stack: num_bits, x[num_u256s-1], num_u256s, is_even
|
||||
dup1
|
||||
// stack: num_bits, num_bits, x[num_u256s-1], num_u256s, is_even
|
||||
swap3
|
||||
// stack: num_u256s, num_bits, x[num_u256s-1], num_bits, is_even
|
||||
// stack: num_bytes, 32, num_bytes, num_bytes
|
||||
mod
|
||||
// stack: k := num_bytes % 32, num_bytes, num_bytes
|
||||
push 32
|
||||
sub
|
||||
// stack: 32 - k, num_bytes, num_bytes
|
||||
push 8
|
||||
mul
|
||||
// stack: 8 * (32 - k), num_bytes, num_bytes
|
||||
%decrement
|
||||
// stack: num_u256s-1, num_bits, x[num_u256s-1], num_bits, is_even
|
||||
push 256
|
||||
mul
|
||||
// stack: (num_u256s-1)*256, num_bits, x[num_u256s-1], num_bits, is_even
|
||||
add
|
||||
// stack: message_bits, x[num_u256s-1], num_bits, is_even
|
||||
swap2
|
||||
// stack: num_bits, x[num_u256s-1], message_bits, is_even
|
||||
dup1
|
||||
// stack: num_bits, num_bits, x[num_u256s-1], message_bits, is_even
|
||||
dup1
|
||||
// stack: num_bits, num_bits, num_bits, x[num_u256s-1], message_bits, is_even
|
||||
dup1
|
||||
%lt(191)
|
||||
// stack: num_bits<191, num_bits, num_bits,x[num_u256s-1], message_bits, is_even
|
||||
// stack: 8 * (32 - k) - 1, num_bytes, num_bytes
|
||||
push 1
|
||||
swap1
|
||||
// stack: num_bits, num_bits<191, num_bits, x[num_u256s-1], message_bits, is_even
|
||||
shl
|
||||
// stack: 1 << (8 * (32 - k) - 1), num_bytes, num_bytes
|
||||
swap1
|
||||
// stack: num_bytes, 1 << (8 * (32 - k) - 1), num_bytes
|
||||
push 32
|
||||
swap1
|
||||
div
|
||||
// stack: num_bytes // 32, 1 << (8 * (32 - k) - 1), num_bytes
|
||||
dup1
|
||||
%eq(256)
|
||||
// stack: num_bits==256, num_bits<191, num_bits, x[num_u256s-1], message_bits, is_even
|
||||
push 0
|
||||
// stack: 0, num_bits==256, num_bits<191, num_bits, x[num_u256s-1], message_bits, is_even
|
||||
swap6
|
||||
// stack: is_even, num_bits==256, num_bits<191, num_bits, x[num_u256s-1], message_bits
|
||||
dup2
|
||||
dup2
|
||||
and
|
||||
%jumpi(pad_case1)
|
||||
not
|
||||
// stack: is_odd, num_bits==256, num_bits<191, num_bits, x[num_u256s-1], message_bits
|
||||
dup2
|
||||
dup2
|
||||
and
|
||||
%jumpi(pad_case2)
|
||||
swap1
|
||||
// stack: num_bits==256, is_odd, num_bits<191, num_bits, x[num_u256s-1], message_bits
|
||||
pop
|
||||
// stack: is_odd, num_bits<191, num_bits, x[num_u256s-1], message_bits
|
||||
not
|
||||
// stack: is_even, num_bits<191, num_bits, x[num_u256s-1], message_bits
|
||||
dup2
|
||||
dup2
|
||||
and
|
||||
%jumpi(pad_case3)
|
||||
not
|
||||
// stack: is_odd, num_bits<191, num_bits, x[num_u256s-1], message_bits
|
||||
dup2
|
||||
dup2
|
||||
and
|
||||
%jumpi(pad_case4)
|
||||
swap1
|
||||
// stack: num_bits<191, is_odd, num_bits, x[num_u256s-1], message_bits
|
||||
pop
|
||||
// stack: is_odd, num_bits, x[num_u256s-1], message_bits
|
||||
not
|
||||
// stack: is_even, num_bits, x[num_u256s-1], message_bits
|
||||
%jumpi(pad_case5)
|
||||
%jump(pad_case6)
|
||||
pad_case1:
|
||||
// CASE 1: num_u256s is even; num_bits == 256
|
||||
JUMPDEST
|
||||
// stack: is_odd, num_bits==256, num_bits<191, num_bits, x[num_u256s-1], message_bits
|
||||
%pop5
|
||||
// stack: message_bits
|
||||
push 0
|
||||
// stack: num_bytes // 32, num_bytes // 32, 1 << (8 * (32 - k) - 1), num_bytes
|
||||
mload
|
||||
// stack: num_u256s, message_bits
|
||||
%increment
|
||||
// stack: num_u256s+1, message_bits
|
||||
// stack: x[num_bytes // 32], num_bytes // 32, 1 << (8 * (32 - k) - 1), num_bytes
|
||||
swap1
|
||||
// stack: num_bytes // 32, x[num_bytes // 32], 1 << (8 * (32 - k) - 1), num_bytes
|
||||
swap2
|
||||
// stack: x[num_bytes // 32], 1 << (8 * (32 - k) - 1), num_bytes // 32, num_bytes
|
||||
add
|
||||
// stack: x[num_bytes // 32] + 1 << (8 * (32 - k) - 1), num_bytes // 32, num_bytes
|
||||
swap1
|
||||
// stack: num_bytes // 32, x[num_bytes // 32] + 1 << (8 * (32 - k) - 1), num_bytes
|
||||
mstore
|
||||
// stack: num_bytes
|
||||
// STEP 2: insert length
|
||||
// (add length := num_bytes*8+1 to x[(num_bytes//64)*2-1])
|
||||
dup1
|
||||
// stack: num_u256s+1, num_u256s+1, message_bits
|
||||
dup1
|
||||
// stack: num_bytes, num_bytes, num_bytes
|
||||
push 8
|
||||
mul
|
||||
%increment
|
||||
// stack: length := num_bytes*8+1, num_bytes, num_bytes
|
||||
swap1
|
||||
// stack: num_bytes, length := num_bytes*8+1, num_bytes
|
||||
push 64
|
||||
swap1
|
||||
div
|
||||
// stack: num_bytes // 64, length := num_bytes*8+1, num_bytes
|
||||
push 2
|
||||
push 255
|
||||
%jump(exp)
|
||||
// stack: 2^255, num_u256s+1, num_u256s+1, message_bits
|
||||
mul
|
||||
%decrement
|
||||
// stack: (num_bytes // 64) * 2 - 1, length := num_bytes*8+1, num_bytes
|
||||
dup1
|
||||
// stack: (num_bytes // 64) * 2 - 1, (num_bytes // 64) * 2 - 1, length, num_bytes
|
||||
mload
|
||||
// stack: x[(num_bytes // 64) * 2 - 1], (num_bytes // 64) * 2 - 1, length, num_bytes
|
||||
swap1
|
||||
// stack: (num_bytes // 64) * 2 - 1, x[(num_bytes // 64) * 2 - 1], length, num_bytes
|
||||
swap2
|
||||
// stack: length, x[(num_bytes // 64) * 2 - 1], (num_bytes // 64) * 2 - 1, num_bytes
|
||||
add
|
||||
// stack: x[(num_bytes // 64) * 2 - 1] + length, (num_bytes // 64) * 2 - 1, num_bytes
|
||||
swap1
|
||||
// stack: (num_bytes // 64) * 2 - 1, x[(num_bytes // 64) * 2 - 1] + length, num_bytes
|
||||
mstore
|
||||
// stack: num_bytes
|
||||
// STEP 3: insert num_blocks at start
|
||||
push 64
|
||||
swap
|
||||
// stack: num_u256s+1, 2^255, num_u256s+1, message_bits
|
||||
mstore
|
||||
// stack: num_u256s+1, message_bits
|
||||
div
|
||||
%increment
|
||||
// stack: num_u256s+2, message_bits
|
||||
dup1
|
||||
// stack: num_u256s+2, num_u256s+2, message_bits
|
||||
swap2
|
||||
// stack: message_bits, num_u256s+2, num_u256s+2
|
||||
swap1
|
||||
// stack: num_u256s+2, message_bits, num_u256s+2
|
||||
mstore
|
||||
// stack: num_u256s+2
|
||||
%div2
|
||||
// stack: num_blocks=(num_u256s+2)//2
|
||||
// stack: num_blocks := num_bytes // 64 + 1
|
||||
push 0
|
||||
mstore
|
||||
%jump(pad_end)
|
||||
pad_case2:
|
||||
// CASE 2: num_u256s is odd; num_bits == 256
|
||||
|
||||
// Precodition: stack contains address of one message block, followed by output address
|
||||
// Postcondition: 64 addresses starting at given output address contain 32-bit chunks of message schedule
|
||||
global sha2_gen_message_schedule_from_block:
|
||||
JUMPDEST
|
||||
// stack: is_even, num_bits==256, num_bits<191, num_bits, x[num_u256s-1], message_bits
|
||||
%pop5
|
||||
// stack: message_bits
|
||||
push 0
|
||||
// stack: block_addr, output_addr
|
||||
mload
|
||||
// stack: num_u256s, message_bits
|
||||
%increment
|
||||
// stack: num_u256s+1, message_bits
|
||||
swap
|
||||
// stack: message_bits, num_u256s+1
|
||||
push 2
|
||||
push 255
|
||||
%jump(exp)
|
||||
add
|
||||
// stack: 2^255 + message_bits, num_u256s+1
|
||||
swap1
|
||||
// stack: num_u256s+1, 2^255 + message_bits
|
||||
dup1
|
||||
// stack: num_u256s+1, num_u256s+1, 2^255 + message_bits
|
||||
swap2
|
||||
// stack: 2^255 + message_bits, num_u256s+1, num_u256s+1
|
||||
swap1
|
||||
// stack: num_u256s+1, 2^255 + message_bits, num_u256s+1
|
||||
mstore
|
||||
// stack: num_u256s+1
|
||||
div2
|
||||
// stack: num_blocks=(num_u256s+1)//2
|
||||
push 0
|
||||
mstore
|
||||
%jump(pad_end)
|
||||
pad_case3:
|
||||
// CASE 3: num_u256s is even; num_bits < 191
|
||||
JUMPDEST
|
||||
// stack: is_even, num_bits<191, num_bits, x[num_u256s-1], message_bits
|
||||
%pop2
|
||||
// stack: num_bits, x[num_u256s-1], message_bits
|
||||
swap1
|
||||
// stack: x[num_u256s-1], num_bits, message_bits
|
||||
push 2
|
||||
mul
|
||||
%increment
|
||||
// stack: 2*x[num_u256s-1]+1, num_bits, message_bits
|
||||
swap1
|
||||
// stack: num_bits, 2*x[num_u256s-1]+1, message_bits
|
||||
push 255
|
||||
sub
|
||||
// stack: 256 - (num_bits + 1), 2*x[num_u256s-1]+1, message_bits
|
||||
push 2
|
||||
%jump(exp)
|
||||
// stack: 2^(256 - (num_bits + 1)), 2*x[num_u256s-1]+1, message_bits
|
||||
mul
|
||||
// stack: [x[num_u256s-1] || 1 || 0s], message_bits
|
||||
add
|
||||
// stack: [x[num_u256s-1] || 1 || 0s | message_bits]
|
||||
push 0
|
||||
mload
|
||||
// stack: num_u256s, [x[num_u256s-1] || 1 || 0s | message_bits]
|
||||
mstore
|
||||
push 0
|
||||
mload
|
||||
// stack: num_u256s
|
||||
%div2
|
||||
// stack: num_blocks=num_u256s//2
|
||||
push 0
|
||||
mstore
|
||||
%jump(pad_end)
|
||||
pad_case4:
|
||||
// CASE 4: num_u256s is odd; num_bits < 191
|
||||
JUMPDEST
|
||||
// stack: is_odd, num_bits<191, num_bits, x[num_u256s-1], message_bits
|
||||
%pop2
|
||||
// stack: num_bits, x[num_u256s-1], message_bits
|
||||
swap1
|
||||
// stack: x[num_u256s-1], num_bits, message_bits
|
||||
push 2
|
||||
mul
|
||||
%increment
|
||||
// stack: 2*x[num_u256s-1]+1, num_bits, message_bits
|
||||
swap1
|
||||
// stack: num_bits, 2*x[num_u256s-1]+1, message_bits
|
||||
push 255
|
||||
sub
|
||||
// stack: 256 - (num_bits + 1), 2*x[num_u256s-1]+1, message_bits
|
||||
push 2
|
||||
%jump(exp)
|
||||
// stack: 2^(256 - (num_bits + 1)), 2*x[num_u256s-1]+1, message_bits
|
||||
mul
|
||||
// stack: [x[num_u256s-1] || 1 || 0s], message_bits
|
||||
push 0
|
||||
mload
|
||||
// stack: num_u256s, [x[num_u256s-1] || 1 || 0s], message_bits
|
||||
mstore
|
||||
// stack: message_bits
|
||||
push 0
|
||||
mload
|
||||
// stack: num_u256s, message_bits
|
||||
%increment
|
||||
// stack: num_u256s+1, message_bits
|
||||
mstore
|
||||
push 0
|
||||
mload
|
||||
// stack: num_u256s
|
||||
%increment
|
||||
// stack: num_u256s+1
|
||||
%div2
|
||||
// stack: num_blocks=(num_u256s+1)//2
|
||||
push 0
|
||||
mstore
|
||||
%jump(pad_end)
|
||||
pad_case5:
|
||||
// CASE 5: num_u256s is even; 191 <= num_bits < 256
|
||||
JUMPDEST
|
||||
// stack: is_even, num_bits, x[num_u256s-1], message_bits
|
||||
pop
|
||||
// stack: num_bits, x[num_u256s-1], message_bits
|
||||
swap1
|
||||
// stack: x[num_u256s-1], num_bits, message_bits
|
||||
push 2
|
||||
mul
|
||||
%increment
|
||||
// stack: 2*x[num_u256s-1]+1, num_bits, message_bits
|
||||
swap1
|
||||
// stack: num_bits, 2*x[num_u256s-1]+1, message_bits
|
||||
push 255
|
||||
sub
|
||||
// stack: 256 - (num_bits + 1), 2*x[num_u256s-1]+1, message_bits
|
||||
push 2
|
||||
%jump(exp)
|
||||
// stack: 2^(256 - (num_bits + 1)), 2*x[num_u256s-1]+1, message_bits
|
||||
mul
|
||||
// stack: [x[num_u256s-1] || 1 || 0s], message_bits
|
||||
push 0
|
||||
mload
|
||||
// stack: num_u256s, [x[num_u256s-1] || 1 || 0s], message_bits
|
||||
dup1
|
||||
// stack: num_u256s, num_u256s, [x[num_u256s-1] || 1 || 0s], message_bits
|
||||
swap2
|
||||
// stack: [x[num_u256s-1] || 1 || 0s], num_u256s, num_u256s, message_bits
|
||||
swap1
|
||||
// stack: num_u256s, [x[num_u256s-1] || 1 || 0s], num_u256s, message_bits
|
||||
mstore
|
||||
// stack: num_u256s, message_bits
|
||||
push 2
|
||||
add
|
||||
// stack: num_u256s+2, message_bits
|
||||
dup1
|
||||
// stack: num_u256s+2, num_u256s+2, message_bits
|
||||
swap2
|
||||
// stack: message_bits, num_u256s+2, num_u256s+2
|
||||
swap1
|
||||
// stack: num_u256s+2, message_bits, num_u256s+2
|
||||
mstore
|
||||
// stack: num_u256s+2
|
||||
div2
|
||||
// stack: num_blocks=(num_u256s+2)//2
|
||||
push 0
|
||||
mstore
|
||||
%jump(pad_end)
|
||||
pad_case6:
|
||||
// CASE 6: num_u256s is odd; 191 <= num_bits < 256
|
||||
JUMPDEST
|
||||
// stack: is_even, num_bits, x[num_u256s-1], message_bits
|
||||
pop
|
||||
// stack: num_bits, x[num_u256s-1], message_bits
|
||||
swap1
|
||||
// stack: x[num_u256s-1], num_bits, message_bits
|
||||
push 2
|
||||
mul
|
||||
%increment
|
||||
// stack: 2*x[num_u256s-1]+1, num_bits, message_bits
|
||||
swap1
|
||||
// stack: num_bits, 2*x[num_u256s-1]+1, message_bits
|
||||
push 255
|
||||
sub
|
||||
// stack: 256 - (num_bits + 1), 2*x[num_u256s-1]+1, message_bits
|
||||
push 2
|
||||
%jump(exp)
|
||||
// stack: 2^(256 - (num_bits + 1)), 2*x[num_u256s-1]+1, message_bits
|
||||
mul
|
||||
// stack: [x[num_u256s-1] || 1 || 0s], message_bits
|
||||
push 0
|
||||
mload
|
||||
// stack: num_u256s, [x[num_u256s-1] || 1 || 0s], message_bits
|
||||
dup1
|
||||
// stack: num_u256s, num_u256s, [x[num_u256s-1] || 1 || 0s], message_bits
|
||||
swap2
|
||||
// stack: [x[num_u256s-1] || 1 || 0s], num_u256s, num_u256s, message_bits
|
||||
swap1
|
||||
// stack: num_u256s, [x[num_u256s-1] || 1 || 0s], num_u256s, message_bits
|
||||
mstore
|
||||
// stack: num_u256s, message_bits
|
||||
%increment
|
||||
// stack: num_u256s+1, message_bits
|
||||
dup1
|
||||
// stack: num_u256s+1, num_u256s+1, message_bits
|
||||
swap2
|
||||
// stack: message_bits, num_u256s+1, num_u256s+1
|
||||
swap1
|
||||
// stack: num_u256s+1, message_bits, num_u256s+1
|
||||
mstore
|
||||
// stack: num_u256s+1
|
||||
div2
|
||||
// stack: num_blocks=(num_u256s+1)//2
|
||||
push 0
|
||||
mstore
|
||||
pad_end:
|
||||
// stack: block, output_addr
|
||||
push 16
|
||||
// stack: counter=16, block, output_addr
|
||||
|
||||
|
||||
global sha2_message_schedule_next_word:
|
||||
JUMPDEST
|
||||
// stack: address
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
global sha2_gen_message_schedules:
|
||||
JUMPDEST
|
||||
Loading…
x
Reference in New Issue
Block a user