file_name
stringlengths 5
52
| name
stringlengths 4
95
| original_source_type
stringlengths 0
23k
| source_type
stringlengths 9
23k
| source_definition
stringlengths 9
57.9k
| source
dict | source_range
dict | file_context
stringlengths 0
721k
| dependencies
dict | opens_and_abbrevs
listlengths 2
94
| vconfig
dict | interleaved
bool 1
class | verbose_type
stringlengths 1
7.42k
| effect
stringclasses 118
values | effect_flags
sequencelengths 0
2
| mutual_with
sequencelengths 0
11
| ideal_premises
sequencelengths 0
236
| proof_features
sequencelengths 0
1
| is_simple_lemma
bool 2
classes | is_div
bool 2
classes | is_proof
bool 2
classes | is_simply_typed
bool 2
classes | is_type
bool 2
classes | partial_definition
stringlengths 5
3.99k
| completed_definiton
stringlengths 1
1.63M
| isa_cross_project_example
bool 1
class |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Vale.AES.X64.AES256.fst | Vale.AES.X64.AES256.va_lemma_KeyExpansionRoundUnrolledRecursive256 | val va_lemma_KeyExpansionRoundUnrolledRecursive256 : va_b0:va_code -> va_s0:va_state -> key:(seq
nat32) -> dst:buffer128 -> n:int
-> Ghost (va_state & va_fuel)(decreases %[n])
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundUnrolledRecursive256 n) va_s0 /\
va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (0 < n /\ n <= 14) /\ Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1
va_s0 == Vale.AES.AES256_helpers.expand_key_256 key 0 /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key 1 /\ va_get_xmm 1 va_s0 ==
Vale.X64.Decls.buffer128_read dst 0 (va_get_mem_heaplet 1 va_s0) /\ va_get_xmm 3 va_s0 ==
Vale.X64.Decls.buffer128_read dst 1 (va_get_mem_heaplet 1 va_s0) /\ va_get_reg64 rRdx va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 dst (va_get_mem_heaplet 1 va_s0)))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ Vale.X64.Decls.modifies_buffer128 dst (va_get_mem_heaplet 1
va_s0) (va_get_mem_heaplet 1 va_sM) /\ Vale.X64.Decls.buffer128_read dst n (va_get_mem_heaplet
1 va_sM) == (if (n `op_Modulus` 2 = 0) then va_get_xmm 1 va_sM else va_get_xmm 3 va_sM) /\
Vale.X64.Decls.buffer128_read dst (n - 1) (va_get_mem_heaplet 1 va_sM) == (if ((n - 1)
`op_Modulus` 2 = 0) then va_get_xmm 1 va_sM else va_get_xmm 3 va_sM) /\ (forall j .
{:pattern(buffer128_read dst j (va_get_mem_heaplet 1 va_sM))}0 <= j /\ j <= n ==>
Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_sM) ==
Vale.AES.AES256_helpers.expand_key_256 key j) /\ va_state_eq va_sM (va_update_flags va_sM
(va_update_xmm 4 va_sM (va_update_xmm 3 va_sM (va_update_xmm 2 va_sM (va_update_xmm 1 va_sM
(va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM va_s0)))))))))) | val va_lemma_KeyExpansionRoundUnrolledRecursive256 : va_b0:va_code -> va_s0:va_state -> key:(seq
nat32) -> dst:buffer128 -> n:int
-> Ghost (va_state & va_fuel)(decreases %[n])
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundUnrolledRecursive256 n) va_s0 /\
va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (0 < n /\ n <= 14) /\ Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1
va_s0 == Vale.AES.AES256_helpers.expand_key_256 key 0 /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key 1 /\ va_get_xmm 1 va_s0 ==
Vale.X64.Decls.buffer128_read dst 0 (va_get_mem_heaplet 1 va_s0) /\ va_get_xmm 3 va_s0 ==
Vale.X64.Decls.buffer128_read dst 1 (va_get_mem_heaplet 1 va_s0) /\ va_get_reg64 rRdx va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 dst (va_get_mem_heaplet 1 va_s0)))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ Vale.X64.Decls.modifies_buffer128 dst (va_get_mem_heaplet 1
va_s0) (va_get_mem_heaplet 1 va_sM) /\ Vale.X64.Decls.buffer128_read dst n (va_get_mem_heaplet
1 va_sM) == (if (n `op_Modulus` 2 = 0) then va_get_xmm 1 va_sM else va_get_xmm 3 va_sM) /\
Vale.X64.Decls.buffer128_read dst (n - 1) (va_get_mem_heaplet 1 va_sM) == (if ((n - 1)
`op_Modulus` 2 = 0) then va_get_xmm 1 va_sM else va_get_xmm 3 va_sM) /\ (forall j .
{:pattern(buffer128_read dst j (va_get_mem_heaplet 1 va_sM))}0 <= j /\ j <= n ==>
Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_sM) ==
Vale.AES.AES256_helpers.expand_key_256 key j) /\ va_state_eq va_sM (va_update_flags va_sM
(va_update_xmm 4 va_sM (va_update_xmm 3 va_sM (va_update_xmm 2 va_sM (va_update_xmm 1 va_sM
(va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM va_s0)))))))))) | let rec va_lemma_KeyExpansionRoundUnrolledRecursive256 va_b0 va_s0 key dst n =
va_reveal_opaque (`%va_code_KeyExpansionRoundUnrolledRecursive256)
(va_code_KeyExpansionRoundUnrolledRecursive256 n);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
let va_b2 = va_tl va_b1 in
let va_c2 = va_hd va_b1 in
let (va_fc2, va_s2) =
(
if (1 < n && n <= 14) then
(
let va_b3 = va_get_block va_c2 in
let (va_s4, va_fc4) = va_lemma_KeyExpansionRoundUnrolledRecursive256 (va_hd va_b3) va_s0 key
dst (n - 1) in
let va_b4 = va_tl va_b3 in
let (old_mem:vale_heap) = va_get_mem_heaplet 1 va_s4 in
let va_b6 = va_tl va_b4 in
let va_c6 = va_hd va_b4 in
let (va_fc6, va_s6) =
(
if (n `op_Modulus` 2 = 0) then
(
let va_b7 = va_get_block va_c6 in
let (va_s8, va_fc8) = va_lemma_KeyExpansionRoundEven256 (va_hd va_b7) va_s4 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1)) dst key in
let va_b8 = va_tl va_b7 in
let (va_s6, va_f8) = va_lemma_empty_total va_s8 va_b8 in
let va_fc6 = va_lemma_merge_total va_b7 va_s4 va_fc8 va_s8 va_f8 va_s6 in
(va_fc6, va_s6)
)
else
(
let va_b9 = va_get_block va_c6 in
let (va_s10, va_fc10) = va_lemma_KeyExpansionRoundOdd256 (va_hd va_b9) va_s4 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1)) dst key in
let va_b10 = va_tl va_b9 in
let (va_s6, va_f10) = va_lemma_empty_total va_s10 va_b10 in
let va_fc6 = va_lemma_merge_total va_b9 va_s4 va_fc10 va_s10 va_f10 va_s6 in
(va_fc6, va_s6)
)
) in
assert (forall j . {:pattern(buffer128_read dst j (va_get_mem_heaplet 1 va_s6))}0 <= j /\ j <
n ==> Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_s6) ==
Vale.X64.Decls.buffer128_read dst j old_mem);
let (va_s2, va_f6) = va_lemma_empty_total va_s6 va_b6 in
let va_f4 = va_lemma_merge_total va_b4 va_s4 va_fc6 va_s6 va_f6 va_s2 in
let va_fc2 = va_lemma_merge_total va_b3 va_s0 va_fc4 va_s4 va_f4 va_s2 in
(va_fc2, va_s2)
)
else
(
let va_b12 = va_get_block va_c2 in
let (va_s2, va_fc2) = va_lemma_empty_total va_s0 va_b12 in
(va_fc2, va_s2)
)
) in
let (va_sM, va_f2) = va_lemma_empty_total va_s2 va_b2 in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc2 va_s2 va_f2 va_sM in
(va_sM, va_fM) | {
"file_name": "obj/Vale.AES.X64.AES256.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 447,
"start_col": 0,
"start_line": 389
} | module Vale.AES.X64.AES256
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsVector
open Vale.X64.InsAes
open Vale.X64.QuickCode
open Vale.X64.QuickCodes
open Vale.Arch.Types
open Vale.AES.AES256_helpers
open Vale.X64.CPU_Features_s
#reset-options "--z3rlimit 20"
//-- KeyExpansionRoundEven256
val va_code_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansionRoundEven256 round rcon =
(va_Block (va_CCons (va_code_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon)
(va_CCons (va_code_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_CCons (va_code_VPslldq4
(va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm
4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4)
(va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_CCons
(va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) (16 `op_Multiply`
(round + 1)) Secret) (va_CNil ()))))))))))))
val va_codegen_success_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansionRoundEven256 round rcon =
(va_pbool_and (va_codegen_success_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon)
(va_pbool_and (va_codegen_success_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) (16 `op_Multiply` (round + 1)) Secret) (va_ttrue ())))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansionRoundEven256 (va_mods:va_mods_t) (round:nat64) (rcon:nat8) (dst:buffer128)
(key:(seq nat32)) : (va_quickCode unit (va_code_KeyExpansionRoundEven256 round rcon)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 75 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 76 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 77 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 78 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 79 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 80 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 81 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 82 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 83 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 84 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) (16 `op_Multiply` (round + 1)) Secret dst (round + 1)) (fun (va_s:va_state) _
-> let (va_arg17:Prims.int) = round + 1 in let (va_arg16:Vale.Def.Types_s.nat32) = rcon in let
(va_arg15:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in let
(va_arg14:Vale.Def.Types_s.quad32) = va_get_xmm 1 va_old_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 87 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_simd_round_key va_arg14 va_arg15 va_arg16
va_arg17) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 88 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QEmpty (())))))))))))))))
val va_lemma_KeyExpansionRoundEven256 : va_b0:va_code -> va_s0:va_state -> round:nat64 -> rcon:nat8
-> dst:buffer128 -> key:(seq nat32)
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundEven256 round rcon) va_s0 /\
va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 == 0 /\ rcon ==
Vale.AES.AES_common_s.aes_rcon ((round + 1) `op_Division` 2 - 1) /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ va_get_xmm 1 va_sM == Vale.X64.Decls.buffer128_read dst
(round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 1 va_sM ==
Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) /\ va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4
va_sM (va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM
(va_update_ok va_sM (va_update_mem va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansionRoundEven256 va_b0 va_s0 round rcon dst key =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansionRoundEven256 va_mods round rcon dst key in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansionRoundEven256 round rcon)
va_qc va_s0 (fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 50 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 61 column 65 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 71 column 54 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 1 va_sM == Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1
va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 72 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 1 va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 73 column 82 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM) (round + 1) (round + 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundEven256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32))
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 == 0 /\ rcon ==
Vale.AES.AES_common_s.aes_rcon ((round + 1) `op_Division` 2 - 1) /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round /\ (forall (va_x_mem:vale_heap)
(va_x_heap1:vale_heap) (va_x_xmm1:quad32) (va_x_xmm2:quad32) (va_x_xmm4:quad32)
(va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags va_x_efl (va_upd_xmm 4 va_x_xmm4
(va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 1 va_x_xmm1 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem
va_x_mem va_s0))))) in va_get_ok va_sM /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1
va_sM) (va_get_reg64 rRdx va_sM) dst 15 (va_get_mem_layout va_sM) Secret /\ va_get_xmm 1 va_sM
== Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 1
va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> dst:buffer128 -> key:(seq
nat32) -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundEven256 round rcon dst key va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundEven256 round rcon)
([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem])
va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundEven256 round rcon dst key va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundEven256 (va_code_KeyExpansionRoundEven256 round
rcon) va_s0 round rcon dst key in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 2 va_sM
(va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundEven256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32)) :
(va_quickCode unit (va_code_KeyExpansionRoundEven256 round rcon)) =
(va_QProc (va_code_KeyExpansionRoundEven256 round rcon) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm
2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem]) (va_wp_KeyExpansionRoundEven256 round rcon
dst key) (va_wpProof_KeyExpansionRoundEven256 round rcon dst key))
//--
//-- KeyExpansionRoundOdd256
val va_code_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansionRoundOdd256 round rcon =
(va_Block (va_CCons (va_code_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0) (va_CCons
(va_code_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_CCons (va_code_VPslldq4
(va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm
4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4)
(va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_CCons
(va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 3) (16 `op_Multiply`
(round + 1)) Secret) (va_CNil ()))))))))))))
val va_codegen_success_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansionRoundOdd256 round rcon =
(va_pbool_and (va_codegen_success_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0)
(va_pbool_and (va_codegen_success_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) (16 `op_Multiply` (round + 1)) Secret) (va_ttrue ())))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansionRoundOdd256 (va_mods:va_mods_t) (round:nat64) (rcon:nat8) (dst:buffer128)
(key:(seq nat32)) : (va_quickCode unit (va_code_KeyExpansionRoundOdd256 round rcon)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 118 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 119 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 120 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 121 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 122 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 123 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 124 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 125 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 126 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 127 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) (16 `op_Multiply` (round + 1)) Secret dst (round + 1)) (fun (va_s:va_state) _
-> let (va_arg20:Prims.int) = round + 1 in let (va_arg19:Vale.Def.Types_s.quad32) = va_get_xmm
1 va_old_s in let (va_arg18:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 130 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_simd_round_key va_arg18 va_arg19 0 va_arg20)
(let (va_arg17:Prims.int) = round + 1 in let (va_arg16:Vale.Def.Types_s.quad32) = va_get_xmm 1
va_old_s in let (va_arg15:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 131 column 33 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_round_key_256_rcon_odd va_arg15 va_arg16 0
va_arg17) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 132 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QEmpty
(()))))))))))))))))
val va_lemma_KeyExpansionRoundOdd256 : va_b0:va_code -> va_s0:va_state -> round:nat64 -> rcon:nat8
-> dst:buffer128 -> key:(seq nat32)
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundOdd256 round rcon) va_s0 /\ va_get_ok
va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64 rRdx va_s0)
dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\ sse_enabled) /\ (1
<= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 =!= 0 /\ Vale.AES.AES_s.is_aes_key_LE
AES_256 key /\ va_get_xmm 3 va_s0 == Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\
va_get_xmm 1 va_s0 == Vale.AES.AES256_helpers.expand_key_256 key round))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ va_get_xmm 3 va_sM == Vale.X64.Decls.buffer128_read dst
(round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 3 va_sM ==
Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) /\ va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4
va_sM (va_update_xmm 3 va_sM (va_update_xmm 2 va_sM (va_update_mem_heaplet 1 va_sM
(va_update_ok va_sM (va_update_mem va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansionRoundOdd256 va_b0 va_s0 round rcon dst key =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2;
va_Mod_mem_heaplet 1; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansionRoundOdd256 va_mods round rcon dst key in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansionRoundOdd256 round rcon)
va_qc va_s0 (fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 93 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 104 column 65 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 114 column 54 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 3 va_sM == Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1
va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 115 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 3 va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 116 column 82 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM) (round + 1) (round + 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet
1; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundOdd256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32))
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 =!= 0 /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round /\ (forall (va_x_mem:vale_heap)
(va_x_heap1:vale_heap) (va_x_xmm2:quad32) (va_x_xmm3:quad32) (va_x_xmm4:quad32)
(va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags va_x_efl (va_upd_xmm 4 va_x_xmm4
(va_upd_xmm 3 va_x_xmm3 (va_upd_xmm 2 va_x_xmm2 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem
va_x_mem va_s0))))) in va_get_ok va_sM /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1
va_sM) (va_get_reg64 rRdx va_sM) dst 15 (va_get_mem_layout va_sM) Secret /\ va_get_xmm 3 va_sM
== Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 3
va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> dst:buffer128 -> key:(seq
nat32) -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundOdd256 round rcon dst key va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundOdd256 round rcon)
([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet 1; va_Mod_mem])
va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundOdd256 round rcon dst key va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundOdd256 (va_code_KeyExpansionRoundOdd256 round
rcon) va_s0 round rcon dst key in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet
1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundOdd256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32)) :
(va_quickCode unit (va_code_KeyExpansionRoundOdd256 round rcon)) =
(va_QProc (va_code_KeyExpansionRoundOdd256 round rcon) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm
3; va_Mod_xmm 2; va_Mod_mem_heaplet 1; va_Mod_mem]) (va_wp_KeyExpansionRoundOdd256 round rcon
dst key) (va_wpProof_KeyExpansionRoundOdd256 round rcon dst key))
//--
//-- KeyExpansionRoundUnrolledRecursive256
val va_code_KeyExpansionRoundUnrolledRecursive256 : n:int -> Tot va_code(decreases %[n])
[@ "opaque_to_smt"]
let rec va_code_KeyExpansionRoundUnrolledRecursive256 n =
(va_Block (va_CCons (if (1 < n && n <= 14) then va_Block (va_CCons
(va_code_KeyExpansionRoundUnrolledRecursive256 (n - 1)) (va_CCons (if (n `op_Modulus` 2 = 0)
then va_Block (va_CCons (va_code_KeyExpansionRoundEven256 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1))) (va_CNil ())) else va_Block (va_CCons
(va_code_KeyExpansionRoundOdd256 (n - 1) (Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 -
1))) (va_CNil ()))) (va_CNil ()))) else va_Block (va_CNil ())) (va_CNil ())))
val va_codegen_success_KeyExpansionRoundUnrolledRecursive256 : n:int -> Tot va_pbool(decreases %[n])
[@ "opaque_to_smt"]
let rec va_codegen_success_KeyExpansionRoundUnrolledRecursive256 n =
(va_pbool_and (if (1 < n && n <= 14) then va_pbool_and
(va_codegen_success_KeyExpansionRoundUnrolledRecursive256 (n - 1)) (va_pbool_and (if (n
`op_Modulus` 2 = 0) then va_pbool_and (va_codegen_success_KeyExpansionRoundEven256 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1))) (va_ttrue ()) else va_pbool_and
(va_codegen_success_KeyExpansionRoundOdd256 (n - 1) (Vale.AES.AES_common_s.aes_rcon (n
`op_Division` 2 - 1))) (va_ttrue ())) (va_ttrue ())) else va_ttrue ()) (va_ttrue ()))
val va_lemma_KeyExpansionRoundUnrolledRecursive256 : va_b0:va_code -> va_s0:va_state -> key:(seq
nat32) -> dst:buffer128 -> n:int
-> Ghost (va_state & va_fuel)(decreases %[n])
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundUnrolledRecursive256 n) va_s0 /\
va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (0 < n /\ n <= 14) /\ Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1
va_s0 == Vale.AES.AES256_helpers.expand_key_256 key 0 /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key 1 /\ va_get_xmm 1 va_s0 ==
Vale.X64.Decls.buffer128_read dst 0 (va_get_mem_heaplet 1 va_s0) /\ va_get_xmm 3 va_s0 ==
Vale.X64.Decls.buffer128_read dst 1 (va_get_mem_heaplet 1 va_s0) /\ va_get_reg64 rRdx va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 dst (va_get_mem_heaplet 1 va_s0)))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ Vale.X64.Decls.modifies_buffer128 dst (va_get_mem_heaplet 1
va_s0) (va_get_mem_heaplet 1 va_sM) /\ Vale.X64.Decls.buffer128_read dst n (va_get_mem_heaplet
1 va_sM) == (if (n `op_Modulus` 2 = 0) then va_get_xmm 1 va_sM else va_get_xmm 3 va_sM) /\
Vale.X64.Decls.buffer128_read dst (n - 1) (va_get_mem_heaplet 1 va_sM) == (if ((n - 1)
`op_Modulus` 2 = 0) then va_get_xmm 1 va_sM else va_get_xmm 3 va_sM) /\ (forall j .
{:pattern(buffer128_read dst j (va_get_mem_heaplet 1 va_sM))}0 <= j /\ j <= n ==>
Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_sM) ==
Vale.AES.AES256_helpers.expand_key_256 key j) /\ va_state_eq va_sM (va_update_flags va_sM
(va_update_xmm 4 va_sM (va_update_xmm 3 va_sM (va_update_xmm 2 va_sM (va_update_xmm 1 va_sM
(va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM va_s0)))))))))) | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsVector.fsti.checked",
"Vale.X64.InsMem.fsti.checked",
"Vale.X64.InsBasic.fsti.checked",
"Vale.X64.InsAes.fsti.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.AES_s.fst.checked",
"Vale.AES.AES_common_s.fst.checked",
"Vale.AES.AES256_helpers.fsti.checked",
"prims.fst.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Vale.AES.X64.AES256.fst"
} | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES256_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsAes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES256_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsAes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 20,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
key: FStar.Seq.Base.seq Vale.X64.Memory.nat32 ->
dst: Vale.X64.Memory.buffer128 ->
n: Prims.int
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [
""
] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"FStar.Seq.Base.seq",
"Vale.X64.Memory.nat32",
"Vale.X64.Memory.buffer128",
"Prims.int",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_lemma_merge_total",
"FStar.Pervasives.Native.tuple2",
"Vale.X64.State.vale_state",
"Vale.X64.Decls.va_lemma_empty_total",
"Prims.op_AmpAmp",
"Prims.op_LessThan",
"Prims.op_LessThanOrEqual",
"Prims.unit",
"Prims._assert",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.l_and",
"Prims.b2t",
"Prims.eq2",
"Vale.X64.Decls.quad32",
"Vale.X64.Decls.buffer128_read",
"Vale.X64.Decls.va_get_mem_heaplet",
"Prims.op_Equality",
"Prims.op_Modulus",
"Prims.list",
"Vale.X64.Machine_s.precode",
"Vale.X64.Decls.ins",
"Vale.X64.Decls.ocmp",
"Vale.X64.Decls.va_tl",
"Vale.AES.X64.AES256.va_lemma_KeyExpansionRoundEven256",
"Vale.X64.Decls.va_hd",
"Prims.op_Subtraction",
"Vale.AES.AES_common_s.aes_rcon",
"Prims.op_Division",
"Vale.X64.Decls.va_get_block",
"Prims.bool",
"Vale.AES.X64.AES256.va_lemma_KeyExpansionRoundOdd256",
"Vale.Arch.HeapImpl.vale_heap",
"Vale.AES.X64.AES256.va_lemma_KeyExpansionRoundUnrolledRecursive256",
"Vale.X64.Decls.va_reveal_opaque",
"Vale.AES.X64.AES256.va_code_KeyExpansionRoundUnrolledRecursive256"
] | [
"recursion"
] | false | false | false | false | false | let rec va_lemma_KeyExpansionRoundUnrolledRecursive256 va_b0 va_s0 key dst n =
| va_reveal_opaque (`%va_code_KeyExpansionRoundUnrolledRecursive256)
(va_code_KeyExpansionRoundUnrolledRecursive256 n);
let va_old_s:va_state = va_s0 in
let va_b1:va_codes = va_get_block va_b0 in
let va_b2 = va_tl va_b1 in
let va_c2 = va_hd va_b1 in
let va_fc2, va_s2 =
(if (1 < n && n <= 14)
then
(let va_b3 = va_get_block va_c2 in
let va_s4, va_fc4 =
va_lemma_KeyExpansionRoundUnrolledRecursive256 (va_hd va_b3) va_s0 key dst (n - 1)
in
let va_b4 = va_tl va_b3 in
let old_mem:vale_heap = va_get_mem_heaplet 1 va_s4 in
let va_b6 = va_tl va_b4 in
let va_c6 = va_hd va_b4 in
let va_fc6, va_s6 =
(if (n `op_Modulus` 2 = 0)
then
(let va_b7 = va_get_block va_c6 in
let va_s8, va_fc8 =
va_lemma_KeyExpansionRoundEven256 (va_hd va_b7)
va_s4
(n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1))
dst
key
in
let va_b8 = va_tl va_b7 in
let va_s6, va_f8 = va_lemma_empty_total va_s8 va_b8 in
let va_fc6 = va_lemma_merge_total va_b7 va_s4 va_fc8 va_s8 va_f8 va_s6 in
(va_fc6, va_s6))
else
(let va_b9 = va_get_block va_c6 in
let va_s10, va_fc10 =
va_lemma_KeyExpansionRoundOdd256 (va_hd va_b9)
va_s4
(n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1))
dst
key
in
let va_b10 = va_tl va_b9 in
let va_s6, va_f10 = va_lemma_empty_total va_s10 va_b10 in
let va_fc6 = va_lemma_merge_total va_b9 va_s4 va_fc10 va_s10 va_f10 va_s6 in
(va_fc6, va_s6)))
in
assert (forall j. {:pattern (buffer128_read dst j (va_get_mem_heaplet 1 va_s6))}
0 <= j /\ j < n ==>
Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_s6) ==
Vale.X64.Decls.buffer128_read dst j old_mem);
let va_s2, va_f6 = va_lemma_empty_total va_s6 va_b6 in
let va_f4 = va_lemma_merge_total va_b4 va_s4 va_fc6 va_s6 va_f6 va_s2 in
let va_fc2 = va_lemma_merge_total va_b3 va_s0 va_fc4 va_s4 va_f4 va_s2 in
(va_fc2, va_s2))
else
(let va_b12 = va_get_block va_c2 in
let va_s2, va_fc2 = va_lemma_empty_total va_s0 va_b12 in
(va_fc2, va_s2)))
in
let va_sM, va_f2 = va_lemma_empty_total va_s2 va_b2 in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc2 va_s2 va_f2 va_sM in
(va_sM, va_fM) | false |
Vale.Interop.fsti | Vale.Interop.get_seq_heap | val get_seq_heap (heap: machine_heap) (addrs: addr_map) (b: b8)
: GTot (Seq.lseq UInt8.t (DV.length (get_downview b.bsrc))) | val get_seq_heap (heap: machine_heap) (addrs: addr_map) (b: b8)
: GTot (Seq.lseq UInt8.t (DV.length (get_downview b.bsrc))) | let get_seq_heap (heap:machine_heap) (addrs:addr_map) (b:b8)
: GTot (Seq.lseq UInt8.t (DV.length (get_downview b.bsrc)))
= let length = DV.length (get_downview b.bsrc) in
let contents (i:nat{i < length}) = UInt8.uint_to_t heap.[addrs b + i] in
Seq.init length contents | {
"file_name": "vale/code/arch/x64/Vale.Interop.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 28,
"end_line": 63,
"start_col": 0,
"start_line": 59
} | module Vale.Interop
open FStar.Mul
module List = FStar.List.Tot.Base
module HS = FStar.Monotonic.HyperStack
module HH = FStar.Monotonic.HyperHeap
module MB = LowStar.Monotonic.Buffer
module M = LowStar.Modifies
module DV = LowStar.BufferView.Down
open Vale.Def.Opaque_s
open Vale.Interop.Types
open Vale.Interop.Heap_s
//open Vale.Interop.Base
open Vale.Arch.MachineHeap_s
unfold let (.[]) = Map.sel
unfold let (.[]<-) = Map.upd
let disjoint (ptr1 ptr2:b8) = MB.loc_disjoint (MB.loc_buffer ptr1.bsrc) (MB.loc_buffer ptr2.bsrc)
let valid_addr (mem:interop_heap) (x:int) = Set.mem x (addrs_set mem)
val addrs_set_lemma (mem:interop_heap) (x:int)
: Lemma (let addrs = addrs_of_mem mem in
let ptrs = ptrs_of_mem mem in
valid_addr mem x <==>
(exists (b:b8{List.memP b ptrs}).{:pattern (addrs b)} addrs b <= x /\ x < addrs b + DV.length (get_downview b.bsrc)))
val addrs_set_lemma_all (_:unit) : Lemma
(forall (mem:interop_heap) (x:int).{:pattern (Set.mem x (addrs_set mem))}
let addrs = addrs_of_mem mem in
let ptrs = ptrs_of_mem mem in
valid_addr mem x <==>
(exists (b:b8{List.memP b ptrs}).{:pattern (addrs b)} addrs b <= x /\ x < addrs b + DV.length (get_downview b.bsrc)))
val addrs_set_mem (mem:interop_heap) (a:b8) (i:int)
: Lemma
(requires (let ptrs = ptrs_of_mem mem in
let addrs = addrs_of_mem mem in
List.memP a ptrs /\ i >= addrs a /\ i < addrs a + DV.length (get_downview a.bsrc)))
(ensures valid_addr mem i)
(* Takes a Low* Hyperstack and a list of buffers and create a vale memory + keep track of the vale addresses *)
val down_mem: down_mem_t
val same_unspecified_down
(hs1: HS.mem)
(hs2: HS.mem)
(ptrs:list b8{list_disjoint_or_eq ptrs /\ list_live hs1 ptrs /\ list_live hs2 ptrs})
: Lemma (
let mem1 = mem_of_hs_roots ptrs hs1 in
let mem2 = mem_of_hs_roots ptrs hs2 in
let addrs = addrs_of_mem mem1 in
let heap1 = down_mem mem1 in
let heap2 = down_mem mem2 in
forall i. not (valid_addr mem1 i) ==> // REVIEW: the 'forall' lacks a {:pattern ...}
heap1.[i] == heap2.[i]) | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Types.fst.checked",
"Vale.Interop.Heap_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.MachineHeap_s.fst.checked",
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferView.Down.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Monotonic.HyperStack.fsti.checked",
"FStar.Monotonic.HyperHeap.fsti.checked",
"FStar.Map.fsti.checked",
"FStar.List.Tot.Base.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Interop.fsti"
} | [
{
"abbrev": false,
"full_module": "Vale.Arch.MachineHeap_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Heap_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.BufferView.Down",
"short_module": "DV"
},
{
"abbrev": true,
"full_module": "LowStar.Modifies",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "LowStar.Monotonic.Buffer",
"short_module": "MB"
},
{
"abbrev": true,
"full_module": "FStar.Monotonic.HyperHeap",
"short_module": "HH"
},
{
"abbrev": true,
"full_module": "FStar.Monotonic.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "List"
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
heap: Vale.Arch.MachineHeap_s.machine_heap ->
addrs: Vale.Interop.Types.addr_map ->
b: Vale.Interop.Types.b8
-> Prims.GTot
(FStar.Seq.Properties.lseq FStar.UInt8.t
(LowStar.BufferView.Down.length (Vale.Interop.Types.get_downview (Buffer?.bsrc b)))) | Prims.GTot | [
"sometrivial"
] | [] | [
"Vale.Arch.MachineHeap_s.machine_heap",
"Vale.Interop.Types.addr_map",
"Vale.Interop.Types.b8",
"FStar.Seq.Base.init",
"FStar.UInt8.t",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.UInt8.uint_to_t",
"Vale.Interop.op_String_Access",
"Prims.int",
"Vale.Def.Types_s.nat8",
"Prims.op_Addition",
"LowStar.BufferView.Down.length",
"Vale.Interop.Types.get_downview",
"Vale.Interop.Types.__proj__Buffer__item__src",
"Vale.Interop.Types.b8_preorder",
"Vale.Interop.Types.__proj__Buffer__item__writeable",
"Vale.Interop.Types.base_typ_as_type",
"Vale.Interop.Types.__proj__Buffer__item__bsrc",
"FStar.Seq.Properties.lseq"
] | [] | false | false | false | false | false | let get_seq_heap (heap: machine_heap) (addrs: addr_map) (b: b8)
: GTot (Seq.lseq UInt8.t (DV.length (get_downview b.bsrc))) =
| let length = DV.length (get_downview b.bsrc) in
let contents (i: nat{i < length}) = UInt8.uint_to_t heap.[ addrs b + i ] in
Seq.init length contents | false |
Vale.AES.X64.AES256.fst | Vale.AES.X64.AES256.va_wp_AES256EncryptRound | val va_wp_AES256EncryptRound
(n: nat)
(init: quad32)
(round_keys: (seq quad32))
(keys_buffer: buffer128)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 | val va_wp_AES256EncryptRound
(n: nat)
(init: quad32)
(round_keys: (seq quad32))
(keys_buffer: buffer128)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 | let va_wp_AES256EncryptRound (n:nat) (init:quad32) (round_keys:(seq quad32))
(keys_buffer:buffer128) (va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ (aesni_enabled /\ sse_enabled) /\ (1 <= n /\ n < 14 /\ 14 <=
FStar.Seq.Base.length #quad32 round_keys) /\ va_get_xmm 0 va_s0 ==
Vale.AES.AES_s.eval_rounds_def init round_keys (n - 1) /\ va_get_reg64 rR8 va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 keys_buffer (va_get_mem_heaplet 0 va_s0)
/\ Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0) (va_get_reg64 rR8 va_s0)
keys_buffer 15 (va_get_mem_layout va_s0) Secret /\ Vale.X64.Decls.buffer128_read keys_buffer n
(va_get_mem_heaplet 0 va_s0) == FStar.Seq.Base.index #quad32 round_keys n /\ (forall
(va_x_xmm0:quad32) (va_x_xmm2:quad32) (va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags
va_x_efl (va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 0 va_x_xmm0 va_s0)) in va_get_ok va_sM /\
va_get_xmm 0 va_sM == Vale.AES.AES_s.eval_rounds_def init round_keys n ==> va_k va_sM (()))) | {
"file_name": "obj/Vale.AES.X64.AES256.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 96,
"end_line": 726,
"start_col": 0,
"start_line": 715
} | module Vale.AES.X64.AES256
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsVector
open Vale.X64.InsAes
open Vale.X64.QuickCode
open Vale.X64.QuickCodes
open Vale.Arch.Types
open Vale.AES.AES256_helpers
open Vale.X64.CPU_Features_s
#reset-options "--z3rlimit 20"
//-- KeyExpansionRoundEven256
val va_code_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansionRoundEven256 round rcon =
(va_Block (va_CCons (va_code_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon)
(va_CCons (va_code_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_CCons (va_code_VPslldq4
(va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm
4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4)
(va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_CCons
(va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) (16 `op_Multiply`
(round + 1)) Secret) (va_CNil ()))))))))))))
val va_codegen_success_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansionRoundEven256 round rcon =
(va_pbool_and (va_codegen_success_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon)
(va_pbool_and (va_codegen_success_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) (16 `op_Multiply` (round + 1)) Secret) (va_ttrue ())))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansionRoundEven256 (va_mods:va_mods_t) (round:nat64) (rcon:nat8) (dst:buffer128)
(key:(seq nat32)) : (va_quickCode unit (va_code_KeyExpansionRoundEven256 round rcon)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 75 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 76 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 77 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 78 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 79 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 80 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 81 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 82 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 83 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 84 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) (16 `op_Multiply` (round + 1)) Secret dst (round + 1)) (fun (va_s:va_state) _
-> let (va_arg17:Prims.int) = round + 1 in let (va_arg16:Vale.Def.Types_s.nat32) = rcon in let
(va_arg15:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in let
(va_arg14:Vale.Def.Types_s.quad32) = va_get_xmm 1 va_old_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 87 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_simd_round_key va_arg14 va_arg15 va_arg16
va_arg17) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 88 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QEmpty (())))))))))))))))
val va_lemma_KeyExpansionRoundEven256 : va_b0:va_code -> va_s0:va_state -> round:nat64 -> rcon:nat8
-> dst:buffer128 -> key:(seq nat32)
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundEven256 round rcon) va_s0 /\
va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 == 0 /\ rcon ==
Vale.AES.AES_common_s.aes_rcon ((round + 1) `op_Division` 2 - 1) /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ va_get_xmm 1 va_sM == Vale.X64.Decls.buffer128_read dst
(round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 1 va_sM ==
Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) /\ va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4
va_sM (va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM
(va_update_ok va_sM (va_update_mem va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansionRoundEven256 va_b0 va_s0 round rcon dst key =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansionRoundEven256 va_mods round rcon dst key in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansionRoundEven256 round rcon)
va_qc va_s0 (fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 50 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 61 column 65 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 71 column 54 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 1 va_sM == Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1
va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 72 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 1 va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 73 column 82 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM) (round + 1) (round + 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundEven256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32))
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 == 0 /\ rcon ==
Vale.AES.AES_common_s.aes_rcon ((round + 1) `op_Division` 2 - 1) /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round /\ (forall (va_x_mem:vale_heap)
(va_x_heap1:vale_heap) (va_x_xmm1:quad32) (va_x_xmm2:quad32) (va_x_xmm4:quad32)
(va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags va_x_efl (va_upd_xmm 4 va_x_xmm4
(va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 1 va_x_xmm1 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem
va_x_mem va_s0))))) in va_get_ok va_sM /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1
va_sM) (va_get_reg64 rRdx va_sM) dst 15 (va_get_mem_layout va_sM) Secret /\ va_get_xmm 1 va_sM
== Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 1
va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> dst:buffer128 -> key:(seq
nat32) -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundEven256 round rcon dst key va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundEven256 round rcon)
([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem])
va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundEven256 round rcon dst key va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundEven256 (va_code_KeyExpansionRoundEven256 round
rcon) va_s0 round rcon dst key in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 2 va_sM
(va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundEven256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32)) :
(va_quickCode unit (va_code_KeyExpansionRoundEven256 round rcon)) =
(va_QProc (va_code_KeyExpansionRoundEven256 round rcon) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm
2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem]) (va_wp_KeyExpansionRoundEven256 round rcon
dst key) (va_wpProof_KeyExpansionRoundEven256 round rcon dst key))
//--
//-- KeyExpansionRoundOdd256
val va_code_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansionRoundOdd256 round rcon =
(va_Block (va_CCons (va_code_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0) (va_CCons
(va_code_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_CCons (va_code_VPslldq4
(va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm
4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4)
(va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_CCons
(va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 3) (16 `op_Multiply`
(round + 1)) Secret) (va_CNil ()))))))))))))
val va_codegen_success_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansionRoundOdd256 round rcon =
(va_pbool_and (va_codegen_success_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0)
(va_pbool_and (va_codegen_success_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) (16 `op_Multiply` (round + 1)) Secret) (va_ttrue ())))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansionRoundOdd256 (va_mods:va_mods_t) (round:nat64) (rcon:nat8) (dst:buffer128)
(key:(seq nat32)) : (va_quickCode unit (va_code_KeyExpansionRoundOdd256 round rcon)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 118 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 119 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 120 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 121 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 122 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 123 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 124 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 125 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 126 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 127 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) (16 `op_Multiply` (round + 1)) Secret dst (round + 1)) (fun (va_s:va_state) _
-> let (va_arg20:Prims.int) = round + 1 in let (va_arg19:Vale.Def.Types_s.quad32) = va_get_xmm
1 va_old_s in let (va_arg18:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 130 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_simd_round_key va_arg18 va_arg19 0 va_arg20)
(let (va_arg17:Prims.int) = round + 1 in let (va_arg16:Vale.Def.Types_s.quad32) = va_get_xmm 1
va_old_s in let (va_arg15:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 131 column 33 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_round_key_256_rcon_odd va_arg15 va_arg16 0
va_arg17) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 132 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QEmpty
(()))))))))))))))))
val va_lemma_KeyExpansionRoundOdd256 : va_b0:va_code -> va_s0:va_state -> round:nat64 -> rcon:nat8
-> dst:buffer128 -> key:(seq nat32)
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundOdd256 round rcon) va_s0 /\ va_get_ok
va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64 rRdx va_s0)
dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\ sse_enabled) /\ (1
<= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 =!= 0 /\ Vale.AES.AES_s.is_aes_key_LE
AES_256 key /\ va_get_xmm 3 va_s0 == Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\
va_get_xmm 1 va_s0 == Vale.AES.AES256_helpers.expand_key_256 key round))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ va_get_xmm 3 va_sM == Vale.X64.Decls.buffer128_read dst
(round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 3 va_sM ==
Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) /\ va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4
va_sM (va_update_xmm 3 va_sM (va_update_xmm 2 va_sM (va_update_mem_heaplet 1 va_sM
(va_update_ok va_sM (va_update_mem va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansionRoundOdd256 va_b0 va_s0 round rcon dst key =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2;
va_Mod_mem_heaplet 1; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansionRoundOdd256 va_mods round rcon dst key in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansionRoundOdd256 round rcon)
va_qc va_s0 (fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 93 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 104 column 65 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 114 column 54 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 3 va_sM == Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1
va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 115 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 3 va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 116 column 82 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM) (round + 1) (round + 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet
1; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundOdd256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32))
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 =!= 0 /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round /\ (forall (va_x_mem:vale_heap)
(va_x_heap1:vale_heap) (va_x_xmm2:quad32) (va_x_xmm3:quad32) (va_x_xmm4:quad32)
(va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags va_x_efl (va_upd_xmm 4 va_x_xmm4
(va_upd_xmm 3 va_x_xmm3 (va_upd_xmm 2 va_x_xmm2 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem
va_x_mem va_s0))))) in va_get_ok va_sM /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1
va_sM) (va_get_reg64 rRdx va_sM) dst 15 (va_get_mem_layout va_sM) Secret /\ va_get_xmm 3 va_sM
== Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 3
va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> dst:buffer128 -> key:(seq
nat32) -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundOdd256 round rcon dst key va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundOdd256 round rcon)
([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet 1; va_Mod_mem])
va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundOdd256 round rcon dst key va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundOdd256 (va_code_KeyExpansionRoundOdd256 round
rcon) va_s0 round rcon dst key in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet
1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundOdd256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32)) :
(va_quickCode unit (va_code_KeyExpansionRoundOdd256 round rcon)) =
(va_QProc (va_code_KeyExpansionRoundOdd256 round rcon) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm
3; va_Mod_xmm 2; va_Mod_mem_heaplet 1; va_Mod_mem]) (va_wp_KeyExpansionRoundOdd256 round rcon
dst key) (va_wpProof_KeyExpansionRoundOdd256 round rcon dst key))
//--
//-- KeyExpansionRoundUnrolledRecursive256
val va_code_KeyExpansionRoundUnrolledRecursive256 : n:int -> Tot va_code(decreases %[n])
[@ "opaque_to_smt"]
let rec va_code_KeyExpansionRoundUnrolledRecursive256 n =
(va_Block (va_CCons (if (1 < n && n <= 14) then va_Block (va_CCons
(va_code_KeyExpansionRoundUnrolledRecursive256 (n - 1)) (va_CCons (if (n `op_Modulus` 2 = 0)
then va_Block (va_CCons (va_code_KeyExpansionRoundEven256 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1))) (va_CNil ())) else va_Block (va_CCons
(va_code_KeyExpansionRoundOdd256 (n - 1) (Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 -
1))) (va_CNil ()))) (va_CNil ()))) else va_Block (va_CNil ())) (va_CNil ())))
val va_codegen_success_KeyExpansionRoundUnrolledRecursive256 : n:int -> Tot va_pbool(decreases %[n])
[@ "opaque_to_smt"]
let rec va_codegen_success_KeyExpansionRoundUnrolledRecursive256 n =
(va_pbool_and (if (1 < n && n <= 14) then va_pbool_and
(va_codegen_success_KeyExpansionRoundUnrolledRecursive256 (n - 1)) (va_pbool_and (if (n
`op_Modulus` 2 = 0) then va_pbool_and (va_codegen_success_KeyExpansionRoundEven256 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1))) (va_ttrue ()) else va_pbool_and
(va_codegen_success_KeyExpansionRoundOdd256 (n - 1) (Vale.AES.AES_common_s.aes_rcon (n
`op_Division` 2 - 1))) (va_ttrue ())) (va_ttrue ())) else va_ttrue ()) (va_ttrue ()))
val va_lemma_KeyExpansionRoundUnrolledRecursive256 : va_b0:va_code -> va_s0:va_state -> key:(seq
nat32) -> dst:buffer128 -> n:int
-> Ghost (va_state & va_fuel)(decreases %[n])
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundUnrolledRecursive256 n) va_s0 /\
va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (0 < n /\ n <= 14) /\ Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1
va_s0 == Vale.AES.AES256_helpers.expand_key_256 key 0 /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key 1 /\ va_get_xmm 1 va_s0 ==
Vale.X64.Decls.buffer128_read dst 0 (va_get_mem_heaplet 1 va_s0) /\ va_get_xmm 3 va_s0 ==
Vale.X64.Decls.buffer128_read dst 1 (va_get_mem_heaplet 1 va_s0) /\ va_get_reg64 rRdx va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 dst (va_get_mem_heaplet 1 va_s0)))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ Vale.X64.Decls.modifies_buffer128 dst (va_get_mem_heaplet 1
va_s0) (va_get_mem_heaplet 1 va_sM) /\ Vale.X64.Decls.buffer128_read dst n (va_get_mem_heaplet
1 va_sM) == (if (n `op_Modulus` 2 = 0) then va_get_xmm 1 va_sM else va_get_xmm 3 va_sM) /\
Vale.X64.Decls.buffer128_read dst (n - 1) (va_get_mem_heaplet 1 va_sM) == (if ((n - 1)
`op_Modulus` 2 = 0) then va_get_xmm 1 va_sM else va_get_xmm 3 va_sM) /\ (forall j .
{:pattern(buffer128_read dst j (va_get_mem_heaplet 1 va_sM))}0 <= j /\ j <= n ==>
Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_sM) ==
Vale.AES.AES256_helpers.expand_key_256 key j) /\ va_state_eq va_sM (va_update_flags va_sM
(va_update_xmm 4 va_sM (va_update_xmm 3 va_sM (va_update_xmm 2 va_sM (va_update_xmm 1 va_sM
(va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM va_s0))))))))))
[@"opaque_to_smt"]
let rec va_lemma_KeyExpansionRoundUnrolledRecursive256 va_b0 va_s0 key dst n =
va_reveal_opaque (`%va_code_KeyExpansionRoundUnrolledRecursive256)
(va_code_KeyExpansionRoundUnrolledRecursive256 n);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
let va_b2 = va_tl va_b1 in
let va_c2 = va_hd va_b1 in
let (va_fc2, va_s2) =
(
if (1 < n && n <= 14) then
(
let va_b3 = va_get_block va_c2 in
let (va_s4, va_fc4) = va_lemma_KeyExpansionRoundUnrolledRecursive256 (va_hd va_b3) va_s0 key
dst (n - 1) in
let va_b4 = va_tl va_b3 in
let (old_mem:vale_heap) = va_get_mem_heaplet 1 va_s4 in
let va_b6 = va_tl va_b4 in
let va_c6 = va_hd va_b4 in
let (va_fc6, va_s6) =
(
if (n `op_Modulus` 2 = 0) then
(
let va_b7 = va_get_block va_c6 in
let (va_s8, va_fc8) = va_lemma_KeyExpansionRoundEven256 (va_hd va_b7) va_s4 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1)) dst key in
let va_b8 = va_tl va_b7 in
let (va_s6, va_f8) = va_lemma_empty_total va_s8 va_b8 in
let va_fc6 = va_lemma_merge_total va_b7 va_s4 va_fc8 va_s8 va_f8 va_s6 in
(va_fc6, va_s6)
)
else
(
let va_b9 = va_get_block va_c6 in
let (va_s10, va_fc10) = va_lemma_KeyExpansionRoundOdd256 (va_hd va_b9) va_s4 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1)) dst key in
let va_b10 = va_tl va_b9 in
let (va_s6, va_f10) = va_lemma_empty_total va_s10 va_b10 in
let va_fc6 = va_lemma_merge_total va_b9 va_s4 va_fc10 va_s10 va_f10 va_s6 in
(va_fc6, va_s6)
)
) in
assert (forall j . {:pattern(buffer128_read dst j (va_get_mem_heaplet 1 va_s6))}0 <= j /\ j <
n ==> Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_s6) ==
Vale.X64.Decls.buffer128_read dst j old_mem);
let (va_s2, va_f6) = va_lemma_empty_total va_s6 va_b6 in
let va_f4 = va_lemma_merge_total va_b4 va_s4 va_fc6 va_s6 va_f6 va_s2 in
let va_fc2 = va_lemma_merge_total va_b3 va_s0 va_fc4 va_s4 va_f4 va_s2 in
(va_fc2, va_s2)
)
else
(
let va_b12 = va_get_block va_c2 in
let (va_s2, va_fc2) = va_lemma_empty_total va_s0 va_b12 in
(va_fc2, va_s2)
)
) in
let (va_sM, va_f2) = va_lemma_empty_total va_s2 va_b2 in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc2 va_s2 va_f2 va_sM in
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundUnrolledRecursive256 (key:(seq nat32)) (dst:buffer128) (n:int)
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (0 < n /\ n <= 14) /\ Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1
va_s0 == Vale.AES.AES256_helpers.expand_key_256 key 0 /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key 1 /\ va_get_xmm 1 va_s0 ==
Vale.X64.Decls.buffer128_read dst 0 (va_get_mem_heaplet 1 va_s0) /\ va_get_xmm 3 va_s0 ==
Vale.X64.Decls.buffer128_read dst 1 (va_get_mem_heaplet 1 va_s0) /\ va_get_reg64 rRdx va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 dst (va_get_mem_heaplet 1 va_s0) /\
(forall (va_x_mem:vale_heap) (va_x_heap1:vale_heap) (va_x_xmm1:quad32) (va_x_xmm2:quad32)
(va_x_xmm3:quad32) (va_x_xmm4:quad32) (va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags
va_x_efl (va_upd_xmm 4 va_x_xmm4 (va_upd_xmm 3 va_x_xmm3 (va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 1
va_x_xmm1 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem va_x_mem va_s0)))))) in va_get_ok va_sM
/\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst
15 (va_get_mem_layout va_sM) Secret /\ Vale.X64.Decls.modifies_buffer128 dst
(va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet 1 va_sM) /\ Vale.X64.Decls.buffer128_read dst
n (va_get_mem_heaplet 1 va_sM) == va_if (n `op_Modulus` 2 = 0) (fun _ -> va_get_xmm 1 va_sM)
(fun _ -> va_get_xmm 3 va_sM) /\ Vale.X64.Decls.buffer128_read dst (n - 1) (va_get_mem_heaplet
1 va_sM) == va_if ((n - 1) `op_Modulus` 2 = 0) (fun _ -> va_get_xmm 1 va_sM) (fun _ ->
va_get_xmm 3 va_sM) /\ (forall j . {:pattern(buffer128_read dst j (va_get_mem_heaplet 1
va_sM))}0 <= j /\ j <= n ==> Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_sM)
== Vale.AES.AES256_helpers.expand_key_256 key j) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundUnrolledRecursive256 : key:(seq nat32) -> dst:buffer128 -> n:int ->
va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundUnrolledRecursive256 key dst n va_s0
va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundUnrolledRecursive256
n) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_mem]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundUnrolledRecursive256 key dst n va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundUnrolledRecursive256
(va_code_KeyExpansionRoundUnrolledRecursive256 n) va_s0 key dst n in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok
va_sM (va_update_mem va_sM va_s0)))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundUnrolledRecursive256 (key:(seq nat32)) (dst:buffer128) (n:int) :
(va_quickCode unit (va_code_KeyExpansionRoundUnrolledRecursive256 n)) =
(va_QProc (va_code_KeyExpansionRoundUnrolledRecursive256 n) ([va_Mod_flags; va_Mod_xmm 4;
va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem])
(va_wp_KeyExpansionRoundUnrolledRecursive256 key dst n)
(va_wpProof_KeyExpansionRoundUnrolledRecursive256 key dst n))
//--
//-- KeyExpansion256Stdcall
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansion256Stdcall win =
(va_Block (va_CCons (if win then va_Block (va_CCons (va_code_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64 rRcx) 0 Secret)
(va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3)
(va_op_reg_opr64_reg64 rRcx) 16 Secret) (va_CNil ()))) else va_Block (va_CCons
(va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64
rRdi) 0 Secret) (va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm
3) (va_op_reg_opr64_reg64 rRdi) 16 Secret) (va_CCons (va_code_Mov64 (va_op_dst_opr64_reg64
rRdx) (va_op_opr64_reg64 rRsi)) (va_CNil ()))))) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) 0 Secret)
(va_CCons (va_code_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) 16 Secret) (va_CCons (va_code_KeyExpansionRoundUnrolledRecursive256 14)
(va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm
3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 4) (va_op_xmm_xmm 4)) (va_CNil ()))))))))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansion256Stdcall win =
(va_pbool_and (if win then va_pbool_and (va_codegen_success_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64 rRcx) 0 Secret)
(va_pbool_and (va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm
3) (va_op_reg_opr64_reg64 rRcx) 16 Secret) (va_ttrue ())) else va_pbool_and
(va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1)
(va_op_reg_opr64_reg64 rRdi) 0 Secret) (va_pbool_and (va_codegen_success_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3) (va_op_reg_opr64_reg64 rRdi) 16 Secret)
(va_pbool_and (va_codegen_success_Mov64 (va_op_dst_opr64_reg64 rRdx) (va_op_opr64_reg64 rRsi))
(va_ttrue ())))) (va_pbool_and (va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet
1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) 0 Secret) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) 16 Secret) (va_pbool_and
(va_codegen_success_KeyExpansionRoundUnrolledRecursive256 14) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 4) (va_op_xmm_xmm 4)) (va_ttrue ())))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansion256Stdcall (va_mods:va_mods_t) (win:bool) (input_key_b:buffer128)
(output_key_expansion_b:buffer128) : (va_quickCode unit (va_code_KeyExpansion256Stdcall win)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(key_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRcx va_s)
(fun _ -> va_get_reg64 rRdi va_s) in let (key_expansion_ptr:(va_int_range 0
18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRdx va_s) (fun _ -> va_get_reg64
rRsi va_s) in let (key:(FStar.Seq.Base.seq Vale.Def.Types_s.nat32)) =
Vale.AES.AES256_helpers.make_AES256_key (Vale.X64.Decls.buffer128_read input_key_b 0
(va_get_mem_heaplet 0 va_s)) (Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0
va_s)) in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 201 column 15 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_qInlineIf va_mods win (qblock va_mods (fun (va_s:va_state) -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 203 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64
rRcx) 0 Secret input_key_b 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 204 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3) (va_op_reg_opr64_reg64
rRcx) 16 Secret input_key_b 1) (va_QEmpty (()))))) (qblock va_mods (fun (va_s:va_state) ->
va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 208 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64
rRdi) 0 Secret input_key_b 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 209 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3) (va_op_reg_opr64_reg64
rRdi) 16 Secret input_key_b 1) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 210 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Mov64 (va_op_dst_opr64_reg64 rRdx) (va_op_opr64_reg64 rRsi)) (va_QEmpty (())))))))
(fun (va_s:va_state) va_g -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 213 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) 0 Secret output_key_expansion_b 0) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 214 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) 16 Secret output_key_expansion_b 1) (fun (va_s:va_state) _ -> va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 216 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 217 column 42 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_KeyExpansionRoundUnrolledRecursive256 key output_key_expansion_b 14) (fun
(va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 218 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_expand_key_256 key 15) (va_QLemma va_range1
"***** PRECONDITION NOT MET AT line 219 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
true (fun _ -> va_reveal_eq (`%key_to_round_keys_LE) key_to_round_keys_LE key_to_round_keys_LE)
(fun _ -> va_reveal_opaque (`%key_to_round_keys_LE) key_to_round_keys_LE) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 222 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 223 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 224 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 225 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 4) (va_op_xmm_xmm 4)) (va_QEmpty (()))))))))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansion256Stdcall va_b0 va_s0 win input_key_b output_key_expansion_b =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_reg64 rRdx; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansion256Stdcall va_mods win input_key_b output_key_expansion_b in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansion256Stdcall win) va_qc va_s0
(fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 177 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ (let (key_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ ->
va_get_reg64 rRcx va_s0) (fun _ -> va_get_reg64 rRdi va_s0) in let
(key_expansion_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ -> va_get_reg64
rRdx va_s0) (fun _ -> va_get_reg64 rRsi va_s0) in let (key:(FStar.Seq.Base.seq
Vale.Def.Types_s.nat32)) = Vale.AES.AES256_helpers.make_AES256_key
(Vale.X64.Decls.buffer128_read input_key_b 0 (va_get_mem_heaplet 0 va_s0))
(Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0 va_s0)) in label va_range1
"***** POSTCONDITION NOT MET AT line 193 column 52 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(aesni_enabled /\ avx_enabled /\ sse_enabled) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 194 column 76 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_sM) key_ptr input_key_b 2
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 195 column 98 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) key_expansion_ptr
output_key_expansion_b 15 (va_get_mem_layout va_sM) Secret)) /\ (let (key_ptr:(va_int_range 0
18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRcx va_s0) (fun _ -> va_get_reg64
rRdi va_s0) in let (key_expansion_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _
-> va_get_reg64 rRdx va_s0) (fun _ -> va_get_reg64 rRsi va_s0) in let (key:(FStar.Seq.Base.seq
Vale.Def.Types_s.nat32)) = Vale.AES.AES256_helpers.make_AES256_key
(Vale.X64.Decls.buffer128_read input_key_b 0 (va_get_mem_heaplet 0 va_s0))
(Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0 va_s0)) in label va_range1
"***** POSTCONDITION NOT MET AT line 197 column 70 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer128 output_key_expansion_b (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 199 column 109 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(forall (j:nat) . {:pattern(buffer128_read output_key_expansion_b j (va_get_mem_heaplet 1
va_sM))}j <= 14 ==> Vale.X64.Decls.buffer128_read output_key_expansion_b j (va_get_mem_heaplet
1 va_sM) == FStar.Seq.Base.index #Vale.Def.Types_s.quad32 (Vale.AES.AES_s.key_to_round_keys_LE
AES_256 key) j))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_reg64 rRdx; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_KeyExpansion256Stdcall win input_key_b output_key_expansion_b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansion256Stdcall (va_code_KeyExpansion256Stdcall win) va_s0
win input_key_b output_key_expansion_b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_reg64
rRdx va_sM (va_update_ok va_sM (va_update_mem va_sM va_s0))))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_reg64 rRdx; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- AES256EncryptRound
val va_code_AES256EncryptRound : n:nat -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_AES256EncryptRound n =
(va_Block (va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) (16 `op_Multiply` n) Secret) (va_CCons (va_code_AESNI_enc
(va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_CNil ()))))
val va_codegen_success_AES256EncryptRound : n:nat -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_AES256EncryptRound n =
(va_pbool_and (va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) (16 `op_Multiply` n) Secret) (va_pbool_and
(va_codegen_success_AESNI_enc (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_AES256EncryptRound (va_mods:va_mods_t) (n:nat) (init:quad32) (round_keys:(seq quad32))
(keys_buffer:buffer128) : (va_quickCode unit (va_code_AES256EncryptRound n)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(va_arg5:Vale.Def.Types_s.quad32) = va_get_xmm 0 va_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 252 column 33 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES_s.commute_sub_bytes_shift_rows va_arg5) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 253 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) (16 `op_Multiply` n) Secret keys_buffer n) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 254 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_enc (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_QEmpty (()))))))
val va_lemma_AES256EncryptRound : va_b0:va_code -> va_s0:va_state -> n:nat -> init:quad32 ->
round_keys:(seq quad32) -> keys_buffer:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AES256EncryptRound n) va_s0 /\ va_get_ok va_s0 /\
(aesni_enabled /\ sse_enabled) /\ (1 <= n /\ n < 14 /\ 14 <= FStar.Seq.Base.length #quad32
round_keys) /\ va_get_xmm 0 va_s0 == Vale.AES.AES_s.eval_rounds_def init round_keys (n - 1) /\
va_get_reg64 rR8 va_s0 == Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 keys_buffer
(va_get_mem_heaplet 0 va_s0) /\ Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0)
(va_get_reg64 rR8 va_s0) keys_buffer 15 (va_get_mem_layout va_s0) Secret /\
Vale.X64.Decls.buffer128_read keys_buffer n (va_get_mem_heaplet 0 va_s0) ==
FStar.Seq.Base.index #quad32 round_keys n))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_get_xmm 0 va_sM == Vale.AES.AES_s.eval_rounds_def init round_keys n /\ va_state_eq va_sM
(va_update_flags va_sM (va_update_xmm 2 va_sM (va_update_xmm 0 va_sM (va_update_ok va_sM
va_s0))))))
[@"opaque_to_smt"]
let va_lemma_AES256EncryptRound va_b0 va_s0 n init round_keys keys_buffer =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok] in
let va_qc = va_qcode_AES256EncryptRound va_mods n init round_keys keys_buffer in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_AES256EncryptRound n) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 232 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 250 column 53 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 0 va_sM == Vale.AES.AES_s.eval_rounds_def init round_keys n)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM) | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsVector.fsti.checked",
"Vale.X64.InsMem.fsti.checked",
"Vale.X64.InsBasic.fsti.checked",
"Vale.X64.InsAes.fsti.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.AES_s.fst.checked",
"Vale.AES.AES_common_s.fst.checked",
"Vale.AES.AES256_helpers.fsti.checked",
"prims.fst.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Vale.AES.X64.AES256.fst"
} | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES256_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsAes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES256_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsAes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 20,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
n: Prims.nat ->
init: Vale.X64.Decls.quad32 ->
round_keys: FStar.Seq.Base.seq Vale.X64.Decls.quad32 ->
keys_buffer: Vale.X64.Memory.buffer128 ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Vale.X64.Decls.quad32",
"FStar.Seq.Base.seq",
"Vale.X64.Memory.buffer128",
"Vale.X64.Decls.va_state",
"Prims.unit",
"Prims.l_and",
"Prims.b2t",
"Vale.X64.Decls.va_get_ok",
"Vale.X64.CPU_Features_s.aesni_enabled",
"Vale.X64.CPU_Features_s.sse_enabled",
"Prims.op_LessThanOrEqual",
"Prims.op_LessThan",
"FStar.Seq.Base.length",
"Prims.eq2",
"Vale.Def.Types_s.quad32",
"Vale.X64.Decls.va_get_xmm",
"Vale.AES.AES_s.eval_rounds_def",
"Prims.op_Subtraction",
"Prims.int",
"Vale.X64.Decls.va_get_reg64",
"Vale.X64.Machine_s.rR8",
"Vale.X64.Memory.buffer_addr",
"Vale.X64.Memory.vuint128",
"Vale.X64.Decls.va_get_mem_heaplet",
"Vale.X64.Decls.validSrcAddrs128",
"Vale.X64.Decls.va_get_mem_layout",
"Vale.Arch.HeapTypes_s.Secret",
"Vale.X64.Decls.buffer128_read",
"FStar.Seq.Base.index",
"Prims.l_Forall",
"Vale.X64.Flags.t",
"Prims.l_imp",
"Vale.X64.State.vale_state",
"Vale.X64.Decls.va_upd_flags",
"Vale.X64.Decls.va_upd_xmm"
] | [] | false | false | false | true | true | let va_wp_AES256EncryptRound
(n: nat)
(init: quad32)
(round_keys: (seq quad32))
(keys_buffer: buffer128)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 =
| (va_get_ok va_s0 /\ (aesni_enabled /\ sse_enabled) /\
(1 <= n /\ n < 14 /\ 14 <= FStar.Seq.Base.length #quad32 round_keys) /\
va_get_xmm 0 va_s0 == Vale.AES.AES_s.eval_rounds_def init round_keys (n - 1) /\
va_get_reg64 rR8 va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 keys_buffer (va_get_mem_heaplet 0 va_s0) /\
Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0)
(va_get_reg64 rR8 va_s0)
keys_buffer
15
(va_get_mem_layout va_s0)
Secret /\
Vale.X64.Decls.buffer128_read keys_buffer n (va_get_mem_heaplet 0 va_s0) ==
FStar.Seq.Base.index #quad32 round_keys n /\
(forall (va_x_xmm0: quad32) (va_x_xmm2: quad32) (va_x_efl: Vale.X64.Flags.t).
let va_sM = va_upd_flags va_x_efl (va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 0 va_x_xmm0 va_s0)) in
va_get_ok va_sM /\ va_get_xmm 0 va_sM == Vale.AES.AES_s.eval_rounds_def init round_keys n ==>
va_k va_sM (()))) | false |
Vale.AES.X64.AES256.fst | Vale.AES.X64.AES256.va_lemma_AES256EncryptBlock | val va_lemma_AES256EncryptBlock : va_b0:va_code -> va_s0:va_state -> input:quad32 -> key:(seq
nat32) -> round_keys:(seq quad32) -> keys_buffer:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AES256EncryptBlock ()) va_s0 /\ va_get_ok va_s0 /\
(aesni_enabled /\ sse_enabled) /\ Vale.AES.AES_s.is_aes_key_LE AES_256 key /\
FStar.Seq.Base.length #quad32 round_keys == 15 /\ round_keys ==
Vale.AES.AES_s.key_to_round_keys_LE AES_256 key /\ va_get_xmm 0 va_s0 == input /\ va_get_reg64
rR8 va_s0 == Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 keys_buffer
(va_get_mem_heaplet 0 va_s0) /\ Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0)
(va_get_reg64 rR8 va_s0) keys_buffer 15 (va_get_mem_layout va_s0) Secret /\ (forall (i:nat) . i
< 15 ==> Vale.X64.Decls.buffer128_read keys_buffer i (va_get_mem_heaplet 0 va_s0) ==
FStar.Seq.Base.index #quad32 round_keys i)))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_get_xmm 0 va_sM == Vale.AES.AES_s.aes_encrypt_LE AES_256 key input /\ va_state_eq va_sM
(va_update_flags va_sM (va_update_xmm 2 va_sM (va_update_xmm 0 va_sM (va_update_ok va_sM
va_s0)))))) | val va_lemma_AES256EncryptBlock : va_b0:va_code -> va_s0:va_state -> input:quad32 -> key:(seq
nat32) -> round_keys:(seq quad32) -> keys_buffer:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AES256EncryptBlock ()) va_s0 /\ va_get_ok va_s0 /\
(aesni_enabled /\ sse_enabled) /\ Vale.AES.AES_s.is_aes_key_LE AES_256 key /\
FStar.Seq.Base.length #quad32 round_keys == 15 /\ round_keys ==
Vale.AES.AES_s.key_to_round_keys_LE AES_256 key /\ va_get_xmm 0 va_s0 == input /\ va_get_reg64
rR8 va_s0 == Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 keys_buffer
(va_get_mem_heaplet 0 va_s0) /\ Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0)
(va_get_reg64 rR8 va_s0) keys_buffer 15 (va_get_mem_layout va_s0) Secret /\ (forall (i:nat) . i
< 15 ==> Vale.X64.Decls.buffer128_read keys_buffer i (va_get_mem_heaplet 0 va_s0) ==
FStar.Seq.Base.index #quad32 round_keys i)))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_get_xmm 0 va_sM == Vale.AES.AES_s.aes_encrypt_LE AES_256 key input /\ va_state_eq va_sM
(va_update_flags va_sM (va_update_xmm 2 va_sM (va_update_xmm 0 va_sM (va_update_ok va_sM
va_s0)))))) | let va_lemma_AES256EncryptBlock va_b0 va_s0 input key round_keys keys_buffer =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok] in
let va_qc = va_qcode_AES256EncryptBlock va_mods input key round_keys keys_buffer in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_AES256EncryptBlock ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 257 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 278 column 52 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 0 va_sM == Vale.AES.AES_s.aes_encrypt_LE AES_256 key input)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM) | {
"file_name": "obj/Vale.AES.X64.AES256.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 859,
"start_col": 0,
"start_line": 848
} | module Vale.AES.X64.AES256
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsVector
open Vale.X64.InsAes
open Vale.X64.QuickCode
open Vale.X64.QuickCodes
open Vale.Arch.Types
open Vale.AES.AES256_helpers
open Vale.X64.CPU_Features_s
#reset-options "--z3rlimit 20"
//-- KeyExpansionRoundEven256
val va_code_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansionRoundEven256 round rcon =
(va_Block (va_CCons (va_code_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon)
(va_CCons (va_code_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_CCons (va_code_VPslldq4
(va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm
4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4)
(va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_CCons
(va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) (16 `op_Multiply`
(round + 1)) Secret) (va_CNil ()))))))))))))
val va_codegen_success_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansionRoundEven256 round rcon =
(va_pbool_and (va_codegen_success_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon)
(va_pbool_and (va_codegen_success_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) (16 `op_Multiply` (round + 1)) Secret) (va_ttrue ())))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansionRoundEven256 (va_mods:va_mods_t) (round:nat64) (rcon:nat8) (dst:buffer128)
(key:(seq nat32)) : (va_quickCode unit (va_code_KeyExpansionRoundEven256 round rcon)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 75 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 76 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 77 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 78 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 79 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 80 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 81 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 82 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 83 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 84 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) (16 `op_Multiply` (round + 1)) Secret dst (round + 1)) (fun (va_s:va_state) _
-> let (va_arg17:Prims.int) = round + 1 in let (va_arg16:Vale.Def.Types_s.nat32) = rcon in let
(va_arg15:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in let
(va_arg14:Vale.Def.Types_s.quad32) = va_get_xmm 1 va_old_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 87 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_simd_round_key va_arg14 va_arg15 va_arg16
va_arg17) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 88 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QEmpty (())))))))))))))))
val va_lemma_KeyExpansionRoundEven256 : va_b0:va_code -> va_s0:va_state -> round:nat64 -> rcon:nat8
-> dst:buffer128 -> key:(seq nat32)
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundEven256 round rcon) va_s0 /\
va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 == 0 /\ rcon ==
Vale.AES.AES_common_s.aes_rcon ((round + 1) `op_Division` 2 - 1) /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ va_get_xmm 1 va_sM == Vale.X64.Decls.buffer128_read dst
(round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 1 va_sM ==
Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) /\ va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4
va_sM (va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM
(va_update_ok va_sM (va_update_mem va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansionRoundEven256 va_b0 va_s0 round rcon dst key =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansionRoundEven256 va_mods round rcon dst key in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansionRoundEven256 round rcon)
va_qc va_s0 (fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 50 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 61 column 65 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 71 column 54 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 1 va_sM == Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1
va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 72 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 1 va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 73 column 82 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM) (round + 1) (round + 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundEven256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32))
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 == 0 /\ rcon ==
Vale.AES.AES_common_s.aes_rcon ((round + 1) `op_Division` 2 - 1) /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round /\ (forall (va_x_mem:vale_heap)
(va_x_heap1:vale_heap) (va_x_xmm1:quad32) (va_x_xmm2:quad32) (va_x_xmm4:quad32)
(va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags va_x_efl (va_upd_xmm 4 va_x_xmm4
(va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 1 va_x_xmm1 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem
va_x_mem va_s0))))) in va_get_ok va_sM /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1
va_sM) (va_get_reg64 rRdx va_sM) dst 15 (va_get_mem_layout va_sM) Secret /\ va_get_xmm 1 va_sM
== Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 1
va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> dst:buffer128 -> key:(seq
nat32) -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundEven256 round rcon dst key va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundEven256 round rcon)
([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem])
va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundEven256 round rcon dst key va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundEven256 (va_code_KeyExpansionRoundEven256 round
rcon) va_s0 round rcon dst key in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 2 va_sM
(va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundEven256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32)) :
(va_quickCode unit (va_code_KeyExpansionRoundEven256 round rcon)) =
(va_QProc (va_code_KeyExpansionRoundEven256 round rcon) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm
2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem]) (va_wp_KeyExpansionRoundEven256 round rcon
dst key) (va_wpProof_KeyExpansionRoundEven256 round rcon dst key))
//--
//-- KeyExpansionRoundOdd256
val va_code_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansionRoundOdd256 round rcon =
(va_Block (va_CCons (va_code_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0) (va_CCons
(va_code_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_CCons (va_code_VPslldq4
(va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm
4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4)
(va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_CCons
(va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 3) (16 `op_Multiply`
(round + 1)) Secret) (va_CNil ()))))))))))))
val va_codegen_success_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansionRoundOdd256 round rcon =
(va_pbool_and (va_codegen_success_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0)
(va_pbool_and (va_codegen_success_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) (16 `op_Multiply` (round + 1)) Secret) (va_ttrue ())))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansionRoundOdd256 (va_mods:va_mods_t) (round:nat64) (rcon:nat8) (dst:buffer128)
(key:(seq nat32)) : (va_quickCode unit (va_code_KeyExpansionRoundOdd256 round rcon)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 118 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 119 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 120 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 121 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 122 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 123 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 124 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 125 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 126 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 127 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) (16 `op_Multiply` (round + 1)) Secret dst (round + 1)) (fun (va_s:va_state) _
-> let (va_arg20:Prims.int) = round + 1 in let (va_arg19:Vale.Def.Types_s.quad32) = va_get_xmm
1 va_old_s in let (va_arg18:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 130 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_simd_round_key va_arg18 va_arg19 0 va_arg20)
(let (va_arg17:Prims.int) = round + 1 in let (va_arg16:Vale.Def.Types_s.quad32) = va_get_xmm 1
va_old_s in let (va_arg15:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 131 column 33 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_round_key_256_rcon_odd va_arg15 va_arg16 0
va_arg17) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 132 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QEmpty
(()))))))))))))))))
val va_lemma_KeyExpansionRoundOdd256 : va_b0:va_code -> va_s0:va_state -> round:nat64 -> rcon:nat8
-> dst:buffer128 -> key:(seq nat32)
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundOdd256 round rcon) va_s0 /\ va_get_ok
va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64 rRdx va_s0)
dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\ sse_enabled) /\ (1
<= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 =!= 0 /\ Vale.AES.AES_s.is_aes_key_LE
AES_256 key /\ va_get_xmm 3 va_s0 == Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\
va_get_xmm 1 va_s0 == Vale.AES.AES256_helpers.expand_key_256 key round))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ va_get_xmm 3 va_sM == Vale.X64.Decls.buffer128_read dst
(round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 3 va_sM ==
Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) /\ va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4
va_sM (va_update_xmm 3 va_sM (va_update_xmm 2 va_sM (va_update_mem_heaplet 1 va_sM
(va_update_ok va_sM (va_update_mem va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansionRoundOdd256 va_b0 va_s0 round rcon dst key =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2;
va_Mod_mem_heaplet 1; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansionRoundOdd256 va_mods round rcon dst key in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansionRoundOdd256 round rcon)
va_qc va_s0 (fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 93 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 104 column 65 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 114 column 54 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 3 va_sM == Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1
va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 115 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 3 va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 116 column 82 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM) (round + 1) (round + 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet
1; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundOdd256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32))
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 =!= 0 /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round /\ (forall (va_x_mem:vale_heap)
(va_x_heap1:vale_heap) (va_x_xmm2:quad32) (va_x_xmm3:quad32) (va_x_xmm4:quad32)
(va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags va_x_efl (va_upd_xmm 4 va_x_xmm4
(va_upd_xmm 3 va_x_xmm3 (va_upd_xmm 2 va_x_xmm2 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem
va_x_mem va_s0))))) in va_get_ok va_sM /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1
va_sM) (va_get_reg64 rRdx va_sM) dst 15 (va_get_mem_layout va_sM) Secret /\ va_get_xmm 3 va_sM
== Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 3
va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> dst:buffer128 -> key:(seq
nat32) -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundOdd256 round rcon dst key va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundOdd256 round rcon)
([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet 1; va_Mod_mem])
va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundOdd256 round rcon dst key va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundOdd256 (va_code_KeyExpansionRoundOdd256 round
rcon) va_s0 round rcon dst key in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet
1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundOdd256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32)) :
(va_quickCode unit (va_code_KeyExpansionRoundOdd256 round rcon)) =
(va_QProc (va_code_KeyExpansionRoundOdd256 round rcon) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm
3; va_Mod_xmm 2; va_Mod_mem_heaplet 1; va_Mod_mem]) (va_wp_KeyExpansionRoundOdd256 round rcon
dst key) (va_wpProof_KeyExpansionRoundOdd256 round rcon dst key))
//--
//-- KeyExpansionRoundUnrolledRecursive256
val va_code_KeyExpansionRoundUnrolledRecursive256 : n:int -> Tot va_code(decreases %[n])
[@ "opaque_to_smt"]
let rec va_code_KeyExpansionRoundUnrolledRecursive256 n =
(va_Block (va_CCons (if (1 < n && n <= 14) then va_Block (va_CCons
(va_code_KeyExpansionRoundUnrolledRecursive256 (n - 1)) (va_CCons (if (n `op_Modulus` 2 = 0)
then va_Block (va_CCons (va_code_KeyExpansionRoundEven256 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1))) (va_CNil ())) else va_Block (va_CCons
(va_code_KeyExpansionRoundOdd256 (n - 1) (Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 -
1))) (va_CNil ()))) (va_CNil ()))) else va_Block (va_CNil ())) (va_CNil ())))
val va_codegen_success_KeyExpansionRoundUnrolledRecursive256 : n:int -> Tot va_pbool(decreases %[n])
[@ "opaque_to_smt"]
let rec va_codegen_success_KeyExpansionRoundUnrolledRecursive256 n =
(va_pbool_and (if (1 < n && n <= 14) then va_pbool_and
(va_codegen_success_KeyExpansionRoundUnrolledRecursive256 (n - 1)) (va_pbool_and (if (n
`op_Modulus` 2 = 0) then va_pbool_and (va_codegen_success_KeyExpansionRoundEven256 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1))) (va_ttrue ()) else va_pbool_and
(va_codegen_success_KeyExpansionRoundOdd256 (n - 1) (Vale.AES.AES_common_s.aes_rcon (n
`op_Division` 2 - 1))) (va_ttrue ())) (va_ttrue ())) else va_ttrue ()) (va_ttrue ()))
val va_lemma_KeyExpansionRoundUnrolledRecursive256 : va_b0:va_code -> va_s0:va_state -> key:(seq
nat32) -> dst:buffer128 -> n:int
-> Ghost (va_state & va_fuel)(decreases %[n])
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundUnrolledRecursive256 n) va_s0 /\
va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (0 < n /\ n <= 14) /\ Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1
va_s0 == Vale.AES.AES256_helpers.expand_key_256 key 0 /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key 1 /\ va_get_xmm 1 va_s0 ==
Vale.X64.Decls.buffer128_read dst 0 (va_get_mem_heaplet 1 va_s0) /\ va_get_xmm 3 va_s0 ==
Vale.X64.Decls.buffer128_read dst 1 (va_get_mem_heaplet 1 va_s0) /\ va_get_reg64 rRdx va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 dst (va_get_mem_heaplet 1 va_s0)))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ Vale.X64.Decls.modifies_buffer128 dst (va_get_mem_heaplet 1
va_s0) (va_get_mem_heaplet 1 va_sM) /\ Vale.X64.Decls.buffer128_read dst n (va_get_mem_heaplet
1 va_sM) == (if (n `op_Modulus` 2 = 0) then va_get_xmm 1 va_sM else va_get_xmm 3 va_sM) /\
Vale.X64.Decls.buffer128_read dst (n - 1) (va_get_mem_heaplet 1 va_sM) == (if ((n - 1)
`op_Modulus` 2 = 0) then va_get_xmm 1 va_sM else va_get_xmm 3 va_sM) /\ (forall j .
{:pattern(buffer128_read dst j (va_get_mem_heaplet 1 va_sM))}0 <= j /\ j <= n ==>
Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_sM) ==
Vale.AES.AES256_helpers.expand_key_256 key j) /\ va_state_eq va_sM (va_update_flags va_sM
(va_update_xmm 4 va_sM (va_update_xmm 3 va_sM (va_update_xmm 2 va_sM (va_update_xmm 1 va_sM
(va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM va_s0))))))))))
[@"opaque_to_smt"]
let rec va_lemma_KeyExpansionRoundUnrolledRecursive256 va_b0 va_s0 key dst n =
va_reveal_opaque (`%va_code_KeyExpansionRoundUnrolledRecursive256)
(va_code_KeyExpansionRoundUnrolledRecursive256 n);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
let va_b2 = va_tl va_b1 in
let va_c2 = va_hd va_b1 in
let (va_fc2, va_s2) =
(
if (1 < n && n <= 14) then
(
let va_b3 = va_get_block va_c2 in
let (va_s4, va_fc4) = va_lemma_KeyExpansionRoundUnrolledRecursive256 (va_hd va_b3) va_s0 key
dst (n - 1) in
let va_b4 = va_tl va_b3 in
let (old_mem:vale_heap) = va_get_mem_heaplet 1 va_s4 in
let va_b6 = va_tl va_b4 in
let va_c6 = va_hd va_b4 in
let (va_fc6, va_s6) =
(
if (n `op_Modulus` 2 = 0) then
(
let va_b7 = va_get_block va_c6 in
let (va_s8, va_fc8) = va_lemma_KeyExpansionRoundEven256 (va_hd va_b7) va_s4 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1)) dst key in
let va_b8 = va_tl va_b7 in
let (va_s6, va_f8) = va_lemma_empty_total va_s8 va_b8 in
let va_fc6 = va_lemma_merge_total va_b7 va_s4 va_fc8 va_s8 va_f8 va_s6 in
(va_fc6, va_s6)
)
else
(
let va_b9 = va_get_block va_c6 in
let (va_s10, va_fc10) = va_lemma_KeyExpansionRoundOdd256 (va_hd va_b9) va_s4 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1)) dst key in
let va_b10 = va_tl va_b9 in
let (va_s6, va_f10) = va_lemma_empty_total va_s10 va_b10 in
let va_fc6 = va_lemma_merge_total va_b9 va_s4 va_fc10 va_s10 va_f10 va_s6 in
(va_fc6, va_s6)
)
) in
assert (forall j . {:pattern(buffer128_read dst j (va_get_mem_heaplet 1 va_s6))}0 <= j /\ j <
n ==> Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_s6) ==
Vale.X64.Decls.buffer128_read dst j old_mem);
let (va_s2, va_f6) = va_lemma_empty_total va_s6 va_b6 in
let va_f4 = va_lemma_merge_total va_b4 va_s4 va_fc6 va_s6 va_f6 va_s2 in
let va_fc2 = va_lemma_merge_total va_b3 va_s0 va_fc4 va_s4 va_f4 va_s2 in
(va_fc2, va_s2)
)
else
(
let va_b12 = va_get_block va_c2 in
let (va_s2, va_fc2) = va_lemma_empty_total va_s0 va_b12 in
(va_fc2, va_s2)
)
) in
let (va_sM, va_f2) = va_lemma_empty_total va_s2 va_b2 in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc2 va_s2 va_f2 va_sM in
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundUnrolledRecursive256 (key:(seq nat32)) (dst:buffer128) (n:int)
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (0 < n /\ n <= 14) /\ Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1
va_s0 == Vale.AES.AES256_helpers.expand_key_256 key 0 /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key 1 /\ va_get_xmm 1 va_s0 ==
Vale.X64.Decls.buffer128_read dst 0 (va_get_mem_heaplet 1 va_s0) /\ va_get_xmm 3 va_s0 ==
Vale.X64.Decls.buffer128_read dst 1 (va_get_mem_heaplet 1 va_s0) /\ va_get_reg64 rRdx va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 dst (va_get_mem_heaplet 1 va_s0) /\
(forall (va_x_mem:vale_heap) (va_x_heap1:vale_heap) (va_x_xmm1:quad32) (va_x_xmm2:quad32)
(va_x_xmm3:quad32) (va_x_xmm4:quad32) (va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags
va_x_efl (va_upd_xmm 4 va_x_xmm4 (va_upd_xmm 3 va_x_xmm3 (va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 1
va_x_xmm1 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem va_x_mem va_s0)))))) in va_get_ok va_sM
/\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst
15 (va_get_mem_layout va_sM) Secret /\ Vale.X64.Decls.modifies_buffer128 dst
(va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet 1 va_sM) /\ Vale.X64.Decls.buffer128_read dst
n (va_get_mem_heaplet 1 va_sM) == va_if (n `op_Modulus` 2 = 0) (fun _ -> va_get_xmm 1 va_sM)
(fun _ -> va_get_xmm 3 va_sM) /\ Vale.X64.Decls.buffer128_read dst (n - 1) (va_get_mem_heaplet
1 va_sM) == va_if ((n - 1) `op_Modulus` 2 = 0) (fun _ -> va_get_xmm 1 va_sM) (fun _ ->
va_get_xmm 3 va_sM) /\ (forall j . {:pattern(buffer128_read dst j (va_get_mem_heaplet 1
va_sM))}0 <= j /\ j <= n ==> Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_sM)
== Vale.AES.AES256_helpers.expand_key_256 key j) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundUnrolledRecursive256 : key:(seq nat32) -> dst:buffer128 -> n:int ->
va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundUnrolledRecursive256 key dst n va_s0
va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundUnrolledRecursive256
n) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_mem]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundUnrolledRecursive256 key dst n va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundUnrolledRecursive256
(va_code_KeyExpansionRoundUnrolledRecursive256 n) va_s0 key dst n in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok
va_sM (va_update_mem va_sM va_s0)))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundUnrolledRecursive256 (key:(seq nat32)) (dst:buffer128) (n:int) :
(va_quickCode unit (va_code_KeyExpansionRoundUnrolledRecursive256 n)) =
(va_QProc (va_code_KeyExpansionRoundUnrolledRecursive256 n) ([va_Mod_flags; va_Mod_xmm 4;
va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem])
(va_wp_KeyExpansionRoundUnrolledRecursive256 key dst n)
(va_wpProof_KeyExpansionRoundUnrolledRecursive256 key dst n))
//--
//-- KeyExpansion256Stdcall
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansion256Stdcall win =
(va_Block (va_CCons (if win then va_Block (va_CCons (va_code_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64 rRcx) 0 Secret)
(va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3)
(va_op_reg_opr64_reg64 rRcx) 16 Secret) (va_CNil ()))) else va_Block (va_CCons
(va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64
rRdi) 0 Secret) (va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm
3) (va_op_reg_opr64_reg64 rRdi) 16 Secret) (va_CCons (va_code_Mov64 (va_op_dst_opr64_reg64
rRdx) (va_op_opr64_reg64 rRsi)) (va_CNil ()))))) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) 0 Secret)
(va_CCons (va_code_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) 16 Secret) (va_CCons (va_code_KeyExpansionRoundUnrolledRecursive256 14)
(va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm
3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 4) (va_op_xmm_xmm 4)) (va_CNil ()))))))))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansion256Stdcall win =
(va_pbool_and (if win then va_pbool_and (va_codegen_success_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64 rRcx) 0 Secret)
(va_pbool_and (va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm
3) (va_op_reg_opr64_reg64 rRcx) 16 Secret) (va_ttrue ())) else va_pbool_and
(va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1)
(va_op_reg_opr64_reg64 rRdi) 0 Secret) (va_pbool_and (va_codegen_success_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3) (va_op_reg_opr64_reg64 rRdi) 16 Secret)
(va_pbool_and (va_codegen_success_Mov64 (va_op_dst_opr64_reg64 rRdx) (va_op_opr64_reg64 rRsi))
(va_ttrue ())))) (va_pbool_and (va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet
1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) 0 Secret) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) 16 Secret) (va_pbool_and
(va_codegen_success_KeyExpansionRoundUnrolledRecursive256 14) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 4) (va_op_xmm_xmm 4)) (va_ttrue ())))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansion256Stdcall (va_mods:va_mods_t) (win:bool) (input_key_b:buffer128)
(output_key_expansion_b:buffer128) : (va_quickCode unit (va_code_KeyExpansion256Stdcall win)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(key_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRcx va_s)
(fun _ -> va_get_reg64 rRdi va_s) in let (key_expansion_ptr:(va_int_range 0
18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRdx va_s) (fun _ -> va_get_reg64
rRsi va_s) in let (key:(FStar.Seq.Base.seq Vale.Def.Types_s.nat32)) =
Vale.AES.AES256_helpers.make_AES256_key (Vale.X64.Decls.buffer128_read input_key_b 0
(va_get_mem_heaplet 0 va_s)) (Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0
va_s)) in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 201 column 15 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_qInlineIf va_mods win (qblock va_mods (fun (va_s:va_state) -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 203 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64
rRcx) 0 Secret input_key_b 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 204 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3) (va_op_reg_opr64_reg64
rRcx) 16 Secret input_key_b 1) (va_QEmpty (()))))) (qblock va_mods (fun (va_s:va_state) ->
va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 208 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64
rRdi) 0 Secret input_key_b 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 209 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3) (va_op_reg_opr64_reg64
rRdi) 16 Secret input_key_b 1) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 210 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Mov64 (va_op_dst_opr64_reg64 rRdx) (va_op_opr64_reg64 rRsi)) (va_QEmpty (())))))))
(fun (va_s:va_state) va_g -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 213 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) 0 Secret output_key_expansion_b 0) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 214 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) 16 Secret output_key_expansion_b 1) (fun (va_s:va_state) _ -> va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 216 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 217 column 42 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_KeyExpansionRoundUnrolledRecursive256 key output_key_expansion_b 14) (fun
(va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 218 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_expand_key_256 key 15) (va_QLemma va_range1
"***** PRECONDITION NOT MET AT line 219 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
true (fun _ -> va_reveal_eq (`%key_to_round_keys_LE) key_to_round_keys_LE key_to_round_keys_LE)
(fun _ -> va_reveal_opaque (`%key_to_round_keys_LE) key_to_round_keys_LE) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 222 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 223 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 224 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 225 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 4) (va_op_xmm_xmm 4)) (va_QEmpty (()))))))))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansion256Stdcall va_b0 va_s0 win input_key_b output_key_expansion_b =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_reg64 rRdx; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansion256Stdcall va_mods win input_key_b output_key_expansion_b in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansion256Stdcall win) va_qc va_s0
(fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 177 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ (let (key_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ ->
va_get_reg64 rRcx va_s0) (fun _ -> va_get_reg64 rRdi va_s0) in let
(key_expansion_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ -> va_get_reg64
rRdx va_s0) (fun _ -> va_get_reg64 rRsi va_s0) in let (key:(FStar.Seq.Base.seq
Vale.Def.Types_s.nat32)) = Vale.AES.AES256_helpers.make_AES256_key
(Vale.X64.Decls.buffer128_read input_key_b 0 (va_get_mem_heaplet 0 va_s0))
(Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0 va_s0)) in label va_range1
"***** POSTCONDITION NOT MET AT line 193 column 52 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(aesni_enabled /\ avx_enabled /\ sse_enabled) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 194 column 76 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_sM) key_ptr input_key_b 2
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 195 column 98 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) key_expansion_ptr
output_key_expansion_b 15 (va_get_mem_layout va_sM) Secret)) /\ (let (key_ptr:(va_int_range 0
18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRcx va_s0) (fun _ -> va_get_reg64
rRdi va_s0) in let (key_expansion_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _
-> va_get_reg64 rRdx va_s0) (fun _ -> va_get_reg64 rRsi va_s0) in let (key:(FStar.Seq.Base.seq
Vale.Def.Types_s.nat32)) = Vale.AES.AES256_helpers.make_AES256_key
(Vale.X64.Decls.buffer128_read input_key_b 0 (va_get_mem_heaplet 0 va_s0))
(Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0 va_s0)) in label va_range1
"***** POSTCONDITION NOT MET AT line 197 column 70 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer128 output_key_expansion_b (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 199 column 109 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(forall (j:nat) . {:pattern(buffer128_read output_key_expansion_b j (va_get_mem_heaplet 1
va_sM))}j <= 14 ==> Vale.X64.Decls.buffer128_read output_key_expansion_b j (va_get_mem_heaplet
1 va_sM) == FStar.Seq.Base.index #Vale.Def.Types_s.quad32 (Vale.AES.AES_s.key_to_round_keys_LE
AES_256 key) j))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_reg64 rRdx; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_KeyExpansion256Stdcall win input_key_b output_key_expansion_b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansion256Stdcall (va_code_KeyExpansion256Stdcall win) va_s0
win input_key_b output_key_expansion_b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_reg64
rRdx va_sM (va_update_ok va_sM (va_update_mem va_sM va_s0))))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_reg64 rRdx; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- AES256EncryptRound
val va_code_AES256EncryptRound : n:nat -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_AES256EncryptRound n =
(va_Block (va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) (16 `op_Multiply` n) Secret) (va_CCons (va_code_AESNI_enc
(va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_CNil ()))))
val va_codegen_success_AES256EncryptRound : n:nat -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_AES256EncryptRound n =
(va_pbool_and (va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) (16 `op_Multiply` n) Secret) (va_pbool_and
(va_codegen_success_AESNI_enc (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_AES256EncryptRound (va_mods:va_mods_t) (n:nat) (init:quad32) (round_keys:(seq quad32))
(keys_buffer:buffer128) : (va_quickCode unit (va_code_AES256EncryptRound n)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(va_arg5:Vale.Def.Types_s.quad32) = va_get_xmm 0 va_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 252 column 33 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES_s.commute_sub_bytes_shift_rows va_arg5) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 253 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) (16 `op_Multiply` n) Secret keys_buffer n) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 254 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_enc (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_QEmpty (()))))))
val va_lemma_AES256EncryptRound : va_b0:va_code -> va_s0:va_state -> n:nat -> init:quad32 ->
round_keys:(seq quad32) -> keys_buffer:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AES256EncryptRound n) va_s0 /\ va_get_ok va_s0 /\
(aesni_enabled /\ sse_enabled) /\ (1 <= n /\ n < 14 /\ 14 <= FStar.Seq.Base.length #quad32
round_keys) /\ va_get_xmm 0 va_s0 == Vale.AES.AES_s.eval_rounds_def init round_keys (n - 1) /\
va_get_reg64 rR8 va_s0 == Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 keys_buffer
(va_get_mem_heaplet 0 va_s0) /\ Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0)
(va_get_reg64 rR8 va_s0) keys_buffer 15 (va_get_mem_layout va_s0) Secret /\
Vale.X64.Decls.buffer128_read keys_buffer n (va_get_mem_heaplet 0 va_s0) ==
FStar.Seq.Base.index #quad32 round_keys n))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_get_xmm 0 va_sM == Vale.AES.AES_s.eval_rounds_def init round_keys n /\ va_state_eq va_sM
(va_update_flags va_sM (va_update_xmm 2 va_sM (va_update_xmm 0 va_sM (va_update_ok va_sM
va_s0))))))
[@"opaque_to_smt"]
let va_lemma_AES256EncryptRound va_b0 va_s0 n init round_keys keys_buffer =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok] in
let va_qc = va_qcode_AES256EncryptRound va_mods n init round_keys keys_buffer in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_AES256EncryptRound n) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 232 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 250 column 53 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 0 va_sM == Vale.AES.AES_s.eval_rounds_def init round_keys n)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_AES256EncryptRound (n:nat) (init:quad32) (round_keys:(seq quad32))
(keys_buffer:buffer128) (va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ (aesni_enabled /\ sse_enabled) /\ (1 <= n /\ n < 14 /\ 14 <=
FStar.Seq.Base.length #quad32 round_keys) /\ va_get_xmm 0 va_s0 ==
Vale.AES.AES_s.eval_rounds_def init round_keys (n - 1) /\ va_get_reg64 rR8 va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 keys_buffer (va_get_mem_heaplet 0 va_s0)
/\ Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0) (va_get_reg64 rR8 va_s0)
keys_buffer 15 (va_get_mem_layout va_s0) Secret /\ Vale.X64.Decls.buffer128_read keys_buffer n
(va_get_mem_heaplet 0 va_s0) == FStar.Seq.Base.index #quad32 round_keys n /\ (forall
(va_x_xmm0:quad32) (va_x_xmm2:quad32) (va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags
va_x_efl (va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 0 va_x_xmm0 va_s0)) in va_get_ok va_sM /\
va_get_xmm 0 va_sM == Vale.AES.AES_s.eval_rounds_def init round_keys n ==> va_k va_sM (())))
val va_wpProof_AES256EncryptRound : n:nat -> init:quad32 -> round_keys:(seq quad32) ->
keys_buffer:buffer128 -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AES256EncryptRound n init round_keys keys_buffer va_s0
va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AES256EncryptRound n) ([va_Mod_flags;
va_Mod_xmm 2; va_Mod_xmm 0]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_AES256EncryptRound n init round_keys keys_buffer va_s0 va_k =
let (va_sM, va_f0) = va_lemma_AES256EncryptRound (va_code_AES256EncryptRound n) va_s0 n init
round_keys keys_buffer in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 2 va_sM (va_update_xmm 0 va_sM
(va_update_ok va_sM va_s0)))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_AES256EncryptRound (n:nat) (init:quad32) (round_keys:(seq quad32))
(keys_buffer:buffer128) : (va_quickCode unit (va_code_AES256EncryptRound n)) =
(va_QProc (va_code_AES256EncryptRound n) ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0])
(va_wp_AES256EncryptRound n init round_keys keys_buffer) (va_wpProof_AES256EncryptRound n init
round_keys keys_buffer))
//--
//-- AES256EncryptBlock
[@ "opaque_to_smt" va_qattr]
let va_code_AES256EncryptBlock () =
(va_Block (va_CCons (va_Block (va_CNil ())) (va_CCons (va_code_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64 rR8) 0 Secret) (va_CCons
(va_code_Pxor (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_CCons (va_code_AES256EncryptRound 1)
(va_CCons (va_code_AES256EncryptRound 2) (va_CCons (va_code_AES256EncryptRound 3) (va_CCons
(va_code_AES256EncryptRound 4) (va_CCons (va_code_AES256EncryptRound 5) (va_CCons
(va_code_AES256EncryptRound 6) (va_CCons (va_code_AES256EncryptRound 7) (va_CCons
(va_code_AES256EncryptRound 8) (va_CCons (va_code_AES256EncryptRound 9) (va_CCons
(va_code_AES256EncryptRound 10) (va_CCons (va_code_AES256EncryptRound 11) (va_CCons
(va_code_AES256EncryptRound 12) (va_CCons (va_code_AES256EncryptRound 13) (va_CCons
(va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) (16 `op_Multiply` 14) Secret) (va_CCons (va_code_AESNI_enc_last (va_op_xmm_xmm 0)
(va_op_xmm_xmm 2)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_CNil
())))))))))))))))))))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_AES256EncryptBlock () =
(va_pbool_and (va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) 0 Secret) (va_pbool_and (va_codegen_success_Pxor (va_op_xmm_xmm 0)
(va_op_xmm_xmm 2)) (va_pbool_and (va_codegen_success_AES256EncryptRound 1) (va_pbool_and
(va_codegen_success_AES256EncryptRound 2) (va_pbool_and (va_codegen_success_AES256EncryptRound
3) (va_pbool_and (va_codegen_success_AES256EncryptRound 4) (va_pbool_and
(va_codegen_success_AES256EncryptRound 5) (va_pbool_and (va_codegen_success_AES256EncryptRound
6) (va_pbool_and (va_codegen_success_AES256EncryptRound 7) (va_pbool_and
(va_codegen_success_AES256EncryptRound 8) (va_pbool_and (va_codegen_success_AES256EncryptRound
9) (va_pbool_and (va_codegen_success_AES256EncryptRound 10) (va_pbool_and
(va_codegen_success_AES256EncryptRound 11) (va_pbool_and (va_codegen_success_AES256EncryptRound
12) (va_pbool_and (va_codegen_success_AES256EncryptRound 13) (va_pbool_and
(va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) (16 `op_Multiply` 14) Secret) (va_pbool_and
(va_codegen_success_AESNI_enc_last (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_ttrue ())))))))))))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_AES256EncryptBlock (va_mods:va_mods_t) (input:quad32) (key:(seq nat32))
(round_keys:(seq quad32)) (keys_buffer:buffer128) : (va_quickCode unit
(va_code_AES256EncryptBlock ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_qAssertSquash
va_range1
"***** EXPRESSION PRECONDITIONS NOT MET WITHIN line 280 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
((fun a_539 (s_540:(FStar.Seq.Base.seq a_539)) (i_541:Prims.nat) -> let (i_515:Prims.nat) =
i_541 in Prims.b2t (Prims.op_LessThan i_515 (FStar.Seq.Base.length #a_539 s_540)))
Vale.Def.Types_s.quad32 round_keys 0) (fun _ -> let (init:Vale.Def.Types_s.quad32) =
Vale.Def.Types_s.quad32_xor input (FStar.Seq.Base.index #Vale.Def.Types_s.quad32 round_keys 0)
in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 282 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) 0 Secret keys_buffer 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 283 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 284 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 1 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 285 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 2 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 286 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 3 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 287 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 4 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 288 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 5 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 289 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 6 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 290 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 7 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 291 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 8 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 292 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 9 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 293 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 10 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 294 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 11 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 295 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 12 init round_keys keys_buffer) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 296 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 13 init round_keys keys_buffer) (fun (va_s:va_state) _ -> let
(va_arg24:Vale.Def.Types_s.quad32) = va_get_xmm 0 va_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 297 column 33 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES_s.commute_sub_bytes_shift_rows va_arg24) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 298 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) (16 `op_Multiply` 14) Secret keys_buffer 14) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 299 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_enc_last (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 302 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (fun (va_s:va_state) _ -> va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 303 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES_s.aes_encrypt_LE_reveal ()) (va_QEmpty (())))))))))))))))))))))))) | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsVector.fsti.checked",
"Vale.X64.InsMem.fsti.checked",
"Vale.X64.InsBasic.fsti.checked",
"Vale.X64.InsAes.fsti.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.AES_s.fst.checked",
"Vale.AES.AES_common_s.fst.checked",
"Vale.AES.AES256_helpers.fsti.checked",
"prims.fst.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Vale.AES.X64.AES256.fst"
} | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES256_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsAes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES256_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsAes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 20,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
input: Vale.X64.Decls.quad32 ->
key: FStar.Seq.Base.seq Vale.X64.Memory.nat32 ->
round_keys: FStar.Seq.Base.seq Vale.X64.Decls.quad32 ->
keys_buffer: Vale.X64.Memory.buffer128
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.Decls.quad32",
"FStar.Seq.Base.seq",
"Vale.X64.Memory.nat32",
"Vale.X64.Memory.buffer128",
"Vale.X64.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_Mod_xmm",
"Vale.X64.QuickCode.va_Mod_ok",
"Prims.Nil",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"Prims.list",
"Vale.X64.QuickCode.__proj__QProc__item__mods",
"Vale.AES.X64.AES256.va_code_AES256EncryptBlock",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.tuple3",
"Vale.X64.State.vale_state",
"Vale.X64.QuickCodes.va_wp_sound_code_norm",
"Prims.l_and",
"Vale.X64.QuickCodes.label",
"Vale.X64.QuickCodes.va_range1",
"Prims.b2t",
"Vale.X64.Decls.va_get_ok",
"Vale.Def.Types_s.quad32",
"Vale.X64.Decls.va_get_xmm",
"Vale.AES.AES_s.aes_encrypt_LE",
"Vale.AES.AES_common_s.AES_256",
"Vale.X64.QuickCode.quickCode",
"Vale.AES.X64.AES256.va_qcode_AES256EncryptBlock"
] | [] | false | false | false | false | false | let va_lemma_AES256EncryptBlock va_b0 va_s0 input key round_keys keys_buffer =
| let va_mods:va_mods_t = [va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok] in
let va_qc = va_qcode_AES256EncryptBlock va_mods input key round_keys keys_buffer in
let va_sM, va_fM, va_g =
va_wp_sound_code_norm (va_code_AES256EncryptBlock ())
va_qc
va_s0
(fun va_s0 va_sM va_g ->
let () = va_g in
label va_range1
"***** POSTCONDITION NOT MET AT line 257 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\
label va_range1
"***** POSTCONDITION NOT MET AT line 278 column 52 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 0 va_sM == Vale.AES.AES_s.aes_encrypt_LE AES_256 key input))
in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM) | false |
Vale.AES.X64.AES256.fst | Vale.AES.X64.AES256.va_lemma_KeyExpansion256Stdcall | val va_lemma_KeyExpansion256Stdcall : va_b0:va_code -> va_s0:va_state -> win:bool ->
input_key_b:buffer128 -> output_key_expansion_b:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_KeyExpansion256Stdcall win) va_s0 /\ va_get_ok va_s0
/\ (let (key_ptr:(va_int_range 0 18446744073709551615)) = (if win then va_get_reg64 rRcx va_s0
else va_get_reg64 rRdi va_s0) in let (key_expansion_ptr:(va_int_range 0 18446744073709551615))
= (if win then va_get_reg64 rRdx va_s0 else va_get_reg64 rRsi va_s0) in let
(key:(FStar.Seq.Base.seq Vale.Def.Types_s.nat32)) = Vale.AES.AES256_helpers.make_AES256_key
(Vale.X64.Decls.buffer128_read input_key_b 0 (va_get_mem_heaplet 0 va_s0))
(Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0 va_s0)) in aesni_enabled /\
avx_enabled /\ sse_enabled /\ Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0)
key_ptr input_key_b 2 (va_get_mem_layout va_s0) Secret /\ Vale.X64.Decls.validDstAddrs128
(va_get_mem_heaplet 1 va_s0) key_expansion_ptr output_key_expansion_b 15 (va_get_mem_layout
va_s0) Secret)))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
(let (key_ptr:(va_int_range 0 18446744073709551615)) = (if win then va_get_reg64 rRcx va_s0
else va_get_reg64 rRdi va_s0) in let (key_expansion_ptr:(va_int_range 0 18446744073709551615))
= (if win then va_get_reg64 rRdx va_s0 else va_get_reg64 rRsi va_s0) in let
(key:(FStar.Seq.Base.seq Vale.Def.Types_s.nat32)) = Vale.AES.AES256_helpers.make_AES256_key
(Vale.X64.Decls.buffer128_read input_key_b 0 (va_get_mem_heaplet 0 va_s0))
(Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0 va_s0)) in aesni_enabled /\
avx_enabled /\ sse_enabled /\ Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_sM)
key_ptr input_key_b 2 (va_get_mem_layout va_sM) Secret /\ Vale.X64.Decls.validDstAddrs128
(va_get_mem_heaplet 1 va_sM) key_expansion_ptr output_key_expansion_b 15 (va_get_mem_layout
va_sM) Secret) /\ (let (key_ptr:(va_int_range 0 18446744073709551615)) = (if win then
va_get_reg64 rRcx va_s0 else va_get_reg64 rRdi va_s0) in let (key_expansion_ptr:(va_int_range 0
18446744073709551615)) = (if win then va_get_reg64 rRdx va_s0 else va_get_reg64 rRsi va_s0) in
let (key:(FStar.Seq.Base.seq Vale.Def.Types_s.nat32)) = Vale.AES.AES256_helpers.make_AES256_key
(Vale.X64.Decls.buffer128_read input_key_b 0 (va_get_mem_heaplet 0 va_s0))
(Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0 va_s0)) in
Vale.X64.Decls.modifies_buffer128 output_key_expansion_b (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM) /\ (forall (j:nat) . {:pattern(buffer128_read
output_key_expansion_b j (va_get_mem_heaplet 1 va_sM))}j <= 14 ==>
Vale.X64.Decls.buffer128_read output_key_expansion_b j (va_get_mem_heaplet 1 va_sM) ==
FStar.Seq.Base.index #Vale.Def.Types_s.quad32 (Vale.AES.AES_s.key_to_round_keys_LE AES_256 key)
j)) /\ va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_reg64
rRdx va_sM (va_update_ok va_sM (va_update_mem va_sM va_s0))))))))))) | val va_lemma_KeyExpansion256Stdcall : va_b0:va_code -> va_s0:va_state -> win:bool ->
input_key_b:buffer128 -> output_key_expansion_b:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_KeyExpansion256Stdcall win) va_s0 /\ va_get_ok va_s0
/\ (let (key_ptr:(va_int_range 0 18446744073709551615)) = (if win then va_get_reg64 rRcx va_s0
else va_get_reg64 rRdi va_s0) in let (key_expansion_ptr:(va_int_range 0 18446744073709551615))
= (if win then va_get_reg64 rRdx va_s0 else va_get_reg64 rRsi va_s0) in let
(key:(FStar.Seq.Base.seq Vale.Def.Types_s.nat32)) = Vale.AES.AES256_helpers.make_AES256_key
(Vale.X64.Decls.buffer128_read input_key_b 0 (va_get_mem_heaplet 0 va_s0))
(Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0 va_s0)) in aesni_enabled /\
avx_enabled /\ sse_enabled /\ Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0)
key_ptr input_key_b 2 (va_get_mem_layout va_s0) Secret /\ Vale.X64.Decls.validDstAddrs128
(va_get_mem_heaplet 1 va_s0) key_expansion_ptr output_key_expansion_b 15 (va_get_mem_layout
va_s0) Secret)))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
(let (key_ptr:(va_int_range 0 18446744073709551615)) = (if win then va_get_reg64 rRcx va_s0
else va_get_reg64 rRdi va_s0) in let (key_expansion_ptr:(va_int_range 0 18446744073709551615))
= (if win then va_get_reg64 rRdx va_s0 else va_get_reg64 rRsi va_s0) in let
(key:(FStar.Seq.Base.seq Vale.Def.Types_s.nat32)) = Vale.AES.AES256_helpers.make_AES256_key
(Vale.X64.Decls.buffer128_read input_key_b 0 (va_get_mem_heaplet 0 va_s0))
(Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0 va_s0)) in aesni_enabled /\
avx_enabled /\ sse_enabled /\ Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_sM)
key_ptr input_key_b 2 (va_get_mem_layout va_sM) Secret /\ Vale.X64.Decls.validDstAddrs128
(va_get_mem_heaplet 1 va_sM) key_expansion_ptr output_key_expansion_b 15 (va_get_mem_layout
va_sM) Secret) /\ (let (key_ptr:(va_int_range 0 18446744073709551615)) = (if win then
va_get_reg64 rRcx va_s0 else va_get_reg64 rRdi va_s0) in let (key_expansion_ptr:(va_int_range 0
18446744073709551615)) = (if win then va_get_reg64 rRdx va_s0 else va_get_reg64 rRsi va_s0) in
let (key:(FStar.Seq.Base.seq Vale.Def.Types_s.nat32)) = Vale.AES.AES256_helpers.make_AES256_key
(Vale.X64.Decls.buffer128_read input_key_b 0 (va_get_mem_heaplet 0 va_s0))
(Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0 va_s0)) in
Vale.X64.Decls.modifies_buffer128 output_key_expansion_b (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM) /\ (forall (j:nat) . {:pattern(buffer128_read
output_key_expansion_b j (va_get_mem_heaplet 1 va_sM))}j <= 14 ==>
Vale.X64.Decls.buffer128_read output_key_expansion_b j (va_get_mem_heaplet 1 va_sM) ==
FStar.Seq.Base.index #Vale.Def.Types_s.quad32 (Vale.AES.AES_s.key_to_round_keys_LE AES_256 key)
j)) /\ va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_reg64
rRdx va_sM (va_update_ok va_sM (va_update_mem va_sM va_s0))))))))))) | let va_lemma_KeyExpansion256Stdcall va_b0 va_s0 win input_key_b output_key_expansion_b =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_reg64 rRdx; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansion256Stdcall va_mods win input_key_b output_key_expansion_b in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansion256Stdcall win) va_qc va_s0
(fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 177 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ (let (key_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ ->
va_get_reg64 rRcx va_s0) (fun _ -> va_get_reg64 rRdi va_s0) in let
(key_expansion_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ -> va_get_reg64
rRdx va_s0) (fun _ -> va_get_reg64 rRsi va_s0) in let (key:(FStar.Seq.Base.seq
Vale.Def.Types_s.nat32)) = Vale.AES.AES256_helpers.make_AES256_key
(Vale.X64.Decls.buffer128_read input_key_b 0 (va_get_mem_heaplet 0 va_s0))
(Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0 va_s0)) in label va_range1
"***** POSTCONDITION NOT MET AT line 193 column 52 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(aesni_enabled /\ avx_enabled /\ sse_enabled) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 194 column 76 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_sM) key_ptr input_key_b 2
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 195 column 98 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) key_expansion_ptr
output_key_expansion_b 15 (va_get_mem_layout va_sM) Secret)) /\ (let (key_ptr:(va_int_range 0
18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRcx va_s0) (fun _ -> va_get_reg64
rRdi va_s0) in let (key_expansion_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _
-> va_get_reg64 rRdx va_s0) (fun _ -> va_get_reg64 rRsi va_s0) in let (key:(FStar.Seq.Base.seq
Vale.Def.Types_s.nat32)) = Vale.AES.AES256_helpers.make_AES256_key
(Vale.X64.Decls.buffer128_read input_key_b 0 (va_get_mem_heaplet 0 va_s0))
(Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0 va_s0)) in label va_range1
"***** POSTCONDITION NOT MET AT line 197 column 70 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer128 output_key_expansion_b (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 199 column 109 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(forall (j:nat) . {:pattern(buffer128_read output_key_expansion_b j (va_get_mem_heaplet 1
va_sM))}j <= 14 ==> Vale.X64.Decls.buffer128_read output_key_expansion_b j (va_get_mem_heaplet
1 va_sM) == FStar.Seq.Base.index #Vale.Def.Types_s.quad32 (Vale.AES.AES_s.key_to_round_keys_LE
AES_256 key) j))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_reg64 rRdx; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM) | {
"file_name": "obj/Vale.AES.X64.AES256.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 638,
"start_col": 0,
"start_line": 599
} | module Vale.AES.X64.AES256
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsVector
open Vale.X64.InsAes
open Vale.X64.QuickCode
open Vale.X64.QuickCodes
open Vale.Arch.Types
open Vale.AES.AES256_helpers
open Vale.X64.CPU_Features_s
#reset-options "--z3rlimit 20"
//-- KeyExpansionRoundEven256
val va_code_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansionRoundEven256 round rcon =
(va_Block (va_CCons (va_code_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon)
(va_CCons (va_code_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_CCons (va_code_VPslldq4
(va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm
4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4)
(va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_CCons
(va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) (16 `op_Multiply`
(round + 1)) Secret) (va_CNil ()))))))))))))
val va_codegen_success_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansionRoundEven256 round rcon =
(va_pbool_and (va_codegen_success_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon)
(va_pbool_and (va_codegen_success_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) (16 `op_Multiply` (round + 1)) Secret) (va_ttrue ())))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansionRoundEven256 (va_mods:va_mods_t) (round:nat64) (rcon:nat8) (dst:buffer128)
(key:(seq nat32)) : (va_quickCode unit (va_code_KeyExpansionRoundEven256 round rcon)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 75 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 76 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 77 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 78 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 79 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 80 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 81 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 82 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 83 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 84 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) (16 `op_Multiply` (round + 1)) Secret dst (round + 1)) (fun (va_s:va_state) _
-> let (va_arg17:Prims.int) = round + 1 in let (va_arg16:Vale.Def.Types_s.nat32) = rcon in let
(va_arg15:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in let
(va_arg14:Vale.Def.Types_s.quad32) = va_get_xmm 1 va_old_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 87 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_simd_round_key va_arg14 va_arg15 va_arg16
va_arg17) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 88 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QEmpty (())))))))))))))))
val va_lemma_KeyExpansionRoundEven256 : va_b0:va_code -> va_s0:va_state -> round:nat64 -> rcon:nat8
-> dst:buffer128 -> key:(seq nat32)
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundEven256 round rcon) va_s0 /\
va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 == 0 /\ rcon ==
Vale.AES.AES_common_s.aes_rcon ((round + 1) `op_Division` 2 - 1) /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ va_get_xmm 1 va_sM == Vale.X64.Decls.buffer128_read dst
(round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 1 va_sM ==
Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) /\ va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4
va_sM (va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM
(va_update_ok va_sM (va_update_mem va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansionRoundEven256 va_b0 va_s0 round rcon dst key =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansionRoundEven256 va_mods round rcon dst key in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansionRoundEven256 round rcon)
va_qc va_s0 (fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 50 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 61 column 65 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 71 column 54 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 1 va_sM == Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1
va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 72 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 1 va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 73 column 82 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM) (round + 1) (round + 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundEven256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32))
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 == 0 /\ rcon ==
Vale.AES.AES_common_s.aes_rcon ((round + 1) `op_Division` 2 - 1) /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round /\ (forall (va_x_mem:vale_heap)
(va_x_heap1:vale_heap) (va_x_xmm1:quad32) (va_x_xmm2:quad32) (va_x_xmm4:quad32)
(va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags va_x_efl (va_upd_xmm 4 va_x_xmm4
(va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 1 va_x_xmm1 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem
va_x_mem va_s0))))) in va_get_ok va_sM /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1
va_sM) (va_get_reg64 rRdx va_sM) dst 15 (va_get_mem_layout va_sM) Secret /\ va_get_xmm 1 va_sM
== Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 1
va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> dst:buffer128 -> key:(seq
nat32) -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundEven256 round rcon dst key va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundEven256 round rcon)
([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem])
va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundEven256 round rcon dst key va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundEven256 (va_code_KeyExpansionRoundEven256 round
rcon) va_s0 round rcon dst key in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 2 va_sM
(va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundEven256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32)) :
(va_quickCode unit (va_code_KeyExpansionRoundEven256 round rcon)) =
(va_QProc (va_code_KeyExpansionRoundEven256 round rcon) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm
2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem]) (va_wp_KeyExpansionRoundEven256 round rcon
dst key) (va_wpProof_KeyExpansionRoundEven256 round rcon dst key))
//--
//-- KeyExpansionRoundOdd256
val va_code_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansionRoundOdd256 round rcon =
(va_Block (va_CCons (va_code_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0) (va_CCons
(va_code_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_CCons (va_code_VPslldq4
(va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm
4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4)
(va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_CCons
(va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 3) (16 `op_Multiply`
(round + 1)) Secret) (va_CNil ()))))))))))))
val va_codegen_success_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansionRoundOdd256 round rcon =
(va_pbool_and (va_codegen_success_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0)
(va_pbool_and (va_codegen_success_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) (16 `op_Multiply` (round + 1)) Secret) (va_ttrue ())))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansionRoundOdd256 (va_mods:va_mods_t) (round:nat64) (rcon:nat8) (dst:buffer128)
(key:(seq nat32)) : (va_quickCode unit (va_code_KeyExpansionRoundOdd256 round rcon)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 118 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 119 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 120 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 121 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 122 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 123 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 124 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 125 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 126 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 127 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) (16 `op_Multiply` (round + 1)) Secret dst (round + 1)) (fun (va_s:va_state) _
-> let (va_arg20:Prims.int) = round + 1 in let (va_arg19:Vale.Def.Types_s.quad32) = va_get_xmm
1 va_old_s in let (va_arg18:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 130 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_simd_round_key va_arg18 va_arg19 0 va_arg20)
(let (va_arg17:Prims.int) = round + 1 in let (va_arg16:Vale.Def.Types_s.quad32) = va_get_xmm 1
va_old_s in let (va_arg15:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 131 column 33 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_round_key_256_rcon_odd va_arg15 va_arg16 0
va_arg17) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 132 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QEmpty
(()))))))))))))))))
val va_lemma_KeyExpansionRoundOdd256 : va_b0:va_code -> va_s0:va_state -> round:nat64 -> rcon:nat8
-> dst:buffer128 -> key:(seq nat32)
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundOdd256 round rcon) va_s0 /\ va_get_ok
va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64 rRdx va_s0)
dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\ sse_enabled) /\ (1
<= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 =!= 0 /\ Vale.AES.AES_s.is_aes_key_LE
AES_256 key /\ va_get_xmm 3 va_s0 == Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\
va_get_xmm 1 va_s0 == Vale.AES.AES256_helpers.expand_key_256 key round))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ va_get_xmm 3 va_sM == Vale.X64.Decls.buffer128_read dst
(round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 3 va_sM ==
Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) /\ va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4
va_sM (va_update_xmm 3 va_sM (va_update_xmm 2 va_sM (va_update_mem_heaplet 1 va_sM
(va_update_ok va_sM (va_update_mem va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansionRoundOdd256 va_b0 va_s0 round rcon dst key =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2;
va_Mod_mem_heaplet 1; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansionRoundOdd256 va_mods round rcon dst key in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansionRoundOdd256 round rcon)
va_qc va_s0 (fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 93 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 104 column 65 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 114 column 54 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 3 va_sM == Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1
va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 115 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 3 va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 116 column 82 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM) (round + 1) (round + 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet
1; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundOdd256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32))
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 =!= 0 /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round /\ (forall (va_x_mem:vale_heap)
(va_x_heap1:vale_heap) (va_x_xmm2:quad32) (va_x_xmm3:quad32) (va_x_xmm4:quad32)
(va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags va_x_efl (va_upd_xmm 4 va_x_xmm4
(va_upd_xmm 3 va_x_xmm3 (va_upd_xmm 2 va_x_xmm2 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem
va_x_mem va_s0))))) in va_get_ok va_sM /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1
va_sM) (va_get_reg64 rRdx va_sM) dst 15 (va_get_mem_layout va_sM) Secret /\ va_get_xmm 3 va_sM
== Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 3
va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> dst:buffer128 -> key:(seq
nat32) -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundOdd256 round rcon dst key va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundOdd256 round rcon)
([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet 1; va_Mod_mem])
va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundOdd256 round rcon dst key va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundOdd256 (va_code_KeyExpansionRoundOdd256 round
rcon) va_s0 round rcon dst key in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet
1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundOdd256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32)) :
(va_quickCode unit (va_code_KeyExpansionRoundOdd256 round rcon)) =
(va_QProc (va_code_KeyExpansionRoundOdd256 round rcon) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm
3; va_Mod_xmm 2; va_Mod_mem_heaplet 1; va_Mod_mem]) (va_wp_KeyExpansionRoundOdd256 round rcon
dst key) (va_wpProof_KeyExpansionRoundOdd256 round rcon dst key))
//--
//-- KeyExpansionRoundUnrolledRecursive256
val va_code_KeyExpansionRoundUnrolledRecursive256 : n:int -> Tot va_code(decreases %[n])
[@ "opaque_to_smt"]
let rec va_code_KeyExpansionRoundUnrolledRecursive256 n =
(va_Block (va_CCons (if (1 < n && n <= 14) then va_Block (va_CCons
(va_code_KeyExpansionRoundUnrolledRecursive256 (n - 1)) (va_CCons (if (n `op_Modulus` 2 = 0)
then va_Block (va_CCons (va_code_KeyExpansionRoundEven256 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1))) (va_CNil ())) else va_Block (va_CCons
(va_code_KeyExpansionRoundOdd256 (n - 1) (Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 -
1))) (va_CNil ()))) (va_CNil ()))) else va_Block (va_CNil ())) (va_CNil ())))
val va_codegen_success_KeyExpansionRoundUnrolledRecursive256 : n:int -> Tot va_pbool(decreases %[n])
[@ "opaque_to_smt"]
let rec va_codegen_success_KeyExpansionRoundUnrolledRecursive256 n =
(va_pbool_and (if (1 < n && n <= 14) then va_pbool_and
(va_codegen_success_KeyExpansionRoundUnrolledRecursive256 (n - 1)) (va_pbool_and (if (n
`op_Modulus` 2 = 0) then va_pbool_and (va_codegen_success_KeyExpansionRoundEven256 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1))) (va_ttrue ()) else va_pbool_and
(va_codegen_success_KeyExpansionRoundOdd256 (n - 1) (Vale.AES.AES_common_s.aes_rcon (n
`op_Division` 2 - 1))) (va_ttrue ())) (va_ttrue ())) else va_ttrue ()) (va_ttrue ()))
val va_lemma_KeyExpansionRoundUnrolledRecursive256 : va_b0:va_code -> va_s0:va_state -> key:(seq
nat32) -> dst:buffer128 -> n:int
-> Ghost (va_state & va_fuel)(decreases %[n])
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundUnrolledRecursive256 n) va_s0 /\
va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (0 < n /\ n <= 14) /\ Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1
va_s0 == Vale.AES.AES256_helpers.expand_key_256 key 0 /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key 1 /\ va_get_xmm 1 va_s0 ==
Vale.X64.Decls.buffer128_read dst 0 (va_get_mem_heaplet 1 va_s0) /\ va_get_xmm 3 va_s0 ==
Vale.X64.Decls.buffer128_read dst 1 (va_get_mem_heaplet 1 va_s0) /\ va_get_reg64 rRdx va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 dst (va_get_mem_heaplet 1 va_s0)))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ Vale.X64.Decls.modifies_buffer128 dst (va_get_mem_heaplet 1
va_s0) (va_get_mem_heaplet 1 va_sM) /\ Vale.X64.Decls.buffer128_read dst n (va_get_mem_heaplet
1 va_sM) == (if (n `op_Modulus` 2 = 0) then va_get_xmm 1 va_sM else va_get_xmm 3 va_sM) /\
Vale.X64.Decls.buffer128_read dst (n - 1) (va_get_mem_heaplet 1 va_sM) == (if ((n - 1)
`op_Modulus` 2 = 0) then va_get_xmm 1 va_sM else va_get_xmm 3 va_sM) /\ (forall j .
{:pattern(buffer128_read dst j (va_get_mem_heaplet 1 va_sM))}0 <= j /\ j <= n ==>
Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_sM) ==
Vale.AES.AES256_helpers.expand_key_256 key j) /\ va_state_eq va_sM (va_update_flags va_sM
(va_update_xmm 4 va_sM (va_update_xmm 3 va_sM (va_update_xmm 2 va_sM (va_update_xmm 1 va_sM
(va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM va_s0))))))))))
[@"opaque_to_smt"]
let rec va_lemma_KeyExpansionRoundUnrolledRecursive256 va_b0 va_s0 key dst n =
va_reveal_opaque (`%va_code_KeyExpansionRoundUnrolledRecursive256)
(va_code_KeyExpansionRoundUnrolledRecursive256 n);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
let va_b2 = va_tl va_b1 in
let va_c2 = va_hd va_b1 in
let (va_fc2, va_s2) =
(
if (1 < n && n <= 14) then
(
let va_b3 = va_get_block va_c2 in
let (va_s4, va_fc4) = va_lemma_KeyExpansionRoundUnrolledRecursive256 (va_hd va_b3) va_s0 key
dst (n - 1) in
let va_b4 = va_tl va_b3 in
let (old_mem:vale_heap) = va_get_mem_heaplet 1 va_s4 in
let va_b6 = va_tl va_b4 in
let va_c6 = va_hd va_b4 in
let (va_fc6, va_s6) =
(
if (n `op_Modulus` 2 = 0) then
(
let va_b7 = va_get_block va_c6 in
let (va_s8, va_fc8) = va_lemma_KeyExpansionRoundEven256 (va_hd va_b7) va_s4 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1)) dst key in
let va_b8 = va_tl va_b7 in
let (va_s6, va_f8) = va_lemma_empty_total va_s8 va_b8 in
let va_fc6 = va_lemma_merge_total va_b7 va_s4 va_fc8 va_s8 va_f8 va_s6 in
(va_fc6, va_s6)
)
else
(
let va_b9 = va_get_block va_c6 in
let (va_s10, va_fc10) = va_lemma_KeyExpansionRoundOdd256 (va_hd va_b9) va_s4 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1)) dst key in
let va_b10 = va_tl va_b9 in
let (va_s6, va_f10) = va_lemma_empty_total va_s10 va_b10 in
let va_fc6 = va_lemma_merge_total va_b9 va_s4 va_fc10 va_s10 va_f10 va_s6 in
(va_fc6, va_s6)
)
) in
assert (forall j . {:pattern(buffer128_read dst j (va_get_mem_heaplet 1 va_s6))}0 <= j /\ j <
n ==> Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_s6) ==
Vale.X64.Decls.buffer128_read dst j old_mem);
let (va_s2, va_f6) = va_lemma_empty_total va_s6 va_b6 in
let va_f4 = va_lemma_merge_total va_b4 va_s4 va_fc6 va_s6 va_f6 va_s2 in
let va_fc2 = va_lemma_merge_total va_b3 va_s0 va_fc4 va_s4 va_f4 va_s2 in
(va_fc2, va_s2)
)
else
(
let va_b12 = va_get_block va_c2 in
let (va_s2, va_fc2) = va_lemma_empty_total va_s0 va_b12 in
(va_fc2, va_s2)
)
) in
let (va_sM, va_f2) = va_lemma_empty_total va_s2 va_b2 in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc2 va_s2 va_f2 va_sM in
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundUnrolledRecursive256 (key:(seq nat32)) (dst:buffer128) (n:int)
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (0 < n /\ n <= 14) /\ Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1
va_s0 == Vale.AES.AES256_helpers.expand_key_256 key 0 /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key 1 /\ va_get_xmm 1 va_s0 ==
Vale.X64.Decls.buffer128_read dst 0 (va_get_mem_heaplet 1 va_s0) /\ va_get_xmm 3 va_s0 ==
Vale.X64.Decls.buffer128_read dst 1 (va_get_mem_heaplet 1 va_s0) /\ va_get_reg64 rRdx va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 dst (va_get_mem_heaplet 1 va_s0) /\
(forall (va_x_mem:vale_heap) (va_x_heap1:vale_heap) (va_x_xmm1:quad32) (va_x_xmm2:quad32)
(va_x_xmm3:quad32) (va_x_xmm4:quad32) (va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags
va_x_efl (va_upd_xmm 4 va_x_xmm4 (va_upd_xmm 3 va_x_xmm3 (va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 1
va_x_xmm1 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem va_x_mem va_s0)))))) in va_get_ok va_sM
/\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst
15 (va_get_mem_layout va_sM) Secret /\ Vale.X64.Decls.modifies_buffer128 dst
(va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet 1 va_sM) /\ Vale.X64.Decls.buffer128_read dst
n (va_get_mem_heaplet 1 va_sM) == va_if (n `op_Modulus` 2 = 0) (fun _ -> va_get_xmm 1 va_sM)
(fun _ -> va_get_xmm 3 va_sM) /\ Vale.X64.Decls.buffer128_read dst (n - 1) (va_get_mem_heaplet
1 va_sM) == va_if ((n - 1) `op_Modulus` 2 = 0) (fun _ -> va_get_xmm 1 va_sM) (fun _ ->
va_get_xmm 3 va_sM) /\ (forall j . {:pattern(buffer128_read dst j (va_get_mem_heaplet 1
va_sM))}0 <= j /\ j <= n ==> Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_sM)
== Vale.AES.AES256_helpers.expand_key_256 key j) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundUnrolledRecursive256 : key:(seq nat32) -> dst:buffer128 -> n:int ->
va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundUnrolledRecursive256 key dst n va_s0
va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundUnrolledRecursive256
n) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_mem]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundUnrolledRecursive256 key dst n va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundUnrolledRecursive256
(va_code_KeyExpansionRoundUnrolledRecursive256 n) va_s0 key dst n in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok
va_sM (va_update_mem va_sM va_s0)))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundUnrolledRecursive256 (key:(seq nat32)) (dst:buffer128) (n:int) :
(va_quickCode unit (va_code_KeyExpansionRoundUnrolledRecursive256 n)) =
(va_QProc (va_code_KeyExpansionRoundUnrolledRecursive256 n) ([va_Mod_flags; va_Mod_xmm 4;
va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem])
(va_wp_KeyExpansionRoundUnrolledRecursive256 key dst n)
(va_wpProof_KeyExpansionRoundUnrolledRecursive256 key dst n))
//--
//-- KeyExpansion256Stdcall
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansion256Stdcall win =
(va_Block (va_CCons (if win then va_Block (va_CCons (va_code_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64 rRcx) 0 Secret)
(va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3)
(va_op_reg_opr64_reg64 rRcx) 16 Secret) (va_CNil ()))) else va_Block (va_CCons
(va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64
rRdi) 0 Secret) (va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm
3) (va_op_reg_opr64_reg64 rRdi) 16 Secret) (va_CCons (va_code_Mov64 (va_op_dst_opr64_reg64
rRdx) (va_op_opr64_reg64 rRsi)) (va_CNil ()))))) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) 0 Secret)
(va_CCons (va_code_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) 16 Secret) (va_CCons (va_code_KeyExpansionRoundUnrolledRecursive256 14)
(va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm
3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 4) (va_op_xmm_xmm 4)) (va_CNil ()))))))))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansion256Stdcall win =
(va_pbool_and (if win then va_pbool_and (va_codegen_success_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64 rRcx) 0 Secret)
(va_pbool_and (va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm
3) (va_op_reg_opr64_reg64 rRcx) 16 Secret) (va_ttrue ())) else va_pbool_and
(va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1)
(va_op_reg_opr64_reg64 rRdi) 0 Secret) (va_pbool_and (va_codegen_success_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3) (va_op_reg_opr64_reg64 rRdi) 16 Secret)
(va_pbool_and (va_codegen_success_Mov64 (va_op_dst_opr64_reg64 rRdx) (va_op_opr64_reg64 rRsi))
(va_ttrue ())))) (va_pbool_and (va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet
1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) 0 Secret) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) 16 Secret) (va_pbool_and
(va_codegen_success_KeyExpansionRoundUnrolledRecursive256 14) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 4) (va_op_xmm_xmm 4)) (va_ttrue ())))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansion256Stdcall (va_mods:va_mods_t) (win:bool) (input_key_b:buffer128)
(output_key_expansion_b:buffer128) : (va_quickCode unit (va_code_KeyExpansion256Stdcall win)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(key_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRcx va_s)
(fun _ -> va_get_reg64 rRdi va_s) in let (key_expansion_ptr:(va_int_range 0
18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRdx va_s) (fun _ -> va_get_reg64
rRsi va_s) in let (key:(FStar.Seq.Base.seq Vale.Def.Types_s.nat32)) =
Vale.AES.AES256_helpers.make_AES256_key (Vale.X64.Decls.buffer128_read input_key_b 0
(va_get_mem_heaplet 0 va_s)) (Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0
va_s)) in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 201 column 15 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_qInlineIf va_mods win (qblock va_mods (fun (va_s:va_state) -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 203 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64
rRcx) 0 Secret input_key_b 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 204 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3) (va_op_reg_opr64_reg64
rRcx) 16 Secret input_key_b 1) (va_QEmpty (()))))) (qblock va_mods (fun (va_s:va_state) ->
va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 208 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64
rRdi) 0 Secret input_key_b 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 209 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3) (va_op_reg_opr64_reg64
rRdi) 16 Secret input_key_b 1) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 210 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Mov64 (va_op_dst_opr64_reg64 rRdx) (va_op_opr64_reg64 rRsi)) (va_QEmpty (())))))))
(fun (va_s:va_state) va_g -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 213 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) 0 Secret output_key_expansion_b 0) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 214 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) 16 Secret output_key_expansion_b 1) (fun (va_s:va_state) _ -> va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 216 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 217 column 42 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_KeyExpansionRoundUnrolledRecursive256 key output_key_expansion_b 14) (fun
(va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 218 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_expand_key_256 key 15) (va_QLemma va_range1
"***** PRECONDITION NOT MET AT line 219 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
true (fun _ -> va_reveal_eq (`%key_to_round_keys_LE) key_to_round_keys_LE key_to_round_keys_LE)
(fun _ -> va_reveal_opaque (`%key_to_round_keys_LE) key_to_round_keys_LE) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 222 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 223 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 224 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 225 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 4) (va_op_xmm_xmm 4)) (va_QEmpty (())))))))))))))) | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsVector.fsti.checked",
"Vale.X64.InsMem.fsti.checked",
"Vale.X64.InsBasic.fsti.checked",
"Vale.X64.InsAes.fsti.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.AES_s.fst.checked",
"Vale.AES.AES_common_s.fst.checked",
"Vale.AES.AES256_helpers.fsti.checked",
"prims.fst.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Vale.AES.X64.AES256.fst"
} | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES256_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsAes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES256_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsAes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 20,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
win: Prims.bool ->
input_key_b: Vale.X64.Memory.buffer128 ->
output_key_expansion_b: Vale.X64.Memory.buffer128
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Prims.bool",
"Vale.X64.Memory.buffer128",
"Vale.X64.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_Mod_xmm",
"Vale.X64.QuickCode.va_Mod_mem_heaplet",
"Vale.X64.QuickCode.va_Mod_reg64",
"Vale.X64.Machine_s.rRdx",
"Vale.X64.QuickCode.va_Mod_ok",
"Vale.X64.QuickCode.va_Mod_mem",
"Prims.Nil",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"Prims.list",
"Vale.X64.QuickCode.__proj__QProc__item__mods",
"Vale.AES.X64.AES256.va_code_KeyExpansion256Stdcall",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.tuple3",
"Vale.X64.State.vale_state",
"Vale.X64.QuickCodes.va_wp_sound_code_norm",
"Prims.l_and",
"Vale.X64.QuickCodes.label",
"Vale.X64.QuickCodes.va_range1",
"Prims.b2t",
"Vale.X64.Decls.va_get_ok",
"Vale.X64.CPU_Features_s.aesni_enabled",
"Vale.X64.CPU_Features_s.avx_enabled",
"Vale.X64.CPU_Features_s.sse_enabled",
"Vale.X64.Decls.validSrcAddrs128",
"Vale.X64.Decls.va_get_mem_heaplet",
"Vale.X64.Decls.va_get_mem_layout",
"Vale.Arch.HeapTypes_s.Secret",
"Vale.X64.Decls.validDstAddrs128",
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat32",
"Vale.AES.AES256_helpers.make_AES256_key",
"Vale.X64.Decls.buffer128_read",
"Vale.X64.Decls.va_int_range",
"Vale.X64.Decls.va_if",
"Vale.Def.Types_s.nat64",
"Vale.X64.Decls.va_get_reg64",
"Prims.l_not",
"Vale.X64.Machine_s.rRsi",
"Vale.X64.Machine_s.rRcx",
"Vale.X64.Machine_s.rRdi",
"Vale.X64.Decls.modifies_buffer128",
"Prims.l_Forall",
"Prims.nat",
"Prims.l_imp",
"Prims.op_LessThanOrEqual",
"Vale.Def.Types_s.quad32",
"FStar.Seq.Base.index",
"Vale.AES.AES_s.key_to_round_keys_LE",
"Vale.AES.AES_common_s.AES_256",
"Vale.X64.QuickCode.quickCode",
"Vale.AES.X64.AES256.va_qcode_KeyExpansion256Stdcall"
] | [] | false | false | false | false | false | let va_lemma_KeyExpansion256Stdcall va_b0 va_s0 win input_key_b output_key_expansion_b =
| let va_mods:va_mods_t =
[
va_Mod_flags;
va_Mod_xmm 4;
va_Mod_xmm 3;
va_Mod_xmm 2;
va_Mod_xmm 1;
va_Mod_mem_heaplet 1;
va_Mod_reg64 rRdx;
va_Mod_ok;
va_Mod_mem
]
in
let va_qc = va_qcode_KeyExpansion256Stdcall va_mods win input_key_b output_key_expansion_b in
let va_sM, va_fM, va_g =
va_wp_sound_code_norm (va_code_KeyExpansion256Stdcall win)
va_qc
va_s0
(fun va_s0 va_sM va_g ->
let () = va_g in
label va_range1
"***** POSTCONDITION NOT MET AT line 177 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\
(let key_ptr:(va_int_range 0 18446744073709551615) =
va_if win (fun _ -> va_get_reg64 rRcx va_s0) (fun _ -> va_get_reg64 rRdi va_s0)
in
let key_expansion_ptr:(va_int_range 0 18446744073709551615) =
va_if win (fun _ -> va_get_reg64 rRdx va_s0) (fun _ -> va_get_reg64 rRsi va_s0)
in
let key:(FStar.Seq.Base.seq Vale.Def.Types_s.nat32) =
Vale.AES.AES256_helpers.make_AES256_key (Vale.X64.Decls.buffer128_read input_key_b
0
(va_get_mem_heaplet 0 va_s0))
(Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0 va_s0))
in
label va_range1
"***** POSTCONDITION NOT MET AT line 193 column 52 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(aesni_enabled /\ avx_enabled /\ sse_enabled) /\
label va_range1
"***** POSTCONDITION NOT MET AT line 194 column 76 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_sM)
key_ptr
input_key_b
2
(va_get_mem_layout va_sM)
Secret) /\
label va_range1
"***** POSTCONDITION NOT MET AT line 195 column 98 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM)
key_expansion_ptr
output_key_expansion_b
15
(va_get_mem_layout va_sM)
Secret)) /\
(let key_ptr:(va_int_range 0 18446744073709551615) =
va_if win (fun _ -> va_get_reg64 rRcx va_s0) (fun _ -> va_get_reg64 rRdi va_s0)
in
let key_expansion_ptr:(va_int_range 0 18446744073709551615) =
va_if win (fun _ -> va_get_reg64 rRdx va_s0) (fun _ -> va_get_reg64 rRsi va_s0)
in
let key:(FStar.Seq.Base.seq Vale.Def.Types_s.nat32) =
Vale.AES.AES256_helpers.make_AES256_key (Vale.X64.Decls.buffer128_read input_key_b
0
(va_get_mem_heaplet 0 va_s0))
(Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0 va_s0))
in
label va_range1
"***** POSTCONDITION NOT MET AT line 197 column 70 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer128 output_key_expansion_b
(va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM)) /\
label va_range1
"***** POSTCONDITION NOT MET AT line 199 column 109 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(forall (j: nat).
{:pattern (buffer128_read output_key_expansion_b j (va_get_mem_heaplet 1 va_sM))}
j <= 14 ==>
Vale.X64.Decls.buffer128_read output_key_expansion_b j (va_get_mem_heaplet 1 va_sM) ==
FStar.Seq.Base.index #Vale.Def.Types_s.quad32
(Vale.AES.AES_s.key_to_round_keys_LE AES_256 key)
j)))
in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([
va_Mod_flags;
va_Mod_xmm 4;
va_Mod_xmm 3;
va_Mod_xmm 2;
va_Mod_xmm 1;
va_Mod_mem_heaplet 1;
va_Mod_reg64 rRdx;
va_Mod_ok;
va_Mod_mem
])
va_sM
va_s0;
(va_sM, va_fM) | false |
Vale.AES.X64.AES256.fst | Vale.AES.X64.AES256.va_wpProof_AES256EncryptBlock | val va_wpProof_AES256EncryptBlock : input:quad32 -> key:(seq nat32) -> round_keys:(seq quad32) ->
keys_buffer:buffer128 -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AES256EncryptBlock input key round_keys keys_buffer va_s0
va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AES256EncryptBlock ()) ([va_Mod_flags;
va_Mod_xmm 2; va_Mod_xmm 0]) va_s0 va_k ((va_sM, va_f0, va_g)))) | val va_wpProof_AES256EncryptBlock : input:quad32 -> key:(seq nat32) -> round_keys:(seq quad32) ->
keys_buffer:buffer128 -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AES256EncryptBlock input key round_keys keys_buffer va_s0
va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AES256EncryptBlock ()) ([va_Mod_flags;
va_Mod_xmm 2; va_Mod_xmm 0]) va_s0 va_k ((va_sM, va_f0, va_g)))) | let va_wpProof_AES256EncryptBlock input key round_keys keys_buffer va_s0 va_k =
let (va_sM, va_f0) = va_lemma_AES256EncryptBlock (va_code_AES256EncryptBlock ()) va_s0 input key
round_keys keys_buffer in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 2 va_sM (va_update_xmm 0 va_sM
(va_update_ok va_sM va_s0)))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g) | {
"file_name": "obj/Vale.AES.X64.AES256.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 871,
"start_col": 0,
"start_line": 863
} | module Vale.AES.X64.AES256
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsVector
open Vale.X64.InsAes
open Vale.X64.QuickCode
open Vale.X64.QuickCodes
open Vale.Arch.Types
open Vale.AES.AES256_helpers
open Vale.X64.CPU_Features_s
#reset-options "--z3rlimit 20"
//-- KeyExpansionRoundEven256
val va_code_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansionRoundEven256 round rcon =
(va_Block (va_CCons (va_code_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon)
(va_CCons (va_code_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_CCons (va_code_VPslldq4
(va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm
4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4)
(va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_CCons
(va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) (16 `op_Multiply`
(round + 1)) Secret) (va_CNil ()))))))))))))
val va_codegen_success_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansionRoundEven256 round rcon =
(va_pbool_and (va_codegen_success_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon)
(va_pbool_and (va_codegen_success_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) (16 `op_Multiply` (round + 1)) Secret) (va_ttrue ())))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansionRoundEven256 (va_mods:va_mods_t) (round:nat64) (rcon:nat8) (dst:buffer128)
(key:(seq nat32)) : (va_quickCode unit (va_code_KeyExpansionRoundEven256 round rcon)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 75 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 76 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 77 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 78 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 79 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 80 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 81 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 82 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 83 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 84 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) (16 `op_Multiply` (round + 1)) Secret dst (round + 1)) (fun (va_s:va_state) _
-> let (va_arg17:Prims.int) = round + 1 in let (va_arg16:Vale.Def.Types_s.nat32) = rcon in let
(va_arg15:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in let
(va_arg14:Vale.Def.Types_s.quad32) = va_get_xmm 1 va_old_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 87 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_simd_round_key va_arg14 va_arg15 va_arg16
va_arg17) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 88 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QEmpty (())))))))))))))))
val va_lemma_KeyExpansionRoundEven256 : va_b0:va_code -> va_s0:va_state -> round:nat64 -> rcon:nat8
-> dst:buffer128 -> key:(seq nat32)
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundEven256 round rcon) va_s0 /\
va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 == 0 /\ rcon ==
Vale.AES.AES_common_s.aes_rcon ((round + 1) `op_Division` 2 - 1) /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ va_get_xmm 1 va_sM == Vale.X64.Decls.buffer128_read dst
(round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 1 va_sM ==
Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) /\ va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4
va_sM (va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM
(va_update_ok va_sM (va_update_mem va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansionRoundEven256 va_b0 va_s0 round rcon dst key =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansionRoundEven256 va_mods round rcon dst key in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansionRoundEven256 round rcon)
va_qc va_s0 (fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 50 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 61 column 65 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 71 column 54 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 1 va_sM == Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1
va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 72 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 1 va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 73 column 82 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM) (round + 1) (round + 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundEven256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32))
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 == 0 /\ rcon ==
Vale.AES.AES_common_s.aes_rcon ((round + 1) `op_Division` 2 - 1) /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round /\ (forall (va_x_mem:vale_heap)
(va_x_heap1:vale_heap) (va_x_xmm1:quad32) (va_x_xmm2:quad32) (va_x_xmm4:quad32)
(va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags va_x_efl (va_upd_xmm 4 va_x_xmm4
(va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 1 va_x_xmm1 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem
va_x_mem va_s0))))) in va_get_ok va_sM /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1
va_sM) (va_get_reg64 rRdx va_sM) dst 15 (va_get_mem_layout va_sM) Secret /\ va_get_xmm 1 va_sM
== Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 1
va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> dst:buffer128 -> key:(seq
nat32) -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundEven256 round rcon dst key va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundEven256 round rcon)
([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem])
va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundEven256 round rcon dst key va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundEven256 (va_code_KeyExpansionRoundEven256 round
rcon) va_s0 round rcon dst key in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 2 va_sM
(va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundEven256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32)) :
(va_quickCode unit (va_code_KeyExpansionRoundEven256 round rcon)) =
(va_QProc (va_code_KeyExpansionRoundEven256 round rcon) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm
2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem]) (va_wp_KeyExpansionRoundEven256 round rcon
dst key) (va_wpProof_KeyExpansionRoundEven256 round rcon dst key))
//--
//-- KeyExpansionRoundOdd256
val va_code_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansionRoundOdd256 round rcon =
(va_Block (va_CCons (va_code_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0) (va_CCons
(va_code_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_CCons (va_code_VPslldq4
(va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm
4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4)
(va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_CCons
(va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 3) (16 `op_Multiply`
(round + 1)) Secret) (va_CNil ()))))))))))))
val va_codegen_success_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansionRoundOdd256 round rcon =
(va_pbool_and (va_codegen_success_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0)
(va_pbool_and (va_codegen_success_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) (16 `op_Multiply` (round + 1)) Secret) (va_ttrue ())))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansionRoundOdd256 (va_mods:va_mods_t) (round:nat64) (rcon:nat8) (dst:buffer128)
(key:(seq nat32)) : (va_quickCode unit (va_code_KeyExpansionRoundOdd256 round rcon)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 118 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 119 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 120 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 121 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 122 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 123 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 124 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 125 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 126 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 127 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) (16 `op_Multiply` (round + 1)) Secret dst (round + 1)) (fun (va_s:va_state) _
-> let (va_arg20:Prims.int) = round + 1 in let (va_arg19:Vale.Def.Types_s.quad32) = va_get_xmm
1 va_old_s in let (va_arg18:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 130 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_simd_round_key va_arg18 va_arg19 0 va_arg20)
(let (va_arg17:Prims.int) = round + 1 in let (va_arg16:Vale.Def.Types_s.quad32) = va_get_xmm 1
va_old_s in let (va_arg15:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 131 column 33 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_round_key_256_rcon_odd va_arg15 va_arg16 0
va_arg17) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 132 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QEmpty
(()))))))))))))))))
val va_lemma_KeyExpansionRoundOdd256 : va_b0:va_code -> va_s0:va_state -> round:nat64 -> rcon:nat8
-> dst:buffer128 -> key:(seq nat32)
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundOdd256 round rcon) va_s0 /\ va_get_ok
va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64 rRdx va_s0)
dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\ sse_enabled) /\ (1
<= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 =!= 0 /\ Vale.AES.AES_s.is_aes_key_LE
AES_256 key /\ va_get_xmm 3 va_s0 == Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\
va_get_xmm 1 va_s0 == Vale.AES.AES256_helpers.expand_key_256 key round))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ va_get_xmm 3 va_sM == Vale.X64.Decls.buffer128_read dst
(round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 3 va_sM ==
Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) /\ va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4
va_sM (va_update_xmm 3 va_sM (va_update_xmm 2 va_sM (va_update_mem_heaplet 1 va_sM
(va_update_ok va_sM (va_update_mem va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansionRoundOdd256 va_b0 va_s0 round rcon dst key =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2;
va_Mod_mem_heaplet 1; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansionRoundOdd256 va_mods round rcon dst key in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansionRoundOdd256 round rcon)
va_qc va_s0 (fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 93 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 104 column 65 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 114 column 54 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 3 va_sM == Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1
va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 115 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 3 va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 116 column 82 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM) (round + 1) (round + 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet
1; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundOdd256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32))
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 =!= 0 /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round /\ (forall (va_x_mem:vale_heap)
(va_x_heap1:vale_heap) (va_x_xmm2:quad32) (va_x_xmm3:quad32) (va_x_xmm4:quad32)
(va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags va_x_efl (va_upd_xmm 4 va_x_xmm4
(va_upd_xmm 3 va_x_xmm3 (va_upd_xmm 2 va_x_xmm2 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem
va_x_mem va_s0))))) in va_get_ok va_sM /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1
va_sM) (va_get_reg64 rRdx va_sM) dst 15 (va_get_mem_layout va_sM) Secret /\ va_get_xmm 3 va_sM
== Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 3
va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> dst:buffer128 -> key:(seq
nat32) -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundOdd256 round rcon dst key va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundOdd256 round rcon)
([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet 1; va_Mod_mem])
va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundOdd256 round rcon dst key va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundOdd256 (va_code_KeyExpansionRoundOdd256 round
rcon) va_s0 round rcon dst key in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet
1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundOdd256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32)) :
(va_quickCode unit (va_code_KeyExpansionRoundOdd256 round rcon)) =
(va_QProc (va_code_KeyExpansionRoundOdd256 round rcon) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm
3; va_Mod_xmm 2; va_Mod_mem_heaplet 1; va_Mod_mem]) (va_wp_KeyExpansionRoundOdd256 round rcon
dst key) (va_wpProof_KeyExpansionRoundOdd256 round rcon dst key))
//--
//-- KeyExpansionRoundUnrolledRecursive256
val va_code_KeyExpansionRoundUnrolledRecursive256 : n:int -> Tot va_code(decreases %[n])
[@ "opaque_to_smt"]
let rec va_code_KeyExpansionRoundUnrolledRecursive256 n =
(va_Block (va_CCons (if (1 < n && n <= 14) then va_Block (va_CCons
(va_code_KeyExpansionRoundUnrolledRecursive256 (n - 1)) (va_CCons (if (n `op_Modulus` 2 = 0)
then va_Block (va_CCons (va_code_KeyExpansionRoundEven256 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1))) (va_CNil ())) else va_Block (va_CCons
(va_code_KeyExpansionRoundOdd256 (n - 1) (Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 -
1))) (va_CNil ()))) (va_CNil ()))) else va_Block (va_CNil ())) (va_CNil ())))
val va_codegen_success_KeyExpansionRoundUnrolledRecursive256 : n:int -> Tot va_pbool(decreases %[n])
[@ "opaque_to_smt"]
let rec va_codegen_success_KeyExpansionRoundUnrolledRecursive256 n =
(va_pbool_and (if (1 < n && n <= 14) then va_pbool_and
(va_codegen_success_KeyExpansionRoundUnrolledRecursive256 (n - 1)) (va_pbool_and (if (n
`op_Modulus` 2 = 0) then va_pbool_and (va_codegen_success_KeyExpansionRoundEven256 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1))) (va_ttrue ()) else va_pbool_and
(va_codegen_success_KeyExpansionRoundOdd256 (n - 1) (Vale.AES.AES_common_s.aes_rcon (n
`op_Division` 2 - 1))) (va_ttrue ())) (va_ttrue ())) else va_ttrue ()) (va_ttrue ()))
val va_lemma_KeyExpansionRoundUnrolledRecursive256 : va_b0:va_code -> va_s0:va_state -> key:(seq
nat32) -> dst:buffer128 -> n:int
-> Ghost (va_state & va_fuel)(decreases %[n])
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundUnrolledRecursive256 n) va_s0 /\
va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (0 < n /\ n <= 14) /\ Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1
va_s0 == Vale.AES.AES256_helpers.expand_key_256 key 0 /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key 1 /\ va_get_xmm 1 va_s0 ==
Vale.X64.Decls.buffer128_read dst 0 (va_get_mem_heaplet 1 va_s0) /\ va_get_xmm 3 va_s0 ==
Vale.X64.Decls.buffer128_read dst 1 (va_get_mem_heaplet 1 va_s0) /\ va_get_reg64 rRdx va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 dst (va_get_mem_heaplet 1 va_s0)))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ Vale.X64.Decls.modifies_buffer128 dst (va_get_mem_heaplet 1
va_s0) (va_get_mem_heaplet 1 va_sM) /\ Vale.X64.Decls.buffer128_read dst n (va_get_mem_heaplet
1 va_sM) == (if (n `op_Modulus` 2 = 0) then va_get_xmm 1 va_sM else va_get_xmm 3 va_sM) /\
Vale.X64.Decls.buffer128_read dst (n - 1) (va_get_mem_heaplet 1 va_sM) == (if ((n - 1)
`op_Modulus` 2 = 0) then va_get_xmm 1 va_sM else va_get_xmm 3 va_sM) /\ (forall j .
{:pattern(buffer128_read dst j (va_get_mem_heaplet 1 va_sM))}0 <= j /\ j <= n ==>
Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_sM) ==
Vale.AES.AES256_helpers.expand_key_256 key j) /\ va_state_eq va_sM (va_update_flags va_sM
(va_update_xmm 4 va_sM (va_update_xmm 3 va_sM (va_update_xmm 2 va_sM (va_update_xmm 1 va_sM
(va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM va_s0))))))))))
[@"opaque_to_smt"]
let rec va_lemma_KeyExpansionRoundUnrolledRecursive256 va_b0 va_s0 key dst n =
va_reveal_opaque (`%va_code_KeyExpansionRoundUnrolledRecursive256)
(va_code_KeyExpansionRoundUnrolledRecursive256 n);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
let va_b2 = va_tl va_b1 in
let va_c2 = va_hd va_b1 in
let (va_fc2, va_s2) =
(
if (1 < n && n <= 14) then
(
let va_b3 = va_get_block va_c2 in
let (va_s4, va_fc4) = va_lemma_KeyExpansionRoundUnrolledRecursive256 (va_hd va_b3) va_s0 key
dst (n - 1) in
let va_b4 = va_tl va_b3 in
let (old_mem:vale_heap) = va_get_mem_heaplet 1 va_s4 in
let va_b6 = va_tl va_b4 in
let va_c6 = va_hd va_b4 in
let (va_fc6, va_s6) =
(
if (n `op_Modulus` 2 = 0) then
(
let va_b7 = va_get_block va_c6 in
let (va_s8, va_fc8) = va_lemma_KeyExpansionRoundEven256 (va_hd va_b7) va_s4 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1)) dst key in
let va_b8 = va_tl va_b7 in
let (va_s6, va_f8) = va_lemma_empty_total va_s8 va_b8 in
let va_fc6 = va_lemma_merge_total va_b7 va_s4 va_fc8 va_s8 va_f8 va_s6 in
(va_fc6, va_s6)
)
else
(
let va_b9 = va_get_block va_c6 in
let (va_s10, va_fc10) = va_lemma_KeyExpansionRoundOdd256 (va_hd va_b9) va_s4 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1)) dst key in
let va_b10 = va_tl va_b9 in
let (va_s6, va_f10) = va_lemma_empty_total va_s10 va_b10 in
let va_fc6 = va_lemma_merge_total va_b9 va_s4 va_fc10 va_s10 va_f10 va_s6 in
(va_fc6, va_s6)
)
) in
assert (forall j . {:pattern(buffer128_read dst j (va_get_mem_heaplet 1 va_s6))}0 <= j /\ j <
n ==> Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_s6) ==
Vale.X64.Decls.buffer128_read dst j old_mem);
let (va_s2, va_f6) = va_lemma_empty_total va_s6 va_b6 in
let va_f4 = va_lemma_merge_total va_b4 va_s4 va_fc6 va_s6 va_f6 va_s2 in
let va_fc2 = va_lemma_merge_total va_b3 va_s0 va_fc4 va_s4 va_f4 va_s2 in
(va_fc2, va_s2)
)
else
(
let va_b12 = va_get_block va_c2 in
let (va_s2, va_fc2) = va_lemma_empty_total va_s0 va_b12 in
(va_fc2, va_s2)
)
) in
let (va_sM, va_f2) = va_lemma_empty_total va_s2 va_b2 in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc2 va_s2 va_f2 va_sM in
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundUnrolledRecursive256 (key:(seq nat32)) (dst:buffer128) (n:int)
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (0 < n /\ n <= 14) /\ Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1
va_s0 == Vale.AES.AES256_helpers.expand_key_256 key 0 /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key 1 /\ va_get_xmm 1 va_s0 ==
Vale.X64.Decls.buffer128_read dst 0 (va_get_mem_heaplet 1 va_s0) /\ va_get_xmm 3 va_s0 ==
Vale.X64.Decls.buffer128_read dst 1 (va_get_mem_heaplet 1 va_s0) /\ va_get_reg64 rRdx va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 dst (va_get_mem_heaplet 1 va_s0) /\
(forall (va_x_mem:vale_heap) (va_x_heap1:vale_heap) (va_x_xmm1:quad32) (va_x_xmm2:quad32)
(va_x_xmm3:quad32) (va_x_xmm4:quad32) (va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags
va_x_efl (va_upd_xmm 4 va_x_xmm4 (va_upd_xmm 3 va_x_xmm3 (va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 1
va_x_xmm1 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem va_x_mem va_s0)))))) in va_get_ok va_sM
/\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst
15 (va_get_mem_layout va_sM) Secret /\ Vale.X64.Decls.modifies_buffer128 dst
(va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet 1 va_sM) /\ Vale.X64.Decls.buffer128_read dst
n (va_get_mem_heaplet 1 va_sM) == va_if (n `op_Modulus` 2 = 0) (fun _ -> va_get_xmm 1 va_sM)
(fun _ -> va_get_xmm 3 va_sM) /\ Vale.X64.Decls.buffer128_read dst (n - 1) (va_get_mem_heaplet
1 va_sM) == va_if ((n - 1) `op_Modulus` 2 = 0) (fun _ -> va_get_xmm 1 va_sM) (fun _ ->
va_get_xmm 3 va_sM) /\ (forall j . {:pattern(buffer128_read dst j (va_get_mem_heaplet 1
va_sM))}0 <= j /\ j <= n ==> Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_sM)
== Vale.AES.AES256_helpers.expand_key_256 key j) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundUnrolledRecursive256 : key:(seq nat32) -> dst:buffer128 -> n:int ->
va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundUnrolledRecursive256 key dst n va_s0
va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundUnrolledRecursive256
n) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_mem]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundUnrolledRecursive256 key dst n va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundUnrolledRecursive256
(va_code_KeyExpansionRoundUnrolledRecursive256 n) va_s0 key dst n in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok
va_sM (va_update_mem va_sM va_s0)))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundUnrolledRecursive256 (key:(seq nat32)) (dst:buffer128) (n:int) :
(va_quickCode unit (va_code_KeyExpansionRoundUnrolledRecursive256 n)) =
(va_QProc (va_code_KeyExpansionRoundUnrolledRecursive256 n) ([va_Mod_flags; va_Mod_xmm 4;
va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem])
(va_wp_KeyExpansionRoundUnrolledRecursive256 key dst n)
(va_wpProof_KeyExpansionRoundUnrolledRecursive256 key dst n))
//--
//-- KeyExpansion256Stdcall
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansion256Stdcall win =
(va_Block (va_CCons (if win then va_Block (va_CCons (va_code_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64 rRcx) 0 Secret)
(va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3)
(va_op_reg_opr64_reg64 rRcx) 16 Secret) (va_CNil ()))) else va_Block (va_CCons
(va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64
rRdi) 0 Secret) (va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm
3) (va_op_reg_opr64_reg64 rRdi) 16 Secret) (va_CCons (va_code_Mov64 (va_op_dst_opr64_reg64
rRdx) (va_op_opr64_reg64 rRsi)) (va_CNil ()))))) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) 0 Secret)
(va_CCons (va_code_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) 16 Secret) (va_CCons (va_code_KeyExpansionRoundUnrolledRecursive256 14)
(va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm
3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 4) (va_op_xmm_xmm 4)) (va_CNil ()))))))))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansion256Stdcall win =
(va_pbool_and (if win then va_pbool_and (va_codegen_success_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64 rRcx) 0 Secret)
(va_pbool_and (va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm
3) (va_op_reg_opr64_reg64 rRcx) 16 Secret) (va_ttrue ())) else va_pbool_and
(va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1)
(va_op_reg_opr64_reg64 rRdi) 0 Secret) (va_pbool_and (va_codegen_success_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3) (va_op_reg_opr64_reg64 rRdi) 16 Secret)
(va_pbool_and (va_codegen_success_Mov64 (va_op_dst_opr64_reg64 rRdx) (va_op_opr64_reg64 rRsi))
(va_ttrue ())))) (va_pbool_and (va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet
1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) 0 Secret) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) 16 Secret) (va_pbool_and
(va_codegen_success_KeyExpansionRoundUnrolledRecursive256 14) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 4) (va_op_xmm_xmm 4)) (va_ttrue ())))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansion256Stdcall (va_mods:va_mods_t) (win:bool) (input_key_b:buffer128)
(output_key_expansion_b:buffer128) : (va_quickCode unit (va_code_KeyExpansion256Stdcall win)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(key_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRcx va_s)
(fun _ -> va_get_reg64 rRdi va_s) in let (key_expansion_ptr:(va_int_range 0
18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRdx va_s) (fun _ -> va_get_reg64
rRsi va_s) in let (key:(FStar.Seq.Base.seq Vale.Def.Types_s.nat32)) =
Vale.AES.AES256_helpers.make_AES256_key (Vale.X64.Decls.buffer128_read input_key_b 0
(va_get_mem_heaplet 0 va_s)) (Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0
va_s)) in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 201 column 15 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_qInlineIf va_mods win (qblock va_mods (fun (va_s:va_state) -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 203 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64
rRcx) 0 Secret input_key_b 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 204 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3) (va_op_reg_opr64_reg64
rRcx) 16 Secret input_key_b 1) (va_QEmpty (()))))) (qblock va_mods (fun (va_s:va_state) ->
va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 208 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64
rRdi) 0 Secret input_key_b 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 209 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3) (va_op_reg_opr64_reg64
rRdi) 16 Secret input_key_b 1) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 210 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Mov64 (va_op_dst_opr64_reg64 rRdx) (va_op_opr64_reg64 rRsi)) (va_QEmpty (())))))))
(fun (va_s:va_state) va_g -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 213 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) 0 Secret output_key_expansion_b 0) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 214 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) 16 Secret output_key_expansion_b 1) (fun (va_s:va_state) _ -> va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 216 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 217 column 42 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_KeyExpansionRoundUnrolledRecursive256 key output_key_expansion_b 14) (fun
(va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 218 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_expand_key_256 key 15) (va_QLemma va_range1
"***** PRECONDITION NOT MET AT line 219 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
true (fun _ -> va_reveal_eq (`%key_to_round_keys_LE) key_to_round_keys_LE key_to_round_keys_LE)
(fun _ -> va_reveal_opaque (`%key_to_round_keys_LE) key_to_round_keys_LE) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 222 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 223 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 224 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 225 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 4) (va_op_xmm_xmm 4)) (va_QEmpty (()))))))))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansion256Stdcall va_b0 va_s0 win input_key_b output_key_expansion_b =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_reg64 rRdx; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansion256Stdcall va_mods win input_key_b output_key_expansion_b in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansion256Stdcall win) va_qc va_s0
(fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 177 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ (let (key_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ ->
va_get_reg64 rRcx va_s0) (fun _ -> va_get_reg64 rRdi va_s0) in let
(key_expansion_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ -> va_get_reg64
rRdx va_s0) (fun _ -> va_get_reg64 rRsi va_s0) in let (key:(FStar.Seq.Base.seq
Vale.Def.Types_s.nat32)) = Vale.AES.AES256_helpers.make_AES256_key
(Vale.X64.Decls.buffer128_read input_key_b 0 (va_get_mem_heaplet 0 va_s0))
(Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0 va_s0)) in label va_range1
"***** POSTCONDITION NOT MET AT line 193 column 52 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(aesni_enabled /\ avx_enabled /\ sse_enabled) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 194 column 76 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_sM) key_ptr input_key_b 2
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 195 column 98 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) key_expansion_ptr
output_key_expansion_b 15 (va_get_mem_layout va_sM) Secret)) /\ (let (key_ptr:(va_int_range 0
18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRcx va_s0) (fun _ -> va_get_reg64
rRdi va_s0) in let (key_expansion_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _
-> va_get_reg64 rRdx va_s0) (fun _ -> va_get_reg64 rRsi va_s0) in let (key:(FStar.Seq.Base.seq
Vale.Def.Types_s.nat32)) = Vale.AES.AES256_helpers.make_AES256_key
(Vale.X64.Decls.buffer128_read input_key_b 0 (va_get_mem_heaplet 0 va_s0))
(Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0 va_s0)) in label va_range1
"***** POSTCONDITION NOT MET AT line 197 column 70 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer128 output_key_expansion_b (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 199 column 109 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(forall (j:nat) . {:pattern(buffer128_read output_key_expansion_b j (va_get_mem_heaplet 1
va_sM))}j <= 14 ==> Vale.X64.Decls.buffer128_read output_key_expansion_b j (va_get_mem_heaplet
1 va_sM) == FStar.Seq.Base.index #Vale.Def.Types_s.quad32 (Vale.AES.AES_s.key_to_round_keys_LE
AES_256 key) j))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_reg64 rRdx; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_KeyExpansion256Stdcall win input_key_b output_key_expansion_b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansion256Stdcall (va_code_KeyExpansion256Stdcall win) va_s0
win input_key_b output_key_expansion_b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_reg64
rRdx va_sM (va_update_ok va_sM (va_update_mem va_sM va_s0))))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_reg64 rRdx; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- AES256EncryptRound
val va_code_AES256EncryptRound : n:nat -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_AES256EncryptRound n =
(va_Block (va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) (16 `op_Multiply` n) Secret) (va_CCons (va_code_AESNI_enc
(va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_CNil ()))))
val va_codegen_success_AES256EncryptRound : n:nat -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_AES256EncryptRound n =
(va_pbool_and (va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) (16 `op_Multiply` n) Secret) (va_pbool_and
(va_codegen_success_AESNI_enc (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_AES256EncryptRound (va_mods:va_mods_t) (n:nat) (init:quad32) (round_keys:(seq quad32))
(keys_buffer:buffer128) : (va_quickCode unit (va_code_AES256EncryptRound n)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(va_arg5:Vale.Def.Types_s.quad32) = va_get_xmm 0 va_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 252 column 33 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES_s.commute_sub_bytes_shift_rows va_arg5) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 253 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) (16 `op_Multiply` n) Secret keys_buffer n) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 254 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_enc (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_QEmpty (()))))))
val va_lemma_AES256EncryptRound : va_b0:va_code -> va_s0:va_state -> n:nat -> init:quad32 ->
round_keys:(seq quad32) -> keys_buffer:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AES256EncryptRound n) va_s0 /\ va_get_ok va_s0 /\
(aesni_enabled /\ sse_enabled) /\ (1 <= n /\ n < 14 /\ 14 <= FStar.Seq.Base.length #quad32
round_keys) /\ va_get_xmm 0 va_s0 == Vale.AES.AES_s.eval_rounds_def init round_keys (n - 1) /\
va_get_reg64 rR8 va_s0 == Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 keys_buffer
(va_get_mem_heaplet 0 va_s0) /\ Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0)
(va_get_reg64 rR8 va_s0) keys_buffer 15 (va_get_mem_layout va_s0) Secret /\
Vale.X64.Decls.buffer128_read keys_buffer n (va_get_mem_heaplet 0 va_s0) ==
FStar.Seq.Base.index #quad32 round_keys n))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_get_xmm 0 va_sM == Vale.AES.AES_s.eval_rounds_def init round_keys n /\ va_state_eq va_sM
(va_update_flags va_sM (va_update_xmm 2 va_sM (va_update_xmm 0 va_sM (va_update_ok va_sM
va_s0))))))
[@"opaque_to_smt"]
let va_lemma_AES256EncryptRound va_b0 va_s0 n init round_keys keys_buffer =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok] in
let va_qc = va_qcode_AES256EncryptRound va_mods n init round_keys keys_buffer in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_AES256EncryptRound n) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 232 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 250 column 53 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 0 va_sM == Vale.AES.AES_s.eval_rounds_def init round_keys n)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_AES256EncryptRound (n:nat) (init:quad32) (round_keys:(seq quad32))
(keys_buffer:buffer128) (va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ (aesni_enabled /\ sse_enabled) /\ (1 <= n /\ n < 14 /\ 14 <=
FStar.Seq.Base.length #quad32 round_keys) /\ va_get_xmm 0 va_s0 ==
Vale.AES.AES_s.eval_rounds_def init round_keys (n - 1) /\ va_get_reg64 rR8 va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 keys_buffer (va_get_mem_heaplet 0 va_s0)
/\ Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0) (va_get_reg64 rR8 va_s0)
keys_buffer 15 (va_get_mem_layout va_s0) Secret /\ Vale.X64.Decls.buffer128_read keys_buffer n
(va_get_mem_heaplet 0 va_s0) == FStar.Seq.Base.index #quad32 round_keys n /\ (forall
(va_x_xmm0:quad32) (va_x_xmm2:quad32) (va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags
va_x_efl (va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 0 va_x_xmm0 va_s0)) in va_get_ok va_sM /\
va_get_xmm 0 va_sM == Vale.AES.AES_s.eval_rounds_def init round_keys n ==> va_k va_sM (())))
val va_wpProof_AES256EncryptRound : n:nat -> init:quad32 -> round_keys:(seq quad32) ->
keys_buffer:buffer128 -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AES256EncryptRound n init round_keys keys_buffer va_s0
va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AES256EncryptRound n) ([va_Mod_flags;
va_Mod_xmm 2; va_Mod_xmm 0]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_AES256EncryptRound n init round_keys keys_buffer va_s0 va_k =
let (va_sM, va_f0) = va_lemma_AES256EncryptRound (va_code_AES256EncryptRound n) va_s0 n init
round_keys keys_buffer in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 2 va_sM (va_update_xmm 0 va_sM
(va_update_ok va_sM va_s0)))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_AES256EncryptRound (n:nat) (init:quad32) (round_keys:(seq quad32))
(keys_buffer:buffer128) : (va_quickCode unit (va_code_AES256EncryptRound n)) =
(va_QProc (va_code_AES256EncryptRound n) ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0])
(va_wp_AES256EncryptRound n init round_keys keys_buffer) (va_wpProof_AES256EncryptRound n init
round_keys keys_buffer))
//--
//-- AES256EncryptBlock
[@ "opaque_to_smt" va_qattr]
let va_code_AES256EncryptBlock () =
(va_Block (va_CCons (va_Block (va_CNil ())) (va_CCons (va_code_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64 rR8) 0 Secret) (va_CCons
(va_code_Pxor (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_CCons (va_code_AES256EncryptRound 1)
(va_CCons (va_code_AES256EncryptRound 2) (va_CCons (va_code_AES256EncryptRound 3) (va_CCons
(va_code_AES256EncryptRound 4) (va_CCons (va_code_AES256EncryptRound 5) (va_CCons
(va_code_AES256EncryptRound 6) (va_CCons (va_code_AES256EncryptRound 7) (va_CCons
(va_code_AES256EncryptRound 8) (va_CCons (va_code_AES256EncryptRound 9) (va_CCons
(va_code_AES256EncryptRound 10) (va_CCons (va_code_AES256EncryptRound 11) (va_CCons
(va_code_AES256EncryptRound 12) (va_CCons (va_code_AES256EncryptRound 13) (va_CCons
(va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) (16 `op_Multiply` 14) Secret) (va_CCons (va_code_AESNI_enc_last (va_op_xmm_xmm 0)
(va_op_xmm_xmm 2)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_CNil
())))))))))))))))))))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_AES256EncryptBlock () =
(va_pbool_and (va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) 0 Secret) (va_pbool_and (va_codegen_success_Pxor (va_op_xmm_xmm 0)
(va_op_xmm_xmm 2)) (va_pbool_and (va_codegen_success_AES256EncryptRound 1) (va_pbool_and
(va_codegen_success_AES256EncryptRound 2) (va_pbool_and (va_codegen_success_AES256EncryptRound
3) (va_pbool_and (va_codegen_success_AES256EncryptRound 4) (va_pbool_and
(va_codegen_success_AES256EncryptRound 5) (va_pbool_and (va_codegen_success_AES256EncryptRound
6) (va_pbool_and (va_codegen_success_AES256EncryptRound 7) (va_pbool_and
(va_codegen_success_AES256EncryptRound 8) (va_pbool_and (va_codegen_success_AES256EncryptRound
9) (va_pbool_and (va_codegen_success_AES256EncryptRound 10) (va_pbool_and
(va_codegen_success_AES256EncryptRound 11) (va_pbool_and (va_codegen_success_AES256EncryptRound
12) (va_pbool_and (va_codegen_success_AES256EncryptRound 13) (va_pbool_and
(va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) (16 `op_Multiply` 14) Secret) (va_pbool_and
(va_codegen_success_AESNI_enc_last (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_ttrue ())))))))))))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_AES256EncryptBlock (va_mods:va_mods_t) (input:quad32) (key:(seq nat32))
(round_keys:(seq quad32)) (keys_buffer:buffer128) : (va_quickCode unit
(va_code_AES256EncryptBlock ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_qAssertSquash
va_range1
"***** EXPRESSION PRECONDITIONS NOT MET WITHIN line 280 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
((fun a_539 (s_540:(FStar.Seq.Base.seq a_539)) (i_541:Prims.nat) -> let (i_515:Prims.nat) =
i_541 in Prims.b2t (Prims.op_LessThan i_515 (FStar.Seq.Base.length #a_539 s_540)))
Vale.Def.Types_s.quad32 round_keys 0) (fun _ -> let (init:Vale.Def.Types_s.quad32) =
Vale.Def.Types_s.quad32_xor input (FStar.Seq.Base.index #Vale.Def.Types_s.quad32 round_keys 0)
in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 282 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) 0 Secret keys_buffer 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 283 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 284 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 1 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 285 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 2 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 286 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 3 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 287 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 4 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 288 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 5 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 289 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 6 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 290 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 7 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 291 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 8 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 292 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 9 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 293 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 10 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 294 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 11 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 295 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 12 init round_keys keys_buffer) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 296 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 13 init round_keys keys_buffer) (fun (va_s:va_state) _ -> let
(va_arg24:Vale.Def.Types_s.quad32) = va_get_xmm 0 va_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 297 column 33 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES_s.commute_sub_bytes_shift_rows va_arg24) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 298 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) (16 `op_Multiply` 14) Secret keys_buffer 14) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 299 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_enc_last (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 302 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (fun (va_s:va_state) _ -> va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 303 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES_s.aes_encrypt_LE_reveal ()) (va_QEmpty (()))))))))))))))))))))))))
[@"opaque_to_smt"]
let va_lemma_AES256EncryptBlock va_b0 va_s0 input key round_keys keys_buffer =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok] in
let va_qc = va_qcode_AES256EncryptBlock va_mods input key round_keys keys_buffer in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_AES256EncryptBlock ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 257 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 278 column 52 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 0 va_sM == Vale.AES.AES_s.aes_encrypt_LE AES_256 key input)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM) | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsVector.fsti.checked",
"Vale.X64.InsMem.fsti.checked",
"Vale.X64.InsBasic.fsti.checked",
"Vale.X64.InsAes.fsti.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.AES_s.fst.checked",
"Vale.AES.AES_common_s.fst.checked",
"Vale.AES.AES256_helpers.fsti.checked",
"prims.fst.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Vale.AES.X64.AES256.fst"
} | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES256_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsAes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES256_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsAes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 20,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
input: Vale.X64.Decls.quad32 ->
key: FStar.Seq.Base.seq Vale.X64.Memory.nat32 ->
round_keys: FStar.Seq.Base.seq Vale.X64.Decls.quad32 ->
keys_buffer: Vale.X64.Memory.buffer128 ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.quad32",
"FStar.Seq.Base.seq",
"Vale.X64.Memory.nat32",
"Vale.X64.Memory.buffer128",
"Vale.X64.Decls.va_state",
"Prims.unit",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_Mod_xmm",
"Prims.Nil",
"Prims._assert",
"Vale.X64.Decls.va_state_eq",
"Vale.X64.Decls.va_update_flags",
"Vale.X64.Decls.va_update_xmm",
"Vale.X64.Decls.va_update_ok",
"Vale.X64.Decls.va_lemma_upd_update",
"FStar.Pervasives.Native.tuple3",
"FStar.Pervasives.Native.tuple2",
"Vale.X64.State.vale_state",
"Vale.AES.X64.AES256.va_lemma_AES256EncryptBlock",
"Vale.AES.X64.AES256.va_code_AES256EncryptBlock"
] | [] | false | false | false | false | false | let va_wpProof_AES256EncryptBlock input key round_keys keys_buffer va_s0 va_k =
| let va_sM, va_f0 =
va_lemma_AES256EncryptBlock (va_code_AES256EncryptBlock ()) va_s0 input key round_keys keys_buffer
in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_flags va_sM
(va_update_xmm 2 va_sM (va_update_xmm 0 va_sM (va_update_ok va_sM va_s0)))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g) | false |
Vale.AES.X64.AES256.fst | Vale.AES.X64.AES256.va_qcode_AES256EncryptBlockStdcall | val va_qcode_AES256EncryptBlockStdcall
(va_mods: va_mods_t)
(win: bool)
(input: quad32)
(key: (seq nat32))
(input_buffer output_buffer keys_buffer: buffer128)
: (va_quickCode unit (va_code_AES256EncryptBlockStdcall win)) | val va_qcode_AES256EncryptBlockStdcall
(va_mods: va_mods_t)
(win: bool)
(input: quad32)
(key: (seq nat32))
(input_buffer output_buffer keys_buffer: buffer128)
: (va_quickCode unit (va_code_AES256EncryptBlockStdcall win)) | let va_qcode_AES256EncryptBlockStdcall (va_mods:va_mods_t) (win:bool) (input:quad32) (key:(seq
nat32)) (input_buffer:buffer128) (output_buffer:buffer128) (keys_buffer:buffer128) :
(va_quickCode unit (va_code_AES256EncryptBlockStdcall win)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(output_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRcx
va_s) (fun _ -> va_get_reg64 rRdi va_s) in let (input_ptr:(va_int_range 0
18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRdx va_s) (fun _ -> va_get_reg64
rRsi va_s) in let (expanded_key_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _
-> va_get_reg64 rR8 va_s) (fun _ -> va_get_reg64 rRdx va_s) in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 338 column 15 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_qInlineIf va_mods win (qblock va_mods (fun (va_s:va_state) -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 340 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 0) (va_op_reg_opr64_reg64
rRdx) 0 Secret input_buffer 0) (va_QEmpty (())))) (qblock va_mods (fun (va_s:va_state) ->
va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 344 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 0) (va_op_reg_opr64_reg64
rRsi) 0 Secret input_buffer 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 345 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Mov64 (va_op_dst_opr64_reg64 rR8) (va_op_opr64_reg64 rRdx)) (va_QEmpty (())))))) (fun
(va_s:va_state) va_g -> va_qAssertSquash va_range1
"***** EXPRESSION PRECONDITIONS NOT MET WITHIN line 348 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
((fun (alg_10150:Vale.AES.AES_common_s.algorithm) (key_10151:(FStar.Seq.Base.seq
Vale.Def.Types_s.nat32)) -> Vale.AES.AES_s.is_aes_key_LE alg_10150 key_10151) AES_256 key) (fun
_ -> va_QBind va_range1
"***** PRECONDITION NOT MET AT line 348 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptBlock input key (Vale.AES.AES_s.key_to_round_keys_LE AES_256 key)
keys_buffer) (fun (va_s:va_state) _ -> va_QBind va_range1
"***** PRECONDITION NOT MET AT line 350 column 15 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_qInlineIf va_mods win (qblock va_mods (fun (va_s:va_state) -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 352 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRcx)
(va_op_xmm_xmm 0) 0 Secret output_buffer 0) (va_QEmpty (())))) (qblock va_mods (fun
(va_s:va_state) -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 356 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdi)
(va_op_xmm_xmm 0) 0 Secret output_buffer 0) (va_QEmpty (()))))) (fun (va_s:va_state) va_g ->
va_QEmpty (()))))))) | {
"file_name": "obj/Vale.AES.X64.AES256.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 24,
"end_line": 940,
"start_col": 0,
"start_line": 903
} | module Vale.AES.X64.AES256
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsVector
open Vale.X64.InsAes
open Vale.X64.QuickCode
open Vale.X64.QuickCodes
open Vale.Arch.Types
open Vale.AES.AES256_helpers
open Vale.X64.CPU_Features_s
#reset-options "--z3rlimit 20"
//-- KeyExpansionRoundEven256
val va_code_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansionRoundEven256 round rcon =
(va_Block (va_CCons (va_code_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon)
(va_CCons (va_code_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_CCons (va_code_VPslldq4
(va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm
4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4)
(va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_CCons
(va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) (16 `op_Multiply`
(round + 1)) Secret) (va_CNil ()))))))))))))
val va_codegen_success_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansionRoundEven256 round rcon =
(va_pbool_and (va_codegen_success_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon)
(va_pbool_and (va_codegen_success_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) (16 `op_Multiply` (round + 1)) Secret) (va_ttrue ())))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansionRoundEven256 (va_mods:va_mods_t) (round:nat64) (rcon:nat8) (dst:buffer128)
(key:(seq nat32)) : (va_quickCode unit (va_code_KeyExpansionRoundEven256 round rcon)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 75 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 76 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 77 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 78 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 79 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 80 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 81 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 82 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 83 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 84 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) (16 `op_Multiply` (round + 1)) Secret dst (round + 1)) (fun (va_s:va_state) _
-> let (va_arg17:Prims.int) = round + 1 in let (va_arg16:Vale.Def.Types_s.nat32) = rcon in let
(va_arg15:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in let
(va_arg14:Vale.Def.Types_s.quad32) = va_get_xmm 1 va_old_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 87 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_simd_round_key va_arg14 va_arg15 va_arg16
va_arg17) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 88 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QEmpty (())))))))))))))))
val va_lemma_KeyExpansionRoundEven256 : va_b0:va_code -> va_s0:va_state -> round:nat64 -> rcon:nat8
-> dst:buffer128 -> key:(seq nat32)
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundEven256 round rcon) va_s0 /\
va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 == 0 /\ rcon ==
Vale.AES.AES_common_s.aes_rcon ((round + 1) `op_Division` 2 - 1) /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ va_get_xmm 1 va_sM == Vale.X64.Decls.buffer128_read dst
(round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 1 va_sM ==
Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) /\ va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4
va_sM (va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM
(va_update_ok va_sM (va_update_mem va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansionRoundEven256 va_b0 va_s0 round rcon dst key =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansionRoundEven256 va_mods round rcon dst key in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansionRoundEven256 round rcon)
va_qc va_s0 (fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 50 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 61 column 65 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 71 column 54 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 1 va_sM == Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1
va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 72 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 1 va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 73 column 82 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM) (round + 1) (round + 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundEven256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32))
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 == 0 /\ rcon ==
Vale.AES.AES_common_s.aes_rcon ((round + 1) `op_Division` 2 - 1) /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round /\ (forall (va_x_mem:vale_heap)
(va_x_heap1:vale_heap) (va_x_xmm1:quad32) (va_x_xmm2:quad32) (va_x_xmm4:quad32)
(va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags va_x_efl (va_upd_xmm 4 va_x_xmm4
(va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 1 va_x_xmm1 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem
va_x_mem va_s0))))) in va_get_ok va_sM /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1
va_sM) (va_get_reg64 rRdx va_sM) dst 15 (va_get_mem_layout va_sM) Secret /\ va_get_xmm 1 va_sM
== Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 1
va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> dst:buffer128 -> key:(seq
nat32) -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundEven256 round rcon dst key va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundEven256 round rcon)
([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem])
va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundEven256 round rcon dst key va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundEven256 (va_code_KeyExpansionRoundEven256 round
rcon) va_s0 round rcon dst key in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 2 va_sM
(va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundEven256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32)) :
(va_quickCode unit (va_code_KeyExpansionRoundEven256 round rcon)) =
(va_QProc (va_code_KeyExpansionRoundEven256 round rcon) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm
2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem]) (va_wp_KeyExpansionRoundEven256 round rcon
dst key) (va_wpProof_KeyExpansionRoundEven256 round rcon dst key))
//--
//-- KeyExpansionRoundOdd256
val va_code_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansionRoundOdd256 round rcon =
(va_Block (va_CCons (va_code_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0) (va_CCons
(va_code_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_CCons (va_code_VPslldq4
(va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm
4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4)
(va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_CCons
(va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 3) (16 `op_Multiply`
(round + 1)) Secret) (va_CNil ()))))))))))))
val va_codegen_success_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansionRoundOdd256 round rcon =
(va_pbool_and (va_codegen_success_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0)
(va_pbool_and (va_codegen_success_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) (16 `op_Multiply` (round + 1)) Secret) (va_ttrue ())))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansionRoundOdd256 (va_mods:va_mods_t) (round:nat64) (rcon:nat8) (dst:buffer128)
(key:(seq nat32)) : (va_quickCode unit (va_code_KeyExpansionRoundOdd256 round rcon)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 118 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 119 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 120 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 121 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 122 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 123 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 124 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 125 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 126 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 127 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) (16 `op_Multiply` (round + 1)) Secret dst (round + 1)) (fun (va_s:va_state) _
-> let (va_arg20:Prims.int) = round + 1 in let (va_arg19:Vale.Def.Types_s.quad32) = va_get_xmm
1 va_old_s in let (va_arg18:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 130 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_simd_round_key va_arg18 va_arg19 0 va_arg20)
(let (va_arg17:Prims.int) = round + 1 in let (va_arg16:Vale.Def.Types_s.quad32) = va_get_xmm 1
va_old_s in let (va_arg15:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 131 column 33 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_round_key_256_rcon_odd va_arg15 va_arg16 0
va_arg17) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 132 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QEmpty
(()))))))))))))))))
val va_lemma_KeyExpansionRoundOdd256 : va_b0:va_code -> va_s0:va_state -> round:nat64 -> rcon:nat8
-> dst:buffer128 -> key:(seq nat32)
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundOdd256 round rcon) va_s0 /\ va_get_ok
va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64 rRdx va_s0)
dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\ sse_enabled) /\ (1
<= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 =!= 0 /\ Vale.AES.AES_s.is_aes_key_LE
AES_256 key /\ va_get_xmm 3 va_s0 == Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\
va_get_xmm 1 va_s0 == Vale.AES.AES256_helpers.expand_key_256 key round))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ va_get_xmm 3 va_sM == Vale.X64.Decls.buffer128_read dst
(round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 3 va_sM ==
Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) /\ va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4
va_sM (va_update_xmm 3 va_sM (va_update_xmm 2 va_sM (va_update_mem_heaplet 1 va_sM
(va_update_ok va_sM (va_update_mem va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansionRoundOdd256 va_b0 va_s0 round rcon dst key =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2;
va_Mod_mem_heaplet 1; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansionRoundOdd256 va_mods round rcon dst key in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansionRoundOdd256 round rcon)
va_qc va_s0 (fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 93 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 104 column 65 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 114 column 54 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 3 va_sM == Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1
va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 115 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 3 va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 116 column 82 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM) (round + 1) (round + 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet
1; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundOdd256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32))
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 =!= 0 /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round /\ (forall (va_x_mem:vale_heap)
(va_x_heap1:vale_heap) (va_x_xmm2:quad32) (va_x_xmm3:quad32) (va_x_xmm4:quad32)
(va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags va_x_efl (va_upd_xmm 4 va_x_xmm4
(va_upd_xmm 3 va_x_xmm3 (va_upd_xmm 2 va_x_xmm2 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem
va_x_mem va_s0))))) in va_get_ok va_sM /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1
va_sM) (va_get_reg64 rRdx va_sM) dst 15 (va_get_mem_layout va_sM) Secret /\ va_get_xmm 3 va_sM
== Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 3
va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> dst:buffer128 -> key:(seq
nat32) -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundOdd256 round rcon dst key va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundOdd256 round rcon)
([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet 1; va_Mod_mem])
va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundOdd256 round rcon dst key va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundOdd256 (va_code_KeyExpansionRoundOdd256 round
rcon) va_s0 round rcon dst key in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet
1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundOdd256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32)) :
(va_quickCode unit (va_code_KeyExpansionRoundOdd256 round rcon)) =
(va_QProc (va_code_KeyExpansionRoundOdd256 round rcon) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm
3; va_Mod_xmm 2; va_Mod_mem_heaplet 1; va_Mod_mem]) (va_wp_KeyExpansionRoundOdd256 round rcon
dst key) (va_wpProof_KeyExpansionRoundOdd256 round rcon dst key))
//--
//-- KeyExpansionRoundUnrolledRecursive256
val va_code_KeyExpansionRoundUnrolledRecursive256 : n:int -> Tot va_code(decreases %[n])
[@ "opaque_to_smt"]
let rec va_code_KeyExpansionRoundUnrolledRecursive256 n =
(va_Block (va_CCons (if (1 < n && n <= 14) then va_Block (va_CCons
(va_code_KeyExpansionRoundUnrolledRecursive256 (n - 1)) (va_CCons (if (n `op_Modulus` 2 = 0)
then va_Block (va_CCons (va_code_KeyExpansionRoundEven256 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1))) (va_CNil ())) else va_Block (va_CCons
(va_code_KeyExpansionRoundOdd256 (n - 1) (Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 -
1))) (va_CNil ()))) (va_CNil ()))) else va_Block (va_CNil ())) (va_CNil ())))
val va_codegen_success_KeyExpansionRoundUnrolledRecursive256 : n:int -> Tot va_pbool(decreases %[n])
[@ "opaque_to_smt"]
let rec va_codegen_success_KeyExpansionRoundUnrolledRecursive256 n =
(va_pbool_and (if (1 < n && n <= 14) then va_pbool_and
(va_codegen_success_KeyExpansionRoundUnrolledRecursive256 (n - 1)) (va_pbool_and (if (n
`op_Modulus` 2 = 0) then va_pbool_and (va_codegen_success_KeyExpansionRoundEven256 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1))) (va_ttrue ()) else va_pbool_and
(va_codegen_success_KeyExpansionRoundOdd256 (n - 1) (Vale.AES.AES_common_s.aes_rcon (n
`op_Division` 2 - 1))) (va_ttrue ())) (va_ttrue ())) else va_ttrue ()) (va_ttrue ()))
val va_lemma_KeyExpansionRoundUnrolledRecursive256 : va_b0:va_code -> va_s0:va_state -> key:(seq
nat32) -> dst:buffer128 -> n:int
-> Ghost (va_state & va_fuel)(decreases %[n])
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundUnrolledRecursive256 n) va_s0 /\
va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (0 < n /\ n <= 14) /\ Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1
va_s0 == Vale.AES.AES256_helpers.expand_key_256 key 0 /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key 1 /\ va_get_xmm 1 va_s0 ==
Vale.X64.Decls.buffer128_read dst 0 (va_get_mem_heaplet 1 va_s0) /\ va_get_xmm 3 va_s0 ==
Vale.X64.Decls.buffer128_read dst 1 (va_get_mem_heaplet 1 va_s0) /\ va_get_reg64 rRdx va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 dst (va_get_mem_heaplet 1 va_s0)))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ Vale.X64.Decls.modifies_buffer128 dst (va_get_mem_heaplet 1
va_s0) (va_get_mem_heaplet 1 va_sM) /\ Vale.X64.Decls.buffer128_read dst n (va_get_mem_heaplet
1 va_sM) == (if (n `op_Modulus` 2 = 0) then va_get_xmm 1 va_sM else va_get_xmm 3 va_sM) /\
Vale.X64.Decls.buffer128_read dst (n - 1) (va_get_mem_heaplet 1 va_sM) == (if ((n - 1)
`op_Modulus` 2 = 0) then va_get_xmm 1 va_sM else va_get_xmm 3 va_sM) /\ (forall j .
{:pattern(buffer128_read dst j (va_get_mem_heaplet 1 va_sM))}0 <= j /\ j <= n ==>
Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_sM) ==
Vale.AES.AES256_helpers.expand_key_256 key j) /\ va_state_eq va_sM (va_update_flags va_sM
(va_update_xmm 4 va_sM (va_update_xmm 3 va_sM (va_update_xmm 2 va_sM (va_update_xmm 1 va_sM
(va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM va_s0))))))))))
[@"opaque_to_smt"]
let rec va_lemma_KeyExpansionRoundUnrolledRecursive256 va_b0 va_s0 key dst n =
va_reveal_opaque (`%va_code_KeyExpansionRoundUnrolledRecursive256)
(va_code_KeyExpansionRoundUnrolledRecursive256 n);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
let va_b2 = va_tl va_b1 in
let va_c2 = va_hd va_b1 in
let (va_fc2, va_s2) =
(
if (1 < n && n <= 14) then
(
let va_b3 = va_get_block va_c2 in
let (va_s4, va_fc4) = va_lemma_KeyExpansionRoundUnrolledRecursive256 (va_hd va_b3) va_s0 key
dst (n - 1) in
let va_b4 = va_tl va_b3 in
let (old_mem:vale_heap) = va_get_mem_heaplet 1 va_s4 in
let va_b6 = va_tl va_b4 in
let va_c6 = va_hd va_b4 in
let (va_fc6, va_s6) =
(
if (n `op_Modulus` 2 = 0) then
(
let va_b7 = va_get_block va_c6 in
let (va_s8, va_fc8) = va_lemma_KeyExpansionRoundEven256 (va_hd va_b7) va_s4 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1)) dst key in
let va_b8 = va_tl va_b7 in
let (va_s6, va_f8) = va_lemma_empty_total va_s8 va_b8 in
let va_fc6 = va_lemma_merge_total va_b7 va_s4 va_fc8 va_s8 va_f8 va_s6 in
(va_fc6, va_s6)
)
else
(
let va_b9 = va_get_block va_c6 in
let (va_s10, va_fc10) = va_lemma_KeyExpansionRoundOdd256 (va_hd va_b9) va_s4 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1)) dst key in
let va_b10 = va_tl va_b9 in
let (va_s6, va_f10) = va_lemma_empty_total va_s10 va_b10 in
let va_fc6 = va_lemma_merge_total va_b9 va_s4 va_fc10 va_s10 va_f10 va_s6 in
(va_fc6, va_s6)
)
) in
assert (forall j . {:pattern(buffer128_read dst j (va_get_mem_heaplet 1 va_s6))}0 <= j /\ j <
n ==> Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_s6) ==
Vale.X64.Decls.buffer128_read dst j old_mem);
let (va_s2, va_f6) = va_lemma_empty_total va_s6 va_b6 in
let va_f4 = va_lemma_merge_total va_b4 va_s4 va_fc6 va_s6 va_f6 va_s2 in
let va_fc2 = va_lemma_merge_total va_b3 va_s0 va_fc4 va_s4 va_f4 va_s2 in
(va_fc2, va_s2)
)
else
(
let va_b12 = va_get_block va_c2 in
let (va_s2, va_fc2) = va_lemma_empty_total va_s0 va_b12 in
(va_fc2, va_s2)
)
) in
let (va_sM, va_f2) = va_lemma_empty_total va_s2 va_b2 in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc2 va_s2 va_f2 va_sM in
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundUnrolledRecursive256 (key:(seq nat32)) (dst:buffer128) (n:int)
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (0 < n /\ n <= 14) /\ Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1
va_s0 == Vale.AES.AES256_helpers.expand_key_256 key 0 /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key 1 /\ va_get_xmm 1 va_s0 ==
Vale.X64.Decls.buffer128_read dst 0 (va_get_mem_heaplet 1 va_s0) /\ va_get_xmm 3 va_s0 ==
Vale.X64.Decls.buffer128_read dst 1 (va_get_mem_heaplet 1 va_s0) /\ va_get_reg64 rRdx va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 dst (va_get_mem_heaplet 1 va_s0) /\
(forall (va_x_mem:vale_heap) (va_x_heap1:vale_heap) (va_x_xmm1:quad32) (va_x_xmm2:quad32)
(va_x_xmm3:quad32) (va_x_xmm4:quad32) (va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags
va_x_efl (va_upd_xmm 4 va_x_xmm4 (va_upd_xmm 3 va_x_xmm3 (va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 1
va_x_xmm1 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem va_x_mem va_s0)))))) in va_get_ok va_sM
/\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst
15 (va_get_mem_layout va_sM) Secret /\ Vale.X64.Decls.modifies_buffer128 dst
(va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet 1 va_sM) /\ Vale.X64.Decls.buffer128_read dst
n (va_get_mem_heaplet 1 va_sM) == va_if (n `op_Modulus` 2 = 0) (fun _ -> va_get_xmm 1 va_sM)
(fun _ -> va_get_xmm 3 va_sM) /\ Vale.X64.Decls.buffer128_read dst (n - 1) (va_get_mem_heaplet
1 va_sM) == va_if ((n - 1) `op_Modulus` 2 = 0) (fun _ -> va_get_xmm 1 va_sM) (fun _ ->
va_get_xmm 3 va_sM) /\ (forall j . {:pattern(buffer128_read dst j (va_get_mem_heaplet 1
va_sM))}0 <= j /\ j <= n ==> Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_sM)
== Vale.AES.AES256_helpers.expand_key_256 key j) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundUnrolledRecursive256 : key:(seq nat32) -> dst:buffer128 -> n:int ->
va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundUnrolledRecursive256 key dst n va_s0
va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundUnrolledRecursive256
n) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_mem]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundUnrolledRecursive256 key dst n va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundUnrolledRecursive256
(va_code_KeyExpansionRoundUnrolledRecursive256 n) va_s0 key dst n in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok
va_sM (va_update_mem va_sM va_s0)))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundUnrolledRecursive256 (key:(seq nat32)) (dst:buffer128) (n:int) :
(va_quickCode unit (va_code_KeyExpansionRoundUnrolledRecursive256 n)) =
(va_QProc (va_code_KeyExpansionRoundUnrolledRecursive256 n) ([va_Mod_flags; va_Mod_xmm 4;
va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem])
(va_wp_KeyExpansionRoundUnrolledRecursive256 key dst n)
(va_wpProof_KeyExpansionRoundUnrolledRecursive256 key dst n))
//--
//-- KeyExpansion256Stdcall
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansion256Stdcall win =
(va_Block (va_CCons (if win then va_Block (va_CCons (va_code_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64 rRcx) 0 Secret)
(va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3)
(va_op_reg_opr64_reg64 rRcx) 16 Secret) (va_CNil ()))) else va_Block (va_CCons
(va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64
rRdi) 0 Secret) (va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm
3) (va_op_reg_opr64_reg64 rRdi) 16 Secret) (va_CCons (va_code_Mov64 (va_op_dst_opr64_reg64
rRdx) (va_op_opr64_reg64 rRsi)) (va_CNil ()))))) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) 0 Secret)
(va_CCons (va_code_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) 16 Secret) (va_CCons (va_code_KeyExpansionRoundUnrolledRecursive256 14)
(va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm
3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 4) (va_op_xmm_xmm 4)) (va_CNil ()))))))))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansion256Stdcall win =
(va_pbool_and (if win then va_pbool_and (va_codegen_success_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64 rRcx) 0 Secret)
(va_pbool_and (va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm
3) (va_op_reg_opr64_reg64 rRcx) 16 Secret) (va_ttrue ())) else va_pbool_and
(va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1)
(va_op_reg_opr64_reg64 rRdi) 0 Secret) (va_pbool_and (va_codegen_success_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3) (va_op_reg_opr64_reg64 rRdi) 16 Secret)
(va_pbool_and (va_codegen_success_Mov64 (va_op_dst_opr64_reg64 rRdx) (va_op_opr64_reg64 rRsi))
(va_ttrue ())))) (va_pbool_and (va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet
1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) 0 Secret) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) 16 Secret) (va_pbool_and
(va_codegen_success_KeyExpansionRoundUnrolledRecursive256 14) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 4) (va_op_xmm_xmm 4)) (va_ttrue ())))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansion256Stdcall (va_mods:va_mods_t) (win:bool) (input_key_b:buffer128)
(output_key_expansion_b:buffer128) : (va_quickCode unit (va_code_KeyExpansion256Stdcall win)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(key_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRcx va_s)
(fun _ -> va_get_reg64 rRdi va_s) in let (key_expansion_ptr:(va_int_range 0
18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRdx va_s) (fun _ -> va_get_reg64
rRsi va_s) in let (key:(FStar.Seq.Base.seq Vale.Def.Types_s.nat32)) =
Vale.AES.AES256_helpers.make_AES256_key (Vale.X64.Decls.buffer128_read input_key_b 0
(va_get_mem_heaplet 0 va_s)) (Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0
va_s)) in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 201 column 15 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_qInlineIf va_mods win (qblock va_mods (fun (va_s:va_state) -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 203 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64
rRcx) 0 Secret input_key_b 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 204 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3) (va_op_reg_opr64_reg64
rRcx) 16 Secret input_key_b 1) (va_QEmpty (()))))) (qblock va_mods (fun (va_s:va_state) ->
va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 208 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64
rRdi) 0 Secret input_key_b 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 209 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3) (va_op_reg_opr64_reg64
rRdi) 16 Secret input_key_b 1) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 210 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Mov64 (va_op_dst_opr64_reg64 rRdx) (va_op_opr64_reg64 rRsi)) (va_QEmpty (())))))))
(fun (va_s:va_state) va_g -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 213 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) 0 Secret output_key_expansion_b 0) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 214 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) 16 Secret output_key_expansion_b 1) (fun (va_s:va_state) _ -> va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 216 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 217 column 42 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_KeyExpansionRoundUnrolledRecursive256 key output_key_expansion_b 14) (fun
(va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 218 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_expand_key_256 key 15) (va_QLemma va_range1
"***** PRECONDITION NOT MET AT line 219 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
true (fun _ -> va_reveal_eq (`%key_to_round_keys_LE) key_to_round_keys_LE key_to_round_keys_LE)
(fun _ -> va_reveal_opaque (`%key_to_round_keys_LE) key_to_round_keys_LE) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 222 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 223 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 224 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 225 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 4) (va_op_xmm_xmm 4)) (va_QEmpty (()))))))))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansion256Stdcall va_b0 va_s0 win input_key_b output_key_expansion_b =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_reg64 rRdx; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansion256Stdcall va_mods win input_key_b output_key_expansion_b in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansion256Stdcall win) va_qc va_s0
(fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 177 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ (let (key_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ ->
va_get_reg64 rRcx va_s0) (fun _ -> va_get_reg64 rRdi va_s0) in let
(key_expansion_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ -> va_get_reg64
rRdx va_s0) (fun _ -> va_get_reg64 rRsi va_s0) in let (key:(FStar.Seq.Base.seq
Vale.Def.Types_s.nat32)) = Vale.AES.AES256_helpers.make_AES256_key
(Vale.X64.Decls.buffer128_read input_key_b 0 (va_get_mem_heaplet 0 va_s0))
(Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0 va_s0)) in label va_range1
"***** POSTCONDITION NOT MET AT line 193 column 52 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(aesni_enabled /\ avx_enabled /\ sse_enabled) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 194 column 76 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_sM) key_ptr input_key_b 2
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 195 column 98 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) key_expansion_ptr
output_key_expansion_b 15 (va_get_mem_layout va_sM) Secret)) /\ (let (key_ptr:(va_int_range 0
18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRcx va_s0) (fun _ -> va_get_reg64
rRdi va_s0) in let (key_expansion_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _
-> va_get_reg64 rRdx va_s0) (fun _ -> va_get_reg64 rRsi va_s0) in let (key:(FStar.Seq.Base.seq
Vale.Def.Types_s.nat32)) = Vale.AES.AES256_helpers.make_AES256_key
(Vale.X64.Decls.buffer128_read input_key_b 0 (va_get_mem_heaplet 0 va_s0))
(Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0 va_s0)) in label va_range1
"***** POSTCONDITION NOT MET AT line 197 column 70 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer128 output_key_expansion_b (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 199 column 109 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(forall (j:nat) . {:pattern(buffer128_read output_key_expansion_b j (va_get_mem_heaplet 1
va_sM))}j <= 14 ==> Vale.X64.Decls.buffer128_read output_key_expansion_b j (va_get_mem_heaplet
1 va_sM) == FStar.Seq.Base.index #Vale.Def.Types_s.quad32 (Vale.AES.AES_s.key_to_round_keys_LE
AES_256 key) j))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_reg64 rRdx; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_KeyExpansion256Stdcall win input_key_b output_key_expansion_b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansion256Stdcall (va_code_KeyExpansion256Stdcall win) va_s0
win input_key_b output_key_expansion_b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_reg64
rRdx va_sM (va_update_ok va_sM (va_update_mem va_sM va_s0))))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_reg64 rRdx; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- AES256EncryptRound
val va_code_AES256EncryptRound : n:nat -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_AES256EncryptRound n =
(va_Block (va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) (16 `op_Multiply` n) Secret) (va_CCons (va_code_AESNI_enc
(va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_CNil ()))))
val va_codegen_success_AES256EncryptRound : n:nat -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_AES256EncryptRound n =
(va_pbool_and (va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) (16 `op_Multiply` n) Secret) (va_pbool_and
(va_codegen_success_AESNI_enc (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_AES256EncryptRound (va_mods:va_mods_t) (n:nat) (init:quad32) (round_keys:(seq quad32))
(keys_buffer:buffer128) : (va_quickCode unit (va_code_AES256EncryptRound n)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(va_arg5:Vale.Def.Types_s.quad32) = va_get_xmm 0 va_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 252 column 33 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES_s.commute_sub_bytes_shift_rows va_arg5) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 253 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) (16 `op_Multiply` n) Secret keys_buffer n) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 254 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_enc (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_QEmpty (()))))))
val va_lemma_AES256EncryptRound : va_b0:va_code -> va_s0:va_state -> n:nat -> init:quad32 ->
round_keys:(seq quad32) -> keys_buffer:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AES256EncryptRound n) va_s0 /\ va_get_ok va_s0 /\
(aesni_enabled /\ sse_enabled) /\ (1 <= n /\ n < 14 /\ 14 <= FStar.Seq.Base.length #quad32
round_keys) /\ va_get_xmm 0 va_s0 == Vale.AES.AES_s.eval_rounds_def init round_keys (n - 1) /\
va_get_reg64 rR8 va_s0 == Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 keys_buffer
(va_get_mem_heaplet 0 va_s0) /\ Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0)
(va_get_reg64 rR8 va_s0) keys_buffer 15 (va_get_mem_layout va_s0) Secret /\
Vale.X64.Decls.buffer128_read keys_buffer n (va_get_mem_heaplet 0 va_s0) ==
FStar.Seq.Base.index #quad32 round_keys n))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_get_xmm 0 va_sM == Vale.AES.AES_s.eval_rounds_def init round_keys n /\ va_state_eq va_sM
(va_update_flags va_sM (va_update_xmm 2 va_sM (va_update_xmm 0 va_sM (va_update_ok va_sM
va_s0))))))
[@"opaque_to_smt"]
let va_lemma_AES256EncryptRound va_b0 va_s0 n init round_keys keys_buffer =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok] in
let va_qc = va_qcode_AES256EncryptRound va_mods n init round_keys keys_buffer in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_AES256EncryptRound n) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 232 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 250 column 53 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 0 va_sM == Vale.AES.AES_s.eval_rounds_def init round_keys n)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_AES256EncryptRound (n:nat) (init:quad32) (round_keys:(seq quad32))
(keys_buffer:buffer128) (va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ (aesni_enabled /\ sse_enabled) /\ (1 <= n /\ n < 14 /\ 14 <=
FStar.Seq.Base.length #quad32 round_keys) /\ va_get_xmm 0 va_s0 ==
Vale.AES.AES_s.eval_rounds_def init round_keys (n - 1) /\ va_get_reg64 rR8 va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 keys_buffer (va_get_mem_heaplet 0 va_s0)
/\ Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0) (va_get_reg64 rR8 va_s0)
keys_buffer 15 (va_get_mem_layout va_s0) Secret /\ Vale.X64.Decls.buffer128_read keys_buffer n
(va_get_mem_heaplet 0 va_s0) == FStar.Seq.Base.index #quad32 round_keys n /\ (forall
(va_x_xmm0:quad32) (va_x_xmm2:quad32) (va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags
va_x_efl (va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 0 va_x_xmm0 va_s0)) in va_get_ok va_sM /\
va_get_xmm 0 va_sM == Vale.AES.AES_s.eval_rounds_def init round_keys n ==> va_k va_sM (())))
val va_wpProof_AES256EncryptRound : n:nat -> init:quad32 -> round_keys:(seq quad32) ->
keys_buffer:buffer128 -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AES256EncryptRound n init round_keys keys_buffer va_s0
va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AES256EncryptRound n) ([va_Mod_flags;
va_Mod_xmm 2; va_Mod_xmm 0]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_AES256EncryptRound n init round_keys keys_buffer va_s0 va_k =
let (va_sM, va_f0) = va_lemma_AES256EncryptRound (va_code_AES256EncryptRound n) va_s0 n init
round_keys keys_buffer in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 2 va_sM (va_update_xmm 0 va_sM
(va_update_ok va_sM va_s0)))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_AES256EncryptRound (n:nat) (init:quad32) (round_keys:(seq quad32))
(keys_buffer:buffer128) : (va_quickCode unit (va_code_AES256EncryptRound n)) =
(va_QProc (va_code_AES256EncryptRound n) ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0])
(va_wp_AES256EncryptRound n init round_keys keys_buffer) (va_wpProof_AES256EncryptRound n init
round_keys keys_buffer))
//--
//-- AES256EncryptBlock
[@ "opaque_to_smt" va_qattr]
let va_code_AES256EncryptBlock () =
(va_Block (va_CCons (va_Block (va_CNil ())) (va_CCons (va_code_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64 rR8) 0 Secret) (va_CCons
(va_code_Pxor (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_CCons (va_code_AES256EncryptRound 1)
(va_CCons (va_code_AES256EncryptRound 2) (va_CCons (va_code_AES256EncryptRound 3) (va_CCons
(va_code_AES256EncryptRound 4) (va_CCons (va_code_AES256EncryptRound 5) (va_CCons
(va_code_AES256EncryptRound 6) (va_CCons (va_code_AES256EncryptRound 7) (va_CCons
(va_code_AES256EncryptRound 8) (va_CCons (va_code_AES256EncryptRound 9) (va_CCons
(va_code_AES256EncryptRound 10) (va_CCons (va_code_AES256EncryptRound 11) (va_CCons
(va_code_AES256EncryptRound 12) (va_CCons (va_code_AES256EncryptRound 13) (va_CCons
(va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) (16 `op_Multiply` 14) Secret) (va_CCons (va_code_AESNI_enc_last (va_op_xmm_xmm 0)
(va_op_xmm_xmm 2)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_CNil
())))))))))))))))))))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_AES256EncryptBlock () =
(va_pbool_and (va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) 0 Secret) (va_pbool_and (va_codegen_success_Pxor (va_op_xmm_xmm 0)
(va_op_xmm_xmm 2)) (va_pbool_and (va_codegen_success_AES256EncryptRound 1) (va_pbool_and
(va_codegen_success_AES256EncryptRound 2) (va_pbool_and (va_codegen_success_AES256EncryptRound
3) (va_pbool_and (va_codegen_success_AES256EncryptRound 4) (va_pbool_and
(va_codegen_success_AES256EncryptRound 5) (va_pbool_and (va_codegen_success_AES256EncryptRound
6) (va_pbool_and (va_codegen_success_AES256EncryptRound 7) (va_pbool_and
(va_codegen_success_AES256EncryptRound 8) (va_pbool_and (va_codegen_success_AES256EncryptRound
9) (va_pbool_and (va_codegen_success_AES256EncryptRound 10) (va_pbool_and
(va_codegen_success_AES256EncryptRound 11) (va_pbool_and (va_codegen_success_AES256EncryptRound
12) (va_pbool_and (va_codegen_success_AES256EncryptRound 13) (va_pbool_and
(va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) (16 `op_Multiply` 14) Secret) (va_pbool_and
(va_codegen_success_AESNI_enc_last (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_ttrue ())))))))))))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_AES256EncryptBlock (va_mods:va_mods_t) (input:quad32) (key:(seq nat32))
(round_keys:(seq quad32)) (keys_buffer:buffer128) : (va_quickCode unit
(va_code_AES256EncryptBlock ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_qAssertSquash
va_range1
"***** EXPRESSION PRECONDITIONS NOT MET WITHIN line 280 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
((fun a_539 (s_540:(FStar.Seq.Base.seq a_539)) (i_541:Prims.nat) -> let (i_515:Prims.nat) =
i_541 in Prims.b2t (Prims.op_LessThan i_515 (FStar.Seq.Base.length #a_539 s_540)))
Vale.Def.Types_s.quad32 round_keys 0) (fun _ -> let (init:Vale.Def.Types_s.quad32) =
Vale.Def.Types_s.quad32_xor input (FStar.Seq.Base.index #Vale.Def.Types_s.quad32 round_keys 0)
in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 282 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) 0 Secret keys_buffer 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 283 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 284 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 1 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 285 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 2 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 286 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 3 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 287 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 4 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 288 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 5 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 289 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 6 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 290 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 7 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 291 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 8 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 292 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 9 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 293 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 10 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 294 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 11 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 295 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 12 init round_keys keys_buffer) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 296 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 13 init round_keys keys_buffer) (fun (va_s:va_state) _ -> let
(va_arg24:Vale.Def.Types_s.quad32) = va_get_xmm 0 va_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 297 column 33 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES_s.commute_sub_bytes_shift_rows va_arg24) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 298 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) (16 `op_Multiply` 14) Secret keys_buffer 14) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 299 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_enc_last (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 302 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (fun (va_s:va_state) _ -> va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 303 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES_s.aes_encrypt_LE_reveal ()) (va_QEmpty (()))))))))))))))))))))))))
[@"opaque_to_smt"]
let va_lemma_AES256EncryptBlock va_b0 va_s0 input key round_keys keys_buffer =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok] in
let va_qc = va_qcode_AES256EncryptBlock va_mods input key round_keys keys_buffer in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_AES256EncryptBlock ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 257 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 278 column 52 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 0 va_sM == Vale.AES.AES_s.aes_encrypt_LE AES_256 key input)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_AES256EncryptBlock input key round_keys keys_buffer va_s0 va_k =
let (va_sM, va_f0) = va_lemma_AES256EncryptBlock (va_code_AES256EncryptBlock ()) va_s0 input key
round_keys keys_buffer in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 2 va_sM (va_update_xmm 0 va_sM
(va_update_ok va_sM va_s0)))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- AES256EncryptBlockStdcall
[@ "opaque_to_smt" va_qattr]
let va_code_AES256EncryptBlockStdcall win =
(va_Block (va_CCons (if win then va_Block (va_CCons (va_code_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 0) (va_op_reg_opr64_reg64 rRdx) 0 Secret) (va_CNil
())) else va_Block (va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0)
(va_op_xmm_xmm 0) (va_op_reg_opr64_reg64 rRsi) 0 Secret) (va_CCons (va_code_Mov64
(va_op_dst_opr64_reg64 rR8) (va_op_opr64_reg64 rRdx)) (va_CNil ())))) (va_CCons (va_Block
(va_CNil ())) (va_CCons (va_code_AES256EncryptBlock ()) (va_CCons (if win then va_Block
(va_CCons (va_code_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRcx)
(va_op_xmm_xmm 0) 0 Secret) (va_CNil ())) else va_Block (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdi) (va_op_xmm_xmm 0) 0 Secret) (va_CNil
()))) (va_CNil ()))))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_AES256EncryptBlockStdcall win =
(va_pbool_and (if win then va_pbool_and (va_codegen_success_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 0) (va_op_reg_opr64_reg64 rRdx) 0 Secret)
(va_ttrue ()) else va_pbool_and (va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet
0) (va_op_xmm_xmm 0) (va_op_reg_opr64_reg64 rRsi) 0 Secret) (va_pbool_and
(va_codegen_success_Mov64 (va_op_dst_opr64_reg64 rR8) (va_op_opr64_reg64 rRdx)) (va_ttrue ())))
(va_pbool_and (va_codegen_success_AES256EncryptBlock ()) (va_pbool_and (if win then
va_pbool_and (va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1)
(va_op_reg_opr64_reg64 rRcx) (va_op_xmm_xmm 0) 0 Secret) (va_ttrue ()) else va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdi)
(va_op_xmm_xmm 0) 0 Secret) (va_ttrue ())) (va_ttrue ())))) | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsVector.fsti.checked",
"Vale.X64.InsMem.fsti.checked",
"Vale.X64.InsBasic.fsti.checked",
"Vale.X64.InsAes.fsti.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.AES_s.fst.checked",
"Vale.AES.AES_common_s.fst.checked",
"Vale.AES.AES256_helpers.fsti.checked",
"prims.fst.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Vale.AES.X64.AES256.fst"
} | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES256_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsAes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES256_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsAes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 20,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
va_mods: Vale.X64.QuickCode.va_mods_t ->
win: Prims.bool ->
input: Vale.X64.Decls.quad32 ->
key: FStar.Seq.Base.seq Vale.X64.Memory.nat32 ->
input_buffer: Vale.X64.Memory.buffer128 ->
output_buffer: Vale.X64.Memory.buffer128 ->
keys_buffer: Vale.X64.Memory.buffer128
-> Vale.X64.QuickCode.va_quickCode Prims.unit
(Vale.AES.X64.AES256.va_code_AES256EncryptBlockStdcall win) | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.QuickCode.va_mods_t",
"Prims.bool",
"Vale.X64.Decls.quad32",
"FStar.Seq.Base.seq",
"Vale.X64.Memory.nat32",
"Vale.X64.Memory.buffer128",
"Vale.X64.QuickCodes.qblock",
"Prims.unit",
"Prims.Cons",
"Vale.X64.Decls.va_code",
"Vale.X64.QuickCodes.if_code",
"Vale.X64.QuickCodes.block",
"Vale.X64.InsVector.va_code_Load128_buffer",
"Vale.X64.Decls.va_op_heaplet_mem_heaplet",
"Vale.X64.Decls.va_op_xmm_xmm",
"Vale.X64.Decls.va_op_reg_opr64_reg64",
"Vale.X64.Machine_s.rRdx",
"Vale.Arch.HeapTypes_s.Secret",
"Prims.Nil",
"Vale.X64.Machine_s.precode",
"Vale.X64.Decls.ins",
"Vale.X64.Decls.ocmp",
"Vale.X64.Machine_s.rRsi",
"Vale.X64.InsBasic.va_code_Mov64",
"Vale.X64.Decls.va_op_dst_opr64_reg64",
"Vale.X64.Machine_s.rR8",
"Vale.X64.Decls.va_op_opr64_reg64",
"Vale.X64.Machine_s.Block",
"Vale.AES.X64.AES256.va_code_AES256EncryptBlock",
"Vale.X64.InsVector.va_code_Store128_buffer",
"Vale.X64.Machine_s.rRcx",
"Vale.X64.Machine_s.rRdi",
"Vale.X64.Decls.va_state",
"Vale.X64.QuickCodes.va_QBind",
"Vale.X64.QuickCodes.va_range1",
"Vale.X64.QuickCodes.va_qInlineIf",
"Vale.X64.QuickCodes.va_QSeq",
"Vale.X64.InsVector.va_quick_Load128_buffer",
"Vale.X64.QuickCodes.va_QEmpty",
"Vale.X64.QuickCodes.quickCodes",
"Vale.X64.InsBasic.va_quick_Mov64",
"Vale.X64.QuickCodes.va_qAssertSquash",
"Vale.AES.AES_s.is_aes_key_LE",
"Vale.AES.AES_common_s.AES_256",
"Prims.squash",
"Vale.AES.X64.AES256.va_quick_AES256EncryptBlock",
"Vale.AES.AES_s.key_to_round_keys_LE",
"Vale.X64.InsVector.va_quick_Store128_buffer",
"Vale.X64.Decls.va_int_range",
"Vale.X64.Decls.va_if",
"Vale.Def.Types_s.nat64",
"Prims.b2t",
"Vale.X64.Decls.va_get_reg64",
"Prims.l_not",
"Vale.X64.State.vale_state",
"Vale.X64.QuickCode.va_quickCode",
"Vale.AES.X64.AES256.va_code_AES256EncryptBlockStdcall"
] | [] | false | false | false | false | false | let va_qcode_AES256EncryptBlockStdcall
(va_mods: va_mods_t)
(win: bool)
(input: quad32)
(key: (seq nat32))
(input_buffer output_buffer keys_buffer: buffer128)
: (va_quickCode unit (va_code_AES256EncryptBlockStdcall win)) =
| (qblock va_mods
(fun (va_s: va_state) ->
let va_old_s:va_state = va_s in
let output_ptr:(va_int_range 0 18446744073709551615) =
va_if win (fun _ -> va_get_reg64 rRcx va_s) (fun _ -> va_get_reg64 rRdi va_s)
in
let input_ptr:(va_int_range 0 18446744073709551615) =
va_if win (fun _ -> va_get_reg64 rRdx va_s) (fun _ -> va_get_reg64 rRsi va_s)
in
let expanded_key_ptr:(va_int_range 0 18446744073709551615) =
va_if win (fun _ -> va_get_reg64 rR8 va_s) (fun _ -> va_get_reg64 rRdx va_s)
in
va_QBind va_range1
"***** PRECONDITION NOT MET AT line 338 column 15 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_qInlineIf va_mods
win
(qblock va_mods
(fun (va_s: va_state) ->
va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 340 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0)
(va_op_xmm_xmm 0)
(va_op_reg_opr64_reg64 rRdx)
0
Secret
input_buffer
0)
(va_QEmpty (()))))
(qblock va_mods
(fun (va_s: va_state) ->
va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 344 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0)
(va_op_xmm_xmm 0)
(va_op_reg_opr64_reg64 rRsi)
0
Secret
input_buffer
0)
(va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 345 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Mov64 (va_op_dst_opr64_reg64 rR8) (va_op_opr64_reg64 rRdx))
(va_QEmpty (()))))))
(fun (va_s: va_state) va_g ->
va_qAssertSquash va_range1
"***** EXPRESSION PRECONDITIONS NOT MET WITHIN line 348 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
((fun
(alg_10150: Vale.AES.AES_common_s.algorithm)
(key_10151: (FStar.Seq.Base.seq Vale.Def.Types_s.nat32))
->
Vale.AES.AES_s.is_aes_key_LE alg_10150 key_10151) AES_256
key)
(fun _ ->
va_QBind va_range1
"***** PRECONDITION NOT MET AT line 348 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptBlock input
key
(Vale.AES.AES_s.key_to_round_keys_LE AES_256 key)
keys_buffer)
(fun (va_s: va_state) _ ->
va_QBind va_range1
"***** PRECONDITION NOT MET AT line 350 column 15 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_qInlineIf va_mods
win
(qblock va_mods
(fun (va_s: va_state) ->
va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 352 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1)
(va_op_reg_opr64_reg64 rRcx)
(va_op_xmm_xmm 0)
0
Secret
output_buffer
0)
(va_QEmpty (()))))
(qblock va_mods
(fun (va_s: va_state) ->
va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 356 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1)
(va_op_reg_opr64_reg64 rRdi)
(va_op_xmm_xmm 0)
0
Secret
output_buffer
0)
(va_QEmpty (())))))
(fun (va_s: va_state) va_g -> va_QEmpty (()))))))) | false |
Vale.AES.X64.AES256.fst | Vale.AES.X64.AES256.va_qcode_AES256EncryptBlock | val va_qcode_AES256EncryptBlock
(va_mods: va_mods_t)
(input: quad32)
(key: (seq nat32))
(round_keys: (seq quad32))
(keys_buffer: buffer128)
: (va_quickCode unit (va_code_AES256EncryptBlock ())) | val va_qcode_AES256EncryptBlock
(va_mods: va_mods_t)
(input: quad32)
(key: (seq nat32))
(round_keys: (seq quad32))
(keys_buffer: buffer128)
: (va_quickCode unit (va_code_AES256EncryptBlock ())) | let va_qcode_AES256EncryptBlock (va_mods:va_mods_t) (input:quad32) (key:(seq nat32))
(round_keys:(seq quad32)) (keys_buffer:buffer128) : (va_quickCode unit
(va_code_AES256EncryptBlock ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_qAssertSquash
va_range1
"***** EXPRESSION PRECONDITIONS NOT MET WITHIN line 280 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
((fun a_539 (s_540:(FStar.Seq.Base.seq a_539)) (i_541:Prims.nat) -> let (i_515:Prims.nat) =
i_541 in Prims.b2t (Prims.op_LessThan i_515 (FStar.Seq.Base.length #a_539 s_540)))
Vale.Def.Types_s.quad32 round_keys 0) (fun _ -> let (init:Vale.Def.Types_s.quad32) =
Vale.Def.Types_s.quad32_xor input (FStar.Seq.Base.index #Vale.Def.Types_s.quad32 round_keys 0)
in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 282 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) 0 Secret keys_buffer 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 283 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 284 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 1 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 285 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 2 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 286 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 3 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 287 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 4 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 288 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 5 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 289 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 6 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 290 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 7 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 291 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 8 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 292 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 9 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 293 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 10 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 294 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 11 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 295 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 12 init round_keys keys_buffer) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 296 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 13 init round_keys keys_buffer) (fun (va_s:va_state) _ -> let
(va_arg24:Vale.Def.Types_s.quad32) = va_get_xmm 0 va_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 297 column 33 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES_s.commute_sub_bytes_shift_rows va_arg24) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 298 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) (16 `op_Multiply` 14) Secret keys_buffer 14) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 299 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_enc_last (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 302 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (fun (va_s:va_state) _ -> va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 303 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES_s.aes_encrypt_LE_reveal ()) (va_QEmpty (())))))))))))))))))))))))) | {
"file_name": "obj/Vale.AES.X64.AES256.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 100,
"end_line": 845,
"start_col": 0,
"start_line": 791
} | module Vale.AES.X64.AES256
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsVector
open Vale.X64.InsAes
open Vale.X64.QuickCode
open Vale.X64.QuickCodes
open Vale.Arch.Types
open Vale.AES.AES256_helpers
open Vale.X64.CPU_Features_s
#reset-options "--z3rlimit 20"
//-- KeyExpansionRoundEven256
val va_code_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansionRoundEven256 round rcon =
(va_Block (va_CCons (va_code_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon)
(va_CCons (va_code_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_CCons (va_code_VPslldq4
(va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm
4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4)
(va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_CCons
(va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) (16 `op_Multiply`
(round + 1)) Secret) (va_CNil ()))))))))))))
val va_codegen_success_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansionRoundEven256 round rcon =
(va_pbool_and (va_codegen_success_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon)
(va_pbool_and (va_codegen_success_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) (16 `op_Multiply` (round + 1)) Secret) (va_ttrue ())))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansionRoundEven256 (va_mods:va_mods_t) (round:nat64) (rcon:nat8) (dst:buffer128)
(key:(seq nat32)) : (va_quickCode unit (va_code_KeyExpansionRoundEven256 round rcon)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 75 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 76 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 77 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 78 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 79 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 80 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 81 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 82 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 83 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 84 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) (16 `op_Multiply` (round + 1)) Secret dst (round + 1)) (fun (va_s:va_state) _
-> let (va_arg17:Prims.int) = round + 1 in let (va_arg16:Vale.Def.Types_s.nat32) = rcon in let
(va_arg15:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in let
(va_arg14:Vale.Def.Types_s.quad32) = va_get_xmm 1 va_old_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 87 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_simd_round_key va_arg14 va_arg15 va_arg16
va_arg17) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 88 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QEmpty (())))))))))))))))
val va_lemma_KeyExpansionRoundEven256 : va_b0:va_code -> va_s0:va_state -> round:nat64 -> rcon:nat8
-> dst:buffer128 -> key:(seq nat32)
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundEven256 round rcon) va_s0 /\
va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 == 0 /\ rcon ==
Vale.AES.AES_common_s.aes_rcon ((round + 1) `op_Division` 2 - 1) /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ va_get_xmm 1 va_sM == Vale.X64.Decls.buffer128_read dst
(round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 1 va_sM ==
Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) /\ va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4
va_sM (va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM
(va_update_ok va_sM (va_update_mem va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansionRoundEven256 va_b0 va_s0 round rcon dst key =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansionRoundEven256 va_mods round rcon dst key in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansionRoundEven256 round rcon)
va_qc va_s0 (fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 50 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 61 column 65 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 71 column 54 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 1 va_sM == Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1
va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 72 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 1 va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 73 column 82 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM) (round + 1) (round + 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundEven256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32))
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 == 0 /\ rcon ==
Vale.AES.AES_common_s.aes_rcon ((round + 1) `op_Division` 2 - 1) /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round /\ (forall (va_x_mem:vale_heap)
(va_x_heap1:vale_heap) (va_x_xmm1:quad32) (va_x_xmm2:quad32) (va_x_xmm4:quad32)
(va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags va_x_efl (va_upd_xmm 4 va_x_xmm4
(va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 1 va_x_xmm1 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem
va_x_mem va_s0))))) in va_get_ok va_sM /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1
va_sM) (va_get_reg64 rRdx va_sM) dst 15 (va_get_mem_layout va_sM) Secret /\ va_get_xmm 1 va_sM
== Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 1
va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> dst:buffer128 -> key:(seq
nat32) -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundEven256 round rcon dst key va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundEven256 round rcon)
([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem])
va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundEven256 round rcon dst key va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundEven256 (va_code_KeyExpansionRoundEven256 round
rcon) va_s0 round rcon dst key in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 2 va_sM
(va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundEven256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32)) :
(va_quickCode unit (va_code_KeyExpansionRoundEven256 round rcon)) =
(va_QProc (va_code_KeyExpansionRoundEven256 round rcon) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm
2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem]) (va_wp_KeyExpansionRoundEven256 round rcon
dst key) (va_wpProof_KeyExpansionRoundEven256 round rcon dst key))
//--
//-- KeyExpansionRoundOdd256
val va_code_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansionRoundOdd256 round rcon =
(va_Block (va_CCons (va_code_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0) (va_CCons
(va_code_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_CCons (va_code_VPslldq4
(va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm
4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4)
(va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_CCons
(va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 3) (16 `op_Multiply`
(round + 1)) Secret) (va_CNil ()))))))))))))
val va_codegen_success_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansionRoundOdd256 round rcon =
(va_pbool_and (va_codegen_success_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0)
(va_pbool_and (va_codegen_success_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) (16 `op_Multiply` (round + 1)) Secret) (va_ttrue ())))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansionRoundOdd256 (va_mods:va_mods_t) (round:nat64) (rcon:nat8) (dst:buffer128)
(key:(seq nat32)) : (va_quickCode unit (va_code_KeyExpansionRoundOdd256 round rcon)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 118 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 119 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 120 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 121 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 122 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 123 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 124 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 125 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 126 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 127 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) (16 `op_Multiply` (round + 1)) Secret dst (round + 1)) (fun (va_s:va_state) _
-> let (va_arg20:Prims.int) = round + 1 in let (va_arg19:Vale.Def.Types_s.quad32) = va_get_xmm
1 va_old_s in let (va_arg18:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 130 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_simd_round_key va_arg18 va_arg19 0 va_arg20)
(let (va_arg17:Prims.int) = round + 1 in let (va_arg16:Vale.Def.Types_s.quad32) = va_get_xmm 1
va_old_s in let (va_arg15:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 131 column 33 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_round_key_256_rcon_odd va_arg15 va_arg16 0
va_arg17) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 132 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QEmpty
(()))))))))))))))))
val va_lemma_KeyExpansionRoundOdd256 : va_b0:va_code -> va_s0:va_state -> round:nat64 -> rcon:nat8
-> dst:buffer128 -> key:(seq nat32)
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundOdd256 round rcon) va_s0 /\ va_get_ok
va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64 rRdx va_s0)
dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\ sse_enabled) /\ (1
<= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 =!= 0 /\ Vale.AES.AES_s.is_aes_key_LE
AES_256 key /\ va_get_xmm 3 va_s0 == Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\
va_get_xmm 1 va_s0 == Vale.AES.AES256_helpers.expand_key_256 key round))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ va_get_xmm 3 va_sM == Vale.X64.Decls.buffer128_read dst
(round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 3 va_sM ==
Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) /\ va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4
va_sM (va_update_xmm 3 va_sM (va_update_xmm 2 va_sM (va_update_mem_heaplet 1 va_sM
(va_update_ok va_sM (va_update_mem va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansionRoundOdd256 va_b0 va_s0 round rcon dst key =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2;
va_Mod_mem_heaplet 1; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansionRoundOdd256 va_mods round rcon dst key in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansionRoundOdd256 round rcon)
va_qc va_s0 (fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 93 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 104 column 65 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 114 column 54 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 3 va_sM == Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1
va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 115 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 3 va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 116 column 82 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM) (round + 1) (round + 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet
1; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundOdd256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32))
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 =!= 0 /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round /\ (forall (va_x_mem:vale_heap)
(va_x_heap1:vale_heap) (va_x_xmm2:quad32) (va_x_xmm3:quad32) (va_x_xmm4:quad32)
(va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags va_x_efl (va_upd_xmm 4 va_x_xmm4
(va_upd_xmm 3 va_x_xmm3 (va_upd_xmm 2 va_x_xmm2 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem
va_x_mem va_s0))))) in va_get_ok va_sM /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1
va_sM) (va_get_reg64 rRdx va_sM) dst 15 (va_get_mem_layout va_sM) Secret /\ va_get_xmm 3 va_sM
== Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 3
va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> dst:buffer128 -> key:(seq
nat32) -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundOdd256 round rcon dst key va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundOdd256 round rcon)
([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet 1; va_Mod_mem])
va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundOdd256 round rcon dst key va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundOdd256 (va_code_KeyExpansionRoundOdd256 round
rcon) va_s0 round rcon dst key in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet
1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundOdd256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32)) :
(va_quickCode unit (va_code_KeyExpansionRoundOdd256 round rcon)) =
(va_QProc (va_code_KeyExpansionRoundOdd256 round rcon) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm
3; va_Mod_xmm 2; va_Mod_mem_heaplet 1; va_Mod_mem]) (va_wp_KeyExpansionRoundOdd256 round rcon
dst key) (va_wpProof_KeyExpansionRoundOdd256 round rcon dst key))
//--
//-- KeyExpansionRoundUnrolledRecursive256
val va_code_KeyExpansionRoundUnrolledRecursive256 : n:int -> Tot va_code(decreases %[n])
[@ "opaque_to_smt"]
let rec va_code_KeyExpansionRoundUnrolledRecursive256 n =
(va_Block (va_CCons (if (1 < n && n <= 14) then va_Block (va_CCons
(va_code_KeyExpansionRoundUnrolledRecursive256 (n - 1)) (va_CCons (if (n `op_Modulus` 2 = 0)
then va_Block (va_CCons (va_code_KeyExpansionRoundEven256 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1))) (va_CNil ())) else va_Block (va_CCons
(va_code_KeyExpansionRoundOdd256 (n - 1) (Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 -
1))) (va_CNil ()))) (va_CNil ()))) else va_Block (va_CNil ())) (va_CNil ())))
val va_codegen_success_KeyExpansionRoundUnrolledRecursive256 : n:int -> Tot va_pbool(decreases %[n])
[@ "opaque_to_smt"]
let rec va_codegen_success_KeyExpansionRoundUnrolledRecursive256 n =
(va_pbool_and (if (1 < n && n <= 14) then va_pbool_and
(va_codegen_success_KeyExpansionRoundUnrolledRecursive256 (n - 1)) (va_pbool_and (if (n
`op_Modulus` 2 = 0) then va_pbool_and (va_codegen_success_KeyExpansionRoundEven256 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1))) (va_ttrue ()) else va_pbool_and
(va_codegen_success_KeyExpansionRoundOdd256 (n - 1) (Vale.AES.AES_common_s.aes_rcon (n
`op_Division` 2 - 1))) (va_ttrue ())) (va_ttrue ())) else va_ttrue ()) (va_ttrue ()))
val va_lemma_KeyExpansionRoundUnrolledRecursive256 : va_b0:va_code -> va_s0:va_state -> key:(seq
nat32) -> dst:buffer128 -> n:int
-> Ghost (va_state & va_fuel)(decreases %[n])
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundUnrolledRecursive256 n) va_s0 /\
va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (0 < n /\ n <= 14) /\ Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1
va_s0 == Vale.AES.AES256_helpers.expand_key_256 key 0 /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key 1 /\ va_get_xmm 1 va_s0 ==
Vale.X64.Decls.buffer128_read dst 0 (va_get_mem_heaplet 1 va_s0) /\ va_get_xmm 3 va_s0 ==
Vale.X64.Decls.buffer128_read dst 1 (va_get_mem_heaplet 1 va_s0) /\ va_get_reg64 rRdx va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 dst (va_get_mem_heaplet 1 va_s0)))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ Vale.X64.Decls.modifies_buffer128 dst (va_get_mem_heaplet 1
va_s0) (va_get_mem_heaplet 1 va_sM) /\ Vale.X64.Decls.buffer128_read dst n (va_get_mem_heaplet
1 va_sM) == (if (n `op_Modulus` 2 = 0) then va_get_xmm 1 va_sM else va_get_xmm 3 va_sM) /\
Vale.X64.Decls.buffer128_read dst (n - 1) (va_get_mem_heaplet 1 va_sM) == (if ((n - 1)
`op_Modulus` 2 = 0) then va_get_xmm 1 va_sM else va_get_xmm 3 va_sM) /\ (forall j .
{:pattern(buffer128_read dst j (va_get_mem_heaplet 1 va_sM))}0 <= j /\ j <= n ==>
Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_sM) ==
Vale.AES.AES256_helpers.expand_key_256 key j) /\ va_state_eq va_sM (va_update_flags va_sM
(va_update_xmm 4 va_sM (va_update_xmm 3 va_sM (va_update_xmm 2 va_sM (va_update_xmm 1 va_sM
(va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM va_s0))))))))))
[@"opaque_to_smt"]
let rec va_lemma_KeyExpansionRoundUnrolledRecursive256 va_b0 va_s0 key dst n =
va_reveal_opaque (`%va_code_KeyExpansionRoundUnrolledRecursive256)
(va_code_KeyExpansionRoundUnrolledRecursive256 n);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
let va_b2 = va_tl va_b1 in
let va_c2 = va_hd va_b1 in
let (va_fc2, va_s2) =
(
if (1 < n && n <= 14) then
(
let va_b3 = va_get_block va_c2 in
let (va_s4, va_fc4) = va_lemma_KeyExpansionRoundUnrolledRecursive256 (va_hd va_b3) va_s0 key
dst (n - 1) in
let va_b4 = va_tl va_b3 in
let (old_mem:vale_heap) = va_get_mem_heaplet 1 va_s4 in
let va_b6 = va_tl va_b4 in
let va_c6 = va_hd va_b4 in
let (va_fc6, va_s6) =
(
if (n `op_Modulus` 2 = 0) then
(
let va_b7 = va_get_block va_c6 in
let (va_s8, va_fc8) = va_lemma_KeyExpansionRoundEven256 (va_hd va_b7) va_s4 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1)) dst key in
let va_b8 = va_tl va_b7 in
let (va_s6, va_f8) = va_lemma_empty_total va_s8 va_b8 in
let va_fc6 = va_lemma_merge_total va_b7 va_s4 va_fc8 va_s8 va_f8 va_s6 in
(va_fc6, va_s6)
)
else
(
let va_b9 = va_get_block va_c6 in
let (va_s10, va_fc10) = va_lemma_KeyExpansionRoundOdd256 (va_hd va_b9) va_s4 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1)) dst key in
let va_b10 = va_tl va_b9 in
let (va_s6, va_f10) = va_lemma_empty_total va_s10 va_b10 in
let va_fc6 = va_lemma_merge_total va_b9 va_s4 va_fc10 va_s10 va_f10 va_s6 in
(va_fc6, va_s6)
)
) in
assert (forall j . {:pattern(buffer128_read dst j (va_get_mem_heaplet 1 va_s6))}0 <= j /\ j <
n ==> Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_s6) ==
Vale.X64.Decls.buffer128_read dst j old_mem);
let (va_s2, va_f6) = va_lemma_empty_total va_s6 va_b6 in
let va_f4 = va_lemma_merge_total va_b4 va_s4 va_fc6 va_s6 va_f6 va_s2 in
let va_fc2 = va_lemma_merge_total va_b3 va_s0 va_fc4 va_s4 va_f4 va_s2 in
(va_fc2, va_s2)
)
else
(
let va_b12 = va_get_block va_c2 in
let (va_s2, va_fc2) = va_lemma_empty_total va_s0 va_b12 in
(va_fc2, va_s2)
)
) in
let (va_sM, va_f2) = va_lemma_empty_total va_s2 va_b2 in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc2 va_s2 va_f2 va_sM in
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundUnrolledRecursive256 (key:(seq nat32)) (dst:buffer128) (n:int)
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (0 < n /\ n <= 14) /\ Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1
va_s0 == Vale.AES.AES256_helpers.expand_key_256 key 0 /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key 1 /\ va_get_xmm 1 va_s0 ==
Vale.X64.Decls.buffer128_read dst 0 (va_get_mem_heaplet 1 va_s0) /\ va_get_xmm 3 va_s0 ==
Vale.X64.Decls.buffer128_read dst 1 (va_get_mem_heaplet 1 va_s0) /\ va_get_reg64 rRdx va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 dst (va_get_mem_heaplet 1 va_s0) /\
(forall (va_x_mem:vale_heap) (va_x_heap1:vale_heap) (va_x_xmm1:quad32) (va_x_xmm2:quad32)
(va_x_xmm3:quad32) (va_x_xmm4:quad32) (va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags
va_x_efl (va_upd_xmm 4 va_x_xmm4 (va_upd_xmm 3 va_x_xmm3 (va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 1
va_x_xmm1 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem va_x_mem va_s0)))))) in va_get_ok va_sM
/\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst
15 (va_get_mem_layout va_sM) Secret /\ Vale.X64.Decls.modifies_buffer128 dst
(va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet 1 va_sM) /\ Vale.X64.Decls.buffer128_read dst
n (va_get_mem_heaplet 1 va_sM) == va_if (n `op_Modulus` 2 = 0) (fun _ -> va_get_xmm 1 va_sM)
(fun _ -> va_get_xmm 3 va_sM) /\ Vale.X64.Decls.buffer128_read dst (n - 1) (va_get_mem_heaplet
1 va_sM) == va_if ((n - 1) `op_Modulus` 2 = 0) (fun _ -> va_get_xmm 1 va_sM) (fun _ ->
va_get_xmm 3 va_sM) /\ (forall j . {:pattern(buffer128_read dst j (va_get_mem_heaplet 1
va_sM))}0 <= j /\ j <= n ==> Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_sM)
== Vale.AES.AES256_helpers.expand_key_256 key j) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundUnrolledRecursive256 : key:(seq nat32) -> dst:buffer128 -> n:int ->
va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundUnrolledRecursive256 key dst n va_s0
va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundUnrolledRecursive256
n) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_mem]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundUnrolledRecursive256 key dst n va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundUnrolledRecursive256
(va_code_KeyExpansionRoundUnrolledRecursive256 n) va_s0 key dst n in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok
va_sM (va_update_mem va_sM va_s0)))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundUnrolledRecursive256 (key:(seq nat32)) (dst:buffer128) (n:int) :
(va_quickCode unit (va_code_KeyExpansionRoundUnrolledRecursive256 n)) =
(va_QProc (va_code_KeyExpansionRoundUnrolledRecursive256 n) ([va_Mod_flags; va_Mod_xmm 4;
va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem])
(va_wp_KeyExpansionRoundUnrolledRecursive256 key dst n)
(va_wpProof_KeyExpansionRoundUnrolledRecursive256 key dst n))
//--
//-- KeyExpansion256Stdcall
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansion256Stdcall win =
(va_Block (va_CCons (if win then va_Block (va_CCons (va_code_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64 rRcx) 0 Secret)
(va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3)
(va_op_reg_opr64_reg64 rRcx) 16 Secret) (va_CNil ()))) else va_Block (va_CCons
(va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64
rRdi) 0 Secret) (va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm
3) (va_op_reg_opr64_reg64 rRdi) 16 Secret) (va_CCons (va_code_Mov64 (va_op_dst_opr64_reg64
rRdx) (va_op_opr64_reg64 rRsi)) (va_CNil ()))))) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) 0 Secret)
(va_CCons (va_code_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) 16 Secret) (va_CCons (va_code_KeyExpansionRoundUnrolledRecursive256 14)
(va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm
3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 4) (va_op_xmm_xmm 4)) (va_CNil ()))))))))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansion256Stdcall win =
(va_pbool_and (if win then va_pbool_and (va_codegen_success_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64 rRcx) 0 Secret)
(va_pbool_and (va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm
3) (va_op_reg_opr64_reg64 rRcx) 16 Secret) (va_ttrue ())) else va_pbool_and
(va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1)
(va_op_reg_opr64_reg64 rRdi) 0 Secret) (va_pbool_and (va_codegen_success_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3) (va_op_reg_opr64_reg64 rRdi) 16 Secret)
(va_pbool_and (va_codegen_success_Mov64 (va_op_dst_opr64_reg64 rRdx) (va_op_opr64_reg64 rRsi))
(va_ttrue ())))) (va_pbool_and (va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet
1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) 0 Secret) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) 16 Secret) (va_pbool_and
(va_codegen_success_KeyExpansionRoundUnrolledRecursive256 14) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 4) (va_op_xmm_xmm 4)) (va_ttrue ())))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansion256Stdcall (va_mods:va_mods_t) (win:bool) (input_key_b:buffer128)
(output_key_expansion_b:buffer128) : (va_quickCode unit (va_code_KeyExpansion256Stdcall win)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(key_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRcx va_s)
(fun _ -> va_get_reg64 rRdi va_s) in let (key_expansion_ptr:(va_int_range 0
18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRdx va_s) (fun _ -> va_get_reg64
rRsi va_s) in let (key:(FStar.Seq.Base.seq Vale.Def.Types_s.nat32)) =
Vale.AES.AES256_helpers.make_AES256_key (Vale.X64.Decls.buffer128_read input_key_b 0
(va_get_mem_heaplet 0 va_s)) (Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0
va_s)) in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 201 column 15 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_qInlineIf va_mods win (qblock va_mods (fun (va_s:va_state) -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 203 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64
rRcx) 0 Secret input_key_b 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 204 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3) (va_op_reg_opr64_reg64
rRcx) 16 Secret input_key_b 1) (va_QEmpty (()))))) (qblock va_mods (fun (va_s:va_state) ->
va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 208 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64
rRdi) 0 Secret input_key_b 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 209 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3) (va_op_reg_opr64_reg64
rRdi) 16 Secret input_key_b 1) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 210 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Mov64 (va_op_dst_opr64_reg64 rRdx) (va_op_opr64_reg64 rRsi)) (va_QEmpty (())))))))
(fun (va_s:va_state) va_g -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 213 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) 0 Secret output_key_expansion_b 0) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 214 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) 16 Secret output_key_expansion_b 1) (fun (va_s:va_state) _ -> va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 216 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 217 column 42 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_KeyExpansionRoundUnrolledRecursive256 key output_key_expansion_b 14) (fun
(va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 218 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_expand_key_256 key 15) (va_QLemma va_range1
"***** PRECONDITION NOT MET AT line 219 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
true (fun _ -> va_reveal_eq (`%key_to_round_keys_LE) key_to_round_keys_LE key_to_round_keys_LE)
(fun _ -> va_reveal_opaque (`%key_to_round_keys_LE) key_to_round_keys_LE) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 222 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 223 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 224 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 225 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 4) (va_op_xmm_xmm 4)) (va_QEmpty (()))))))))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansion256Stdcall va_b0 va_s0 win input_key_b output_key_expansion_b =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_reg64 rRdx; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansion256Stdcall va_mods win input_key_b output_key_expansion_b in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansion256Stdcall win) va_qc va_s0
(fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 177 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ (let (key_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ ->
va_get_reg64 rRcx va_s0) (fun _ -> va_get_reg64 rRdi va_s0) in let
(key_expansion_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ -> va_get_reg64
rRdx va_s0) (fun _ -> va_get_reg64 rRsi va_s0) in let (key:(FStar.Seq.Base.seq
Vale.Def.Types_s.nat32)) = Vale.AES.AES256_helpers.make_AES256_key
(Vale.X64.Decls.buffer128_read input_key_b 0 (va_get_mem_heaplet 0 va_s0))
(Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0 va_s0)) in label va_range1
"***** POSTCONDITION NOT MET AT line 193 column 52 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(aesni_enabled /\ avx_enabled /\ sse_enabled) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 194 column 76 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_sM) key_ptr input_key_b 2
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 195 column 98 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) key_expansion_ptr
output_key_expansion_b 15 (va_get_mem_layout va_sM) Secret)) /\ (let (key_ptr:(va_int_range 0
18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRcx va_s0) (fun _ -> va_get_reg64
rRdi va_s0) in let (key_expansion_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _
-> va_get_reg64 rRdx va_s0) (fun _ -> va_get_reg64 rRsi va_s0) in let (key:(FStar.Seq.Base.seq
Vale.Def.Types_s.nat32)) = Vale.AES.AES256_helpers.make_AES256_key
(Vale.X64.Decls.buffer128_read input_key_b 0 (va_get_mem_heaplet 0 va_s0))
(Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0 va_s0)) in label va_range1
"***** POSTCONDITION NOT MET AT line 197 column 70 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer128 output_key_expansion_b (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 199 column 109 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(forall (j:nat) . {:pattern(buffer128_read output_key_expansion_b j (va_get_mem_heaplet 1
va_sM))}j <= 14 ==> Vale.X64.Decls.buffer128_read output_key_expansion_b j (va_get_mem_heaplet
1 va_sM) == FStar.Seq.Base.index #Vale.Def.Types_s.quad32 (Vale.AES.AES_s.key_to_round_keys_LE
AES_256 key) j))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_reg64 rRdx; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_KeyExpansion256Stdcall win input_key_b output_key_expansion_b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansion256Stdcall (va_code_KeyExpansion256Stdcall win) va_s0
win input_key_b output_key_expansion_b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_reg64
rRdx va_sM (va_update_ok va_sM (va_update_mem va_sM va_s0))))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_reg64 rRdx; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- AES256EncryptRound
val va_code_AES256EncryptRound : n:nat -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_AES256EncryptRound n =
(va_Block (va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) (16 `op_Multiply` n) Secret) (va_CCons (va_code_AESNI_enc
(va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_CNil ()))))
val va_codegen_success_AES256EncryptRound : n:nat -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_AES256EncryptRound n =
(va_pbool_and (va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) (16 `op_Multiply` n) Secret) (va_pbool_and
(va_codegen_success_AESNI_enc (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_AES256EncryptRound (va_mods:va_mods_t) (n:nat) (init:quad32) (round_keys:(seq quad32))
(keys_buffer:buffer128) : (va_quickCode unit (va_code_AES256EncryptRound n)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(va_arg5:Vale.Def.Types_s.quad32) = va_get_xmm 0 va_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 252 column 33 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES_s.commute_sub_bytes_shift_rows va_arg5) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 253 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) (16 `op_Multiply` n) Secret keys_buffer n) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 254 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_enc (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_QEmpty (()))))))
val va_lemma_AES256EncryptRound : va_b0:va_code -> va_s0:va_state -> n:nat -> init:quad32 ->
round_keys:(seq quad32) -> keys_buffer:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AES256EncryptRound n) va_s0 /\ va_get_ok va_s0 /\
(aesni_enabled /\ sse_enabled) /\ (1 <= n /\ n < 14 /\ 14 <= FStar.Seq.Base.length #quad32
round_keys) /\ va_get_xmm 0 va_s0 == Vale.AES.AES_s.eval_rounds_def init round_keys (n - 1) /\
va_get_reg64 rR8 va_s0 == Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 keys_buffer
(va_get_mem_heaplet 0 va_s0) /\ Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0)
(va_get_reg64 rR8 va_s0) keys_buffer 15 (va_get_mem_layout va_s0) Secret /\
Vale.X64.Decls.buffer128_read keys_buffer n (va_get_mem_heaplet 0 va_s0) ==
FStar.Seq.Base.index #quad32 round_keys n))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_get_xmm 0 va_sM == Vale.AES.AES_s.eval_rounds_def init round_keys n /\ va_state_eq va_sM
(va_update_flags va_sM (va_update_xmm 2 va_sM (va_update_xmm 0 va_sM (va_update_ok va_sM
va_s0))))))
[@"opaque_to_smt"]
let va_lemma_AES256EncryptRound va_b0 va_s0 n init round_keys keys_buffer =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok] in
let va_qc = va_qcode_AES256EncryptRound va_mods n init round_keys keys_buffer in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_AES256EncryptRound n) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 232 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 250 column 53 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 0 va_sM == Vale.AES.AES_s.eval_rounds_def init round_keys n)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_AES256EncryptRound (n:nat) (init:quad32) (round_keys:(seq quad32))
(keys_buffer:buffer128) (va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ (aesni_enabled /\ sse_enabled) /\ (1 <= n /\ n < 14 /\ 14 <=
FStar.Seq.Base.length #quad32 round_keys) /\ va_get_xmm 0 va_s0 ==
Vale.AES.AES_s.eval_rounds_def init round_keys (n - 1) /\ va_get_reg64 rR8 va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 keys_buffer (va_get_mem_heaplet 0 va_s0)
/\ Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0) (va_get_reg64 rR8 va_s0)
keys_buffer 15 (va_get_mem_layout va_s0) Secret /\ Vale.X64.Decls.buffer128_read keys_buffer n
(va_get_mem_heaplet 0 va_s0) == FStar.Seq.Base.index #quad32 round_keys n /\ (forall
(va_x_xmm0:quad32) (va_x_xmm2:quad32) (va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags
va_x_efl (va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 0 va_x_xmm0 va_s0)) in va_get_ok va_sM /\
va_get_xmm 0 va_sM == Vale.AES.AES_s.eval_rounds_def init round_keys n ==> va_k va_sM (())))
val va_wpProof_AES256EncryptRound : n:nat -> init:quad32 -> round_keys:(seq quad32) ->
keys_buffer:buffer128 -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AES256EncryptRound n init round_keys keys_buffer va_s0
va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AES256EncryptRound n) ([va_Mod_flags;
va_Mod_xmm 2; va_Mod_xmm 0]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_AES256EncryptRound n init round_keys keys_buffer va_s0 va_k =
let (va_sM, va_f0) = va_lemma_AES256EncryptRound (va_code_AES256EncryptRound n) va_s0 n init
round_keys keys_buffer in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 2 va_sM (va_update_xmm 0 va_sM
(va_update_ok va_sM va_s0)))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_AES256EncryptRound (n:nat) (init:quad32) (round_keys:(seq quad32))
(keys_buffer:buffer128) : (va_quickCode unit (va_code_AES256EncryptRound n)) =
(va_QProc (va_code_AES256EncryptRound n) ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0])
(va_wp_AES256EncryptRound n init round_keys keys_buffer) (va_wpProof_AES256EncryptRound n init
round_keys keys_buffer))
//--
//-- AES256EncryptBlock
[@ "opaque_to_smt" va_qattr]
let va_code_AES256EncryptBlock () =
(va_Block (va_CCons (va_Block (va_CNil ())) (va_CCons (va_code_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64 rR8) 0 Secret) (va_CCons
(va_code_Pxor (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_CCons (va_code_AES256EncryptRound 1)
(va_CCons (va_code_AES256EncryptRound 2) (va_CCons (va_code_AES256EncryptRound 3) (va_CCons
(va_code_AES256EncryptRound 4) (va_CCons (va_code_AES256EncryptRound 5) (va_CCons
(va_code_AES256EncryptRound 6) (va_CCons (va_code_AES256EncryptRound 7) (va_CCons
(va_code_AES256EncryptRound 8) (va_CCons (va_code_AES256EncryptRound 9) (va_CCons
(va_code_AES256EncryptRound 10) (va_CCons (va_code_AES256EncryptRound 11) (va_CCons
(va_code_AES256EncryptRound 12) (va_CCons (va_code_AES256EncryptRound 13) (va_CCons
(va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) (16 `op_Multiply` 14) Secret) (va_CCons (va_code_AESNI_enc_last (va_op_xmm_xmm 0)
(va_op_xmm_xmm 2)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_CNil
())))))))))))))))))))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_AES256EncryptBlock () =
(va_pbool_and (va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) 0 Secret) (va_pbool_and (va_codegen_success_Pxor (va_op_xmm_xmm 0)
(va_op_xmm_xmm 2)) (va_pbool_and (va_codegen_success_AES256EncryptRound 1) (va_pbool_and
(va_codegen_success_AES256EncryptRound 2) (va_pbool_and (va_codegen_success_AES256EncryptRound
3) (va_pbool_and (va_codegen_success_AES256EncryptRound 4) (va_pbool_and
(va_codegen_success_AES256EncryptRound 5) (va_pbool_and (va_codegen_success_AES256EncryptRound
6) (va_pbool_and (va_codegen_success_AES256EncryptRound 7) (va_pbool_and
(va_codegen_success_AES256EncryptRound 8) (va_pbool_and (va_codegen_success_AES256EncryptRound
9) (va_pbool_and (va_codegen_success_AES256EncryptRound 10) (va_pbool_and
(va_codegen_success_AES256EncryptRound 11) (va_pbool_and (va_codegen_success_AES256EncryptRound
12) (va_pbool_and (va_codegen_success_AES256EncryptRound 13) (va_pbool_and
(va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) (16 `op_Multiply` 14) Secret) (va_pbool_and
(va_codegen_success_AESNI_enc_last (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_ttrue ()))))))))))))))))))) | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsVector.fsti.checked",
"Vale.X64.InsMem.fsti.checked",
"Vale.X64.InsBasic.fsti.checked",
"Vale.X64.InsAes.fsti.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.AES_s.fst.checked",
"Vale.AES.AES_common_s.fst.checked",
"Vale.AES.AES256_helpers.fsti.checked",
"prims.fst.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Vale.AES.X64.AES256.fst"
} | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES256_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsAes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES256_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsAes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 20,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
va_mods: Vale.X64.QuickCode.va_mods_t ->
input: Vale.X64.Decls.quad32 ->
key: FStar.Seq.Base.seq Vale.X64.Memory.nat32 ->
round_keys: FStar.Seq.Base.seq Vale.X64.Decls.quad32 ->
keys_buffer: Vale.X64.Memory.buffer128
-> Vale.X64.QuickCode.va_quickCode Prims.unit (Vale.AES.X64.AES256.va_code_AES256EncryptBlock ()) | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.QuickCode.va_mods_t",
"Vale.X64.Decls.quad32",
"FStar.Seq.Base.seq",
"Vale.X64.Memory.nat32",
"Vale.X64.Memory.buffer128",
"Vale.X64.QuickCodes.qblock",
"Prims.unit",
"Prims.Cons",
"Vale.X64.Decls.va_code",
"Vale.X64.Machine_s.Block",
"Vale.X64.Decls.ins",
"Vale.X64.Decls.ocmp",
"Prims.Nil",
"Vale.X64.Machine_s.precode",
"Vale.X64.InsVector.va_code_Load128_buffer",
"Vale.X64.Decls.va_op_heaplet_mem_heaplet",
"Vale.X64.Decls.va_op_xmm_xmm",
"Vale.X64.Decls.va_op_reg_opr64_reg64",
"Vale.X64.Machine_s.rR8",
"Vale.Arch.HeapTypes_s.Secret",
"Vale.X64.InsVector.va_code_Pxor",
"Vale.AES.X64.AES256.va_code_AES256EncryptRound",
"Prims.op_Multiply",
"Vale.X64.InsAes.va_code_AESNI_enc_last",
"Vale.X64.Decls.va_state",
"Vale.X64.QuickCodes.va_qAssertSquash",
"Vale.X64.QuickCodes.va_range1",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Seq.Base.length",
"Vale.Def.Types_s.quad32",
"Prims.nat",
"Prims.squash",
"Vale.X64.QuickCodes.va_QSeq",
"Vale.X64.InsVector.va_quick_Load128_buffer",
"Vale.X64.InsVector.va_quick_Pxor",
"Vale.AES.X64.AES256.va_quick_AES256EncryptRound",
"Vale.X64.QuickCodes.va_QBind",
"Vale.X64.QuickCodes.va_qPURE",
"Prims.pure_post",
"Prims.l_and",
"Prims.l_True",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.eq2",
"Vale.AES.AES_common_s.sub_bytes",
"Vale.AES.AES_s.shift_rows_LE",
"Vale.AES.AES_s.commute_sub_bytes_shift_rows",
"Vale.X64.InsAes.va_quick_AESNI_enc_last",
"Vale.AES.AES_common_s.algorithm",
"Vale.Def.Words_s.nat32",
"Vale.AES.AES_s.is_aes_key_LE",
"Vale.AES.AES_s.aes_encrypt_LE",
"Vale.AES.AES_s.aes_encrypt_LE_def",
"Vale.AES.AES_s.aes_encrypt_LE_reveal",
"Vale.X64.QuickCodes.va_QEmpty",
"Vale.X64.QuickCodes.quickCodes",
"Vale.X64.Decls.va_get_xmm",
"Vale.Def.Types_s.quad32_xor",
"FStar.Seq.Base.index",
"Vale.X64.State.vale_state",
"Vale.X64.QuickCode.va_quickCode",
"Vale.AES.X64.AES256.va_code_AES256EncryptBlock"
] | [] | false | false | false | false | false | let va_qcode_AES256EncryptBlock
(va_mods: va_mods_t)
(input: quad32)
(key: (seq nat32))
(round_keys: (seq quad32))
(keys_buffer: buffer128)
: (va_quickCode unit (va_code_AES256EncryptBlock ())) =
| (qblock va_mods
(fun (va_s: va_state) ->
let va_old_s:va_state = va_s in
va_qAssertSquash va_range1
"***** EXPRESSION PRECONDITIONS NOT MET WITHIN line 280 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
((fun a_539 (s_540: (FStar.Seq.Base.seq a_539)) (i_541: Prims.nat) ->
let i_515:Prims.nat = i_541 in
Prims.b2t (Prims.op_LessThan i_515 (FStar.Seq.Base.length #a_539 s_540))) Vale.Def.Types_s.quad32
round_keys
0)
(fun _ ->
let init:Vale.Def.Types_s.quad32 =
Vale.Def.Types_s.quad32_xor input
(FStar.Seq.Base.index #Vale.Def.Types_s.quad32 round_keys 0)
in
va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 282 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0)
(va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8)
0
Secret
keys_buffer
0)
(va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 283 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 0) (va_op_xmm_xmm 2))
(va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 284 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 1 init round_keys keys_buffer)
(va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 285 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 2 init round_keys keys_buffer)
(va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 286 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 3 init round_keys keys_buffer)
(va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 287 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 4 init round_keys keys_buffer)
(va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 288 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 5 init round_keys keys_buffer)
(va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 289 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 6
init
round_keys
keys_buffer)
(va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 290 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 7
init
round_keys
keys_buffer)
(va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 291 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 8
init
round_keys
keys_buffer)
(va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 292 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 9
init
round_keys
keys_buffer)
(va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 293 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 10
init
round_keys
keys_buffer)
(va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 294 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 11
init
round_keys
keys_buffer)
(va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 295 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 12
init
round_keys
keys_buffer)
(va_QBind va_range1
"***** PRECONDITION NOT MET AT line 296 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound
13
init
round_keys
keys_buffer)
(fun (va_s: va_state) _ ->
let va_arg24:Vale.Def.Types_s.quad32
=
va_get_xmm 0 va_s
in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 297 column 33 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_: unit) ->
Vale.AES.AES_s.commute_sub_bytes_shift_rows
va_arg24)
(va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 298 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer
(va_op_heaplet_mem_heaplet
0)
(va_op_xmm_xmm
2)
(va_op_reg_opr64_reg64
rR8)
(16
`op_Multiply`
14)
Secret
keys_buffer
14)
(va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 299 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_enc_last
(va_op_xmm_xmm
0)
(va_op_xmm_xmm
2))
(va_QBind va_range1
"***** PRECONDITION NOT MET AT line 302 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor
(va_op_xmm_xmm
2)
(va_op_xmm_xmm
2)
)
(fun
(va_s:
va_state
)
_
->
va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 303 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun
(
_:
unit
)
->
Vale.AES.AES_s.aes_encrypt_LE_reveal
()
)
(va_QEmpty
(
()
)
))
))))))))))))))
))))))) | false |
Vale.AES.X64.AES256.fst | Vale.AES.X64.AES256.va_wpProof_AES256EncryptBlockStdcall | val va_wpProof_AES256EncryptBlockStdcall : win:bool -> input:quad32 -> key:(seq nat32) ->
input_buffer:buffer128 -> output_buffer:buffer128 -> keys_buffer:buffer128 -> va_s0:va_state ->
va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AES256EncryptBlockStdcall win input key input_buffer
output_buffer keys_buffer va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AES256EncryptBlockStdcall win)
([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_mem_heaplet 1; va_Mod_reg64 rR8;
va_Mod_mem]) va_s0 va_k ((va_sM, va_f0, va_g)))) | val va_wpProof_AES256EncryptBlockStdcall : win:bool -> input:quad32 -> key:(seq nat32) ->
input_buffer:buffer128 -> output_buffer:buffer128 -> keys_buffer:buffer128 -> va_s0:va_state ->
va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AES256EncryptBlockStdcall win input key input_buffer
output_buffer keys_buffer va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AES256EncryptBlockStdcall win)
([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_mem_heaplet 1; va_Mod_reg64 rR8;
va_Mod_mem]) va_s0 va_k ((va_sM, va_f0, va_g)))) | let va_wpProof_AES256EncryptBlockStdcall win input key input_buffer output_buffer keys_buffer va_s0
va_k =
let (va_sM, va_f0) = va_lemma_AES256EncryptBlockStdcall (va_code_AES256EncryptBlockStdcall win)
va_s0 win input key input_buffer output_buffer keys_buffer in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 2 va_sM (va_update_xmm 0 va_sM
(va_update_mem_heaplet 1 va_sM (va_update_reg64 rR8 va_sM (va_update_ok va_sM (va_update_mem
va_sM va_s0))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_mem_heaplet 1; va_Mod_reg64
rR8; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g) | {
"file_name": "obj/Vale.AES.X64.AES256.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 981,
"start_col": 0,
"start_line": 970
} | module Vale.AES.X64.AES256
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsVector
open Vale.X64.InsAes
open Vale.X64.QuickCode
open Vale.X64.QuickCodes
open Vale.Arch.Types
open Vale.AES.AES256_helpers
open Vale.X64.CPU_Features_s
#reset-options "--z3rlimit 20"
//-- KeyExpansionRoundEven256
val va_code_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansionRoundEven256 round rcon =
(va_Block (va_CCons (va_code_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon)
(va_CCons (va_code_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_CCons (va_code_VPslldq4
(va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm
4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4)
(va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_CCons
(va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) (16 `op_Multiply`
(round + 1)) Secret) (va_CNil ()))))))))))))
val va_codegen_success_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansionRoundEven256 round rcon =
(va_pbool_and (va_codegen_success_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon)
(va_pbool_and (va_codegen_success_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) (16 `op_Multiply` (round + 1)) Secret) (va_ttrue ())))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansionRoundEven256 (va_mods:va_mods_t) (round:nat64) (rcon:nat8) (dst:buffer128)
(key:(seq nat32)) : (va_quickCode unit (va_code_KeyExpansionRoundEven256 round rcon)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 75 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 76 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 77 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 78 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 79 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 80 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 81 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 82 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 83 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 84 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) (16 `op_Multiply` (round + 1)) Secret dst (round + 1)) (fun (va_s:va_state) _
-> let (va_arg17:Prims.int) = round + 1 in let (va_arg16:Vale.Def.Types_s.nat32) = rcon in let
(va_arg15:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in let
(va_arg14:Vale.Def.Types_s.quad32) = va_get_xmm 1 va_old_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 87 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_simd_round_key va_arg14 va_arg15 va_arg16
va_arg17) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 88 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QEmpty (())))))))))))))))
val va_lemma_KeyExpansionRoundEven256 : va_b0:va_code -> va_s0:va_state -> round:nat64 -> rcon:nat8
-> dst:buffer128 -> key:(seq nat32)
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundEven256 round rcon) va_s0 /\
va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 == 0 /\ rcon ==
Vale.AES.AES_common_s.aes_rcon ((round + 1) `op_Division` 2 - 1) /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ va_get_xmm 1 va_sM == Vale.X64.Decls.buffer128_read dst
(round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 1 va_sM ==
Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) /\ va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4
va_sM (va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM
(va_update_ok va_sM (va_update_mem va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansionRoundEven256 va_b0 va_s0 round rcon dst key =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansionRoundEven256 va_mods round rcon dst key in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansionRoundEven256 round rcon)
va_qc va_s0 (fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 50 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 61 column 65 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 71 column 54 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 1 va_sM == Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1
va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 72 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 1 va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 73 column 82 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM) (round + 1) (round + 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundEven256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32))
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 == 0 /\ rcon ==
Vale.AES.AES_common_s.aes_rcon ((round + 1) `op_Division` 2 - 1) /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round /\ (forall (va_x_mem:vale_heap)
(va_x_heap1:vale_heap) (va_x_xmm1:quad32) (va_x_xmm2:quad32) (va_x_xmm4:quad32)
(va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags va_x_efl (va_upd_xmm 4 va_x_xmm4
(va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 1 va_x_xmm1 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem
va_x_mem va_s0))))) in va_get_ok va_sM /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1
va_sM) (va_get_reg64 rRdx va_sM) dst 15 (va_get_mem_layout va_sM) Secret /\ va_get_xmm 1 va_sM
== Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 1
va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> dst:buffer128 -> key:(seq
nat32) -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundEven256 round rcon dst key va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundEven256 round rcon)
([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem])
va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundEven256 round rcon dst key va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundEven256 (va_code_KeyExpansionRoundEven256 round
rcon) va_s0 round rcon dst key in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 2 va_sM
(va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundEven256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32)) :
(va_quickCode unit (va_code_KeyExpansionRoundEven256 round rcon)) =
(va_QProc (va_code_KeyExpansionRoundEven256 round rcon) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm
2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem]) (va_wp_KeyExpansionRoundEven256 round rcon
dst key) (va_wpProof_KeyExpansionRoundEven256 round rcon dst key))
//--
//-- KeyExpansionRoundOdd256
val va_code_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansionRoundOdd256 round rcon =
(va_Block (va_CCons (va_code_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0) (va_CCons
(va_code_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_CCons (va_code_VPslldq4
(va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm
4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4)
(va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_CCons
(va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 3) (16 `op_Multiply`
(round + 1)) Secret) (va_CNil ()))))))))))))
val va_codegen_success_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansionRoundOdd256 round rcon =
(va_pbool_and (va_codegen_success_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0)
(va_pbool_and (va_codegen_success_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) (16 `op_Multiply` (round + 1)) Secret) (va_ttrue ())))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansionRoundOdd256 (va_mods:va_mods_t) (round:nat64) (rcon:nat8) (dst:buffer128)
(key:(seq nat32)) : (va_quickCode unit (va_code_KeyExpansionRoundOdd256 round rcon)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 118 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 119 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 120 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 121 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 122 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 123 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 124 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 125 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 126 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 127 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) (16 `op_Multiply` (round + 1)) Secret dst (round + 1)) (fun (va_s:va_state) _
-> let (va_arg20:Prims.int) = round + 1 in let (va_arg19:Vale.Def.Types_s.quad32) = va_get_xmm
1 va_old_s in let (va_arg18:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 130 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_simd_round_key va_arg18 va_arg19 0 va_arg20)
(let (va_arg17:Prims.int) = round + 1 in let (va_arg16:Vale.Def.Types_s.quad32) = va_get_xmm 1
va_old_s in let (va_arg15:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 131 column 33 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_round_key_256_rcon_odd va_arg15 va_arg16 0
va_arg17) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 132 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QEmpty
(()))))))))))))))))
val va_lemma_KeyExpansionRoundOdd256 : va_b0:va_code -> va_s0:va_state -> round:nat64 -> rcon:nat8
-> dst:buffer128 -> key:(seq nat32)
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundOdd256 round rcon) va_s0 /\ va_get_ok
va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64 rRdx va_s0)
dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\ sse_enabled) /\ (1
<= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 =!= 0 /\ Vale.AES.AES_s.is_aes_key_LE
AES_256 key /\ va_get_xmm 3 va_s0 == Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\
va_get_xmm 1 va_s0 == Vale.AES.AES256_helpers.expand_key_256 key round))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ va_get_xmm 3 va_sM == Vale.X64.Decls.buffer128_read dst
(round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 3 va_sM ==
Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) /\ va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4
va_sM (va_update_xmm 3 va_sM (va_update_xmm 2 va_sM (va_update_mem_heaplet 1 va_sM
(va_update_ok va_sM (va_update_mem va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansionRoundOdd256 va_b0 va_s0 round rcon dst key =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2;
va_Mod_mem_heaplet 1; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansionRoundOdd256 va_mods round rcon dst key in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansionRoundOdd256 round rcon)
va_qc va_s0 (fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 93 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 104 column 65 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 114 column 54 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 3 va_sM == Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1
va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 115 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 3 va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 116 column 82 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM) (round + 1) (round + 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet
1; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundOdd256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32))
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 =!= 0 /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round /\ (forall (va_x_mem:vale_heap)
(va_x_heap1:vale_heap) (va_x_xmm2:quad32) (va_x_xmm3:quad32) (va_x_xmm4:quad32)
(va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags va_x_efl (va_upd_xmm 4 va_x_xmm4
(va_upd_xmm 3 va_x_xmm3 (va_upd_xmm 2 va_x_xmm2 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem
va_x_mem va_s0))))) in va_get_ok va_sM /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1
va_sM) (va_get_reg64 rRdx va_sM) dst 15 (va_get_mem_layout va_sM) Secret /\ va_get_xmm 3 va_sM
== Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 3
va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> dst:buffer128 -> key:(seq
nat32) -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundOdd256 round rcon dst key va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundOdd256 round rcon)
([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet 1; va_Mod_mem])
va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundOdd256 round rcon dst key va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundOdd256 (va_code_KeyExpansionRoundOdd256 round
rcon) va_s0 round rcon dst key in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet
1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundOdd256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32)) :
(va_quickCode unit (va_code_KeyExpansionRoundOdd256 round rcon)) =
(va_QProc (va_code_KeyExpansionRoundOdd256 round rcon) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm
3; va_Mod_xmm 2; va_Mod_mem_heaplet 1; va_Mod_mem]) (va_wp_KeyExpansionRoundOdd256 round rcon
dst key) (va_wpProof_KeyExpansionRoundOdd256 round rcon dst key))
//--
//-- KeyExpansionRoundUnrolledRecursive256
val va_code_KeyExpansionRoundUnrolledRecursive256 : n:int -> Tot va_code(decreases %[n])
[@ "opaque_to_smt"]
let rec va_code_KeyExpansionRoundUnrolledRecursive256 n =
(va_Block (va_CCons (if (1 < n && n <= 14) then va_Block (va_CCons
(va_code_KeyExpansionRoundUnrolledRecursive256 (n - 1)) (va_CCons (if (n `op_Modulus` 2 = 0)
then va_Block (va_CCons (va_code_KeyExpansionRoundEven256 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1))) (va_CNil ())) else va_Block (va_CCons
(va_code_KeyExpansionRoundOdd256 (n - 1) (Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 -
1))) (va_CNil ()))) (va_CNil ()))) else va_Block (va_CNil ())) (va_CNil ())))
val va_codegen_success_KeyExpansionRoundUnrolledRecursive256 : n:int -> Tot va_pbool(decreases %[n])
[@ "opaque_to_smt"]
let rec va_codegen_success_KeyExpansionRoundUnrolledRecursive256 n =
(va_pbool_and (if (1 < n && n <= 14) then va_pbool_and
(va_codegen_success_KeyExpansionRoundUnrolledRecursive256 (n - 1)) (va_pbool_and (if (n
`op_Modulus` 2 = 0) then va_pbool_and (va_codegen_success_KeyExpansionRoundEven256 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1))) (va_ttrue ()) else va_pbool_and
(va_codegen_success_KeyExpansionRoundOdd256 (n - 1) (Vale.AES.AES_common_s.aes_rcon (n
`op_Division` 2 - 1))) (va_ttrue ())) (va_ttrue ())) else va_ttrue ()) (va_ttrue ()))
val va_lemma_KeyExpansionRoundUnrolledRecursive256 : va_b0:va_code -> va_s0:va_state -> key:(seq
nat32) -> dst:buffer128 -> n:int
-> Ghost (va_state & va_fuel)(decreases %[n])
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundUnrolledRecursive256 n) va_s0 /\
va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (0 < n /\ n <= 14) /\ Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1
va_s0 == Vale.AES.AES256_helpers.expand_key_256 key 0 /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key 1 /\ va_get_xmm 1 va_s0 ==
Vale.X64.Decls.buffer128_read dst 0 (va_get_mem_heaplet 1 va_s0) /\ va_get_xmm 3 va_s0 ==
Vale.X64.Decls.buffer128_read dst 1 (va_get_mem_heaplet 1 va_s0) /\ va_get_reg64 rRdx va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 dst (va_get_mem_heaplet 1 va_s0)))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ Vale.X64.Decls.modifies_buffer128 dst (va_get_mem_heaplet 1
va_s0) (va_get_mem_heaplet 1 va_sM) /\ Vale.X64.Decls.buffer128_read dst n (va_get_mem_heaplet
1 va_sM) == (if (n `op_Modulus` 2 = 0) then va_get_xmm 1 va_sM else va_get_xmm 3 va_sM) /\
Vale.X64.Decls.buffer128_read dst (n - 1) (va_get_mem_heaplet 1 va_sM) == (if ((n - 1)
`op_Modulus` 2 = 0) then va_get_xmm 1 va_sM else va_get_xmm 3 va_sM) /\ (forall j .
{:pattern(buffer128_read dst j (va_get_mem_heaplet 1 va_sM))}0 <= j /\ j <= n ==>
Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_sM) ==
Vale.AES.AES256_helpers.expand_key_256 key j) /\ va_state_eq va_sM (va_update_flags va_sM
(va_update_xmm 4 va_sM (va_update_xmm 3 va_sM (va_update_xmm 2 va_sM (va_update_xmm 1 va_sM
(va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM va_s0))))))))))
[@"opaque_to_smt"]
let rec va_lemma_KeyExpansionRoundUnrolledRecursive256 va_b0 va_s0 key dst n =
va_reveal_opaque (`%va_code_KeyExpansionRoundUnrolledRecursive256)
(va_code_KeyExpansionRoundUnrolledRecursive256 n);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
let va_b2 = va_tl va_b1 in
let va_c2 = va_hd va_b1 in
let (va_fc2, va_s2) =
(
if (1 < n && n <= 14) then
(
let va_b3 = va_get_block va_c2 in
let (va_s4, va_fc4) = va_lemma_KeyExpansionRoundUnrolledRecursive256 (va_hd va_b3) va_s0 key
dst (n - 1) in
let va_b4 = va_tl va_b3 in
let (old_mem:vale_heap) = va_get_mem_heaplet 1 va_s4 in
let va_b6 = va_tl va_b4 in
let va_c6 = va_hd va_b4 in
let (va_fc6, va_s6) =
(
if (n `op_Modulus` 2 = 0) then
(
let va_b7 = va_get_block va_c6 in
let (va_s8, va_fc8) = va_lemma_KeyExpansionRoundEven256 (va_hd va_b7) va_s4 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1)) dst key in
let va_b8 = va_tl va_b7 in
let (va_s6, va_f8) = va_lemma_empty_total va_s8 va_b8 in
let va_fc6 = va_lemma_merge_total va_b7 va_s4 va_fc8 va_s8 va_f8 va_s6 in
(va_fc6, va_s6)
)
else
(
let va_b9 = va_get_block va_c6 in
let (va_s10, va_fc10) = va_lemma_KeyExpansionRoundOdd256 (va_hd va_b9) va_s4 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1)) dst key in
let va_b10 = va_tl va_b9 in
let (va_s6, va_f10) = va_lemma_empty_total va_s10 va_b10 in
let va_fc6 = va_lemma_merge_total va_b9 va_s4 va_fc10 va_s10 va_f10 va_s6 in
(va_fc6, va_s6)
)
) in
assert (forall j . {:pattern(buffer128_read dst j (va_get_mem_heaplet 1 va_s6))}0 <= j /\ j <
n ==> Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_s6) ==
Vale.X64.Decls.buffer128_read dst j old_mem);
let (va_s2, va_f6) = va_lemma_empty_total va_s6 va_b6 in
let va_f4 = va_lemma_merge_total va_b4 va_s4 va_fc6 va_s6 va_f6 va_s2 in
let va_fc2 = va_lemma_merge_total va_b3 va_s0 va_fc4 va_s4 va_f4 va_s2 in
(va_fc2, va_s2)
)
else
(
let va_b12 = va_get_block va_c2 in
let (va_s2, va_fc2) = va_lemma_empty_total va_s0 va_b12 in
(va_fc2, va_s2)
)
) in
let (va_sM, va_f2) = va_lemma_empty_total va_s2 va_b2 in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc2 va_s2 va_f2 va_sM in
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundUnrolledRecursive256 (key:(seq nat32)) (dst:buffer128) (n:int)
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (0 < n /\ n <= 14) /\ Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1
va_s0 == Vale.AES.AES256_helpers.expand_key_256 key 0 /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key 1 /\ va_get_xmm 1 va_s0 ==
Vale.X64.Decls.buffer128_read dst 0 (va_get_mem_heaplet 1 va_s0) /\ va_get_xmm 3 va_s0 ==
Vale.X64.Decls.buffer128_read dst 1 (va_get_mem_heaplet 1 va_s0) /\ va_get_reg64 rRdx va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 dst (va_get_mem_heaplet 1 va_s0) /\
(forall (va_x_mem:vale_heap) (va_x_heap1:vale_heap) (va_x_xmm1:quad32) (va_x_xmm2:quad32)
(va_x_xmm3:quad32) (va_x_xmm4:quad32) (va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags
va_x_efl (va_upd_xmm 4 va_x_xmm4 (va_upd_xmm 3 va_x_xmm3 (va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 1
va_x_xmm1 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem va_x_mem va_s0)))))) in va_get_ok va_sM
/\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst
15 (va_get_mem_layout va_sM) Secret /\ Vale.X64.Decls.modifies_buffer128 dst
(va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet 1 va_sM) /\ Vale.X64.Decls.buffer128_read dst
n (va_get_mem_heaplet 1 va_sM) == va_if (n `op_Modulus` 2 = 0) (fun _ -> va_get_xmm 1 va_sM)
(fun _ -> va_get_xmm 3 va_sM) /\ Vale.X64.Decls.buffer128_read dst (n - 1) (va_get_mem_heaplet
1 va_sM) == va_if ((n - 1) `op_Modulus` 2 = 0) (fun _ -> va_get_xmm 1 va_sM) (fun _ ->
va_get_xmm 3 va_sM) /\ (forall j . {:pattern(buffer128_read dst j (va_get_mem_heaplet 1
va_sM))}0 <= j /\ j <= n ==> Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_sM)
== Vale.AES.AES256_helpers.expand_key_256 key j) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundUnrolledRecursive256 : key:(seq nat32) -> dst:buffer128 -> n:int ->
va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundUnrolledRecursive256 key dst n va_s0
va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundUnrolledRecursive256
n) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_mem]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundUnrolledRecursive256 key dst n va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundUnrolledRecursive256
(va_code_KeyExpansionRoundUnrolledRecursive256 n) va_s0 key dst n in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok
va_sM (va_update_mem va_sM va_s0)))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundUnrolledRecursive256 (key:(seq nat32)) (dst:buffer128) (n:int) :
(va_quickCode unit (va_code_KeyExpansionRoundUnrolledRecursive256 n)) =
(va_QProc (va_code_KeyExpansionRoundUnrolledRecursive256 n) ([va_Mod_flags; va_Mod_xmm 4;
va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem])
(va_wp_KeyExpansionRoundUnrolledRecursive256 key dst n)
(va_wpProof_KeyExpansionRoundUnrolledRecursive256 key dst n))
//--
//-- KeyExpansion256Stdcall
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansion256Stdcall win =
(va_Block (va_CCons (if win then va_Block (va_CCons (va_code_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64 rRcx) 0 Secret)
(va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3)
(va_op_reg_opr64_reg64 rRcx) 16 Secret) (va_CNil ()))) else va_Block (va_CCons
(va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64
rRdi) 0 Secret) (va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm
3) (va_op_reg_opr64_reg64 rRdi) 16 Secret) (va_CCons (va_code_Mov64 (va_op_dst_opr64_reg64
rRdx) (va_op_opr64_reg64 rRsi)) (va_CNil ()))))) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) 0 Secret)
(va_CCons (va_code_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) 16 Secret) (va_CCons (va_code_KeyExpansionRoundUnrolledRecursive256 14)
(va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm
3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 4) (va_op_xmm_xmm 4)) (va_CNil ()))))))))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansion256Stdcall win =
(va_pbool_and (if win then va_pbool_and (va_codegen_success_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64 rRcx) 0 Secret)
(va_pbool_and (va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm
3) (va_op_reg_opr64_reg64 rRcx) 16 Secret) (va_ttrue ())) else va_pbool_and
(va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1)
(va_op_reg_opr64_reg64 rRdi) 0 Secret) (va_pbool_and (va_codegen_success_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3) (va_op_reg_opr64_reg64 rRdi) 16 Secret)
(va_pbool_and (va_codegen_success_Mov64 (va_op_dst_opr64_reg64 rRdx) (va_op_opr64_reg64 rRsi))
(va_ttrue ())))) (va_pbool_and (va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet
1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) 0 Secret) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) 16 Secret) (va_pbool_and
(va_codegen_success_KeyExpansionRoundUnrolledRecursive256 14) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 4) (va_op_xmm_xmm 4)) (va_ttrue ())))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansion256Stdcall (va_mods:va_mods_t) (win:bool) (input_key_b:buffer128)
(output_key_expansion_b:buffer128) : (va_quickCode unit (va_code_KeyExpansion256Stdcall win)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(key_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRcx va_s)
(fun _ -> va_get_reg64 rRdi va_s) in let (key_expansion_ptr:(va_int_range 0
18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRdx va_s) (fun _ -> va_get_reg64
rRsi va_s) in let (key:(FStar.Seq.Base.seq Vale.Def.Types_s.nat32)) =
Vale.AES.AES256_helpers.make_AES256_key (Vale.X64.Decls.buffer128_read input_key_b 0
(va_get_mem_heaplet 0 va_s)) (Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0
va_s)) in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 201 column 15 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_qInlineIf va_mods win (qblock va_mods (fun (va_s:va_state) -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 203 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64
rRcx) 0 Secret input_key_b 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 204 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3) (va_op_reg_opr64_reg64
rRcx) 16 Secret input_key_b 1) (va_QEmpty (()))))) (qblock va_mods (fun (va_s:va_state) ->
va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 208 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64
rRdi) 0 Secret input_key_b 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 209 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3) (va_op_reg_opr64_reg64
rRdi) 16 Secret input_key_b 1) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 210 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Mov64 (va_op_dst_opr64_reg64 rRdx) (va_op_opr64_reg64 rRsi)) (va_QEmpty (())))))))
(fun (va_s:va_state) va_g -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 213 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) 0 Secret output_key_expansion_b 0) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 214 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) 16 Secret output_key_expansion_b 1) (fun (va_s:va_state) _ -> va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 216 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 217 column 42 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_KeyExpansionRoundUnrolledRecursive256 key output_key_expansion_b 14) (fun
(va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 218 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_expand_key_256 key 15) (va_QLemma va_range1
"***** PRECONDITION NOT MET AT line 219 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
true (fun _ -> va_reveal_eq (`%key_to_round_keys_LE) key_to_round_keys_LE key_to_round_keys_LE)
(fun _ -> va_reveal_opaque (`%key_to_round_keys_LE) key_to_round_keys_LE) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 222 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 223 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 224 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 225 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 4) (va_op_xmm_xmm 4)) (va_QEmpty (()))))))))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansion256Stdcall va_b0 va_s0 win input_key_b output_key_expansion_b =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_reg64 rRdx; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansion256Stdcall va_mods win input_key_b output_key_expansion_b in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansion256Stdcall win) va_qc va_s0
(fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 177 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ (let (key_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ ->
va_get_reg64 rRcx va_s0) (fun _ -> va_get_reg64 rRdi va_s0) in let
(key_expansion_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ -> va_get_reg64
rRdx va_s0) (fun _ -> va_get_reg64 rRsi va_s0) in let (key:(FStar.Seq.Base.seq
Vale.Def.Types_s.nat32)) = Vale.AES.AES256_helpers.make_AES256_key
(Vale.X64.Decls.buffer128_read input_key_b 0 (va_get_mem_heaplet 0 va_s0))
(Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0 va_s0)) in label va_range1
"***** POSTCONDITION NOT MET AT line 193 column 52 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(aesni_enabled /\ avx_enabled /\ sse_enabled) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 194 column 76 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_sM) key_ptr input_key_b 2
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 195 column 98 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) key_expansion_ptr
output_key_expansion_b 15 (va_get_mem_layout va_sM) Secret)) /\ (let (key_ptr:(va_int_range 0
18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRcx va_s0) (fun _ -> va_get_reg64
rRdi va_s0) in let (key_expansion_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _
-> va_get_reg64 rRdx va_s0) (fun _ -> va_get_reg64 rRsi va_s0) in let (key:(FStar.Seq.Base.seq
Vale.Def.Types_s.nat32)) = Vale.AES.AES256_helpers.make_AES256_key
(Vale.X64.Decls.buffer128_read input_key_b 0 (va_get_mem_heaplet 0 va_s0))
(Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0 va_s0)) in label va_range1
"***** POSTCONDITION NOT MET AT line 197 column 70 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer128 output_key_expansion_b (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 199 column 109 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(forall (j:nat) . {:pattern(buffer128_read output_key_expansion_b j (va_get_mem_heaplet 1
va_sM))}j <= 14 ==> Vale.X64.Decls.buffer128_read output_key_expansion_b j (va_get_mem_heaplet
1 va_sM) == FStar.Seq.Base.index #Vale.Def.Types_s.quad32 (Vale.AES.AES_s.key_to_round_keys_LE
AES_256 key) j))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_reg64 rRdx; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_KeyExpansion256Stdcall win input_key_b output_key_expansion_b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansion256Stdcall (va_code_KeyExpansion256Stdcall win) va_s0
win input_key_b output_key_expansion_b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_reg64
rRdx va_sM (va_update_ok va_sM (va_update_mem va_sM va_s0))))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_reg64 rRdx; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- AES256EncryptRound
val va_code_AES256EncryptRound : n:nat -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_AES256EncryptRound n =
(va_Block (va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) (16 `op_Multiply` n) Secret) (va_CCons (va_code_AESNI_enc
(va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_CNil ()))))
val va_codegen_success_AES256EncryptRound : n:nat -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_AES256EncryptRound n =
(va_pbool_and (va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) (16 `op_Multiply` n) Secret) (va_pbool_and
(va_codegen_success_AESNI_enc (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_AES256EncryptRound (va_mods:va_mods_t) (n:nat) (init:quad32) (round_keys:(seq quad32))
(keys_buffer:buffer128) : (va_quickCode unit (va_code_AES256EncryptRound n)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(va_arg5:Vale.Def.Types_s.quad32) = va_get_xmm 0 va_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 252 column 33 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES_s.commute_sub_bytes_shift_rows va_arg5) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 253 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) (16 `op_Multiply` n) Secret keys_buffer n) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 254 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_enc (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_QEmpty (()))))))
val va_lemma_AES256EncryptRound : va_b0:va_code -> va_s0:va_state -> n:nat -> init:quad32 ->
round_keys:(seq quad32) -> keys_buffer:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AES256EncryptRound n) va_s0 /\ va_get_ok va_s0 /\
(aesni_enabled /\ sse_enabled) /\ (1 <= n /\ n < 14 /\ 14 <= FStar.Seq.Base.length #quad32
round_keys) /\ va_get_xmm 0 va_s0 == Vale.AES.AES_s.eval_rounds_def init round_keys (n - 1) /\
va_get_reg64 rR8 va_s0 == Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 keys_buffer
(va_get_mem_heaplet 0 va_s0) /\ Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0)
(va_get_reg64 rR8 va_s0) keys_buffer 15 (va_get_mem_layout va_s0) Secret /\
Vale.X64.Decls.buffer128_read keys_buffer n (va_get_mem_heaplet 0 va_s0) ==
FStar.Seq.Base.index #quad32 round_keys n))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_get_xmm 0 va_sM == Vale.AES.AES_s.eval_rounds_def init round_keys n /\ va_state_eq va_sM
(va_update_flags va_sM (va_update_xmm 2 va_sM (va_update_xmm 0 va_sM (va_update_ok va_sM
va_s0))))))
[@"opaque_to_smt"]
let va_lemma_AES256EncryptRound va_b0 va_s0 n init round_keys keys_buffer =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok] in
let va_qc = va_qcode_AES256EncryptRound va_mods n init round_keys keys_buffer in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_AES256EncryptRound n) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 232 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 250 column 53 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 0 va_sM == Vale.AES.AES_s.eval_rounds_def init round_keys n)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_AES256EncryptRound (n:nat) (init:quad32) (round_keys:(seq quad32))
(keys_buffer:buffer128) (va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ (aesni_enabled /\ sse_enabled) /\ (1 <= n /\ n < 14 /\ 14 <=
FStar.Seq.Base.length #quad32 round_keys) /\ va_get_xmm 0 va_s0 ==
Vale.AES.AES_s.eval_rounds_def init round_keys (n - 1) /\ va_get_reg64 rR8 va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 keys_buffer (va_get_mem_heaplet 0 va_s0)
/\ Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0) (va_get_reg64 rR8 va_s0)
keys_buffer 15 (va_get_mem_layout va_s0) Secret /\ Vale.X64.Decls.buffer128_read keys_buffer n
(va_get_mem_heaplet 0 va_s0) == FStar.Seq.Base.index #quad32 round_keys n /\ (forall
(va_x_xmm0:quad32) (va_x_xmm2:quad32) (va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags
va_x_efl (va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 0 va_x_xmm0 va_s0)) in va_get_ok va_sM /\
va_get_xmm 0 va_sM == Vale.AES.AES_s.eval_rounds_def init round_keys n ==> va_k va_sM (())))
val va_wpProof_AES256EncryptRound : n:nat -> init:quad32 -> round_keys:(seq quad32) ->
keys_buffer:buffer128 -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AES256EncryptRound n init round_keys keys_buffer va_s0
va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AES256EncryptRound n) ([va_Mod_flags;
va_Mod_xmm 2; va_Mod_xmm 0]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_AES256EncryptRound n init round_keys keys_buffer va_s0 va_k =
let (va_sM, va_f0) = va_lemma_AES256EncryptRound (va_code_AES256EncryptRound n) va_s0 n init
round_keys keys_buffer in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 2 va_sM (va_update_xmm 0 va_sM
(va_update_ok va_sM va_s0)))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_AES256EncryptRound (n:nat) (init:quad32) (round_keys:(seq quad32))
(keys_buffer:buffer128) : (va_quickCode unit (va_code_AES256EncryptRound n)) =
(va_QProc (va_code_AES256EncryptRound n) ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0])
(va_wp_AES256EncryptRound n init round_keys keys_buffer) (va_wpProof_AES256EncryptRound n init
round_keys keys_buffer))
//--
//-- AES256EncryptBlock
[@ "opaque_to_smt" va_qattr]
let va_code_AES256EncryptBlock () =
(va_Block (va_CCons (va_Block (va_CNil ())) (va_CCons (va_code_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64 rR8) 0 Secret) (va_CCons
(va_code_Pxor (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_CCons (va_code_AES256EncryptRound 1)
(va_CCons (va_code_AES256EncryptRound 2) (va_CCons (va_code_AES256EncryptRound 3) (va_CCons
(va_code_AES256EncryptRound 4) (va_CCons (va_code_AES256EncryptRound 5) (va_CCons
(va_code_AES256EncryptRound 6) (va_CCons (va_code_AES256EncryptRound 7) (va_CCons
(va_code_AES256EncryptRound 8) (va_CCons (va_code_AES256EncryptRound 9) (va_CCons
(va_code_AES256EncryptRound 10) (va_CCons (va_code_AES256EncryptRound 11) (va_CCons
(va_code_AES256EncryptRound 12) (va_CCons (va_code_AES256EncryptRound 13) (va_CCons
(va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) (16 `op_Multiply` 14) Secret) (va_CCons (va_code_AESNI_enc_last (va_op_xmm_xmm 0)
(va_op_xmm_xmm 2)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_CNil
())))))))))))))))))))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_AES256EncryptBlock () =
(va_pbool_and (va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) 0 Secret) (va_pbool_and (va_codegen_success_Pxor (va_op_xmm_xmm 0)
(va_op_xmm_xmm 2)) (va_pbool_and (va_codegen_success_AES256EncryptRound 1) (va_pbool_and
(va_codegen_success_AES256EncryptRound 2) (va_pbool_and (va_codegen_success_AES256EncryptRound
3) (va_pbool_and (va_codegen_success_AES256EncryptRound 4) (va_pbool_and
(va_codegen_success_AES256EncryptRound 5) (va_pbool_and (va_codegen_success_AES256EncryptRound
6) (va_pbool_and (va_codegen_success_AES256EncryptRound 7) (va_pbool_and
(va_codegen_success_AES256EncryptRound 8) (va_pbool_and (va_codegen_success_AES256EncryptRound
9) (va_pbool_and (va_codegen_success_AES256EncryptRound 10) (va_pbool_and
(va_codegen_success_AES256EncryptRound 11) (va_pbool_and (va_codegen_success_AES256EncryptRound
12) (va_pbool_and (va_codegen_success_AES256EncryptRound 13) (va_pbool_and
(va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) (16 `op_Multiply` 14) Secret) (va_pbool_and
(va_codegen_success_AESNI_enc_last (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_ttrue ())))))))))))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_AES256EncryptBlock (va_mods:va_mods_t) (input:quad32) (key:(seq nat32))
(round_keys:(seq quad32)) (keys_buffer:buffer128) : (va_quickCode unit
(va_code_AES256EncryptBlock ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_qAssertSquash
va_range1
"***** EXPRESSION PRECONDITIONS NOT MET WITHIN line 280 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
((fun a_539 (s_540:(FStar.Seq.Base.seq a_539)) (i_541:Prims.nat) -> let (i_515:Prims.nat) =
i_541 in Prims.b2t (Prims.op_LessThan i_515 (FStar.Seq.Base.length #a_539 s_540)))
Vale.Def.Types_s.quad32 round_keys 0) (fun _ -> let (init:Vale.Def.Types_s.quad32) =
Vale.Def.Types_s.quad32_xor input (FStar.Seq.Base.index #Vale.Def.Types_s.quad32 round_keys 0)
in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 282 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) 0 Secret keys_buffer 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 283 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 284 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 1 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 285 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 2 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 286 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 3 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 287 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 4 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 288 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 5 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 289 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 6 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 290 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 7 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 291 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 8 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 292 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 9 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 293 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 10 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 294 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 11 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 295 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 12 init round_keys keys_buffer) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 296 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 13 init round_keys keys_buffer) (fun (va_s:va_state) _ -> let
(va_arg24:Vale.Def.Types_s.quad32) = va_get_xmm 0 va_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 297 column 33 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES_s.commute_sub_bytes_shift_rows va_arg24) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 298 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) (16 `op_Multiply` 14) Secret keys_buffer 14) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 299 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_enc_last (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 302 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (fun (va_s:va_state) _ -> va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 303 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES_s.aes_encrypt_LE_reveal ()) (va_QEmpty (()))))))))))))))))))))))))
[@"opaque_to_smt"]
let va_lemma_AES256EncryptBlock va_b0 va_s0 input key round_keys keys_buffer =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok] in
let va_qc = va_qcode_AES256EncryptBlock va_mods input key round_keys keys_buffer in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_AES256EncryptBlock ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 257 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 278 column 52 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 0 va_sM == Vale.AES.AES_s.aes_encrypt_LE AES_256 key input)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_AES256EncryptBlock input key round_keys keys_buffer va_s0 va_k =
let (va_sM, va_f0) = va_lemma_AES256EncryptBlock (va_code_AES256EncryptBlock ()) va_s0 input key
round_keys keys_buffer in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 2 va_sM (va_update_xmm 0 va_sM
(va_update_ok va_sM va_s0)))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- AES256EncryptBlockStdcall
[@ "opaque_to_smt" va_qattr]
let va_code_AES256EncryptBlockStdcall win =
(va_Block (va_CCons (if win then va_Block (va_CCons (va_code_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 0) (va_op_reg_opr64_reg64 rRdx) 0 Secret) (va_CNil
())) else va_Block (va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0)
(va_op_xmm_xmm 0) (va_op_reg_opr64_reg64 rRsi) 0 Secret) (va_CCons (va_code_Mov64
(va_op_dst_opr64_reg64 rR8) (va_op_opr64_reg64 rRdx)) (va_CNil ())))) (va_CCons (va_Block
(va_CNil ())) (va_CCons (va_code_AES256EncryptBlock ()) (va_CCons (if win then va_Block
(va_CCons (va_code_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRcx)
(va_op_xmm_xmm 0) 0 Secret) (va_CNil ())) else va_Block (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdi) (va_op_xmm_xmm 0) 0 Secret) (va_CNil
()))) (va_CNil ()))))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_AES256EncryptBlockStdcall win =
(va_pbool_and (if win then va_pbool_and (va_codegen_success_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 0) (va_op_reg_opr64_reg64 rRdx) 0 Secret)
(va_ttrue ()) else va_pbool_and (va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet
0) (va_op_xmm_xmm 0) (va_op_reg_opr64_reg64 rRsi) 0 Secret) (va_pbool_and
(va_codegen_success_Mov64 (va_op_dst_opr64_reg64 rR8) (va_op_opr64_reg64 rRdx)) (va_ttrue ())))
(va_pbool_and (va_codegen_success_AES256EncryptBlock ()) (va_pbool_and (if win then
va_pbool_and (va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1)
(va_op_reg_opr64_reg64 rRcx) (va_op_xmm_xmm 0) 0 Secret) (va_ttrue ()) else va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdi)
(va_op_xmm_xmm 0) 0 Secret) (va_ttrue ())) (va_ttrue ()))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_AES256EncryptBlockStdcall (va_mods:va_mods_t) (win:bool) (input:quad32) (key:(seq
nat32)) (input_buffer:buffer128) (output_buffer:buffer128) (keys_buffer:buffer128) :
(va_quickCode unit (va_code_AES256EncryptBlockStdcall win)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(output_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRcx
va_s) (fun _ -> va_get_reg64 rRdi va_s) in let (input_ptr:(va_int_range 0
18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRdx va_s) (fun _ -> va_get_reg64
rRsi va_s) in let (expanded_key_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _
-> va_get_reg64 rR8 va_s) (fun _ -> va_get_reg64 rRdx va_s) in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 338 column 15 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_qInlineIf va_mods win (qblock va_mods (fun (va_s:va_state) -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 340 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 0) (va_op_reg_opr64_reg64
rRdx) 0 Secret input_buffer 0) (va_QEmpty (())))) (qblock va_mods (fun (va_s:va_state) ->
va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 344 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 0) (va_op_reg_opr64_reg64
rRsi) 0 Secret input_buffer 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 345 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Mov64 (va_op_dst_opr64_reg64 rR8) (va_op_opr64_reg64 rRdx)) (va_QEmpty (())))))) (fun
(va_s:va_state) va_g -> va_qAssertSquash va_range1
"***** EXPRESSION PRECONDITIONS NOT MET WITHIN line 348 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
((fun (alg_10150:Vale.AES.AES_common_s.algorithm) (key_10151:(FStar.Seq.Base.seq
Vale.Def.Types_s.nat32)) -> Vale.AES.AES_s.is_aes_key_LE alg_10150 key_10151) AES_256 key) (fun
_ -> va_QBind va_range1
"***** PRECONDITION NOT MET AT line 348 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptBlock input key (Vale.AES.AES_s.key_to_round_keys_LE AES_256 key)
keys_buffer) (fun (va_s:va_state) _ -> va_QBind va_range1
"***** PRECONDITION NOT MET AT line 350 column 15 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_qInlineIf va_mods win (qblock va_mods (fun (va_s:va_state) -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 352 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRcx)
(va_op_xmm_xmm 0) 0 Secret output_buffer 0) (va_QEmpty (())))) (qblock va_mods (fun
(va_s:va_state) -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 356 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdi)
(va_op_xmm_xmm 0) 0 Secret output_buffer 0) (va_QEmpty (()))))) (fun (va_s:va_state) va_g ->
va_QEmpty (())))))))
[@"opaque_to_smt"]
let va_lemma_AES256EncryptBlockStdcall va_b0 va_s0 win input key input_buffer output_buffer
keys_buffer =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_mem_heaplet 1;
va_Mod_reg64 rR8; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_AES256EncryptBlockStdcall va_mods win input key input_buffer output_buffer
keys_buffer in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_AES256EncryptBlockStdcall win) va_qc
va_s0 (fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 306 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ (let (output_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _
-> va_get_reg64 rRcx va_s0) (fun _ -> va_get_reg64 rRdi va_s0) in let (input_ptr:(va_int_range
0 18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRdx va_s0) (fun _ -> va_get_reg64
rRsi va_s0) in let (expanded_key_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _
-> va_get_reg64 rR8 va_s0) (fun _ -> va_get_reg64 rRdx va_s0) in label va_range1
"***** POSTCONDITION NOT MET AT line 335 column 67 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_mem (Vale.X64.Decls.loc_buffer #Vale.X64.Memory.vuint128
output_buffer) (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet 1 va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 336 column 87 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.buffer128_read output_buffer 0 (va_get_mem_heaplet 1 va_sM) ==
Vale.AES.AES_s.aes_encrypt_LE AES_256 key input))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_mem_heaplet 1; va_Mod_reg64
rR8; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM) | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsVector.fsti.checked",
"Vale.X64.InsMem.fsti.checked",
"Vale.X64.InsBasic.fsti.checked",
"Vale.X64.InsAes.fsti.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.AES_s.fst.checked",
"Vale.AES.AES_common_s.fst.checked",
"Vale.AES.AES256_helpers.fsti.checked",
"prims.fst.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Vale.AES.X64.AES256.fst"
} | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES256_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsAes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES256_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsAes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 20,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
win: Prims.bool ->
input: Vale.X64.Decls.quad32 ->
key: FStar.Seq.Base.seq Vale.X64.Memory.nat32 ->
input_buffer: Vale.X64.Memory.buffer128 ->
output_buffer: Vale.X64.Memory.buffer128 ->
keys_buffer: Vale.X64.Memory.buffer128 ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Prims.bool",
"Vale.X64.Decls.quad32",
"FStar.Seq.Base.seq",
"Vale.X64.Memory.nat32",
"Vale.X64.Memory.buffer128",
"Vale.X64.Decls.va_state",
"Prims.unit",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_Mod_xmm",
"Vale.X64.QuickCode.va_Mod_mem_heaplet",
"Vale.X64.QuickCode.va_Mod_reg64",
"Vale.X64.Machine_s.rR8",
"Vale.X64.QuickCode.va_Mod_mem",
"Prims.Nil",
"Prims._assert",
"Vale.X64.Decls.va_state_eq",
"Vale.X64.Decls.va_update_flags",
"Vale.X64.Decls.va_update_xmm",
"Vale.X64.Decls.va_update_mem_heaplet",
"Vale.X64.Decls.va_update_reg64",
"Vale.X64.Decls.va_update_ok",
"Vale.X64.Decls.va_update_mem",
"Vale.X64.Decls.va_lemma_upd_update",
"FStar.Pervasives.Native.tuple3",
"FStar.Pervasives.Native.tuple2",
"Vale.X64.State.vale_state",
"Vale.AES.X64.AES256.va_lemma_AES256EncryptBlockStdcall",
"Vale.AES.X64.AES256.va_code_AES256EncryptBlockStdcall"
] | [] | false | false | false | false | false | let va_wpProof_AES256EncryptBlockStdcall
win
input
key
input_buffer
output_buffer
keys_buffer
va_s0
va_k
=
| let va_sM, va_f0 =
va_lemma_AES256EncryptBlockStdcall (va_code_AES256EncryptBlockStdcall win)
va_s0
win
input
key
input_buffer
output_buffer
keys_buffer
in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_flags va_sM
(va_update_xmm 2
va_sM
(va_update_xmm 0
va_sM
(va_update_mem_heaplet 1
va_sM
(va_update_reg64 rR8 va_sM (va_update_ok va_sM (va_update_mem va_sM va_s0)))))
)));
va_lemma_norm_mods ([
va_Mod_flags;
va_Mod_xmm 2;
va_Mod_xmm 0;
va_Mod_mem_heaplet 1;
va_Mod_reg64 rR8;
va_Mod_mem
])
va_sM
va_s0;
let va_g = () in
(va_sM, va_f0, va_g) | false |
Hacl.Impl.Frodo.Pack.fst | Hacl.Impl.Frodo.Pack.lemma_split | val lemma_split: #a:Type -> #len:size_nat -> s:Seq.lseq a len -> i:size_nat{i <= len} ->
Lemma (s == Seq.(Seq.sub s 0 i @| Seq.sub s i (len - i))) | val lemma_split: #a:Type -> #len:size_nat -> s:Seq.lseq a len -> i:size_nat{i <= len} ->
Lemma (s == Seq.(Seq.sub s 0 i @| Seq.sub s i (len - i))) | let lemma_split #a #len s i =
FStar.Seq.lemma_split s i | {
"file_name": "code/frodo/Hacl.Impl.Frodo.Pack.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 27,
"end_line": 23,
"start_col": 0,
"start_line": 22
} | module Hacl.Impl.Frodo.Pack
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Hacl.Impl.Matrix
module ST = FStar.HyperStack.ST
module Loops = Lib.LoopCombinators
module Seq = Lib.Sequence
module S = Spec.Frodo.Pack
#reset-options "--z3rlimit 100 --max_fuel 0 --max_ifuel 0 --using_facts_from '* -Spec +Spec.Frodo.Pack +Spec.Matrix'"
val lemma_split: #a:Type -> #len:size_nat -> s:Seq.lseq a len -> i:size_nat{i <= len} -> | {
"checked_file": "/",
"dependencies": [
"Spec.Frodo.Pack.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.Matrix.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": false,
"source_file": "Hacl.Impl.Frodo.Pack.fst"
} | [
{
"abbrev": true,
"full_module": "Spec.Frodo.Pack",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "Seq"
},
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Matrix",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Buffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 100,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | s: Lib.Sequence.lseq a len -> i: Lib.IntTypes.size_nat{i <= len}
-> FStar.Pervasives.Lemma (ensures s == Lib.Sequence.sub s 0 i @| Lib.Sequence.sub s i (len - i)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Lib.IntTypes.size_nat",
"Lib.Sequence.lseq",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Seq.Properties.lemma_split",
"Prims.unit"
] | [] | true | false | true | false | false | let lemma_split #a #len s i =
| FStar.Seq.lemma_split s i | false |
Vale.AES.X64.AES256.fst | Vale.AES.X64.AES256.va_lemma_AES256EncryptBlockStdcall | val va_lemma_AES256EncryptBlockStdcall : va_b0:va_code -> va_s0:va_state -> win:bool ->
input:quad32 -> key:(seq nat32) -> input_buffer:buffer128 -> output_buffer:buffer128 ->
keys_buffer:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AES256EncryptBlockStdcall win) va_s0 /\ va_get_ok
va_s0 /\ (let (output_ptr:(va_int_range 0 18446744073709551615)) = (if win then va_get_reg64
rRcx va_s0 else va_get_reg64 rRdi va_s0) in let (input_ptr:(va_int_range 0
18446744073709551615)) = (if win then va_get_reg64 rRdx va_s0 else va_get_reg64 rRsi va_s0) in
let (expanded_key_ptr:(va_int_range 0 18446744073709551615)) = (if win then va_get_reg64 rR8
va_s0 else va_get_reg64 rRdx va_s0) in aesni_enabled /\ sse_enabled /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ Vale.X64.Decls.buffer128_read input_buffer 0
(va_get_mem_heaplet 0 va_s0) == input /\ expanded_key_ptr == Vale.X64.Memory.buffer_addr
#Vale.X64.Memory.vuint128 keys_buffer (va_get_mem_heaplet 0 va_s0) /\
Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0) input_ptr input_buffer 1
(va_get_mem_layout va_s0) Secret /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1
va_s0) output_ptr output_buffer 1 (va_get_mem_layout va_s0) Secret /\
Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0) expanded_key_ptr keys_buffer 15
(va_get_mem_layout va_s0) Secret /\ (forall (i:nat) . i < 15 ==> Vale.X64.Decls.buffer128_read
keys_buffer i (va_get_mem_heaplet 0 va_s0) == FStar.Seq.Base.index #Vale.Def.Types_s.quad32
(Vale.AES.AES_s.key_to_round_keys_LE AES_256 key) i))))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
(let (output_ptr:(va_int_range 0 18446744073709551615)) = (if win then va_get_reg64 rRcx va_s0
else va_get_reg64 rRdi va_s0) in let (input_ptr:(va_int_range 0 18446744073709551615)) = (if
win then va_get_reg64 rRdx va_s0 else va_get_reg64 rRsi va_s0) in let
(expanded_key_ptr:(va_int_range 0 18446744073709551615)) = (if win then va_get_reg64 rR8 va_s0
else va_get_reg64 rRdx va_s0) in Vale.X64.Decls.modifies_mem (Vale.X64.Decls.loc_buffer
#Vale.X64.Memory.vuint128 output_buffer) (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet 1
va_sM) /\ Vale.X64.Decls.buffer128_read output_buffer 0 (va_get_mem_heaplet 1 va_sM) ==
Vale.AES.AES_s.aes_encrypt_LE AES_256 key input) /\ va_state_eq va_sM (va_update_flags va_sM
(va_update_xmm 2 va_sM (va_update_xmm 0 va_sM (va_update_mem_heaplet 1 va_sM (va_update_reg64
rR8 va_sM (va_update_ok va_sM (va_update_mem va_sM va_s0))))))))) | val va_lemma_AES256EncryptBlockStdcall : va_b0:va_code -> va_s0:va_state -> win:bool ->
input:quad32 -> key:(seq nat32) -> input_buffer:buffer128 -> output_buffer:buffer128 ->
keys_buffer:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AES256EncryptBlockStdcall win) va_s0 /\ va_get_ok
va_s0 /\ (let (output_ptr:(va_int_range 0 18446744073709551615)) = (if win then va_get_reg64
rRcx va_s0 else va_get_reg64 rRdi va_s0) in let (input_ptr:(va_int_range 0
18446744073709551615)) = (if win then va_get_reg64 rRdx va_s0 else va_get_reg64 rRsi va_s0) in
let (expanded_key_ptr:(va_int_range 0 18446744073709551615)) = (if win then va_get_reg64 rR8
va_s0 else va_get_reg64 rRdx va_s0) in aesni_enabled /\ sse_enabled /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ Vale.X64.Decls.buffer128_read input_buffer 0
(va_get_mem_heaplet 0 va_s0) == input /\ expanded_key_ptr == Vale.X64.Memory.buffer_addr
#Vale.X64.Memory.vuint128 keys_buffer (va_get_mem_heaplet 0 va_s0) /\
Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0) input_ptr input_buffer 1
(va_get_mem_layout va_s0) Secret /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1
va_s0) output_ptr output_buffer 1 (va_get_mem_layout va_s0) Secret /\
Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0) expanded_key_ptr keys_buffer 15
(va_get_mem_layout va_s0) Secret /\ (forall (i:nat) . i < 15 ==> Vale.X64.Decls.buffer128_read
keys_buffer i (va_get_mem_heaplet 0 va_s0) == FStar.Seq.Base.index #Vale.Def.Types_s.quad32
(Vale.AES.AES_s.key_to_round_keys_LE AES_256 key) i))))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
(let (output_ptr:(va_int_range 0 18446744073709551615)) = (if win then va_get_reg64 rRcx va_s0
else va_get_reg64 rRdi va_s0) in let (input_ptr:(va_int_range 0 18446744073709551615)) = (if
win then va_get_reg64 rRdx va_s0 else va_get_reg64 rRsi va_s0) in let
(expanded_key_ptr:(va_int_range 0 18446744073709551615)) = (if win then va_get_reg64 rR8 va_s0
else va_get_reg64 rRdx va_s0) in Vale.X64.Decls.modifies_mem (Vale.X64.Decls.loc_buffer
#Vale.X64.Memory.vuint128 output_buffer) (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet 1
va_sM) /\ Vale.X64.Decls.buffer128_read output_buffer 0 (va_get_mem_heaplet 1 va_sM) ==
Vale.AES.AES_s.aes_encrypt_LE AES_256 key input) /\ va_state_eq va_sM (va_update_flags va_sM
(va_update_xmm 2 va_sM (va_update_xmm 0 va_sM (va_update_mem_heaplet 1 va_sM (va_update_reg64
rR8 va_sM (va_update_ok va_sM (va_update_mem va_sM va_s0))))))))) | let va_lemma_AES256EncryptBlockStdcall va_b0 va_s0 win input key input_buffer output_buffer
keys_buffer =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_mem_heaplet 1;
va_Mod_reg64 rR8; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_AES256EncryptBlockStdcall va_mods win input key input_buffer output_buffer
keys_buffer in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_AES256EncryptBlockStdcall win) va_qc
va_s0 (fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 306 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ (let (output_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _
-> va_get_reg64 rRcx va_s0) (fun _ -> va_get_reg64 rRdi va_s0) in let (input_ptr:(va_int_range
0 18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRdx va_s0) (fun _ -> va_get_reg64
rRsi va_s0) in let (expanded_key_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _
-> va_get_reg64 rR8 va_s0) (fun _ -> va_get_reg64 rRdx va_s0) in label va_range1
"***** POSTCONDITION NOT MET AT line 335 column 67 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_mem (Vale.X64.Decls.loc_buffer #Vale.X64.Memory.vuint128
output_buffer) (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet 1 va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 336 column 87 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.buffer128_read output_buffer 0 (va_get_mem_heaplet 1 va_sM) ==
Vale.AES.AES_s.aes_encrypt_LE AES_256 key input))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_mem_heaplet 1; va_Mod_reg64
rR8; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM) | {
"file_name": "obj/Vale.AES.X64.AES256.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 966,
"start_col": 0,
"start_line": 943
} | module Vale.AES.X64.AES256
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsVector
open Vale.X64.InsAes
open Vale.X64.QuickCode
open Vale.X64.QuickCodes
open Vale.Arch.Types
open Vale.AES.AES256_helpers
open Vale.X64.CPU_Features_s
#reset-options "--z3rlimit 20"
//-- KeyExpansionRoundEven256
val va_code_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansionRoundEven256 round rcon =
(va_Block (va_CCons (va_code_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon)
(va_CCons (va_code_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_CCons (va_code_VPslldq4
(va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm
4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4)
(va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_CCons
(va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) (16 `op_Multiply`
(round + 1)) Secret) (va_CNil ()))))))))))))
val va_codegen_success_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansionRoundEven256 round rcon =
(va_pbool_and (va_codegen_success_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon)
(va_pbool_and (va_codegen_success_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) (16 `op_Multiply` (round + 1)) Secret) (va_ttrue ())))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansionRoundEven256 (va_mods:va_mods_t) (round:nat64) (rcon:nat8) (dst:buffer128)
(key:(seq nat32)) : (va_quickCode unit (va_code_KeyExpansionRoundEven256 round rcon)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 75 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 3) rcon) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 76 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 255) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 77 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 78 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 79 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 80 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 81 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 82 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 83 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 84 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) (16 `op_Multiply` (round + 1)) Secret dst (round + 1)) (fun (va_s:va_state) _
-> let (va_arg17:Prims.int) = round + 1 in let (va_arg16:Vale.Def.Types_s.nat32) = rcon in let
(va_arg15:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in let
(va_arg14:Vale.Def.Types_s.quad32) = va_get_xmm 1 va_old_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 87 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_simd_round_key va_arg14 va_arg15 va_arg16
va_arg17) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 88 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QEmpty (())))))))))))))))
val va_lemma_KeyExpansionRoundEven256 : va_b0:va_code -> va_s0:va_state -> round:nat64 -> rcon:nat8
-> dst:buffer128 -> key:(seq nat32)
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundEven256 round rcon) va_s0 /\
va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 == 0 /\ rcon ==
Vale.AES.AES_common_s.aes_rcon ((round + 1) `op_Division` 2 - 1) /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ va_get_xmm 1 va_sM == Vale.X64.Decls.buffer128_read dst
(round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 1 va_sM ==
Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) /\ va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4
va_sM (va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM
(va_update_ok va_sM (va_update_mem va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansionRoundEven256 va_b0 va_s0 round rcon dst key =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansionRoundEven256 va_mods round rcon dst key in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansionRoundEven256 round rcon)
va_qc va_s0 (fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 50 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 61 column 65 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 71 column 54 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 1 va_sM == Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1
va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 72 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 1 va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 73 column 82 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM) (round + 1) (round + 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundEven256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32))
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 == 0 /\ rcon ==
Vale.AES.AES_common_s.aes_rcon ((round + 1) `op_Division` 2 - 1) /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round /\ (forall (va_x_mem:vale_heap)
(va_x_heap1:vale_heap) (va_x_xmm1:quad32) (va_x_xmm2:quad32) (va_x_xmm4:quad32)
(va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags va_x_efl (va_upd_xmm 4 va_x_xmm4
(va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 1 va_x_xmm1 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem
va_x_mem va_s0))))) in va_get_ok va_sM /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1
va_sM) (va_get_reg64 rRdx va_sM) dst 15 (va_get_mem_layout va_sM) Secret /\ va_get_xmm 1 va_sM
== Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 1
va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundEven256 : round:nat64 -> rcon:nat8 -> dst:buffer128 -> key:(seq
nat32) -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundEven256 round rcon dst key va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundEven256 round rcon)
([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem])
va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundEven256 round rcon dst key va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundEven256 (va_code_KeyExpansionRoundEven256 round
rcon) va_s0 round rcon dst key in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 2 va_sM
(va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundEven256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32)) :
(va_quickCode unit (va_code_KeyExpansionRoundEven256 round rcon)) =
(va_QProc (va_code_KeyExpansionRoundEven256 round rcon) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm
2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem]) (va_wp_KeyExpansionRoundEven256 round rcon
dst key) (va_wpProof_KeyExpansionRoundEven256 round rcon dst key))
//--
//-- KeyExpansionRoundOdd256
val va_code_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansionRoundOdd256 round rcon =
(va_Block (va_CCons (va_code_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0) (va_CCons
(va_code_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_CCons (va_code_VPslldq4
(va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm
4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_CCons (va_code_VPslldq4 (va_op_xmm_xmm 4)
(va_op_xmm_xmm 3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_CCons
(va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 3) (16 `op_Multiply`
(round + 1)) Secret) (va_CNil ()))))))))))))
val va_codegen_success_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansionRoundOdd256 round rcon =
(va_pbool_and (va_codegen_success_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0)
(va_pbool_and (va_codegen_success_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) (16 `op_Multiply` (round + 1)) Secret) (va_ttrue ())))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansionRoundOdd256 (va_mods:va_mods_t) (round:nat64) (rcon:nat8) (dst:buffer128)
(key:(seq nat32)) : (va_quickCode unit (va_code_KeyExpansionRoundOdd256 round rcon)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 118 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_keygen_assist (va_op_xmm_xmm 2) (va_op_xmm_xmm 1) 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 119 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pshufd (va_op_xmm_xmm 2) (va_op_xmm_xmm 2) 170) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 120 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 121 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 122 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 123 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 124 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_VPslldq4 (va_op_xmm_xmm 4) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 125 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 4)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 126 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 127 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) (16 `op_Multiply` (round + 1)) Secret dst (round + 1)) (fun (va_s:va_state) _
-> let (va_arg20:Prims.int) = round + 1 in let (va_arg19:Vale.Def.Types_s.quad32) = va_get_xmm
1 va_old_s in let (va_arg18:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 130 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_simd_round_key va_arg18 va_arg19 0 va_arg20)
(let (va_arg17:Prims.int) = round + 1 in let (va_arg16:Vale.Def.Types_s.quad32) = va_get_xmm 1
va_old_s in let (va_arg15:Vale.Def.Types_s.quad32) = va_get_xmm 3 va_old_s in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 131 column 33 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_round_key_256_rcon_odd va_arg15 va_arg16 0
va_arg17) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 132 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QEmpty
(()))))))))))))))))
val va_lemma_KeyExpansionRoundOdd256 : va_b0:va_code -> va_s0:va_state -> round:nat64 -> rcon:nat8
-> dst:buffer128 -> key:(seq nat32)
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundOdd256 round rcon) va_s0 /\ va_get_ok
va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64 rRdx va_s0)
dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\ sse_enabled) /\ (1
<= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 =!= 0 /\ Vale.AES.AES_s.is_aes_key_LE
AES_256 key /\ va_get_xmm 3 va_s0 == Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\
va_get_xmm 1 va_s0 == Vale.AES.AES256_helpers.expand_key_256 key round))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ va_get_xmm 3 va_sM == Vale.X64.Decls.buffer128_read dst
(round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 3 va_sM ==
Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) /\ va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4
va_sM (va_update_xmm 3 va_sM (va_update_xmm 2 va_sM (va_update_mem_heaplet 1 va_sM
(va_update_ok va_sM (va_update_mem va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansionRoundOdd256 va_b0 va_s0 round rcon dst key =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2;
va_Mod_mem_heaplet 1; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansionRoundOdd256 va_mods round rcon dst key in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansionRoundOdd256 round rcon)
va_qc va_s0 (fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 93 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 104 column 65 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 114 column 54 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 3 va_sM == Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1
va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 115 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 3 va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 116 column 82 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM) (round + 1) (round + 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet
1; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundOdd256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32))
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (1 <= round /\ round < 14) /\ (round + 1) `op_Modulus` 2 =!= 0 /\
Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key (round - 1) /\ va_get_xmm 1 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key round /\ (forall (va_x_mem:vale_heap)
(va_x_heap1:vale_heap) (va_x_xmm2:quad32) (va_x_xmm3:quad32) (va_x_xmm4:quad32)
(va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags va_x_efl (va_upd_xmm 4 va_x_xmm4
(va_upd_xmm 3 va_x_xmm3 (va_upd_xmm 2 va_x_xmm2 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem
va_x_mem va_s0))))) in va_get_ok va_sM /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1
va_sM) (va_get_reg64 rRdx va_sM) dst 15 (va_get_mem_layout va_sM) Secret /\ va_get_xmm 3 va_sM
== Vale.X64.Decls.buffer128_read dst (round + 1) (va_get_mem_heaplet 1 va_sM) /\ va_get_xmm 3
va_sM == Vale.AES.AES256_helpers.expand_key_256 key (round + 1) /\
Vale.X64.Decls.modifies_buffer_specific128 dst (va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet
1 va_sM) (round + 1) (round + 1) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundOdd256 : round:nat64 -> rcon:nat8 -> dst:buffer128 -> key:(seq
nat32) -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundOdd256 round rcon dst key va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundOdd256 round rcon)
([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet 1; va_Mod_mem])
va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundOdd256 round rcon dst key va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundOdd256 (va_code_KeyExpansionRoundOdd256 round
rcon) va_s0 round rcon dst key in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_mem_heaplet
1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundOdd256 (round:nat64) (rcon:nat8) (dst:buffer128) (key:(seq nat32)) :
(va_quickCode unit (va_code_KeyExpansionRoundOdd256 round rcon)) =
(va_QProc (va_code_KeyExpansionRoundOdd256 round rcon) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm
3; va_Mod_xmm 2; va_Mod_mem_heaplet 1; va_Mod_mem]) (va_wp_KeyExpansionRoundOdd256 round rcon
dst key) (va_wpProof_KeyExpansionRoundOdd256 round rcon dst key))
//--
//-- KeyExpansionRoundUnrolledRecursive256
val va_code_KeyExpansionRoundUnrolledRecursive256 : n:int -> Tot va_code(decreases %[n])
[@ "opaque_to_smt"]
let rec va_code_KeyExpansionRoundUnrolledRecursive256 n =
(va_Block (va_CCons (if (1 < n && n <= 14) then va_Block (va_CCons
(va_code_KeyExpansionRoundUnrolledRecursive256 (n - 1)) (va_CCons (if (n `op_Modulus` 2 = 0)
then va_Block (va_CCons (va_code_KeyExpansionRoundEven256 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1))) (va_CNil ())) else va_Block (va_CCons
(va_code_KeyExpansionRoundOdd256 (n - 1) (Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 -
1))) (va_CNil ()))) (va_CNil ()))) else va_Block (va_CNil ())) (va_CNil ())))
val va_codegen_success_KeyExpansionRoundUnrolledRecursive256 : n:int -> Tot va_pbool(decreases %[n])
[@ "opaque_to_smt"]
let rec va_codegen_success_KeyExpansionRoundUnrolledRecursive256 n =
(va_pbool_and (if (1 < n && n <= 14) then va_pbool_and
(va_codegen_success_KeyExpansionRoundUnrolledRecursive256 (n - 1)) (va_pbool_and (if (n
`op_Modulus` 2 = 0) then va_pbool_and (va_codegen_success_KeyExpansionRoundEven256 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1))) (va_ttrue ()) else va_pbool_and
(va_codegen_success_KeyExpansionRoundOdd256 (n - 1) (Vale.AES.AES_common_s.aes_rcon (n
`op_Division` 2 - 1))) (va_ttrue ())) (va_ttrue ())) else va_ttrue ()) (va_ttrue ()))
val va_lemma_KeyExpansionRoundUnrolledRecursive256 : va_b0:va_code -> va_s0:va_state -> key:(seq
nat32) -> dst:buffer128 -> n:int
-> Ghost (va_state & va_fuel)(decreases %[n])
(requires (va_require_total va_b0 (va_code_KeyExpansionRoundUnrolledRecursive256 n) va_s0 /\
va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (0 < n /\ n <= 14) /\ Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1
va_s0 == Vale.AES.AES256_helpers.expand_key_256 key 0 /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key 1 /\ va_get_xmm 1 va_s0 ==
Vale.X64.Decls.buffer128_read dst 0 (va_get_mem_heaplet 1 va_s0) /\ va_get_xmm 3 va_s0 ==
Vale.X64.Decls.buffer128_read dst 1 (va_get_mem_heaplet 1 va_s0) /\ va_get_reg64 rRdx va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 dst (va_get_mem_heaplet 1 va_s0)))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst 15
(va_get_mem_layout va_sM) Secret /\ Vale.X64.Decls.modifies_buffer128 dst (va_get_mem_heaplet 1
va_s0) (va_get_mem_heaplet 1 va_sM) /\ Vale.X64.Decls.buffer128_read dst n (va_get_mem_heaplet
1 va_sM) == (if (n `op_Modulus` 2 = 0) then va_get_xmm 1 va_sM else va_get_xmm 3 va_sM) /\
Vale.X64.Decls.buffer128_read dst (n - 1) (va_get_mem_heaplet 1 va_sM) == (if ((n - 1)
`op_Modulus` 2 = 0) then va_get_xmm 1 va_sM else va_get_xmm 3 va_sM) /\ (forall j .
{:pattern(buffer128_read dst j (va_get_mem_heaplet 1 va_sM))}0 <= j /\ j <= n ==>
Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_sM) ==
Vale.AES.AES256_helpers.expand_key_256 key j) /\ va_state_eq va_sM (va_update_flags va_sM
(va_update_xmm 4 va_sM (va_update_xmm 3 va_sM (va_update_xmm 2 va_sM (va_update_xmm 1 va_sM
(va_update_mem_heaplet 1 va_sM (va_update_ok va_sM (va_update_mem va_sM va_s0))))))))))
[@"opaque_to_smt"]
let rec va_lemma_KeyExpansionRoundUnrolledRecursive256 va_b0 va_s0 key dst n =
va_reveal_opaque (`%va_code_KeyExpansionRoundUnrolledRecursive256)
(va_code_KeyExpansionRoundUnrolledRecursive256 n);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
let va_b2 = va_tl va_b1 in
let va_c2 = va_hd va_b1 in
let (va_fc2, va_s2) =
(
if (1 < n && n <= 14) then
(
let va_b3 = va_get_block va_c2 in
let (va_s4, va_fc4) = va_lemma_KeyExpansionRoundUnrolledRecursive256 (va_hd va_b3) va_s0 key
dst (n - 1) in
let va_b4 = va_tl va_b3 in
let (old_mem:vale_heap) = va_get_mem_heaplet 1 va_s4 in
let va_b6 = va_tl va_b4 in
let va_c6 = va_hd va_b4 in
let (va_fc6, va_s6) =
(
if (n `op_Modulus` 2 = 0) then
(
let va_b7 = va_get_block va_c6 in
let (va_s8, va_fc8) = va_lemma_KeyExpansionRoundEven256 (va_hd va_b7) va_s4 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1)) dst key in
let va_b8 = va_tl va_b7 in
let (va_s6, va_f8) = va_lemma_empty_total va_s8 va_b8 in
let va_fc6 = va_lemma_merge_total va_b7 va_s4 va_fc8 va_s8 va_f8 va_s6 in
(va_fc6, va_s6)
)
else
(
let va_b9 = va_get_block va_c6 in
let (va_s10, va_fc10) = va_lemma_KeyExpansionRoundOdd256 (va_hd va_b9) va_s4 (n - 1)
(Vale.AES.AES_common_s.aes_rcon (n `op_Division` 2 - 1)) dst key in
let va_b10 = va_tl va_b9 in
let (va_s6, va_f10) = va_lemma_empty_total va_s10 va_b10 in
let va_fc6 = va_lemma_merge_total va_b9 va_s4 va_fc10 va_s10 va_f10 va_s6 in
(va_fc6, va_s6)
)
) in
assert (forall j . {:pattern(buffer128_read dst j (va_get_mem_heaplet 1 va_s6))}0 <= j /\ j <
n ==> Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_s6) ==
Vale.X64.Decls.buffer128_read dst j old_mem);
let (va_s2, va_f6) = va_lemma_empty_total va_s6 va_b6 in
let va_f4 = va_lemma_merge_total va_b4 va_s4 va_fc6 va_s6 va_f6 va_s2 in
let va_fc2 = va_lemma_merge_total va_b3 va_s0 va_fc4 va_s4 va_f4 va_s2 in
(va_fc2, va_s2)
)
else
(
let va_b12 = va_get_block va_c2 in
let (va_s2, va_fc2) = va_lemma_empty_total va_s0 va_b12 in
(va_fc2, va_s2)
)
) in
let (va_sM, va_f2) = va_lemma_empty_total va_s2 va_b2 in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc2 va_s2 va_f2 va_sM in
(va_sM, va_fM)
[@ va_qattr]
let va_wp_KeyExpansionRoundUnrolledRecursive256 (key:(seq nat32)) (dst:buffer128) (n:int)
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg64
rRdx va_s0) dst 15 (va_get_mem_layout va_s0) Secret /\ (aesni_enabled /\ avx_enabled /\
sse_enabled) /\ (0 < n /\ n <= 14) /\ Vale.AES.AES_s.is_aes_key_LE AES_256 key /\ va_get_xmm 1
va_s0 == Vale.AES.AES256_helpers.expand_key_256 key 0 /\ va_get_xmm 3 va_s0 ==
Vale.AES.AES256_helpers.expand_key_256 key 1 /\ va_get_xmm 1 va_s0 ==
Vale.X64.Decls.buffer128_read dst 0 (va_get_mem_heaplet 1 va_s0) /\ va_get_xmm 3 va_s0 ==
Vale.X64.Decls.buffer128_read dst 1 (va_get_mem_heaplet 1 va_s0) /\ va_get_reg64 rRdx va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 dst (va_get_mem_heaplet 1 va_s0) /\
(forall (va_x_mem:vale_heap) (va_x_heap1:vale_heap) (va_x_xmm1:quad32) (va_x_xmm2:quad32)
(va_x_xmm3:quad32) (va_x_xmm4:quad32) (va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags
va_x_efl (va_upd_xmm 4 va_x_xmm4 (va_upd_xmm 3 va_x_xmm3 (va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 1
va_x_xmm1 (va_upd_mem_heaplet 1 va_x_heap1 (va_upd_mem va_x_mem va_s0)))))) in va_get_ok va_sM
/\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) (va_get_reg64 rRdx va_sM) dst
15 (va_get_mem_layout va_sM) Secret /\ Vale.X64.Decls.modifies_buffer128 dst
(va_get_mem_heaplet 1 va_s0) (va_get_mem_heaplet 1 va_sM) /\ Vale.X64.Decls.buffer128_read dst
n (va_get_mem_heaplet 1 va_sM) == va_if (n `op_Modulus` 2 = 0) (fun _ -> va_get_xmm 1 va_sM)
(fun _ -> va_get_xmm 3 va_sM) /\ Vale.X64.Decls.buffer128_read dst (n - 1) (va_get_mem_heaplet
1 va_sM) == va_if ((n - 1) `op_Modulus` 2 = 0) (fun _ -> va_get_xmm 1 va_sM) (fun _ ->
va_get_xmm 3 va_sM) /\ (forall j . {:pattern(buffer128_read dst j (va_get_mem_heaplet 1
va_sM))}0 <= j /\ j <= n ==> Vale.X64.Decls.buffer128_read dst j (va_get_mem_heaplet 1 va_sM)
== Vale.AES.AES256_helpers.expand_key_256 key j) ==> va_k va_sM (())))
val va_wpProof_KeyExpansionRoundUnrolledRecursive256 : key:(seq nat32) -> dst:buffer128 -> n:int ->
va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_KeyExpansionRoundUnrolledRecursive256 key dst n va_s0
va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_KeyExpansionRoundUnrolledRecursive256
n) ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet
1; va_Mod_mem]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_KeyExpansionRoundUnrolledRecursive256 key dst n va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansionRoundUnrolledRecursive256
(va_code_KeyExpansionRoundUnrolledRecursive256 n) va_s0 key dst n in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_ok
va_sM (va_update_mem va_sM va_s0)))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_KeyExpansionRoundUnrolledRecursive256 (key:(seq nat32)) (dst:buffer128) (n:int) :
(va_quickCode unit (va_code_KeyExpansionRoundUnrolledRecursive256 n)) =
(va_QProc (va_code_KeyExpansionRoundUnrolledRecursive256 n) ([va_Mod_flags; va_Mod_xmm 4;
va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem_heaplet 1; va_Mod_mem])
(va_wp_KeyExpansionRoundUnrolledRecursive256 key dst n)
(va_wpProof_KeyExpansionRoundUnrolledRecursive256 key dst n))
//--
//-- KeyExpansion256Stdcall
[@ "opaque_to_smt" va_qattr]
let va_code_KeyExpansion256Stdcall win =
(va_Block (va_CCons (if win then va_Block (va_CCons (va_code_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64 rRcx) 0 Secret)
(va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3)
(va_op_reg_opr64_reg64 rRcx) 16 Secret) (va_CNil ()))) else va_Block (va_CCons
(va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64
rRdi) 0 Secret) (va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm
3) (va_op_reg_opr64_reg64 rRdi) 16 Secret) (va_CCons (va_code_Mov64 (va_op_dst_opr64_reg64
rRdx) (va_op_opr64_reg64 rRsi)) (va_CNil ()))))) (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) 0 Secret)
(va_CCons (va_code_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) 16 Secret) (va_CCons (va_code_KeyExpansionRoundUnrolledRecursive256 14)
(va_CCons (va_code_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 1)) (va_CCons (va_code_Pxor
(va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm
3)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 4) (va_op_xmm_xmm 4)) (va_CNil ()))))))))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_KeyExpansion256Stdcall win =
(va_pbool_and (if win then va_pbool_and (va_codegen_success_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64 rRcx) 0 Secret)
(va_pbool_and (va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm
3) (va_op_reg_opr64_reg64 rRcx) 16 Secret) (va_ttrue ())) else va_pbool_and
(va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1)
(va_op_reg_opr64_reg64 rRdi) 0 Secret) (va_pbool_and (va_codegen_success_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3) (va_op_reg_opr64_reg64 rRdi) 16 Secret)
(va_pbool_and (va_codegen_success_Mov64 (va_op_dst_opr64_reg64 rRdx) (va_op_opr64_reg64 rRsi))
(va_ttrue ())))) (va_pbool_and (va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet
1) (va_op_reg_opr64_reg64 rRdx) (va_op_xmm_xmm 1) 0 Secret) (va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) 16 Secret) (va_pbool_and
(va_codegen_success_KeyExpansionRoundUnrolledRecursive256 14) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 1)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 3)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 4) (va_op_xmm_xmm 4)) (va_ttrue ())))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_KeyExpansion256Stdcall (va_mods:va_mods_t) (win:bool) (input_key_b:buffer128)
(output_key_expansion_b:buffer128) : (va_quickCode unit (va_code_KeyExpansion256Stdcall win)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(key_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRcx va_s)
(fun _ -> va_get_reg64 rRdi va_s) in let (key_expansion_ptr:(va_int_range 0
18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRdx va_s) (fun _ -> va_get_reg64
rRsi va_s) in let (key:(FStar.Seq.Base.seq Vale.Def.Types_s.nat32)) =
Vale.AES.AES256_helpers.make_AES256_key (Vale.X64.Decls.buffer128_read input_key_b 0
(va_get_mem_heaplet 0 va_s)) (Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0
va_s)) in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 201 column 15 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_qInlineIf va_mods win (qblock va_mods (fun (va_s:va_state) -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 203 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64
rRcx) 0 Secret input_key_b 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 204 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3) (va_op_reg_opr64_reg64
rRcx) 16 Secret input_key_b 1) (va_QEmpty (()))))) (qblock va_mods (fun (va_s:va_state) ->
va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 208 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 1) (va_op_reg_opr64_reg64
rRdi) 0 Secret input_key_b 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 209 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 3) (va_op_reg_opr64_reg64
rRdi) 16 Secret input_key_b 1) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 210 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Mov64 (va_op_dst_opr64_reg64 rRdx) (va_op_opr64_reg64 rRsi)) (va_QEmpty (())))))))
(fun (va_s:va_state) va_g -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 213 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 1) 0 Secret output_key_expansion_b 0) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 214 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdx)
(va_op_xmm_xmm 3) 16 Secret output_key_expansion_b 1) (fun (va_s:va_state) _ -> va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 216 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.expand_key_256_reveal ()) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 217 column 42 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_KeyExpansionRoundUnrolledRecursive256 key output_key_expansion_b 14) (fun
(va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 218 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES256_helpers.lemma_expand_key_256 key 15) (va_QLemma va_range1
"***** PRECONDITION NOT MET AT line 219 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
true (fun _ -> va_reveal_eq (`%key_to_round_keys_LE) key_to_round_keys_LE key_to_round_keys_LE)
(fun _ -> va_reveal_opaque (`%key_to_round_keys_LE) key_to_round_keys_LE) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 222 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 1) (va_op_xmm_xmm 1)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 223 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 224 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 3) (va_op_xmm_xmm 3)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 225 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 4) (va_op_xmm_xmm 4)) (va_QEmpty (()))))))))))))))
[@"opaque_to_smt"]
let va_lemma_KeyExpansion256Stdcall va_b0 va_s0 win input_key_b output_key_expansion_b =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_reg64 rRdx; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_KeyExpansion256Stdcall va_mods win input_key_b output_key_expansion_b in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_KeyExpansion256Stdcall win) va_qc va_s0
(fun va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 177 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ (let (key_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ ->
va_get_reg64 rRcx va_s0) (fun _ -> va_get_reg64 rRdi va_s0) in let
(key_expansion_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ -> va_get_reg64
rRdx va_s0) (fun _ -> va_get_reg64 rRsi va_s0) in let (key:(FStar.Seq.Base.seq
Vale.Def.Types_s.nat32)) = Vale.AES.AES256_helpers.make_AES256_key
(Vale.X64.Decls.buffer128_read input_key_b 0 (va_get_mem_heaplet 0 va_s0))
(Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0 va_s0)) in label va_range1
"***** POSTCONDITION NOT MET AT line 193 column 52 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(aesni_enabled /\ avx_enabled /\ sse_enabled) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 194 column 76 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_sM) key_ptr input_key_b 2
(va_get_mem_layout va_sM) Secret) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 195 column 98 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_sM) key_expansion_ptr
output_key_expansion_b 15 (va_get_mem_layout va_sM) Secret)) /\ (let (key_ptr:(va_int_range 0
18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRcx va_s0) (fun _ -> va_get_reg64
rRdi va_s0) in let (key_expansion_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _
-> va_get_reg64 rRdx va_s0) (fun _ -> va_get_reg64 rRsi va_s0) in let (key:(FStar.Seq.Base.seq
Vale.Def.Types_s.nat32)) = Vale.AES.AES256_helpers.make_AES256_key
(Vale.X64.Decls.buffer128_read input_key_b 0 (va_get_mem_heaplet 0 va_s0))
(Vale.X64.Decls.buffer128_read input_key_b 1 (va_get_mem_heaplet 0 va_s0)) in label va_range1
"***** POSTCONDITION NOT MET AT line 197 column 70 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_buffer128 output_key_expansion_b (va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM)) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 199 column 109 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(forall (j:nat) . {:pattern(buffer128_read output_key_expansion_b j (va_get_mem_heaplet 1
va_sM))}j <= 14 ==> Vale.X64.Decls.buffer128_read output_key_expansion_b j (va_get_mem_heaplet
1 va_sM) == FStar.Seq.Base.index #Vale.Def.Types_s.quad32 (Vale.AES.AES_s.key_to_round_keys_LE
AES_256 key) j))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_reg64 rRdx; va_Mod_ok; va_Mod_mem]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_KeyExpansion256Stdcall win input_key_b output_key_expansion_b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_KeyExpansion256Stdcall (va_code_KeyExpansion256Stdcall win) va_s0
win input_key_b output_key_expansion_b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 4 va_sM (va_update_xmm 3 va_sM
(va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_mem_heaplet 1 va_sM (va_update_reg64
rRdx va_sM (va_update_ok va_sM (va_update_mem va_sM va_s0))))))))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_mem_heaplet 1; va_Mod_reg64 rRdx; va_Mod_mem]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- AES256EncryptRound
val va_code_AES256EncryptRound : n:nat -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_AES256EncryptRound n =
(va_Block (va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) (16 `op_Multiply` n) Secret) (va_CCons (va_code_AESNI_enc
(va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_CNil ()))))
val va_codegen_success_AES256EncryptRound : n:nat -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_AES256EncryptRound n =
(va_pbool_and (va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) (16 `op_Multiply` n) Secret) (va_pbool_and
(va_codegen_success_AESNI_enc (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_AES256EncryptRound (va_mods:va_mods_t) (n:nat) (init:quad32) (round_keys:(seq quad32))
(keys_buffer:buffer128) : (va_quickCode unit (va_code_AES256EncryptRound n)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(va_arg5:Vale.Def.Types_s.quad32) = va_get_xmm 0 va_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 252 column 33 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES_s.commute_sub_bytes_shift_rows va_arg5) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 253 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) (16 `op_Multiply` n) Secret keys_buffer n) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 254 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_enc (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_QEmpty (()))))))
val va_lemma_AES256EncryptRound : va_b0:va_code -> va_s0:va_state -> n:nat -> init:quad32 ->
round_keys:(seq quad32) -> keys_buffer:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AES256EncryptRound n) va_s0 /\ va_get_ok va_s0 /\
(aesni_enabled /\ sse_enabled) /\ (1 <= n /\ n < 14 /\ 14 <= FStar.Seq.Base.length #quad32
round_keys) /\ va_get_xmm 0 va_s0 == Vale.AES.AES_s.eval_rounds_def init round_keys (n - 1) /\
va_get_reg64 rR8 va_s0 == Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 keys_buffer
(va_get_mem_heaplet 0 va_s0) /\ Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0)
(va_get_reg64 rR8 va_s0) keys_buffer 15 (va_get_mem_layout va_s0) Secret /\
Vale.X64.Decls.buffer128_read keys_buffer n (va_get_mem_heaplet 0 va_s0) ==
FStar.Seq.Base.index #quad32 round_keys n))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_get_xmm 0 va_sM == Vale.AES.AES_s.eval_rounds_def init round_keys n /\ va_state_eq va_sM
(va_update_flags va_sM (va_update_xmm 2 va_sM (va_update_xmm 0 va_sM (va_update_ok va_sM
va_s0))))))
[@"opaque_to_smt"]
let va_lemma_AES256EncryptRound va_b0 va_s0 n init round_keys keys_buffer =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok] in
let va_qc = va_qcode_AES256EncryptRound va_mods n init round_keys keys_buffer in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_AES256EncryptRound n) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 232 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 250 column 53 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 0 va_sM == Vale.AES.AES_s.eval_rounds_def init round_keys n)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_AES256EncryptRound (n:nat) (init:quad32) (round_keys:(seq quad32))
(keys_buffer:buffer128) (va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ (aesni_enabled /\ sse_enabled) /\ (1 <= n /\ n < 14 /\ 14 <=
FStar.Seq.Base.length #quad32 round_keys) /\ va_get_xmm 0 va_s0 ==
Vale.AES.AES_s.eval_rounds_def init round_keys (n - 1) /\ va_get_reg64 rR8 va_s0 ==
Vale.X64.Memory.buffer_addr #Vale.X64.Memory.vuint128 keys_buffer (va_get_mem_heaplet 0 va_s0)
/\ Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0) (va_get_reg64 rR8 va_s0)
keys_buffer 15 (va_get_mem_layout va_s0) Secret /\ Vale.X64.Decls.buffer128_read keys_buffer n
(va_get_mem_heaplet 0 va_s0) == FStar.Seq.Base.index #quad32 round_keys n /\ (forall
(va_x_xmm0:quad32) (va_x_xmm2:quad32) (va_x_efl:Vale.X64.Flags.t) . let va_sM = va_upd_flags
va_x_efl (va_upd_xmm 2 va_x_xmm2 (va_upd_xmm 0 va_x_xmm0 va_s0)) in va_get_ok va_sM /\
va_get_xmm 0 va_sM == Vale.AES.AES_s.eval_rounds_def init round_keys n ==> va_k va_sM (())))
val va_wpProof_AES256EncryptRound : n:nat -> init:quad32 -> round_keys:(seq quad32) ->
keys_buffer:buffer128 -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AES256EncryptRound n init round_keys keys_buffer va_s0
va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AES256EncryptRound n) ([va_Mod_flags;
va_Mod_xmm 2; va_Mod_xmm 0]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_AES256EncryptRound n init round_keys keys_buffer va_s0 va_k =
let (va_sM, va_f0) = va_lemma_AES256EncryptRound (va_code_AES256EncryptRound n) va_s0 n init
round_keys keys_buffer in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 2 va_sM (va_update_xmm 0 va_sM
(va_update_ok va_sM va_s0)))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_AES256EncryptRound (n:nat) (init:quad32) (round_keys:(seq quad32))
(keys_buffer:buffer128) : (va_quickCode unit (va_code_AES256EncryptRound n)) =
(va_QProc (va_code_AES256EncryptRound n) ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0])
(va_wp_AES256EncryptRound n init round_keys keys_buffer) (va_wpProof_AES256EncryptRound n init
round_keys keys_buffer))
//--
//-- AES256EncryptBlock
[@ "opaque_to_smt" va_qattr]
let va_code_AES256EncryptBlock () =
(va_Block (va_CCons (va_Block (va_CNil ())) (va_CCons (va_code_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64 rR8) 0 Secret) (va_CCons
(va_code_Pxor (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_CCons (va_code_AES256EncryptRound 1)
(va_CCons (va_code_AES256EncryptRound 2) (va_CCons (va_code_AES256EncryptRound 3) (va_CCons
(va_code_AES256EncryptRound 4) (va_CCons (va_code_AES256EncryptRound 5) (va_CCons
(va_code_AES256EncryptRound 6) (va_CCons (va_code_AES256EncryptRound 7) (va_CCons
(va_code_AES256EncryptRound 8) (va_CCons (va_code_AES256EncryptRound 9) (va_CCons
(va_code_AES256EncryptRound 10) (va_CCons (va_code_AES256EncryptRound 11) (va_CCons
(va_code_AES256EncryptRound 12) (va_CCons (va_code_AES256EncryptRound 13) (va_CCons
(va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) (16 `op_Multiply` 14) Secret) (va_CCons (va_code_AESNI_enc_last (va_op_xmm_xmm 0)
(va_op_xmm_xmm 2)) (va_CCons (va_code_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_CNil
())))))))))))))))))))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_AES256EncryptBlock () =
(va_pbool_and (va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) 0 Secret) (va_pbool_and (va_codegen_success_Pxor (va_op_xmm_xmm 0)
(va_op_xmm_xmm 2)) (va_pbool_and (va_codegen_success_AES256EncryptRound 1) (va_pbool_and
(va_codegen_success_AES256EncryptRound 2) (va_pbool_and (va_codegen_success_AES256EncryptRound
3) (va_pbool_and (va_codegen_success_AES256EncryptRound 4) (va_pbool_and
(va_codegen_success_AES256EncryptRound 5) (va_pbool_and (va_codegen_success_AES256EncryptRound
6) (va_pbool_and (va_codegen_success_AES256EncryptRound 7) (va_pbool_and
(va_codegen_success_AES256EncryptRound 8) (va_pbool_and (va_codegen_success_AES256EncryptRound
9) (va_pbool_and (va_codegen_success_AES256EncryptRound 10) (va_pbool_and
(va_codegen_success_AES256EncryptRound 11) (va_pbool_and (va_codegen_success_AES256EncryptRound
12) (va_pbool_and (va_codegen_success_AES256EncryptRound 13) (va_pbool_and
(va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2)
(va_op_reg_opr64_reg64 rR8) (16 `op_Multiply` 14) Secret) (va_pbool_and
(va_codegen_success_AESNI_enc_last (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_pbool_and
(va_codegen_success_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (va_ttrue ())))))))))))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_AES256EncryptBlock (va_mods:va_mods_t) (input:quad32) (key:(seq nat32))
(round_keys:(seq quad32)) (keys_buffer:buffer128) : (va_quickCode unit
(va_code_AES256EncryptBlock ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_qAssertSquash
va_range1
"***** EXPRESSION PRECONDITIONS NOT MET WITHIN line 280 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
((fun a_539 (s_540:(FStar.Seq.Base.seq a_539)) (i_541:Prims.nat) -> let (i_515:Prims.nat) =
i_541 in Prims.b2t (Prims.op_LessThan i_515 (FStar.Seq.Base.length #a_539 s_540)))
Vale.Def.Types_s.quad32 round_keys 0) (fun _ -> let (init:Vale.Def.Types_s.quad32) =
Vale.Def.Types_s.quad32_xor input (FStar.Seq.Base.index #Vale.Def.Types_s.quad32 round_keys 0)
in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 282 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) 0 Secret keys_buffer 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 283 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 284 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 1 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 285 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 2 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 286 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 3 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 287 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 4 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 288 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 5 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 289 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 6 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 290 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 7 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 291 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 8 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 292 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 9 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 293 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 10 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 294 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 11 init round_keys keys_buffer) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 295 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 12 init round_keys keys_buffer) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 296 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptRound 13 init round_keys keys_buffer) (fun (va_s:va_state) _ -> let
(va_arg24:Vale.Def.Types_s.quad32) = va_get_xmm 0 va_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 297 column 33 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES_s.commute_sub_bytes_shift_rows va_arg24) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 298 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 2) (va_op_reg_opr64_reg64
rR8) (16 `op_Multiply` 14) Secret keys_buffer 14) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 299 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AESNI_enc_last (va_op_xmm_xmm 0) (va_op_xmm_xmm 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 302 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Pxor (va_op_xmm_xmm 2) (va_op_xmm_xmm 2)) (fun (va_s:va_state) _ -> va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 303 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(fun (_:unit) -> Vale.AES.AES_s.aes_encrypt_LE_reveal ()) (va_QEmpty (()))))))))))))))))))))))))
[@"opaque_to_smt"]
let va_lemma_AES256EncryptBlock va_b0 va_s0 input key round_keys keys_buffer =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok] in
let va_qc = va_qcode_AES256EncryptBlock va_mods input key round_keys keys_buffer in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_AES256EncryptBlock ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 257 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 278 column 52 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_xmm 0 va_sM == Vale.AES.AES_s.aes_encrypt_LE AES_256 key input)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_AES256EncryptBlock input key round_keys keys_buffer va_s0 va_k =
let (va_sM, va_f0) = va_lemma_AES256EncryptBlock (va_code_AES256EncryptBlock ()) va_s0 input key
round_keys keys_buffer in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 2 va_sM (va_update_xmm 0 va_sM
(va_update_ok va_sM va_s0)))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_xmm 2; va_Mod_xmm 0]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- AES256EncryptBlockStdcall
[@ "opaque_to_smt" va_qattr]
let va_code_AES256EncryptBlockStdcall win =
(va_Block (va_CCons (if win then va_Block (va_CCons (va_code_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 0) (va_op_reg_opr64_reg64 rRdx) 0 Secret) (va_CNil
())) else va_Block (va_CCons (va_code_Load128_buffer (va_op_heaplet_mem_heaplet 0)
(va_op_xmm_xmm 0) (va_op_reg_opr64_reg64 rRsi) 0 Secret) (va_CCons (va_code_Mov64
(va_op_dst_opr64_reg64 rR8) (va_op_opr64_reg64 rRdx)) (va_CNil ())))) (va_CCons (va_Block
(va_CNil ())) (va_CCons (va_code_AES256EncryptBlock ()) (va_CCons (if win then va_Block
(va_CCons (va_code_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRcx)
(va_op_xmm_xmm 0) 0 Secret) (va_CNil ())) else va_Block (va_CCons (va_code_Store128_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdi) (va_op_xmm_xmm 0) 0 Secret) (va_CNil
()))) (va_CNil ()))))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_AES256EncryptBlockStdcall win =
(va_pbool_and (if win then va_pbool_and (va_codegen_success_Load128_buffer
(va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 0) (va_op_reg_opr64_reg64 rRdx) 0 Secret)
(va_ttrue ()) else va_pbool_and (va_codegen_success_Load128_buffer (va_op_heaplet_mem_heaplet
0) (va_op_xmm_xmm 0) (va_op_reg_opr64_reg64 rRsi) 0 Secret) (va_pbool_and
(va_codegen_success_Mov64 (va_op_dst_opr64_reg64 rR8) (va_op_opr64_reg64 rRdx)) (va_ttrue ())))
(va_pbool_and (va_codegen_success_AES256EncryptBlock ()) (va_pbool_and (if win then
va_pbool_and (va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1)
(va_op_reg_opr64_reg64 rRcx) (va_op_xmm_xmm 0) 0 Secret) (va_ttrue ()) else va_pbool_and
(va_codegen_success_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdi)
(va_op_xmm_xmm 0) 0 Secret) (va_ttrue ())) (va_ttrue ()))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_AES256EncryptBlockStdcall (va_mods:va_mods_t) (win:bool) (input:quad32) (key:(seq
nat32)) (input_buffer:buffer128) (output_buffer:buffer128) (keys_buffer:buffer128) :
(va_quickCode unit (va_code_AES256EncryptBlockStdcall win)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(output_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRcx
va_s) (fun _ -> va_get_reg64 rRdi va_s) in let (input_ptr:(va_int_range 0
18446744073709551615)) = va_if win (fun _ -> va_get_reg64 rRdx va_s) (fun _ -> va_get_reg64
rRsi va_s) in let (expanded_key_ptr:(va_int_range 0 18446744073709551615)) = va_if win (fun _
-> va_get_reg64 rR8 va_s) (fun _ -> va_get_reg64 rRdx va_s) in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 338 column 15 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_qInlineIf va_mods win (qblock va_mods (fun (va_s:va_state) -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 340 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 0) (va_op_reg_opr64_reg64
rRdx) 0 Secret input_buffer 0) (va_QEmpty (())))) (qblock va_mods (fun (va_s:va_state) ->
va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 344 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Load128_buffer (va_op_heaplet_mem_heaplet 0) (va_op_xmm_xmm 0) (va_op_reg_opr64_reg64
rRsi) 0 Secret input_buffer 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 345 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Mov64 (va_op_dst_opr64_reg64 rR8) (va_op_opr64_reg64 rRdx)) (va_QEmpty (())))))) (fun
(va_s:va_state) va_g -> va_qAssertSquash va_range1
"***** EXPRESSION PRECONDITIONS NOT MET WITHIN line 348 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
((fun (alg_10150:Vale.AES.AES_common_s.algorithm) (key_10151:(FStar.Seq.Base.seq
Vale.Def.Types_s.nat32)) -> Vale.AES.AES_s.is_aes_key_LE alg_10150 key_10151) AES_256 key) (fun
_ -> va_QBind va_range1
"***** PRECONDITION NOT MET AT line 348 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_AES256EncryptBlock input key (Vale.AES.AES_s.key_to_round_keys_LE AES_256 key)
keys_buffer) (fun (va_s:va_state) _ -> va_QBind va_range1
"***** PRECONDITION NOT MET AT line 350 column 15 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_qInlineIf va_mods win (qblock va_mods (fun (va_s:va_state) -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 352 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRcx)
(va_op_xmm_xmm 0) 0 Secret output_buffer 0) (va_QEmpty (())))) (qblock va_mods (fun
(va_s:va_state) -> va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 356 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_quick_Store128_buffer (va_op_heaplet_mem_heaplet 1) (va_op_reg_opr64_reg64 rRdi)
(va_op_xmm_xmm 0) 0 Secret output_buffer 0) (va_QEmpty (()))))) (fun (va_s:va_state) va_g ->
va_QEmpty (()))))))) | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsVector.fsti.checked",
"Vale.X64.InsMem.fsti.checked",
"Vale.X64.InsBasic.fsti.checked",
"Vale.X64.InsAes.fsti.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.AES_s.fst.checked",
"Vale.AES.AES_common_s.fst.checked",
"Vale.AES.AES256_helpers.fsti.checked",
"prims.fst.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Vale.AES.X64.AES256.fst"
} | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES256_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsAes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES256_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsAes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 20,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
win: Prims.bool ->
input: Vale.X64.Decls.quad32 ->
key: FStar.Seq.Base.seq Vale.X64.Memory.nat32 ->
input_buffer: Vale.X64.Memory.buffer128 ->
output_buffer: Vale.X64.Memory.buffer128 ->
keys_buffer: Vale.X64.Memory.buffer128
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Prims.bool",
"Vale.X64.Decls.quad32",
"FStar.Seq.Base.seq",
"Vale.X64.Memory.nat32",
"Vale.X64.Memory.buffer128",
"Vale.X64.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_Mod_xmm",
"Vale.X64.QuickCode.va_Mod_mem_heaplet",
"Vale.X64.QuickCode.va_Mod_reg64",
"Vale.X64.Machine_s.rR8",
"Vale.X64.QuickCode.va_Mod_ok",
"Vale.X64.QuickCode.va_Mod_mem",
"Prims.Nil",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"Prims.list",
"Vale.X64.QuickCode.__proj__QProc__item__mods",
"Vale.AES.X64.AES256.va_code_AES256EncryptBlockStdcall",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.tuple3",
"Vale.X64.State.vale_state",
"Vale.X64.QuickCodes.va_wp_sound_code_norm",
"Prims.l_and",
"Vale.X64.QuickCodes.label",
"Vale.X64.QuickCodes.va_range1",
"Prims.b2t",
"Vale.X64.Decls.va_get_ok",
"Vale.X64.Decls.modifies_mem",
"Vale.X64.Decls.loc_buffer",
"Vale.X64.Memory.vuint128",
"Vale.X64.Decls.va_get_mem_heaplet",
"Vale.Def.Types_s.quad32",
"Vale.X64.Decls.buffer128_read",
"Vale.AES.AES_s.aes_encrypt_LE",
"Vale.AES.AES_common_s.AES_256",
"Vale.X64.Decls.va_int_range",
"Vale.X64.Decls.va_if",
"Vale.Def.Types_s.nat64",
"Vale.X64.Decls.va_get_reg64",
"Prims.l_not",
"Vale.X64.Machine_s.rRdx",
"Vale.X64.Machine_s.rRsi",
"Vale.X64.Machine_s.rRcx",
"Vale.X64.Machine_s.rRdi",
"Vale.X64.QuickCode.quickCode",
"Vale.AES.X64.AES256.va_qcode_AES256EncryptBlockStdcall"
] | [] | false | false | false | false | false | let va_lemma_AES256EncryptBlockStdcall
va_b0
va_s0
win
input
key
input_buffer
output_buffer
keys_buffer
=
| let va_mods:va_mods_t =
[
va_Mod_flags;
va_Mod_xmm 2;
va_Mod_xmm 0;
va_Mod_mem_heaplet 1;
va_Mod_reg64 rR8;
va_Mod_ok;
va_Mod_mem
]
in
let va_qc =
va_qcode_AES256EncryptBlockStdcall va_mods win input key input_buffer output_buffer keys_buffer
in
let va_sM, va_fM, va_g =
va_wp_sound_code_norm (va_code_AES256EncryptBlockStdcall win)
va_qc
va_s0
(fun va_s0 va_sM va_g ->
let () = va_g in
label va_range1
"***** POSTCONDITION NOT MET AT line 306 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(va_get_ok va_sM) /\
(let output_ptr:(va_int_range 0 18446744073709551615) =
va_if win (fun _ -> va_get_reg64 rRcx va_s0) (fun _ -> va_get_reg64 rRdi va_s0)
in
let input_ptr:(va_int_range 0 18446744073709551615) =
va_if win (fun _ -> va_get_reg64 rRdx va_s0) (fun _ -> va_get_reg64 rRsi va_s0)
in
let expanded_key_ptr:(va_int_range 0 18446744073709551615) =
va_if win (fun _ -> va_get_reg64 rR8 va_s0) (fun _ -> va_get_reg64 rRdx va_s0)
in
label va_range1
"***** POSTCONDITION NOT MET AT line 335 column 67 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.modifies_mem (Vale.X64.Decls.loc_buffer #Vale.X64.Memory.vuint128
output_buffer)
(va_get_mem_heaplet 1 va_s0)
(va_get_mem_heaplet 1 va_sM)) /\
label va_range1
"***** POSTCONDITION NOT MET AT line 336 column 87 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/x64/Vale.AES.X64.AES256.vaf *****"
(Vale.X64.Decls.buffer128_read output_buffer 0 (va_get_mem_heaplet 1 va_sM) ==
Vale.AES.AES_s.aes_encrypt_LE AES_256 key input)))
in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([
va_Mod_flags;
va_Mod_xmm 2;
va_Mod_xmm 0;
va_Mod_mem_heaplet 1;
va_Mod_reg64 rR8;
va_Mod_ok;
va_Mod_mem
])
va_sM
va_s0;
(va_sM, va_fM) | false |
Hacl.Impl.Frodo.Pack.fst | Hacl.Impl.Frodo.Pack.frodo_pack8 | val frodo_pack8:
d:size_t{v d <= 16}
-> a:lbuffer uint16 8ul
-> res:lbytes d
-> Stack unit
(requires fun h0 -> live h0 a /\ live h0 res /\ disjoint a res)
(ensures fun h0 _ h1 ->
modifies1 res h0 h1 /\
as_seq h1 res == S.frodo_pack8 (v d) (as_seq h0 a)) | val frodo_pack8:
d:size_t{v d <= 16}
-> a:lbuffer uint16 8ul
-> res:lbytes d
-> Stack unit
(requires fun h0 -> live h0 a /\ live h0 res /\ disjoint a res)
(ensures fun h0 _ h1 ->
modifies1 res h0 h1 /\
as_seq h1 res == S.frodo_pack8 (v d) (as_seq h0 a)) | let frodo_pack8 d a res =
let h0 = ST.get() in
push_frame();
let maskd = to_u16 (u32 1 <<. d) -. u16 1 in
let v16 = create (size 16) (u8 0) in
let a0 = index a (size 0) &. maskd in
let a1 = index a (size 1) &. maskd in
let a2 = index a (size 2) &. maskd in
let a3 = index a (size 3) &. maskd in
let a4 = index a (size 4) &. maskd in
let a5 = index a (size 5) &. maskd in
let a6 = index a (size 6) &. maskd in
let a7 = index a (size 7) &. maskd in
let templong =
to_u128 a0 <<. (size 7 *! d)
|. to_u128 a1 <<. (size 6 *! d)
|. to_u128 a2 <<. (size 5 *! d)
|. to_u128 a3 <<. (size 4 *! d)
|. to_u128 a4 <<. (size 3 *! d)
|. to_u128 a5 <<. (size 2 *! d)
|. to_u128 a6 <<. (size 1 *! d)
|. to_u128 a7 <<. (size 0 *! d)
in
uint_to_bytes_be v16 templong;
let src = sub v16 (size 16 -! d) d in // Skips the 1st byte when d = 15
copy res src;
pop_frame() | {
"file_name": "code/frodo/Hacl.Impl.Frodo.Pack.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 13,
"end_line": 63,
"start_col": 0,
"start_line": 37
} | module Hacl.Impl.Frodo.Pack
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Hacl.Impl.Matrix
module ST = FStar.HyperStack.ST
module Loops = Lib.LoopCombinators
module Seq = Lib.Sequence
module S = Spec.Frodo.Pack
#reset-options "--z3rlimit 100 --max_fuel 0 --max_ifuel 0 --using_facts_from '* -Spec +Spec.Frodo.Pack +Spec.Matrix'"
val lemma_split: #a:Type -> #len:size_nat -> s:Seq.lseq a len -> i:size_nat{i <= len} ->
Lemma (s == Seq.(Seq.sub s 0 i @| Seq.sub s i (len - i)))
let lemma_split #a #len s i =
FStar.Seq.lemma_split s i
/// Pack
inline_for_extraction noextract
val frodo_pack8:
d:size_t{v d <= 16}
-> a:lbuffer uint16 8ul
-> res:lbytes d
-> Stack unit
(requires fun h0 -> live h0 a /\ live h0 res /\ disjoint a res)
(ensures fun h0 _ h1 ->
modifies1 res h0 h1 /\ | {
"checked_file": "/",
"dependencies": [
"Spec.Frodo.Pack.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.Matrix.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": false,
"source_file": "Hacl.Impl.Frodo.Pack.fst"
} | [
{
"abbrev": true,
"full_module": "Spec.Frodo.Pack",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "Seq"
},
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Matrix",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Buffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 100,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
d: Lib.IntTypes.size_t{Lib.IntTypes.v d <= 16} ->
a: Lib.Buffer.lbuffer Lib.IntTypes.uint16 8ul ->
res: Hacl.Impl.Matrix.lbytes d
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint16",
"FStar.UInt32.__uint_to_t",
"Hacl.Impl.Matrix.lbytes",
"FStar.HyperStack.ST.pop_frame",
"Prims.unit",
"Lib.Buffer.copy",
"Lib.Buffer.MUT",
"Lib.IntTypes.uint8",
"Lib.Buffer.lbuffer_t",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Lib.Buffer.sub",
"Lib.IntTypes.uint_t",
"Lib.IntTypes.size",
"Lib.IntTypes.op_Subtraction_Bang",
"Lib.ByteBuffer.uint_to_bytes_be",
"Lib.IntTypes.U128",
"Lib.IntTypes.op_Bar_Dot",
"Lib.IntTypes.op_Less_Less_Dot",
"Lib.IntTypes.to_u128",
"Lib.IntTypes.U16",
"Lib.IntTypes.op_Star_Bang",
"Lib.IntTypes.op_Amp_Dot",
"Lib.Buffer.index",
"Lib.IntTypes.mk_int",
"Lib.Buffer.create",
"Lib.IntTypes.u8",
"Lib.IntTypes.op_Subtraction_Dot",
"Lib.IntTypes.to_u16",
"Lib.IntTypes.u32",
"Lib.IntTypes.u16",
"FStar.HyperStack.ST.push_frame",
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.ST.get"
] | [] | false | true | false | false | false | let frodo_pack8 d a res =
| let h0 = ST.get () in
push_frame ();
let maskd = to_u16 (u32 1 <<. d) -. u16 1 in
let v16 = create (size 16) (u8 0) in
let a0 = index a (size 0) &. maskd in
let a1 = index a (size 1) &. maskd in
let a2 = index a (size 2) &. maskd in
let a3 = index a (size 3) &. maskd in
let a4 = index a (size 4) &. maskd in
let a5 = index a (size 5) &. maskd in
let a6 = index a (size 6) &. maskd in
let a7 = index a (size 7) &. maskd in
let templong =
to_u128 a0 <<. (size 7 *! d) |. to_u128 a1 <<. (size 6 *! d) |. to_u128 a2 <<. (size 5 *! d) |.
to_u128 a3 <<. (size 4 *! d) |.
to_u128 a4 <<. (size 3 *! d) |.
to_u128 a5 <<. (size 2 *! d) |.
to_u128 a6 <<. (size 1 *! d) |.
to_u128 a7 <<. (size 0 *! d)
in
uint_to_bytes_be v16 templong;
let src = sub v16 (size 16 -! d) d in
copy res src;
pop_frame () | false |
Hacl.Impl.Frodo.Pack.fst | Hacl.Impl.Frodo.Pack.frodo_unpack | val frodo_unpack:
n1:size_t
-> n2:size_t{v n1 * v n2 <= max_size_t /\ (v n1 * v n2) % 8 = 0}
-> d:size_t{v d * (v n1 * v n2 / 8) <= max_size_t /\ v d <= 16}
-> b:lbytes (d *! (n1 *! n2 /. size 8))
-> res:matrix_t n1 n2
-> Stack unit
(requires fun h -> live h b /\ live h res /\ disjoint b res)
(ensures fun h0 _ h1 ->
modifies1 res h0 h1 /\
as_seq h1 res == S.frodo_unpack #(v n1) #(v n2) (v d) (as_seq h0 b)) | val frodo_unpack:
n1:size_t
-> n2:size_t{v n1 * v n2 <= max_size_t /\ (v n1 * v n2) % 8 = 0}
-> d:size_t{v d * (v n1 * v n2 / 8) <= max_size_t /\ v d <= 16}
-> b:lbytes (d *! (n1 *! n2 /. size 8))
-> res:matrix_t n1 n2
-> Stack unit
(requires fun h -> live h b /\ live h res /\ disjoint b res)
(ensures fun h0 _ h1 ->
modifies1 res h0 h1 /\
as_seq h1 res == S.frodo_unpack #(v n1) #(v n2) (v d) (as_seq h0 b)) | let frodo_unpack n1 n2 d b res =
let n = n1 *! n2 /. size 8 in
let a_spec = S.frodo_unpack_state #(v n1) #(v n2) in
[@inline_let]
let refl h (i:size_nat{i <= v n}) = Seq.sub (as_seq h res) 0 (8 * i) in
let footprint (i:size_nat{i <= v n}) = loc res in
[@inline_let]
let spec h0 = S.frodo_unpack_inner #(v n1) #(v n2) (v d) (as_seq h0 b) in
let h0 = ST.get() in
loop h0 n a_spec refl footprint spec (frodo_unpack_loop n1 n2 d b res h0) | {
"file_name": "code/frodo/Hacl.Impl.Frodo.Pack.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 75,
"end_line": 193,
"start_col": 0,
"start_line": 184
} | module Hacl.Impl.Frodo.Pack
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Hacl.Impl.Matrix
module ST = FStar.HyperStack.ST
module Loops = Lib.LoopCombinators
module Seq = Lib.Sequence
module S = Spec.Frodo.Pack
#reset-options "--z3rlimit 100 --max_fuel 0 --max_ifuel 0 --using_facts_from '* -Spec +Spec.Frodo.Pack +Spec.Matrix'"
val lemma_split: #a:Type -> #len:size_nat -> s:Seq.lseq a len -> i:size_nat{i <= len} ->
Lemma (s == Seq.(Seq.sub s 0 i @| Seq.sub s i (len - i)))
let lemma_split #a #len s i =
FStar.Seq.lemma_split s i
/// Pack
inline_for_extraction noextract
val frodo_pack8:
d:size_t{v d <= 16}
-> a:lbuffer uint16 8ul
-> res:lbytes d
-> Stack unit
(requires fun h0 -> live h0 a /\ live h0 res /\ disjoint a res)
(ensures fun h0 _ h1 ->
modifies1 res h0 h1 /\
as_seq h1 res == S.frodo_pack8 (v d) (as_seq h0 a))
let frodo_pack8 d a res =
let h0 = ST.get() in
push_frame();
let maskd = to_u16 (u32 1 <<. d) -. u16 1 in
let v16 = create (size 16) (u8 0) in
let a0 = index a (size 0) &. maskd in
let a1 = index a (size 1) &. maskd in
let a2 = index a (size 2) &. maskd in
let a3 = index a (size 3) &. maskd in
let a4 = index a (size 4) &. maskd in
let a5 = index a (size 5) &. maskd in
let a6 = index a (size 6) &. maskd in
let a7 = index a (size 7) &. maskd in
let templong =
to_u128 a0 <<. (size 7 *! d)
|. to_u128 a1 <<. (size 6 *! d)
|. to_u128 a2 <<. (size 5 *! d)
|. to_u128 a3 <<. (size 4 *! d)
|. to_u128 a4 <<. (size 3 *! d)
|. to_u128 a5 <<. (size 2 *! d)
|. to_u128 a6 <<. (size 1 *! d)
|. to_u128 a7 <<. (size 0 *! d)
in
uint_to_bytes_be v16 templong;
let src = sub v16 (size 16 -! d) d in // Skips the 1st byte when d = 15
copy res src;
pop_frame()
val frodo_pack:
#n1:size_t
-> #n2:size_t{v n1 * v n2 <= max_size_t /\ (v n1 * v n2) % 8 = 0}
-> d:size_t{v d * ((v n1 * v n2) / 8) <= max_size_t /\ v d <= 16}
-> a:matrix_t n1 n2
-> res:lbytes (d *! ((n1 *! n2) /. size 8))
-> Stack unit
(requires fun h -> live h a /\ live h res /\ disjoint a res)
(ensures fun h0 _ h1 ->
modifies1 res h0 h1 /\
as_seq h1 res == S.frodo_pack (v d) (as_matrix h0 a))
#push-options "--z3rlimit 400"
[@"c_inline"]
let frodo_pack #n1 #n2 d a res =
let n = (n1 *! n2) /. size 8 in
let a_spec = S.frodo_pack_state #(v n1) #(v n2) (v d) in
[@ inline_let]
let refl h (i:size_nat{i <= v n}) = Seq.sub (as_seq h res) 0 (v d * i) in
let footprint (i:size_nat{i <= v n}) = loc res in
[@ inline_let]
let spec h0 = S.frodo_pack_inner #(v n1) #(v n2) (v d) (as_seq h0 a) in
let h0 = ST.get() in
assert (Seq.equal (refl h0 0) (Seq.create 0 (u8 0)));
loop h0 n a_spec refl footprint spec
(fun i ->
FStar.Math.Lemmas.lemma_mult_le_left (v d) (v i + 1) (v n);
assert (v (d *! i +! d) <= v (d *! ((n1 *! n2) /. size 8)));
Loops.unfold_repeat_gen (v n) a_spec (spec h0) (refl h0 0) (v i);
let a = sub a (size 8 *! i) (size 8) in
let r = sub res (d *! i) d in
frodo_pack8 d a r;
let h = ST.get() in
lemma_split (refl h (v i + 1)) (v d * v i)
)
#pop-options
/// Unpack
inline_for_extraction noextract
[@"opaque_to_smt"]
val frodo_unpack8:
d:size_t{v d <= 16}
-> b:lbytes d
-> res:lbuffer uint16 8ul
-> Stack unit
(requires fun h0 -> live h0 b /\ live h0 res)
(ensures fun h0 _ h1 ->
modifies1 res h0 h1 /\
Seq.equal (as_seq h1 res) (S.frodo_unpack8 (v d) (as_seq h0 b)))
let frodo_unpack8 d b res =
let h0 = ST.get() in
push_frame();
let maskd = to_u16 (u32 1 <<. d) -. u16 1 in
let src = create (size 16) (u8 0) in
update_sub src (size 16 -! d) d b;
let templong = uint_from_bytes_be #U128 #SEC src in
res.(size 0) <- to_u16 (templong >>. (size 7 *! d)) &. maskd;
res.(size 1) <- to_u16 (templong >>. (size 6 *! d)) &. maskd;
res.(size 2) <- to_u16 (templong >>. (size 5 *! d)) &. maskd;
res.(size 3) <- to_u16 (templong >>. (size 4 *! d)) &. maskd;
res.(size 4) <- to_u16 (templong >>. (size 3 *! d)) &. maskd;
res.(size 5) <- to_u16 (templong >>. (size 2 *! d)) &. maskd;
res.(size 6) <- to_u16 (templong >>. (size 1 *! d)) &. maskd;
res.(size 7) <- to_u16 (templong >>. (size 0 *! d)) &. maskd;
pop_frame()
// 2018.11.21 SZ: Inlining this below doesn't work. Hard to say why.
inline_for_extraction noextract
val frodo_unpack_loop:
n1:size_t
-> n2:size_t{v n1 * v n2 <= max_size_t /\ (v n1 * v n2) % 8 = 0}
-> d:size_t{v d * (v n1 * v n2 / 8) <= max_size_t /\ v d <= 16}
-> b:lbytes (d *! (n1 *! n2 /. size 8))
-> res:matrix_t n1 n2
-> h0:mem{live h0 b /\ live h0 res /\ disjoint b res}
-> i:size_t{v i < v n1 * v n2 / 8}
-> Stack unit
(requires
loop_inv h0 (n1 *! n2 /. size 8)
(S.frodo_unpack_state #(v n1) #(v n2))
(fun h i -> Seq.sub (as_seq h res) 0 (8 * i))
(fun i -> loc res)
(fun h0 -> S.frodo_unpack_inner #(v n1) #(v n2) (v d) (as_seq h0 b))
(v i))
(ensures fun _ _ ->
loop_inv h0 (n1 *! n2 /. size 8)
(S.frodo_unpack_state #(v n1) #(v n2))
(fun h i -> Seq.sub (as_seq h res) 0 (8 * i))
(fun i -> loc res)
(fun h0 -> S.frodo_unpack_inner #(v n1) #(v n2) (v d) (as_seq h0 b))
(v i + 1))
let frodo_unpack_loop n1 n2 d b res h0 i =
let n = n1 *! n2 /. size 8 in
let a_spec = S.frodo_unpack_state #(v n1) #(v n2) in
[@inline_let]
let refl h (i:size_nat{i <= v n}) = Seq.sub (as_seq h res) 0 (8 * i) in
let footprint (i:size_nat{i <= v n}) = loc res in
[@inline_let]
let spec h0 = S.frodo_unpack_inner #(v n1) #(v n2) (v d) (as_seq h0 b) in
Loops.unfold_repeat_gen (v n) a_spec (spec h0) (refl h0 0) (v i);
let b = sub b (d *! i) d in
let r = sub res (size 8 *! i) (size 8) in
frodo_unpack8 d b r;
let h = ST.get() in
lemma_split (refl h (v i + 1)) (8 * v i)
val frodo_unpack:
n1:size_t
-> n2:size_t{v n1 * v n2 <= max_size_t /\ (v n1 * v n2) % 8 = 0}
-> d:size_t{v d * (v n1 * v n2 / 8) <= max_size_t /\ v d <= 16}
-> b:lbytes (d *! (n1 *! n2 /. size 8))
-> res:matrix_t n1 n2
-> Stack unit
(requires fun h -> live h b /\ live h res /\ disjoint b res)
(ensures fun h0 _ h1 ->
modifies1 res h0 h1 /\
as_seq h1 res == S.frodo_unpack #(v n1) #(v n2) (v d) (as_seq h0 b)) | {
"checked_file": "/",
"dependencies": [
"Spec.Frodo.Pack.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.Matrix.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": false,
"source_file": "Hacl.Impl.Frodo.Pack.fst"
} | [
{
"abbrev": true,
"full_module": "Spec.Frodo.Pack",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "Seq"
},
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Matrix",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Buffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 100,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
n1: Lib.IntTypes.size_t ->
n2:
Lib.IntTypes.size_t
{ Lib.IntTypes.v n1 * Lib.IntTypes.v n2 <= Lib.IntTypes.max_size_t /\
Lib.IntTypes.v n1 * Lib.IntTypes.v n2 % 8 = 0 } ->
d:
Lib.IntTypes.size_t
{ Lib.IntTypes.v d * (Lib.IntTypes.v n1 * Lib.IntTypes.v n2 / 8) <= Lib.IntTypes.max_size_t /\
Lib.IntTypes.v d <= 16 } ->
b: Hacl.Impl.Matrix.lbytes (d *! (n1 *! n2 /. Lib.IntTypes.size 8)) ->
res: Hacl.Impl.Matrix.matrix_t n1 n2
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Lib.IntTypes.size_t",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Lib.IntTypes.max_size_t",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Prims.op_Division",
"Hacl.Impl.Matrix.lbytes",
"Lib.IntTypes.op_Star_Bang",
"Lib.IntTypes.op_Slash_Dot",
"Lib.IntTypes.size",
"Hacl.Impl.Matrix.matrix_t",
"Lib.Buffer.loop",
"Hacl.Impl.Frodo.Pack.frodo_unpack_loop",
"Prims.unit",
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.ST.get",
"Prims.nat",
"Prims.op_Subtraction",
"Prims.pow2",
"Prims.op_LessThan",
"Prims.op_Multiply",
"Spec.Frodo.Pack.frodo_unpack_state",
"Prims.op_Addition",
"Spec.Frodo.Pack.frodo_unpack_inner",
"Lib.Buffer.as_seq",
"Lib.Buffer.MUT",
"Lib.IntTypes.uint8",
"LowStar.Monotonic.Buffer.loc",
"Lib.IntTypes.size_nat",
"Lib.Buffer.loc",
"Hacl.Impl.Matrix.elem",
"Lib.Sequence.lseq",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U16",
"Lib.IntTypes.SEC",
"Prims.eq2",
"FStar.Seq.Base.seq",
"Lib.Sequence.to_seq",
"FStar.Seq.Base.slice",
"Lib.IntTypes.mul",
"Prims.l_Forall",
"Prims.l_or",
"FStar.Seq.Base.index",
"Lib.Sequence.index",
"Lib.Sequence.sub"
] | [] | false | true | false | false | false | let frodo_unpack n1 n2 d b res =
| let n = n1 *! n2 /. size 8 in
let a_spec = S.frodo_unpack_state #(v n1) #(v n2) in
[@@ inline_let ]let refl h (i: size_nat{i <= v n}) = Seq.sub (as_seq h res) 0 (8 * i) in
let footprint (i: size_nat{i <= v n}) = loc res in
[@@ inline_let ]let spec h0 = S.frodo_unpack_inner #(v n1) #(v n2) (v d) (as_seq h0 b) in
let h0 = ST.get () in
loop h0 n a_spec refl footprint spec (frodo_unpack_loop n1 n2 d b res h0) | false |
Vale.Poly1305.Equiv.fsti | Vale.Poly1305.Equiv.secrecy_level | val secrecy_level : Type0 | let secrecy_level = Lib.IntTypes.secrecy_level | {
"file_name": "vale/code/crypto/poly1305/Vale.Poly1305.Equiv.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 53,
"end_line": 9,
"start_col": 7,
"start_line": 9
} | module Vale.Poly1305.Equiv
open FStar.Mul
open FStar.Seq.Base
module S = Spec.Poly1305
module V = Vale.Poly1305.Spec_s | {
"checked_file": "/",
"dependencies": [
"Vale.Poly1305.Spec_s.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Poly1305.Equiv.fsti"
} | [
{
"abbrev": true,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "Spec.Poly1305",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"Lib.IntTypes.secrecy_level"
] | [] | false | false | false | true | true | let secrecy_level =
| Lib.IntTypes.secrecy_level | false |
|
Vale.Poly1305.Equiv.fsti | Vale.Poly1305.Equiv.bytes | val bytes : Type0 | let bytes = Lib.ByteSequence.bytes | {
"file_name": "vale/code/crypto/poly1305/Vale.Poly1305.Equiv.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 41,
"end_line": 10,
"start_col": 7,
"start_line": 10
} | module Vale.Poly1305.Equiv
open FStar.Mul
open FStar.Seq.Base
module S = Spec.Poly1305
module V = Vale.Poly1305.Spec_s
unfold let nat128 = Vale.Def.Words_s.nat128 | {
"checked_file": "/",
"dependencies": [
"Vale.Poly1305.Spec_s.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Poly1305.Equiv.fsti"
} | [
{
"abbrev": true,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "Spec.Poly1305",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"Lib.ByteSequence.bytes"
] | [] | false | false | false | true | true | let bytes =
| Lib.ByteSequence.bytes | false |
|
Vale.Poly1305.Equiv.fsti | Vale.Poly1305.Equiv.nat128 | val nat128 : Type0 | let nat128 = Vale.Def.Words_s.nat128 | {
"file_name": "vale/code/crypto/poly1305/Vale.Poly1305.Equiv.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 43,
"end_line": 8,
"start_col": 7,
"start_line": 8
} | module Vale.Poly1305.Equiv
open FStar.Mul
open FStar.Seq.Base
module S = Spec.Poly1305
module V = Vale.Poly1305.Spec_s | {
"checked_file": "/",
"dependencies": [
"Vale.Poly1305.Spec_s.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Poly1305.Equiv.fsti"
} | [
{
"abbrev": true,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "Spec.Poly1305",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Words_s.nat128"
] | [] | false | false | false | true | true | let nat128 =
| Vale.Def.Words_s.nat128 | false |
|
Vale.Poly1305.Equiv.fsti | Vale.Poly1305.Equiv.nat_from_bytes_le | val nat_from_bytes_le : b: Lib.Sequence.seq (Lib.IntTypes.int_t Lib.IntTypes.U8 l)
-> n: Prims.nat{n < Prims.pow2 (Lib.Sequence.length b * 8)} | let nat_from_bytes_le (#l:secrecy_level) = Lib.ByteSequence.nat_from_bytes_le #l | {
"file_name": "vale/code/crypto/poly1305/Vale.Poly1305.Equiv.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 87,
"end_line": 11,
"start_col": 7,
"start_line": 11
} | module Vale.Poly1305.Equiv
open FStar.Mul
open FStar.Seq.Base
module S = Spec.Poly1305
module V = Vale.Poly1305.Spec_s
unfold let nat128 = Vale.Def.Words_s.nat128
unfold let secrecy_level = Lib.IntTypes.secrecy_level | {
"checked_file": "/",
"dependencies": [
"Vale.Poly1305.Spec_s.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Poly1305.Equiv.fsti"
} | [
{
"abbrev": true,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "Spec.Poly1305",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | b: Lib.Sequence.seq (Lib.IntTypes.int_t Lib.IntTypes.U8 l)
-> n: Prims.nat{n < Prims.pow2 (Lib.Sequence.length b * 8)} | Prims.Tot | [
"total"
] | [] | [
"Vale.Poly1305.Equiv.secrecy_level",
"Lib.ByteSequence.nat_from_bytes_le",
"Lib.Sequence.seq",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"Prims.op_Multiply",
"Lib.Sequence.length"
] | [] | false | false | false | false | false | let nat_from_bytes_le (#l: secrecy_level) =
| Lib.ByteSequence.nat_from_bytes_le #l | false |
|
Vale.Poly1305.Equiv.fsti | Vale.Poly1305.Equiv.size_block | val size_block : n: Prims.nat{n <= Prims.pow2 32 - 1} | let size_block = S.size_block | {
"file_name": "vale/code/crypto/poly1305/Vale.Poly1305.Equiv.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 36,
"end_line": 13,
"start_col": 7,
"start_line": 13
} | module Vale.Poly1305.Equiv
open FStar.Mul
open FStar.Seq.Base
module S = Spec.Poly1305
module V = Vale.Poly1305.Spec_s
unfold let nat128 = Vale.Def.Words_s.nat128
unfold let secrecy_level = Lib.IntTypes.secrecy_level
unfold let bytes = Lib.ByteSequence.bytes
unfold let nat_from_bytes_le (#l:secrecy_level) = Lib.ByteSequence.nat_from_bytes_le #l | {
"checked_file": "/",
"dependencies": [
"Vale.Poly1305.Spec_s.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Poly1305.Equiv.fsti"
} | [
{
"abbrev": true,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "Spec.Poly1305",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | n: Prims.nat{n <= Prims.pow2 32 - 1} | Prims.Tot | [
"total"
] | [] | [
"Spec.Poly1305.size_block"
] | [] | false | false | false | false | false | let size_block =
| S.size_block | false |
|
Vale.Poly1305.Equiv.fsti | Vale.Poly1305.Equiv.nat_to_bytes_le | val nat_to_bytes_le : len: Prims.nat -> n: Prims.nat{n < Prims.pow2 (8 * len)}
-> b:
Lib.Sequence.seq (Lib.IntTypes.int_t Lib.IntTypes.U8 l)
{Lib.Sequence.length b == len /\ n == Lib.ByteSequence.nat_from_intseq_le b} | let nat_to_bytes_le (#l:secrecy_level) = Lib.ByteSequence.nat_to_bytes_le #l | {
"file_name": "vale/code/crypto/poly1305/Vale.Poly1305.Equiv.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 83,
"end_line": 12,
"start_col": 7,
"start_line": 12
} | module Vale.Poly1305.Equiv
open FStar.Mul
open FStar.Seq.Base
module S = Spec.Poly1305
module V = Vale.Poly1305.Spec_s
unfold let nat128 = Vale.Def.Words_s.nat128
unfold let secrecy_level = Lib.IntTypes.secrecy_level
unfold let bytes = Lib.ByteSequence.bytes | {
"checked_file": "/",
"dependencies": [
"Vale.Poly1305.Spec_s.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Poly1305.Equiv.fsti"
} | [
{
"abbrev": true,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "Spec.Poly1305",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | len: Prims.nat -> n: Prims.nat{n < Prims.pow2 (8 * len)}
-> b:
Lib.Sequence.seq (Lib.IntTypes.int_t Lib.IntTypes.U8 l)
{Lib.Sequence.length b == len /\ n == Lib.ByteSequence.nat_from_intseq_le b} | Prims.Tot | [
"total"
] | [] | [
"Vale.Poly1305.Equiv.secrecy_level",
"Lib.ByteSequence.nat_to_bytes_le",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"Prims.op_Multiply",
"Lib.Sequence.seq",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Prims.l_and",
"Prims.eq2",
"Lib.Sequence.length",
"Prims.l_or",
"Lib.ByteSequence.nat_from_intseq_le"
] | [] | false | false | false | false | false | let nat_to_bytes_le (#l: secrecy_level) =
| Lib.ByteSequence.nat_to_bytes_le #l | false |
|
Vale.Poly1305.Equiv.fsti | Vale.Poly1305.Equiv.key | val key : Type0 | let key = S.key | {
"file_name": "vale/code/crypto/poly1305/Vale.Poly1305.Equiv.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 14,
"start_col": 7,
"start_line": 14
} | module Vale.Poly1305.Equiv
open FStar.Mul
open FStar.Seq.Base
module S = Spec.Poly1305
module V = Vale.Poly1305.Spec_s
unfold let nat128 = Vale.Def.Words_s.nat128
unfold let secrecy_level = Lib.IntTypes.secrecy_level
unfold let bytes = Lib.ByteSequence.bytes
unfold let nat_from_bytes_le (#l:secrecy_level) = Lib.ByteSequence.nat_from_bytes_le #l
unfold let nat_to_bytes_le (#l:secrecy_level) = Lib.ByteSequence.nat_to_bytes_le #l | {
"checked_file": "/",
"dependencies": [
"Vale.Poly1305.Spec_s.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Poly1305.Equiv.fsti"
} | [
{
"abbrev": true,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "Spec.Poly1305",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"Spec.Poly1305.key"
] | [] | false | false | false | true | true | let key =
| S.key | false |
|
Hacl.Impl.SHA2.Generic.fst | Hacl.Impl.SHA2.Generic.ws_next | val ws_next: #a:sha2_alg -> #m:m_spec -> ws:ws_t a m ->
Stack unit
(requires fun h -> live h ws)
(ensures fun h0 _ h1 -> modifies (loc ws) h0 h1 /\
as_seq h1 ws == SpecVec.ws_next (as_seq h0 ws)) | val ws_next: #a:sha2_alg -> #m:m_spec -> ws:ws_t a m ->
Stack unit
(requires fun h -> live h ws)
(ensures fun h0 _ h1 -> modifies (loc ws) h0 h1 /\
as_seq h1 ws == SpecVec.ws_next (as_seq h0 ws)) | let ws_next #a #m ws =
let h0 = ST.get() in
loop1 h0 16ul ws
(fun h -> ws_next_inner #a #m)
(fun i ->
Lib.LoopCombinators.unfold_repeati 16 (ws_next_inner #a #m) (as_seq h0 ws) (v i);
let t16 = ws.(i) in
let t15 = ws.((i+.1ul) %. 16ul) in
let t7 = ws.((i+.9ul) %. 16ul) in
let t2 = ws.((i+.14ul) %. 16ul) in
let s1 = _sigma1 t2 in
let s0 = _sigma0 t15 in
ws.(i) <- (s1 +| t7 +| s0 +| t16)) | {
"file_name": "code/sha2-mb/Hacl.Impl.SHA2.Generic.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 38,
"end_line": 132,
"start_col": 0,
"start_line": 120
} | module Hacl.Impl.SHA2.Generic
open FStar.Mul
open FStar.HyperStack
open FStar.HyperStack.All
open Lib.IntTypes
open Lib.NTuple
open Lib.Buffer
open Lib.IntVector
open Lib.MultiBuffer
open Spec.Hash.Definitions
//open Hacl.Hash.Definitions
open Hacl.Spec.SHA2.Vec
open Hacl.Impl.SHA2.Core
module ST = FStar.HyperStack.ST
module NTup = Lib.NTuple
module Constants = Spec.SHA2.Constants
module Spec = Hacl.Spec.SHA2
module SpecVec = Hacl.Spec.SHA2.Vec
module VecTranspose = Lib.IntVector.Transpose
module LSeq = Lib.Sequence
module HD = Hacl.Hash.Definitions
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 50"
(** Top-level constant arrays for the SHA2 algorithms. *)
let h224 : x:glbuffer uint32 8ul{witnessed x Constants.h224 /\ recallable x} =
createL_global Constants.h224_l
let h256 : x:glbuffer uint32 8ul{witnessed x Constants.h256 /\ recallable x} =
createL_global Constants.h256_l
let h384 : x:glbuffer uint64 8ul{witnessed x Constants.h384 /\ recallable x} =
createL_global Constants.h384_l
let h512 : x:glbuffer uint64 8ul{witnessed x Constants.h512 /\ recallable x} =
createL_global Constants.h512_l
noextract inline_for_extraction
let index_h0 (a:sha2_alg) (i:size_t) : Stack (word a)
(requires (fun _ -> size_v i < 8))
(ensures (fun h0 r h1 ->
h0 == h1 /\
r == Seq.index (Spec.h0 a) (size_v i))) =
match a with
| SHA2_224 -> recall h224; recall_contents h224 Constants.h224; h224.(i)
| SHA2_256 -> recall h256; recall_contents h256 Constants.h256; h256.(i)
| SHA2_384 -> recall h384; recall_contents h384 Constants.h384; h384.(i)
| SHA2_512 -> recall h512; recall_contents h512 Constants.h512; h512.(i)
let k224_256 : x:glbuffer uint32 64ul{witnessed x Constants.k224_256 /\ recallable x} =
createL_global Constants.k224_256_l
let k384_512 : x:glbuffer uint64 80ul{witnessed x Constants.k384_512 /\ recallable x} =
createL_global Constants.k384_512_l
noextract inline_for_extraction
let index_k0 (a:sha2_alg) (i:size_t) : Stack (word a)
(requires (fun _ -> size_v i < Spec.size_k_w a))
(ensures (fun h0 r h1 ->
h0 == h1 /\
r == Seq.index (Spec.k0 a) (size_v i))) =
match a with
| SHA2_224 | SHA2_256 ->
recall_contents k224_256 Constants.k224_256;
k224_256.(i)
| SHA2_384 | SHA2_512 ->
recall_contents k384_512 Constants.k384_512;
k384_512.(i)
inline_for_extraction noextract
val shuffle_core: #a:sha2_alg -> #m:m_spec
-> k_t:word a
-> ws_t:element_t a m
-> st:state_t a m ->
Stack unit
(requires fun h -> live h st)
(ensures fun h0 _ h1 ->
modifies (loc st) h0 h1 /\
as_seq h1 st == SpecVec.shuffle_core_spec k_t ws_t (as_seq h0 st))
let shuffle_core #a #m k_t ws_t st =
let hp0 = ST.get() in
let a0 = st.(0ul) in
let b0 = st.(1ul) in
let c0 = st.(2ul) in
let d0 = st.(3ul) in
let e0 = st.(4ul) in
let f0 = st.(5ul) in
let g0 = st.(6ul) in
let h0 = st.(7ul) in
let k_e_t = load_element a m k_t in
let t1 = h0 +| (_Sigma1 e0) +| (_Ch e0 f0 g0) +| k_e_t +| ws_t in
let t2 = (_Sigma0 a0) +| (_Maj a0 b0 c0) in
let a1 = t1 +| t2 in
let b1 = a0 in
let c1 = b0 in
let d1 = c0 in
let e1 = d0 +| t1 in
let f1 = e0 in
let g1 = f0 in
let h1 = g0 in
create8 st a1 b1 c1 d1 e1 f1 g1 h1
#push-options "--z3rlimit 300"
inline_for_extraction noextract
val ws_next: #a:sha2_alg -> #m:m_spec -> ws:ws_t a m ->
Stack unit
(requires fun h -> live h ws)
(ensures fun h0 _ h1 -> modifies (loc ws) h0 h1 /\
as_seq h1 ws == SpecVec.ws_next (as_seq h0 ws)) | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NTuple.fsti.checked",
"Lib.MultiBuffer.fst.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntVector.Transpose.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.SHA2.Vec.fst.checked",
"Hacl.Spec.SHA2.fst.checked",
"Hacl.Impl.SHA2.Core.fst.checked",
"Hacl.Hash.Definitions.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.All.fst.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": false,
"source_file": "Hacl.Impl.SHA2.Generic.fst"
} | [
{
"abbrev": true,
"full_module": "Hacl.Hash.Definitions",
"short_module": "HD"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "Lib.IntVector.Transpose",
"short_module": "VecTranspose"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.SHA2.Vec",
"short_module": "SpecVec"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.SHA2",
"short_module": "Spec"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "Constants"
},
{
"abbrev": true,
"full_module": "Lib.NTuple",
"short_module": "NTup"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": false,
"full_module": "Hacl.Impl.SHA2.Core",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.SHA2.Vec",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.MultiBuffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Buffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.NTuple",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.All",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.SHA2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.SHA2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 300,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | ws: Hacl.Impl.SHA2.Core.ws_t a m -> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Hacl.Spec.SHA2.Vec.m_spec",
"Hacl.Impl.SHA2.Core.ws_t",
"Lib.Buffer.loop1",
"Hacl.Spec.SHA2.Vec.element_t",
"FStar.UInt32.__uint_to_t",
"FStar.Monotonic.HyperStack.mem",
"Hacl.Spec.SHA2.Vec.ws_next_inner",
"Lib.IntTypes.size_nat",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Lib.Sequence.lseq",
"Lib.IntTypes.size_t",
"Lib.Buffer.op_Array_Assignment",
"Hacl.Spec.SHA2.Vec.op_Plus_Bar",
"Prims.unit",
"Hacl.Spec.SHA2.Vec._sigma0",
"Hacl.Spec.SHA2.Vec._sigma1",
"Lib.Buffer.op_Array_Access",
"Lib.Buffer.MUT",
"Lib.IntTypes.op_Percent_Dot",
"Lib.IntTypes.op_Plus_Dot",
"Lib.LoopCombinators.unfold_repeati",
"Hacl.Spec.SHA2.Vec.ws_spec",
"Lib.Buffer.as_seq",
"FStar.HyperStack.ST.get"
] | [] | false | true | false | false | false | let ws_next #a #m ws =
| let h0 = ST.get () in
loop1 h0
16ul
ws
(fun h -> ws_next_inner #a #m)
(fun i ->
Lib.LoopCombinators.unfold_repeati 16 (ws_next_inner #a #m) (as_seq h0 ws) (v i);
let t16 = ws.(i) in
let t15 = ws.((i +. 1ul) %. 16ul) in
let t7 = ws.((i +. 9ul) %. 16ul) in
let t2 = ws.((i +. 14ul) %. 16ul) in
let s1 = _sigma1 t2 in
let s0 = _sigma0 t15 in
ws.(i) <- (s1 +| t7 +| s0 +| t16)) | false |
Vale.Poly1305.Equiv.fsti | Vale.Poly1305.Equiv.block_fun | val block_fun (text: bytes) (i: int) : nat128 | val block_fun (text: bytes) (i: int) : nat128 | let block_fun (text:bytes) (i:int) : nat128 =
let len = length text in
let nb = len / size_block in
if 0 <= i && i <= nb then (
let j1 = i * size_block in
let j2 = if i < nb then i * size_block + size_block else length text in
Math.Lemmas.pow2_le_compat 128 (8 * (j2 - j1));
nat_from_bytes_le (Seq.slice text j1 j2))
else
0 | {
"file_name": "vale/code/crypto/poly1305/Vale.Poly1305.Equiv.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 5,
"end_line": 25,
"start_col": 0,
"start_line": 16
} | module Vale.Poly1305.Equiv
open FStar.Mul
open FStar.Seq.Base
module S = Spec.Poly1305
module V = Vale.Poly1305.Spec_s
unfold let nat128 = Vale.Def.Words_s.nat128
unfold let secrecy_level = Lib.IntTypes.secrecy_level
unfold let bytes = Lib.ByteSequence.bytes
unfold let nat_from_bytes_le (#l:secrecy_level) = Lib.ByteSequence.nat_from_bytes_le #l
unfold let nat_to_bytes_le (#l:secrecy_level) = Lib.ByteSequence.nat_to_bytes_le #l
unfold let size_block = S.size_block
unfold let key = S.key | {
"checked_file": "/",
"dependencies": [
"Vale.Poly1305.Spec_s.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Poly1305.Equiv.fsti"
} | [
{
"abbrev": true,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "Spec.Poly1305",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | text: Vale.Poly1305.Equiv.bytes -> i: Prims.int -> Vale.Poly1305.Equiv.nat128 | Prims.Tot | [
"total"
] | [] | [
"Vale.Poly1305.Equiv.bytes",
"Prims.int",
"Prims.op_AmpAmp",
"Prims.op_LessThanOrEqual",
"Vale.Poly1305.Equiv.nat_from_bytes_le",
"Lib.IntTypes.SEC",
"FStar.Seq.Base.slice",
"Lib.IntTypes.uint_t",
"Lib.IntTypes.U8",
"Prims.unit",
"FStar.Math.Lemmas.pow2_le_compat",
"FStar.Mul.op_Star",
"Prims.op_Subtraction",
"Prims.l_and",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"FStar.Seq.Base.length",
"Lib.IntTypes.int_t",
"Prims.op_LessThan",
"Prims.op_Addition",
"Vale.Poly1305.Equiv.size_block",
"Prims.bool",
"Vale.Poly1305.Equiv.nat128",
"Prims.op_Division",
"Prims.nat"
] | [] | false | false | false | true | false | let block_fun (text: bytes) (i: int) : nat128 =
| let len = length text in
let nb = len / size_block in
if 0 <= i && i <= nb
then
(let j1 = i * size_block in
let j2 = if i < nb then i * size_block + size_block else length text in
Math.Lemmas.pow2_le_compat 128 (8 * (j2 - j1));
nat_from_bytes_le (Seq.slice text j1 j2))
else 0 | false |
Hacl.Impl.Frodo.Pack.fst | Hacl.Impl.Frodo.Pack.frodo_unpack_loop | val frodo_unpack_loop:
n1:size_t
-> n2:size_t{v n1 * v n2 <= max_size_t /\ (v n1 * v n2) % 8 = 0}
-> d:size_t{v d * (v n1 * v n2 / 8) <= max_size_t /\ v d <= 16}
-> b:lbytes (d *! (n1 *! n2 /. size 8))
-> res:matrix_t n1 n2
-> h0:mem{live h0 b /\ live h0 res /\ disjoint b res}
-> i:size_t{v i < v n1 * v n2 / 8}
-> Stack unit
(requires
loop_inv h0 (n1 *! n2 /. size 8)
(S.frodo_unpack_state #(v n1) #(v n2))
(fun h i -> Seq.sub (as_seq h res) 0 (8 * i))
(fun i -> loc res)
(fun h0 -> S.frodo_unpack_inner #(v n1) #(v n2) (v d) (as_seq h0 b))
(v i))
(ensures fun _ _ ->
loop_inv h0 (n1 *! n2 /. size 8)
(S.frodo_unpack_state #(v n1) #(v n2))
(fun h i -> Seq.sub (as_seq h res) 0 (8 * i))
(fun i -> loc res)
(fun h0 -> S.frodo_unpack_inner #(v n1) #(v n2) (v d) (as_seq h0 b))
(v i + 1)) | val frodo_unpack_loop:
n1:size_t
-> n2:size_t{v n1 * v n2 <= max_size_t /\ (v n1 * v n2) % 8 = 0}
-> d:size_t{v d * (v n1 * v n2 / 8) <= max_size_t /\ v d <= 16}
-> b:lbytes (d *! (n1 *! n2 /. size 8))
-> res:matrix_t n1 n2
-> h0:mem{live h0 b /\ live h0 res /\ disjoint b res}
-> i:size_t{v i < v n1 * v n2 / 8}
-> Stack unit
(requires
loop_inv h0 (n1 *! n2 /. size 8)
(S.frodo_unpack_state #(v n1) #(v n2))
(fun h i -> Seq.sub (as_seq h res) 0 (8 * i))
(fun i -> loc res)
(fun h0 -> S.frodo_unpack_inner #(v n1) #(v n2) (v d) (as_seq h0 b))
(v i))
(ensures fun _ _ ->
loop_inv h0 (n1 *! n2 /. size 8)
(S.frodo_unpack_state #(v n1) #(v n2))
(fun h i -> Seq.sub (as_seq h res) 0 (8 * i))
(fun i -> loc res)
(fun h0 -> S.frodo_unpack_inner #(v n1) #(v n2) (v d) (as_seq h0 b))
(v i + 1)) | let frodo_unpack_loop n1 n2 d b res h0 i =
let n = n1 *! n2 /. size 8 in
let a_spec = S.frodo_unpack_state #(v n1) #(v n2) in
[@inline_let]
let refl h (i:size_nat{i <= v n}) = Seq.sub (as_seq h res) 0 (8 * i) in
let footprint (i:size_nat{i <= v n}) = loc res in
[@inline_let]
let spec h0 = S.frodo_unpack_inner #(v n1) #(v n2) (v d) (as_seq h0 b) in
Loops.unfold_repeat_gen (v n) a_spec (spec h0) (refl h0 0) (v i);
let b = sub b (d *! i) d in
let r = sub res (size 8 *! i) (size 8) in
frodo_unpack8 d b r;
let h = ST.get() in
lemma_split (refl h (v i + 1)) (8 * v i) | {
"file_name": "code/frodo/Hacl.Impl.Frodo.Pack.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 42,
"end_line": 170,
"start_col": 0,
"start_line": 157
} | module Hacl.Impl.Frodo.Pack
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Hacl.Impl.Matrix
module ST = FStar.HyperStack.ST
module Loops = Lib.LoopCombinators
module Seq = Lib.Sequence
module S = Spec.Frodo.Pack
#reset-options "--z3rlimit 100 --max_fuel 0 --max_ifuel 0 --using_facts_from '* -Spec +Spec.Frodo.Pack +Spec.Matrix'"
val lemma_split: #a:Type -> #len:size_nat -> s:Seq.lseq a len -> i:size_nat{i <= len} ->
Lemma (s == Seq.(Seq.sub s 0 i @| Seq.sub s i (len - i)))
let lemma_split #a #len s i =
FStar.Seq.lemma_split s i
/// Pack
inline_for_extraction noextract
val frodo_pack8:
d:size_t{v d <= 16}
-> a:lbuffer uint16 8ul
-> res:lbytes d
-> Stack unit
(requires fun h0 -> live h0 a /\ live h0 res /\ disjoint a res)
(ensures fun h0 _ h1 ->
modifies1 res h0 h1 /\
as_seq h1 res == S.frodo_pack8 (v d) (as_seq h0 a))
let frodo_pack8 d a res =
let h0 = ST.get() in
push_frame();
let maskd = to_u16 (u32 1 <<. d) -. u16 1 in
let v16 = create (size 16) (u8 0) in
let a0 = index a (size 0) &. maskd in
let a1 = index a (size 1) &. maskd in
let a2 = index a (size 2) &. maskd in
let a3 = index a (size 3) &. maskd in
let a4 = index a (size 4) &. maskd in
let a5 = index a (size 5) &. maskd in
let a6 = index a (size 6) &. maskd in
let a7 = index a (size 7) &. maskd in
let templong =
to_u128 a0 <<. (size 7 *! d)
|. to_u128 a1 <<. (size 6 *! d)
|. to_u128 a2 <<. (size 5 *! d)
|. to_u128 a3 <<. (size 4 *! d)
|. to_u128 a4 <<. (size 3 *! d)
|. to_u128 a5 <<. (size 2 *! d)
|. to_u128 a6 <<. (size 1 *! d)
|. to_u128 a7 <<. (size 0 *! d)
in
uint_to_bytes_be v16 templong;
let src = sub v16 (size 16 -! d) d in // Skips the 1st byte when d = 15
copy res src;
pop_frame()
val frodo_pack:
#n1:size_t
-> #n2:size_t{v n1 * v n2 <= max_size_t /\ (v n1 * v n2) % 8 = 0}
-> d:size_t{v d * ((v n1 * v n2) / 8) <= max_size_t /\ v d <= 16}
-> a:matrix_t n1 n2
-> res:lbytes (d *! ((n1 *! n2) /. size 8))
-> Stack unit
(requires fun h -> live h a /\ live h res /\ disjoint a res)
(ensures fun h0 _ h1 ->
modifies1 res h0 h1 /\
as_seq h1 res == S.frodo_pack (v d) (as_matrix h0 a))
#push-options "--z3rlimit 400"
[@"c_inline"]
let frodo_pack #n1 #n2 d a res =
let n = (n1 *! n2) /. size 8 in
let a_spec = S.frodo_pack_state #(v n1) #(v n2) (v d) in
[@ inline_let]
let refl h (i:size_nat{i <= v n}) = Seq.sub (as_seq h res) 0 (v d * i) in
let footprint (i:size_nat{i <= v n}) = loc res in
[@ inline_let]
let spec h0 = S.frodo_pack_inner #(v n1) #(v n2) (v d) (as_seq h0 a) in
let h0 = ST.get() in
assert (Seq.equal (refl h0 0) (Seq.create 0 (u8 0)));
loop h0 n a_spec refl footprint spec
(fun i ->
FStar.Math.Lemmas.lemma_mult_le_left (v d) (v i + 1) (v n);
assert (v (d *! i +! d) <= v (d *! ((n1 *! n2) /. size 8)));
Loops.unfold_repeat_gen (v n) a_spec (spec h0) (refl h0 0) (v i);
let a = sub a (size 8 *! i) (size 8) in
let r = sub res (d *! i) d in
frodo_pack8 d a r;
let h = ST.get() in
lemma_split (refl h (v i + 1)) (v d * v i)
)
#pop-options
/// Unpack
inline_for_extraction noextract
[@"opaque_to_smt"]
val frodo_unpack8:
d:size_t{v d <= 16}
-> b:lbytes d
-> res:lbuffer uint16 8ul
-> Stack unit
(requires fun h0 -> live h0 b /\ live h0 res)
(ensures fun h0 _ h1 ->
modifies1 res h0 h1 /\
Seq.equal (as_seq h1 res) (S.frodo_unpack8 (v d) (as_seq h0 b)))
let frodo_unpack8 d b res =
let h0 = ST.get() in
push_frame();
let maskd = to_u16 (u32 1 <<. d) -. u16 1 in
let src = create (size 16) (u8 0) in
update_sub src (size 16 -! d) d b;
let templong = uint_from_bytes_be #U128 #SEC src in
res.(size 0) <- to_u16 (templong >>. (size 7 *! d)) &. maskd;
res.(size 1) <- to_u16 (templong >>. (size 6 *! d)) &. maskd;
res.(size 2) <- to_u16 (templong >>. (size 5 *! d)) &. maskd;
res.(size 3) <- to_u16 (templong >>. (size 4 *! d)) &. maskd;
res.(size 4) <- to_u16 (templong >>. (size 3 *! d)) &. maskd;
res.(size 5) <- to_u16 (templong >>. (size 2 *! d)) &. maskd;
res.(size 6) <- to_u16 (templong >>. (size 1 *! d)) &. maskd;
res.(size 7) <- to_u16 (templong >>. (size 0 *! d)) &. maskd;
pop_frame()
// 2018.11.21 SZ: Inlining this below doesn't work. Hard to say why.
inline_for_extraction noextract
val frodo_unpack_loop:
n1:size_t
-> n2:size_t{v n1 * v n2 <= max_size_t /\ (v n1 * v n2) % 8 = 0}
-> d:size_t{v d * (v n1 * v n2 / 8) <= max_size_t /\ v d <= 16}
-> b:lbytes (d *! (n1 *! n2 /. size 8))
-> res:matrix_t n1 n2
-> h0:mem{live h0 b /\ live h0 res /\ disjoint b res}
-> i:size_t{v i < v n1 * v n2 / 8}
-> Stack unit
(requires
loop_inv h0 (n1 *! n2 /. size 8)
(S.frodo_unpack_state #(v n1) #(v n2))
(fun h i -> Seq.sub (as_seq h res) 0 (8 * i))
(fun i -> loc res)
(fun h0 -> S.frodo_unpack_inner #(v n1) #(v n2) (v d) (as_seq h0 b))
(v i))
(ensures fun _ _ ->
loop_inv h0 (n1 *! n2 /. size 8)
(S.frodo_unpack_state #(v n1) #(v n2))
(fun h i -> Seq.sub (as_seq h res) 0 (8 * i))
(fun i -> loc res)
(fun h0 -> S.frodo_unpack_inner #(v n1) #(v n2) (v d) (as_seq h0 b)) | {
"checked_file": "/",
"dependencies": [
"Spec.Frodo.Pack.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.Matrix.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": false,
"source_file": "Hacl.Impl.Frodo.Pack.fst"
} | [
{
"abbrev": true,
"full_module": "Spec.Frodo.Pack",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "Seq"
},
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Matrix",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Buffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 100,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
n1: Lib.IntTypes.size_t ->
n2:
Lib.IntTypes.size_t
{ Lib.IntTypes.v n1 * Lib.IntTypes.v n2 <= Lib.IntTypes.max_size_t /\
Lib.IntTypes.v n1 * Lib.IntTypes.v n2 % 8 = 0 } ->
d:
Lib.IntTypes.size_t
{ Lib.IntTypes.v d * (Lib.IntTypes.v n1 * Lib.IntTypes.v n2 / 8) <= Lib.IntTypes.max_size_t /\
Lib.IntTypes.v d <= 16 } ->
b: Hacl.Impl.Matrix.lbytes (d *! (n1 *! n2 /. Lib.IntTypes.size 8)) ->
res: Hacl.Impl.Matrix.matrix_t n1 n2 ->
h0:
FStar.Monotonic.HyperStack.mem
{Lib.Buffer.live h0 b /\ Lib.Buffer.live h0 res /\ Lib.Buffer.disjoint b res} ->
i: Lib.IntTypes.size_t{Lib.IntTypes.v i < Lib.IntTypes.v n1 * Lib.IntTypes.v n2 / 8}
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Lib.IntTypes.size_t",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Lib.IntTypes.max_size_t",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Prims.op_Division",
"Hacl.Impl.Matrix.lbytes",
"Lib.IntTypes.op_Star_Bang",
"Lib.IntTypes.op_Slash_Dot",
"Lib.IntTypes.size",
"Hacl.Impl.Matrix.matrix_t",
"FStar.Monotonic.HyperStack.mem",
"Lib.Buffer.live",
"Lib.Buffer.MUT",
"Lib.IntTypes.uint8",
"Hacl.Impl.Matrix.elem",
"Lib.Buffer.disjoint",
"Prims.op_LessThan",
"Hacl.Impl.Frodo.Pack.lemma_split",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U16",
"Lib.IntTypes.SEC",
"Prims.op_Multiply",
"Prims.op_Addition",
"Prims.unit",
"FStar.HyperStack.ST.get",
"Hacl.Impl.Frodo.Pack.frodo_unpack8",
"Lib.Buffer.lbuffer_t",
"Lib.IntTypes.mk_int",
"Lib.Buffer.sub",
"Lib.IntTypes.U8",
"Lib.LoopCombinators.unfold_repeat_gen",
"Prims.nat",
"Prims.op_Subtraction",
"Prims.pow2",
"Spec.Frodo.Pack.frodo_unpack_state",
"Spec.Frodo.Pack.frodo_unpack_inner",
"Lib.Buffer.as_seq",
"LowStar.Monotonic.Buffer.loc",
"Lib.IntTypes.size_nat",
"Lib.Buffer.loc",
"Lib.Sequence.lseq",
"Prims.eq2",
"FStar.Seq.Base.seq",
"Lib.Sequence.to_seq",
"FStar.Seq.Base.slice",
"Lib.IntTypes.mul",
"Prims.l_Forall",
"Prims.l_or",
"FStar.Seq.Base.index",
"Lib.Sequence.index",
"Lib.Sequence.sub"
] | [] | false | true | false | false | false | let frodo_unpack_loop n1 n2 d b res h0 i =
| let n = n1 *! n2 /. size 8 in
let a_spec = S.frodo_unpack_state #(v n1) #(v n2) in
[@@ inline_let ]let refl h (i: size_nat{i <= v n}) = Seq.sub (as_seq h res) 0 (8 * i) in
let footprint (i: size_nat{i <= v n}) = loc res in
[@@ inline_let ]let spec h0 = S.frodo_unpack_inner #(v n1) #(v n2) (v d) (as_seq h0 b) in
Loops.unfold_repeat_gen (v n) a_spec (spec h0) (refl h0 0) (v i);
let b = sub b (d *! i) d in
let r = sub res (size 8 *! i) (size 8) in
frodo_unpack8 d b r;
let h = ST.get () in
lemma_split (refl h (v i + 1)) (8 * v i) | false |
Vale.Wrapper.X64.Cpuid.fst | Vale.Wrapper.X64.Cpuid.check_adx_bmi2 | val check_adx_bmi2: unit -> Stack UInt64.t
(requires fun h0 -> True)
(ensures fun h0 ret_val h1 ->
((UInt64.v ret_val) =!= 0 ==> adx_enabled /\ bmi2_enabled) /\
B.modifies B.loc_none h0 h1) | val check_adx_bmi2: unit -> Stack UInt64.t
(requires fun h0 -> True)
(ensures fun h0 ret_val h1 ->
((UInt64.v ret_val) =!= 0 ==> adx_enabled /\ bmi2_enabled) /\
B.modifies B.loc_none h0 h1) | let check_adx_bmi2 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_adx_bmi2 () in //This is a call to the interop wrapper
x | {
"file_name": "vale/code/arch/x64/interop/Vale.Wrapper.X64.Cpuid.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 15,
"start_col": 0,
"start_line": 13
} | module Vale.Wrapper.X64.Cpuid
open FStar.Mul
let check_aesni () =
let open Vale.X64.Decls in
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_aesni () in //This is a call to the interop wrapper
x
let check_sha () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_sha () in //This is a call to the interop wrapper
x | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Decls.fsti.checked",
"Vale.Stdcalls.X64.Cpuid.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": true,
"source_file": "Vale.Wrapper.X64.Cpuid.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Wrapper.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Wrapper.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit -> FStar.HyperStack.ST.Stack FStar.UInt64.t | FStar.HyperStack.ST.Stack | [] | [] | [
"Prims.unit",
"FStar.UInt64.t",
"FStar.Ghost.erased",
"Vale.Interop.X64.as_lowstar_sig_ret",
"Vale.Interop.X64.als_ret",
"Vale.Stdcalls.X64.Cpuid.check_adx_bmi2"
] | [] | false | true | false | false | false | let check_adx_bmi2 () =
| let x, _ = Vale.Stdcalls.X64.Cpuid.check_adx_bmi2 () in
x | false |
Vale.Wrapper.X64.Cpuid.fst | Vale.Wrapper.X64.Cpuid.check_avx | val check_avx: unit -> Stack UInt64.t
(requires fun h0 -> True)
(ensures fun h0 ret_val h1 ->
((UInt64.v ret_val) =!= 0 ==> avx_cpuid_enabled) /\
B.modifies B.loc_none h0 h1) | val check_avx: unit -> Stack UInt64.t
(requires fun h0 -> True)
(ensures fun h0 ret_val h1 ->
((UInt64.v ret_val) =!= 0 ==> avx_cpuid_enabled) /\
B.modifies B.loc_none h0 h1) | let check_avx () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_avx () in //This is a call to the interop wrapper
x | {
"file_name": "vale/code/arch/x64/interop/Vale.Wrapper.X64.Cpuid.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 19,
"start_col": 0,
"start_line": 17
} | module Vale.Wrapper.X64.Cpuid
open FStar.Mul
let check_aesni () =
let open Vale.X64.Decls in
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_aesni () in //This is a call to the interop wrapper
x
let check_sha () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_sha () in //This is a call to the interop wrapper
x
let check_adx_bmi2 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_adx_bmi2 () in //This is a call to the interop wrapper
x | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Decls.fsti.checked",
"Vale.Stdcalls.X64.Cpuid.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": true,
"source_file": "Vale.Wrapper.X64.Cpuid.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Wrapper.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Wrapper.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit -> FStar.HyperStack.ST.Stack FStar.UInt64.t | FStar.HyperStack.ST.Stack | [] | [] | [
"Prims.unit",
"FStar.UInt64.t",
"FStar.Ghost.erased",
"Vale.Interop.X64.as_lowstar_sig_ret",
"Vale.Interop.X64.als_ret",
"Vale.Stdcalls.X64.Cpuid.check_avx"
] | [] | false | true | false | false | false | let check_avx () =
| let x, _ = Vale.Stdcalls.X64.Cpuid.check_avx () in
x | false |
Vale.Wrapper.X64.Cpuid.fst | Vale.Wrapper.X64.Cpuid.check_aesni | val check_aesni: unit -> Stack UInt64.t
(requires fun h0 -> True)
(ensures fun h0 ret_val h1 ->
((UInt64.v ret_val) =!= 0 ==> aesni_enabled /\ pclmulqdq_enabled) /\
B.modifies B.loc_none h0 h1) | val check_aesni: unit -> Stack UInt64.t
(requires fun h0 -> True)
(ensures fun h0 ret_val h1 ->
((UInt64.v ret_val) =!= 0 ==> aesni_enabled /\ pclmulqdq_enabled) /\
B.modifies B.loc_none h0 h1) | let check_aesni () =
let open Vale.X64.Decls in
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_aesni () in //This is a call to the interop wrapper
x | {
"file_name": "vale/code/arch/x64/interop/Vale.Wrapper.X64.Cpuid.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 7,
"start_col": 0,
"start_line": 4
} | module Vale.Wrapper.X64.Cpuid
open FStar.Mul | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Decls.fsti.checked",
"Vale.Stdcalls.X64.Cpuid.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": true,
"source_file": "Vale.Wrapper.X64.Cpuid.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Wrapper.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Wrapper.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit -> FStar.HyperStack.ST.Stack FStar.UInt64.t | FStar.HyperStack.ST.Stack | [] | [] | [
"Prims.unit",
"FStar.UInt64.t",
"FStar.Ghost.erased",
"Vale.Interop.X64.as_lowstar_sig_ret",
"Vale.Interop.X64.als_ret",
"Vale.Stdcalls.X64.Cpuid.check_aesni"
] | [] | false | true | false | false | false | let check_aesni () =
| let open Vale.X64.Decls in
let x, _ = Vale.Stdcalls.X64.Cpuid.check_aesni () in
x | false |
Vale.Wrapper.X64.Cpuid.fst | Vale.Wrapper.X64.Cpuid.check_sha | val check_sha: unit -> Stack UInt64.t
(requires fun h0 -> True)
(ensures fun h0 ret_val h1 ->
((UInt64.v ret_val) =!= 0 ==> sha_enabled) /\
B.modifies B.loc_none h0 h1) | val check_sha: unit -> Stack UInt64.t
(requires fun h0 -> True)
(ensures fun h0 ret_val h1 ->
((UInt64.v ret_val) =!= 0 ==> sha_enabled) /\
B.modifies B.loc_none h0 h1) | let check_sha () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_sha () in //This is a call to the interop wrapper
x | {
"file_name": "vale/code/arch/x64/interop/Vale.Wrapper.X64.Cpuid.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 11,
"start_col": 0,
"start_line": 9
} | module Vale.Wrapper.X64.Cpuid
open FStar.Mul
let check_aesni () =
let open Vale.X64.Decls in
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_aesni () in //This is a call to the interop wrapper
x | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Decls.fsti.checked",
"Vale.Stdcalls.X64.Cpuid.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": true,
"source_file": "Vale.Wrapper.X64.Cpuid.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Wrapper.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Wrapper.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit -> FStar.HyperStack.ST.Stack FStar.UInt64.t | FStar.HyperStack.ST.Stack | [] | [] | [
"Prims.unit",
"FStar.UInt64.t",
"FStar.Ghost.erased",
"Vale.Interop.X64.as_lowstar_sig_ret",
"Vale.Interop.X64.als_ret",
"Vale.Stdcalls.X64.Cpuid.check_sha"
] | [] | false | true | false | false | false | let check_sha () =
| let x, _ = Vale.Stdcalls.X64.Cpuid.check_sha () in
x | false |
Vale.Wrapper.X64.Cpuid.fst | Vale.Wrapper.X64.Cpuid.check_sse | val check_sse: unit -> Stack UInt64.t
(requires fun h0 -> True)
(ensures fun h0 ret_val h1 ->
((UInt64.v ret_val) =!= 0 ==> sse_enabled) /\
B.modifies B.loc_none h0 h1) | val check_sse: unit -> Stack UInt64.t
(requires fun h0 -> True)
(ensures fun h0 ret_val h1 ->
((UInt64.v ret_val) =!= 0 ==> sse_enabled) /\
B.modifies B.loc_none h0 h1) | let check_sse () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_sse () in //This is a call to the interop wrapper
x | {
"file_name": "vale/code/arch/x64/interop/Vale.Wrapper.X64.Cpuid.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 31,
"start_col": 0,
"start_line": 29
} | module Vale.Wrapper.X64.Cpuid
open FStar.Mul
let check_aesni () =
let open Vale.X64.Decls in
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_aesni () in //This is a call to the interop wrapper
x
let check_sha () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_sha () in //This is a call to the interop wrapper
x
let check_adx_bmi2 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_adx_bmi2 () in //This is a call to the interop wrapper
x
let check_avx () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_avx () in //This is a call to the interop wrapper
x
let check_avx2 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_avx2 () in //This is a call to the interop wrapper
x
let check_movbe () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_movbe () in //This is a call to the interop wrapper
x | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Decls.fsti.checked",
"Vale.Stdcalls.X64.Cpuid.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": true,
"source_file": "Vale.Wrapper.X64.Cpuid.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Wrapper.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Wrapper.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit -> FStar.HyperStack.ST.Stack FStar.UInt64.t | FStar.HyperStack.ST.Stack | [] | [] | [
"Prims.unit",
"FStar.UInt64.t",
"FStar.Ghost.erased",
"Vale.Interop.X64.as_lowstar_sig_ret",
"Vale.Interop.X64.als_ret",
"Vale.Stdcalls.X64.Cpuid.check_sse"
] | [] | false | true | false | false | false | let check_sse () =
| let x, _ = Vale.Stdcalls.X64.Cpuid.check_sse () in
x | false |
Hacl.Impl.SHA2.Generic.fst | Hacl.Impl.SHA2.Generic.update_last | val update_last: #a:sha2_alg -> #m:m_spec{is_supported a m} -> update_last_vec_t a m | val update_last: #a:sha2_alg -> #m:m_spec{is_supported a m} -> update_last_vec_t a m | let update_last #a #m upd totlen len b hash =
let h0 = ST.get() in
push_frame ();
let h1 = ST.get() in
let blocks = padded_blocks a len in
let fin = blocks *! HD.block_len a in
let last = create (size (lanes a m) *! 2ul *! HD.block_len a) (u8 0) in
let totlen_buf = create (len_len a) (u8 0) in
let total_len_bits = secret (shift_left #(len_int_type a) totlen 3ul) in
Lib.ByteBuffer.uint_to_bytes_be #(len_int_type a) totlen_buf total_len_bits;
let h2 = ST.get () in
NTup.eq_intro (as_seq_multi h2 b) (as_seq_multi h0 b);
assert (as_seq h2 totlen_buf ==
Lib.ByteSequence.uint_to_bytes_be #(len_int_type a) total_len_bits);
let (last0,last1) = load_last #a #m totlen_buf len b fin last in
let h3 = ST.get () in
assert ((as_seq_multi h3 last0, as_seq_multi h3 last1) ==
SpecVec.load_last #a #m (as_seq h2 totlen_buf) (v fin) (v len) (as_seq_multi h2 b));
assert (disjoint_multi last1 hash);
upd last0 hash;
let h4 = ST.get() in
assert (modifies (loc hash |+| loc last |+| loc totlen_buf) h1 h3);
assert (as_seq h4 hash == SpecVec.update (as_seq_multi h3 last0) (as_seq h3 hash));
NTup.eq_intro (as_seq_multi h4 last1) (as_seq_multi h3 last1);
assert (v blocks > 1 ==> blocks >. 1ul);
assert (blocks >. 1ul ==> v blocks > 1);
assert (not (blocks >. 1ul) ==> not (v blocks > 1));
if blocks >. 1ul then (
upd last1 hash;
let h5 = ST.get() in
assert (as_seq h5 hash == SpecVec.update (as_seq_multi h4 last1) (as_seq h4 hash));
assert (modifies (loc hash |+| loc last |+| loc totlen_buf) h1 h5);
assert (as_seq h5 hash == SpecVec.update_last totlen (v len) (as_seq_multi h0 b) (as_seq h0 hash));
pop_frame()
) else (
let h6 = ST.get() in
assert (h4 == h6);
assert (modifies (loc hash |+| loc totlen_buf |+| loc last) h1 h6);
assert (as_seq h6 hash == SpecVec.update_last totlen (v len) (as_seq_multi h0 b) (as_seq h0 hash));
pop_frame()) | {
"file_name": "code/sha2-mb/Hacl.Impl.SHA2.Generic.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 292,
"start_col": 0,
"start_line": 253
} | module Hacl.Impl.SHA2.Generic
open FStar.Mul
open FStar.HyperStack
open FStar.HyperStack.All
open Lib.IntTypes
open Lib.NTuple
open Lib.Buffer
open Lib.IntVector
open Lib.MultiBuffer
open Spec.Hash.Definitions
//open Hacl.Hash.Definitions
open Hacl.Spec.SHA2.Vec
open Hacl.Impl.SHA2.Core
module ST = FStar.HyperStack.ST
module NTup = Lib.NTuple
module Constants = Spec.SHA2.Constants
module Spec = Hacl.Spec.SHA2
module SpecVec = Hacl.Spec.SHA2.Vec
module VecTranspose = Lib.IntVector.Transpose
module LSeq = Lib.Sequence
module HD = Hacl.Hash.Definitions
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 50"
(** Top-level constant arrays for the SHA2 algorithms. *)
let h224 : x:glbuffer uint32 8ul{witnessed x Constants.h224 /\ recallable x} =
createL_global Constants.h224_l
let h256 : x:glbuffer uint32 8ul{witnessed x Constants.h256 /\ recallable x} =
createL_global Constants.h256_l
let h384 : x:glbuffer uint64 8ul{witnessed x Constants.h384 /\ recallable x} =
createL_global Constants.h384_l
let h512 : x:glbuffer uint64 8ul{witnessed x Constants.h512 /\ recallable x} =
createL_global Constants.h512_l
noextract inline_for_extraction
let index_h0 (a:sha2_alg) (i:size_t) : Stack (word a)
(requires (fun _ -> size_v i < 8))
(ensures (fun h0 r h1 ->
h0 == h1 /\
r == Seq.index (Spec.h0 a) (size_v i))) =
match a with
| SHA2_224 -> recall h224; recall_contents h224 Constants.h224; h224.(i)
| SHA2_256 -> recall h256; recall_contents h256 Constants.h256; h256.(i)
| SHA2_384 -> recall h384; recall_contents h384 Constants.h384; h384.(i)
| SHA2_512 -> recall h512; recall_contents h512 Constants.h512; h512.(i)
let k224_256 : x:glbuffer uint32 64ul{witnessed x Constants.k224_256 /\ recallable x} =
createL_global Constants.k224_256_l
let k384_512 : x:glbuffer uint64 80ul{witnessed x Constants.k384_512 /\ recallable x} =
createL_global Constants.k384_512_l
noextract inline_for_extraction
let index_k0 (a:sha2_alg) (i:size_t) : Stack (word a)
(requires (fun _ -> size_v i < Spec.size_k_w a))
(ensures (fun h0 r h1 ->
h0 == h1 /\
r == Seq.index (Spec.k0 a) (size_v i))) =
match a with
| SHA2_224 | SHA2_256 ->
recall_contents k224_256 Constants.k224_256;
k224_256.(i)
| SHA2_384 | SHA2_512 ->
recall_contents k384_512 Constants.k384_512;
k384_512.(i)
inline_for_extraction noextract
val shuffle_core: #a:sha2_alg -> #m:m_spec
-> k_t:word a
-> ws_t:element_t a m
-> st:state_t a m ->
Stack unit
(requires fun h -> live h st)
(ensures fun h0 _ h1 ->
modifies (loc st) h0 h1 /\
as_seq h1 st == SpecVec.shuffle_core_spec k_t ws_t (as_seq h0 st))
let shuffle_core #a #m k_t ws_t st =
let hp0 = ST.get() in
let a0 = st.(0ul) in
let b0 = st.(1ul) in
let c0 = st.(2ul) in
let d0 = st.(3ul) in
let e0 = st.(4ul) in
let f0 = st.(5ul) in
let g0 = st.(6ul) in
let h0 = st.(7ul) in
let k_e_t = load_element a m k_t in
let t1 = h0 +| (_Sigma1 e0) +| (_Ch e0 f0 g0) +| k_e_t +| ws_t in
let t2 = (_Sigma0 a0) +| (_Maj a0 b0 c0) in
let a1 = t1 +| t2 in
let b1 = a0 in
let c1 = b0 in
let d1 = c0 in
let e1 = d0 +| t1 in
let f1 = e0 in
let g1 = f0 in
let h1 = g0 in
create8 st a1 b1 c1 d1 e1 f1 g1 h1
#push-options "--z3rlimit 300"
inline_for_extraction noextract
val ws_next: #a:sha2_alg -> #m:m_spec -> ws:ws_t a m ->
Stack unit
(requires fun h -> live h ws)
(ensures fun h0 _ h1 -> modifies (loc ws) h0 h1 /\
as_seq h1 ws == SpecVec.ws_next (as_seq h0 ws))
let ws_next #a #m ws =
let h0 = ST.get() in
loop1 h0 16ul ws
(fun h -> ws_next_inner #a #m)
(fun i ->
Lib.LoopCombinators.unfold_repeati 16 (ws_next_inner #a #m) (as_seq h0 ws) (v i);
let t16 = ws.(i) in
let t15 = ws.((i+.1ul) %. 16ul) in
let t7 = ws.((i+.9ul) %. 16ul) in
let t2 = ws.((i+.14ul) %. 16ul) in
let s1 = _sigma1 t2 in
let s0 = _sigma0 t15 in
ws.(i) <- (s1 +| t7 +| s0 +| t16))
#pop-options
inline_for_extraction noextract
val shuffle: #a:sha2_alg -> #m:m_spec -> ws:ws_t a m -> hash:state_t a m ->
Stack unit
(requires fun h -> live h hash /\ live h ws /\ disjoint hash ws)
(ensures fun h0 _ h1 -> modifies2 ws hash h0 h1 /\
as_seq h1 hash == SpecVec.shuffle #a #m (as_seq h0 ws) (as_seq h0 hash))
let shuffle #a #m ws hash =
let h0 = ST.get() in
loop2 h0 (num_rounds16 a) ws hash
(fun h -> shuffle_inner_loop #a #m)
(fun i ->
Lib.LoopCombinators.unfold_repeati (v (num_rounds16 a)) (shuffle_inner_loop #a #m) (as_seq h0 ws, as_seq h0 hash) (v i);
let h1 = ST.get() in
loop1 h1 16ul hash
(fun h -> shuffle_inner #a #m (as_seq h1 ws) (v i))
(fun j ->
Lib.LoopCombinators.unfold_repeati 16 (shuffle_inner #a #m (as_seq h1 ws) (v i)) (as_seq h1 hash) (v j);
let k_t = index_k0 a (16ul *. i +. j) in
let ws_t = ws.(j) in
shuffle_core k_t ws_t hash);
if i <. num_rounds16 a -. 1ul then ws_next ws)
inline_for_extraction noextract
val alloc: a:sha2_alg -> m:m_spec ->
StackInline (state_t a m)
(requires fun h -> True)
(ensures fun h0 b h1 -> live h1 b /\ stack_allocated b h0 h1 (Seq.create 8 (zero_element a m)))
let alloc a m = Lib.Buffer.create 8ul (zero_element a m)
inline_for_extraction noextract
let init_vec_t (a:sha2_alg) (m:m_spec) = hash:state_t a m ->
Stack unit
(requires fun h -> live h hash)
(ensures fun h0 _ h1 -> modifies1 hash h0 h1 /\
as_seq h1 hash == SpecVec.init a m)
inline_for_extraction noextract
val init: #a:sha2_alg -> #m:m_spec -> init_vec_t a m
let init #a #m hash =
let h0 = ST.get() in
fill h0 8ul hash
(fun h i -> load_element a m (Seq.index (Spec.h0 a) i))
(fun i ->
let hi = index_h0 a i in
load_element a m hi);
let h1 = ST.get() in
LSeq.eq_intro (as_seq h1 hash) (LSeq.createi 8 (fun i -> load_element a m (Seq.index (Spec.h0 a) i)))
inline_for_extraction noextract
let update_vec_t (a:sha2_alg) (m:m_spec{is_supported a m}) =
b:multibuf (lanes a m) (HD.block_len a)
-> hash:state_t a m ->
Stack unit
(requires fun h -> live_multi h b /\ live h hash)
(ensures fun h0 _ h1 -> modifies (loc hash) h0 h1 /\
as_seq h1 hash == SpecVec.update (as_seq_multi h0 b) (as_seq h0 hash))
#push-options "--z3rlimit 200"
inline_for_extraction noextract
val update: #a:sha2_alg -> #m:m_spec{is_supported a m} -> update_vec_t a m
let update #a #m b hash =
let h0 = ST.get() in
push_frame ();
let h1 = ST.get() in
let hash_old = create 8ul (zero_element a m) in
let ws = create 16ul (zero_element a m) in
assert (disjoint_multi b hash_old);
assert (disjoint_multi b ws);
assert (disjoint ws hash_old);
assert (disjoint hash hash_old);
assert (disjoint ws hash);
copy hash_old hash;
let h2 = ST.get() in
assert (live_multi h2 b);
NTup.(eq_intro (as_seq_multi h2 b) (as_seq_multi h0 b));
load_ws b ws;
let h3 = ST.get() in
assert (modifies (loc ws |+| loc hash_old) h0 h3);
assert (as_seq h3 ws == SpecVec.load_ws (as_seq_multi h2 b));
shuffle ws hash;
let h4 = ST.get() in
assert (modifies (loc hash |+| (loc ws |+| loc hash_old)) h0 h4);
assert (as_seq h4 hash == SpecVec.shuffle (as_seq h3 ws) (as_seq h0 hash));
map2T 8ul hash (+|) hash hash_old;
let h5 = ST.get() in
assert (modifies (loc hash |+| (loc ws |+| loc hash_old)) h0 h5);
reveal_opaque (`%SpecVec.update) (SpecVec.update #a #m);
assert (as_seq h5 hash == SpecVec.update (as_seq_multi h0 b) (as_seq h0 hash));
pop_frame()
#pop-options
inline_for_extraction noextract
let update_last_vec_t' (a:sha2_alg) (m:m_spec{is_supported a m}) =
totlen:len_t a
-> len:size_t{v len <= block_length a}
-> b:multibuf (lanes a m) len
-> hash:state_t a m ->
Stack unit
(requires fun h -> live_multi h b /\ live h hash /\ disjoint_multi b hash)
(ensures fun h0 _ h1 -> modifies (loc hash) h0 h1 /\
as_seq h1 hash == SpecVec.update_last totlen (v len) (as_seq_multi h0 b) (as_seq h0 hash))
inline_for_extraction noextract
let update_last_vec_t (a:sha2_alg) (m:m_spec{is_supported a m}) =
upd:update_vec_t a m -> update_last_vec_t' a m
#push-options "--z3rlimit 350"
inline_for_extraction noextract | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NTuple.fsti.checked",
"Lib.MultiBuffer.fst.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntVector.Transpose.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.SHA2.Vec.fst.checked",
"Hacl.Spec.SHA2.fst.checked",
"Hacl.Impl.SHA2.Core.fst.checked",
"Hacl.Hash.Definitions.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.All.fst.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": false,
"source_file": "Hacl.Impl.SHA2.Generic.fst"
} | [
{
"abbrev": true,
"full_module": "Hacl.Hash.Definitions",
"short_module": "HD"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "Lib.IntVector.Transpose",
"short_module": "VecTranspose"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.SHA2.Vec",
"short_module": "SpecVec"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.SHA2",
"short_module": "Spec"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "Constants"
},
{
"abbrev": true,
"full_module": "Lib.NTuple",
"short_module": "NTup"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": false,
"full_module": "Hacl.Impl.SHA2.Core",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.SHA2.Vec",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.MultiBuffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Buffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.NTuple",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.All",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.SHA2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.SHA2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 350,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Hacl.Impl.SHA2.Generic.update_last_vec_t a m | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Hacl.Spec.SHA2.Vec.m_spec",
"Hacl.Spec.SHA2.Vec.is_supported",
"Hacl.Impl.SHA2.Generic.update_vec_t",
"Spec.Hash.Definitions.len_t",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Spec.Hash.Definitions.block_length",
"Lib.MultiBuffer.multibuf",
"Hacl.Spec.SHA2.Vec.lanes",
"Hacl.Impl.SHA2.Core.state_t",
"Hacl.Hash.Definitions.block_len",
"Lib.IntTypes.op_Greater_Dot",
"FStar.UInt32.__uint_to_t",
"FStar.HyperStack.ST.pop_frame",
"Prims.unit",
"Prims._assert",
"Prims.eq2",
"Lib.Sequence.lseq",
"Hacl.Spec.SHA2.Vec.element_t",
"Lib.Buffer.as_seq",
"Lib.Buffer.MUT",
"Hacl.Spec.SHA2.Vec.update_last",
"Lib.MultiBuffer.as_seq_multi",
"Lib.Buffer.modifies",
"Lib.Buffer.op_Bar_Plus_Bar",
"Lib.Buffer.loc",
"Lib.IntTypes.uint8",
"Lib.IntTypes.uint_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Hacl.Spec.SHA2.Vec.update",
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.ST.get",
"Prims.bool",
"Prims.l_imp",
"Prims.op_Negation",
"Prims.op_GreaterThan",
"Lib.NTuple.eq_intro",
"FStar.Seq.Properties.lseq",
"Lib.MultiBuffer.disjoint_multi",
"FStar.Pervasives.Native.tuple2",
"Lib.MultiBuffer.multiseq",
"FStar.Pervasives.Native.Mktuple2",
"Hacl.Spec.SHA2.Vec.load_last",
"Spec.Hash.Definitions.len_len",
"Hacl.Impl.SHA2.Core.load_last",
"Lib.Sequence.seq",
"Prims.l_or",
"Prims.nat",
"FStar.Seq.Base.length",
"Lib.IntTypes.numbytes",
"Spec.Hash.Definitions.len_int_type",
"Lib.ByteSequence.uint_to_bytes_be",
"Lib.ByteBuffer.uint_to_bytes_be",
"Lib.IntTypes.int_t",
"Prims.int",
"Lib.IntTypes.range",
"Lib.IntTypes.shift_left",
"FStar.UInt32.uint_to_t",
"FStar.UInt32.t",
"Lib.IntTypes.secret",
"Lib.Buffer.lbuffer_t",
"Lib.Buffer.create",
"Lib.IntTypes.u8",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.mul",
"Lib.IntTypes.mk_int",
"Lib.IntTypes.op_Star_Bang",
"Lib.IntTypes.size",
"Prims.l_and",
"Prims.op_GreaterThanOrEqual",
"Hacl.Spec.SHA2.Vec.padded_blocks",
"Hacl.Impl.SHA2.Core.padded_blocks",
"FStar.HyperStack.ST.push_frame"
] | [] | false | false | false | false | false | let update_last #a #m upd totlen len b hash =
| let h0 = ST.get () in
push_frame ();
let h1 = ST.get () in
let blocks = padded_blocks a len in
let fin = blocks *! HD.block_len a in
let last = create (size (lanes a m) *! 2ul *! HD.block_len a) (u8 0) in
let totlen_buf = create (len_len a) (u8 0) in
let total_len_bits = secret (shift_left #(len_int_type a) totlen 3ul) in
Lib.ByteBuffer.uint_to_bytes_be #(len_int_type a) totlen_buf total_len_bits;
let h2 = ST.get () in
NTup.eq_intro (as_seq_multi h2 b) (as_seq_multi h0 b);
assert (as_seq h2 totlen_buf == Lib.ByteSequence.uint_to_bytes_be #(len_int_type a) total_len_bits);
let last0, last1 = load_last #a #m totlen_buf len b fin last in
let h3 = ST.get () in
assert ((as_seq_multi h3 last0, as_seq_multi h3 last1) ==
SpecVec.load_last #a #m (as_seq h2 totlen_buf) (v fin) (v len) (as_seq_multi h2 b));
assert (disjoint_multi last1 hash);
upd last0 hash;
let h4 = ST.get () in
assert (modifies (loc hash |+| loc last |+| loc totlen_buf) h1 h3);
assert (as_seq h4 hash == SpecVec.update (as_seq_multi h3 last0) (as_seq h3 hash));
NTup.eq_intro (as_seq_multi h4 last1) (as_seq_multi h3 last1);
assert (v blocks > 1 ==> blocks >. 1ul);
assert (blocks >. 1ul ==> v blocks > 1);
assert (not (blocks >. 1ul) ==> not (v blocks > 1));
if blocks >. 1ul
then
(upd last1 hash;
let h5 = ST.get () in
assert (as_seq h5 hash == SpecVec.update (as_seq_multi h4 last1) (as_seq h4 hash));
assert (modifies (loc hash |+| loc last |+| loc totlen_buf) h1 h5);
assert (as_seq h5 hash ==
SpecVec.update_last totlen (v len) (as_seq_multi h0 b) (as_seq h0 hash));
pop_frame ())
else
(let h6 = ST.get () in
assert (h4 == h6);
assert (modifies (loc hash |+| loc totlen_buf |+| loc last) h1 h6);
assert (as_seq h6 hash ==
SpecVec.update_last totlen (v len) (as_seq_multi h0 b) (as_seq h0 hash));
pop_frame ()) | false |
Vale.Wrapper.X64.Cpuid.fst | Vale.Wrapper.X64.Cpuid.check_movbe | val check_movbe: unit -> Stack UInt64.t
(requires fun h0 -> True)
(ensures fun h0 ret_val h1 ->
((UInt64.v ret_val) =!= 0 ==> movbe_enabled) /\
B.modifies B.loc_none h0 h1) | val check_movbe: unit -> Stack UInt64.t
(requires fun h0 -> True)
(ensures fun h0 ret_val h1 ->
((UInt64.v ret_val) =!= 0 ==> movbe_enabled) /\
B.modifies B.loc_none h0 h1) | let check_movbe () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_movbe () in //This is a call to the interop wrapper
x | {
"file_name": "vale/code/arch/x64/interop/Vale.Wrapper.X64.Cpuid.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 27,
"start_col": 0,
"start_line": 25
} | module Vale.Wrapper.X64.Cpuid
open FStar.Mul
let check_aesni () =
let open Vale.X64.Decls in
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_aesni () in //This is a call to the interop wrapper
x
let check_sha () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_sha () in //This is a call to the interop wrapper
x
let check_adx_bmi2 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_adx_bmi2 () in //This is a call to the interop wrapper
x
let check_avx () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_avx () in //This is a call to the interop wrapper
x
let check_avx2 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_avx2 () in //This is a call to the interop wrapper
x | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Decls.fsti.checked",
"Vale.Stdcalls.X64.Cpuid.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": true,
"source_file": "Vale.Wrapper.X64.Cpuid.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Wrapper.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Wrapper.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit -> FStar.HyperStack.ST.Stack FStar.UInt64.t | FStar.HyperStack.ST.Stack | [] | [] | [
"Prims.unit",
"FStar.UInt64.t",
"FStar.Ghost.erased",
"Vale.Interop.X64.as_lowstar_sig_ret",
"Vale.Interop.X64.als_ret",
"Vale.Stdcalls.X64.Cpuid.check_movbe"
] | [] | false | true | false | false | false | let check_movbe () =
| let x, _ = Vale.Stdcalls.X64.Cpuid.check_movbe () in
x | false |
Vale.Wrapper.X64.Cpuid.fst | Vale.Wrapper.X64.Cpuid.check_avx2 | val check_avx2: unit -> Stack UInt64.t
(requires fun h0 -> True)
(ensures fun h0 ret_val h1 ->
((UInt64.v ret_val) =!= 0 ==> avx2_cpuid_enabled) /\
B.modifies B.loc_none h0 h1) | val check_avx2: unit -> Stack UInt64.t
(requires fun h0 -> True)
(ensures fun h0 ret_val h1 ->
((UInt64.v ret_val) =!= 0 ==> avx2_cpuid_enabled) /\
B.modifies B.loc_none h0 h1) | let check_avx2 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_avx2 () in //This is a call to the interop wrapper
x | {
"file_name": "vale/code/arch/x64/interop/Vale.Wrapper.X64.Cpuid.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 23,
"start_col": 0,
"start_line": 21
} | module Vale.Wrapper.X64.Cpuid
open FStar.Mul
let check_aesni () =
let open Vale.X64.Decls in
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_aesni () in //This is a call to the interop wrapper
x
let check_sha () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_sha () in //This is a call to the interop wrapper
x
let check_adx_bmi2 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_adx_bmi2 () in //This is a call to the interop wrapper
x
let check_avx () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_avx () in //This is a call to the interop wrapper
x | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Decls.fsti.checked",
"Vale.Stdcalls.X64.Cpuid.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": true,
"source_file": "Vale.Wrapper.X64.Cpuid.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Wrapper.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Wrapper.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit -> FStar.HyperStack.ST.Stack FStar.UInt64.t | FStar.HyperStack.ST.Stack | [] | [] | [
"Prims.unit",
"FStar.UInt64.t",
"FStar.Ghost.erased",
"Vale.Interop.X64.as_lowstar_sig_ret",
"Vale.Interop.X64.als_ret",
"Vale.Stdcalls.X64.Cpuid.check_avx2"
] | [] | false | true | false | false | false | let check_avx2 () =
| let x, _ = Vale.Stdcalls.X64.Cpuid.check_avx2 () in
x | false |
Hacl.Spec.Curve25519.Field64.Lemmas.fst | Hacl.Spec.Curve25519.Field64.Lemmas.carry_wide_bound | val carry_wide_bound: a:nat -> b:nat -> c:nat -> d:nat -> Lemma
(requires
a + b * pow2 256 == c + d * 38 /\
a < pow2 256 /\ c < pow2 256 /\ d < pow2 256)
(ensures b * 38 < pow2 63) | val carry_wide_bound: a:nat -> b:nat -> c:nat -> d:nat -> Lemma
(requires
a + b * pow2 256 == c + d * 38 /\
a < pow2 256 /\ c < pow2 256 /\ d < pow2 256)
(ensures b * 38 < pow2 63) | let carry_wide_bound a b c d =
assert_norm (38 < pow2 7);
lemma_mul_lt d 38 (pow2 256) (pow2 7);
Math.Lemmas.pow2_plus 256 7;
assert (c + d * 38 < pow2 263);
Math.Lemmas.pow2_plus 7 7;
Math.Lemmas.pow2_lt_compat 63 14 | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field64.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 34,
"end_line": 111,
"start_col": 0,
"start_line": 105
} | module Hacl.Spec.Curve25519.Field64.Lemmas
open FStar.Mul
open Lib.Sequence
open Lib.IntTypes
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field64.Definition
module BSeq = Lib.ByteSequence
module SD = Hacl.Spec.Bignum.Definitions
module SL = Hacl.Spec.Bignum.Lib
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val lemma_prime: unit -> Lemma (pow2 256 % prime == 38)
let lemma_prime () =
calc (==) {
pow2 256 % prime;
(==) { Math.Lemmas.pow2_plus 255 1 }
2 * pow2 255 % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r 2 (pow2 255) prime }
2 * (pow2 255 % prime) % prime;
(==) { Math.Lemmas.sub_div_mod_1 (pow2 255) prime }
2 * (19 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r 2 19 prime }
38 % prime;
(==) { Math.Lemmas.small_mod 38 prime }
38;
}
val lemma_prime19: unit -> Lemma (pow2 255 % prime == 19)
let lemma_prime19 () =
assert_norm (pow2 255 % prime = 19 % prime);
FStar.Math.Lemmas.small_mod 19 prime
val lemma_mul_pow256_add: fn:int -> c:int ->
Lemma ((fn + c * pow2 256) % prime == (fn + c * 38) % prime)
let lemma_mul_pow256_add fn c =
calc (==) {
(fn + c * pow2 256) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_r fn (c * pow2 256) prime }
(fn + c * pow2 256 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r c (pow2 256) prime }
(fn + c * (pow2 256 % prime) % prime) % prime;
(==) { lemma_prime () }
(fn + c * 38 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_r fn (c * 38) prime }
(fn + c * 38) % prime;
}
val lemma_mul_pow255_add: fn:int -> c:int ->
Lemma ((fn + c * pow2 255) % prime == (fn + c * 19) % prime)
let lemma_mul_pow255_add fn c =
calc (==) {
(fn + c * pow2 255) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_r fn (c * pow2 255) prime }
(fn + c * pow2 255 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r c (pow2 255) prime }
(fn + c * (pow2 255 % prime) % prime) % prime;
(==) { lemma_prime19 () }
(fn + c * 19 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_r fn (c * 19) prime }
(fn + c * 19) % prime;
}
val lemma_fsub4: fn1:nat -> fn2:nat -> c0:nat -> c1:nat ->
Lemma ((fn1 - fn2 + c0 * pow2 256 - c0 * 38 + c1 * pow2 256 - c1 * 38) % prime ==
(fn1 % prime - fn2 % prime) % prime)
let lemma_fsub4 fn1 fn2 c0 c1 =
calc (==) {
(fn1 - fn2 + c0 * pow2 256 - c0 * 38 + c1 * pow2 256 - c1 * 38) % prime;
(==) { lemma_mul_pow256_add (fn1 - fn2 + c0 * pow2 256 - c0 * 38 + c1 * pow2 256) (- c1) }
(fn1 - fn2 + c0 * pow2 256 - c0 * 38 + c1 * pow2 256 - c1 * pow2 256) % prime;
(==) { }
(fn1 - fn2 + c0 * pow2 256 - c0 * 38) % prime;
(==) { lemma_mul_pow256_add (fn1 - fn2 + c0 * pow2 256) (- c0) }
(fn1 - fn2 + c0 * pow2 256 - c0 * pow2 256) % prime;
(==) { }
(fn1 - fn2) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_l fn1 (- fn2) prime }
(fn1 % prime - fn2) % prime;
(==) { Math.Lemmas.lemma_mod_sub_distr (fn1 % prime) fn2 prime }
(fn1 % prime - fn2 % prime) % prime;
}
val lemma_mul_lt: a:nat -> b:nat -> c:pos -> d:pos -> Lemma
(requires a < c /\ b < d)
(ensures a * b < c * d)
let lemma_mul_lt a b c d = ()
val carry_wide_bound: a:nat -> b:nat -> c:nat -> d:nat -> Lemma
(requires
a + b * pow2 256 == c + d * 38 /\
a < pow2 256 /\ c < pow2 256 /\ d < pow2 256)
(ensures b * 38 < pow2 63) | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Hacl.Spec.Curve25519.Field64.Definition.fst.checked",
"Hacl.Spec.Bignum.Lib.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"Hacl.Spec.Bignum.Convert.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Spec.Curve25519.Field64.Lemmas.fst"
} | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Lib",
"short_module": "SL"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "SD"
},
{
"abbrev": true,
"full_module": "Lib.ByteSequence",
"short_module": "BSeq"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field64.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: Prims.nat -> b: Prims.nat -> c: Prims.nat -> d: Prims.nat
-> FStar.Pervasives.Lemma
(requires
a + b * Prims.pow2 256 == c + d * 38 /\ a < Prims.pow2 256 /\ c < Prims.pow2 256 /\
d < Prims.pow2 256) (ensures b * 38 < Prims.pow2 63) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"FStar.Math.Lemmas.pow2_lt_compat",
"Prims.unit",
"FStar.Math.Lemmas.pow2_plus",
"Prims._assert",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.op_Addition",
"FStar.Mul.op_Star",
"Prims.pow2",
"Hacl.Spec.Curve25519.Field64.Lemmas.lemma_mul_lt",
"FStar.Pervasives.assert_norm"
] | [] | true | false | true | false | false | let carry_wide_bound a b c d =
| assert_norm (38 < pow2 7);
lemma_mul_lt d 38 (pow2 256) (pow2 7);
Math.Lemmas.pow2_plus 256 7;
assert (c + d * 38 < pow2 263);
Math.Lemmas.pow2_plus 7 7;
Math.Lemmas.pow2_lt_compat 63 14 | false |
Hacl.Spec.Curve25519.Field64.Lemmas.fst | Hacl.Spec.Curve25519.Field64.Lemmas.lemma_prime19 | val lemma_prime19: unit -> Lemma (pow2 255 % prime == 19) | val lemma_prime19: unit -> Lemma (pow2 255 % prime == 19) | let lemma_prime19 () =
assert_norm (pow2 255 % prime = 19 % prime);
FStar.Math.Lemmas.small_mod 19 prime | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field64.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 38,
"end_line": 37,
"start_col": 0,
"start_line": 35
} | module Hacl.Spec.Curve25519.Field64.Lemmas
open FStar.Mul
open Lib.Sequence
open Lib.IntTypes
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field64.Definition
module BSeq = Lib.ByteSequence
module SD = Hacl.Spec.Bignum.Definitions
module SL = Hacl.Spec.Bignum.Lib
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val lemma_prime: unit -> Lemma (pow2 256 % prime == 38)
let lemma_prime () =
calc (==) {
pow2 256 % prime;
(==) { Math.Lemmas.pow2_plus 255 1 }
2 * pow2 255 % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r 2 (pow2 255) prime }
2 * (pow2 255 % prime) % prime;
(==) { Math.Lemmas.sub_div_mod_1 (pow2 255) prime }
2 * (19 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r 2 19 prime }
38 % prime;
(==) { Math.Lemmas.small_mod 38 prime }
38;
} | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Hacl.Spec.Curve25519.Field64.Definition.fst.checked",
"Hacl.Spec.Bignum.Lib.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"Hacl.Spec.Bignum.Convert.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Spec.Curve25519.Field64.Lemmas.fst"
} | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Lib",
"short_module": "SL"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "SD"
},
{
"abbrev": true,
"full_module": "Lib.ByteSequence",
"short_module": "BSeq"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field64.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit -> FStar.Pervasives.Lemma (ensures Prims.pow2 255 % Spec.Curve25519.prime == 19) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.unit",
"FStar.Math.Lemmas.small_mod",
"Spec.Curve25519.prime",
"FStar.Pervasives.assert_norm",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Prims.pow2"
] | [] | true | false | true | false | false | let lemma_prime19 () =
| assert_norm (pow2 255 % prime = 19 % prime);
FStar.Math.Lemmas.small_mod 19 prime | false |
Vale.Wrapper.X64.Cpuid.fst | Vale.Wrapper.X64.Cpuid.check_avx_xcr0 | val check_avx_xcr0: unit -> Stack UInt64.t
(requires fun h0 -> osxsave_enabled)
(ensures fun h0 ret_val h1 ->
((UInt64.v ret_val) =!= 0 ==> avx_xcr0) /\
B.modifies B.loc_none h0 h1) | val check_avx_xcr0: unit -> Stack UInt64.t
(requires fun h0 -> osxsave_enabled)
(ensures fun h0 ret_val h1 ->
((UInt64.v ret_val) =!= 0 ==> avx_xcr0) /\
B.modifies B.loc_none h0 h1) | let check_avx_xcr0 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_avx_xcr0 () in //This is a call to the interop wrapper
x | {
"file_name": "vale/code/arch/x64/interop/Vale.Wrapper.X64.Cpuid.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 47,
"start_col": 0,
"start_line": 45
} | module Vale.Wrapper.X64.Cpuid
open FStar.Mul
let check_aesni () =
let open Vale.X64.Decls in
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_aesni () in //This is a call to the interop wrapper
x
let check_sha () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_sha () in //This is a call to the interop wrapper
x
let check_adx_bmi2 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_adx_bmi2 () in //This is a call to the interop wrapper
x
let check_avx () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_avx () in //This is a call to the interop wrapper
x
let check_avx2 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_avx2 () in //This is a call to the interop wrapper
x
let check_movbe () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_movbe () in //This is a call to the interop wrapper
x
let check_sse () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_sse () in //This is a call to the interop wrapper
x
let check_rdrand () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_rdrand () in //This is a call to the interop wrapper
x
let check_avx512 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_avx512 () in //This is a call to the interop wrapper
x
let check_osxsave () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_osxsave () in //This is a call to the interop wrapper
x | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Decls.fsti.checked",
"Vale.Stdcalls.X64.Cpuid.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": true,
"source_file": "Vale.Wrapper.X64.Cpuid.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Wrapper.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Wrapper.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit -> FStar.HyperStack.ST.Stack FStar.UInt64.t | FStar.HyperStack.ST.Stack | [] | [] | [
"Prims.unit",
"FStar.UInt64.t",
"FStar.Ghost.erased",
"Vale.Interop.X64.as_lowstar_sig_ret",
"Vale.Interop.X64.als_ret",
"Vale.Stdcalls.X64.Cpuid.check_avx_xcr0"
] | [] | false | true | false | false | false | let check_avx_xcr0 () =
| let x, _ = Vale.Stdcalls.X64.Cpuid.check_avx_xcr0 () in
x | false |
Hacl.Impl.Frodo.Pack.fst | Hacl.Impl.Frodo.Pack.frodo_pack | val frodo_pack:
#n1:size_t
-> #n2:size_t{v n1 * v n2 <= max_size_t /\ (v n1 * v n2) % 8 = 0}
-> d:size_t{v d * ((v n1 * v n2) / 8) <= max_size_t /\ v d <= 16}
-> a:matrix_t n1 n2
-> res:lbytes (d *! ((n1 *! n2) /. size 8))
-> Stack unit
(requires fun h -> live h a /\ live h res /\ disjoint a res)
(ensures fun h0 _ h1 ->
modifies1 res h0 h1 /\
as_seq h1 res == S.frodo_pack (v d) (as_matrix h0 a)) | val frodo_pack:
#n1:size_t
-> #n2:size_t{v n1 * v n2 <= max_size_t /\ (v n1 * v n2) % 8 = 0}
-> d:size_t{v d * ((v n1 * v n2) / 8) <= max_size_t /\ v d <= 16}
-> a:matrix_t n1 n2
-> res:lbytes (d *! ((n1 *! n2) /. size 8))
-> Stack unit
(requires fun h -> live h a /\ live h res /\ disjoint a res)
(ensures fun h0 _ h1 ->
modifies1 res h0 h1 /\
as_seq h1 res == S.frodo_pack (v d) (as_matrix h0 a)) | let frodo_pack #n1 #n2 d a res =
let n = (n1 *! n2) /. size 8 in
let a_spec = S.frodo_pack_state #(v n1) #(v n2) (v d) in
[@ inline_let]
let refl h (i:size_nat{i <= v n}) = Seq.sub (as_seq h res) 0 (v d * i) in
let footprint (i:size_nat{i <= v n}) = loc res in
[@ inline_let]
let spec h0 = S.frodo_pack_inner #(v n1) #(v n2) (v d) (as_seq h0 a) in
let h0 = ST.get() in
assert (Seq.equal (refl h0 0) (Seq.create 0 (u8 0)));
loop h0 n a_spec refl footprint spec
(fun i ->
FStar.Math.Lemmas.lemma_mult_le_left (v d) (v i + 1) (v n);
assert (v (d *! i +! d) <= v (d *! ((n1 *! n2) /. size 8)));
Loops.unfold_repeat_gen (v n) a_spec (spec h0) (refl h0 0) (v i);
let a = sub a (size 8 *! i) (size 8) in
let r = sub res (d *! i) d in
frodo_pack8 d a r;
let h = ST.get() in
lemma_split (refl h (v i + 1)) (v d * v i)
) | {
"file_name": "code/frodo/Hacl.Impl.Frodo.Pack.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 5,
"end_line": 98,
"start_col": 0,
"start_line": 78
} | module Hacl.Impl.Frodo.Pack
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Hacl.Impl.Matrix
module ST = FStar.HyperStack.ST
module Loops = Lib.LoopCombinators
module Seq = Lib.Sequence
module S = Spec.Frodo.Pack
#reset-options "--z3rlimit 100 --max_fuel 0 --max_ifuel 0 --using_facts_from '* -Spec +Spec.Frodo.Pack +Spec.Matrix'"
val lemma_split: #a:Type -> #len:size_nat -> s:Seq.lseq a len -> i:size_nat{i <= len} ->
Lemma (s == Seq.(Seq.sub s 0 i @| Seq.sub s i (len - i)))
let lemma_split #a #len s i =
FStar.Seq.lemma_split s i
/// Pack
inline_for_extraction noextract
val frodo_pack8:
d:size_t{v d <= 16}
-> a:lbuffer uint16 8ul
-> res:lbytes d
-> Stack unit
(requires fun h0 -> live h0 a /\ live h0 res /\ disjoint a res)
(ensures fun h0 _ h1 ->
modifies1 res h0 h1 /\
as_seq h1 res == S.frodo_pack8 (v d) (as_seq h0 a))
let frodo_pack8 d a res =
let h0 = ST.get() in
push_frame();
let maskd = to_u16 (u32 1 <<. d) -. u16 1 in
let v16 = create (size 16) (u8 0) in
let a0 = index a (size 0) &. maskd in
let a1 = index a (size 1) &. maskd in
let a2 = index a (size 2) &. maskd in
let a3 = index a (size 3) &. maskd in
let a4 = index a (size 4) &. maskd in
let a5 = index a (size 5) &. maskd in
let a6 = index a (size 6) &. maskd in
let a7 = index a (size 7) &. maskd in
let templong =
to_u128 a0 <<. (size 7 *! d)
|. to_u128 a1 <<. (size 6 *! d)
|. to_u128 a2 <<. (size 5 *! d)
|. to_u128 a3 <<. (size 4 *! d)
|. to_u128 a4 <<. (size 3 *! d)
|. to_u128 a5 <<. (size 2 *! d)
|. to_u128 a6 <<. (size 1 *! d)
|. to_u128 a7 <<. (size 0 *! d)
in
uint_to_bytes_be v16 templong;
let src = sub v16 (size 16 -! d) d in // Skips the 1st byte when d = 15
copy res src;
pop_frame()
val frodo_pack:
#n1:size_t
-> #n2:size_t{v n1 * v n2 <= max_size_t /\ (v n1 * v n2) % 8 = 0}
-> d:size_t{v d * ((v n1 * v n2) / 8) <= max_size_t /\ v d <= 16}
-> a:matrix_t n1 n2
-> res:lbytes (d *! ((n1 *! n2) /. size 8))
-> Stack unit
(requires fun h -> live h a /\ live h res /\ disjoint a res)
(ensures fun h0 _ h1 ->
modifies1 res h0 h1 /\
as_seq h1 res == S.frodo_pack (v d) (as_matrix h0 a))
#push-options "--z3rlimit 400" | {
"checked_file": "/",
"dependencies": [
"Spec.Frodo.Pack.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.Matrix.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": false,
"source_file": "Hacl.Impl.Frodo.Pack.fst"
} | [
{
"abbrev": true,
"full_module": "Spec.Frodo.Pack",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "Seq"
},
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Matrix",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Buffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 400,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
d:
Lib.IntTypes.size_t
{ Lib.IntTypes.v d * (Lib.IntTypes.v n1 * Lib.IntTypes.v n2 / 8) <= Lib.IntTypes.max_size_t /\
Lib.IntTypes.v d <= 16 } ->
a: Hacl.Impl.Matrix.matrix_t n1 n2 ->
res: Hacl.Impl.Matrix.lbytes (d *! (n1 *! n2 /. Lib.IntTypes.size 8))
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Lib.IntTypes.size_t",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Lib.IntTypes.max_size_t",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Prims.op_Division",
"Hacl.Impl.Matrix.matrix_t",
"Hacl.Impl.Matrix.lbytes",
"Lib.IntTypes.op_Star_Bang",
"Lib.IntTypes.op_Slash_Dot",
"Lib.IntTypes.size",
"Lib.Buffer.loop",
"Prims.op_LessThan",
"Hacl.Impl.Frodo.Pack.lemma_split",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Prims.op_Multiply",
"Prims.op_Addition",
"Prims.unit",
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.ST.get",
"Hacl.Impl.Frodo.Pack.frodo_pack8",
"Lib.Buffer.lbuffer_t",
"Lib.Buffer.MUT",
"Lib.Buffer.sub",
"Lib.IntTypes.uint8",
"Lib.IntTypes.U16",
"Lib.IntTypes.mk_int",
"Hacl.Impl.Matrix.elem",
"Lib.LoopCombinators.unfold_repeat_gen",
"Prims._assert",
"Lib.IntTypes.op_Plus_Bang",
"FStar.Math.Lemmas.lemma_mult_le_left",
"Lib.Sequence.equal",
"Lib.Sequence.create",
"Lib.IntTypes.u8",
"Prims.nat",
"Prims.op_Subtraction",
"Prims.pow2",
"Spec.Frodo.Pack.frodo_pack_state",
"Spec.Frodo.Pack.frodo_pack_inner",
"Lib.Buffer.as_seq",
"LowStar.Monotonic.Buffer.loc",
"Lib.IntTypes.size_nat",
"Lib.Buffer.loc",
"Lib.Sequence.lseq",
"Prims.eq2",
"FStar.Seq.Base.seq",
"Lib.Sequence.to_seq",
"FStar.Seq.Base.slice",
"Lib.IntTypes.mul",
"Lib.IntTypes.div",
"Prims.l_Forall",
"Prims.l_or",
"FStar.Seq.Base.index",
"Lib.Sequence.index",
"Lib.Sequence.sub"
] | [] | false | true | false | false | false | let frodo_pack #n1 #n2 d a res =
| let n = (n1 *! n2) /. size 8 in
let a_spec = S.frodo_pack_state #(v n1) #(v n2) (v d) in
[@@ inline_let ]let refl h (i: size_nat{i <= v n}) = Seq.sub (as_seq h res) 0 (v d * i) in
let footprint (i: size_nat{i <= v n}) = loc res in
[@@ inline_let ]let spec h0 = S.frodo_pack_inner #(v n1) #(v n2) (v d) (as_seq h0 a) in
let h0 = ST.get () in
assert (Seq.equal (refl h0 0) (Seq.create 0 (u8 0)));
loop h0
n
a_spec
refl
footprint
spec
(fun i ->
FStar.Math.Lemmas.lemma_mult_le_left (v d) (v i + 1) (v n);
assert (v (d *! i +! d) <= v (d *! ((n1 *! n2) /. size 8)));
Loops.unfold_repeat_gen (v n) a_spec (spec h0) (refl h0 0) (v i);
let a = sub a (size 8 *! i) (size 8) in
let r = sub res (d *! i) d in
frodo_pack8 d a r;
let h = ST.get () in
lemma_split (refl h (v i + 1)) (v d * v i)) | false |
Steel.Preorder.fst | Steel.Preorder.hist | val hist : q: FStar.Preorder.preorder a -> Type | let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l} | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 63,
"end_line": 92,
"start_col": 0,
"start_line": 92
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl) | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | q: FStar.Preorder.preorder a -> Type | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.preorder",
"Prims.list",
"Steel.Preorder.qhistory"
] | [] | false | false | false | true | true | let hist (#a: Type u#a) (q: preorder a) =
| l: list a {qhistory q l} | false |
|
Hacl.Spec.Curve25519.Field64.Lemmas.fst | Hacl.Spec.Curve25519.Field64.Lemmas.fmul14_bound | val fmul14_bound: a:nat -> b:nat -> c:nat -> d:nat -> Lemma
(requires
a + b * pow2 256 == c * d /\
a < pow2 256 /\ c < pow2 256 /\ d < pow2 17)
(ensures b * 38 < pow2 63) | val fmul14_bound: a:nat -> b:nat -> c:nat -> d:nat -> Lemma
(requires
a + b * pow2 256 == c * d /\
a < pow2 256 /\ c < pow2 256 /\ d < pow2 17)
(ensures b * 38 < pow2 63) | let fmul14_bound a b c d =
lemma_mul_lt c d (pow2 256) (pow2 17);
//Math.Lemmas.pow2_plus 256 17;
//assert (c * d < pow2 273);
assert (b < pow2 17);
assert_norm (38 < pow2 7);
Math.Lemmas.pow2_plus 17 7;
Math.Lemmas.pow2_lt_compat 63 24 | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field64.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 34,
"end_line": 127,
"start_col": 0,
"start_line": 120
} | module Hacl.Spec.Curve25519.Field64.Lemmas
open FStar.Mul
open Lib.Sequence
open Lib.IntTypes
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field64.Definition
module BSeq = Lib.ByteSequence
module SD = Hacl.Spec.Bignum.Definitions
module SL = Hacl.Spec.Bignum.Lib
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val lemma_prime: unit -> Lemma (pow2 256 % prime == 38)
let lemma_prime () =
calc (==) {
pow2 256 % prime;
(==) { Math.Lemmas.pow2_plus 255 1 }
2 * pow2 255 % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r 2 (pow2 255) prime }
2 * (pow2 255 % prime) % prime;
(==) { Math.Lemmas.sub_div_mod_1 (pow2 255) prime }
2 * (19 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r 2 19 prime }
38 % prime;
(==) { Math.Lemmas.small_mod 38 prime }
38;
}
val lemma_prime19: unit -> Lemma (pow2 255 % prime == 19)
let lemma_prime19 () =
assert_norm (pow2 255 % prime = 19 % prime);
FStar.Math.Lemmas.small_mod 19 prime
val lemma_mul_pow256_add: fn:int -> c:int ->
Lemma ((fn + c * pow2 256) % prime == (fn + c * 38) % prime)
let lemma_mul_pow256_add fn c =
calc (==) {
(fn + c * pow2 256) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_r fn (c * pow2 256) prime }
(fn + c * pow2 256 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r c (pow2 256) prime }
(fn + c * (pow2 256 % prime) % prime) % prime;
(==) { lemma_prime () }
(fn + c * 38 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_r fn (c * 38) prime }
(fn + c * 38) % prime;
}
val lemma_mul_pow255_add: fn:int -> c:int ->
Lemma ((fn + c * pow2 255) % prime == (fn + c * 19) % prime)
let lemma_mul_pow255_add fn c =
calc (==) {
(fn + c * pow2 255) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_r fn (c * pow2 255) prime }
(fn + c * pow2 255 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r c (pow2 255) prime }
(fn + c * (pow2 255 % prime) % prime) % prime;
(==) { lemma_prime19 () }
(fn + c * 19 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_r fn (c * 19) prime }
(fn + c * 19) % prime;
}
val lemma_fsub4: fn1:nat -> fn2:nat -> c0:nat -> c1:nat ->
Lemma ((fn1 - fn2 + c0 * pow2 256 - c0 * 38 + c1 * pow2 256 - c1 * 38) % prime ==
(fn1 % prime - fn2 % prime) % prime)
let lemma_fsub4 fn1 fn2 c0 c1 =
calc (==) {
(fn1 - fn2 + c0 * pow2 256 - c0 * 38 + c1 * pow2 256 - c1 * 38) % prime;
(==) { lemma_mul_pow256_add (fn1 - fn2 + c0 * pow2 256 - c0 * 38 + c1 * pow2 256) (- c1) }
(fn1 - fn2 + c0 * pow2 256 - c0 * 38 + c1 * pow2 256 - c1 * pow2 256) % prime;
(==) { }
(fn1 - fn2 + c0 * pow2 256 - c0 * 38) % prime;
(==) { lemma_mul_pow256_add (fn1 - fn2 + c0 * pow2 256) (- c0) }
(fn1 - fn2 + c0 * pow2 256 - c0 * pow2 256) % prime;
(==) { }
(fn1 - fn2) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_l fn1 (- fn2) prime }
(fn1 % prime - fn2) % prime;
(==) { Math.Lemmas.lemma_mod_sub_distr (fn1 % prime) fn2 prime }
(fn1 % prime - fn2 % prime) % prime;
}
val lemma_mul_lt: a:nat -> b:nat -> c:pos -> d:pos -> Lemma
(requires a < c /\ b < d)
(ensures a * b < c * d)
let lemma_mul_lt a b c d = ()
val carry_wide_bound: a:nat -> b:nat -> c:nat -> d:nat -> Lemma
(requires
a + b * pow2 256 == c + d * 38 /\
a < pow2 256 /\ c < pow2 256 /\ d < pow2 256)
(ensures b * 38 < pow2 63)
let carry_wide_bound a b c d =
assert_norm (38 < pow2 7);
lemma_mul_lt d 38 (pow2 256) (pow2 7);
Math.Lemmas.pow2_plus 256 7;
assert (c + d * 38 < pow2 263);
Math.Lemmas.pow2_plus 7 7;
Math.Lemmas.pow2_lt_compat 63 14
val fmul14_bound: a:nat -> b:nat -> c:nat -> d:nat -> Lemma
(requires
a + b * pow2 256 == c * d /\
a < pow2 256 /\ c < pow2 256 /\ d < pow2 17)
(ensures b * 38 < pow2 63) | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Hacl.Spec.Curve25519.Field64.Definition.fst.checked",
"Hacl.Spec.Bignum.Lib.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"Hacl.Spec.Bignum.Convert.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Spec.Curve25519.Field64.Lemmas.fst"
} | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Lib",
"short_module": "SL"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "SD"
},
{
"abbrev": true,
"full_module": "Lib.ByteSequence",
"short_module": "BSeq"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field64.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: Prims.nat -> b: Prims.nat -> c: Prims.nat -> d: Prims.nat
-> FStar.Pervasives.Lemma
(requires
a + b * Prims.pow2 256 == c * d /\ a < Prims.pow2 256 /\ c < Prims.pow2 256 /\
d < Prims.pow2 17) (ensures b * 38 < Prims.pow2 63) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"FStar.Math.Lemmas.pow2_lt_compat",
"Prims.unit",
"FStar.Math.Lemmas.pow2_plus",
"FStar.Pervasives.assert_norm",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"Prims._assert",
"Hacl.Spec.Curve25519.Field64.Lemmas.lemma_mul_lt"
] | [] | true | false | true | false | false | let fmul14_bound a b c d =
| lemma_mul_lt c d (pow2 256) (pow2 17);
assert (b < pow2 17);
assert_norm (38 < pow2 7);
Math.Lemmas.pow2_plus 17 7;
Math.Lemmas.pow2_lt_compat 63 24 | false |
Vale.Wrapper.X64.Cpuid.fst | Vale.Wrapper.X64.Cpuid.check_avx512 | val check_avx512: unit -> Stack UInt64.t
(requires fun h0 -> True)
(ensures fun h0 ret_val h1 ->
((UInt64.v ret_val) =!= 0 ==> avx512_cpuid_enabled) /\
B.modifies B.loc_none h0 h1) | val check_avx512: unit -> Stack UInt64.t
(requires fun h0 -> True)
(ensures fun h0 ret_val h1 ->
((UInt64.v ret_val) =!= 0 ==> avx512_cpuid_enabled) /\
B.modifies B.loc_none h0 h1) | let check_avx512 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_avx512 () in //This is a call to the interop wrapper
x | {
"file_name": "vale/code/arch/x64/interop/Vale.Wrapper.X64.Cpuid.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 39,
"start_col": 0,
"start_line": 37
} | module Vale.Wrapper.X64.Cpuid
open FStar.Mul
let check_aesni () =
let open Vale.X64.Decls in
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_aesni () in //This is a call to the interop wrapper
x
let check_sha () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_sha () in //This is a call to the interop wrapper
x
let check_adx_bmi2 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_adx_bmi2 () in //This is a call to the interop wrapper
x
let check_avx () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_avx () in //This is a call to the interop wrapper
x
let check_avx2 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_avx2 () in //This is a call to the interop wrapper
x
let check_movbe () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_movbe () in //This is a call to the interop wrapper
x
let check_sse () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_sse () in //This is a call to the interop wrapper
x
let check_rdrand () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_rdrand () in //This is a call to the interop wrapper
x | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Decls.fsti.checked",
"Vale.Stdcalls.X64.Cpuid.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": true,
"source_file": "Vale.Wrapper.X64.Cpuid.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Wrapper.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Wrapper.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit -> FStar.HyperStack.ST.Stack FStar.UInt64.t | FStar.HyperStack.ST.Stack | [] | [] | [
"Prims.unit",
"FStar.UInt64.t",
"FStar.Ghost.erased",
"Vale.Interop.X64.as_lowstar_sig_ret",
"Vale.Interop.X64.als_ret",
"Vale.Stdcalls.X64.Cpuid.check_avx512"
] | [] | false | true | false | false | false | let check_avx512 () =
| let x, _ = Vale.Stdcalls.X64.Cpuid.check_avx512 () in
x | false |
Vale.Wrapper.X64.Cpuid.fst | Vale.Wrapper.X64.Cpuid.check_osxsave | val check_osxsave: unit -> Stack UInt64.t
(requires fun h0 -> True)
(ensures fun h0 ret_val h1 ->
((UInt64.v ret_val) =!= 0 ==> osxsave_enabled) /\
B.modifies B.loc_none h0 h1) | val check_osxsave: unit -> Stack UInt64.t
(requires fun h0 -> True)
(ensures fun h0 ret_val h1 ->
((UInt64.v ret_val) =!= 0 ==> osxsave_enabled) /\
B.modifies B.loc_none h0 h1) | let check_osxsave () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_osxsave () in //This is a call to the interop wrapper
x | {
"file_name": "vale/code/arch/x64/interop/Vale.Wrapper.X64.Cpuid.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 43,
"start_col": 0,
"start_line": 41
} | module Vale.Wrapper.X64.Cpuid
open FStar.Mul
let check_aesni () =
let open Vale.X64.Decls in
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_aesni () in //This is a call to the interop wrapper
x
let check_sha () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_sha () in //This is a call to the interop wrapper
x
let check_adx_bmi2 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_adx_bmi2 () in //This is a call to the interop wrapper
x
let check_avx () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_avx () in //This is a call to the interop wrapper
x
let check_avx2 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_avx2 () in //This is a call to the interop wrapper
x
let check_movbe () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_movbe () in //This is a call to the interop wrapper
x
let check_sse () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_sse () in //This is a call to the interop wrapper
x
let check_rdrand () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_rdrand () in //This is a call to the interop wrapper
x
let check_avx512 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_avx512 () in //This is a call to the interop wrapper
x | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Decls.fsti.checked",
"Vale.Stdcalls.X64.Cpuid.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": true,
"source_file": "Vale.Wrapper.X64.Cpuid.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Wrapper.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Wrapper.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit -> FStar.HyperStack.ST.Stack FStar.UInt64.t | FStar.HyperStack.ST.Stack | [] | [] | [
"Prims.unit",
"FStar.UInt64.t",
"FStar.Ghost.erased",
"Vale.Interop.X64.as_lowstar_sig_ret",
"Vale.Interop.X64.als_ret",
"Vale.Stdcalls.X64.Cpuid.check_osxsave"
] | [] | false | true | false | false | false | let check_osxsave () =
| let x, _ = Vale.Stdcalls.X64.Cpuid.check_osxsave () in
x | false |
Hacl.Spec.Curve25519.Field64.Lemmas.fst | Hacl.Spec.Curve25519.Field64.Lemmas.lemma_subtract_p4_0 | val lemma_subtract_p4_0: f:felem4 -> f':felem4 -> Lemma
(requires
(let (f0, f1, f2, f3) = f in
let (f0', f1', f2', f3') = f' in
v f3 < pow2 63 /\
(v f3 <> 0x7fffffffffffffff || v f2 <> 0xffffffffffffffff || v f1 <> 0xffffffffffffffff || v f0 < 0xffffffffffffffed) /\
(v f0' = v f0 && v f1' = v f1 && v f2' = v f2 && v f3' = v f3)))
(ensures as_nat4 f' == as_nat4 f % prime) | val lemma_subtract_p4_0: f:felem4 -> f':felem4 -> Lemma
(requires
(let (f0, f1, f2, f3) = f in
let (f0', f1', f2', f3') = f' in
v f3 < pow2 63 /\
(v f3 <> 0x7fffffffffffffff || v f2 <> 0xffffffffffffffff || v f1 <> 0xffffffffffffffff || v f0 < 0xffffffffffffffed) /\
(v f0' = v f0 && v f1' = v f1 && v f2' = v f2 && v f3' = v f3)))
(ensures as_nat4 f' == as_nat4 f % prime) | let lemma_subtract_p4_0 f f' =
let (f0, f1, f2, f3) = f in
let (f0', f1', f2', f3') = f' in
assert_norm (0x7fffffffffffffff = pow2 63 - 1);
assert_norm (0xffffffffffffffff = pow2 64 - 1);
assert_norm (0xffffffffffffffed = pow2 64 - 19);
assert (as_nat4 f == v f0 + v f1 * pow2 64 + v f2 * pow2 64 * pow2 64 + v f3 * pow2 64 * pow2 64 * pow2 64);
assert (as_nat4 f <= pow2 64 - 20 + (pow2 64 - 1) * pow2 64 + (pow2 64 - 1) * pow2 64 * pow2 64 +
(pow2 63 - 1) * pow2 64 * pow2 64 * pow2 64);
assert_norm (pow2 63 * pow2 64 * pow2 64 * pow2 64 = pow2 255);
assert (as_nat4 f < pow2 255 - 19);
assert (as_nat4 f == as_nat4 f');
FStar.Math.Lemmas.modulo_lemma (as_nat4 f') prime | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field64.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 51,
"end_line": 163,
"start_col": 0,
"start_line": 151
} | module Hacl.Spec.Curve25519.Field64.Lemmas
open FStar.Mul
open Lib.Sequence
open Lib.IntTypes
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field64.Definition
module BSeq = Lib.ByteSequence
module SD = Hacl.Spec.Bignum.Definitions
module SL = Hacl.Spec.Bignum.Lib
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val lemma_prime: unit -> Lemma (pow2 256 % prime == 38)
let lemma_prime () =
calc (==) {
pow2 256 % prime;
(==) { Math.Lemmas.pow2_plus 255 1 }
2 * pow2 255 % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r 2 (pow2 255) prime }
2 * (pow2 255 % prime) % prime;
(==) { Math.Lemmas.sub_div_mod_1 (pow2 255) prime }
2 * (19 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r 2 19 prime }
38 % prime;
(==) { Math.Lemmas.small_mod 38 prime }
38;
}
val lemma_prime19: unit -> Lemma (pow2 255 % prime == 19)
let lemma_prime19 () =
assert_norm (pow2 255 % prime = 19 % prime);
FStar.Math.Lemmas.small_mod 19 prime
val lemma_mul_pow256_add: fn:int -> c:int ->
Lemma ((fn + c * pow2 256) % prime == (fn + c * 38) % prime)
let lemma_mul_pow256_add fn c =
calc (==) {
(fn + c * pow2 256) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_r fn (c * pow2 256) prime }
(fn + c * pow2 256 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r c (pow2 256) prime }
(fn + c * (pow2 256 % prime) % prime) % prime;
(==) { lemma_prime () }
(fn + c * 38 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_r fn (c * 38) prime }
(fn + c * 38) % prime;
}
val lemma_mul_pow255_add: fn:int -> c:int ->
Lemma ((fn + c * pow2 255) % prime == (fn + c * 19) % prime)
let lemma_mul_pow255_add fn c =
calc (==) {
(fn + c * pow2 255) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_r fn (c * pow2 255) prime }
(fn + c * pow2 255 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r c (pow2 255) prime }
(fn + c * (pow2 255 % prime) % prime) % prime;
(==) { lemma_prime19 () }
(fn + c * 19 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_r fn (c * 19) prime }
(fn + c * 19) % prime;
}
val lemma_fsub4: fn1:nat -> fn2:nat -> c0:nat -> c1:nat ->
Lemma ((fn1 - fn2 + c0 * pow2 256 - c0 * 38 + c1 * pow2 256 - c1 * 38) % prime ==
(fn1 % prime - fn2 % prime) % prime)
let lemma_fsub4 fn1 fn2 c0 c1 =
calc (==) {
(fn1 - fn2 + c0 * pow2 256 - c0 * 38 + c1 * pow2 256 - c1 * 38) % prime;
(==) { lemma_mul_pow256_add (fn1 - fn2 + c0 * pow2 256 - c0 * 38 + c1 * pow2 256) (- c1) }
(fn1 - fn2 + c0 * pow2 256 - c0 * 38 + c1 * pow2 256 - c1 * pow2 256) % prime;
(==) { }
(fn1 - fn2 + c0 * pow2 256 - c0 * 38) % prime;
(==) { lemma_mul_pow256_add (fn1 - fn2 + c0 * pow2 256) (- c0) }
(fn1 - fn2 + c0 * pow2 256 - c0 * pow2 256) % prime;
(==) { }
(fn1 - fn2) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_l fn1 (- fn2) prime }
(fn1 % prime - fn2) % prime;
(==) { Math.Lemmas.lemma_mod_sub_distr (fn1 % prime) fn2 prime }
(fn1 % prime - fn2 % prime) % prime;
}
val lemma_mul_lt: a:nat -> b:nat -> c:pos -> d:pos -> Lemma
(requires a < c /\ b < d)
(ensures a * b < c * d)
let lemma_mul_lt a b c d = ()
val carry_wide_bound: a:nat -> b:nat -> c:nat -> d:nat -> Lemma
(requires
a + b * pow2 256 == c + d * 38 /\
a < pow2 256 /\ c < pow2 256 /\ d < pow2 256)
(ensures b * 38 < pow2 63)
let carry_wide_bound a b c d =
assert_norm (38 < pow2 7);
lemma_mul_lt d 38 (pow2 256) (pow2 7);
Math.Lemmas.pow2_plus 256 7;
assert (c + d * 38 < pow2 263);
Math.Lemmas.pow2_plus 7 7;
Math.Lemmas.pow2_lt_compat 63 14
val fmul14_bound: a:nat -> b:nat -> c:nat -> d:nat -> Lemma
(requires
a + b * pow2 256 == c * d /\
a < pow2 256 /\ c < pow2 256 /\ d < pow2 17)
(ensures b * 38 < pow2 63)
let fmul14_bound a b c d =
lemma_mul_lt c d (pow2 256) (pow2 17);
//Math.Lemmas.pow2_plus 256 17;
//assert (c * d < pow2 273);
assert (b < pow2 17);
assert_norm (38 < pow2 7);
Math.Lemmas.pow2_plus 17 7;
Math.Lemmas.pow2_lt_compat 63 24
val carry_pass_store_bound: f:nat -> top_bit:nat -> r0:nat -> r1:nat -> c:nat -> Lemma
(requires
top_bit == f / pow2 255 /\
r0 + top_bit * pow2 255 == f /\
r1 + c * pow2 256 == r0 + 19 * top_bit /\
r0 < pow2 256 /\ r1 < pow2 256 /\
f < pow2 256 /\ top_bit <= 1)
(ensures c = 0 /\ r0 < pow2 255)
let carry_pass_store_bound f top_bit r0 r1 c = ()
val lemma_subtract_p4_0: f:felem4 -> f':felem4 -> Lemma
(requires
(let (f0, f1, f2, f3) = f in
let (f0', f1', f2', f3') = f' in
v f3 < pow2 63 /\
(v f3 <> 0x7fffffffffffffff || v f2 <> 0xffffffffffffffff || v f1 <> 0xffffffffffffffff || v f0 < 0xffffffffffffffed) /\
(v f0' = v f0 && v f1' = v f1 && v f2' = v f2 && v f3' = v f3)))
(ensures as_nat4 f' == as_nat4 f % prime) | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Hacl.Spec.Curve25519.Field64.Definition.fst.checked",
"Hacl.Spec.Bignum.Lib.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"Hacl.Spec.Bignum.Convert.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Spec.Curve25519.Field64.Lemmas.fst"
} | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Lib",
"short_module": "SL"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "SD"
},
{
"abbrev": true,
"full_module": "Lib.ByteSequence",
"short_module": "BSeq"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field64.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
f: Hacl.Spec.Curve25519.Field64.Definition.felem4 ->
f': Hacl.Spec.Curve25519.Field64.Definition.felem4
-> FStar.Pervasives.Lemma
(requires
(let _ = f in
(let FStar.Pervasives.Native.Mktuple4 #_ #_ #_ #_ f0 f1 f2 f3 = _ in
let _ = f' in
(let FStar.Pervasives.Native.Mktuple4 #_ #_ #_ #_ f0' f1' f2' f3' = _ in
Lib.IntTypes.v f3 < Prims.pow2 63 /\
Lib.IntTypes.v f3 <> 0x7fffffffffffffff || Lib.IntTypes.v f2 <> 0xffffffffffffffff ||
Lib.IntTypes.v f1 <> 0xffffffffffffffff ||
Lib.IntTypes.v f0 < 0xffffffffffffffed /\
Lib.IntTypes.v f0' = Lib.IntTypes.v f0 && Lib.IntTypes.v f1' = Lib.IntTypes.v f1 &&
Lib.IntTypes.v f2' = Lib.IntTypes.v f2 &&
Lib.IntTypes.v f3' = Lib.IntTypes.v f3)
<:
Type0)
<:
Type0))
(ensures
Hacl.Spec.Curve25519.Field64.Definition.as_nat4 f' ==
Hacl.Spec.Curve25519.Field64.Definition.as_nat4 f % Spec.Curve25519.prime) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Curve25519.Field64.Definition.felem4",
"Lib.IntTypes.uint64",
"FStar.Math.Lemmas.modulo_lemma",
"Hacl.Spec.Curve25519.Field64.Definition.as_nat4",
"Spec.Curve25519.prime",
"Prims.unit",
"Prims._assert",
"Prims.eq2",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.op_Subtraction",
"Prims.pow2",
"FStar.Pervasives.assert_norm",
"Prims.op_Equality",
"Prims.int",
"FStar.Mul.op_Star",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Lib.IntTypes.v",
"Lib.IntTypes.U64",
"Lib.IntTypes.SEC"
] | [] | false | false | true | false | false | let lemma_subtract_p4_0 f f' =
| let f0, f1, f2, f3 = f in
let f0', f1', f2', f3' = f' in
assert_norm (0x7fffffffffffffff = pow2 63 - 1);
assert_norm (0xffffffffffffffff = pow2 64 - 1);
assert_norm (0xffffffffffffffed = pow2 64 - 19);
assert (as_nat4 f ==
v f0 + v f1 * pow2 64 + (v f2 * pow2 64) * pow2 64 + ((v f3 * pow2 64) * pow2 64) * pow2 64);
assert (as_nat4 f <=
pow2 64 - 20 + (pow2 64 - 1) * pow2 64 + ((pow2 64 - 1) * pow2 64) * pow2 64 +
(((pow2 63 - 1) * pow2 64) * pow2 64) * pow2 64);
assert_norm (((pow2 63 * pow2 64) * pow2 64) * pow2 64 = pow2 255);
assert (as_nat4 f < pow2 255 - 19);
assert (as_nat4 f == as_nat4 f');
FStar.Math.Lemmas.modulo_lemma (as_nat4 f') prime | false |
Steel.Preorder.fst | Steel.Preorder.induces_preorder | val induces_preorder : p: FStar.PCM.pcm a -> q: FStar.Preorder.preorder a -> Prims.logical | let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v) | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 49,
"end_line": 35,
"start_col": 0,
"start_line": 33
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | p: FStar.PCM.pcm a -> q: FStar.Preorder.preorder a -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"FStar.PCM.pcm",
"FStar.Preorder.preorder",
"Prims.l_Forall",
"FStar.PCM.frame_preserving_upd",
"Prims.l_imp",
"FStar.PCM.__proj__Mkpcm__item__refine",
"FStar.PCM.compatible",
"Prims.logical"
] | [] | false | false | false | true | true | let induces_preorder (#a: Type u#a) (p: pcm a) (q: preorder a) =
| forall (x: a) (y: a) (f: frame_preserving_upd p x y) (v: a).
p.refine v ==> compatible p x v ==> q v (f v) | false |
|
Steel.Preorder.fst | Steel.Preorder.preorder_of_pcm | val preorder_of_pcm (#a: Type u#a) (p: pcm a) : preorder a | val preorder_of_pcm (#a: Type u#a) (p: pcm a) : preorder a | let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 66,
"end_line": 43,
"start_col": 0,
"start_line": 42
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM. | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | p: FStar.PCM.pcm a -> FStar.Preorder.preorder a | Prims.Tot | [
"total"
] | [] | [
"FStar.PCM.pcm",
"Prims.l_Forall",
"FStar.Preorder.preorder",
"Prims.l_imp",
"Steel.Preorder.induces_preorder",
"Prims.logical"
] | [] | false | false | false | true | false | let preorder_of_pcm (#a: Type u#a) (p: pcm a) : preorder a =
| fun x y -> forall (q: preorder a). induces_preorder p q ==> q x y | false |
Vale.Wrapper.X64.Cpuid.fst | Vale.Wrapper.X64.Cpuid.check_avx512_xcr0 | val check_avx512_xcr0: unit -> Stack UInt64.t
(requires fun h0 -> osxsave_enabled /\ avx_xcr0)
(ensures fun h0 ret_val h1 ->
((UInt64.v ret_val) =!= 0 ==> avx512_xcr0) /\
B.modifies B.loc_none h0 h1) | val check_avx512_xcr0: unit -> Stack UInt64.t
(requires fun h0 -> osxsave_enabled /\ avx_xcr0)
(ensures fun h0 ret_val h1 ->
((UInt64.v ret_val) =!= 0 ==> avx512_xcr0) /\
B.modifies B.loc_none h0 h1) | let check_avx512_xcr0 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_avx512_xcr0 () in //This is a call to the interop wrapper
x | {
"file_name": "vale/code/arch/x64/interop/Vale.Wrapper.X64.Cpuid.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 51,
"start_col": 0,
"start_line": 49
} | module Vale.Wrapper.X64.Cpuid
open FStar.Mul
let check_aesni () =
let open Vale.X64.Decls in
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_aesni () in //This is a call to the interop wrapper
x
let check_sha () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_sha () in //This is a call to the interop wrapper
x
let check_adx_bmi2 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_adx_bmi2 () in //This is a call to the interop wrapper
x
let check_avx () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_avx () in //This is a call to the interop wrapper
x
let check_avx2 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_avx2 () in //This is a call to the interop wrapper
x
let check_movbe () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_movbe () in //This is a call to the interop wrapper
x
let check_sse () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_sse () in //This is a call to the interop wrapper
x
let check_rdrand () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_rdrand () in //This is a call to the interop wrapper
x
let check_avx512 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_avx512 () in //This is a call to the interop wrapper
x
let check_osxsave () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_osxsave () in //This is a call to the interop wrapper
x
let check_avx_xcr0 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_avx_xcr0 () in //This is a call to the interop wrapper
x | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Decls.fsti.checked",
"Vale.Stdcalls.X64.Cpuid.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": true,
"source_file": "Vale.Wrapper.X64.Cpuid.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Wrapper.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Wrapper.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit -> FStar.HyperStack.ST.Stack FStar.UInt64.t | FStar.HyperStack.ST.Stack | [] | [] | [
"Prims.unit",
"FStar.UInt64.t",
"FStar.Ghost.erased",
"Vale.Interop.X64.as_lowstar_sig_ret",
"Vale.Interop.X64.als_ret",
"Vale.Stdcalls.X64.Cpuid.check_avx512_xcr0"
] | [] | false | true | false | false | false | let check_avx512_xcr0 () =
| let x, _ = Vale.Stdcalls.X64.Cpuid.check_avx512_xcr0 () in
x | false |
Vale.Wrapper.X64.Cpuid.fst | Vale.Wrapper.X64.Cpuid.check_rdrand | val check_rdrand: unit -> Stack UInt64.t
(requires fun h0 -> True)
(ensures fun h0 ret_val h1 ->
((UInt64.v ret_val) =!= 0 ==> rdrand_enabled) /\
B.modifies B.loc_none h0 h1) | val check_rdrand: unit -> Stack UInt64.t
(requires fun h0 -> True)
(ensures fun h0 ret_val h1 ->
((UInt64.v ret_val) =!= 0 ==> rdrand_enabled) /\
B.modifies B.loc_none h0 h1) | let check_rdrand () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_rdrand () in //This is a call to the interop wrapper
x | {
"file_name": "vale/code/arch/x64/interop/Vale.Wrapper.X64.Cpuid.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 35,
"start_col": 0,
"start_line": 33
} | module Vale.Wrapper.X64.Cpuid
open FStar.Mul
let check_aesni () =
let open Vale.X64.Decls in
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_aesni () in //This is a call to the interop wrapper
x
let check_sha () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_sha () in //This is a call to the interop wrapper
x
let check_adx_bmi2 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_adx_bmi2 () in //This is a call to the interop wrapper
x
let check_avx () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_avx () in //This is a call to the interop wrapper
x
let check_avx2 () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_avx2 () in //This is a call to the interop wrapper
x
let check_movbe () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_movbe () in //This is a call to the interop wrapper
x
let check_sse () =
let (x, _) = Vale.Stdcalls.X64.Cpuid.check_sse () in //This is a call to the interop wrapper
x | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Decls.fsti.checked",
"Vale.Stdcalls.X64.Cpuid.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": true,
"source_file": "Vale.Wrapper.X64.Cpuid.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Wrapper.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Wrapper.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit -> FStar.HyperStack.ST.Stack FStar.UInt64.t | FStar.HyperStack.ST.Stack | [] | [] | [
"Prims.unit",
"FStar.UInt64.t",
"FStar.Ghost.erased",
"Vale.Interop.X64.as_lowstar_sig_ret",
"Vale.Interop.X64.als_ret",
"Vale.Stdcalls.X64.Cpuid.check_rdrand"
] | [] | false | true | false | false | false | let check_rdrand () =
| let x, _ = Vale.Stdcalls.X64.Cpuid.check_rdrand () in
x | false |
LowParse.Low.Tac.Sum.fst | LowParse.Low.Tac.Sum.sum_accessor_ext | val sum_accessor_ext (ty: term) : Tac unit | val sum_accessor_ext (ty: term) : Tac unit | let sum_accessor_ext (ty: term) : Tac unit =
let thm = mk_app (`clens_eq_intro') [(ty, Q_Implicit)] in
apply thm;
iseq [
(fun _ ->
norm [delta; zeta; iota; primops];
let x = intro () in
destruct (binder_to_term x);
to_all_goals (fun _ ->
let eqn = intros_until_eq_hyp () in
rewrite eqn;
norm [delta; zeta; iota; primops];
trivial ()
)
);
(fun _ ->
norm [delta; zeta; iota; primops];
let x = intro () in
destruct (binder_to_term x);
to_all_goals (fun _ ->
let eqn = intros_until_eq_hyp () in
rewrite eqn;
norm [delta; zeta; iota; primops];
let u = intro () in
smt ()
)
)
] | {
"file_name": "src/lowparse/LowParse.Low.Tac.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 7,
"end_line": 36,
"start_col": 0,
"start_line": 9
} | module LowParse.Low.Tac.Sum
include LowParse.Low.Sum
open LowParse.TacLib
(* Tactic for accessor extensionality *) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.TacLib.fst.checked",
"LowParse.Low.Sum.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Tac.Sum.fst"
} | [
{
"abbrev": false,
"full_module": "LowParse.TacLib",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Tac",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Tac",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | ty: FStar.Stubs.Reflection.Types.term -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Stubs.Reflection.Types.term",
"FStar.Tactics.V1.Derived.iseq",
"Prims.Cons",
"Prims.unit",
"LowParse.TacLib.to_all_goals",
"FStar.Tactics.V1.Derived.trivial",
"FStar.Stubs.Tactics.V1.Builtins.norm",
"FStar.Pervasives.norm_step",
"FStar.Pervasives.delta",
"FStar.Pervasives.zeta",
"FStar.Pervasives.iota",
"FStar.Pervasives.primops",
"Prims.Nil",
"FStar.Stubs.Tactics.V1.Builtins.rewrite",
"FStar.Stubs.Reflection.Types.binder",
"LowParse.TacLib.intros_until_eq_hyp",
"FStar.Tactics.V1.Derived.destruct",
"FStar.Tactics.V1.Derived.binder_to_term",
"FStar.Stubs.Tactics.V1.Builtins.intro",
"FStar.Tactics.V1.Derived.smt",
"FStar.Tactics.V1.Derived.apply",
"FStar.Reflection.V1.Derived.mk_app",
"FStar.Stubs.Reflection.V1.Data.argv",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Stubs.Reflection.V1.Data.aqualv",
"FStar.Stubs.Reflection.V1.Data.Q_Implicit"
] | [] | false | true | false | false | false | let sum_accessor_ext (ty: term) : Tac unit =
| let thm = mk_app (`clens_eq_intro') [(ty, Q_Implicit)] in
apply thm;
iseq [
(fun _ ->
norm [delta; zeta; iota; primops];
let x = intro () in
destruct (binder_to_term x);
to_all_goals (fun _ ->
let eqn = intros_until_eq_hyp () in
rewrite eqn;
norm [delta; zeta; iota; primops];
trivial ()));
(fun _ ->
norm [delta; zeta; iota; primops];
let x = intro () in
destruct (binder_to_term x);
to_all_goals (fun _ ->
let eqn = intros_until_eq_hyp () in
rewrite eqn;
norm [delta; zeta; iota; primops];
let u = intro () in
smt ()))
] | false |
Steel.Preorder.fst | Steel.Preorder.qhistory | val qhistory : q: FStar.Preorder.preorder a -> l: Prims.list a -> Prims.logical | let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl) | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 45,
"end_line": 89,
"start_col": 0,
"start_line": 85
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q] | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | q: FStar.Preorder.preorder a -> l: Prims.list a -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.preorder",
"Prims.list",
"Prims.l_True",
"Prims.l_and",
"Steel.Preorder.qhistory",
"Prims.Cons",
"Prims.logical"
] | [
"recursion"
] | false | false | false | true | true | let rec qhistory #a (q: preorder a) (l: list a) =
| match l with
| [] | [_] -> True
| x :: y :: tl -> y `q` x /\ qhistory q (y :: tl) | false |
|
Steel.Preorder.fst | Steel.Preorder.stable_compatiblity | val stable_compatiblity (#a: Type u#a) (fact: (a -> prop)) (p: pcm a) (v v0 v1: a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\ p.refine v0 /\ fact v0 /\ p.refine v1 /\
frame_preserving p v v1 /\ compatible p v v0) (ensures fact v1) | val stable_compatiblity (#a: Type u#a) (fact: (a -> prop)) (p: pcm a) (v v0 v1: a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\ p.refine v0 /\ fact v0 /\ p.refine v1 /\
frame_preserving p v v1 /\ compatible p v v0) (ensures fact v1) | let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0 | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 59,
"end_line": 74,
"start_col": 0,
"start_line": 62
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= () | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | fact: (_: a -> Prims.prop) -> p: FStar.PCM.pcm a -> v: a -> v0: a -> v1: a
-> FStar.Pervasives.Lemma
(requires
FStar.Preorder.stable fact (Steel.Preorder.preorder_of_pcm p) /\ Mkpcm?.refine p v0 /\
fact v0 /\ Mkpcm?.refine p v1 /\ FStar.PCM.frame_preserving p v v1 /\
FStar.PCM.compatible p v v0) (ensures fact v1) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.prop",
"FStar.PCM.pcm",
"Steel.Preorder.frame_preserving_upd_is_preorder_preserving",
"FStar.PCM.frame_preserving_upd",
"FStar.PCM.frame_preserving_val_to_fp_upd",
"FStar.Ghost.hide",
"Prims.unit",
"Prims.l_and",
"FStar.Preorder.stable",
"Steel.Preorder.preorder_of_pcm",
"FStar.PCM.__proj__Mkpcm__item__refine",
"FStar.PCM.frame_preserving",
"FStar.PCM.compatible",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | true | false | true | false | false | let stable_compatiblity (#a: Type u#a) (fact: (a -> prop)) (p: pcm a) (v v0 v1: a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\ p.refine v0 /\ fact v0 /\ p.refine v1 /\
frame_preserving p v v1 /\ compatible p v v0) (ensures fact v1) =
| let f:frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0 | false |
Steel.Preorder.fst | Steel.Preorder.extends | val extends (#a: Type u#a) (#q: preorder a) : preorder (hist q) | val extends (#a: Type u#a) (#q: preorder a) : preorder (hist q) | let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends' | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 73,
"end_line": 108,
"start_col": 0,
"start_line": 108
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | FStar.Preorder.preorder (Steel.Preorder.hist q) | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.extends'",
"Steel.Preorder.hist"
] | [] | false | false | false | false | false | let extends (#a: Type u#a) (#q: preorder a) : preorder (hist q) =
| extends' | false |
Steel.Preorder.fst | Steel.Preorder.extends' | val extends' : h0: Steel.Preorder.hist q -> h1: Steel.Preorder.hist q -> Prims.logical | let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1) | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 53,
"end_line": 96,
"start_col": 0,
"start_line": 95
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l} | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | h0: Steel.Preorder.hist q -> h1: Steel.Preorder.hist q -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.hist",
"Prims.l_or",
"Prims.eq2",
"Prims.l_and",
"Prims.b2t",
"Prims.uu___is_Cons",
"Steel.Preorder.extends'",
"Prims.__proj__Cons__item__tl",
"Prims.logical"
] | [
"recursion"
] | false | false | false | false | true | let rec extends' (#a: Type u#a) (#q: preorder a) (h0 h1: hist q) =
| h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1) | false |
|
Hacl.Spec.Curve25519.Field64.Lemmas.fst | Hacl.Spec.Curve25519.Field64.Lemmas.lemma_subtract_p4_1 | val lemma_subtract_p4_1: f:felem4 -> f':felem4 -> Lemma
(requires
(let (f0, f1, f2, f3) = f in
let (f0', f1', f2', f3') = f' in
(v f3 = 0x7fffffffffffffff && v f2 = 0xffffffffffffffff && v f1 = 0xffffffffffffffff && v f0 >= 0xffffffffffffffed) /\
(v f0' = v f0 - 0xffffffffffffffed && v f1' = v f1 - 0xffffffffffffffff && v f2' = v f2 - 0xffffffffffffffff &&
v f3' = v f3 - 0x7fffffffffffffff)))
(ensures as_nat4 f' == as_nat4 f % prime) | val lemma_subtract_p4_1: f:felem4 -> f':felem4 -> Lemma
(requires
(let (f0, f1, f2, f3) = f in
let (f0', f1', f2', f3') = f' in
(v f3 = 0x7fffffffffffffff && v f2 = 0xffffffffffffffff && v f1 = 0xffffffffffffffff && v f0 >= 0xffffffffffffffed) /\
(v f0' = v f0 - 0xffffffffffffffed && v f1' = v f1 - 0xffffffffffffffff && v f2' = v f2 - 0xffffffffffffffff &&
v f3' = v f3 - 0x7fffffffffffffff)))
(ensures as_nat4 f' == as_nat4 f % prime) | let lemma_subtract_p4_1 f f' =
let (f0, f1, f2, f3) = f in
let (f0', f1', f2', f3') = f' in
assert_norm (0x7fffffffffffffff = pow2 63 - 1);
assert_norm (0xffffffffffffffff = pow2 64 - 1);
assert_norm (0xffffffffffffffed = pow2 64 - 19);
assert (as_nat4 f' % prime ==
(v f0' + v f1' * pow2 64 + v f2' * pow2 64 * pow2 64 + v f3' * pow2 64 * pow2 64 * pow2 64) % prime);
assert (as_nat4 f' % prime ==
(v f0 - (pow2 64 - 19) + (v f1 - (pow2 64 - 1)) * pow2 64 + (v f2 - (pow2 64 - 1)) * pow2 64 * pow2 64 +
(v f3 - (pow2 63 - 1)) * pow2 64 * pow2 64 * pow2 64) % prime);
assert_norm (pow2 63 * pow2 64 * pow2 64 * pow2 64 = pow2 255);
assert (as_nat4 f' % prime ==
(v f0 + v f1 * pow2 64 + v f2 * pow2 64 * pow2 64 +
v f3 * pow2 64 * pow2 64 * pow2 64 - prime) % prime);
FStar.Math.Lemmas.lemma_mod_sub
(v f0 + v f1 * pow2 64 + v f2 * pow2 64 * pow2 64 + v f3 * pow2 64 * pow2 64 * pow2 64) 1 prime | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field64.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 99,
"end_line": 191,
"start_col": 0,
"start_line": 175
} | module Hacl.Spec.Curve25519.Field64.Lemmas
open FStar.Mul
open Lib.Sequence
open Lib.IntTypes
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field64.Definition
module BSeq = Lib.ByteSequence
module SD = Hacl.Spec.Bignum.Definitions
module SL = Hacl.Spec.Bignum.Lib
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val lemma_prime: unit -> Lemma (pow2 256 % prime == 38)
let lemma_prime () =
calc (==) {
pow2 256 % prime;
(==) { Math.Lemmas.pow2_plus 255 1 }
2 * pow2 255 % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r 2 (pow2 255) prime }
2 * (pow2 255 % prime) % prime;
(==) { Math.Lemmas.sub_div_mod_1 (pow2 255) prime }
2 * (19 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r 2 19 prime }
38 % prime;
(==) { Math.Lemmas.small_mod 38 prime }
38;
}
val lemma_prime19: unit -> Lemma (pow2 255 % prime == 19)
let lemma_prime19 () =
assert_norm (pow2 255 % prime = 19 % prime);
FStar.Math.Lemmas.small_mod 19 prime
val lemma_mul_pow256_add: fn:int -> c:int ->
Lemma ((fn + c * pow2 256) % prime == (fn + c * 38) % prime)
let lemma_mul_pow256_add fn c =
calc (==) {
(fn + c * pow2 256) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_r fn (c * pow2 256) prime }
(fn + c * pow2 256 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r c (pow2 256) prime }
(fn + c * (pow2 256 % prime) % prime) % prime;
(==) { lemma_prime () }
(fn + c * 38 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_r fn (c * 38) prime }
(fn + c * 38) % prime;
}
val lemma_mul_pow255_add: fn:int -> c:int ->
Lemma ((fn + c * pow2 255) % prime == (fn + c * 19) % prime)
let lemma_mul_pow255_add fn c =
calc (==) {
(fn + c * pow2 255) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_r fn (c * pow2 255) prime }
(fn + c * pow2 255 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r c (pow2 255) prime }
(fn + c * (pow2 255 % prime) % prime) % prime;
(==) { lemma_prime19 () }
(fn + c * 19 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_r fn (c * 19) prime }
(fn + c * 19) % prime;
}
val lemma_fsub4: fn1:nat -> fn2:nat -> c0:nat -> c1:nat ->
Lemma ((fn1 - fn2 + c0 * pow2 256 - c0 * 38 + c1 * pow2 256 - c1 * 38) % prime ==
(fn1 % prime - fn2 % prime) % prime)
let lemma_fsub4 fn1 fn2 c0 c1 =
calc (==) {
(fn1 - fn2 + c0 * pow2 256 - c0 * 38 + c1 * pow2 256 - c1 * 38) % prime;
(==) { lemma_mul_pow256_add (fn1 - fn2 + c0 * pow2 256 - c0 * 38 + c1 * pow2 256) (- c1) }
(fn1 - fn2 + c0 * pow2 256 - c0 * 38 + c1 * pow2 256 - c1 * pow2 256) % prime;
(==) { }
(fn1 - fn2 + c0 * pow2 256 - c0 * 38) % prime;
(==) { lemma_mul_pow256_add (fn1 - fn2 + c0 * pow2 256) (- c0) }
(fn1 - fn2 + c0 * pow2 256 - c0 * pow2 256) % prime;
(==) { }
(fn1 - fn2) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_l fn1 (- fn2) prime }
(fn1 % prime - fn2) % prime;
(==) { Math.Lemmas.lemma_mod_sub_distr (fn1 % prime) fn2 prime }
(fn1 % prime - fn2 % prime) % prime;
}
val lemma_mul_lt: a:nat -> b:nat -> c:pos -> d:pos -> Lemma
(requires a < c /\ b < d)
(ensures a * b < c * d)
let lemma_mul_lt a b c d = ()
val carry_wide_bound: a:nat -> b:nat -> c:nat -> d:nat -> Lemma
(requires
a + b * pow2 256 == c + d * 38 /\
a < pow2 256 /\ c < pow2 256 /\ d < pow2 256)
(ensures b * 38 < pow2 63)
let carry_wide_bound a b c d =
assert_norm (38 < pow2 7);
lemma_mul_lt d 38 (pow2 256) (pow2 7);
Math.Lemmas.pow2_plus 256 7;
assert (c + d * 38 < pow2 263);
Math.Lemmas.pow2_plus 7 7;
Math.Lemmas.pow2_lt_compat 63 14
val fmul14_bound: a:nat -> b:nat -> c:nat -> d:nat -> Lemma
(requires
a + b * pow2 256 == c * d /\
a < pow2 256 /\ c < pow2 256 /\ d < pow2 17)
(ensures b * 38 < pow2 63)
let fmul14_bound a b c d =
lemma_mul_lt c d (pow2 256) (pow2 17);
//Math.Lemmas.pow2_plus 256 17;
//assert (c * d < pow2 273);
assert (b < pow2 17);
assert_norm (38 < pow2 7);
Math.Lemmas.pow2_plus 17 7;
Math.Lemmas.pow2_lt_compat 63 24
val carry_pass_store_bound: f:nat -> top_bit:nat -> r0:nat -> r1:nat -> c:nat -> Lemma
(requires
top_bit == f / pow2 255 /\
r0 + top_bit * pow2 255 == f /\
r1 + c * pow2 256 == r0 + 19 * top_bit /\
r0 < pow2 256 /\ r1 < pow2 256 /\
f < pow2 256 /\ top_bit <= 1)
(ensures c = 0 /\ r0 < pow2 255)
let carry_pass_store_bound f top_bit r0 r1 c = ()
val lemma_subtract_p4_0: f:felem4 -> f':felem4 -> Lemma
(requires
(let (f0, f1, f2, f3) = f in
let (f0', f1', f2', f3') = f' in
v f3 < pow2 63 /\
(v f3 <> 0x7fffffffffffffff || v f2 <> 0xffffffffffffffff || v f1 <> 0xffffffffffffffff || v f0 < 0xffffffffffffffed) /\
(v f0' = v f0 && v f1' = v f1 && v f2' = v f2 && v f3' = v f3)))
(ensures as_nat4 f' == as_nat4 f % prime)
let lemma_subtract_p4_0 f f' =
let (f0, f1, f2, f3) = f in
let (f0', f1', f2', f3') = f' in
assert_norm (0x7fffffffffffffff = pow2 63 - 1);
assert_norm (0xffffffffffffffff = pow2 64 - 1);
assert_norm (0xffffffffffffffed = pow2 64 - 19);
assert (as_nat4 f == v f0 + v f1 * pow2 64 + v f2 * pow2 64 * pow2 64 + v f3 * pow2 64 * pow2 64 * pow2 64);
assert (as_nat4 f <= pow2 64 - 20 + (pow2 64 - 1) * pow2 64 + (pow2 64 - 1) * pow2 64 * pow2 64 +
(pow2 63 - 1) * pow2 64 * pow2 64 * pow2 64);
assert_norm (pow2 63 * pow2 64 * pow2 64 * pow2 64 = pow2 255);
assert (as_nat4 f < pow2 255 - 19);
assert (as_nat4 f == as_nat4 f');
FStar.Math.Lemmas.modulo_lemma (as_nat4 f') prime
val lemma_subtract_p4_1: f:felem4 -> f':felem4 -> Lemma
(requires
(let (f0, f1, f2, f3) = f in
let (f0', f1', f2', f3') = f' in
(v f3 = 0x7fffffffffffffff && v f2 = 0xffffffffffffffff && v f1 = 0xffffffffffffffff && v f0 >= 0xffffffffffffffed) /\
(v f0' = v f0 - 0xffffffffffffffed && v f1' = v f1 - 0xffffffffffffffff && v f2' = v f2 - 0xffffffffffffffff &&
v f3' = v f3 - 0x7fffffffffffffff)))
(ensures as_nat4 f' == as_nat4 f % prime) | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Hacl.Spec.Curve25519.Field64.Definition.fst.checked",
"Hacl.Spec.Bignum.Lib.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"Hacl.Spec.Bignum.Convert.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Spec.Curve25519.Field64.Lemmas.fst"
} | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Lib",
"short_module": "SL"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "SD"
},
{
"abbrev": true,
"full_module": "Lib.ByteSequence",
"short_module": "BSeq"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field64.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
f: Hacl.Spec.Curve25519.Field64.Definition.felem4 ->
f': Hacl.Spec.Curve25519.Field64.Definition.felem4
-> FStar.Pervasives.Lemma
(requires
(let _ = f in
(let FStar.Pervasives.Native.Mktuple4 #_ #_ #_ #_ f0 f1 f2 f3 = _ in
let _ = f' in
(let FStar.Pervasives.Native.Mktuple4 #_ #_ #_ #_ f0' f1' f2' f3' = _ in
Lib.IntTypes.v f3 = 0x7fffffffffffffff && Lib.IntTypes.v f2 = 0xffffffffffffffff &&
Lib.IntTypes.v f1 = 0xffffffffffffffff &&
Lib.IntTypes.v f0 >= 0xffffffffffffffed /\
Lib.IntTypes.v f0' = Lib.IntTypes.v f0 - 0xffffffffffffffed &&
Lib.IntTypes.v f1' = Lib.IntTypes.v f1 - 0xffffffffffffffff &&
Lib.IntTypes.v f2' = Lib.IntTypes.v f2 - 0xffffffffffffffff &&
Lib.IntTypes.v f3' = Lib.IntTypes.v f3 - 0x7fffffffffffffff)
<:
Type0)
<:
Type0))
(ensures
Hacl.Spec.Curve25519.Field64.Definition.as_nat4 f' ==
Hacl.Spec.Curve25519.Field64.Definition.as_nat4 f % Spec.Curve25519.prime) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Curve25519.Field64.Definition.felem4",
"Lib.IntTypes.uint64",
"FStar.Math.Lemmas.lemma_mod_sub",
"Prims.op_Addition",
"Lib.IntTypes.v",
"Lib.IntTypes.U64",
"Lib.IntTypes.SEC",
"FStar.Mul.op_Star",
"Prims.pow2",
"Spec.Curve25519.prime",
"Prims.unit",
"Prims._assert",
"Prims.eq2",
"Prims.int",
"Prims.op_Modulus",
"Hacl.Spec.Curve25519.Field64.Definition.as_nat4",
"Prims.op_Subtraction",
"FStar.Pervasives.assert_norm",
"Prims.b2t",
"Prims.op_Equality"
] | [] | false | false | true | false | false | let lemma_subtract_p4_1 f f' =
| let f0, f1, f2, f3 = f in
let f0', f1', f2', f3' = f' in
assert_norm (0x7fffffffffffffff = pow2 63 - 1);
assert_norm (0xffffffffffffffff = pow2 64 - 1);
assert_norm (0xffffffffffffffed = pow2 64 - 19);
assert (as_nat4 f' % prime ==
(v f0' + v f1' * pow2 64 + (v f2' * pow2 64) * pow2 64 + ((v f3' * pow2 64) * pow2 64) * pow2 64
) %
prime);
assert (as_nat4 f' % prime ==
(v f0 - (pow2 64 - 19) + (v f1 - (pow2 64 - 1)) * pow2 64 +
((v f2 - (pow2 64 - 1)) * pow2 64) * pow2 64 +
(((v f3 - (pow2 63 - 1)) * pow2 64) * pow2 64) * pow2 64) %
prime);
assert_norm (((pow2 63 * pow2 64) * pow2 64) * pow2 64 = pow2 255);
assert (as_nat4 f' % prime ==
(v f0 + v f1 * pow2 64 + (v f2 * pow2 64) * pow2 64 + ((v f3 * pow2 64) * pow2 64) * pow2 64 -
prime) %
prime);
FStar.Math.Lemmas.lemma_mod_sub (v f0 + v f1 * pow2 64 + (v f2 * pow2 64) * pow2 64 +
((v f3 * pow2 64) * pow2 64) * pow2 64)
1
prime | false |
Steel.Preorder.fst | Steel.Preorder.extends_trans | val extends_trans (#a: _) (#q: preorder a) (x y z: hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y); SMTPat (y `extends'` z)] | val extends_trans (#a: _) (#q: preorder a) (x y z: hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y); SMTPat (y `extends'` z)] | let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 35,
"end_line": 105,
"start_col": 0,
"start_line": 99
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1) | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | x: Steel.Preorder.hist q -> y: Steel.Preorder.hist q -> z: Steel.Preorder.hist q
-> FStar.Pervasives.Lemma
(ensures
Steel.Preorder.extends' x y /\ Steel.Preorder.extends' y z ==> Steel.Preorder.extends' x z)
[SMTPat (Steel.Preorder.extends' x y); SMTPat (Steel.Preorder.extends' y z)] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.hist",
"Prims.list",
"Steel.Preorder.extends_trans",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_imp",
"Prims.l_and",
"Steel.Preorder.extends'",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"Prims.logical",
"Prims.Nil"
] | [
"recursion"
] | false | false | true | false | false | let rec extends_trans #a (#q: preorder a) (x: hist q) (y: hist q) (z: hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y); SMTPat (y `extends'` z)] =
| match x with
| [] -> ()
| _ :: tl -> extends_trans tl y z | false |
Steel.Preorder.fst | Steel.Preorder.vhist | val vhist : q: FStar.Preorder.preorder a -> Type | let vhist (#a: Type u#a) (q:preorder a) = h:hist q{Cons? h} | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 59,
"end_line": 215,
"start_col": 0,
"start_line": 215
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x
(** If [z] extends [x] and [y], then [x] and [y] are extending one or another *)
let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl
(** If [x] extends [y], then the two heads of the traces are still related by the preorder *)
let rec extends_related_head (#a: Type u#a) (#q:preorder a) (x y:hist q)
: Lemma
(ensures
x `extends` y /\
Cons? x /\
Cons? y ==> Cons?.hd y `q` Cons?.hd x)
[SMTPat (x `extends` y)]
= match x with
| [] -> ()
| _::tl -> extends_related_head tl y
(** Finally, we can have our fully-fledged PCM from the preorder *)
let pcm_of_preorder (#a: Type u#a) (q:preorder a) : pcm (hist q) = {
p = p q;
comm = comm_op q;
assoc = (fun _ _ _ -> ());
assoc_r = (fun _ _ _ -> ());
is_unit = (fun _ -> ());
refine = (fun _ -> True)
}
(***** Using the preorder *)
(**
We check that the preorder derived from the PCM derived from the preorder
satisfies the same properties as the original preorder. Here, we get back history
extension from frame-preserving updates.
*)
let frame_preserving_q_aux (#a : Type u#a) (q:preorder a) (x y:hist q) (z:hist q)
: Lemma (requires (frame_preserving (pcm_of_preorder q) x y /\ compatible (pcm_of_preorder q) x z))
(ensures (y `extends` z))
= () | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | q: FStar.Preorder.preorder a -> Type | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.hist",
"Prims.b2t",
"Prims.uu___is_Cons"
] | [] | false | false | false | true | true | let vhist (#a: Type u#a) (q: preorder a) =
| h: hist q {Cons? h} | false |
|
Steel.Preorder.fst | Steel.Preorder.extends_length_eq | val extends_length_eq (#a: Type u#a) (#q: preorder a) (h0 h1: hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)] | val extends_length_eq (#a: Type u#a) (#q: preorder a) (h0 h1: hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)] | let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1 | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 39,
"end_line": 118,
"start_col": 0,
"start_line": 113
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | h0: Steel.Preorder.hist q -> h1: Steel.Preorder.hist q
-> FStar.Pervasives.Lemma
(ensures
Steel.Preorder.extends h0 h1 ==>
h0 == h1 \/ FStar.List.Tot.Base.length h0 > FStar.List.Tot.Base.length h1)
[SMTPat (Steel.Preorder.extends h0 h1)] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.hist",
"Prims.list",
"Steel.Preorder.extends_length_eq",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_imp",
"Steel.Preorder.extends",
"Prims.l_or",
"Prims.eq2",
"Prims.b2t",
"Prims.op_GreaterThan",
"FStar.List.Tot.Base.length",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"Prims.Nil"
] | [
"recursion"
] | false | false | true | false | false | let rec extends_length_eq (#a: Type u#a) (#q: preorder a) (h0 h1: hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)] =
| match h0 with
| [] -> ()
| hd :: tl -> extends_length_eq tl h1 | false |
Steel.Preorder.fst | Steel.Preorder.p_composable | val p_composable (#a: Type u#a) (q: preorder a) : symrel (hist q) | val p_composable (#a: Type u#a) (q: preorder a) : symrel (hist q) | let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 41,
"end_line": 125,
"start_col": 0,
"start_line": 124
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | q: FStar.Preorder.preorder a -> FStar.PCM.symrel (Steel.Preorder.hist q) | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.hist",
"Prims.l_or",
"Steel.Preorder.extends",
"Prims.prop",
"FStar.PCM.symrel"
] | [] | false | false | false | false | false | let p_composable (#a: Type u#a) (q: preorder a) : symrel (hist q) =
| fun x y -> extends x y \/ extends y x | false |
Hacl.Spec.Curve25519.Field64.Lemmas.fst | Hacl.Spec.Curve25519.Field64.Lemmas.lemma_subtract_p | val lemma_subtract_p: f:felem4 -> f':felem4 -> Lemma
(requires
(let (f0, f1, f2, f3) = f in
let (f0', f1', f2', f3') = f' in
v f3 < pow2 63 /\
(((v f3 <> 0x7fffffffffffffff || v f2 <> 0xffffffffffffffff || v f1 <> 0xffffffffffffffff || v f0 < 0xffffffffffffffed) /\
(v f0' = v f0 && v f1' = v f1 && v f2' = v f2 && v f3' = v f3)) \/
((v f3 = 0x7fffffffffffffff && v f2 = 0xffffffffffffffff && v f1 = 0xffffffffffffffff && v f0 >= 0xffffffffffffffed) /\
(v f0' = v f0 - 0xffffffffffffffed && v f1' = v f1 - 0xffffffffffffffff && v f2' = v f2 - 0xffffffffffffffff &&
v f3' = v f3 - 0x7fffffffffffffff)))))
(ensures as_nat4 f' == as_nat4 f % prime) | val lemma_subtract_p: f:felem4 -> f':felem4 -> Lemma
(requires
(let (f0, f1, f2, f3) = f in
let (f0', f1', f2', f3') = f' in
v f3 < pow2 63 /\
(((v f3 <> 0x7fffffffffffffff || v f2 <> 0xffffffffffffffff || v f1 <> 0xffffffffffffffff || v f0 < 0xffffffffffffffed) /\
(v f0' = v f0 && v f1' = v f1 && v f2' = v f2 && v f3' = v f3)) \/
((v f3 = 0x7fffffffffffffff && v f2 = 0xffffffffffffffff && v f1 = 0xffffffffffffffff && v f0 >= 0xffffffffffffffed) /\
(v f0' = v f0 - 0xffffffffffffffed && v f1' = v f1 - 0xffffffffffffffff && v f2' = v f2 - 0xffffffffffffffff &&
v f3' = v f3 - 0x7fffffffffffffff)))))
(ensures as_nat4 f' == as_nat4 f % prime) | let lemma_subtract_p f f' =
let (f0, f1, f2, f3) = f in
let (f0', f1', f2', f3') = f' in
if ((v f3 <> 0x7fffffffffffffff || v f2 <> 0xffffffffffffffff || v f1 <> 0xffffffffffffffff || v f0 < 0xffffffffffffffed) &&
(v f0' = v f0 && v f1' = v f1 && v f2' = v f2 && v f3' = v f3))
then lemma_subtract_p4_0 f f'
else lemma_subtract_p4_1 f f' | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field64.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 31,
"end_line": 212,
"start_col": 0,
"start_line": 206
} | module Hacl.Spec.Curve25519.Field64.Lemmas
open FStar.Mul
open Lib.Sequence
open Lib.IntTypes
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field64.Definition
module BSeq = Lib.ByteSequence
module SD = Hacl.Spec.Bignum.Definitions
module SL = Hacl.Spec.Bignum.Lib
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val lemma_prime: unit -> Lemma (pow2 256 % prime == 38)
let lemma_prime () =
calc (==) {
pow2 256 % prime;
(==) { Math.Lemmas.pow2_plus 255 1 }
2 * pow2 255 % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r 2 (pow2 255) prime }
2 * (pow2 255 % prime) % prime;
(==) { Math.Lemmas.sub_div_mod_1 (pow2 255) prime }
2 * (19 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r 2 19 prime }
38 % prime;
(==) { Math.Lemmas.small_mod 38 prime }
38;
}
val lemma_prime19: unit -> Lemma (pow2 255 % prime == 19)
let lemma_prime19 () =
assert_norm (pow2 255 % prime = 19 % prime);
FStar.Math.Lemmas.small_mod 19 prime
val lemma_mul_pow256_add: fn:int -> c:int ->
Lemma ((fn + c * pow2 256) % prime == (fn + c * 38) % prime)
let lemma_mul_pow256_add fn c =
calc (==) {
(fn + c * pow2 256) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_r fn (c * pow2 256) prime }
(fn + c * pow2 256 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r c (pow2 256) prime }
(fn + c * (pow2 256 % prime) % prime) % prime;
(==) { lemma_prime () }
(fn + c * 38 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_r fn (c * 38) prime }
(fn + c * 38) % prime;
}
val lemma_mul_pow255_add: fn:int -> c:int ->
Lemma ((fn + c * pow2 255) % prime == (fn + c * 19) % prime)
let lemma_mul_pow255_add fn c =
calc (==) {
(fn + c * pow2 255) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_r fn (c * pow2 255) prime }
(fn + c * pow2 255 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r c (pow2 255) prime }
(fn + c * (pow2 255 % prime) % prime) % prime;
(==) { lemma_prime19 () }
(fn + c * 19 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_r fn (c * 19) prime }
(fn + c * 19) % prime;
}
val lemma_fsub4: fn1:nat -> fn2:nat -> c0:nat -> c1:nat ->
Lemma ((fn1 - fn2 + c0 * pow2 256 - c0 * 38 + c1 * pow2 256 - c1 * 38) % prime ==
(fn1 % prime - fn2 % prime) % prime)
let lemma_fsub4 fn1 fn2 c0 c1 =
calc (==) {
(fn1 - fn2 + c0 * pow2 256 - c0 * 38 + c1 * pow2 256 - c1 * 38) % prime;
(==) { lemma_mul_pow256_add (fn1 - fn2 + c0 * pow2 256 - c0 * 38 + c1 * pow2 256) (- c1) }
(fn1 - fn2 + c0 * pow2 256 - c0 * 38 + c1 * pow2 256 - c1 * pow2 256) % prime;
(==) { }
(fn1 - fn2 + c0 * pow2 256 - c0 * 38) % prime;
(==) { lemma_mul_pow256_add (fn1 - fn2 + c0 * pow2 256) (- c0) }
(fn1 - fn2 + c0 * pow2 256 - c0 * pow2 256) % prime;
(==) { }
(fn1 - fn2) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_l fn1 (- fn2) prime }
(fn1 % prime - fn2) % prime;
(==) { Math.Lemmas.lemma_mod_sub_distr (fn1 % prime) fn2 prime }
(fn1 % prime - fn2 % prime) % prime;
}
val lemma_mul_lt: a:nat -> b:nat -> c:pos -> d:pos -> Lemma
(requires a < c /\ b < d)
(ensures a * b < c * d)
let lemma_mul_lt a b c d = ()
val carry_wide_bound: a:nat -> b:nat -> c:nat -> d:nat -> Lemma
(requires
a + b * pow2 256 == c + d * 38 /\
a < pow2 256 /\ c < pow2 256 /\ d < pow2 256)
(ensures b * 38 < pow2 63)
let carry_wide_bound a b c d =
assert_norm (38 < pow2 7);
lemma_mul_lt d 38 (pow2 256) (pow2 7);
Math.Lemmas.pow2_plus 256 7;
assert (c + d * 38 < pow2 263);
Math.Lemmas.pow2_plus 7 7;
Math.Lemmas.pow2_lt_compat 63 14
val fmul14_bound: a:nat -> b:nat -> c:nat -> d:nat -> Lemma
(requires
a + b * pow2 256 == c * d /\
a < pow2 256 /\ c < pow2 256 /\ d < pow2 17)
(ensures b * 38 < pow2 63)
let fmul14_bound a b c d =
lemma_mul_lt c d (pow2 256) (pow2 17);
//Math.Lemmas.pow2_plus 256 17;
//assert (c * d < pow2 273);
assert (b < pow2 17);
assert_norm (38 < pow2 7);
Math.Lemmas.pow2_plus 17 7;
Math.Lemmas.pow2_lt_compat 63 24
val carry_pass_store_bound: f:nat -> top_bit:nat -> r0:nat -> r1:nat -> c:nat -> Lemma
(requires
top_bit == f / pow2 255 /\
r0 + top_bit * pow2 255 == f /\
r1 + c * pow2 256 == r0 + 19 * top_bit /\
r0 < pow2 256 /\ r1 < pow2 256 /\
f < pow2 256 /\ top_bit <= 1)
(ensures c = 0 /\ r0 < pow2 255)
let carry_pass_store_bound f top_bit r0 r1 c = ()
val lemma_subtract_p4_0: f:felem4 -> f':felem4 -> Lemma
(requires
(let (f0, f1, f2, f3) = f in
let (f0', f1', f2', f3') = f' in
v f3 < pow2 63 /\
(v f3 <> 0x7fffffffffffffff || v f2 <> 0xffffffffffffffff || v f1 <> 0xffffffffffffffff || v f0 < 0xffffffffffffffed) /\
(v f0' = v f0 && v f1' = v f1 && v f2' = v f2 && v f3' = v f3)))
(ensures as_nat4 f' == as_nat4 f % prime)
let lemma_subtract_p4_0 f f' =
let (f0, f1, f2, f3) = f in
let (f0', f1', f2', f3') = f' in
assert_norm (0x7fffffffffffffff = pow2 63 - 1);
assert_norm (0xffffffffffffffff = pow2 64 - 1);
assert_norm (0xffffffffffffffed = pow2 64 - 19);
assert (as_nat4 f == v f0 + v f1 * pow2 64 + v f2 * pow2 64 * pow2 64 + v f3 * pow2 64 * pow2 64 * pow2 64);
assert (as_nat4 f <= pow2 64 - 20 + (pow2 64 - 1) * pow2 64 + (pow2 64 - 1) * pow2 64 * pow2 64 +
(pow2 63 - 1) * pow2 64 * pow2 64 * pow2 64);
assert_norm (pow2 63 * pow2 64 * pow2 64 * pow2 64 = pow2 255);
assert (as_nat4 f < pow2 255 - 19);
assert (as_nat4 f == as_nat4 f');
FStar.Math.Lemmas.modulo_lemma (as_nat4 f') prime
val lemma_subtract_p4_1: f:felem4 -> f':felem4 -> Lemma
(requires
(let (f0, f1, f2, f3) = f in
let (f0', f1', f2', f3') = f' in
(v f3 = 0x7fffffffffffffff && v f2 = 0xffffffffffffffff && v f1 = 0xffffffffffffffff && v f0 >= 0xffffffffffffffed) /\
(v f0' = v f0 - 0xffffffffffffffed && v f1' = v f1 - 0xffffffffffffffff && v f2' = v f2 - 0xffffffffffffffff &&
v f3' = v f3 - 0x7fffffffffffffff)))
(ensures as_nat4 f' == as_nat4 f % prime)
let lemma_subtract_p4_1 f f' =
let (f0, f1, f2, f3) = f in
let (f0', f1', f2', f3') = f' in
assert_norm (0x7fffffffffffffff = pow2 63 - 1);
assert_norm (0xffffffffffffffff = pow2 64 - 1);
assert_norm (0xffffffffffffffed = pow2 64 - 19);
assert (as_nat4 f' % prime ==
(v f0' + v f1' * pow2 64 + v f2' * pow2 64 * pow2 64 + v f3' * pow2 64 * pow2 64 * pow2 64) % prime);
assert (as_nat4 f' % prime ==
(v f0 - (pow2 64 - 19) + (v f1 - (pow2 64 - 1)) * pow2 64 + (v f2 - (pow2 64 - 1)) * pow2 64 * pow2 64 +
(v f3 - (pow2 63 - 1)) * pow2 64 * pow2 64 * pow2 64) % prime);
assert_norm (pow2 63 * pow2 64 * pow2 64 * pow2 64 = pow2 255);
assert (as_nat4 f' % prime ==
(v f0 + v f1 * pow2 64 + v f2 * pow2 64 * pow2 64 +
v f3 * pow2 64 * pow2 64 * pow2 64 - prime) % prime);
FStar.Math.Lemmas.lemma_mod_sub
(v f0 + v f1 * pow2 64 + v f2 * pow2 64 * pow2 64 + v f3 * pow2 64 * pow2 64 * pow2 64) 1 prime
val lemma_subtract_p: f:felem4 -> f':felem4 -> Lemma
(requires
(let (f0, f1, f2, f3) = f in
let (f0', f1', f2', f3') = f' in
v f3 < pow2 63 /\
(((v f3 <> 0x7fffffffffffffff || v f2 <> 0xffffffffffffffff || v f1 <> 0xffffffffffffffff || v f0 < 0xffffffffffffffed) /\
(v f0' = v f0 && v f1' = v f1 && v f2' = v f2 && v f3' = v f3)) \/
((v f3 = 0x7fffffffffffffff && v f2 = 0xffffffffffffffff && v f1 = 0xffffffffffffffff && v f0 >= 0xffffffffffffffed) /\
(v f0' = v f0 - 0xffffffffffffffed && v f1' = v f1 - 0xffffffffffffffff && v f2' = v f2 - 0xffffffffffffffff &&
v f3' = v f3 - 0x7fffffffffffffff)))))
(ensures as_nat4 f' == as_nat4 f % prime) | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Hacl.Spec.Curve25519.Field64.Definition.fst.checked",
"Hacl.Spec.Bignum.Lib.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"Hacl.Spec.Bignum.Convert.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Spec.Curve25519.Field64.Lemmas.fst"
} | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Lib",
"short_module": "SL"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "SD"
},
{
"abbrev": true,
"full_module": "Lib.ByteSequence",
"short_module": "BSeq"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field64.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
f: Hacl.Spec.Curve25519.Field64.Definition.felem4 ->
f': Hacl.Spec.Curve25519.Field64.Definition.felem4
-> FStar.Pervasives.Lemma
(requires
(let _ = f in
(let FStar.Pervasives.Native.Mktuple4 #_ #_ #_ #_ f0 f1 f2 f3 = _ in
let _ = f' in
(let FStar.Pervasives.Native.Mktuple4 #_ #_ #_ #_ f0' f1' f2' f3' = _ in
Lib.IntTypes.v f3 < Prims.pow2 63 /\
(Lib.IntTypes.v f3 <> 0x7fffffffffffffff || Lib.IntTypes.v f2 <> 0xffffffffffffffff ||
Lib.IntTypes.v f1 <> 0xffffffffffffffff ||
Lib.IntTypes.v f0 < 0xffffffffffffffed /\
Lib.IntTypes.v f0' = Lib.IntTypes.v f0 && Lib.IntTypes.v f1' = Lib.IntTypes.v f1 &&
Lib.IntTypes.v f2' = Lib.IntTypes.v f2 &&
Lib.IntTypes.v f3' = Lib.IntTypes.v f3 \/
Lib.IntTypes.v f3 = 0x7fffffffffffffff && Lib.IntTypes.v f2 = 0xffffffffffffffff &&
Lib.IntTypes.v f1 = 0xffffffffffffffff &&
Lib.IntTypes.v f0 >= 0xffffffffffffffed /\
Lib.IntTypes.v f0' = Lib.IntTypes.v f0 - 0xffffffffffffffed &&
Lib.IntTypes.v f1' = Lib.IntTypes.v f1 - 0xffffffffffffffff &&
Lib.IntTypes.v f2' = Lib.IntTypes.v f2 - 0xffffffffffffffff &&
Lib.IntTypes.v f3' = Lib.IntTypes.v f3 - 0x7fffffffffffffff))
<:
Type0)
<:
Type0))
(ensures
Hacl.Spec.Curve25519.Field64.Definition.as_nat4 f' ==
Hacl.Spec.Curve25519.Field64.Definition.as_nat4 f % Spec.Curve25519.prime) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Curve25519.Field64.Definition.felem4",
"Lib.IntTypes.uint64",
"Prims.op_AmpAmp",
"Prims.op_BarBar",
"Prims.op_disEquality",
"Prims.int",
"Lib.IntTypes.v",
"Lib.IntTypes.U64",
"Lib.IntTypes.SEC",
"Prims.op_LessThan",
"Prims.op_Equality",
"Lib.IntTypes.range_t",
"Hacl.Spec.Curve25519.Field64.Lemmas.lemma_subtract_p4_0",
"Prims.bool",
"Hacl.Spec.Curve25519.Field64.Lemmas.lemma_subtract_p4_1",
"Prims.unit"
] | [] | false | false | true | false | false | let lemma_subtract_p f f' =
| let f0, f1, f2, f3 = f in
let f0', f1', f2', f3' = f' in
if
((v f3 <> 0x7fffffffffffffff || v f2 <> 0xffffffffffffffff || v f1 <> 0xffffffffffffffff ||
v f0 < 0xffffffffffffffed) &&
(v f0' = v f0 && v f1' = v f1 && v f2' = v f2 && v f3' = v f3))
then lemma_subtract_p4_0 f f'
else lemma_subtract_p4_1 f f' | false |
Steel.Preorder.fst | Steel.Preorder.p_op | val p_op (#a: Type u#a) (q: preorder a) (x: hist q) (y: hist q {p_composable q x y}) : hist q | val p_op (#a: Type u#a) (q: preorder a) (x: hist q) (y: hist q {p_composable q x y}) : hist q | let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 8,
"end_line": 133,
"start_col": 0,
"start_line": 128
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
q: FStar.Preorder.preorder a ->
x: Steel.Preorder.hist q ->
y: Steel.Preorder.hist q {Steel.Preorder.p_composable q x y}
-> Steel.Preorder.hist q | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.hist",
"Steel.Preorder.p_composable",
"Prims.op_GreaterThanOrEqual",
"FStar.List.Tot.Base.length",
"Prims.bool",
"Prims.op_Equality",
"Prims.nat",
"Prims.unit",
"Prims._assert",
"Prims.eq2"
] | [] | false | false | false | false | false | let p_op (#a: Type u#a) (q: preorder a) (x: hist q) (y: hist q {p_composable q x y}) : hist q =
| if L.length x >= L.length y
then x
else
if L.length x = L.length y
then
(assert (x == y);
x)
else y | false |
Steel.Preorder.fst | Steel.Preorder.p_op_nil | val p_op_nil (#a: Type u#a) (q: preorder a) (x: hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x)) [SMTPat (p_composable q x [])] | val p_op_nil (#a: Type u#a) (q: preorder a) (x: hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x)) [SMTPat (p_composable q x [])] | let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 28,
"end_line": 150,
"start_col": 0,
"start_line": 145
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | q: FStar.Preorder.preorder a -> x: Steel.Preorder.hist q
-> FStar.Pervasives.Lemma
(ensures Steel.Preorder.p_composable q x [] /\ Steel.Preorder.p_op q x [] == x)
[SMTPat (Steel.Preorder.p_composable q x [])] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.hist",
"Prims.list",
"Steel.Preorder.p_op_nil",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_and",
"Steel.Preorder.p_composable",
"Prims.Nil",
"Prims.eq2",
"Steel.Preorder.p_op",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"Prims.prop"
] | [
"recursion"
] | false | false | true | false | false | let rec p_op_nil (#a: Type u#a) (q: preorder a) (x: hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x)) [SMTPat (p_composable q x [])] =
| match x with
| [] -> ()
| _ :: tl -> p_op_nil q tl | false |
Steel.Preorder.fst | Steel.Preorder.p_op_extends | val p_op_extends (#a: Type u#a) (q: preorder a) (x: hist q) (y: hist q {p_composable q x y})
: Lemma
(ensures
((p_op q x y) `extends` x /\ (p_op q x y) `extends` y /\
(p_op q x y == x \/ p_op q x y == y))) [SMTPat (p_op q x y)] | val p_op_extends (#a: Type u#a) (q: preorder a) (x: hist q) (y: hist q {p_composable q x y})
: Lemma
(ensures
((p_op q x y) `extends` x /\ (p_op q x y) `extends` y /\
(p_op q x y == x \/ p_op q x y == y))) [SMTPat (p_op q x y)] | let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 25,
"end_line": 142,
"start_col": 0,
"start_line": 136
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
q: FStar.Preorder.preorder a ->
x: Steel.Preorder.hist q ->
y: Steel.Preorder.hist q {Steel.Preorder.p_composable q x y}
-> FStar.Pervasives.Lemma
(ensures
Steel.Preorder.extends (Steel.Preorder.p_op q x y) x /\
Steel.Preorder.extends (Steel.Preorder.p_op q x y) y /\
(Steel.Preorder.p_op q x y == x \/ Steel.Preorder.p_op q x y == y))
[SMTPat (Steel.Preorder.p_op q x y)] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.hist",
"Steel.Preorder.p_composable",
"Steel.Preorder.extends_length_eq",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_and",
"Steel.Preorder.extends",
"Steel.Preorder.p_op",
"Prims.l_or",
"Prims.eq2",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"Prims.Nil"
] | [] | true | false | true | false | false | let p_op_extends (#a: Type u#a) (q: preorder a) (x: hist q) (y: hist q {p_composable q x y})
: Lemma
(ensures
((p_op q x y) `extends` x /\ (p_op q x y) `extends` y /\
(p_op q x y == x \/ p_op q x y == y))) [SMTPat (p_op q x y)] =
| extends_length_eq x y;
extends_length_eq y x | false |
Steel.Preorder.fst | Steel.Preorder.comm_op | val comm_op (#a: Type u#a) (q: preorder a) (x: hist q) (y: hist q {p_composable q x y})
: Lemma (p_op q x y == p_op q y x) | val comm_op (#a: Type u#a) (q: preorder a) (x: hist q) (y: hist q {p_composable q x y})
: Lemma (p_op q x y == p_op q y x) | let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 25,
"end_line": 169,
"start_col": 0,
"start_line": 166
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= () | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
q: FStar.Preorder.preorder a ->
x: Steel.Preorder.hist q ->
y: Steel.Preorder.hist q {Steel.Preorder.p_composable q x y}
-> FStar.Pervasives.Lemma (ensures Steel.Preorder.p_op q x y == Steel.Preorder.p_op q y x) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.hist",
"Steel.Preorder.p_composable",
"Steel.Preorder.extends_length_eq",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"Steel.Preorder.p_op",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | true | false | true | false | false | let comm_op (#a: Type u#a) (q: preorder a) (x: hist q) (y: hist q {p_composable q x y})
: Lemma (p_op q x y == p_op q y x) =
| extends_length_eq x y;
extends_length_eq y x | false |
Steel.Preorder.fst | Steel.Preorder.curval | val curval : v: Steel.Preorder.vhist q -> a | let curval (#a: Type u#a) (#q:preorder a) (v:vhist q) = Cons?.hd v | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 66,
"end_line": 218,
"start_col": 0,
"start_line": 218
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x
(** If [z] extends [x] and [y], then [x] and [y] are extending one or another *)
let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl
(** If [x] extends [y], then the two heads of the traces are still related by the preorder *)
let rec extends_related_head (#a: Type u#a) (#q:preorder a) (x y:hist q)
: Lemma
(ensures
x `extends` y /\
Cons? x /\
Cons? y ==> Cons?.hd y `q` Cons?.hd x)
[SMTPat (x `extends` y)]
= match x with
| [] -> ()
| _::tl -> extends_related_head tl y
(** Finally, we can have our fully-fledged PCM from the preorder *)
let pcm_of_preorder (#a: Type u#a) (q:preorder a) : pcm (hist q) = {
p = p q;
comm = comm_op q;
assoc = (fun _ _ _ -> ());
assoc_r = (fun _ _ _ -> ());
is_unit = (fun _ -> ());
refine = (fun _ -> True)
}
(***** Using the preorder *)
(**
We check that the preorder derived from the PCM derived from the preorder
satisfies the same properties as the original preorder. Here, we get back history
extension from frame-preserving updates.
*)
let frame_preserving_q_aux (#a : Type u#a) (q:preorder a) (x y:hist q) (z:hist q)
: Lemma (requires (frame_preserving (pcm_of_preorder q) x y /\ compatible (pcm_of_preorder q) x z))
(ensures (y `extends` z))
= ()
(** A non-empty history *)
let vhist (#a: Type u#a) (q:preorder a) = h:hist q{Cons? h} | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | v: Steel.Preorder.vhist q -> a | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.vhist",
"Prims.__proj__Cons__item__hd"
] | [] | false | false | false | false | false | let curval (#a: Type u#a) (#q: preorder a) (v: vhist q) =
| Cons?.hd v | false |
|
Steel.Preorder.fst | Steel.Preorder.property | val property : a: Type -> Type | let property (a:Type)
= a -> prop | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 13,
"end_line": 265,
"start_col": 0,
"start_line": 264
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x
(** If [z] extends [x] and [y], then [x] and [y] are extending one or another *)
let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl
(** If [x] extends [y], then the two heads of the traces are still related by the preorder *)
let rec extends_related_head (#a: Type u#a) (#q:preorder a) (x y:hist q)
: Lemma
(ensures
x `extends` y /\
Cons? x /\
Cons? y ==> Cons?.hd y `q` Cons?.hd x)
[SMTPat (x `extends` y)]
= match x with
| [] -> ()
| _::tl -> extends_related_head tl y
(** Finally, we can have our fully-fledged PCM from the preorder *)
let pcm_of_preorder (#a: Type u#a) (q:preorder a) : pcm (hist q) = {
p = p q;
comm = comm_op q;
assoc = (fun _ _ _ -> ());
assoc_r = (fun _ _ _ -> ());
is_unit = (fun _ -> ());
refine = (fun _ -> True)
}
(***** Using the preorder *)
(**
We check that the preorder derived from the PCM derived from the preorder
satisfies the same properties as the original preorder. Here, we get back history
extension from frame-preserving updates.
*)
let frame_preserving_q_aux (#a : Type u#a) (q:preorder a) (x y:hist q) (z:hist q)
: Lemma (requires (frame_preserving (pcm_of_preorder q) x y /\ compatible (pcm_of_preorder q) x z))
(ensures (y `extends` z))
= ()
(** A non-empty history *)
let vhist (#a: Type u#a) (q:preorder a) = h:hist q{Cons? h}
(** Get the current value from an history *)
let curval (#a: Type u#a) (#q:preorder a) (v:vhist q) = Cons?.hd v
(**
Given a frame-preserving update from [x] to [y]
for any value of resource [z] (compatible with [x])
the new value [y] advances the history [z] in a preorder respecting manner
*)
let frame_preserving_q (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> curval z `q` curval y))
= ()
(** Still given a frame-preserving update from [x] to [y], this update extends the history *)
let frame_preserving_extends (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> y `extends` z))
= ()
(** Helper function that flips a preoder *)
let flip (#a: Type u#a) (p:preorder a) : preorder a = fun x y -> p y x
(**
What is the preorder induced from the PCM induced by preorder [q]? It turns out that
it is the flipped of [q], reversed extension.
*)
let frame_preserving_extends2 (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> z `flip extends` y))
[SMTPat (frame_preserving (pcm_of_preorder q) x y)]
= ()
#push-options "--warn_error -271"
let pcm_of_preorder_induces_extends (#a: Type u#a) (q:preorder a)
: Lemma (induces_preorder (pcm_of_preorder q) (flip extends))
= let fp_full (x y:hist q) (f:frame_preserving_upd (pcm_of_preorder q) x y) (v:hist q)
: Lemma (requires compatible (pcm_of_preorder q) x v)
(ensures extends (f v) v)
[SMTPat ()]
= assert (composable (pcm_of_preorder q) x v) in
()
#pop-options
let extend_history (#a:Type u#a) (#q:preorder a) (h0:vhist q) (v:a{q (curval h0) v})
: h1:vhist q{h1 `extends` h0}
= v :: h0 | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: Type -> Type | Prims.Tot | [
"total"
] | [] | [
"Prims.prop"
] | [] | false | false | false | true | true | let property (a: Type) =
| a -> prop | false |
|
Steel.Preorder.fst | Steel.Preorder.fact_valid_compat | val fact_valid_compat : fact: Steel.Preorder.stable_property pcm -> v: a -> Prims.logical | let fact_valid_compat (#a:Type) (#pcm:pcm a)
(fact:stable_property pcm)
(v:a)
= forall z. compatible pcm v z ==> fact z | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 43,
"end_line": 275,
"start_col": 0,
"start_line": 272
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x
(** If [z] extends [x] and [y], then [x] and [y] are extending one or another *)
let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl
(** If [x] extends [y], then the two heads of the traces are still related by the preorder *)
let rec extends_related_head (#a: Type u#a) (#q:preorder a) (x y:hist q)
: Lemma
(ensures
x `extends` y /\
Cons? x /\
Cons? y ==> Cons?.hd y `q` Cons?.hd x)
[SMTPat (x `extends` y)]
= match x with
| [] -> ()
| _::tl -> extends_related_head tl y
(** Finally, we can have our fully-fledged PCM from the preorder *)
let pcm_of_preorder (#a: Type u#a) (q:preorder a) : pcm (hist q) = {
p = p q;
comm = comm_op q;
assoc = (fun _ _ _ -> ());
assoc_r = (fun _ _ _ -> ());
is_unit = (fun _ -> ());
refine = (fun _ -> True)
}
(***** Using the preorder *)
(**
We check that the preorder derived from the PCM derived from the preorder
satisfies the same properties as the original preorder. Here, we get back history
extension from frame-preserving updates.
*)
let frame_preserving_q_aux (#a : Type u#a) (q:preorder a) (x y:hist q) (z:hist q)
: Lemma (requires (frame_preserving (pcm_of_preorder q) x y /\ compatible (pcm_of_preorder q) x z))
(ensures (y `extends` z))
= ()
(** A non-empty history *)
let vhist (#a: Type u#a) (q:preorder a) = h:hist q{Cons? h}
(** Get the current value from an history *)
let curval (#a: Type u#a) (#q:preorder a) (v:vhist q) = Cons?.hd v
(**
Given a frame-preserving update from [x] to [y]
for any value of resource [z] (compatible with [x])
the new value [y] advances the history [z] in a preorder respecting manner
*)
let frame_preserving_q (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> curval z `q` curval y))
= ()
(** Still given a frame-preserving update from [x] to [y], this update extends the history *)
let frame_preserving_extends (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> y `extends` z))
= ()
(** Helper function that flips a preoder *)
let flip (#a: Type u#a) (p:preorder a) : preorder a = fun x y -> p y x
(**
What is the preorder induced from the PCM induced by preorder [q]? It turns out that
it is the flipped of [q], reversed extension.
*)
let frame_preserving_extends2 (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> z `flip extends` y))
[SMTPat (frame_preserving (pcm_of_preorder q) x y)]
= ()
#push-options "--warn_error -271"
let pcm_of_preorder_induces_extends (#a: Type u#a) (q:preorder a)
: Lemma (induces_preorder (pcm_of_preorder q) (flip extends))
= let fp_full (x y:hist q) (f:frame_preserving_upd (pcm_of_preorder q) x y) (v:hist q)
: Lemma (requires compatible (pcm_of_preorder q) x v)
(ensures extends (f v) v)
[SMTPat ()]
= assert (composable (pcm_of_preorder q) x v) in
()
#pop-options
let extend_history (#a:Type u#a) (#q:preorder a) (h0:vhist q) (v:a{q (curval h0) v})
: h1:vhist q{h1 `extends` h0}
= v :: h0
let property (a:Type)
= a -> prop
let stable_property (#a:Type) (pcm:pcm a)
= fact:property a {
FStar.Preorder.stable fact (preorder_of_pcm pcm)
} | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | fact: Steel.Preorder.stable_property pcm -> v: a -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"FStar.PCM.pcm",
"Steel.Preorder.stable_property",
"Prims.l_Forall",
"Prims.l_imp",
"FStar.PCM.compatible",
"Prims.logical"
] | [] | false | false | false | false | true | let fact_valid_compat (#a: Type) (#pcm: pcm a) (fact: stable_property pcm) (v: a) =
| forall z. compatible pcm v z ==> fact z | false |
|
Steel.Preorder.fst | Steel.Preorder.stable_property | val stable_property : pcm: FStar.PCM.pcm a -> Type | let stable_property (#a:Type) (pcm:pcm a)
= fact:property a {
FStar.Preorder.stable fact (preorder_of_pcm pcm)
} | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 5,
"end_line": 270,
"start_col": 0,
"start_line": 267
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x
(** If [z] extends [x] and [y], then [x] and [y] are extending one or another *)
let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl
(** If [x] extends [y], then the two heads of the traces are still related by the preorder *)
let rec extends_related_head (#a: Type u#a) (#q:preorder a) (x y:hist q)
: Lemma
(ensures
x `extends` y /\
Cons? x /\
Cons? y ==> Cons?.hd y `q` Cons?.hd x)
[SMTPat (x `extends` y)]
= match x with
| [] -> ()
| _::tl -> extends_related_head tl y
(** Finally, we can have our fully-fledged PCM from the preorder *)
let pcm_of_preorder (#a: Type u#a) (q:preorder a) : pcm (hist q) = {
p = p q;
comm = comm_op q;
assoc = (fun _ _ _ -> ());
assoc_r = (fun _ _ _ -> ());
is_unit = (fun _ -> ());
refine = (fun _ -> True)
}
(***** Using the preorder *)
(**
We check that the preorder derived from the PCM derived from the preorder
satisfies the same properties as the original preorder. Here, we get back history
extension from frame-preserving updates.
*)
let frame_preserving_q_aux (#a : Type u#a) (q:preorder a) (x y:hist q) (z:hist q)
: Lemma (requires (frame_preserving (pcm_of_preorder q) x y /\ compatible (pcm_of_preorder q) x z))
(ensures (y `extends` z))
= ()
(** A non-empty history *)
let vhist (#a: Type u#a) (q:preorder a) = h:hist q{Cons? h}
(** Get the current value from an history *)
let curval (#a: Type u#a) (#q:preorder a) (v:vhist q) = Cons?.hd v
(**
Given a frame-preserving update from [x] to [y]
for any value of resource [z] (compatible with [x])
the new value [y] advances the history [z] in a preorder respecting manner
*)
let frame_preserving_q (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> curval z `q` curval y))
= ()
(** Still given a frame-preserving update from [x] to [y], this update extends the history *)
let frame_preserving_extends (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> y `extends` z))
= ()
(** Helper function that flips a preoder *)
let flip (#a: Type u#a) (p:preorder a) : preorder a = fun x y -> p y x
(**
What is the preorder induced from the PCM induced by preorder [q]? It turns out that
it is the flipped of [q], reversed extension.
*)
let frame_preserving_extends2 (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> z `flip extends` y))
[SMTPat (frame_preserving (pcm_of_preorder q) x y)]
= ()
#push-options "--warn_error -271"
let pcm_of_preorder_induces_extends (#a: Type u#a) (q:preorder a)
: Lemma (induces_preorder (pcm_of_preorder q) (flip extends))
= let fp_full (x y:hist q) (f:frame_preserving_upd (pcm_of_preorder q) x y) (v:hist q)
: Lemma (requires compatible (pcm_of_preorder q) x v)
(ensures extends (f v) v)
[SMTPat ()]
= assert (composable (pcm_of_preorder q) x v) in
()
#pop-options
let extend_history (#a:Type u#a) (#q:preorder a) (h0:vhist q) (v:a{q (curval h0) v})
: h1:vhist q{h1 `extends` h0}
= v :: h0
let property (a:Type)
= a -> prop | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | pcm: FStar.PCM.pcm a -> Type | Prims.Tot | [
"total"
] | [] | [
"FStar.PCM.pcm",
"Steel.Preorder.property",
"FStar.Preorder.stable",
"Steel.Preorder.preorder_of_pcm"
] | [] | false | false | false | true | true | let stable_property (#a: Type) (pcm: pcm a) =
| fact: property a {FStar.Preorder.stable fact (preorder_of_pcm pcm)} | false |
|
Steel.Preorder.fst | Steel.Preorder.p | val p (#a: Type u#a) (q: preorder a) : pcm' (hist q) | val p (#a: Type u#a) (q: preorder a) : pcm' (hist q) | let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
} | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 1,
"end_line": 157,
"start_col": 0,
"start_line": 153
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | q: FStar.Preorder.preorder a -> FStar.PCM.pcm' (Steel.Preorder.hist q) | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.preorder",
"FStar.PCM.Mkpcm'",
"Steel.Preorder.hist",
"Steel.Preorder.p_composable",
"Steel.Preorder.p_op",
"Prims.Nil",
"FStar.PCM.pcm'"
] | [] | false | false | false | false | false | let p (#a: Type u#a) (q: preorder a) : pcm' (hist q) =
| { composable = p_composable q; op = p_op q; one = [] } | false |
Steel.Preorder.fst | Steel.Preorder.extends_related_head | val extends_related_head (#a: Type u#a) (#q: preorder a) (x y: hist q)
: Lemma (ensures x `extends` y /\ Cons? x /\ Cons? y ==> (Cons?.hd y) `q` (Cons?.hd x))
[SMTPat (x `extends` y)] | val extends_related_head (#a: Type u#a) (#q: preorder a) (x y: hist q)
: Lemma (ensures x `extends` y /\ Cons? x /\ Cons? y ==> (Cons?.hd y) `q` (Cons?.hd x))
[SMTPat (x `extends` y)] | let rec extends_related_head (#a: Type u#a) (#q:preorder a) (x y:hist q)
: Lemma
(ensures
x `extends` y /\
Cons? x /\
Cons? y ==> Cons?.hd y `q` Cons?.hd x)
[SMTPat (x `extends` y)]
= match x with
| [] -> ()
| _::tl -> extends_related_head tl y | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 40,
"end_line": 190,
"start_col": 0,
"start_line": 181
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x
(** If [z] extends [x] and [y], then [x] and [y] are extending one or another *)
let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | x: Steel.Preorder.hist q -> y: Steel.Preorder.hist q
-> FStar.Pervasives.Lemma
(ensures Steel.Preorder.extends x y /\ Cons? x /\ Cons? y ==> q (Cons?.hd y) (Cons?.hd x))
[SMTPat (Steel.Preorder.extends x y)] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.hist",
"Prims.list",
"Steel.Preorder.extends_related_head",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_imp",
"Prims.l_and",
"Steel.Preorder.extends",
"Prims.b2t",
"Prims.uu___is_Cons",
"Prims.__proj__Cons__item__hd",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"Prims.Nil"
] | [
"recursion"
] | false | false | true | false | false | let rec extends_related_head (#a: Type u#a) (#q: preorder a) (x y: hist q)
: Lemma (ensures x `extends` y /\ Cons? x /\ Cons? y ==> (Cons?.hd y) `q` (Cons?.hd x))
[SMTPat (x `extends` y)] =
| match x with
| [] -> ()
| _ :: tl -> extends_related_head tl y | false |
Steel.Preorder.fst | Steel.Preorder.extends_disjunction | val extends_disjunction (#a: Type u#a) (#q: preorder a) (x y z: hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x); SMTPat (z `extends` y)] | val extends_disjunction (#a: Type u#a) (#q: preorder a) (x y z: hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x); SMTPat (z `extends` y)] | let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 41,
"end_line": 178,
"start_col": 0,
"start_line": 172
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | x: Steel.Preorder.hist q -> y: Steel.Preorder.hist q -> z: Steel.Preorder.hist q
-> FStar.Pervasives.Lemma
(ensures
Steel.Preorder.extends z x /\ Steel.Preorder.extends z y ==>
Steel.Preorder.extends x y \/ Steel.Preorder.extends y x)
[SMTPat (Steel.Preorder.extends z x); SMTPat (Steel.Preorder.extends z y)] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.hist",
"Prims.list",
"Steel.Preorder.extends_disjunction",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_imp",
"Prims.l_and",
"Steel.Preorder.extends",
"Prims.l_or",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"Prims.Nil"
] | [
"recursion"
] | false | false | true | false | false | let rec extends_disjunction (#a: Type u#a) (#q: preorder a) (x y z: hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x); SMTPat (z `extends` y)] =
| match z with
| [] -> ()
| _ :: tl -> extends_disjunction x y tl | false |
Steel.Preorder.fst | Steel.Preorder.hval | val hval (#a #p: _) (h: history a p {Current? h}) : Ghost.erased a | val hval (#a #p: _) (h: history a p {Current? h}) : Ghost.erased a | let hval #a #p (h:history a p{Current? h}) : Ghost.erased a =
hval_tot h | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 12,
"end_line": 290,
"start_col": 0,
"start_line": 289
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x
(** If [z] extends [x] and [y], then [x] and [y] are extending one or another *)
let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl
(** If [x] extends [y], then the two heads of the traces are still related by the preorder *)
let rec extends_related_head (#a: Type u#a) (#q:preorder a) (x y:hist q)
: Lemma
(ensures
x `extends` y /\
Cons? x /\
Cons? y ==> Cons?.hd y `q` Cons?.hd x)
[SMTPat (x `extends` y)]
= match x with
| [] -> ()
| _::tl -> extends_related_head tl y
(** Finally, we can have our fully-fledged PCM from the preorder *)
let pcm_of_preorder (#a: Type u#a) (q:preorder a) : pcm (hist q) = {
p = p q;
comm = comm_op q;
assoc = (fun _ _ _ -> ());
assoc_r = (fun _ _ _ -> ());
is_unit = (fun _ -> ());
refine = (fun _ -> True)
}
(***** Using the preorder *)
(**
We check that the preorder derived from the PCM derived from the preorder
satisfies the same properties as the original preorder. Here, we get back history
extension from frame-preserving updates.
*)
let frame_preserving_q_aux (#a : Type u#a) (q:preorder a) (x y:hist q) (z:hist q)
: Lemma (requires (frame_preserving (pcm_of_preorder q) x y /\ compatible (pcm_of_preorder q) x z))
(ensures (y `extends` z))
= ()
(** A non-empty history *)
let vhist (#a: Type u#a) (q:preorder a) = h:hist q{Cons? h}
(** Get the current value from an history *)
let curval (#a: Type u#a) (#q:preorder a) (v:vhist q) = Cons?.hd v
(**
Given a frame-preserving update from [x] to [y]
for any value of resource [z] (compatible with [x])
the new value [y] advances the history [z] in a preorder respecting manner
*)
let frame_preserving_q (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> curval z `q` curval y))
= ()
(** Still given a frame-preserving update from [x] to [y], this update extends the history *)
let frame_preserving_extends (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> y `extends` z))
= ()
(** Helper function that flips a preoder *)
let flip (#a: Type u#a) (p:preorder a) : preorder a = fun x y -> p y x
(**
What is the preorder induced from the PCM induced by preorder [q]? It turns out that
it is the flipped of [q], reversed extension.
*)
let frame_preserving_extends2 (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> z `flip extends` y))
[SMTPat (frame_preserving (pcm_of_preorder q) x y)]
= ()
#push-options "--warn_error -271"
let pcm_of_preorder_induces_extends (#a: Type u#a) (q:preorder a)
: Lemma (induces_preorder (pcm_of_preorder q) (flip extends))
= let fp_full (x y:hist q) (f:frame_preserving_upd (pcm_of_preorder q) x y) (v:hist q)
: Lemma (requires compatible (pcm_of_preorder q) x v)
(ensures extends (f v) v)
[SMTPat ()]
= assert (composable (pcm_of_preorder q) x v) in
()
#pop-options
let extend_history (#a:Type u#a) (#q:preorder a) (h0:vhist q) (v:a{q (curval h0) v})
: h1:vhist q{h1 `extends` h0}
= v :: h0
let property (a:Type)
= a -> prop
let stable_property (#a:Type) (pcm:pcm a)
= fact:property a {
FStar.Preorder.stable fact (preorder_of_pcm pcm)
}
let fact_valid_compat (#a:Type) (#pcm:pcm a)
(fact:stable_property pcm)
(v:a)
= forall z. compatible pcm v z ==> fact z
open Steel.FractionalPermission
open FStar.Real
noeq
type history (a:Type) (p:preorder a) =
| Witnessed : hist p -> history a p
| Current : h:vhist p -> f:perm -> history a p
let hval_tot #a #p (h:history a p{Current? h}) : a =
match h with
| Current h _ -> curval h | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | h: Steel.Preorder.history a p {Current? h} -> FStar.Ghost.erased a | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.history",
"Prims.b2t",
"Steel.Preorder.uu___is_Current",
"FStar.Ghost.hide",
"Steel.Preorder.hval_tot",
"FStar.Ghost.erased"
] | [] | false | false | false | false | false | let hval #a #p (h: history a p {Current? h}) : Ghost.erased a =
| hval_tot h | false |
Spec.ECDSA.Test.Vectors.fst | Spec.ECDSA.Test.Vectors.sigver_vectors_sha2_512 | val sigver_vectors_sha2_512:list vec_SigVer | val sigver_vectors_sha2_512:list vec_SigVer | let sigver_vectors_sha2_512 : list vec_SigVer = [
{ msg = "273b063224ab48a1bf6c7efc93429d1f89de48fc4a4fa3ffe7a49ebba1a58ff5d208a9e4bff27b418252526243ba042d1605b6df3c2ec916ceef027853a41137f7bfb6fc63844de95f58e82b9ad2565f1367d2c69bd29100f6db21a8ab7ab58affd1661add0322bd915721378df9fa233ef0b7e0a0a85be31689e21891ec8977";
qx = "484e31e69ef70bb8527853c22c6b6b4cd2a51311dde66c7b63f097dbb6ab27bf";
qy = "e1ff8177f4061d4fbbacbbc70519f0fc8c8b6053d72af0fe4f048d615004f74e";
r = "91a303d8fe3ab4176070f6406267f6b79bfe5eb5f62ae6aeb374d90667858518";
s = "e152119cefa26826ea07ec40a428869132d70812c5578c5a260e48d6800e046a";
result = false;
};
{ msg = "d64ea1a768b0de29ab018ae93baa645d078c70a2f7aa4acd4ae7526538ebd5f697a11927cfd0ddc9187c095f14ad30544cb63ede9353af8b23c18ce22843881fe2d7bde748fc69085921677858d87d2dc3e244f6c7e2c2b2bd791f450dfdd4ff0ddd35ab2ada4f1b90ab16ef2bf63b3fbe88ce8a5d5bb85430740d3744849c13";
qx = "8b75fc0129c9a78f8395c63ae9694b05cd6950665cf5da7d66118de451422624";
qy = "b394171981d4896d6e1b4ef2336d9befe7d27e1eb87f1c14b8ddda622af379dc";
r = "17e298e67ad2af76f6892fdcead00a88256573868f79dc74431b55103058f0b0";
s = "881328cd91e43d30133f6e471e0b9b04353b17893fb7614fd7333d812a3df6b4";
result = false;
};
{ msg = "1db85445c9d8d1478a97dd9d6ffbf11ebcd2114d2ed4e8b6811171d947e7d4daedea35af6177debe2ef6d93f94ff9d770b45d458e91deb4eef59856425d7b00291aff9b6c9fa02375ec1a06f71f7548721790023301cf6ac7fee1d451228106ef4472681e652c8cd59b15d6d16f1e13440d888e265817cb4a654f7246e0980df";
qx = "76e51086e078b2b116fd1e9c6fa3d53f675ae40252fb9f0cc62817bd9ce8831d";
qy = "ca7e609a0b1d14b7c9249b53da0b2050450e2a25cb6c8f81c5311974a7efb576";
r = "23b653faaa7d4552388771931803ce939dd5ee62d3fa72b019be1b2272c85592";
s = "a03c6f5c54a10861d6b8922821708e9306fd6d5d10d566845a106539cbf4fadd";
result = false;
};
{ msg = "918d9f420e927b3e0a55d276b8b40d8a2c5df748727ff72a438c7e6593f542274050dce727980d3ef90c8aa5c13d53f1e8d631ebb650dee11b94902bbd7c92b8186af9039c56c43f3110697792c8cd1614166f06d09cdb58dab168cc3680a8473b1a623bf85dba855eace579d9410d2c4ca5ede6dc1e3db81e233c34ae922f49";
qx = "bc7c8e09bd093468f706740a4130c544374fdc924a535ef02e9d3be6c6d3bbfa";
qy = "af3f813ae6646f5b6dbfb0f261fd42537705c800bb1647386343428a9f2e10fc";
r = "6bd7ce95af25abfbf14aef4b17392f1da877ab562eca38d785fe39682e9c9324";
s = "6688bea20c87bab34d420642da9bdd4c69456bdec50835887367bb4fb7cd8650";
result = false;
};
{ msg = "6e2932153301a4eef680e6428929adae988c108d668a31ff55d0489947d75ff81a46bf89e84d6401f023be6e87688fbcd784d785ca846735524acb52d00452c84040a479e7cc330936441d93bbe722a9432a6e1db112b5c9403b10272cb1347fd619d463f7a9d223ad76fde06d8a6883500fb843235abff98e241bdfb5538c3e";
qx = "9cb0cf69303dafc761d4e4687b4ecf039e6d34ab964af80810d8d558a4a8d6f7";
qy = "2d51233a1788920a86ee08a1962c79efa317fb7879e297dad2146db995fa1c78";
r = "4b9f91e4285287261a1d1c923cf619cd52c175cfe7f1be60a5258c610348ba3d";
s = "28c45f901d71c41b298638ec0d6a85d7fcb0c33bbfec5a9c810846b639289a84";
result = true;
};
{ msg = "2f48ec387f181035b350772e27f478ae6ec7487923692fae217e0f8636acd062a6ac39f7435f27a0ebcfd8187a91ef00fb68d106b8da4a1dedc5a40a4fae709e92b00fcc218de76417d75185e59dff76ec1543fb429d87c2ca8134ff5ae9b45456cad93fc67223c68293231395287dc0b756355660721a1f5df83bf5bcb8456e";
qx = "e31096c2d512fbf84f81e9bdb16f33121702897605b43a3db546f8fb695b5f6f";
qy = "6fbec6a04a8c59d61c900a851d8bf8522187d3ec2637b10fa8f377689e086bba";
r = "1b244c21c08c0c0a10477fb7a21382d405b95c755088292859ca0e71bab68361";
s = "852f4cbfd346e90f404e1dd5c4b2c1debca3ea1abefe8400685d703aea6c5c7f";
result = false;
};
{ msg = "fd2e5de421ee46c9fe6290a33f95b394bd5b7762f23178f7f6834f1f056fa9a8831446403c098ff4dd764173f974be4c89d376119613a4a1890f6fc2ddff862bda292dd49f5410d9b1cfe1d97ef4582b6152494372fc083885f540c01f86d780e6f3e75a954af2190fdae9604e3f8ab32ab0292dc0d790bd2627e37b4b4885df";
qx = "633c2ee5630b62c9ce839efd4d485a6d35e8b9430d264ffe501d28dbace79123";
qy = "4b668a1a6d1a25b089f75c2bd8d8c6a9a14fe7b729f45a82565da2e866e2c490";
r = "bf2111c93ec055a7eda90c106fce494fd866045634fd2aa28d6e018f9106994e";
s = "86b0341208a0aa55edecfd272f49cb34408ce54b7febc1d0a1c2ce77ab6988f8";
result = false;
};
{ msg = "4bc2d9a898395b12701635f1048fbfd263ec115e4150532b034d59e625238f4ed32619744c612e35ac5a23bee8d5f5651641a492217d305e5051321c273647f14bc7c4afab518554e01c82d6fc1694c8bdbeb326bb607bcaf5436303bc09f64c02c6ec50de409a484f5237f7d34e2651ada7ec429ca3b99dd87c6015d2f4b342";
qx = "f78dce40d1cb8c4af2749bf22c6f8a9a470b1e41112796215dd017e57df1b38a";
qy = "61b29b0bc03dff7fa00613b4de1e2317cfbf2badd50dee3376c032a887c5b865";
r = "4a96169a5dea36a2594011537ee0dc19e8f9f74e82c07434079447155a830152";
s = "a204eaa4e97d7553a1521d9f6baadc0b6d6183ba0f385d8593d6ca83607c4d82";
result = false;
};
{ msg = "d3356a683417508a9b913643e6ceac1281ef583f428968f9d2b6540a189d7041c477da8d207d0529720f70dab6b0da8c2168837476c1c6b63b517ed3cad48ae331cf716ecf47a0f7d00b57073ac6a4749716d49d80c4d46261d38e2e34b4f43e0f20b280842f6e3ea34fefdddfb9fa2a040ffe915e8784cfdb29b3364a34ca62";
qx = "3fcc3b3e1b103fe435ac214c756bdaad309389e1c803e6d84bbbc27039fcf900";
qy = "7f09edd1ec87a6d36dc81c1528d52a62776e666c274415a9f441d6a8df6b9237";
r = "1cac13f277354456ae67ab09b09e07eb1af2a2bf45108da70f5c8c6a4cbcd538";
s = "5d83752e540525602ba7e6fee4d4263f3eda59e67df20aac79ca67e8899fed0d";
result = false;
};
{ msg = "d7f5da9f4cf9299b7f86c52b88364ce28fe9ada55dd551a1018790f9e1205e2405ac62429d65093f74ec35a16d9f195c993cd4eb8dc0aa0dabb70a503321d8a9649160d6b3d0a0854bb68c4c39693f592ef5dd478aa2432d0865d87d48b3aea9c7d7d114165c9200e4e8d7bd02a7895ec4418e6f2fed6b244bf66209039e98a9";
qx = "5ec702d43a67ada86efbfc136cf16d96078906954a3f1f9e440674cd907e4676";
qy = "05a62044fed8470dd4fca38d89d583ce36d50d28b66ab0b51922b21da92c56d9";
r = "75f3037298f1457dba55743999976a1c2636b2b8ab2ed3df4736a6d2934acc83";
s = "19d43ad168dda1bb8ac423f8f08876515234b3d841e57faef1b5ab27359b27ef";
result = false;
};
{ msg = "68f4b444e1cc2025e8ff55e8046ead735e6e317082edf7ce65e83573501cb92c408c1c1c6c4fcca6b96ad34224f17b20be471cc9f4f97f0a5b7bfae9558bdb2ecb6e452bb743603724273d9e8d2ca22afdda35c8a371b28153d772303e4a25dc4f28e9a6dc9635331450f5af290dfa3431c3c08b91d5c97284361c03ec78f1bc";
qx = "f63afe99e1b5fc652782f86b59926af22e6072be93390fe41f541204f9c935d1";
qy = "f6e19ce5935e336183c21becf66596b8f559d2d02ee282aa87a7d6f936f7260c";
r = "cef4831e4515c77ca062282614b54a11b7dc4057e6997685c2fbfa95b392bf72";
s = "f20dc01bf38e1344ba675a22239d9893b3a3e33d9a403329a3d21650e9125b75";
result = true;
};
{ msg = "e75be05be0aaf70719b488b89aaae9008707ca528994461db7130c4368575a024bf0981c305d61265e8b97599ec35c03badd1256b80d6bf70547ad6089b983e3bcc3481828f3259e43e655e177fc423fd7e066bd3ed68d81df84f773c0f9e5f8bf4469960b8b4d7b2a372fd0edd3521f6be670908f2d90a343f416358ea70e7e";
qx = "6d11b09d2767cf8d275faee746c203486259f66dd2bfa3a65c39371a66b23385";
qy = "4eb05c73e05261e979182833f20311e5366f72f4b949665ff294f959375534c6";
r = "15a697cdb614e11c0810e1e764cd501fcabc70874c957587bc4883d9438e177f";
s = "7bf6244f92bc768063cecb5336c8eaacd23db930b28703560f241c7d93950dfd";
result = false;
};
{ msg = "0dc4a3eab66bd2e703a8fff566c34d466f9823ae42bd2104f61a6b051c0b017833fcef4d609d137ad97c209c80eebe252857aa7fafc35f16000a2bd4b4be0fa83b6e229eddfd180101f1f40d0453148053d8306833df64d59599b90194b55541d7f22dd589da9f7be519cbbb9db416c71bfe40ec090b5b7a600eec29bfd47306";
qx = "f3899caba038efb534c4cea0bd276814ffd80194473c903b81af11c8c05cb6e6";
qy = "6ea6b17402fcf2e8e737d11ffc7c2ed3b2d0bc3b8f271a381f4294cff62682c3";
r = "57b99380452e1d37b133c49b9ba493dee8630940477ca3351a43d90b99871e6a";
s = "df599c3a37105af3ecc159b3b685ccb3e151b7d5cf2d97147974ae71f466b615";
result = false;
};
{ msg = "d55e5e124a7217879ca986f285e22ac51940b35959bbf5543104b5547356fd1a0ec37c0a23209004a2ec5bcaf3335bc45e4dc990eacd29b2d9b5cf349c7ba67711356299bceab6f048df761c65f2988803133d6723a2820fefb2654cc7c5f032f833ba78a34d2878c6b0ba654ebe26b110c935abb56024bd5d0f09b367724c07";
qx = "1fd6f4b98d0755291e7a230e9f81ecf909e6350aadb08e42a3262ff19200fbd2";
qy = "5578fef79bc477acfb8ed0dc10c4f5809c14dc5492405b3792a7940650b305d7";
r = "97a99e96e407b3ada2c2dcf9ceeeb984d9a4d0aa66ddf0a74ca23cabfb1566cc";
s = "0ecac315dc199cfea3c15348c130924a1f787019fe4cd3ae47ca8b111268754a";
result = false;
};
{ msg = "7753c03b4202cb38bc0190a9f931eb31858d705d92d650320ff449fc99167fb3770b764c8988f6b34ac5a3d507a10e0aff7f88293f6a22c7ed8a24248a52dc125e416e158833fc38af29199f8ca4931068d4ccaa87e299e95642068f68c208cb782df13908f950564743ed1692502bafafaff169dc8fe674fb5e4f3ffd578c35";
qx = "2dcbd8790cee552e9f18f2b3149a2252dcd58b99ca7dc9680b92c8c43aa33874";
qy = "5dbc8bb8813c8e019d80e19acdb0792f537980fecde93db621aaf1f6d0e6ee34";
r = "2bdbd8b0d759595662cc10b10236136ef6ce429641f68cf6480f472fcc77bc9f";
s = "7e7df0c8b86f7db06caf1610166f7b9c4c75447f991d5aaf4dea720c25985c8c";
result = true;
};
] | {
"file_name": "specs/tests/p256/Spec.ECDSA.Test.Vectors.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 1,
"end_line": 356,
"start_col": 1,
"start_line": 250
} | module Spec.ECDSA.Test.Vectors
open Lib.Meta
#set-options "--fuel 0 --ifuel 0"
///
/// ECDSA test vectors from NIST CAVP
/// https://csrc.nist.gov/Projects/Cryptographic-Algorithm-Validation-Program/Digital-Signatures#ecdsa2vs
///
type vec_SigVer = {
msg: hex_string;
qx: hex_string;
qy: hex_string;
r: hex_string;
s: hex_string;
result: bool;
}
type vec_SigGen = {
msg': hex_string;
d: hex_string;
qx': hex_string;
qy': hex_string;
k: hex_string;
r': hex_string;
s': hex_string;
}
let sigver_vectors_sha2_256 : list vec_SigVer = [
{ msg = "e4796db5f785f207aa30d311693b3702821dff1168fd2e04c0836825aefd850d9aa60326d88cde1a23c7745351392ca2288d632c264f197d05cd424a30336c19fd09bb229654f0222fcb881a4b35c290a093ac159ce13409111ff0358411133c24f5b8e2090d6db6558afc36f06ca1f6ef779785adba68db27a409859fc4c4a0";
qx = "87f8f2b218f49845f6f10eec3877136269f5c1a54736dbdf69f89940cad41555";
qy = "e15f369036f49842fac7a86c8a2b0557609776814448b8f5e84aa9f4395205e9";
r = "d19ff48b324915576416097d2544f7cbdf8768b1454ad20e0baac50e211f23b0";
s = "a3e81e59311cdfff2d4784949f7a2cb50ba6c3a91fa54710568e61aca3e847c6";
result = false;
};
{ msg = "069a6e6b93dfee6df6ef6997cd80dd2182c36653cef10c655d524585655462d683877f95ecc6d6c81623d8fac4e900ed0019964094e7de91f1481989ae1873004565789cbf5dc56c62aedc63f62f3b894c9c6f7788c8ecaadc9bd0e81ad91b2b3569ea12260e93924fdddd3972af5273198f5efda0746219475017557616170e";
qx = "5cf02a00d205bdfee2016f7421807fc38ae69e6b7ccd064ee689fc1a94a9f7d2";
qy = "ec530ce3cc5c9d1af463f264d685afe2b4db4b5828d7e61b748930f3ce622a85";
r = "dc23d130c6117fb5751201455e99f36f59aba1a6a21cf2d0e7481a97451d6693";
s = "d6ce7708c18dbf35d4f8aa7240922dc6823f2e7058cbc1484fcad1599db5018c";
result = false;
};
{ msg = "df04a346cf4d0e331a6db78cca2d456d31b0a000aa51441defdb97bbeb20b94d8d746429a393ba88840d661615e07def615a342abedfa4ce912e562af714959896858af817317a840dcff85a057bb91a3c2bf90105500362754a6dd321cdd86128cfc5f04667b57aa78c112411e42da304f1012d48cd6a7052d7de44ebcc01de";
qx = "2ddfd145767883ffbb0ac003ab4a44346d08fa2570b3120dcce94562422244cb";
qy = "5f70c7d11ac2b7a435ccfbbae02c3df1ea6b532cc0e9db74f93fffca7c6f9a64";
r = "9913111cff6f20c5bf453a99cd2c2019a4e749a49724a08774d14e4c113edda8";
s = "9467cd4cd21ecb56b0cab0a9a453b43386845459127a952421f5c6382866c5cc";
result = false;
};
{ msg = "e1130af6a38ccb412a9c8d13e15dbfc9e69a16385af3c3f1e5da954fd5e7c45fd75e2b8c36699228e92840c0562fbf3772f07e17f1add56588dd45f7450e1217ad239922dd9c32695dc71ff2424ca0dec1321aa47064a044b7fe3c2b97d03ce470a592304c5ef21eed9f93da56bb232d1eeb0035f9bf0dfafdcc4606272b20a3";
qx = "e424dc61d4bb3cb7ef4344a7f8957a0c5134e16f7a67c074f82e6e12f49abf3c";
qy = "970eed7aa2bc48651545949de1dddaf0127e5965ac85d1243d6f60e7dfaee927";
r = "bf96b99aa49c705c910be33142017c642ff540c76349b9dab72f981fd9347f4f";
s = "17c55095819089c2e03b9cd415abdf12444e323075d98f31920b9e0f57ec871c";
result = true;
};
{ msg = "73c5f6a67456ae48209b5f85d1e7de7758bf235300c6ae2bdceb1dcb27a7730fb68c950b7fcada0ecc4661d3578230f225a875e69aaa17f1e71c6be5c831f22663bac63d0c7a9635edb0043ff8c6f26470f02a7bc56556f1437f06dfa27b487a6c4290d8bad38d4879b334e341ba092dde4e4ae694a9c09302e2dbf443581c08";
qx = "e0fc6a6f50e1c57475673ee54e3a57f9a49f3328e743bf52f335e3eeaa3d2864";
qy = "7f59d689c91e463607d9194d99faf316e25432870816dde63f5d4b373f12f22a";
r = "1d75830cd36f4c9aa181b2c4221e87f176b7f05b7c87824e82e396c88315c407";
s = "cb2acb01dac96efc53a32d4a0d85d0c2e48955214783ecf50a4f0414a319c05a";
result = true;
};
{ msg = "666036d9b4a2426ed6585a4e0fd931a8761451d29ab04bd7dc6d0c5b9e38e6c2b263ff6cb837bd04399de3d757c6c7005f6d7a987063cf6d7e8cb38a4bf0d74a282572bd01d0f41e3fd066e3021575f0fa04f27b700d5b7ddddf50965993c3f9c7118ed78888da7cb221849b3260592b8e632d7c51e935a0ceae15207bedd548";
qx = "a849bef575cac3c6920fbce675c3b787136209f855de19ffe2e8d29b31a5ad86";
qy = "bf5fe4f7858f9b805bd8dcc05ad5e7fb889de2f822f3d8b41694e6c55c16b471";
r = "25acc3aa9d9e84c7abf08f73fa4195acc506491d6fc37cb9074528a7db87b9d6";
s = "9b21d5b5259ed3f2ef07dfec6cc90d3a37855d1ce122a85ba6a333f307d31537";
result = false;
};
{ msg = "7e80436bce57339ce8da1b5660149a20240b146d108deef3ec5da4ae256f8f894edcbbc57b34ce37089c0daa17f0c46cd82b5a1599314fd79d2fd2f446bd5a25b8e32fcf05b76d644573a6df4ad1dfea707b479d97237a346f1ec632ea5660efb57e8717a8628d7f82af50a4e84b11f21bdff6839196a880ae20b2a0918d58cd";
qx = "3dfb6f40f2471b29b77fdccba72d37c21bba019efa40c1c8f91ec405d7dcc5df";
qy = "f22f953f1e395a52ead7f3ae3fc47451b438117b1e04d613bc8555b7d6e6d1bb";
r = "548886278e5ec26bed811dbb72db1e154b6f17be70deb1b210107decb1ec2a5a";
s = "e93bfebd2f14f3d827ca32b464be6e69187f5edbd52def4f96599c37d58eee75";
result = false;
};
{ msg = "1669bfb657fdc62c3ddd63269787fc1c969f1850fb04c933dda063ef74a56ce13e3a649700820f0061efabf849a85d474326c8a541d99830eea8131eaea584f22d88c353965dabcdc4bf6b55949fd529507dfb803ab6b480cd73ca0ba00ca19c438849e2cea262a1c57d8f81cd257fb58e19dec7904da97d8386e87b84948169";
qx = "69b7667056e1e11d6caf6e45643f8b21e7a4bebda463c7fdbc13bc98efbd0214";
qy = "d3f9b12eb46c7c6fda0da3fc85bc1fd831557f9abc902a3be3cb3e8be7d1aa2f";
r = "288f7a1cd391842cce21f00e6f15471c04dc182fe4b14d92dc18910879799790";
s = "247b3c4e89a3bcadfea73c7bfd361def43715fa382b8c3edf4ae15d6e55e9979";
result = false;
};
{ msg = "3fe60dd9ad6caccf5a6f583b3ae65953563446c4510b70da115ffaa0ba04c076115c7043ab8733403cd69c7d14c212c655c07b43a7c71b9a4cffe22c2684788ec6870dc2013f269172c822256f9e7cc674791bf2d8486c0f5684283e1649576efc982ede17c7b74b214754d70402fb4bb45ad086cf2cf76b3d63f7fce39ac970";
qx = "bf02cbcf6d8cc26e91766d8af0b164fc5968535e84c158eb3bc4e2d79c3cc682";
qy = "069ba6cb06b49d60812066afa16ecf7b51352f2c03bd93ec220822b1f3dfba03";
r = "f5acb06c59c2b4927fb852faa07faf4b1852bbb5d06840935e849c4d293d1bad";
s = "049dab79c89cc02f1484c437f523e080a75f134917fda752f2d5ca397addfe5d";
result = false;
};
{ msg = "983a71b9994d95e876d84d28946a041f8f0a3f544cfcc055496580f1dfd4e312a2ad418fe69dbc61db230cc0c0ed97e360abab7d6ff4b81ee970a7e97466acfd9644f828ffec538abc383d0e92326d1c88c55e1f46a668a039beaa1be631a89129938c00a81a3ae46d4aecbf9707f764dbaccea3ef7665e4c4307fa0b0a3075c";
qx = "224a4d65b958f6d6afb2904863efd2a734b31798884801fcab5a590f4d6da9de";
qy = "178d51fddada62806f097aa615d33b8f2404e6b1479f5fd4859d595734d6d2b9";
r = "87b93ee2fecfda54deb8dff8e426f3c72c8864991f8ec2b3205bb3b416de93d2";
s = "4044a24df85be0cc76f21a4430b75b8e77b932a87f51e4eccbc45c263ebf8f66";
result = false;
};
{ msg = "4a8c071ac4fd0d52faa407b0fe5dab759f7394a5832127f2a3498f34aac287339e043b4ffa79528faf199dc917f7b066ad65505dab0e11e6948515052ce20cfdb892ffb8aa9bf3f1aa5be30a5bbe85823bddf70b39fd7ebd4a93a2f75472c1d4f606247a9821f1a8c45a6cb80545de2e0c6c0174e2392088c754e9c8443eb5af";
qx = "43691c7795a57ead8c5c68536fe934538d46f12889680a9cb6d055a066228369";
qy = "f8790110b3c3b281aa1eae037d4f1234aff587d903d93ba3af225c27ddc9ccac";
r = "8acd62e8c262fa50dd9840480969f4ef70f218ebf8ef9584f199031132c6b1ce";
s = "cfca7ed3d4347fb2a29e526b43c348ae1ce6c60d44f3191b6d8ea3a2d9c92154";
result = false;
};
{ msg = "0a3a12c3084c865daf1d302c78215d39bfe0b8bf28272b3c0b74beb4b7409db0718239de700785581514321c6440a4bbaea4c76fa47401e151e68cb6c29017f0bce4631290af5ea5e2bf3ed742ae110b04ade83a5dbd7358f29a85938e23d87ac8233072b79c94670ff0959f9c7f4517862ff829452096c78f5f2e9a7e4e9216";
qx = "9157dbfcf8cf385f5bb1568ad5c6e2a8652ba6dfc63bc1753edf5268cb7eb596";
qy = "972570f4313d47fc96f7c02d5594d77d46f91e949808825b3d31f029e8296405";
r = "dfaea6f297fa320b707866125c2a7d5d515b51a503bee817de9faa343cc48eeb";
s = "8f780ad713f9c3e5a4f7fa4c519833dfefc6a7432389b1e4af463961f09764f2";
result = false;
};
{ msg = "785d07a3c54f63dca11f5d1a5f496ee2c2f9288e55007e666c78b007d95cc28581dce51f490b30fa73dc9e2d45d075d7e3a95fb8a9e1465ad191904124160b7c60fa720ef4ef1c5d2998f40570ae2a870ef3e894c2bc617d8a1dc85c3c55774928c38789b4e661349d3f84d2441a3b856a76949b9f1f80bc161648a1cad5588e";
qx = "072b10c081a4c1713a294f248aef850e297991aca47fa96a7470abe3b8acfdda";
qy = "9581145cca04a0fb94cedce752c8f0370861916d2a94e7c647c5373ce6a4c8f5";
r = "09f5483eccec80f9d104815a1be9cc1a8e5b12b6eb482a65c6907b7480cf4f19";
s = "a4f90e560c5e4eb8696cb276e5165b6a9d486345dedfb094a76e8442d026378d";
result = false;
};
{ msg = "76f987ec5448dd72219bd30bf6b66b0775c80b394851a43ff1f537f140a6e7229ef8cd72ad58b1d2d20298539d6347dd5598812bc65323aceaf05228f738b5ad3e8d9fe4100fd767c2f098c77cb99c2992843ba3eed91d32444f3b6db6cd212dd4e5609548f4bb62812a920f6e2bf1581be1ebeebdd06ec4e971862cc42055ca";
qx = "09308ea5bfad6e5adf408634b3d5ce9240d35442f7fe116452aaec0d25be8c24";
qy = "f40c93e023ef494b1c3079b2d10ef67f3170740495ce2cc57f8ee4b0618b8ee5";
r = "5cc8aa7c35743ec0c23dde88dabd5e4fcd0192d2116f6926fef788cddb754e73";
s = "9c9c045ebaa1b828c32f82ace0d18daebf5e156eb7cbfdc1eff4399a8a900ae7";
result = false;
};
{ msg = "60cd64b2cd2be6c33859b94875120361a24085f3765cb8b2bf11e026fa9d8855dbe435acf7882e84f3c7857f96e2baab4d9afe4588e4a82e17a78827bfdb5ddbd1c211fbc2e6d884cddd7cb9d90d5bf4a7311b83f352508033812c776a0e00c003c7e0d628e50736c7512df0acfa9f2320bd102229f46495ae6d0857cc452a84";
qx = "2d98ea01f754d34bbc3003df5050200abf445ec728556d7ed7d5c54c55552b6d";
qy = "9b52672742d637a32add056dfd6d8792f2a33c2e69dafabea09b960bc61e230a";
r = "06108e525f845d0155bf60193222b3219c98e3d49424c2fb2a0987f825c17959";
s = "62b5cdd591e5b507e560167ba8f6f7cda74673eb315680cb89ccbc4eec477dce";
result = true;
};
]
let sigver_vectors_sha2_384 : list vec_SigVer = [
{ msg = "fe9838f007bdc6afcd626974fcc6833f06b6fd970427b962d75c2aeadbef386bec8d018106197fe2547d2af02e7a7949965d5fbc4c5db909a95b9858426a33c080b0b25dae8b56c5cbc6c4eec3dbd81635c79457eaef4fab39e662a1d05b2481eda8c1074ae2d1704c8a3f769686a1f965ef3c87602efc288c7f9ff8cd5e22a4";
qx = "40ded13dbbe72c629c38f07f7f95cf75a50e2a524897604c84fafde5e4cafb9f";
qy = "a17202e92d7d6a37c438779349fd79567d75a40ef22b7d09ca21ccf4aec9a66c";
r = "be34730c31730b4e412e6c52c23edbd36583ace2102b39afa11d24b6848cb77f";
s = "03655202d5fd8c9e3ae971b6f080640c406112fd95e7015874e9b6ee77752b10";
result = false;
};
{ msg = "b69043b9b331da392b5dd689142dfc72324265da08f14abcedf03ad8263e6bdccbc75098a2700bbba1979de84c8f12891aa0d000f8a1abad7dde4981533f21da59cc80d9cf94517f3b61d1a7d9eecb2fcf052e1fc9e7188c031b86305e4a436a37948071f046e306befb8511dc03a53dc8769a90a86e9b4fdbf05dcdfa35ab73";
qx = "1f80e19ffeb51dd74f1c397ac3dfd3415ab16ebd0847ed119e6c3b15a1a884b8";
qy = "9b395787371dbfb55d1347d7bed1c261d2908121fb78de1d1bf2d00666a62aed";
r = "249ca2c3eb6e04ac57334c2f75dc5e658bbb485bf187100774f5099dd13ef707";
s = "97363a05202b602d13166346694e38135bbce025be94950e9233f4c8013bf5bf";
result = false;
};
{ msg = "d2fcaaede8b879c064b0aa46e68efc278a469b80a7f7e1939ec2ebc96c76206f23395967279c181fea157ebb79dfadc68e31345f07f13305c80de0d85e4330d3a45f957c5c2526b945838ce5a9c2844b6b2a665c0f70b748b1213a8cf20ba5dbdf8cab231f433da522104a5cd027d3e36bb373c4ed404d9af0cbec6f85ec2193";
qx = "ce4dcfa7384c83443ace0fb82c4ac1adfa100a9b2c7bf09f093f8b6d084e50c2";
qy = "d98ae7b91abee648d0bfde192703741ac21daad7262af418b50e406d825eb0d6";
r = "597e1e04d93a6b444ccc447a48651f17657ff43fb65fe94461d2bf816b01af40";
s = "359fe3817963548e676d6da34c2d0866aa42499237b682002889eaf8893814d2";
result = true;
};
{ msg = "06cd86481865181cef7acdc3202824970ec2d97662b519c4b588dc9e51617c068282b1a11a15bf7efc4858a2f37a3d74b05fb5790eb68338c8009b4da9b4270514d387a2e016a99ee109841e884a7909504ef31a5454e214663f830f23a5a76f91402fca5f5d61699fa874597bdbfb1ecff8f07ddbd07ef61e97d0d5262ef314";
qx = "1b677f535ac69d1acd4592c0d12fac13c9131e5a6f8ab4f9d0afdcb3a3f327e0";
qy = "5dca2c73ec89e58ef8267cba2bb5eb0f551f412f9dc087c1a6944f0ce475277a";
r = "df0b0cd76d2555d4c38b3d70bfdf964884d0beeb9f74385f0893e87d20c9642d";
s = "128299aabf1f5496112be1fe04365f5f8215b08a040abdfeca4626f4d15c005b";
result = false;
};
{ msg = "59ad297397f3503604a4a2d098a4f00a368ad95c6101b3d38f9d49d908776c5a6c8654b006adb7939ffb6c30afa325b54185d82c3cc0d836850dce54d3408b257c3a961d11fafe2b74ba8bddfc1102fa656d1028baf94c38340c26a11e992aab71ce3732271b767358671b25225926f3a4b9ec5f82c059f0c7d1446d5d9e4251";
qx = "7ffc2853f3e17887dda13b0eb43f183ce50a5ac0f8bba75fb1921172484f9b94";
qy = "4cc523d14192f80bd5b27d30b3b41e064da87bfbae15572dd382b9a176c123a2";
r = "3156176d52eb26f9391229de4251993a41b8172f78970bb70e32a245be4bb653";
s = "62827a29e12d2f29b00fb2d02dd5f2d5412e17a4455f4431a5c996881fdfc0ee";
result = false;
};
{ msg = "8215daca87e689a20392646a6511bb7b5a82d2d995ca9de89bd9d9c0b11464b7cb1e4e9a31e3e01ad8c2cd613d5a2cb44a2a8df6899fce4c282dea1e41af0df6c36be1f320036567f8d0d32aaa79c95fe53b16668f7e1a9e5d7d039ea260fd03711b7d1c177355fc52244d49ca5b238556a5541349014683cb7da326f443b752";
qx = "5569f76dc94243cde819fb6fc85144ec67e2b5d49539f62e24d406d1b68f0058";
qy = "1208c38dbe25870deab53c486f793a1e250c9d1b8e7c147ea68b71196c440730";
r = "706f2ba4025e7c06b66d6369a3f93b2fec46c51eceff42a158f7431919506cfb";
s = "b4e75ac34a96393237fc4337789e37168d79382705b248051c9c72bcbac5f516";
result = false;
};
{ msg = "a996b1fb800f692517a2eb80e837233193dd3e82484d3f49bd19ee0db8f7b440876b07e384c90aa8b9f7b6603ca0b5a4e06c1da0edb974a2fb9b6e7c720ddf3e5c0e314c2d189402903c08c0836776c361a284db887ebcc33e615de9720b01dadade585eef687b3346468bdafb490e56d657a9e7d44d92014069005a36c1cf63";
qx = "e4b470c65b2c04db060d7105ec6911589863d3c7f7ce48726ba3f369ea3467e8";
qy = "44c38d3ae098de05f5915a5868c17fee296a6e150beb1f000df5f3bec8fc4532";
r = "c9c347ee5717e4c759ddaf09e86f4e1db2c8658593177cfda4e6514b5e3ecb87";
s = "baae01e9e44a7b04d69c8eaaed77c9e3a36ce8962f95cc50a0db146b4e49eb40";
result = false;
};
{ msg = "1a6e49a377a08e992353d6acc557b687b1b69a41d83d43a75fadb97b8c928cfebadebaaf99ea7fb13148807f56ea17384a7912e578e62b1b009fefb2aafca5ac85539433619b286f10643a56f8dfa47ba4d01c02510deaec18029ea6b9682022b139dcb70814164c4c90ec717ad9d925485398531cdd5992a2524498b337f97d";
qx = "96050c5fa2ddd1b2e5451d89ee74a0b7b54347364ddc0231715a6ef1146fe8dc";
qy = "e0888a9e78aeea87f6e1e9002b2651169f36c4ee53013cfc8c9912b7fd504858";
r = "2353d6cd3c21b8ea7dbc1cd940519812dbe365a3b15cd6aebba9d11cf269867a";
s = "85f560273cd9e82e6801e4cb1c8cd29cdac34a020da211d77453756b604b8fa7";
result = true;
};
{ msg = "3e14f737c913931bc82764ebc440b12e3ce1ffe0f858c7b8f1cbd30fbbb1644fa59be1d2cca5f64a6d7dc5ed5c4420f39227516ae8eb3019ef86274d0e4d06cde7bf5e5c413243dfc421d9f141762109810e6b6a451eeb4bd8d4be1ff111426d7e44d0a916b4fe3db3594d8dd01ae90feecf8f1e230b574180cd0b8d43a3d33b";
qx = "0c07bb79f44012299fbfd5a0f31397aaf7d757f8a38437407c1b09271c6551a0";
qy = "84fe7846d5d403dc92c0091fbd39f3c5cbca3f94c10b5cae44e2e96562131b13";
r = "49e9425f82d0a8c503009cead24e12adc9d48a08594094ca4f6d13ad1e3c571d";
s = "1f1b70aaa30a8ff639aa0935944e9b88326a213ab8fce5194c1a9dec070eb433";
result = false;
};
{ msg = "4000106127a72746db77957cbc6bfd84ae3d1d63b8190087637e93689841331e2adc1930d6df4302935f4520bbee513505cdcfca99ebc6f83af7b23b0f2e7f7defba614022ceeae9c6886e8b13f7ea253a307ac301f3536720cbe3de82ba3e98310361b61801a8304ffc91ff774948e33176ddcddf1b76437b3f02c910578d46";
qx = "71db1de1a1f38f356c91feaff5cfe395d1a5b9d23cf6aa19f38ae0bcc90a486d";
qy = "ecdd6ffb174a50f1cc792985c2f9608c399c98b8a64a69d2b5b7cdd9241f67e2";
r = "b0443b33a6f249470d2f943675009d21b9ccbead1525ae57815df86bb20470bf";
s = "316dbee27d998e09128539c269e297ac8f34b9ef8249a0619168c3495c5c1198";
result = false;
};
{ msg = "b42e547d0e7ddd5e1069bb2d158a5b4d5d9c4310942a1bfd09490311a6e684bd3c29b0dcef86a9788b4b26fed7863f3d5e5439796b5b5ffe7aa2545d0f518ad020689ca21230f3a59e7f8cca465fe21df511e78d215fa805f5f0f88938e9d198515e6b9c819930755c6c6aea5114cd2904607243051c09dd7a147756cbc204a5";
qx = "8219b225aa15472262c648cac8de9aad4173d17a231ba24352a5a1c4eea70fad";
qy = "0fee2b08ad39fbf0db0016ef2896ca99adc07efc8c415f640f3720498be26037";
r = "134fb689101aaad3954de2819d9fbd12072fe2bc36f496bbf0d13fa72114ab96";
s = "e65c232bd915b59e087e7fd5ec90bf636cfa80526345c79a0adfd75003045d6f";
result = false;
};
{ msg = "aa563223a7d5201febdf13cab80a03dce6077c26e751bc98a941196a28848abc495e0324013c9a2094fb15dc65d100c3e8a136a52c1780b395f42588900b641b6d4361432e2173195a2f60189f3fcc85f4e9659cae52576f20d1852d43c2b400deea3144c8e870e1906d677425d8c85037c7a42a9d249b2da4b516e04476bd45";
qx = "c934195de33b60cf00461fc3c45dad068e9f5f7af5c7fa78591e95aeb04e2617";
qy = "b588dd5f9965fdaa523b475c2812c251bc6973e2df21d9beaace976abf5728cb";
r = "71f302440eb4ed2a939b69e33e905e6fdc545c743458d38f7e1a1d456e35f389";
s = "54eaa0eb9cd7503b19a9658f0a04955d9f0ab20ebc8a0877e33c89ee88ad068f";
result = false;
};
{ msg = "98e4babf890f52e5a04bd2a7d79bf0ae9a71967847347d87f29fb3997454c73c7979d15b5c4f4205ec3de7835d1885fb7abcf8dcde94baf08b1d691a0c74845317286540e8c9d378fefaa4762c302492f51023c0d7adbb1cc90b7b0335f11203664e71fea621bc2f59d2dbd0ee76d6597ec75510de59b6d25fa6750a71c59435";
qx = "9e1adcd48e2e3f0e4c213501808228e587c40558f52bb54ddbb6102d4048ea92";
qy = "34eff98704790938e7e0bdf87ae39807a6b77dfdc9ecdfe6dd0f241abae1aeb2";
r = "ce4f0d7480522c8dd1b02dd0eb382f22406642f038c1ede9411883d72b3e7ed0";
s = "8546e1ee3b77f9927cdaccbc2f1cf19d6b5576b0f738bb1b86a0c66b39ca56fb";
result = false;
};
{ msg = "bb6b03ad60d6ddbf0c4d17246206e61c886f916d252bb4608149da49cef9033484080e861f91bb2400baa0cd6c5d90c2f275e2fabc12d83847f7a1c3ff0eb40c8a3dd83d07d194ba3797d27238415a2f358d7292a1991af687bcb977486980f9138b3140321485638ac7bd22ecda00ffe5009b83b90397eff24ecf22c5495d67";
qx = "93edbecb0b019c2cc03060f54cb4904b920fdb34eb83badd752be9443036ae13";
qy = "b494e9295e080a9080fe7e73249b3a5904aa84e1c028121eecd3e2cf1a55f598";
r = "eec2986d47b71995892b0915d3d5becc4dcb2ab55206d772e0189541b2184ddf";
s = "8a6c1edeb6452627ad27c8319599c54ac44cdd831ea66f13f49d90affe6ad45b";
result = true;
};
{ msg = "33a5d489f671f396c776bc1acf193bc9a74306f4692dd8e05bcdfe28fdefbd5c09b831c204a1dec81d8e3541f324f7b474d692789013bb1eca066f82fbf3f1cf3ba64e9d8963e9ecc180b9251919e2e8a1ab05847a0d76ff67a47c00e170e38e5b319a56f59cc51038f90961ea27a9a7eb292a0a1aa2f4972568669246907a35";
qx = "3205bae876f9bd50b0713959e72457165e826cbbe3895d67320909daa48b0ebc";
qy = "d1592562273e5e0f57bbfb92cedd9af7f133255684ee050af9b6f02019bbcafa";
r = "0124f3f1c61ec458561a4eaa6c155bd29e59703d14556324924683db3a4cf43b";
s = "688a5c5fc0c7ba92210c50cce5b512a468a880e05acc21ca56571d89f45f603a";
result = false;
};
] | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Meta.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.ECDSA.Test.Vectors.fst"
} | [
{
"abbrev": false,
"full_module": "Lib.Meta",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.ECDSA.Test",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.ECDSA.Test",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Prims.list Spec.ECDSA.Test.Vectors.vec_SigVer | Prims.Tot | [
"total"
] | [] | [
"Prims.Cons",
"Spec.ECDSA.Test.Vectors.vec_SigVer",
"Spec.ECDSA.Test.Vectors.Mkvec_SigVer",
"Prims.Nil"
] | [] | false | false | false | true | false | let sigver_vectors_sha2_512:list vec_SigVer =
| [
{
msg
=
"273b063224ab48a1bf6c7efc93429d1f89de48fc4a4fa3ffe7a49ebba1a58ff5d208a9e4bff27b418252526243ba042d1605b6df3c2ec916ceef027853a41137f7bfb6fc63844de95f58e82b9ad2565f1367d2c69bd29100f6db21a8ab7ab58affd1661add0322bd915721378df9fa233ef0b7e0a0a85be31689e21891ec8977";
qx = "484e31e69ef70bb8527853c22c6b6b4cd2a51311dde66c7b63f097dbb6ab27bf";
qy = "e1ff8177f4061d4fbbacbbc70519f0fc8c8b6053d72af0fe4f048d615004f74e";
r = "91a303d8fe3ab4176070f6406267f6b79bfe5eb5f62ae6aeb374d90667858518";
s = "e152119cefa26826ea07ec40a428869132d70812c5578c5a260e48d6800e046a";
result = false
};
{
msg
=
"d64ea1a768b0de29ab018ae93baa645d078c70a2f7aa4acd4ae7526538ebd5f697a11927cfd0ddc9187c095f14ad30544cb63ede9353af8b23c18ce22843881fe2d7bde748fc69085921677858d87d2dc3e244f6c7e2c2b2bd791f450dfdd4ff0ddd35ab2ada4f1b90ab16ef2bf63b3fbe88ce8a5d5bb85430740d3744849c13";
qx = "8b75fc0129c9a78f8395c63ae9694b05cd6950665cf5da7d66118de451422624";
qy = "b394171981d4896d6e1b4ef2336d9befe7d27e1eb87f1c14b8ddda622af379dc";
r = "17e298e67ad2af76f6892fdcead00a88256573868f79dc74431b55103058f0b0";
s = "881328cd91e43d30133f6e471e0b9b04353b17893fb7614fd7333d812a3df6b4";
result = false
};
{
msg
=
"1db85445c9d8d1478a97dd9d6ffbf11ebcd2114d2ed4e8b6811171d947e7d4daedea35af6177debe2ef6d93f94ff9d770b45d458e91deb4eef59856425d7b00291aff9b6c9fa02375ec1a06f71f7548721790023301cf6ac7fee1d451228106ef4472681e652c8cd59b15d6d16f1e13440d888e265817cb4a654f7246e0980df";
qx = "76e51086e078b2b116fd1e9c6fa3d53f675ae40252fb9f0cc62817bd9ce8831d";
qy = "ca7e609a0b1d14b7c9249b53da0b2050450e2a25cb6c8f81c5311974a7efb576";
r = "23b653faaa7d4552388771931803ce939dd5ee62d3fa72b019be1b2272c85592";
s = "a03c6f5c54a10861d6b8922821708e9306fd6d5d10d566845a106539cbf4fadd";
result = false
};
{
msg
=
"918d9f420e927b3e0a55d276b8b40d8a2c5df748727ff72a438c7e6593f542274050dce727980d3ef90c8aa5c13d53f1e8d631ebb650dee11b94902bbd7c92b8186af9039c56c43f3110697792c8cd1614166f06d09cdb58dab168cc3680a8473b1a623bf85dba855eace579d9410d2c4ca5ede6dc1e3db81e233c34ae922f49";
qx = "bc7c8e09bd093468f706740a4130c544374fdc924a535ef02e9d3be6c6d3bbfa";
qy = "af3f813ae6646f5b6dbfb0f261fd42537705c800bb1647386343428a9f2e10fc";
r = "6bd7ce95af25abfbf14aef4b17392f1da877ab562eca38d785fe39682e9c9324";
s = "6688bea20c87bab34d420642da9bdd4c69456bdec50835887367bb4fb7cd8650";
result = false
};
{
msg
=
"6e2932153301a4eef680e6428929adae988c108d668a31ff55d0489947d75ff81a46bf89e84d6401f023be6e87688fbcd784d785ca846735524acb52d00452c84040a479e7cc330936441d93bbe722a9432a6e1db112b5c9403b10272cb1347fd619d463f7a9d223ad76fde06d8a6883500fb843235abff98e241bdfb5538c3e";
qx = "9cb0cf69303dafc761d4e4687b4ecf039e6d34ab964af80810d8d558a4a8d6f7";
qy = "2d51233a1788920a86ee08a1962c79efa317fb7879e297dad2146db995fa1c78";
r = "4b9f91e4285287261a1d1c923cf619cd52c175cfe7f1be60a5258c610348ba3d";
s = "28c45f901d71c41b298638ec0d6a85d7fcb0c33bbfec5a9c810846b639289a84";
result = true
};
{
msg
=
"2f48ec387f181035b350772e27f478ae6ec7487923692fae217e0f8636acd062a6ac39f7435f27a0ebcfd8187a91ef00fb68d106b8da4a1dedc5a40a4fae709e92b00fcc218de76417d75185e59dff76ec1543fb429d87c2ca8134ff5ae9b45456cad93fc67223c68293231395287dc0b756355660721a1f5df83bf5bcb8456e";
qx = "e31096c2d512fbf84f81e9bdb16f33121702897605b43a3db546f8fb695b5f6f";
qy = "6fbec6a04a8c59d61c900a851d8bf8522187d3ec2637b10fa8f377689e086bba";
r = "1b244c21c08c0c0a10477fb7a21382d405b95c755088292859ca0e71bab68361";
s = "852f4cbfd346e90f404e1dd5c4b2c1debca3ea1abefe8400685d703aea6c5c7f";
result = false
};
{
msg
=
"fd2e5de421ee46c9fe6290a33f95b394bd5b7762f23178f7f6834f1f056fa9a8831446403c098ff4dd764173f974be4c89d376119613a4a1890f6fc2ddff862bda292dd49f5410d9b1cfe1d97ef4582b6152494372fc083885f540c01f86d780e6f3e75a954af2190fdae9604e3f8ab32ab0292dc0d790bd2627e37b4b4885df";
qx = "633c2ee5630b62c9ce839efd4d485a6d35e8b9430d264ffe501d28dbace79123";
qy = "4b668a1a6d1a25b089f75c2bd8d8c6a9a14fe7b729f45a82565da2e866e2c490";
r = "bf2111c93ec055a7eda90c106fce494fd866045634fd2aa28d6e018f9106994e";
s = "86b0341208a0aa55edecfd272f49cb34408ce54b7febc1d0a1c2ce77ab6988f8";
result = false
};
{
msg
=
"4bc2d9a898395b12701635f1048fbfd263ec115e4150532b034d59e625238f4ed32619744c612e35ac5a23bee8d5f5651641a492217d305e5051321c273647f14bc7c4afab518554e01c82d6fc1694c8bdbeb326bb607bcaf5436303bc09f64c02c6ec50de409a484f5237f7d34e2651ada7ec429ca3b99dd87c6015d2f4b342";
qx = "f78dce40d1cb8c4af2749bf22c6f8a9a470b1e41112796215dd017e57df1b38a";
qy = "61b29b0bc03dff7fa00613b4de1e2317cfbf2badd50dee3376c032a887c5b865";
r = "4a96169a5dea36a2594011537ee0dc19e8f9f74e82c07434079447155a830152";
s = "a204eaa4e97d7553a1521d9f6baadc0b6d6183ba0f385d8593d6ca83607c4d82";
result = false
};
{
msg
=
"d3356a683417508a9b913643e6ceac1281ef583f428968f9d2b6540a189d7041c477da8d207d0529720f70dab6b0da8c2168837476c1c6b63b517ed3cad48ae331cf716ecf47a0f7d00b57073ac6a4749716d49d80c4d46261d38e2e34b4f43e0f20b280842f6e3ea34fefdddfb9fa2a040ffe915e8784cfdb29b3364a34ca62";
qx = "3fcc3b3e1b103fe435ac214c756bdaad309389e1c803e6d84bbbc27039fcf900";
qy = "7f09edd1ec87a6d36dc81c1528d52a62776e666c274415a9f441d6a8df6b9237";
r = "1cac13f277354456ae67ab09b09e07eb1af2a2bf45108da70f5c8c6a4cbcd538";
s = "5d83752e540525602ba7e6fee4d4263f3eda59e67df20aac79ca67e8899fed0d";
result = false
};
{
msg
=
"d7f5da9f4cf9299b7f86c52b88364ce28fe9ada55dd551a1018790f9e1205e2405ac62429d65093f74ec35a16d9f195c993cd4eb8dc0aa0dabb70a503321d8a9649160d6b3d0a0854bb68c4c39693f592ef5dd478aa2432d0865d87d48b3aea9c7d7d114165c9200e4e8d7bd02a7895ec4418e6f2fed6b244bf66209039e98a9";
qx = "5ec702d43a67ada86efbfc136cf16d96078906954a3f1f9e440674cd907e4676";
qy = "05a62044fed8470dd4fca38d89d583ce36d50d28b66ab0b51922b21da92c56d9";
r = "75f3037298f1457dba55743999976a1c2636b2b8ab2ed3df4736a6d2934acc83";
s = "19d43ad168dda1bb8ac423f8f08876515234b3d841e57faef1b5ab27359b27ef";
result = false
};
{
msg
=
"68f4b444e1cc2025e8ff55e8046ead735e6e317082edf7ce65e83573501cb92c408c1c1c6c4fcca6b96ad34224f17b20be471cc9f4f97f0a5b7bfae9558bdb2ecb6e452bb743603724273d9e8d2ca22afdda35c8a371b28153d772303e4a25dc4f28e9a6dc9635331450f5af290dfa3431c3c08b91d5c97284361c03ec78f1bc";
qx = "f63afe99e1b5fc652782f86b59926af22e6072be93390fe41f541204f9c935d1";
qy = "f6e19ce5935e336183c21becf66596b8f559d2d02ee282aa87a7d6f936f7260c";
r = "cef4831e4515c77ca062282614b54a11b7dc4057e6997685c2fbfa95b392bf72";
s = "f20dc01bf38e1344ba675a22239d9893b3a3e33d9a403329a3d21650e9125b75";
result = true
};
{
msg
=
"e75be05be0aaf70719b488b89aaae9008707ca528994461db7130c4368575a024bf0981c305d61265e8b97599ec35c03badd1256b80d6bf70547ad6089b983e3bcc3481828f3259e43e655e177fc423fd7e066bd3ed68d81df84f773c0f9e5f8bf4469960b8b4d7b2a372fd0edd3521f6be670908f2d90a343f416358ea70e7e";
qx = "6d11b09d2767cf8d275faee746c203486259f66dd2bfa3a65c39371a66b23385";
qy = "4eb05c73e05261e979182833f20311e5366f72f4b949665ff294f959375534c6";
r = "15a697cdb614e11c0810e1e764cd501fcabc70874c957587bc4883d9438e177f";
s = "7bf6244f92bc768063cecb5336c8eaacd23db930b28703560f241c7d93950dfd";
result = false
};
{
msg
=
"0dc4a3eab66bd2e703a8fff566c34d466f9823ae42bd2104f61a6b051c0b017833fcef4d609d137ad97c209c80eebe252857aa7fafc35f16000a2bd4b4be0fa83b6e229eddfd180101f1f40d0453148053d8306833df64d59599b90194b55541d7f22dd589da9f7be519cbbb9db416c71bfe40ec090b5b7a600eec29bfd47306";
qx = "f3899caba038efb534c4cea0bd276814ffd80194473c903b81af11c8c05cb6e6";
qy = "6ea6b17402fcf2e8e737d11ffc7c2ed3b2d0bc3b8f271a381f4294cff62682c3";
r = "57b99380452e1d37b133c49b9ba493dee8630940477ca3351a43d90b99871e6a";
s = "df599c3a37105af3ecc159b3b685ccb3e151b7d5cf2d97147974ae71f466b615";
result = false
};
{
msg
=
"d55e5e124a7217879ca986f285e22ac51940b35959bbf5543104b5547356fd1a0ec37c0a23209004a2ec5bcaf3335bc45e4dc990eacd29b2d9b5cf349c7ba67711356299bceab6f048df761c65f2988803133d6723a2820fefb2654cc7c5f032f833ba78a34d2878c6b0ba654ebe26b110c935abb56024bd5d0f09b367724c07";
qx = "1fd6f4b98d0755291e7a230e9f81ecf909e6350aadb08e42a3262ff19200fbd2";
qy = "5578fef79bc477acfb8ed0dc10c4f5809c14dc5492405b3792a7940650b305d7";
r = "97a99e96e407b3ada2c2dcf9ceeeb984d9a4d0aa66ddf0a74ca23cabfb1566cc";
s = "0ecac315dc199cfea3c15348c130924a1f787019fe4cd3ae47ca8b111268754a";
result = false
};
{
msg
=
"7753c03b4202cb38bc0190a9f931eb31858d705d92d650320ff449fc99167fb3770b764c8988f6b34ac5a3d507a10e0aff7f88293f6a22c7ed8a24248a52dc125e416e158833fc38af29199f8ca4931068d4ccaa87e299e95642068f68c208cb782df13908f950564743ed1692502bafafaff169dc8fe674fb5e4f3ffd578c35";
qx = "2dcbd8790cee552e9f18f2b3149a2252dcd58b99ca7dc9680b92c8c43aa33874";
qy = "5dbc8bb8813c8e019d80e19acdb0792f537980fecde93db621aaf1f6d0e6ee34";
r = "2bdbd8b0d759595662cc10b10236136ef6ce429641f68cf6480f472fcc77bc9f";
s = "7e7df0c8b86f7db06caf1610166f7b9c4c75447f991d5aaf4dea720c25985c8c";
result = true
}
] | false |
Spec.ECDSA.Test.Vectors.fst | Spec.ECDSA.Test.Vectors.siggen_vectors_sha2_512 | val siggen_vectors_sha2_512:list vec_SigGen | val siggen_vectors_sha2_512:list vec_SigGen | let siggen_vectors_sha2_512 : list vec_SigGen = [
{ msg' = "6c8572b6a3a4a9e8e03dbeed99334d41661b8a8417074f335ab1845f6cc852adb8c01d9820fcf8e10699cc827a8fbdca2cbd46cc66e4e6b7ba41ec3efa733587e4a30ec552cd8ddab8163e148e50f4d090782897f3ddac84a41e1fcfe8c56b6152c0097b0d634b41011471ffd004f43eb4aafc038197ec6bae2b4470e869bded";
d = "9dd0d3a3d514c2a8adb162b81e3adfba3299309f7d2018f607bdb15b1a25f499";
qx' = "6b738de3398b6ac57b9591f9d7985dd4f32137ad3460dcf8970c1390cb9eaf8d";
qy' = "83bc61e26d2bbbd3cf2d2ab445a2bc4ab5dde41f4a13078fd1d3cc36ab596d57";
k = "9106192170ccb3c64684d48287bb81bbed51b40d503462c900e5c7aae43e380a";
r' = "275fa760878b4dc05e9d157fedfd8e9b1c9c861222a712748cb4b7754c043fb1";
s' = "699d906bb8435a05345af3b37e3b357786939e94caae257852f0503adb1e0f7e";
};
{ msg' = "7e3c8fe162d48cc8c5b11b5e5ebc05ebc45c439bdbc0b0902145921b8383037cb0812222031598cd1a56fa71694fbd304cc62938233465ec39c6e49f57dfe823983b6923c4e865633949183e6b90e9e06d8275f3907d97967d47b6239fe2847b7d49cf16ba69d2862083cf1bccf7afe34fdc90e21998964107b64abe6b89d126";
d = "f9bf909b7973bf0e3dad0e43dcb2d7fa8bda49dbe6e5357f8f0e2bd119be30e6";
qx' = "f2a6674d4e86152a527199bed293fa63acde1b4d8a92b62e552210ba45c38792";
qy' = "c72565c24f0eee6a094af341ddd8579747b865f91c8ed5b44cda8a19cc93776f";
k = "e547791f7185850f03d0c58419648f65b9d29cdc22ed1de2a64280220cfcafba";
r' = "4782903d2aaf8b190dab5cae2223388d2d8bd845b3875d37485c54e1ded1d3d8";
s' = "dfb40e406bfa074f0bf832771b2b9f186e2211f0bca279644a0ca8559acf39da";
};
{ msg' = "d5aa8ac9218ca661cd177756af6fbb5a40a3fecfd4eea6d5872fbb9a2884784aa9b5f0c023a6e0da5cf6364754ee6465b4ee2d0ddc745b02994c98427a213c849537da5a4477b3abfe02648be67f26e80b56a33150490d062aaac137aa47f11cfeddba855bab9e4e028532a563326d927f9e6e3292b1fb248ee90b6f429798db";
d = "724567d21ef682dfc6dc4d46853880cfa86fe6fea0efd51fac456f03c3d36ead";
qx' = "70b877b5e365fcf08140b1eca119baba662879f38e059d074a2cb60b03ea5d39";
qy' = "5f56f94d591df40b9f3b8763ac4b3dbe622c956d5bd0c55658b6f46fa3deb201";
k = "79d6c967ed23c763ece9ca4b026218004c84dc2d4ccc86cf05c5d0f791f6279b";
r' = "2ba2ea2d316f8937f184ad3028e364574d20a202e4e7513d7af57ac2456804d1";
s' = "64fe94968d18c5967c799e0349041b9e40e6c6c92ebb475e80dd82f51cf07320";
};
{ msg' = "790b06054afc9c3fc4dfe72df19dd5d68d108cfcfca6212804f6d534fd2fbe489bd8f64bf205ce04bcb50124a12ce5238fc3fe7dd76e6fa640206af52549f133d593a1bfd423ab737f3326fa79433cde293236f90d4238f0dd38ed69492ddbd9c3eae583b6325a95dec3166fe52b21658293d8c137830ef45297d67813b7a508";
d = "29c5d54d7d1f099d50f949bfce8d6073dae059c5a19cc70834722f18a7199edd";
qx' = "3088d4f45d274cc5f418c8ecc4cbcf96be87491f420250f8cbc01cdf2503ec47";
qy' = "634db48198129237ed068c88ff5809f6211921a6258f548f4b64dd125921b78b";
k = "0508ad7774908b5705895fda5c3b7a3032bf85dab7232bf981177019f3d76460";
r' = "acd9f3b63626c5f32103e90e1dd1695907b1904aa9b14f2132caef331321971b";
s' = "15c04a8bd6c13ed5e9961814b2f406f064670153e4d5465dcef63c1d9dd52a87";
};
{ msg' = "6d549aa87afdb8bfa60d22a68e2783b27e8db46041e4df04be0c261c4734b608a96f198d1cdb8d082ae48579ec9defcf21fbc72803764a58c31e5323d5452b9fb57c8991d31749140da7ef067b18bf0d7dfbae6eefd0d8064f334bf7e9ec1e028daed4e86e17635ec2e409a3ed1238048a45882c5c57501b314e636b9bc81cbe";
d = "0d8095da1abba06b0d349c226511f642dabbf1043ad41baa4e14297afe8a3117";
qx' = "75a45758ced45ecf55f755cb56ca2601d794ebeaeb2e6107fe2fc443f580e23c";
qy' = "5303d47d5a75ec821d51a2ee7548448208c699eca0cd89810ffc1aa4faf81ead";
k = "5165c54def4026ab648f7768c4f1488bcb183f6db7ffe02c7022a529a116482a";
r' = "ebc85fc4176b446b3384ccc62fc2526b45665561a0e7e9404ac376c90e450b59";
s' = "8b2c09428e62c5109d17ed0cf8f9fd7c370d018a2a73f701effc9b17d04852c6";
};
{ msg' = "1906e48b7f889ee3ff7ab0807a7aa88f53f4018808870bfed6372a77330c737647961324c2b4d46f6ee8b01190474951a701b048ae86579ff8e3fc889fecf926b17f98958ac7534e6e781ca2db2baa380dec766cfb2a3eca2a9d5818967d64dfab84f768d24ec122eebacaab0a4dc3a75f37331bb1c43dd8966cc09ec4945bbd";
d = "52fe57da3427b1a75cb816f61c4e8e0e0551b94c01382b1a80837940ed579e61";
qx' = "2177e20a2092a46667debdcc21e7e45d6da72f124adecbc5ada6a7bcc7b401d5";
qy' = "550e468f2626070a080afeeb98edd75a721eb773c8e62149f3e903cf9c4d7b61";
k = "0464fe9674b01ff5bd8be21af3399fad66f90ad30f4e8ee6e2eb9bcccfd5185c";
r' = "f8250f073f34034c1cde58f69a85e2f5a030703ebdd4dbfb98d3b3690db7d114";
s' = "a9e83e05f1d6e0fef782f186bedf43684c825ac480174d48b0e4d31505e27498";
};
{ msg' = "7b59fef13daf01afec35dea3276541be681c4916767f34d4e874464d20979863ee77ad0fd1635bcdf93e9f62ed69ae52ec90aab5bbf87f8951213747ccec9f38c775c1df1e9d7f735c2ce39b42edb3b0c5086247556cfea539995c5d9689765288ec600848ecf085c01ca738bbef11f5d12d4457db988b4add90be00781024ad";
d = "003d91611445919f59bfe3ca71fe0bfdeb0e39a7195e83ac03a37c7eceef0df2";
qx' = "7b9c592f61aae0555855d0b9ebb6fd00fb6746e8842e2523565c858630b9ba00";
qy' = "d35b2e168b1875bbc563bea5e8d63c4e38957c774a65e762959a349eaf263ba0";
k = "ef9df291ea27a4b45708f7608723c27d7d56b7df0599a54bc2c2fabbff373b40";
r' = "66d057fd39958b0e4932bacd70a1769bbadcb62e4470937b45497a3d4500fabb";
s' = "6c853b889e18b5a49ee54b54dd1aaedfdd642e30eba171c5cab677f0df9e7318";
};
{ msg' = "041a6767a935dc3d8985eb4e608b0cbfebe7f93789d4200bcfe595277ac2b0f402889b580b72def5da778a680fd380c955421f626d52dd9a83ea180187b850e1b72a4ec6dd63235e598fd15a9b19f8ce9aec1d23f0bd6ea4d92360d50f951152bc9a01354732ba0cf90aaed33c307c1de8fa3d14f9489151b8377b57c7215f0b";
d = "48f13d393899cd835c4193670ec62f28e4c4903e0bbe5817bf0996831a720bb7";
qx' = "82a1a96f4648393c5e42633ecdeb1d8245c78c5ea236b5bab460dedcc8924bc0";
qy' = "e8cbf03c34b5154f876de19f3bb6fd43cd2eabf6e7c95467bcfa8c8fc42d76fd";
k = "efed736e627899fea944007eea39a4a63c0c2e26491cd12adb546be3e5c68f7d";
r' = "cf7fc24bdaa09ac0cca8497e13298b961380668613c7493954048c06385a7044";
s' = "f38b1c8306cf82ab76ee3a772b14416b49993fe11f986e9b0f0593c52ec91525";
};
{ msg' = "7905a9036e022c78b2c9efd40b77b0a194fbc1d45462779b0b76ad30dc52c564e48a493d8249a061e62f26f453ba566538a4d43c64fb9fdbd1f36409316433c6f074e1b47b544a847de25fc67d81ac801ed9f7371a43da39001c90766f943e629d74d0436ba1240c3d7fab990d586a6d6ef1771786722df56448815f2feda48f";
d = "95c99cf9ec26480275f23de419e41bb779590f0eab5cf9095d37dd70cb75e870";
qx' = "42c292b0fbcc9f457ae361d940a9d45ad9427431a105a6e5cd90a345fe3507f7";
qy' = "313b08fd2fa351908b3178051ee782cc62b9954ad95d4119aa564900f8ade70c";
k = "4c08dd0f8b72ae9c674e1e448d4e2afe3a1ee69927fa23bbff3716f0b99553b7";
r' = "f2bc35eb1b8488b9e8d4a1dbb200e1abcb855458e1557dc1bf988278a174eb3b";
s' = "ed9a2ec043a1d578e8eba6f57217976310e8674385ad2da08d6146c629de1cd9";
};
{ msg' = "cf25e4642d4f39d15afb7aec79469d82fc9aedb8f89964e79b749a852d931d37436502804e39555f5a3c75dd958fd5291ada647c1a5e38fe7b1048f16f2b711fdd5d39acc0812ca65bd50d7f8119f2fd195ab16633503a78ee9102c1f9c4c22568e0b54bd4fa3f5ff7b49160bf23e7e2231b1ebebbdaf0e4a7d4484158a87e07";
d = "e15e835d0e2217bc7c6f05a498f20af1cd56f2f165c23d225eb3360aa2c5cbcf";
qx' = "89dd22052ec3ab4840206a62f2270c21e7836d1a9109a3407dd0974c7802b9ae";
qy' = "e91609ba35c7008b080c77a9068d97a14ca77b97299e74945217672b2fd5faf0";
k = "c9f621441c235fc47ec34eef4c08625df1ec74918e1f86075b753f2589f4c60b";
r' = "a70d1a2d555d599bfb8c9b1f0d43725341151d17a8d0845fa56f3563703528a7";
s' = "4e05c45adf41783e394a5312f86e66871c4be4896948c85966879d5c66d54b37";
};
{ msg' = "7562c445b35883cc937be6349b4cefc3556a80255d70f09e28c3f393daac19442a7eecedcdfbe8f7628e30cd8939537ec56d5c9645d43340eb4e78fc5dd4322de8a07966b262770d7ff13a071ff3dce560718e60ed3086b7e0003a6abafe91af90af86733ce8689440bf73d2aa0acfe9776036e877599acbabfcb03bb3b50faa";
d = "808c08c0d77423a6feaaffc8f98a2948f17726e67c15eeae4e672edbe388f98c";
qx' = "b0c0ad5e1f6001d8e9018ec611b2e3b91923e69fa6c98690ab644d650f640c42";
qy' = "610539c0b9ed21ac0a2f27527c1a61d9b47cbf033187b1a6ada006eb5b2662ed";
k = "1f6d4a905c761a53d54c362976717d0d7fc94d222bb5489e4830080a1a67535d";
r' = "83404dcf8320baf206381800071e6a75160342d19743b4f176960d669dd03d07";
s' = "3f75dcf102008b2989f81683ae45e9f1d4b67a6ef6fd5c8af44828af80e1cfb5";
};
{ msg' = "051c2db8e71e44653ea1cb0afc9e0abdf12658e9e761bfb767c20c7ab4adfcb18ed9b5c372a3ac11d8a43c55f7f99b33355437891686d42362abd71db8b6d84dd694d6982f0612178a937aa934b9ac3c0794c39027bdd767841c4370666c80dbc0f8132ca27474f553d266deefd7c9dbad6d734f9006bb557567701bb7e6a7c9";
d = "f7c6315f0081acd8f09c7a2c3ec1b7ece20180b0a6365a27dcd8f71b729558f9";
qx' = "250f7112d381c1751860045d9bcaf20dbeb25a001431f96ac6f19109362ffebb";
qy' = "49fba9efe73546135a5a31ab3753e247034741ce839d3d94bd73936c4a17e4aa";
k = "68c299be2c0c6d52d208d5d1a9e0ffa2af19b4833271404e5876e0aa93987866";
r' = "7b195e92d2ba95911cda7570607e112d02a1c847ddaa33924734b51f5d81adab";
s' = "10d9f206755cef70ab5143ac43f3f8d38aea2644f31d52eaf3b472ee816e11e5";
};
{ msg' = "4dcb7b62ba31b866fce7c1feedf0be1f67bf611dbc2e2e86f004422f67b3bc1839c6958eb1dc3ead137c3d7f88aa97244577a775c8021b1642a8647bba82871e3c15d0749ed343ea6cad38f123835d8ef66b0719273105e924e8685b65fd5dc430efbc35b05a6097f17ebc5943cdcd9abcba752b7f8f37027409bd6e11cd158f";
d = "f547735a9409386dbff719ce2dae03c50cb437d6b30cc7fa3ea20d9aec17e5a5";
qx' = "4ca87c5845fb04c2f76ae3273073b0523e356a445e4e95737260eba9e2d021db";
qy' = "0f86475d07f82655320fdf2cd8db23b21905b1b1f2f9c48e2df87e24119c4880";
k = "91bd7d97f7ed3253cedefc144771bb8acbbda6eb24f9d752bbe1dd018e1384c7";
r' = "008c1755d3df81e64e25270dbaa9396641556df7ffc7ac9add6739c382705397";
s' = "77df443c729b039aded5b516b1077fecdd9986402d2c4b01734ba91e055e87fc";
};
{ msg' = "efe55737771070d5ac79236b04e3fbaf4f2e9bed187d1930680fcf1aba769674bf426310f21245006f528779347d28b8aeacd2b1d5e3456dcbf188b2be8c07f19219e4067c1e7c9714784285d8bac79a76b56f2e2676ea93994f11eb573af1d03fc8ed1118eafc7f07a82f3263c33eb85e497e18f435d4076a774f42d276c323";
d = "26a1aa4b927a516b661986895aff58f40b78cc5d0c767eda7eaa3dbb835b5628";
qx' = "28afa3b0f81a0e95ad302f487a9b679fcdef8d3f40236ec4d4dbf4bb0cbba8b2";
qy' = "bb4ac1be8405cbae8a553fbc28e29e2e689fabe7def26d653a1dafc023f3cecf";
k = "f98e1933c7fad4acbe94d95c1b013e1d6931fa8f67e6dbb677b564ef7c3e56ce";
r' = "15a9a5412d6a03edd71b84c121ce9a94cdd166e40da9ce4d79f1afff6a395a53";
s' = "86bbc2b6c63bad706ec0b093578e3f064736ec69c0dba59b9e3e7f73762a4dc3";
};
{ msg' = "ea95859cc13cccb37198d919803be89c2ee10befdcaf5d5afa09dcc529d333ae1e4ffd3bd8ba8642203badd7a80a3f77eeee9402eed365d53f05c1a995c536f8236ba6b6ff8897393506660cc8ea82b2163aa6a1855251c87d935e23857fe35b889427b449de7274d7754bdeace960b4303c5dd5f745a5cfd580293d6548c832";
d = "6a5ca39aae2d45aa331f18a8598a3f2db32781f7c92efd4f64ee3bbe0c4c4e49";
qx' = "c62cc4a39ace01006ad48cf49a3e71466955bbeeca5d318d672695df926b3aa4";
qy' = "c85ccf517bf2ebd9ad6a9e99254def0d74d1d2fd611e328b4a3988d4f045fe6f";
k = "dac00c462bc85bf39c31b5e01df33e2ec1569e6efcb334bf18f0951992ac6160";
r' = "6e7ff8ec7a5c48e0877224a9fa8481283de45fcbee23b4c252b0c622442c26ad";
s' = "3dfac320b9c873318117da6bd856000a392b815659e5aa2a6a1852ccb2501df3";
};
] | {
"file_name": "specs/tests/p256/Spec.ECDSA.Test.Vectors.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 1,
"end_line": 728,
"start_col": 1,
"start_line": 607
} | module Spec.ECDSA.Test.Vectors
open Lib.Meta
#set-options "--fuel 0 --ifuel 0"
///
/// ECDSA test vectors from NIST CAVP
/// https://csrc.nist.gov/Projects/Cryptographic-Algorithm-Validation-Program/Digital-Signatures#ecdsa2vs
///
type vec_SigVer = {
msg: hex_string;
qx: hex_string;
qy: hex_string;
r: hex_string;
s: hex_string;
result: bool;
}
type vec_SigGen = {
msg': hex_string;
d: hex_string;
qx': hex_string;
qy': hex_string;
k: hex_string;
r': hex_string;
s': hex_string;
}
let sigver_vectors_sha2_256 : list vec_SigVer = [
{ msg = "e4796db5f785f207aa30d311693b3702821dff1168fd2e04c0836825aefd850d9aa60326d88cde1a23c7745351392ca2288d632c264f197d05cd424a30336c19fd09bb229654f0222fcb881a4b35c290a093ac159ce13409111ff0358411133c24f5b8e2090d6db6558afc36f06ca1f6ef779785adba68db27a409859fc4c4a0";
qx = "87f8f2b218f49845f6f10eec3877136269f5c1a54736dbdf69f89940cad41555";
qy = "e15f369036f49842fac7a86c8a2b0557609776814448b8f5e84aa9f4395205e9";
r = "d19ff48b324915576416097d2544f7cbdf8768b1454ad20e0baac50e211f23b0";
s = "a3e81e59311cdfff2d4784949f7a2cb50ba6c3a91fa54710568e61aca3e847c6";
result = false;
};
{ msg = "069a6e6b93dfee6df6ef6997cd80dd2182c36653cef10c655d524585655462d683877f95ecc6d6c81623d8fac4e900ed0019964094e7de91f1481989ae1873004565789cbf5dc56c62aedc63f62f3b894c9c6f7788c8ecaadc9bd0e81ad91b2b3569ea12260e93924fdddd3972af5273198f5efda0746219475017557616170e";
qx = "5cf02a00d205bdfee2016f7421807fc38ae69e6b7ccd064ee689fc1a94a9f7d2";
qy = "ec530ce3cc5c9d1af463f264d685afe2b4db4b5828d7e61b748930f3ce622a85";
r = "dc23d130c6117fb5751201455e99f36f59aba1a6a21cf2d0e7481a97451d6693";
s = "d6ce7708c18dbf35d4f8aa7240922dc6823f2e7058cbc1484fcad1599db5018c";
result = false;
};
{ msg = "df04a346cf4d0e331a6db78cca2d456d31b0a000aa51441defdb97bbeb20b94d8d746429a393ba88840d661615e07def615a342abedfa4ce912e562af714959896858af817317a840dcff85a057bb91a3c2bf90105500362754a6dd321cdd86128cfc5f04667b57aa78c112411e42da304f1012d48cd6a7052d7de44ebcc01de";
qx = "2ddfd145767883ffbb0ac003ab4a44346d08fa2570b3120dcce94562422244cb";
qy = "5f70c7d11ac2b7a435ccfbbae02c3df1ea6b532cc0e9db74f93fffca7c6f9a64";
r = "9913111cff6f20c5bf453a99cd2c2019a4e749a49724a08774d14e4c113edda8";
s = "9467cd4cd21ecb56b0cab0a9a453b43386845459127a952421f5c6382866c5cc";
result = false;
};
{ msg = "e1130af6a38ccb412a9c8d13e15dbfc9e69a16385af3c3f1e5da954fd5e7c45fd75e2b8c36699228e92840c0562fbf3772f07e17f1add56588dd45f7450e1217ad239922dd9c32695dc71ff2424ca0dec1321aa47064a044b7fe3c2b97d03ce470a592304c5ef21eed9f93da56bb232d1eeb0035f9bf0dfafdcc4606272b20a3";
qx = "e424dc61d4bb3cb7ef4344a7f8957a0c5134e16f7a67c074f82e6e12f49abf3c";
qy = "970eed7aa2bc48651545949de1dddaf0127e5965ac85d1243d6f60e7dfaee927";
r = "bf96b99aa49c705c910be33142017c642ff540c76349b9dab72f981fd9347f4f";
s = "17c55095819089c2e03b9cd415abdf12444e323075d98f31920b9e0f57ec871c";
result = true;
};
{ msg = "73c5f6a67456ae48209b5f85d1e7de7758bf235300c6ae2bdceb1dcb27a7730fb68c950b7fcada0ecc4661d3578230f225a875e69aaa17f1e71c6be5c831f22663bac63d0c7a9635edb0043ff8c6f26470f02a7bc56556f1437f06dfa27b487a6c4290d8bad38d4879b334e341ba092dde4e4ae694a9c09302e2dbf443581c08";
qx = "e0fc6a6f50e1c57475673ee54e3a57f9a49f3328e743bf52f335e3eeaa3d2864";
qy = "7f59d689c91e463607d9194d99faf316e25432870816dde63f5d4b373f12f22a";
r = "1d75830cd36f4c9aa181b2c4221e87f176b7f05b7c87824e82e396c88315c407";
s = "cb2acb01dac96efc53a32d4a0d85d0c2e48955214783ecf50a4f0414a319c05a";
result = true;
};
{ msg = "666036d9b4a2426ed6585a4e0fd931a8761451d29ab04bd7dc6d0c5b9e38e6c2b263ff6cb837bd04399de3d757c6c7005f6d7a987063cf6d7e8cb38a4bf0d74a282572bd01d0f41e3fd066e3021575f0fa04f27b700d5b7ddddf50965993c3f9c7118ed78888da7cb221849b3260592b8e632d7c51e935a0ceae15207bedd548";
qx = "a849bef575cac3c6920fbce675c3b787136209f855de19ffe2e8d29b31a5ad86";
qy = "bf5fe4f7858f9b805bd8dcc05ad5e7fb889de2f822f3d8b41694e6c55c16b471";
r = "25acc3aa9d9e84c7abf08f73fa4195acc506491d6fc37cb9074528a7db87b9d6";
s = "9b21d5b5259ed3f2ef07dfec6cc90d3a37855d1ce122a85ba6a333f307d31537";
result = false;
};
{ msg = "7e80436bce57339ce8da1b5660149a20240b146d108deef3ec5da4ae256f8f894edcbbc57b34ce37089c0daa17f0c46cd82b5a1599314fd79d2fd2f446bd5a25b8e32fcf05b76d644573a6df4ad1dfea707b479d97237a346f1ec632ea5660efb57e8717a8628d7f82af50a4e84b11f21bdff6839196a880ae20b2a0918d58cd";
qx = "3dfb6f40f2471b29b77fdccba72d37c21bba019efa40c1c8f91ec405d7dcc5df";
qy = "f22f953f1e395a52ead7f3ae3fc47451b438117b1e04d613bc8555b7d6e6d1bb";
r = "548886278e5ec26bed811dbb72db1e154b6f17be70deb1b210107decb1ec2a5a";
s = "e93bfebd2f14f3d827ca32b464be6e69187f5edbd52def4f96599c37d58eee75";
result = false;
};
{ msg = "1669bfb657fdc62c3ddd63269787fc1c969f1850fb04c933dda063ef74a56ce13e3a649700820f0061efabf849a85d474326c8a541d99830eea8131eaea584f22d88c353965dabcdc4bf6b55949fd529507dfb803ab6b480cd73ca0ba00ca19c438849e2cea262a1c57d8f81cd257fb58e19dec7904da97d8386e87b84948169";
qx = "69b7667056e1e11d6caf6e45643f8b21e7a4bebda463c7fdbc13bc98efbd0214";
qy = "d3f9b12eb46c7c6fda0da3fc85bc1fd831557f9abc902a3be3cb3e8be7d1aa2f";
r = "288f7a1cd391842cce21f00e6f15471c04dc182fe4b14d92dc18910879799790";
s = "247b3c4e89a3bcadfea73c7bfd361def43715fa382b8c3edf4ae15d6e55e9979";
result = false;
};
{ msg = "3fe60dd9ad6caccf5a6f583b3ae65953563446c4510b70da115ffaa0ba04c076115c7043ab8733403cd69c7d14c212c655c07b43a7c71b9a4cffe22c2684788ec6870dc2013f269172c822256f9e7cc674791bf2d8486c0f5684283e1649576efc982ede17c7b74b214754d70402fb4bb45ad086cf2cf76b3d63f7fce39ac970";
qx = "bf02cbcf6d8cc26e91766d8af0b164fc5968535e84c158eb3bc4e2d79c3cc682";
qy = "069ba6cb06b49d60812066afa16ecf7b51352f2c03bd93ec220822b1f3dfba03";
r = "f5acb06c59c2b4927fb852faa07faf4b1852bbb5d06840935e849c4d293d1bad";
s = "049dab79c89cc02f1484c437f523e080a75f134917fda752f2d5ca397addfe5d";
result = false;
};
{ msg = "983a71b9994d95e876d84d28946a041f8f0a3f544cfcc055496580f1dfd4e312a2ad418fe69dbc61db230cc0c0ed97e360abab7d6ff4b81ee970a7e97466acfd9644f828ffec538abc383d0e92326d1c88c55e1f46a668a039beaa1be631a89129938c00a81a3ae46d4aecbf9707f764dbaccea3ef7665e4c4307fa0b0a3075c";
qx = "224a4d65b958f6d6afb2904863efd2a734b31798884801fcab5a590f4d6da9de";
qy = "178d51fddada62806f097aa615d33b8f2404e6b1479f5fd4859d595734d6d2b9";
r = "87b93ee2fecfda54deb8dff8e426f3c72c8864991f8ec2b3205bb3b416de93d2";
s = "4044a24df85be0cc76f21a4430b75b8e77b932a87f51e4eccbc45c263ebf8f66";
result = false;
};
{ msg = "4a8c071ac4fd0d52faa407b0fe5dab759f7394a5832127f2a3498f34aac287339e043b4ffa79528faf199dc917f7b066ad65505dab0e11e6948515052ce20cfdb892ffb8aa9bf3f1aa5be30a5bbe85823bddf70b39fd7ebd4a93a2f75472c1d4f606247a9821f1a8c45a6cb80545de2e0c6c0174e2392088c754e9c8443eb5af";
qx = "43691c7795a57ead8c5c68536fe934538d46f12889680a9cb6d055a066228369";
qy = "f8790110b3c3b281aa1eae037d4f1234aff587d903d93ba3af225c27ddc9ccac";
r = "8acd62e8c262fa50dd9840480969f4ef70f218ebf8ef9584f199031132c6b1ce";
s = "cfca7ed3d4347fb2a29e526b43c348ae1ce6c60d44f3191b6d8ea3a2d9c92154";
result = false;
};
{ msg = "0a3a12c3084c865daf1d302c78215d39bfe0b8bf28272b3c0b74beb4b7409db0718239de700785581514321c6440a4bbaea4c76fa47401e151e68cb6c29017f0bce4631290af5ea5e2bf3ed742ae110b04ade83a5dbd7358f29a85938e23d87ac8233072b79c94670ff0959f9c7f4517862ff829452096c78f5f2e9a7e4e9216";
qx = "9157dbfcf8cf385f5bb1568ad5c6e2a8652ba6dfc63bc1753edf5268cb7eb596";
qy = "972570f4313d47fc96f7c02d5594d77d46f91e949808825b3d31f029e8296405";
r = "dfaea6f297fa320b707866125c2a7d5d515b51a503bee817de9faa343cc48eeb";
s = "8f780ad713f9c3e5a4f7fa4c519833dfefc6a7432389b1e4af463961f09764f2";
result = false;
};
{ msg = "785d07a3c54f63dca11f5d1a5f496ee2c2f9288e55007e666c78b007d95cc28581dce51f490b30fa73dc9e2d45d075d7e3a95fb8a9e1465ad191904124160b7c60fa720ef4ef1c5d2998f40570ae2a870ef3e894c2bc617d8a1dc85c3c55774928c38789b4e661349d3f84d2441a3b856a76949b9f1f80bc161648a1cad5588e";
qx = "072b10c081a4c1713a294f248aef850e297991aca47fa96a7470abe3b8acfdda";
qy = "9581145cca04a0fb94cedce752c8f0370861916d2a94e7c647c5373ce6a4c8f5";
r = "09f5483eccec80f9d104815a1be9cc1a8e5b12b6eb482a65c6907b7480cf4f19";
s = "a4f90e560c5e4eb8696cb276e5165b6a9d486345dedfb094a76e8442d026378d";
result = false;
};
{ msg = "76f987ec5448dd72219bd30bf6b66b0775c80b394851a43ff1f537f140a6e7229ef8cd72ad58b1d2d20298539d6347dd5598812bc65323aceaf05228f738b5ad3e8d9fe4100fd767c2f098c77cb99c2992843ba3eed91d32444f3b6db6cd212dd4e5609548f4bb62812a920f6e2bf1581be1ebeebdd06ec4e971862cc42055ca";
qx = "09308ea5bfad6e5adf408634b3d5ce9240d35442f7fe116452aaec0d25be8c24";
qy = "f40c93e023ef494b1c3079b2d10ef67f3170740495ce2cc57f8ee4b0618b8ee5";
r = "5cc8aa7c35743ec0c23dde88dabd5e4fcd0192d2116f6926fef788cddb754e73";
s = "9c9c045ebaa1b828c32f82ace0d18daebf5e156eb7cbfdc1eff4399a8a900ae7";
result = false;
};
{ msg = "60cd64b2cd2be6c33859b94875120361a24085f3765cb8b2bf11e026fa9d8855dbe435acf7882e84f3c7857f96e2baab4d9afe4588e4a82e17a78827bfdb5ddbd1c211fbc2e6d884cddd7cb9d90d5bf4a7311b83f352508033812c776a0e00c003c7e0d628e50736c7512df0acfa9f2320bd102229f46495ae6d0857cc452a84";
qx = "2d98ea01f754d34bbc3003df5050200abf445ec728556d7ed7d5c54c55552b6d";
qy = "9b52672742d637a32add056dfd6d8792f2a33c2e69dafabea09b960bc61e230a";
r = "06108e525f845d0155bf60193222b3219c98e3d49424c2fb2a0987f825c17959";
s = "62b5cdd591e5b507e560167ba8f6f7cda74673eb315680cb89ccbc4eec477dce";
result = true;
};
]
let sigver_vectors_sha2_384 : list vec_SigVer = [
{ msg = "fe9838f007bdc6afcd626974fcc6833f06b6fd970427b962d75c2aeadbef386bec8d018106197fe2547d2af02e7a7949965d5fbc4c5db909a95b9858426a33c080b0b25dae8b56c5cbc6c4eec3dbd81635c79457eaef4fab39e662a1d05b2481eda8c1074ae2d1704c8a3f769686a1f965ef3c87602efc288c7f9ff8cd5e22a4";
qx = "40ded13dbbe72c629c38f07f7f95cf75a50e2a524897604c84fafde5e4cafb9f";
qy = "a17202e92d7d6a37c438779349fd79567d75a40ef22b7d09ca21ccf4aec9a66c";
r = "be34730c31730b4e412e6c52c23edbd36583ace2102b39afa11d24b6848cb77f";
s = "03655202d5fd8c9e3ae971b6f080640c406112fd95e7015874e9b6ee77752b10";
result = false;
};
{ msg = "b69043b9b331da392b5dd689142dfc72324265da08f14abcedf03ad8263e6bdccbc75098a2700bbba1979de84c8f12891aa0d000f8a1abad7dde4981533f21da59cc80d9cf94517f3b61d1a7d9eecb2fcf052e1fc9e7188c031b86305e4a436a37948071f046e306befb8511dc03a53dc8769a90a86e9b4fdbf05dcdfa35ab73";
qx = "1f80e19ffeb51dd74f1c397ac3dfd3415ab16ebd0847ed119e6c3b15a1a884b8";
qy = "9b395787371dbfb55d1347d7bed1c261d2908121fb78de1d1bf2d00666a62aed";
r = "249ca2c3eb6e04ac57334c2f75dc5e658bbb485bf187100774f5099dd13ef707";
s = "97363a05202b602d13166346694e38135bbce025be94950e9233f4c8013bf5bf";
result = false;
};
{ msg = "d2fcaaede8b879c064b0aa46e68efc278a469b80a7f7e1939ec2ebc96c76206f23395967279c181fea157ebb79dfadc68e31345f07f13305c80de0d85e4330d3a45f957c5c2526b945838ce5a9c2844b6b2a665c0f70b748b1213a8cf20ba5dbdf8cab231f433da522104a5cd027d3e36bb373c4ed404d9af0cbec6f85ec2193";
qx = "ce4dcfa7384c83443ace0fb82c4ac1adfa100a9b2c7bf09f093f8b6d084e50c2";
qy = "d98ae7b91abee648d0bfde192703741ac21daad7262af418b50e406d825eb0d6";
r = "597e1e04d93a6b444ccc447a48651f17657ff43fb65fe94461d2bf816b01af40";
s = "359fe3817963548e676d6da34c2d0866aa42499237b682002889eaf8893814d2";
result = true;
};
{ msg = "06cd86481865181cef7acdc3202824970ec2d97662b519c4b588dc9e51617c068282b1a11a15bf7efc4858a2f37a3d74b05fb5790eb68338c8009b4da9b4270514d387a2e016a99ee109841e884a7909504ef31a5454e214663f830f23a5a76f91402fca5f5d61699fa874597bdbfb1ecff8f07ddbd07ef61e97d0d5262ef314";
qx = "1b677f535ac69d1acd4592c0d12fac13c9131e5a6f8ab4f9d0afdcb3a3f327e0";
qy = "5dca2c73ec89e58ef8267cba2bb5eb0f551f412f9dc087c1a6944f0ce475277a";
r = "df0b0cd76d2555d4c38b3d70bfdf964884d0beeb9f74385f0893e87d20c9642d";
s = "128299aabf1f5496112be1fe04365f5f8215b08a040abdfeca4626f4d15c005b";
result = false;
};
{ msg = "59ad297397f3503604a4a2d098a4f00a368ad95c6101b3d38f9d49d908776c5a6c8654b006adb7939ffb6c30afa325b54185d82c3cc0d836850dce54d3408b257c3a961d11fafe2b74ba8bddfc1102fa656d1028baf94c38340c26a11e992aab71ce3732271b767358671b25225926f3a4b9ec5f82c059f0c7d1446d5d9e4251";
qx = "7ffc2853f3e17887dda13b0eb43f183ce50a5ac0f8bba75fb1921172484f9b94";
qy = "4cc523d14192f80bd5b27d30b3b41e064da87bfbae15572dd382b9a176c123a2";
r = "3156176d52eb26f9391229de4251993a41b8172f78970bb70e32a245be4bb653";
s = "62827a29e12d2f29b00fb2d02dd5f2d5412e17a4455f4431a5c996881fdfc0ee";
result = false;
};
{ msg = "8215daca87e689a20392646a6511bb7b5a82d2d995ca9de89bd9d9c0b11464b7cb1e4e9a31e3e01ad8c2cd613d5a2cb44a2a8df6899fce4c282dea1e41af0df6c36be1f320036567f8d0d32aaa79c95fe53b16668f7e1a9e5d7d039ea260fd03711b7d1c177355fc52244d49ca5b238556a5541349014683cb7da326f443b752";
qx = "5569f76dc94243cde819fb6fc85144ec67e2b5d49539f62e24d406d1b68f0058";
qy = "1208c38dbe25870deab53c486f793a1e250c9d1b8e7c147ea68b71196c440730";
r = "706f2ba4025e7c06b66d6369a3f93b2fec46c51eceff42a158f7431919506cfb";
s = "b4e75ac34a96393237fc4337789e37168d79382705b248051c9c72bcbac5f516";
result = false;
};
{ msg = "a996b1fb800f692517a2eb80e837233193dd3e82484d3f49bd19ee0db8f7b440876b07e384c90aa8b9f7b6603ca0b5a4e06c1da0edb974a2fb9b6e7c720ddf3e5c0e314c2d189402903c08c0836776c361a284db887ebcc33e615de9720b01dadade585eef687b3346468bdafb490e56d657a9e7d44d92014069005a36c1cf63";
qx = "e4b470c65b2c04db060d7105ec6911589863d3c7f7ce48726ba3f369ea3467e8";
qy = "44c38d3ae098de05f5915a5868c17fee296a6e150beb1f000df5f3bec8fc4532";
r = "c9c347ee5717e4c759ddaf09e86f4e1db2c8658593177cfda4e6514b5e3ecb87";
s = "baae01e9e44a7b04d69c8eaaed77c9e3a36ce8962f95cc50a0db146b4e49eb40";
result = false;
};
{ msg = "1a6e49a377a08e992353d6acc557b687b1b69a41d83d43a75fadb97b8c928cfebadebaaf99ea7fb13148807f56ea17384a7912e578e62b1b009fefb2aafca5ac85539433619b286f10643a56f8dfa47ba4d01c02510deaec18029ea6b9682022b139dcb70814164c4c90ec717ad9d925485398531cdd5992a2524498b337f97d";
qx = "96050c5fa2ddd1b2e5451d89ee74a0b7b54347364ddc0231715a6ef1146fe8dc";
qy = "e0888a9e78aeea87f6e1e9002b2651169f36c4ee53013cfc8c9912b7fd504858";
r = "2353d6cd3c21b8ea7dbc1cd940519812dbe365a3b15cd6aebba9d11cf269867a";
s = "85f560273cd9e82e6801e4cb1c8cd29cdac34a020da211d77453756b604b8fa7";
result = true;
};
{ msg = "3e14f737c913931bc82764ebc440b12e3ce1ffe0f858c7b8f1cbd30fbbb1644fa59be1d2cca5f64a6d7dc5ed5c4420f39227516ae8eb3019ef86274d0e4d06cde7bf5e5c413243dfc421d9f141762109810e6b6a451eeb4bd8d4be1ff111426d7e44d0a916b4fe3db3594d8dd01ae90feecf8f1e230b574180cd0b8d43a3d33b";
qx = "0c07bb79f44012299fbfd5a0f31397aaf7d757f8a38437407c1b09271c6551a0";
qy = "84fe7846d5d403dc92c0091fbd39f3c5cbca3f94c10b5cae44e2e96562131b13";
r = "49e9425f82d0a8c503009cead24e12adc9d48a08594094ca4f6d13ad1e3c571d";
s = "1f1b70aaa30a8ff639aa0935944e9b88326a213ab8fce5194c1a9dec070eb433";
result = false;
};
{ msg = "4000106127a72746db77957cbc6bfd84ae3d1d63b8190087637e93689841331e2adc1930d6df4302935f4520bbee513505cdcfca99ebc6f83af7b23b0f2e7f7defba614022ceeae9c6886e8b13f7ea253a307ac301f3536720cbe3de82ba3e98310361b61801a8304ffc91ff774948e33176ddcddf1b76437b3f02c910578d46";
qx = "71db1de1a1f38f356c91feaff5cfe395d1a5b9d23cf6aa19f38ae0bcc90a486d";
qy = "ecdd6ffb174a50f1cc792985c2f9608c399c98b8a64a69d2b5b7cdd9241f67e2";
r = "b0443b33a6f249470d2f943675009d21b9ccbead1525ae57815df86bb20470bf";
s = "316dbee27d998e09128539c269e297ac8f34b9ef8249a0619168c3495c5c1198";
result = false;
};
{ msg = "b42e547d0e7ddd5e1069bb2d158a5b4d5d9c4310942a1bfd09490311a6e684bd3c29b0dcef86a9788b4b26fed7863f3d5e5439796b5b5ffe7aa2545d0f518ad020689ca21230f3a59e7f8cca465fe21df511e78d215fa805f5f0f88938e9d198515e6b9c819930755c6c6aea5114cd2904607243051c09dd7a147756cbc204a5";
qx = "8219b225aa15472262c648cac8de9aad4173d17a231ba24352a5a1c4eea70fad";
qy = "0fee2b08ad39fbf0db0016ef2896ca99adc07efc8c415f640f3720498be26037";
r = "134fb689101aaad3954de2819d9fbd12072fe2bc36f496bbf0d13fa72114ab96";
s = "e65c232bd915b59e087e7fd5ec90bf636cfa80526345c79a0adfd75003045d6f";
result = false;
};
{ msg = "aa563223a7d5201febdf13cab80a03dce6077c26e751bc98a941196a28848abc495e0324013c9a2094fb15dc65d100c3e8a136a52c1780b395f42588900b641b6d4361432e2173195a2f60189f3fcc85f4e9659cae52576f20d1852d43c2b400deea3144c8e870e1906d677425d8c85037c7a42a9d249b2da4b516e04476bd45";
qx = "c934195de33b60cf00461fc3c45dad068e9f5f7af5c7fa78591e95aeb04e2617";
qy = "b588dd5f9965fdaa523b475c2812c251bc6973e2df21d9beaace976abf5728cb";
r = "71f302440eb4ed2a939b69e33e905e6fdc545c743458d38f7e1a1d456e35f389";
s = "54eaa0eb9cd7503b19a9658f0a04955d9f0ab20ebc8a0877e33c89ee88ad068f";
result = false;
};
{ msg = "98e4babf890f52e5a04bd2a7d79bf0ae9a71967847347d87f29fb3997454c73c7979d15b5c4f4205ec3de7835d1885fb7abcf8dcde94baf08b1d691a0c74845317286540e8c9d378fefaa4762c302492f51023c0d7adbb1cc90b7b0335f11203664e71fea621bc2f59d2dbd0ee76d6597ec75510de59b6d25fa6750a71c59435";
qx = "9e1adcd48e2e3f0e4c213501808228e587c40558f52bb54ddbb6102d4048ea92";
qy = "34eff98704790938e7e0bdf87ae39807a6b77dfdc9ecdfe6dd0f241abae1aeb2";
r = "ce4f0d7480522c8dd1b02dd0eb382f22406642f038c1ede9411883d72b3e7ed0";
s = "8546e1ee3b77f9927cdaccbc2f1cf19d6b5576b0f738bb1b86a0c66b39ca56fb";
result = false;
};
{ msg = "bb6b03ad60d6ddbf0c4d17246206e61c886f916d252bb4608149da49cef9033484080e861f91bb2400baa0cd6c5d90c2f275e2fabc12d83847f7a1c3ff0eb40c8a3dd83d07d194ba3797d27238415a2f358d7292a1991af687bcb977486980f9138b3140321485638ac7bd22ecda00ffe5009b83b90397eff24ecf22c5495d67";
qx = "93edbecb0b019c2cc03060f54cb4904b920fdb34eb83badd752be9443036ae13";
qy = "b494e9295e080a9080fe7e73249b3a5904aa84e1c028121eecd3e2cf1a55f598";
r = "eec2986d47b71995892b0915d3d5becc4dcb2ab55206d772e0189541b2184ddf";
s = "8a6c1edeb6452627ad27c8319599c54ac44cdd831ea66f13f49d90affe6ad45b";
result = true;
};
{ msg = "33a5d489f671f396c776bc1acf193bc9a74306f4692dd8e05bcdfe28fdefbd5c09b831c204a1dec81d8e3541f324f7b474d692789013bb1eca066f82fbf3f1cf3ba64e9d8963e9ecc180b9251919e2e8a1ab05847a0d76ff67a47c00e170e38e5b319a56f59cc51038f90961ea27a9a7eb292a0a1aa2f4972568669246907a35";
qx = "3205bae876f9bd50b0713959e72457165e826cbbe3895d67320909daa48b0ebc";
qy = "d1592562273e5e0f57bbfb92cedd9af7f133255684ee050af9b6f02019bbcafa";
r = "0124f3f1c61ec458561a4eaa6c155bd29e59703d14556324924683db3a4cf43b";
s = "688a5c5fc0c7ba92210c50cce5b512a468a880e05acc21ca56571d89f45f603a";
result = false;
};
]
let sigver_vectors_sha2_512 : list vec_SigVer = [
{ msg = "273b063224ab48a1bf6c7efc93429d1f89de48fc4a4fa3ffe7a49ebba1a58ff5d208a9e4bff27b418252526243ba042d1605b6df3c2ec916ceef027853a41137f7bfb6fc63844de95f58e82b9ad2565f1367d2c69bd29100f6db21a8ab7ab58affd1661add0322bd915721378df9fa233ef0b7e0a0a85be31689e21891ec8977";
qx = "484e31e69ef70bb8527853c22c6b6b4cd2a51311dde66c7b63f097dbb6ab27bf";
qy = "e1ff8177f4061d4fbbacbbc70519f0fc8c8b6053d72af0fe4f048d615004f74e";
r = "91a303d8fe3ab4176070f6406267f6b79bfe5eb5f62ae6aeb374d90667858518";
s = "e152119cefa26826ea07ec40a428869132d70812c5578c5a260e48d6800e046a";
result = false;
};
{ msg = "d64ea1a768b0de29ab018ae93baa645d078c70a2f7aa4acd4ae7526538ebd5f697a11927cfd0ddc9187c095f14ad30544cb63ede9353af8b23c18ce22843881fe2d7bde748fc69085921677858d87d2dc3e244f6c7e2c2b2bd791f450dfdd4ff0ddd35ab2ada4f1b90ab16ef2bf63b3fbe88ce8a5d5bb85430740d3744849c13";
qx = "8b75fc0129c9a78f8395c63ae9694b05cd6950665cf5da7d66118de451422624";
qy = "b394171981d4896d6e1b4ef2336d9befe7d27e1eb87f1c14b8ddda622af379dc";
r = "17e298e67ad2af76f6892fdcead00a88256573868f79dc74431b55103058f0b0";
s = "881328cd91e43d30133f6e471e0b9b04353b17893fb7614fd7333d812a3df6b4";
result = false;
};
{ msg = "1db85445c9d8d1478a97dd9d6ffbf11ebcd2114d2ed4e8b6811171d947e7d4daedea35af6177debe2ef6d93f94ff9d770b45d458e91deb4eef59856425d7b00291aff9b6c9fa02375ec1a06f71f7548721790023301cf6ac7fee1d451228106ef4472681e652c8cd59b15d6d16f1e13440d888e265817cb4a654f7246e0980df";
qx = "76e51086e078b2b116fd1e9c6fa3d53f675ae40252fb9f0cc62817bd9ce8831d";
qy = "ca7e609a0b1d14b7c9249b53da0b2050450e2a25cb6c8f81c5311974a7efb576";
r = "23b653faaa7d4552388771931803ce939dd5ee62d3fa72b019be1b2272c85592";
s = "a03c6f5c54a10861d6b8922821708e9306fd6d5d10d566845a106539cbf4fadd";
result = false;
};
{ msg = "918d9f420e927b3e0a55d276b8b40d8a2c5df748727ff72a438c7e6593f542274050dce727980d3ef90c8aa5c13d53f1e8d631ebb650dee11b94902bbd7c92b8186af9039c56c43f3110697792c8cd1614166f06d09cdb58dab168cc3680a8473b1a623bf85dba855eace579d9410d2c4ca5ede6dc1e3db81e233c34ae922f49";
qx = "bc7c8e09bd093468f706740a4130c544374fdc924a535ef02e9d3be6c6d3bbfa";
qy = "af3f813ae6646f5b6dbfb0f261fd42537705c800bb1647386343428a9f2e10fc";
r = "6bd7ce95af25abfbf14aef4b17392f1da877ab562eca38d785fe39682e9c9324";
s = "6688bea20c87bab34d420642da9bdd4c69456bdec50835887367bb4fb7cd8650";
result = false;
};
{ msg = "6e2932153301a4eef680e6428929adae988c108d668a31ff55d0489947d75ff81a46bf89e84d6401f023be6e87688fbcd784d785ca846735524acb52d00452c84040a479e7cc330936441d93bbe722a9432a6e1db112b5c9403b10272cb1347fd619d463f7a9d223ad76fde06d8a6883500fb843235abff98e241bdfb5538c3e";
qx = "9cb0cf69303dafc761d4e4687b4ecf039e6d34ab964af80810d8d558a4a8d6f7";
qy = "2d51233a1788920a86ee08a1962c79efa317fb7879e297dad2146db995fa1c78";
r = "4b9f91e4285287261a1d1c923cf619cd52c175cfe7f1be60a5258c610348ba3d";
s = "28c45f901d71c41b298638ec0d6a85d7fcb0c33bbfec5a9c810846b639289a84";
result = true;
};
{ msg = "2f48ec387f181035b350772e27f478ae6ec7487923692fae217e0f8636acd062a6ac39f7435f27a0ebcfd8187a91ef00fb68d106b8da4a1dedc5a40a4fae709e92b00fcc218de76417d75185e59dff76ec1543fb429d87c2ca8134ff5ae9b45456cad93fc67223c68293231395287dc0b756355660721a1f5df83bf5bcb8456e";
qx = "e31096c2d512fbf84f81e9bdb16f33121702897605b43a3db546f8fb695b5f6f";
qy = "6fbec6a04a8c59d61c900a851d8bf8522187d3ec2637b10fa8f377689e086bba";
r = "1b244c21c08c0c0a10477fb7a21382d405b95c755088292859ca0e71bab68361";
s = "852f4cbfd346e90f404e1dd5c4b2c1debca3ea1abefe8400685d703aea6c5c7f";
result = false;
};
{ msg = "fd2e5de421ee46c9fe6290a33f95b394bd5b7762f23178f7f6834f1f056fa9a8831446403c098ff4dd764173f974be4c89d376119613a4a1890f6fc2ddff862bda292dd49f5410d9b1cfe1d97ef4582b6152494372fc083885f540c01f86d780e6f3e75a954af2190fdae9604e3f8ab32ab0292dc0d790bd2627e37b4b4885df";
qx = "633c2ee5630b62c9ce839efd4d485a6d35e8b9430d264ffe501d28dbace79123";
qy = "4b668a1a6d1a25b089f75c2bd8d8c6a9a14fe7b729f45a82565da2e866e2c490";
r = "bf2111c93ec055a7eda90c106fce494fd866045634fd2aa28d6e018f9106994e";
s = "86b0341208a0aa55edecfd272f49cb34408ce54b7febc1d0a1c2ce77ab6988f8";
result = false;
};
{ msg = "4bc2d9a898395b12701635f1048fbfd263ec115e4150532b034d59e625238f4ed32619744c612e35ac5a23bee8d5f5651641a492217d305e5051321c273647f14bc7c4afab518554e01c82d6fc1694c8bdbeb326bb607bcaf5436303bc09f64c02c6ec50de409a484f5237f7d34e2651ada7ec429ca3b99dd87c6015d2f4b342";
qx = "f78dce40d1cb8c4af2749bf22c6f8a9a470b1e41112796215dd017e57df1b38a";
qy = "61b29b0bc03dff7fa00613b4de1e2317cfbf2badd50dee3376c032a887c5b865";
r = "4a96169a5dea36a2594011537ee0dc19e8f9f74e82c07434079447155a830152";
s = "a204eaa4e97d7553a1521d9f6baadc0b6d6183ba0f385d8593d6ca83607c4d82";
result = false;
};
{ msg = "d3356a683417508a9b913643e6ceac1281ef583f428968f9d2b6540a189d7041c477da8d207d0529720f70dab6b0da8c2168837476c1c6b63b517ed3cad48ae331cf716ecf47a0f7d00b57073ac6a4749716d49d80c4d46261d38e2e34b4f43e0f20b280842f6e3ea34fefdddfb9fa2a040ffe915e8784cfdb29b3364a34ca62";
qx = "3fcc3b3e1b103fe435ac214c756bdaad309389e1c803e6d84bbbc27039fcf900";
qy = "7f09edd1ec87a6d36dc81c1528d52a62776e666c274415a9f441d6a8df6b9237";
r = "1cac13f277354456ae67ab09b09e07eb1af2a2bf45108da70f5c8c6a4cbcd538";
s = "5d83752e540525602ba7e6fee4d4263f3eda59e67df20aac79ca67e8899fed0d";
result = false;
};
{ msg = "d7f5da9f4cf9299b7f86c52b88364ce28fe9ada55dd551a1018790f9e1205e2405ac62429d65093f74ec35a16d9f195c993cd4eb8dc0aa0dabb70a503321d8a9649160d6b3d0a0854bb68c4c39693f592ef5dd478aa2432d0865d87d48b3aea9c7d7d114165c9200e4e8d7bd02a7895ec4418e6f2fed6b244bf66209039e98a9";
qx = "5ec702d43a67ada86efbfc136cf16d96078906954a3f1f9e440674cd907e4676";
qy = "05a62044fed8470dd4fca38d89d583ce36d50d28b66ab0b51922b21da92c56d9";
r = "75f3037298f1457dba55743999976a1c2636b2b8ab2ed3df4736a6d2934acc83";
s = "19d43ad168dda1bb8ac423f8f08876515234b3d841e57faef1b5ab27359b27ef";
result = false;
};
{ msg = "68f4b444e1cc2025e8ff55e8046ead735e6e317082edf7ce65e83573501cb92c408c1c1c6c4fcca6b96ad34224f17b20be471cc9f4f97f0a5b7bfae9558bdb2ecb6e452bb743603724273d9e8d2ca22afdda35c8a371b28153d772303e4a25dc4f28e9a6dc9635331450f5af290dfa3431c3c08b91d5c97284361c03ec78f1bc";
qx = "f63afe99e1b5fc652782f86b59926af22e6072be93390fe41f541204f9c935d1";
qy = "f6e19ce5935e336183c21becf66596b8f559d2d02ee282aa87a7d6f936f7260c";
r = "cef4831e4515c77ca062282614b54a11b7dc4057e6997685c2fbfa95b392bf72";
s = "f20dc01bf38e1344ba675a22239d9893b3a3e33d9a403329a3d21650e9125b75";
result = true;
};
{ msg = "e75be05be0aaf70719b488b89aaae9008707ca528994461db7130c4368575a024bf0981c305d61265e8b97599ec35c03badd1256b80d6bf70547ad6089b983e3bcc3481828f3259e43e655e177fc423fd7e066bd3ed68d81df84f773c0f9e5f8bf4469960b8b4d7b2a372fd0edd3521f6be670908f2d90a343f416358ea70e7e";
qx = "6d11b09d2767cf8d275faee746c203486259f66dd2bfa3a65c39371a66b23385";
qy = "4eb05c73e05261e979182833f20311e5366f72f4b949665ff294f959375534c6";
r = "15a697cdb614e11c0810e1e764cd501fcabc70874c957587bc4883d9438e177f";
s = "7bf6244f92bc768063cecb5336c8eaacd23db930b28703560f241c7d93950dfd";
result = false;
};
{ msg = "0dc4a3eab66bd2e703a8fff566c34d466f9823ae42bd2104f61a6b051c0b017833fcef4d609d137ad97c209c80eebe252857aa7fafc35f16000a2bd4b4be0fa83b6e229eddfd180101f1f40d0453148053d8306833df64d59599b90194b55541d7f22dd589da9f7be519cbbb9db416c71bfe40ec090b5b7a600eec29bfd47306";
qx = "f3899caba038efb534c4cea0bd276814ffd80194473c903b81af11c8c05cb6e6";
qy = "6ea6b17402fcf2e8e737d11ffc7c2ed3b2d0bc3b8f271a381f4294cff62682c3";
r = "57b99380452e1d37b133c49b9ba493dee8630940477ca3351a43d90b99871e6a";
s = "df599c3a37105af3ecc159b3b685ccb3e151b7d5cf2d97147974ae71f466b615";
result = false;
};
{ msg = "d55e5e124a7217879ca986f285e22ac51940b35959bbf5543104b5547356fd1a0ec37c0a23209004a2ec5bcaf3335bc45e4dc990eacd29b2d9b5cf349c7ba67711356299bceab6f048df761c65f2988803133d6723a2820fefb2654cc7c5f032f833ba78a34d2878c6b0ba654ebe26b110c935abb56024bd5d0f09b367724c07";
qx = "1fd6f4b98d0755291e7a230e9f81ecf909e6350aadb08e42a3262ff19200fbd2";
qy = "5578fef79bc477acfb8ed0dc10c4f5809c14dc5492405b3792a7940650b305d7";
r = "97a99e96e407b3ada2c2dcf9ceeeb984d9a4d0aa66ddf0a74ca23cabfb1566cc";
s = "0ecac315dc199cfea3c15348c130924a1f787019fe4cd3ae47ca8b111268754a";
result = false;
};
{ msg = "7753c03b4202cb38bc0190a9f931eb31858d705d92d650320ff449fc99167fb3770b764c8988f6b34ac5a3d507a10e0aff7f88293f6a22c7ed8a24248a52dc125e416e158833fc38af29199f8ca4931068d4ccaa87e299e95642068f68c208cb782df13908f950564743ed1692502bafafaff169dc8fe674fb5e4f3ffd578c35";
qx = "2dcbd8790cee552e9f18f2b3149a2252dcd58b99ca7dc9680b92c8c43aa33874";
qy = "5dbc8bb8813c8e019d80e19acdb0792f537980fecde93db621aaf1f6d0e6ee34";
r = "2bdbd8b0d759595662cc10b10236136ef6ce429641f68cf6480f472fcc77bc9f";
s = "7e7df0c8b86f7db06caf1610166f7b9c4c75447f991d5aaf4dea720c25985c8c";
result = true;
};
]
let siggen_vectors_sha2_256 : list vec_SigGen = [
{ msg' = "5905238877c77421f73e43ee3da6f2d9e2ccad5fc942dcec0cbd25482935faaf416983fe165b1a045ee2bcd2e6dca3bdf46c4310a7461f9a37960ca672d3feb5473e253605fb1ddfd28065b53cb5858a8ad28175bf9bd386a5e471ea7a65c17cc934a9d791e91491eb3754d03799790fe2d308d16146d5c9b0d0debd97d79ce8";
d = "519b423d715f8b581f4fa8ee59f4771a5b44c8130b4e3eacca54a56dda72b464";
qx' = "1ccbe91c075fc7f4f033bfa248db8fccd3565de94bbfb12f3c59ff46c271bf83";
qy' = "ce4014c68811f9a21a1fdb2c0e6113e06db7ca93b7404e78dc7ccd5ca89a4ca9";
k = "94a1bbb14b906a61a280f245f9e93c7f3b4a6247824f5d33b9670787642a68de";
r' = "f3ac8061b514795b8843e3d6629527ed2afd6b1f6a555a7acabb5e6f79c8c2ac";
s' = "8bf77819ca05a6b2786c76262bf7371cef97b218e96f175a3ccdda2acc058903";
};
{ msg' = "c35e2f092553c55772926bdbe87c9796827d17024dbb9233a545366e2e5987dd344deb72df987144b8c6c43bc41b654b94cc856e16b96d7a821c8ec039b503e3d86728c494a967d83011a0e090b5d54cd47f4e366c0912bc808fbb2ea96efac88fb3ebec9342738e225f7c7c2b011ce375b56621a20642b4d36e060db4524af1";
d = "0f56db78ca460b055c500064824bed999a25aaf48ebb519ac201537b85479813";
qx' = "e266ddfdc12668db30d4ca3e8f7749432c416044f2d2b8c10bf3d4012aeffa8a";
qy' = "bfa86404a2e9ffe67d47c587ef7a97a7f456b863b4d02cfc6928973ab5b1cb39";
k = "6d3e71882c3b83b156bb14e0ab184aa9fb728068d3ae9fac421187ae0b2f34c6";
r' = "976d3a4e9d23326dc0baa9fa560b7c4e53f42864f508483a6473b6a11079b2db";
s' = "1b766e9ceb71ba6c01dcd46e0af462cd4cfa652ae5017d4555b8eeefe36e1932";
};
{ msg' = "3c054e333a94259c36af09ab5b4ff9beb3492f8d5b4282d16801daccb29f70fe61a0b37ffef5c04cd1b70e85b1f549a1c4dc672985e50f43ea037efa9964f096b5f62f7ffdf8d6bfb2cc859558f5a393cb949dbd48f269343b5263dcdb9c556eca074f2e98e6d94c2c29a677afaf806edf79b15a3fcd46e7067b7669f83188ee";
d = "e283871239837e13b95f789e6e1af63bf61c918c992e62bca040d64cad1fc2ef";
qx' = "74ccd8a62fba0e667c50929a53f78c21b8ff0c3c737b0b40b1750b2302b0bde8";
qy' = "29074e21f3a0ef88b9efdf10d06aa4c295cc1671f758ca0e4cd108803d0f2614";
k = "ad5e887eb2b380b8d8280ad6e5ff8a60f4d26243e0124c2f31a297b5d0835de2";
r' = "35fb60f5ca0f3ca08542fb3cc641c8263a2cab7a90ee6a5e1583fac2bb6f6bd1";
s' = "ee59d81bc9db1055cc0ed97b159d8784af04e98511d0a9a407b99bb292572e96";
};
{ msg' = "0989122410d522af64ceb07da2c865219046b4c3d9d99b01278c07ff63eaf1039cb787ae9e2dd46436cc0415f280c562bebb83a23e639e476a02ec8cff7ea06cd12c86dcc3adefbf1a9e9a9b6646c7599ec631b0da9a60debeb9b3e19324977f3b4f36892c8a38671c8e1cc8e50fcd50f9e51deaf98272f9266fc702e4e57c30";
d = "a3d2d3b7596f6592ce98b4bfe10d41837f10027a90d7bb75349490018cf72d07";
qx' = "322f80371bf6e044bc49391d97c1714ab87f990b949bc178cb7c43b7c22d89e1";
qy' = "3c15d54a5cc6b9f09de8457e873eb3deb1fceb54b0b295da6050294fae7fd999";
k = "24fc90e1da13f17ef9fe84cc96b9471ed1aaac17e3a4bae33a115df4e5834f18";
r' = "d7c562370af617b581c84a2468cc8bd50bb1cbf322de41b7887ce07c0e5884ca";
s' = "b46d9f2d8c4bf83546ff178f1d78937c008d64e8ecc5cbb825cb21d94d670d89";
};
{ msg' = "dc66e39f9bbfd9865318531ffe9207f934fa615a5b285708a5e9c46b7775150e818d7f24d2a123df3672fff2094e3fd3df6fbe259e3989dd5edfcccbe7d45e26a775a5c4329a084f057c42c13f3248e3fd6f0c76678f890f513c32292dd306eaa84a59abe34b16cb5e38d0e885525d10336ca443e1682aa04a7af832b0eee4e7";
d = "53a0e8a8fe93db01e7ae94e1a9882a102ebd079b3a535827d583626c272d280d";
qx' = "1bcec4570e1ec2436596b8ded58f60c3b1ebc6a403bc5543040ba82963057244";
qy' = "8af62a4c683f096b28558320737bf83b9959a46ad2521004ef74cf85e67494e1";
k = "5d833e8d24cc7a402d7ee7ec852a3587cddeb48358cea71b0bedb8fabe84e0c4";
r' = "18caaf7b663507a8bcd992b836dec9dc5703c080af5e51dfa3a9a7c387182604";
s' = "77c68928ac3b88d985fb43fb615fb7ff45c18ba5c81af796c613dfa98352d29c";
};
{ msg' = "600974e7d8c5508e2c1aab0783ad0d7c4494ab2b4da265c2fe496421c4df238b0be25f25659157c8a225fb03953607f7df996acfd402f147e37aee2f1693e3bf1c35eab3ae360a2bd91d04622ea47f83d863d2dfecb618e8b8bdc39e17d15d672eee03bb4ce2cc5cf6b217e5faf3f336fdd87d972d3a8b8a593ba85955cc9d71";
d = "4af107e8e2194c830ffb712a65511bc9186a133007855b49ab4b3833aefc4a1d";
qx' = "a32e50be3dae2c8ba3f5e4bdae14cf7645420d425ead94036c22dd6c4fc59e00";
qy' = "d623bf641160c289d6742c6257ae6ba574446dd1d0e74db3aaa80900b78d4ae9";
k = "e18f96f84dfa2fd3cdfaec9159d4c338cd54ad314134f0b31e20591fc238d0ab";
r' = "8524c5024e2d9a73bde8c72d9129f57873bbad0ed05215a372a84fdbc78f2e68";
s' = "d18c2caf3b1072f87064ec5e8953f51301cada03469c640244760328eb5a05cb";
};
{ msg' = "dfa6cb9b39adda6c74cc8b2a8b53a12c499ab9dee01b4123642b4f11af336a91a5c9ce0520eb2395a6190ecbf6169c4cba81941de8e76c9c908eb843b98ce95e0da29c5d4388040264e05e07030a577cc5d176387154eabae2af52a83e85c61c7c61da930c9b19e45d7e34c8516dc3c238fddd6e450a77455d534c48a152010b";
d = "78dfaa09f1076850b3e206e477494cddcfb822aaa0128475053592c48ebaf4ab";
qx' = "8bcfe2a721ca6d753968f564ec4315be4857e28bef1908f61a366b1f03c97479";
qy' = "0f67576a30b8e20d4232d8530b52fb4c89cbc589ede291e499ddd15fe870ab96";
k = "295544dbb2da3da170741c9b2c6551d40af7ed4e891445f11a02b66a5c258a77";
r' = "c5a186d72df452015480f7f338970bfe825087f05c0088d95305f87aacc9b254";
s' = "84a58f9e9d9e735344b316b1aa1ab5185665b85147dc82d92e969d7bee31ca30";
};
{ msg' = "51d2547cbff92431174aa7fc7302139519d98071c755ff1c92e4694b58587ea560f72f32fc6dd4dee7d22bb7387381d0256e2862d0644cdf2c277c5d740fa089830eb52bf79d1e75b8596ecf0ea58a0b9df61e0c9754bfcd62efab6ea1bd216bf181c5593da79f10135a9bc6e164f1854bc8859734341aad237ba29a81a3fc8b";
d = "80e692e3eb9fcd8c7d44e7de9f7a5952686407f90025a1d87e52c7096a62618a";
qx' = "a88bc8430279c8c0400a77d751f26c0abc93e5de4ad9a4166357952fe041e767";
qy' = "2d365a1eef25ead579cc9a069b6abc1b16b81c35f18785ce26a10ba6d1381185";
k = "7c80fd66d62cc076cef2d030c17c0a69c99611549cb32c4ff662475adbe84b22";
r' = "9d0c6afb6df3bced455b459cc21387e14929392664bb8741a3693a1795ca6902";
s' = "d7f9ddd191f1f412869429209ee3814c75c72fa46a9cccf804a2f5cc0b7e739f";
};
{ msg' = "558c2ac13026402bad4a0a83ebc9468e50f7ffab06d6f981e5db1d082098065bcff6f21a7a74558b1e8612914b8b5a0aa28ed5b574c36ac4ea5868432a62bb8ef0695d27c1e3ceaf75c7b251c65ddb268696f07c16d2767973d85beb443f211e6445e7fe5d46f0dce70d58a4cd9fe70688c035688ea8c6baec65a5fc7e2c93e8";
d = "5e666c0db0214c3b627a8e48541cc84a8b6fd15f300da4dff5d18aec6c55b881";
qx' = "1bc487570f040dc94196c9befe8ab2b6de77208b1f38bdaae28f9645c4d2bc3a";
qy' = "ec81602abd8345e71867c8210313737865b8aa186851e1b48eaca140320f5d8f";
k = "2e7625a48874d86c9e467f890aaa7cd6ebdf71c0102bfdcfa24565d6af3fdce9";
r' = "2f9e2b4e9f747c657f705bffd124ee178bbc5391c86d056717b140c153570fd9";
s' = "f5413bfd85949da8d83de83ab0d19b2986613e224d1901d76919de23ccd03199";
};
{ msg' = "4d55c99ef6bd54621662c3d110c3cb627c03d6311393b264ab97b90a4b15214a5593ba2510a53d63fb34be251facb697c973e11b665cb7920f1684b0031b4dd370cb927ca7168b0bf8ad285e05e9e31e34bc24024739fdc10b78586f29eff94412034e3b606ed850ec2c1900e8e68151fc4aee5adebb066eb6da4eaa5681378e";
d = "f73f455271c877c4d5334627e37c278f68d143014b0a05aa62f308b2101c5308";
qx' = "b8188bd68701fc396dab53125d4d28ea33a91daf6d21485f4770f6ea8c565dde";
qy' = "423f058810f277f8fe076f6db56e9285a1bf2c2a1dae145095edd9c04970bc4a";
k = "62f8665fd6e26b3fa069e85281777a9b1f0dfd2c0b9f54a086d0c109ff9fd615";
r' = "1cc628533d0004b2b20e7f4baad0b8bb5e0673db159bbccf92491aef61fc9620";
s' = "880e0bbf82a8cf818ed46ba03cf0fc6c898e36fca36cc7fdb1d2db7503634430";
};
{ msg' = "f8248ad47d97c18c984f1f5c10950dc1404713c56b6ea397e01e6dd925e903b4fadfe2c9e877169e71ce3c7fe5ce70ee4255d9cdc26f6943bf48687874de64f6cf30a012512e787b88059bbf561162bdcc23a3742c835ac144cc14167b1bd6727e940540a9c99f3cbb41fb1dcb00d76dda04995847c657f4c19d303eb09eb48a";
d = "b20d705d9bd7c2b8dc60393a5357f632990e599a0975573ac67fd89b49187906";
qx' = "51f99d2d52d4a6e734484a018b7ca2f895c2929b6754a3a03224d07ae61166ce";
qy' = "4737da963c6ef7247fb88d19f9b0c667cac7fe12837fdab88c66f10d3c14cad1";
k = "72b656f6b35b9ccbc712c9f1f3b1a14cbbebaec41c4bca8da18f492a062d6f6f";
r' = "9886ae46c1415c3bc959e82b760ad760aab66885a84e620aa339fdf102465c42";
s' = "2bf3a80bc04faa35ebecc0f4864ac02d349f6f126e0f988501b8d3075409a26c";
};
{ msg' = "3b6ee2425940b3d240d35b97b6dcd61ed3423d8e71a0ada35d47b322d17b35ea0472f35edd1d252f87b8b65ef4b716669fc9ac28b00d34a9d66ad118c9d94e7f46d0b4f6c2b2d339fd6bcd351241a387cc82609057048c12c4ec3d85c661975c45b300cb96930d89370a327c98b67defaa89497aa8ef994c77f1130f752f94a4";
d = "d4234bebfbc821050341a37e1240efe5e33763cbbb2ef76a1c79e24724e5a5e7";
qx' = "8fb287f0202ad57ae841aea35f29b2e1d53e196d0ddd9aec24813d64c0922fb7";
qy' = "1f6daff1aa2dd2d6d3741623eecb5e7b612997a1039aab2e5cf2de969cfea573";
k = "d926fe10f1bfd9855610f4f5a3d666b1a149344057e35537373372ead8b1a778";
r' = "490efd106be11fc365c7467eb89b8d39e15d65175356775deab211163c2504cb";
s' = "644300fc0da4d40fb8c6ead510d14f0bd4e1321a469e9c0a581464c7186b7aa7";
};
{ msg' = "c5204b81ec0a4df5b7e9fda3dc245f98082ae7f4efe81998dcaa286bd4507ca840a53d21b01e904f55e38f78c3757d5a5a4a44b1d5d4e480be3afb5b394a5d2840af42b1b4083d40afbfe22d702f370d32dbfd392e128ea4724d66a3701da41ae2f03bb4d91bb946c7969404cb544f71eb7a49eb4c4ec55799bda1eb545143a7";
d = "b58f5211dff440626bb56d0ad483193d606cf21f36d9830543327292f4d25d8c";
qx' = "68229b48c2fe19d3db034e4c15077eb7471a66031f28a980821873915298ba76";
qy' = "303e8ee3742a893f78b810991da697083dd8f11128c47651c27a56740a80c24c";
k = "e158bf4a2d19a99149d9cdb879294ccb7aaeae03d75ddd616ef8ae51a6dc1071";
r' = "e67a9717ccf96841489d6541f4f6adb12d17b59a6bef847b6183b8fcf16a32eb";
s' = "9ae6ba6d637706849a6a9fc388cf0232d85c26ea0d1fe7437adb48de58364333";
};
{ msg' = "72e81fe221fb402148d8b7ab03549f1180bcc03d41ca59d7653801f0ba853add1f6d29edd7f9abc621b2d548f8dbf8979bd16608d2d8fc3260b4ebc0dd42482481d548c7075711b5759649c41f439fad69954956c9326841ea6492956829f9e0dc789f73633b40f6ac77bcae6dfc7930cfe89e526d1684365c5b0be2437fdb01";
d = "54c066711cdb061eda07e5275f7e95a9962c6764b84f6f1f3ab5a588e0a2afb1";
qx' = "0a7dbb8bf50cb605eb2268b081f26d6b08e012f952c4b70a5a1e6e7d46af98bb";
qy' = "f26dd7d799930062480849962ccf5004edcfd307c044f4e8f667c9baa834eeae";
k = "646fe933e96c3b8f9f507498e907fdd201f08478d0202c752a7c2cfebf4d061a";
r' = "b53ce4da1aa7c0dc77a1896ab716b921499aed78df725b1504aba1597ba0c64b";
s' = "d7c246dc7ad0e67700c373edcfdd1c0a0495fc954549ad579df6ed1438840851";
};
{ msg' = "21188c3edd5de088dacc1076b9e1bcecd79de1003c2414c3866173054dc82dde85169baa77993adb20c269f60a5226111828578bcc7c29e6e8d2dae81806152c8ba0c6ada1986a1983ebeec1473a73a04795b6319d48662d40881c1723a706f516fe75300f92408aa1dc6ae4288d2046f23c1aa2e54b7fb6448a0da922bd7f34";
d = "34fa4682bf6cb5b16783adcd18f0e6879b92185f76d7c920409f904f522db4b1";
qx' = "105d22d9c626520faca13e7ced382dcbe93498315f00cc0ac39c4821d0d73737";
qy' = "6c47f3cbbfa97dfcebe16270b8c7d5d3a5900b888c42520d751e8faf3b401ef4";
k = "a6f463ee72c9492bc792fe98163112837aebd07bab7a84aaed05be64db3086f4";
r' = "542c40a18140a6266d6f0286e24e9a7bad7650e72ef0e2131e629c076d962663";
s' = "4f7f65305e24a6bbb5cff714ba8f5a2cee5bdc89ba8d75dcbf21966ce38eb66f";
};
]
let siggen_vectors_sha2_384 : list vec_SigGen = [
{ msg' = "e0b8596b375f3306bbc6e77a0b42f7469d7e83635990e74aa6d713594a3a24498feff5006790742d9c2e9b47d714bee932435db747c6e733e3d8de41f2f91311f2e9fd8e025651631ffd84f66732d3473fbd1627e63dc7194048ebec93c95c159b5039ab5e79e42c80b484a943f125de3da1e04e5bf9c16671ad55a1117d3306";
d = "b6faf2c8922235c589c27368a3b3e6e2f42eb6073bf9507f19eed0746c79dced";
qx' = "e0e7b99bc62d8dd67883e39ed9fa0657789c5ff556cc1fd8dd1e2a55e9e3f243";
qy' = "63fbfd0232b95578075c903a4dbf85ad58f8350516e1ec89b0ee1f5e1362da69";
k = "9980b9cdfcef3ab8e219b9827ed6afdd4dbf20bd927e9cd01f15762703487007";
r' = "f5087878e212b703578f5c66f434883f3ef414dc23e2e8d8ab6a8d159ed5ad83";
s' = "306b4c6c20213707982dffbb30fba99b96e792163dd59dbe606e734328dd7c8a";
};
{ msg' = "099a0131179fff4c6928e49886d2fdb3a9f239b7dd5fa828a52cbbe3fcfabecfbba3e192159b887b5d13aa1e14e6a07ccbb21f6ad8b7e88fee6bea9b86dea40ffb962f38554056fb7c5bb486418915f7e7e9b9033fe3baaf9a069db98bc02fa8af3d3d1859a11375d6f98aa2ce632606d0800dff7f55b40f971a8586ed6b39e9";
d = "118958fd0ff0f0b0ed11d3cf8fa664bc17cdb5fed1f4a8fc52d0b1ae30412181";
qx' = "afda82260c9f42122a3f11c6058839488f6d7977f6f2a263c67d06e27ea2c355";
qy' = "0ae2bbdd2207c590332c5bfeb4c8b5b16622134bd4dc55382ae806435468058b";
k = "23129a99eeda3d99a44a5778a46e8e7568b91c31fb7a8628c5d9820d4bed4a6b";
r' = "e446600cab1286ebc3bb332012a2f5cc33b0a5ef7291d5a62a84de5969d77946";
s' = "cf89b12793ee1792eb26283b48fa0bdcb45ae6f6ad4b02564bf786bb97057d5a";
};
{ msg' = "0fbc07ea947c946bea26afa10c51511039b94ddbc4e2e4184ca3559260da24a14522d1497ca5e77a5d1a8e86583aeea1f5d4ff9b04a6aa0de79cd88fdb85e01f171143535f2f7c23b050289d7e05cebccdd131888572534bae0061bdcc3015206b9270b0d5af9f1da2f9de91772d178a632c3261a1e7b3fb255608b3801962f9";
d = "3e647357cd5b754fad0fdb876eaf9b1abd7b60536f383c81ce5745ec80826431";
qx' = "702b2c94d039e590dd5c8f9736e753cf5824aacf33ee3de74fe1f5f7c858d5ed";
qy' = "0c28894e907af99fb0d18c9e98f19ac80dd77abfa4bebe45055c0857b82a0f4d";
k = "9beab7722f0bcb468e5f234e074170a60225255de494108459abdf603c6e8b35";
r' = "c4021fb7185a07096547af1fb06932e37cf8bd90cf593dea48d48614fa237e5e";
s' = "7fb45d09e2172bec8d3e330aa06c43fbb5f625525485234e7714b7f6e92ba8f1";
};
{ msg' = "1e38d750d936d8522e9db1873fb4996bef97f8da3c6674a1223d29263f1234a90b751785316444e9ba698bc8ab6cd010638d182c9adad4e334b2bd7529f0ae8e9a52ad60f59804b2d780ed52bdd33b0bf5400147c28b4304e5e3434505ae7ce30d4b239e7e6f0ecf058badd5b388eddbad64d24d2430dd04b4ddee98f972988f";
d = "76c17c2efc99891f3697ba4d71850e5816a1b65562cc39a13da4b6da9051b0fd";
qx' = "d12512e934c367e4c4384dbd010e93416840288a0ba00b299b4e7c0d91578b57";
qy' = "ebf8835661d9b578f18d14ae4acf9c357c0dc8b7112fc32824a685ed72754e23";
k = "77cffa6f9a73904306f9fcd3f6bbb37f52d71e39931bb4aec28f9b076e436ccf";
r' = "4d5a9d95b0f09ce8704b0f457b39059ee606092310df65d3f8ae7a2a424cf232";
s' = "7d3c014ca470a73cef1d1da86f2a541148ad542fbccaf9149d1b0b030441a7eb";
};
{ msg' = "abcf0e0f046b2e0672d1cc6c0a114905627cbbdefdf9752f0c31660aa95f2d0ede72d17919a9e9b1add3213164e0c9b5ae3c76f1a2f79d3eeb444e6741521019d8bd5ca391b28c1063347f07afcfbb705be4b52261c19ebaf1d6f054a74d86fb5d091fa7f229450996b76f0ada5f977b09b58488eebfb5f5e9539a8fd89662ab";
d = "67b9dea6a575b5103999efffce29cca688c781782a41129fdecbce76608174de";
qx' = "b4238b029fc0b7d9a5286d8c29b6f3d5a569e9108d44d889cd795c4a385905be";
qy' = "8cb3fff8f6cca7187c6a9ad0a2b1d9f40ae01b32a7e8f8c4ca75d71a1fffb309";
k = "d02617f26ede3584f0afcfc89554cdfb2ae188c192092fdde3436335fafe43f1";
r' = "26fd9147d0c86440689ff2d75569795650140506970791c90ace0924b44f1586";
s' = "00a34b00c20a8099df4b0a757cbef8fea1cb3ea7ced5fbf7e987f70b25ee6d4f";
};
{ msg' = "dc3d4884c741a4a687593c79fb4e35c5c13c781dca16db561d7e393577f7b62ca41a6e259fc1fb8d0c4e1e062517a0fdf95558b7799f20c211796167953e6372c11829beec64869d67bf3ee1f1455dd87acfbdbcc597056e7fb347a17688ad32fda7ccc3572da7677d7255c261738f07763cd45973c728c6e9adbeecadc3d961";
d = "ecf644ea9b6c3a04fdfe2de4fdcb55fdcdfcf738c0b3176575fa91515194b566";
qx' = "c3bdc7c795ec94620a2cfff614c13a3390a5e86c892e53a24d3ed22228bc85bf";
qy' = "70480fc5cf4aacd73e24618b61b5c56c1ced8c4f1b869580ea538e68c7a61ca3";
k = "53291d51f68d9a12d1dcdc58892b2f786cc15f631f16997d2a49bace513557d4";
r' = "a860c8b286edf973ce4ce4cf6e70dc9bbf3818c36c023a845677a9963705df8b";
s' = "5630f986b1c45e36e127dd7932221c4272a8cc6e255e89f0f0ca4ec3a9f76494";
};
{ msg' = "719bf1911ae5b5e08f1d97b92a5089c0ab9d6f1c175ac7199086aeeaa416a17e6d6f8486c711d386f284f096296689a54d330c8efb0f5fa1c5ba128d3234a3da856c2a94667ef7103616a64c913135f4e1dc50e38daa60610f732ad1bedfcc396f87169392520314a6b6b9af6793dbabad4599525228cc7c9c32c4d8e097ddf6";
d = "4961485cbc978f8456ec5ac7cfc9f7d9298f99415ecae69c8491b258c029bfee";
qx' = "8d40bf2299e05d758d421972e81cfb0cce68b949240dc30f315836acc70bef03";
qy' = "5674e6f77f8b46f46cca937d83b128dffbe9bd7e0d3d08aa2cbbfdfb16f72c9a";
k = "373a825b5a74b7b9e02f8d4d876b577b4c3984168d704ba9f95b19c05ed590af";
r' = "ef6fb386ad044b63feb7445fa16b10319018e9cea9ef42bca83bdad01992234a";
s' = "ac1f42f652eb1786e57be01d847c81f7efa072ba566d4583af4f1551a3f76c65";
};
{ msg' = "7cf19f4c851e97c5bca11a39f0074c3b7bd3274e7dd75d0447b7b84995dfc9f716bf08c25347f56fcc5e5149cb3f9cfb39d408ace5a5c47e75f7a827fa0bb9921bb5b23a6053dbe1fa2bba341ac874d9b1333fc4dc224854949f5c8d8a5fedd02fb26fdfcd3be351aec0fcbef18972956c6ec0effaf057eb4420b6d28e0c008c";
d = "587907e7f215cf0d2cb2c9e6963d45b6e535ed426c828a6ea2fb637cca4c5cbd";
qx' = "660da45c413cc9c9526202c16b402af602d30daaa7c342f1e722f15199407f31";
qy' = "e6f8cbb06913cc718f2d69ba2fb3137f04a41c27c676d1a80fbf30ea3ca46439";
k = "6b8eb7c0d8af9456b95dd70561a0e902863e6dfa1c28d0fd4a0509f1c2a647b2";
r' = "08fabf9b57de81875bfa7a4118e3e44cfb38ec6a9b2014940207ba3b1c583038";
s' = "a58d199b1deba7350616230d867b2747a3459421811c291836abee715b8f67b4";
};
{ msg' = "b892ffabb809e98a99b0a79895445fc734fa1b6159f9cddb6d21e510708bdab6076633ac30aaef43db566c0d21f4381db46711fe3812c5ce0fb4a40e3d5d8ab24e4e82d3560c6dc7c37794ee17d4a144065ef99c8d1c88bc22ad8c4c27d85ad518fa5747ae35276fc104829d3f5c72fc2a9ea55a1c3a87007cd133263f79e405";
d = "24b1e5676d1a9d6b645a984141a157c124531feeb92d915110aef474b1e27666";
qx' = "b4909a5bdf25f7659f4ef35e4b811429fb2c59126e3dad09100b46aea6ebe7a6";
qy' = "760ae015fa6af5c9749c4030fdb5de6e58c6b5b1944829105cf7edf7d3a22cfb";
k = "88794923d8943b5dbcc7a7a76503880ff7da632b0883aaa60a9fcc71bf880fd6";
r' = "6ec9a340b77fae3c7827fa96d997e92722ff2a928217b6dd3c628f3d49ae4ce6";
s' = "637b54bbcfb7e7d8a41ea317fcfca8ad74eb3bb6b778bc7ef9dec009281976f7";
};
{ msg' = "8144e37014c95e13231cbd6fa64772771f93b44e37f7b02f592099cc146343edd4f4ec9fa1bc68d7f2e9ee78fc370443aa2803ff4ca52ee49a2f4daf2c8181ea7b8475b3a0f608fc3279d09e2d057fbe3f2ffbe5133796124781299c6da60cfe7ecea3abc30706ded2cdf18f9d788e59f2c31662df3abe01a9b12304fb8d5c8c";
d = "bce49c7b03dcdc72393b0a67cf5aa5df870f5aaa6137ada1edc7862e0981ec67";
qx' = "c786d9421d67b72b922cf3def2a25eeb5e73f34543eb50b152e738a98afb0ca5";
qy' = "6796271e79e2496f9e74b126b1123a3d067de56b5605d6f51c8f6e1d5bb93aba";
k = "89e690d78a5e0d2b8ce9f7fcbf34e2605fd9584760fa7729043397612dd21f94";
r' = "07e5054c384839584624e8d730454dc27e673c4a90cbf129d88b91250341854d";
s' = "f7e665b88614d0c5cbb3007cafe713763d81831525971f1747d92e4d1ca263a7";
};
{ msg' = "a3683d120807f0a030feed679785326698c3702f1983eaba1b70ddfa7f0b3188060b845e2b67ed57ee68087746710450f7427cb34655d719c0acbc09ac696adb4b22aba1b9322b7111076e67053a55f62b501a4bca0ad9d50a868f51aeeb4ef27823236f5267e8da83e143047422ce140d66e05e44dc84fb3a4506b2a5d7caa8";
d = "73188a923bc0b289e81c3db48d826917910f1b957700f8925425c1fb27cabab9";
qx' = "86662c014ab666ee770723be8da38c5cd299efc6480fc6f8c3603438fa8397b9";
qy' = "f26b3307a650c3863faaa5f642f3ba1384c3d3a02edd3d48c657c269609cc3fc";
k = "ec90584ab3b383b590626f36ed4f5110e49888aec7ae7a9c5ea62dd2dc378666";
r' = "13e9ad59112fde3af4163eb5c2400b5e9a602576d5869ac1c569075f08c90ff6";
s' = "708ac65ff2b0baaccc6dd954e2a93df46016bd04457636de06798fcc17f02be5";
};
{ msg' = "b1df8051b213fc5f636537e37e212eb20b2423e6467a9c7081336a870e6373fc835899d59e546c0ac668cc81ce4921e88f42e6da2a109a03b4f4e819a17c955b8d099ec6b282fb495258dca13ec779c459da909475519a3477223c06b99afbd77f9922e7cbef844b93f3ce5f50db816b2e0d8b1575d2e17a6b8db9111d6da578";
d = "f637d55763fe819541588e0c603f288a693cc66823c6bb7b8e003bd38580ebce";
qx' = "74a4620c578601475fc169a9b84be613b4a16cb6acab8fd98848a6ec9fbd133d";
qy' = "42b9e35d347c107e63bd55f525f915bcf1e3d2b81d002d3c39acf10fc30645a1";
k = "4d578f5099636234d9c1d566f1215d5d887ae5d47022be17dbf32a11a03f053b";
r' = "113a933ebc4d94ce1cef781e4829df0c493b0685d39fb2048ce01b21c398dbba";
s' = "3005bd4ec63dbd04ce9ff0c6246ad65d27fcf62edb2b7e461589f9f0e7446ffd";
};
{ msg' = "0b918ede985b5c491797d0a81446b2933be312f419b212e3aae9ba5914c00af431747a9d287a7c7761e9bcbc8a12aaf9d4a76d13dad59fc742f8f218ef66eb67035220a07acc1a357c5b562ecb6b895cf725c4230412fefac72097f2c2b829ed58742d7c327cad0f1058df1bddd4ae9c6d2aba25480424308684cecd6517cdd8";
d = "2e357d51517ff93b821f895932fddded8347f32596b812308e6f1baf7dd8a47f";
qx' = "7e4078a1d50c669fb2996dd9bacb0c3ac7ede4f58fa0fa1222e78dbf5d1f4186";
qy' = "0014e46e90cc171fbb83ea34c6b78202ea8137a7d926f0169147ed5ae3d6596f";
k = "be522b0940b9a40d84bf790fe6abdc252877e671f2efa63a33a65a512fc2aa5c";
r' = "a26b9ad775ac37ff4c7f042cdc4872c5e4e5e800485f488ddfaaed379f468090";
s' = "f88eae2019bebbba62b453b8ee3472ca5c67c267964cffe0cf2d2933c1723dff";
};
{ msg' = "0fab26fde1a4467ca930dbe513ccc3452b70313cccde2994eead2fde85c8da1db84d7d06a024c9e88629d5344224a4eae01b21a2665d5f7f36d5524bf5367d7f8b6a71ea05d413d4afde33777f0a3be49c9e6aa29ea447746a9e77ce27232a550b31dd4e7c9bc8913485f2dc83a56298051c92461fd46b14cc895c300a4fb874";
d = "77d60cacbbac86ab89009403c97289b5900466856887d3e6112af427f7f0f50b";
qx' = "a62032dfdb87e25ed0c70cad20d927c7effeb2638e6c88ddd670f74df16090e5";
qy' = "44c5ee2cf740ded468f5d2efe13daa7c5234645a37c073af35330d03a4fed976";
k = "06c1e692b045f425a21347ecf72833d0242906c7c1094f805566cdcb1256e394";
r' = "eb173b51fb0aec318950d097e7fda5c34e529519631c3e2c9b4550b903da417d";
s' = "ca2c13574bf1b7d56e9dc18315036a31b8bceddf3e2c2902dcb40f0cc9e31b45";
};
{ msg' = "7843f157ef8566722a7d69da67de7599ee65cb3975508f70c612b3289190e364141781e0b832f2d9627122742f4b5871ceeafcd09ba5ec90cae6bcc01ae32b50f13f63918dfb5177df9797c6273b92d103c3f7a3fc2050d2b196cc872c57b77f9bdb1782d4195445fcc6236dd8bd14c8bcbc8223a6739f6a17c9a861e8c821a6";
d = "486854e77962117f49e09378de6c9e3b3522fa752b10b2c810bf48db584d7388";
qx' = "760b5624bd64d19c866e54ccd74ad7f98851afdbc3ddeae3ec2c52a135be9cfa";
qy' = "feca15ce9350877102eee0f5af18b2fed89dc86b7df0bf7bc2963c1638e36fe8";
k = "e4f77c6442eca239b01b0254e11a4182782d96f48ab521cc3d1d68df12b5a41a";
r' = "bdff14e4600309c2c77f79a25963a955b5b500a7b2d34cb172cd6acd52905c7b";
s' = "b0479cdb3df79923ec36a104a129534c5d59f622be7d613aa04530ad2507d3a2";
};
] | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Meta.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.ECDSA.Test.Vectors.fst"
} | [
{
"abbrev": false,
"full_module": "Lib.Meta",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.ECDSA.Test",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.ECDSA.Test",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Prims.list Spec.ECDSA.Test.Vectors.vec_SigGen | Prims.Tot | [
"total"
] | [] | [
"Prims.Cons",
"Spec.ECDSA.Test.Vectors.vec_SigGen",
"Spec.ECDSA.Test.Vectors.Mkvec_SigGen",
"Prims.Nil"
] | [] | false | false | false | true | false | let siggen_vectors_sha2_512:list vec_SigGen =
| [
{
msg'
=
"6c8572b6a3a4a9e8e03dbeed99334d41661b8a8417074f335ab1845f6cc852adb8c01d9820fcf8e10699cc827a8fbdca2cbd46cc66e4e6b7ba41ec3efa733587e4a30ec552cd8ddab8163e148e50f4d090782897f3ddac84a41e1fcfe8c56b6152c0097b0d634b41011471ffd004f43eb4aafc038197ec6bae2b4470e869bded";
d = "9dd0d3a3d514c2a8adb162b81e3adfba3299309f7d2018f607bdb15b1a25f499";
qx' = "6b738de3398b6ac57b9591f9d7985dd4f32137ad3460dcf8970c1390cb9eaf8d";
qy' = "83bc61e26d2bbbd3cf2d2ab445a2bc4ab5dde41f4a13078fd1d3cc36ab596d57";
k = "9106192170ccb3c64684d48287bb81bbed51b40d503462c900e5c7aae43e380a";
r' = "275fa760878b4dc05e9d157fedfd8e9b1c9c861222a712748cb4b7754c043fb1";
s' = "699d906bb8435a05345af3b37e3b357786939e94caae257852f0503adb1e0f7e"
};
{
msg'
=
"7e3c8fe162d48cc8c5b11b5e5ebc05ebc45c439bdbc0b0902145921b8383037cb0812222031598cd1a56fa71694fbd304cc62938233465ec39c6e49f57dfe823983b6923c4e865633949183e6b90e9e06d8275f3907d97967d47b6239fe2847b7d49cf16ba69d2862083cf1bccf7afe34fdc90e21998964107b64abe6b89d126";
d = "f9bf909b7973bf0e3dad0e43dcb2d7fa8bda49dbe6e5357f8f0e2bd119be30e6";
qx' = "f2a6674d4e86152a527199bed293fa63acde1b4d8a92b62e552210ba45c38792";
qy' = "c72565c24f0eee6a094af341ddd8579747b865f91c8ed5b44cda8a19cc93776f";
k = "e547791f7185850f03d0c58419648f65b9d29cdc22ed1de2a64280220cfcafba";
r' = "4782903d2aaf8b190dab5cae2223388d2d8bd845b3875d37485c54e1ded1d3d8";
s' = "dfb40e406bfa074f0bf832771b2b9f186e2211f0bca279644a0ca8559acf39da"
};
{
msg'
=
"d5aa8ac9218ca661cd177756af6fbb5a40a3fecfd4eea6d5872fbb9a2884784aa9b5f0c023a6e0da5cf6364754ee6465b4ee2d0ddc745b02994c98427a213c849537da5a4477b3abfe02648be67f26e80b56a33150490d062aaac137aa47f11cfeddba855bab9e4e028532a563326d927f9e6e3292b1fb248ee90b6f429798db";
d = "724567d21ef682dfc6dc4d46853880cfa86fe6fea0efd51fac456f03c3d36ead";
qx' = "70b877b5e365fcf08140b1eca119baba662879f38e059d074a2cb60b03ea5d39";
qy' = "5f56f94d591df40b9f3b8763ac4b3dbe622c956d5bd0c55658b6f46fa3deb201";
k = "79d6c967ed23c763ece9ca4b026218004c84dc2d4ccc86cf05c5d0f791f6279b";
r' = "2ba2ea2d316f8937f184ad3028e364574d20a202e4e7513d7af57ac2456804d1";
s' = "64fe94968d18c5967c799e0349041b9e40e6c6c92ebb475e80dd82f51cf07320"
};
{
msg'
=
"790b06054afc9c3fc4dfe72df19dd5d68d108cfcfca6212804f6d534fd2fbe489bd8f64bf205ce04bcb50124a12ce5238fc3fe7dd76e6fa640206af52549f133d593a1bfd423ab737f3326fa79433cde293236f90d4238f0dd38ed69492ddbd9c3eae583b6325a95dec3166fe52b21658293d8c137830ef45297d67813b7a508";
d = "29c5d54d7d1f099d50f949bfce8d6073dae059c5a19cc70834722f18a7199edd";
qx' = "3088d4f45d274cc5f418c8ecc4cbcf96be87491f420250f8cbc01cdf2503ec47";
qy' = "634db48198129237ed068c88ff5809f6211921a6258f548f4b64dd125921b78b";
k = "0508ad7774908b5705895fda5c3b7a3032bf85dab7232bf981177019f3d76460";
r' = "acd9f3b63626c5f32103e90e1dd1695907b1904aa9b14f2132caef331321971b";
s' = "15c04a8bd6c13ed5e9961814b2f406f064670153e4d5465dcef63c1d9dd52a87"
};
{
msg'
=
"6d549aa87afdb8bfa60d22a68e2783b27e8db46041e4df04be0c261c4734b608a96f198d1cdb8d082ae48579ec9defcf21fbc72803764a58c31e5323d5452b9fb57c8991d31749140da7ef067b18bf0d7dfbae6eefd0d8064f334bf7e9ec1e028daed4e86e17635ec2e409a3ed1238048a45882c5c57501b314e636b9bc81cbe";
d = "0d8095da1abba06b0d349c226511f642dabbf1043ad41baa4e14297afe8a3117";
qx' = "75a45758ced45ecf55f755cb56ca2601d794ebeaeb2e6107fe2fc443f580e23c";
qy' = "5303d47d5a75ec821d51a2ee7548448208c699eca0cd89810ffc1aa4faf81ead";
k = "5165c54def4026ab648f7768c4f1488bcb183f6db7ffe02c7022a529a116482a";
r' = "ebc85fc4176b446b3384ccc62fc2526b45665561a0e7e9404ac376c90e450b59";
s' = "8b2c09428e62c5109d17ed0cf8f9fd7c370d018a2a73f701effc9b17d04852c6"
};
{
msg'
=
"1906e48b7f889ee3ff7ab0807a7aa88f53f4018808870bfed6372a77330c737647961324c2b4d46f6ee8b01190474951a701b048ae86579ff8e3fc889fecf926b17f98958ac7534e6e781ca2db2baa380dec766cfb2a3eca2a9d5818967d64dfab84f768d24ec122eebacaab0a4dc3a75f37331bb1c43dd8966cc09ec4945bbd";
d = "52fe57da3427b1a75cb816f61c4e8e0e0551b94c01382b1a80837940ed579e61";
qx' = "2177e20a2092a46667debdcc21e7e45d6da72f124adecbc5ada6a7bcc7b401d5";
qy' = "550e468f2626070a080afeeb98edd75a721eb773c8e62149f3e903cf9c4d7b61";
k = "0464fe9674b01ff5bd8be21af3399fad66f90ad30f4e8ee6e2eb9bcccfd5185c";
r' = "f8250f073f34034c1cde58f69a85e2f5a030703ebdd4dbfb98d3b3690db7d114";
s' = "a9e83e05f1d6e0fef782f186bedf43684c825ac480174d48b0e4d31505e27498"
};
{
msg'
=
"7b59fef13daf01afec35dea3276541be681c4916767f34d4e874464d20979863ee77ad0fd1635bcdf93e9f62ed69ae52ec90aab5bbf87f8951213747ccec9f38c775c1df1e9d7f735c2ce39b42edb3b0c5086247556cfea539995c5d9689765288ec600848ecf085c01ca738bbef11f5d12d4457db988b4add90be00781024ad";
d = "003d91611445919f59bfe3ca71fe0bfdeb0e39a7195e83ac03a37c7eceef0df2";
qx' = "7b9c592f61aae0555855d0b9ebb6fd00fb6746e8842e2523565c858630b9ba00";
qy' = "d35b2e168b1875bbc563bea5e8d63c4e38957c774a65e762959a349eaf263ba0";
k = "ef9df291ea27a4b45708f7608723c27d7d56b7df0599a54bc2c2fabbff373b40";
r' = "66d057fd39958b0e4932bacd70a1769bbadcb62e4470937b45497a3d4500fabb";
s' = "6c853b889e18b5a49ee54b54dd1aaedfdd642e30eba171c5cab677f0df9e7318"
};
{
msg'
=
"041a6767a935dc3d8985eb4e608b0cbfebe7f93789d4200bcfe595277ac2b0f402889b580b72def5da778a680fd380c955421f626d52dd9a83ea180187b850e1b72a4ec6dd63235e598fd15a9b19f8ce9aec1d23f0bd6ea4d92360d50f951152bc9a01354732ba0cf90aaed33c307c1de8fa3d14f9489151b8377b57c7215f0b";
d = "48f13d393899cd835c4193670ec62f28e4c4903e0bbe5817bf0996831a720bb7";
qx' = "82a1a96f4648393c5e42633ecdeb1d8245c78c5ea236b5bab460dedcc8924bc0";
qy' = "e8cbf03c34b5154f876de19f3bb6fd43cd2eabf6e7c95467bcfa8c8fc42d76fd";
k = "efed736e627899fea944007eea39a4a63c0c2e26491cd12adb546be3e5c68f7d";
r' = "cf7fc24bdaa09ac0cca8497e13298b961380668613c7493954048c06385a7044";
s' = "f38b1c8306cf82ab76ee3a772b14416b49993fe11f986e9b0f0593c52ec91525"
};
{
msg'
=
"7905a9036e022c78b2c9efd40b77b0a194fbc1d45462779b0b76ad30dc52c564e48a493d8249a061e62f26f453ba566538a4d43c64fb9fdbd1f36409316433c6f074e1b47b544a847de25fc67d81ac801ed9f7371a43da39001c90766f943e629d74d0436ba1240c3d7fab990d586a6d6ef1771786722df56448815f2feda48f";
d = "95c99cf9ec26480275f23de419e41bb779590f0eab5cf9095d37dd70cb75e870";
qx' = "42c292b0fbcc9f457ae361d940a9d45ad9427431a105a6e5cd90a345fe3507f7";
qy' = "313b08fd2fa351908b3178051ee782cc62b9954ad95d4119aa564900f8ade70c";
k = "4c08dd0f8b72ae9c674e1e448d4e2afe3a1ee69927fa23bbff3716f0b99553b7";
r' = "f2bc35eb1b8488b9e8d4a1dbb200e1abcb855458e1557dc1bf988278a174eb3b";
s' = "ed9a2ec043a1d578e8eba6f57217976310e8674385ad2da08d6146c629de1cd9"
};
{
msg'
=
"cf25e4642d4f39d15afb7aec79469d82fc9aedb8f89964e79b749a852d931d37436502804e39555f5a3c75dd958fd5291ada647c1a5e38fe7b1048f16f2b711fdd5d39acc0812ca65bd50d7f8119f2fd195ab16633503a78ee9102c1f9c4c22568e0b54bd4fa3f5ff7b49160bf23e7e2231b1ebebbdaf0e4a7d4484158a87e07";
d = "e15e835d0e2217bc7c6f05a498f20af1cd56f2f165c23d225eb3360aa2c5cbcf";
qx' = "89dd22052ec3ab4840206a62f2270c21e7836d1a9109a3407dd0974c7802b9ae";
qy' = "e91609ba35c7008b080c77a9068d97a14ca77b97299e74945217672b2fd5faf0";
k = "c9f621441c235fc47ec34eef4c08625df1ec74918e1f86075b753f2589f4c60b";
r' = "a70d1a2d555d599bfb8c9b1f0d43725341151d17a8d0845fa56f3563703528a7";
s' = "4e05c45adf41783e394a5312f86e66871c4be4896948c85966879d5c66d54b37"
};
{
msg'
=
"7562c445b35883cc937be6349b4cefc3556a80255d70f09e28c3f393daac19442a7eecedcdfbe8f7628e30cd8939537ec56d5c9645d43340eb4e78fc5dd4322de8a07966b262770d7ff13a071ff3dce560718e60ed3086b7e0003a6abafe91af90af86733ce8689440bf73d2aa0acfe9776036e877599acbabfcb03bb3b50faa";
d = "808c08c0d77423a6feaaffc8f98a2948f17726e67c15eeae4e672edbe388f98c";
qx' = "b0c0ad5e1f6001d8e9018ec611b2e3b91923e69fa6c98690ab644d650f640c42";
qy' = "610539c0b9ed21ac0a2f27527c1a61d9b47cbf033187b1a6ada006eb5b2662ed";
k = "1f6d4a905c761a53d54c362976717d0d7fc94d222bb5489e4830080a1a67535d";
r' = "83404dcf8320baf206381800071e6a75160342d19743b4f176960d669dd03d07";
s' = "3f75dcf102008b2989f81683ae45e9f1d4b67a6ef6fd5c8af44828af80e1cfb5"
};
{
msg'
=
"051c2db8e71e44653ea1cb0afc9e0abdf12658e9e761bfb767c20c7ab4adfcb18ed9b5c372a3ac11d8a43c55f7f99b33355437891686d42362abd71db8b6d84dd694d6982f0612178a937aa934b9ac3c0794c39027bdd767841c4370666c80dbc0f8132ca27474f553d266deefd7c9dbad6d734f9006bb557567701bb7e6a7c9";
d = "f7c6315f0081acd8f09c7a2c3ec1b7ece20180b0a6365a27dcd8f71b729558f9";
qx' = "250f7112d381c1751860045d9bcaf20dbeb25a001431f96ac6f19109362ffebb";
qy' = "49fba9efe73546135a5a31ab3753e247034741ce839d3d94bd73936c4a17e4aa";
k = "68c299be2c0c6d52d208d5d1a9e0ffa2af19b4833271404e5876e0aa93987866";
r' = "7b195e92d2ba95911cda7570607e112d02a1c847ddaa33924734b51f5d81adab";
s' = "10d9f206755cef70ab5143ac43f3f8d38aea2644f31d52eaf3b472ee816e11e5"
};
{
msg'
=
"4dcb7b62ba31b866fce7c1feedf0be1f67bf611dbc2e2e86f004422f67b3bc1839c6958eb1dc3ead137c3d7f88aa97244577a775c8021b1642a8647bba82871e3c15d0749ed343ea6cad38f123835d8ef66b0719273105e924e8685b65fd5dc430efbc35b05a6097f17ebc5943cdcd9abcba752b7f8f37027409bd6e11cd158f";
d = "f547735a9409386dbff719ce2dae03c50cb437d6b30cc7fa3ea20d9aec17e5a5";
qx' = "4ca87c5845fb04c2f76ae3273073b0523e356a445e4e95737260eba9e2d021db";
qy' = "0f86475d07f82655320fdf2cd8db23b21905b1b1f2f9c48e2df87e24119c4880";
k = "91bd7d97f7ed3253cedefc144771bb8acbbda6eb24f9d752bbe1dd018e1384c7";
r' = "008c1755d3df81e64e25270dbaa9396641556df7ffc7ac9add6739c382705397";
s' = "77df443c729b039aded5b516b1077fecdd9986402d2c4b01734ba91e055e87fc"
};
{
msg'
=
"efe55737771070d5ac79236b04e3fbaf4f2e9bed187d1930680fcf1aba769674bf426310f21245006f528779347d28b8aeacd2b1d5e3456dcbf188b2be8c07f19219e4067c1e7c9714784285d8bac79a76b56f2e2676ea93994f11eb573af1d03fc8ed1118eafc7f07a82f3263c33eb85e497e18f435d4076a774f42d276c323";
d = "26a1aa4b927a516b661986895aff58f40b78cc5d0c767eda7eaa3dbb835b5628";
qx' = "28afa3b0f81a0e95ad302f487a9b679fcdef8d3f40236ec4d4dbf4bb0cbba8b2";
qy' = "bb4ac1be8405cbae8a553fbc28e29e2e689fabe7def26d653a1dafc023f3cecf";
k = "f98e1933c7fad4acbe94d95c1b013e1d6931fa8f67e6dbb677b564ef7c3e56ce";
r' = "15a9a5412d6a03edd71b84c121ce9a94cdd166e40da9ce4d79f1afff6a395a53";
s' = "86bbc2b6c63bad706ec0b093578e3f064736ec69c0dba59b9e3e7f73762a4dc3"
};
{
msg'
=
"ea95859cc13cccb37198d919803be89c2ee10befdcaf5d5afa09dcc529d333ae1e4ffd3bd8ba8642203badd7a80a3f77eeee9402eed365d53f05c1a995c536f8236ba6b6ff8897393506660cc8ea82b2163aa6a1855251c87d935e23857fe35b889427b449de7274d7754bdeace960b4303c5dd5f745a5cfd580293d6548c832";
d = "6a5ca39aae2d45aa331f18a8598a3f2db32781f7c92efd4f64ee3bbe0c4c4e49";
qx' = "c62cc4a39ace01006ad48cf49a3e71466955bbeeca5d318d672695df926b3aa4";
qy' = "c85ccf517bf2ebd9ad6a9e99254def0d74d1d2fd611e328b4a3988d4f045fe6f";
k = "dac00c462bc85bf39c31b5e01df33e2ec1569e6efcb334bf18f0951992ac6160";
r' = "6e7ff8ec7a5c48e0877224a9fa8481283de45fcbee23b4c252b0c622442c26ad";
s' = "3dfac320b9c873318117da6bd856000a392b815659e5aa2a6a1852ccb2501df3"
}
] | false |
Steel.Preorder.fst | Steel.Preorder.pcm_of_preorder | val pcm_of_preorder (#a: Type u#a) (q: preorder a) : pcm (hist q) | val pcm_of_preorder (#a: Type u#a) (q: preorder a) : pcm (hist q) | let pcm_of_preorder (#a: Type u#a) (q:preorder a) : pcm (hist q) = {
p = p q;
comm = comm_op q;
assoc = (fun _ _ _ -> ());
assoc_r = (fun _ _ _ -> ());
is_unit = (fun _ -> ());
refine = (fun _ -> True)
} | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 1,
"end_line": 200,
"start_col": 0,
"start_line": 193
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x
(** If [z] extends [x] and [y], then [x] and [y] are extending one or another *)
let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl
(** If [x] extends [y], then the two heads of the traces are still related by the preorder *)
let rec extends_related_head (#a: Type u#a) (#q:preorder a) (x y:hist q)
: Lemma
(ensures
x `extends` y /\
Cons? x /\
Cons? y ==> Cons?.hd y `q` Cons?.hd x)
[SMTPat (x `extends` y)]
= match x with
| [] -> ()
| _::tl -> extends_related_head tl y | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | q: FStar.Preorder.preorder a -> FStar.PCM.pcm (Steel.Preorder.hist q) | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.preorder",
"FStar.PCM.Mkpcm",
"Steel.Preorder.hist",
"Steel.Preorder.p",
"Steel.Preorder.comm_op",
"Prims.l_and",
"FStar.PCM.__proj__Mkpcm'__item__composable",
"FStar.PCM.__proj__Mkpcm'__item__op",
"Prims.unit",
"Prims.l_True",
"Prims.prop",
"FStar.PCM.pcm"
] | [] | false | false | false | false | false | let pcm_of_preorder (#a: Type u#a) (q: preorder a) : pcm (hist q) =
| {
p = p q;
comm = comm_op q;
assoc = (fun _ _ _ -> ());
assoc_r = (fun _ _ _ -> ());
is_unit = (fun _ -> ());
refine = (fun _ -> True)
} | false |
Steel.Preorder.fst | Steel.Preorder.flip | val flip (#a: Type u#a) (p: preorder a) : preorder a | val flip (#a: Type u#a) (p: preorder a) : preorder a | let flip (#a: Type u#a) (p:preorder a) : preorder a = fun x y -> p y x | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 70,
"end_line": 237,
"start_col": 0,
"start_line": 237
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x
(** If [z] extends [x] and [y], then [x] and [y] are extending one or another *)
let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl
(** If [x] extends [y], then the two heads of the traces are still related by the preorder *)
let rec extends_related_head (#a: Type u#a) (#q:preorder a) (x y:hist q)
: Lemma
(ensures
x `extends` y /\
Cons? x /\
Cons? y ==> Cons?.hd y `q` Cons?.hd x)
[SMTPat (x `extends` y)]
= match x with
| [] -> ()
| _::tl -> extends_related_head tl y
(** Finally, we can have our fully-fledged PCM from the preorder *)
let pcm_of_preorder (#a: Type u#a) (q:preorder a) : pcm (hist q) = {
p = p q;
comm = comm_op q;
assoc = (fun _ _ _ -> ());
assoc_r = (fun _ _ _ -> ());
is_unit = (fun _ -> ());
refine = (fun _ -> True)
}
(***** Using the preorder *)
(**
We check that the preorder derived from the PCM derived from the preorder
satisfies the same properties as the original preorder. Here, we get back history
extension from frame-preserving updates.
*)
let frame_preserving_q_aux (#a : Type u#a) (q:preorder a) (x y:hist q) (z:hist q)
: Lemma (requires (frame_preserving (pcm_of_preorder q) x y /\ compatible (pcm_of_preorder q) x z))
(ensures (y `extends` z))
= ()
(** A non-empty history *)
let vhist (#a: Type u#a) (q:preorder a) = h:hist q{Cons? h}
(** Get the current value from an history *)
let curval (#a: Type u#a) (#q:preorder a) (v:vhist q) = Cons?.hd v
(**
Given a frame-preserving update from [x] to [y]
for any value of resource [z] (compatible with [x])
the new value [y] advances the history [z] in a preorder respecting manner
*)
let frame_preserving_q (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> curval z `q` curval y))
= ()
(** Still given a frame-preserving update from [x] to [y], this update extends the history *)
let frame_preserving_extends (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> y `extends` z))
= () | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | p: FStar.Preorder.preorder a -> FStar.Preorder.preorder a | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.preorder"
] | [] | false | false | false | true | false | let flip (#a: Type u#a) (p: preorder a) : preorder a =
| fun x y -> p y x | false |
Steel.Preorder.fst | Steel.Preorder.hval_tot | val hval_tot (#a #p: _) (h: history a p {Current? h}) : a | val hval_tot (#a #p: _) (h: history a p {Current? h}) : a | let hval_tot #a #p (h:history a p{Current? h}) : a =
match h with
| Current h _ -> curval h | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 27,
"end_line": 287,
"start_col": 0,
"start_line": 285
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x
(** If [z] extends [x] and [y], then [x] and [y] are extending one or another *)
let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl
(** If [x] extends [y], then the two heads of the traces are still related by the preorder *)
let rec extends_related_head (#a: Type u#a) (#q:preorder a) (x y:hist q)
: Lemma
(ensures
x `extends` y /\
Cons? x /\
Cons? y ==> Cons?.hd y `q` Cons?.hd x)
[SMTPat (x `extends` y)]
= match x with
| [] -> ()
| _::tl -> extends_related_head tl y
(** Finally, we can have our fully-fledged PCM from the preorder *)
let pcm_of_preorder (#a: Type u#a) (q:preorder a) : pcm (hist q) = {
p = p q;
comm = comm_op q;
assoc = (fun _ _ _ -> ());
assoc_r = (fun _ _ _ -> ());
is_unit = (fun _ -> ());
refine = (fun _ -> True)
}
(***** Using the preorder *)
(**
We check that the preorder derived from the PCM derived from the preorder
satisfies the same properties as the original preorder. Here, we get back history
extension from frame-preserving updates.
*)
let frame_preserving_q_aux (#a : Type u#a) (q:preorder a) (x y:hist q) (z:hist q)
: Lemma (requires (frame_preserving (pcm_of_preorder q) x y /\ compatible (pcm_of_preorder q) x z))
(ensures (y `extends` z))
= ()
(** A non-empty history *)
let vhist (#a: Type u#a) (q:preorder a) = h:hist q{Cons? h}
(** Get the current value from an history *)
let curval (#a: Type u#a) (#q:preorder a) (v:vhist q) = Cons?.hd v
(**
Given a frame-preserving update from [x] to [y]
for any value of resource [z] (compatible with [x])
the new value [y] advances the history [z] in a preorder respecting manner
*)
let frame_preserving_q (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> curval z `q` curval y))
= ()
(** Still given a frame-preserving update from [x] to [y], this update extends the history *)
let frame_preserving_extends (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> y `extends` z))
= ()
(** Helper function that flips a preoder *)
let flip (#a: Type u#a) (p:preorder a) : preorder a = fun x y -> p y x
(**
What is the preorder induced from the PCM induced by preorder [q]? It turns out that
it is the flipped of [q], reversed extension.
*)
let frame_preserving_extends2 (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> z `flip extends` y))
[SMTPat (frame_preserving (pcm_of_preorder q) x y)]
= ()
#push-options "--warn_error -271"
let pcm_of_preorder_induces_extends (#a: Type u#a) (q:preorder a)
: Lemma (induces_preorder (pcm_of_preorder q) (flip extends))
= let fp_full (x y:hist q) (f:frame_preserving_upd (pcm_of_preorder q) x y) (v:hist q)
: Lemma (requires compatible (pcm_of_preorder q) x v)
(ensures extends (f v) v)
[SMTPat ()]
= assert (composable (pcm_of_preorder q) x v) in
()
#pop-options
let extend_history (#a:Type u#a) (#q:preorder a) (h0:vhist q) (v:a{q (curval h0) v})
: h1:vhist q{h1 `extends` h0}
= v :: h0
let property (a:Type)
= a -> prop
let stable_property (#a:Type) (pcm:pcm a)
= fact:property a {
FStar.Preorder.stable fact (preorder_of_pcm pcm)
}
let fact_valid_compat (#a:Type) (#pcm:pcm a)
(fact:stable_property pcm)
(v:a)
= forall z. compatible pcm v z ==> fact z
open Steel.FractionalPermission
open FStar.Real
noeq
type history (a:Type) (p:preorder a) =
| Witnessed : hist p -> history a p
| Current : h:vhist p -> f:perm -> history a p | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | h: Steel.Preorder.history a p {Current? h} -> a | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.history",
"Prims.b2t",
"Steel.Preorder.uu___is_Current",
"Steel.Preorder.vhist",
"Steel.FractionalPermission.perm",
"Steel.Preorder.curval"
] | [] | false | false | false | false | false | let hval_tot #a #p (h: history a p {Current? h}) : a =
| match h with | Current h _ -> curval h | false |
Steel.Preorder.fst | Steel.Preorder.pcm_of_preorder_induces_extends | val pcm_of_preorder_induces_extends (#a: Type u#a) (q: preorder a)
: Lemma (induces_preorder (pcm_of_preorder q) (flip extends)) | val pcm_of_preorder_induces_extends (#a: Type u#a) (q: preorder a)
: Lemma (induces_preorder (pcm_of_preorder q) (flip extends)) | let pcm_of_preorder_induces_extends (#a: Type u#a) (q:preorder a)
: Lemma (induces_preorder (pcm_of_preorder q) (flip extends))
= let fp_full (x y:hist q) (f:frame_preserving_upd (pcm_of_preorder q) x y) (v:hist q)
: Lemma (requires compatible (pcm_of_preorder q) x v)
(ensures extends (f v) v)
[SMTPat ()]
= assert (composable (pcm_of_preorder q) x v) in
() | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 6,
"end_line": 257,
"start_col": 0,
"start_line": 250
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x
(** If [z] extends [x] and [y], then [x] and [y] are extending one or another *)
let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl
(** If [x] extends [y], then the two heads of the traces are still related by the preorder *)
let rec extends_related_head (#a: Type u#a) (#q:preorder a) (x y:hist q)
: Lemma
(ensures
x `extends` y /\
Cons? x /\
Cons? y ==> Cons?.hd y `q` Cons?.hd x)
[SMTPat (x `extends` y)]
= match x with
| [] -> ()
| _::tl -> extends_related_head tl y
(** Finally, we can have our fully-fledged PCM from the preorder *)
let pcm_of_preorder (#a: Type u#a) (q:preorder a) : pcm (hist q) = {
p = p q;
comm = comm_op q;
assoc = (fun _ _ _ -> ());
assoc_r = (fun _ _ _ -> ());
is_unit = (fun _ -> ());
refine = (fun _ -> True)
}
(***** Using the preorder *)
(**
We check that the preorder derived from the PCM derived from the preorder
satisfies the same properties as the original preorder. Here, we get back history
extension from frame-preserving updates.
*)
let frame_preserving_q_aux (#a : Type u#a) (q:preorder a) (x y:hist q) (z:hist q)
: Lemma (requires (frame_preserving (pcm_of_preorder q) x y /\ compatible (pcm_of_preorder q) x z))
(ensures (y `extends` z))
= ()
(** A non-empty history *)
let vhist (#a: Type u#a) (q:preorder a) = h:hist q{Cons? h}
(** Get the current value from an history *)
let curval (#a: Type u#a) (#q:preorder a) (v:vhist q) = Cons?.hd v
(**
Given a frame-preserving update from [x] to [y]
for any value of resource [z] (compatible with [x])
the new value [y] advances the history [z] in a preorder respecting manner
*)
let frame_preserving_q (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> curval z `q` curval y))
= ()
(** Still given a frame-preserving update from [x] to [y], this update extends the history *)
let frame_preserving_extends (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> y `extends` z))
= ()
(** Helper function that flips a preoder *)
let flip (#a: Type u#a) (p:preorder a) : preorder a = fun x y -> p y x
(**
What is the preorder induced from the PCM induced by preorder [q]? It turns out that
it is the flipped of [q], reversed extension.
*)
let frame_preserving_extends2 (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> z `flip extends` y))
[SMTPat (frame_preserving (pcm_of_preorder q) x y)]
= () | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | q: FStar.Preorder.preorder a
-> FStar.Pervasives.Lemma
(ensures
Steel.Preorder.induces_preorder (Steel.Preorder.pcm_of_preorder q)
(Steel.Preorder.flip Steel.Preorder.extends)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.hist",
"FStar.PCM.frame_preserving_upd",
"Steel.Preorder.pcm_of_preorder",
"Prims.unit",
"FStar.PCM.compatible",
"Prims.squash",
"Steel.Preorder.extends",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"Prims.Nil",
"Prims._assert",
"FStar.PCM.composable",
"Prims.l_True",
"Steel.Preorder.induces_preorder",
"Steel.Preorder.flip"
] | [] | false | false | true | false | false | let pcm_of_preorder_induces_extends (#a: Type u#a) (q: preorder a)
: Lemma (induces_preorder (pcm_of_preorder q) (flip extends)) =
| let fp_full (x y: hist q) (f: frame_preserving_upd (pcm_of_preorder q) x y) (v: hist q)
: Lemma (requires compatible (pcm_of_preorder q) x v) (ensures extends (f v) v) [SMTPat ()] =
assert (composable (pcm_of_preorder q) x v)
in
() | false |
Spec.ECDSA.Test.Vectors.fst | Spec.ECDSA.Test.Vectors.sigver_vectors_sha2_256 | val sigver_vectors_sha2_256:list vec_SigVer | val sigver_vectors_sha2_256:list vec_SigVer | let sigver_vectors_sha2_256 : list vec_SigVer = [
{ msg = "e4796db5f785f207aa30d311693b3702821dff1168fd2e04c0836825aefd850d9aa60326d88cde1a23c7745351392ca2288d632c264f197d05cd424a30336c19fd09bb229654f0222fcb881a4b35c290a093ac159ce13409111ff0358411133c24f5b8e2090d6db6558afc36f06ca1f6ef779785adba68db27a409859fc4c4a0";
qx = "87f8f2b218f49845f6f10eec3877136269f5c1a54736dbdf69f89940cad41555";
qy = "e15f369036f49842fac7a86c8a2b0557609776814448b8f5e84aa9f4395205e9";
r = "d19ff48b324915576416097d2544f7cbdf8768b1454ad20e0baac50e211f23b0";
s = "a3e81e59311cdfff2d4784949f7a2cb50ba6c3a91fa54710568e61aca3e847c6";
result = false;
};
{ msg = "069a6e6b93dfee6df6ef6997cd80dd2182c36653cef10c655d524585655462d683877f95ecc6d6c81623d8fac4e900ed0019964094e7de91f1481989ae1873004565789cbf5dc56c62aedc63f62f3b894c9c6f7788c8ecaadc9bd0e81ad91b2b3569ea12260e93924fdddd3972af5273198f5efda0746219475017557616170e";
qx = "5cf02a00d205bdfee2016f7421807fc38ae69e6b7ccd064ee689fc1a94a9f7d2";
qy = "ec530ce3cc5c9d1af463f264d685afe2b4db4b5828d7e61b748930f3ce622a85";
r = "dc23d130c6117fb5751201455e99f36f59aba1a6a21cf2d0e7481a97451d6693";
s = "d6ce7708c18dbf35d4f8aa7240922dc6823f2e7058cbc1484fcad1599db5018c";
result = false;
};
{ msg = "df04a346cf4d0e331a6db78cca2d456d31b0a000aa51441defdb97bbeb20b94d8d746429a393ba88840d661615e07def615a342abedfa4ce912e562af714959896858af817317a840dcff85a057bb91a3c2bf90105500362754a6dd321cdd86128cfc5f04667b57aa78c112411e42da304f1012d48cd6a7052d7de44ebcc01de";
qx = "2ddfd145767883ffbb0ac003ab4a44346d08fa2570b3120dcce94562422244cb";
qy = "5f70c7d11ac2b7a435ccfbbae02c3df1ea6b532cc0e9db74f93fffca7c6f9a64";
r = "9913111cff6f20c5bf453a99cd2c2019a4e749a49724a08774d14e4c113edda8";
s = "9467cd4cd21ecb56b0cab0a9a453b43386845459127a952421f5c6382866c5cc";
result = false;
};
{ msg = "e1130af6a38ccb412a9c8d13e15dbfc9e69a16385af3c3f1e5da954fd5e7c45fd75e2b8c36699228e92840c0562fbf3772f07e17f1add56588dd45f7450e1217ad239922dd9c32695dc71ff2424ca0dec1321aa47064a044b7fe3c2b97d03ce470a592304c5ef21eed9f93da56bb232d1eeb0035f9bf0dfafdcc4606272b20a3";
qx = "e424dc61d4bb3cb7ef4344a7f8957a0c5134e16f7a67c074f82e6e12f49abf3c";
qy = "970eed7aa2bc48651545949de1dddaf0127e5965ac85d1243d6f60e7dfaee927";
r = "bf96b99aa49c705c910be33142017c642ff540c76349b9dab72f981fd9347f4f";
s = "17c55095819089c2e03b9cd415abdf12444e323075d98f31920b9e0f57ec871c";
result = true;
};
{ msg = "73c5f6a67456ae48209b5f85d1e7de7758bf235300c6ae2bdceb1dcb27a7730fb68c950b7fcada0ecc4661d3578230f225a875e69aaa17f1e71c6be5c831f22663bac63d0c7a9635edb0043ff8c6f26470f02a7bc56556f1437f06dfa27b487a6c4290d8bad38d4879b334e341ba092dde4e4ae694a9c09302e2dbf443581c08";
qx = "e0fc6a6f50e1c57475673ee54e3a57f9a49f3328e743bf52f335e3eeaa3d2864";
qy = "7f59d689c91e463607d9194d99faf316e25432870816dde63f5d4b373f12f22a";
r = "1d75830cd36f4c9aa181b2c4221e87f176b7f05b7c87824e82e396c88315c407";
s = "cb2acb01dac96efc53a32d4a0d85d0c2e48955214783ecf50a4f0414a319c05a";
result = true;
};
{ msg = "666036d9b4a2426ed6585a4e0fd931a8761451d29ab04bd7dc6d0c5b9e38e6c2b263ff6cb837bd04399de3d757c6c7005f6d7a987063cf6d7e8cb38a4bf0d74a282572bd01d0f41e3fd066e3021575f0fa04f27b700d5b7ddddf50965993c3f9c7118ed78888da7cb221849b3260592b8e632d7c51e935a0ceae15207bedd548";
qx = "a849bef575cac3c6920fbce675c3b787136209f855de19ffe2e8d29b31a5ad86";
qy = "bf5fe4f7858f9b805bd8dcc05ad5e7fb889de2f822f3d8b41694e6c55c16b471";
r = "25acc3aa9d9e84c7abf08f73fa4195acc506491d6fc37cb9074528a7db87b9d6";
s = "9b21d5b5259ed3f2ef07dfec6cc90d3a37855d1ce122a85ba6a333f307d31537";
result = false;
};
{ msg = "7e80436bce57339ce8da1b5660149a20240b146d108deef3ec5da4ae256f8f894edcbbc57b34ce37089c0daa17f0c46cd82b5a1599314fd79d2fd2f446bd5a25b8e32fcf05b76d644573a6df4ad1dfea707b479d97237a346f1ec632ea5660efb57e8717a8628d7f82af50a4e84b11f21bdff6839196a880ae20b2a0918d58cd";
qx = "3dfb6f40f2471b29b77fdccba72d37c21bba019efa40c1c8f91ec405d7dcc5df";
qy = "f22f953f1e395a52ead7f3ae3fc47451b438117b1e04d613bc8555b7d6e6d1bb";
r = "548886278e5ec26bed811dbb72db1e154b6f17be70deb1b210107decb1ec2a5a";
s = "e93bfebd2f14f3d827ca32b464be6e69187f5edbd52def4f96599c37d58eee75";
result = false;
};
{ msg = "1669bfb657fdc62c3ddd63269787fc1c969f1850fb04c933dda063ef74a56ce13e3a649700820f0061efabf849a85d474326c8a541d99830eea8131eaea584f22d88c353965dabcdc4bf6b55949fd529507dfb803ab6b480cd73ca0ba00ca19c438849e2cea262a1c57d8f81cd257fb58e19dec7904da97d8386e87b84948169";
qx = "69b7667056e1e11d6caf6e45643f8b21e7a4bebda463c7fdbc13bc98efbd0214";
qy = "d3f9b12eb46c7c6fda0da3fc85bc1fd831557f9abc902a3be3cb3e8be7d1aa2f";
r = "288f7a1cd391842cce21f00e6f15471c04dc182fe4b14d92dc18910879799790";
s = "247b3c4e89a3bcadfea73c7bfd361def43715fa382b8c3edf4ae15d6e55e9979";
result = false;
};
{ msg = "3fe60dd9ad6caccf5a6f583b3ae65953563446c4510b70da115ffaa0ba04c076115c7043ab8733403cd69c7d14c212c655c07b43a7c71b9a4cffe22c2684788ec6870dc2013f269172c822256f9e7cc674791bf2d8486c0f5684283e1649576efc982ede17c7b74b214754d70402fb4bb45ad086cf2cf76b3d63f7fce39ac970";
qx = "bf02cbcf6d8cc26e91766d8af0b164fc5968535e84c158eb3bc4e2d79c3cc682";
qy = "069ba6cb06b49d60812066afa16ecf7b51352f2c03bd93ec220822b1f3dfba03";
r = "f5acb06c59c2b4927fb852faa07faf4b1852bbb5d06840935e849c4d293d1bad";
s = "049dab79c89cc02f1484c437f523e080a75f134917fda752f2d5ca397addfe5d";
result = false;
};
{ msg = "983a71b9994d95e876d84d28946a041f8f0a3f544cfcc055496580f1dfd4e312a2ad418fe69dbc61db230cc0c0ed97e360abab7d6ff4b81ee970a7e97466acfd9644f828ffec538abc383d0e92326d1c88c55e1f46a668a039beaa1be631a89129938c00a81a3ae46d4aecbf9707f764dbaccea3ef7665e4c4307fa0b0a3075c";
qx = "224a4d65b958f6d6afb2904863efd2a734b31798884801fcab5a590f4d6da9de";
qy = "178d51fddada62806f097aa615d33b8f2404e6b1479f5fd4859d595734d6d2b9";
r = "87b93ee2fecfda54deb8dff8e426f3c72c8864991f8ec2b3205bb3b416de93d2";
s = "4044a24df85be0cc76f21a4430b75b8e77b932a87f51e4eccbc45c263ebf8f66";
result = false;
};
{ msg = "4a8c071ac4fd0d52faa407b0fe5dab759f7394a5832127f2a3498f34aac287339e043b4ffa79528faf199dc917f7b066ad65505dab0e11e6948515052ce20cfdb892ffb8aa9bf3f1aa5be30a5bbe85823bddf70b39fd7ebd4a93a2f75472c1d4f606247a9821f1a8c45a6cb80545de2e0c6c0174e2392088c754e9c8443eb5af";
qx = "43691c7795a57ead8c5c68536fe934538d46f12889680a9cb6d055a066228369";
qy = "f8790110b3c3b281aa1eae037d4f1234aff587d903d93ba3af225c27ddc9ccac";
r = "8acd62e8c262fa50dd9840480969f4ef70f218ebf8ef9584f199031132c6b1ce";
s = "cfca7ed3d4347fb2a29e526b43c348ae1ce6c60d44f3191b6d8ea3a2d9c92154";
result = false;
};
{ msg = "0a3a12c3084c865daf1d302c78215d39bfe0b8bf28272b3c0b74beb4b7409db0718239de700785581514321c6440a4bbaea4c76fa47401e151e68cb6c29017f0bce4631290af5ea5e2bf3ed742ae110b04ade83a5dbd7358f29a85938e23d87ac8233072b79c94670ff0959f9c7f4517862ff829452096c78f5f2e9a7e4e9216";
qx = "9157dbfcf8cf385f5bb1568ad5c6e2a8652ba6dfc63bc1753edf5268cb7eb596";
qy = "972570f4313d47fc96f7c02d5594d77d46f91e949808825b3d31f029e8296405";
r = "dfaea6f297fa320b707866125c2a7d5d515b51a503bee817de9faa343cc48eeb";
s = "8f780ad713f9c3e5a4f7fa4c519833dfefc6a7432389b1e4af463961f09764f2";
result = false;
};
{ msg = "785d07a3c54f63dca11f5d1a5f496ee2c2f9288e55007e666c78b007d95cc28581dce51f490b30fa73dc9e2d45d075d7e3a95fb8a9e1465ad191904124160b7c60fa720ef4ef1c5d2998f40570ae2a870ef3e894c2bc617d8a1dc85c3c55774928c38789b4e661349d3f84d2441a3b856a76949b9f1f80bc161648a1cad5588e";
qx = "072b10c081a4c1713a294f248aef850e297991aca47fa96a7470abe3b8acfdda";
qy = "9581145cca04a0fb94cedce752c8f0370861916d2a94e7c647c5373ce6a4c8f5";
r = "09f5483eccec80f9d104815a1be9cc1a8e5b12b6eb482a65c6907b7480cf4f19";
s = "a4f90e560c5e4eb8696cb276e5165b6a9d486345dedfb094a76e8442d026378d";
result = false;
};
{ msg = "76f987ec5448dd72219bd30bf6b66b0775c80b394851a43ff1f537f140a6e7229ef8cd72ad58b1d2d20298539d6347dd5598812bc65323aceaf05228f738b5ad3e8d9fe4100fd767c2f098c77cb99c2992843ba3eed91d32444f3b6db6cd212dd4e5609548f4bb62812a920f6e2bf1581be1ebeebdd06ec4e971862cc42055ca";
qx = "09308ea5bfad6e5adf408634b3d5ce9240d35442f7fe116452aaec0d25be8c24";
qy = "f40c93e023ef494b1c3079b2d10ef67f3170740495ce2cc57f8ee4b0618b8ee5";
r = "5cc8aa7c35743ec0c23dde88dabd5e4fcd0192d2116f6926fef788cddb754e73";
s = "9c9c045ebaa1b828c32f82ace0d18daebf5e156eb7cbfdc1eff4399a8a900ae7";
result = false;
};
{ msg = "60cd64b2cd2be6c33859b94875120361a24085f3765cb8b2bf11e026fa9d8855dbe435acf7882e84f3c7857f96e2baab4d9afe4588e4a82e17a78827bfdb5ddbd1c211fbc2e6d884cddd7cb9d90d5bf4a7311b83f352508033812c776a0e00c003c7e0d628e50736c7512df0acfa9f2320bd102229f46495ae6d0857cc452a84";
qx = "2d98ea01f754d34bbc3003df5050200abf445ec728556d7ed7d5c54c55552b6d";
qy = "9b52672742d637a32add056dfd6d8792f2a33c2e69dafabea09b960bc61e230a";
r = "06108e525f845d0155bf60193222b3219c98e3d49424c2fb2a0987f825c17959";
s = "62b5cdd591e5b507e560167ba8f6f7cda74673eb315680cb89ccbc4eec477dce";
result = true;
};
] | {
"file_name": "specs/tests/p256/Spec.ECDSA.Test.Vectors.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 1,
"end_line": 138,
"start_col": 1,
"start_line": 32
} | module Spec.ECDSA.Test.Vectors
open Lib.Meta
#set-options "--fuel 0 --ifuel 0"
///
/// ECDSA test vectors from NIST CAVP
/// https://csrc.nist.gov/Projects/Cryptographic-Algorithm-Validation-Program/Digital-Signatures#ecdsa2vs
///
type vec_SigVer = {
msg: hex_string;
qx: hex_string;
qy: hex_string;
r: hex_string;
s: hex_string;
result: bool;
}
type vec_SigGen = {
msg': hex_string;
d: hex_string;
qx': hex_string;
qy': hex_string;
k: hex_string;
r': hex_string;
s': hex_string;
} | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Meta.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.ECDSA.Test.Vectors.fst"
} | [
{
"abbrev": false,
"full_module": "Lib.Meta",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.ECDSA.Test",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.ECDSA.Test",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Prims.list Spec.ECDSA.Test.Vectors.vec_SigVer | Prims.Tot | [
"total"
] | [] | [
"Prims.Cons",
"Spec.ECDSA.Test.Vectors.vec_SigVer",
"Spec.ECDSA.Test.Vectors.Mkvec_SigVer",
"Prims.Nil"
] | [] | false | false | false | true | false | let sigver_vectors_sha2_256:list vec_SigVer =
| [
{
msg
=
"e4796db5f785f207aa30d311693b3702821dff1168fd2e04c0836825aefd850d9aa60326d88cde1a23c7745351392ca2288d632c264f197d05cd424a30336c19fd09bb229654f0222fcb881a4b35c290a093ac159ce13409111ff0358411133c24f5b8e2090d6db6558afc36f06ca1f6ef779785adba68db27a409859fc4c4a0";
qx = "87f8f2b218f49845f6f10eec3877136269f5c1a54736dbdf69f89940cad41555";
qy = "e15f369036f49842fac7a86c8a2b0557609776814448b8f5e84aa9f4395205e9";
r = "d19ff48b324915576416097d2544f7cbdf8768b1454ad20e0baac50e211f23b0";
s = "a3e81e59311cdfff2d4784949f7a2cb50ba6c3a91fa54710568e61aca3e847c6";
result = false
};
{
msg
=
"069a6e6b93dfee6df6ef6997cd80dd2182c36653cef10c655d524585655462d683877f95ecc6d6c81623d8fac4e900ed0019964094e7de91f1481989ae1873004565789cbf5dc56c62aedc63f62f3b894c9c6f7788c8ecaadc9bd0e81ad91b2b3569ea12260e93924fdddd3972af5273198f5efda0746219475017557616170e";
qx = "5cf02a00d205bdfee2016f7421807fc38ae69e6b7ccd064ee689fc1a94a9f7d2";
qy = "ec530ce3cc5c9d1af463f264d685afe2b4db4b5828d7e61b748930f3ce622a85";
r = "dc23d130c6117fb5751201455e99f36f59aba1a6a21cf2d0e7481a97451d6693";
s = "d6ce7708c18dbf35d4f8aa7240922dc6823f2e7058cbc1484fcad1599db5018c";
result = false
};
{
msg
=
"df04a346cf4d0e331a6db78cca2d456d31b0a000aa51441defdb97bbeb20b94d8d746429a393ba88840d661615e07def615a342abedfa4ce912e562af714959896858af817317a840dcff85a057bb91a3c2bf90105500362754a6dd321cdd86128cfc5f04667b57aa78c112411e42da304f1012d48cd6a7052d7de44ebcc01de";
qx = "2ddfd145767883ffbb0ac003ab4a44346d08fa2570b3120dcce94562422244cb";
qy = "5f70c7d11ac2b7a435ccfbbae02c3df1ea6b532cc0e9db74f93fffca7c6f9a64";
r = "9913111cff6f20c5bf453a99cd2c2019a4e749a49724a08774d14e4c113edda8";
s = "9467cd4cd21ecb56b0cab0a9a453b43386845459127a952421f5c6382866c5cc";
result = false
};
{
msg
=
"e1130af6a38ccb412a9c8d13e15dbfc9e69a16385af3c3f1e5da954fd5e7c45fd75e2b8c36699228e92840c0562fbf3772f07e17f1add56588dd45f7450e1217ad239922dd9c32695dc71ff2424ca0dec1321aa47064a044b7fe3c2b97d03ce470a592304c5ef21eed9f93da56bb232d1eeb0035f9bf0dfafdcc4606272b20a3";
qx = "e424dc61d4bb3cb7ef4344a7f8957a0c5134e16f7a67c074f82e6e12f49abf3c";
qy = "970eed7aa2bc48651545949de1dddaf0127e5965ac85d1243d6f60e7dfaee927";
r = "bf96b99aa49c705c910be33142017c642ff540c76349b9dab72f981fd9347f4f";
s = "17c55095819089c2e03b9cd415abdf12444e323075d98f31920b9e0f57ec871c";
result = true
};
{
msg
=
"73c5f6a67456ae48209b5f85d1e7de7758bf235300c6ae2bdceb1dcb27a7730fb68c950b7fcada0ecc4661d3578230f225a875e69aaa17f1e71c6be5c831f22663bac63d0c7a9635edb0043ff8c6f26470f02a7bc56556f1437f06dfa27b487a6c4290d8bad38d4879b334e341ba092dde4e4ae694a9c09302e2dbf443581c08";
qx = "e0fc6a6f50e1c57475673ee54e3a57f9a49f3328e743bf52f335e3eeaa3d2864";
qy = "7f59d689c91e463607d9194d99faf316e25432870816dde63f5d4b373f12f22a";
r = "1d75830cd36f4c9aa181b2c4221e87f176b7f05b7c87824e82e396c88315c407";
s = "cb2acb01dac96efc53a32d4a0d85d0c2e48955214783ecf50a4f0414a319c05a";
result = true
};
{
msg
=
"666036d9b4a2426ed6585a4e0fd931a8761451d29ab04bd7dc6d0c5b9e38e6c2b263ff6cb837bd04399de3d757c6c7005f6d7a987063cf6d7e8cb38a4bf0d74a282572bd01d0f41e3fd066e3021575f0fa04f27b700d5b7ddddf50965993c3f9c7118ed78888da7cb221849b3260592b8e632d7c51e935a0ceae15207bedd548";
qx = "a849bef575cac3c6920fbce675c3b787136209f855de19ffe2e8d29b31a5ad86";
qy = "bf5fe4f7858f9b805bd8dcc05ad5e7fb889de2f822f3d8b41694e6c55c16b471";
r = "25acc3aa9d9e84c7abf08f73fa4195acc506491d6fc37cb9074528a7db87b9d6";
s = "9b21d5b5259ed3f2ef07dfec6cc90d3a37855d1ce122a85ba6a333f307d31537";
result = false
};
{
msg
=
"7e80436bce57339ce8da1b5660149a20240b146d108deef3ec5da4ae256f8f894edcbbc57b34ce37089c0daa17f0c46cd82b5a1599314fd79d2fd2f446bd5a25b8e32fcf05b76d644573a6df4ad1dfea707b479d97237a346f1ec632ea5660efb57e8717a8628d7f82af50a4e84b11f21bdff6839196a880ae20b2a0918d58cd";
qx = "3dfb6f40f2471b29b77fdccba72d37c21bba019efa40c1c8f91ec405d7dcc5df";
qy = "f22f953f1e395a52ead7f3ae3fc47451b438117b1e04d613bc8555b7d6e6d1bb";
r = "548886278e5ec26bed811dbb72db1e154b6f17be70deb1b210107decb1ec2a5a";
s = "e93bfebd2f14f3d827ca32b464be6e69187f5edbd52def4f96599c37d58eee75";
result = false
};
{
msg
=
"1669bfb657fdc62c3ddd63269787fc1c969f1850fb04c933dda063ef74a56ce13e3a649700820f0061efabf849a85d474326c8a541d99830eea8131eaea584f22d88c353965dabcdc4bf6b55949fd529507dfb803ab6b480cd73ca0ba00ca19c438849e2cea262a1c57d8f81cd257fb58e19dec7904da97d8386e87b84948169";
qx = "69b7667056e1e11d6caf6e45643f8b21e7a4bebda463c7fdbc13bc98efbd0214";
qy = "d3f9b12eb46c7c6fda0da3fc85bc1fd831557f9abc902a3be3cb3e8be7d1aa2f";
r = "288f7a1cd391842cce21f00e6f15471c04dc182fe4b14d92dc18910879799790";
s = "247b3c4e89a3bcadfea73c7bfd361def43715fa382b8c3edf4ae15d6e55e9979";
result = false
};
{
msg
=
"3fe60dd9ad6caccf5a6f583b3ae65953563446c4510b70da115ffaa0ba04c076115c7043ab8733403cd69c7d14c212c655c07b43a7c71b9a4cffe22c2684788ec6870dc2013f269172c822256f9e7cc674791bf2d8486c0f5684283e1649576efc982ede17c7b74b214754d70402fb4bb45ad086cf2cf76b3d63f7fce39ac970";
qx = "bf02cbcf6d8cc26e91766d8af0b164fc5968535e84c158eb3bc4e2d79c3cc682";
qy = "069ba6cb06b49d60812066afa16ecf7b51352f2c03bd93ec220822b1f3dfba03";
r = "f5acb06c59c2b4927fb852faa07faf4b1852bbb5d06840935e849c4d293d1bad";
s = "049dab79c89cc02f1484c437f523e080a75f134917fda752f2d5ca397addfe5d";
result = false
};
{
msg
=
"983a71b9994d95e876d84d28946a041f8f0a3f544cfcc055496580f1dfd4e312a2ad418fe69dbc61db230cc0c0ed97e360abab7d6ff4b81ee970a7e97466acfd9644f828ffec538abc383d0e92326d1c88c55e1f46a668a039beaa1be631a89129938c00a81a3ae46d4aecbf9707f764dbaccea3ef7665e4c4307fa0b0a3075c";
qx = "224a4d65b958f6d6afb2904863efd2a734b31798884801fcab5a590f4d6da9de";
qy = "178d51fddada62806f097aa615d33b8f2404e6b1479f5fd4859d595734d6d2b9";
r = "87b93ee2fecfda54deb8dff8e426f3c72c8864991f8ec2b3205bb3b416de93d2";
s = "4044a24df85be0cc76f21a4430b75b8e77b932a87f51e4eccbc45c263ebf8f66";
result = false
};
{
msg
=
"4a8c071ac4fd0d52faa407b0fe5dab759f7394a5832127f2a3498f34aac287339e043b4ffa79528faf199dc917f7b066ad65505dab0e11e6948515052ce20cfdb892ffb8aa9bf3f1aa5be30a5bbe85823bddf70b39fd7ebd4a93a2f75472c1d4f606247a9821f1a8c45a6cb80545de2e0c6c0174e2392088c754e9c8443eb5af";
qx = "43691c7795a57ead8c5c68536fe934538d46f12889680a9cb6d055a066228369";
qy = "f8790110b3c3b281aa1eae037d4f1234aff587d903d93ba3af225c27ddc9ccac";
r = "8acd62e8c262fa50dd9840480969f4ef70f218ebf8ef9584f199031132c6b1ce";
s = "cfca7ed3d4347fb2a29e526b43c348ae1ce6c60d44f3191b6d8ea3a2d9c92154";
result = false
};
{
msg
=
"0a3a12c3084c865daf1d302c78215d39bfe0b8bf28272b3c0b74beb4b7409db0718239de700785581514321c6440a4bbaea4c76fa47401e151e68cb6c29017f0bce4631290af5ea5e2bf3ed742ae110b04ade83a5dbd7358f29a85938e23d87ac8233072b79c94670ff0959f9c7f4517862ff829452096c78f5f2e9a7e4e9216";
qx = "9157dbfcf8cf385f5bb1568ad5c6e2a8652ba6dfc63bc1753edf5268cb7eb596";
qy = "972570f4313d47fc96f7c02d5594d77d46f91e949808825b3d31f029e8296405";
r = "dfaea6f297fa320b707866125c2a7d5d515b51a503bee817de9faa343cc48eeb";
s = "8f780ad713f9c3e5a4f7fa4c519833dfefc6a7432389b1e4af463961f09764f2";
result = false
};
{
msg
=
"785d07a3c54f63dca11f5d1a5f496ee2c2f9288e55007e666c78b007d95cc28581dce51f490b30fa73dc9e2d45d075d7e3a95fb8a9e1465ad191904124160b7c60fa720ef4ef1c5d2998f40570ae2a870ef3e894c2bc617d8a1dc85c3c55774928c38789b4e661349d3f84d2441a3b856a76949b9f1f80bc161648a1cad5588e";
qx = "072b10c081a4c1713a294f248aef850e297991aca47fa96a7470abe3b8acfdda";
qy = "9581145cca04a0fb94cedce752c8f0370861916d2a94e7c647c5373ce6a4c8f5";
r = "09f5483eccec80f9d104815a1be9cc1a8e5b12b6eb482a65c6907b7480cf4f19";
s = "a4f90e560c5e4eb8696cb276e5165b6a9d486345dedfb094a76e8442d026378d";
result = false
};
{
msg
=
"76f987ec5448dd72219bd30bf6b66b0775c80b394851a43ff1f537f140a6e7229ef8cd72ad58b1d2d20298539d6347dd5598812bc65323aceaf05228f738b5ad3e8d9fe4100fd767c2f098c77cb99c2992843ba3eed91d32444f3b6db6cd212dd4e5609548f4bb62812a920f6e2bf1581be1ebeebdd06ec4e971862cc42055ca";
qx = "09308ea5bfad6e5adf408634b3d5ce9240d35442f7fe116452aaec0d25be8c24";
qy = "f40c93e023ef494b1c3079b2d10ef67f3170740495ce2cc57f8ee4b0618b8ee5";
r = "5cc8aa7c35743ec0c23dde88dabd5e4fcd0192d2116f6926fef788cddb754e73";
s = "9c9c045ebaa1b828c32f82ace0d18daebf5e156eb7cbfdc1eff4399a8a900ae7";
result = false
};
{
msg
=
"60cd64b2cd2be6c33859b94875120361a24085f3765cb8b2bf11e026fa9d8855dbe435acf7882e84f3c7857f96e2baab4d9afe4588e4a82e17a78827bfdb5ddbd1c211fbc2e6d884cddd7cb9d90d5bf4a7311b83f352508033812c776a0e00c003c7e0d628e50736c7512df0acfa9f2320bd102229f46495ae6d0857cc452a84";
qx = "2d98ea01f754d34bbc3003df5050200abf445ec728556d7ed7d5c54c55552b6d";
qy = "9b52672742d637a32add056dfd6d8792f2a33c2e69dafabea09b960bc61e230a";
r = "06108e525f845d0155bf60193222b3219c98e3d49424c2fb2a0987f825c17959";
s = "62b5cdd591e5b507e560167ba8f6f7cda74673eb315680cb89ccbc4eec477dce";
result = true
}
] | false |
Steel.Preorder.fst | Steel.Preorder.extend_history | val extend_history (#a: Type u#a) (#q: preorder a) (h0: vhist q) (v: a{q (curval h0) v})
: h1: vhist q {h1 `extends` h0} | val extend_history (#a: Type u#a) (#q: preorder a) (h0: vhist q) (v: a{q (curval h0) v})
: h1: vhist q {h1 `extends` h0} | let extend_history (#a:Type u#a) (#q:preorder a) (h0:vhist q) (v:a{q (curval h0) v})
: h1:vhist q{h1 `extends` h0}
= v :: h0 | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 11,
"end_line": 262,
"start_col": 0,
"start_line": 260
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x
(** If [z] extends [x] and [y], then [x] and [y] are extending one or another *)
let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl
(** If [x] extends [y], then the two heads of the traces are still related by the preorder *)
let rec extends_related_head (#a: Type u#a) (#q:preorder a) (x y:hist q)
: Lemma
(ensures
x `extends` y /\
Cons? x /\
Cons? y ==> Cons?.hd y `q` Cons?.hd x)
[SMTPat (x `extends` y)]
= match x with
| [] -> ()
| _::tl -> extends_related_head tl y
(** Finally, we can have our fully-fledged PCM from the preorder *)
let pcm_of_preorder (#a: Type u#a) (q:preorder a) : pcm (hist q) = {
p = p q;
comm = comm_op q;
assoc = (fun _ _ _ -> ());
assoc_r = (fun _ _ _ -> ());
is_unit = (fun _ -> ());
refine = (fun _ -> True)
}
(***** Using the preorder *)
(**
We check that the preorder derived from the PCM derived from the preorder
satisfies the same properties as the original preorder. Here, we get back history
extension from frame-preserving updates.
*)
let frame_preserving_q_aux (#a : Type u#a) (q:preorder a) (x y:hist q) (z:hist q)
: Lemma (requires (frame_preserving (pcm_of_preorder q) x y /\ compatible (pcm_of_preorder q) x z))
(ensures (y `extends` z))
= ()
(** A non-empty history *)
let vhist (#a: Type u#a) (q:preorder a) = h:hist q{Cons? h}
(** Get the current value from an history *)
let curval (#a: Type u#a) (#q:preorder a) (v:vhist q) = Cons?.hd v
(**
Given a frame-preserving update from [x] to [y]
for any value of resource [z] (compatible with [x])
the new value [y] advances the history [z] in a preorder respecting manner
*)
let frame_preserving_q (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> curval z `q` curval y))
= ()
(** Still given a frame-preserving update from [x] to [y], this update extends the history *)
let frame_preserving_extends (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> y `extends` z))
= ()
(** Helper function that flips a preoder *)
let flip (#a: Type u#a) (p:preorder a) : preorder a = fun x y -> p y x
(**
What is the preorder induced from the PCM induced by preorder [q]? It turns out that
it is the flipped of [q], reversed extension.
*)
let frame_preserving_extends2 (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> z `flip extends` y))
[SMTPat (frame_preserving (pcm_of_preorder q) x y)]
= ()
#push-options "--warn_error -271"
let pcm_of_preorder_induces_extends (#a: Type u#a) (q:preorder a)
: Lemma (induces_preorder (pcm_of_preorder q) (flip extends))
= let fp_full (x y:hist q) (f:frame_preserving_upd (pcm_of_preorder q) x y) (v:hist q)
: Lemma (requires compatible (pcm_of_preorder q) x v)
(ensures extends (f v) v)
[SMTPat ()]
= assert (composable (pcm_of_preorder q) x v) in
()
#pop-options | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | h0: Steel.Preorder.vhist q -> v: a{q (Steel.Preorder.curval h0) v}
-> h1: Steel.Preorder.vhist q {Steel.Preorder.extends h1 h0} | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.vhist",
"Steel.Preorder.curval",
"Prims.Cons",
"Steel.Preorder.extends"
] | [] | false | false | false | false | false | let extend_history (#a: Type u#a) (#q: preorder a) (h0: vhist q) (v: a{q (curval h0) v})
: h1: vhist q {h1 `extends` h0} =
| v :: h0 | false |
Steel.Preorder.fst | Steel.Preorder.hperm | val hperm (#a #p: _) (h: history a p {Current? h}) : perm | val hperm (#a #p: _) (h: history a p {Current? h}) : perm | let hperm #a #p (h:history a p{Current? h}) : perm =
match h with
| Current _ f -> f | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 20,
"end_line": 294,
"start_col": 0,
"start_line": 292
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x
(** If [z] extends [x] and [y], then [x] and [y] are extending one or another *)
let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl
(** If [x] extends [y], then the two heads of the traces are still related by the preorder *)
let rec extends_related_head (#a: Type u#a) (#q:preorder a) (x y:hist q)
: Lemma
(ensures
x `extends` y /\
Cons? x /\
Cons? y ==> Cons?.hd y `q` Cons?.hd x)
[SMTPat (x `extends` y)]
= match x with
| [] -> ()
| _::tl -> extends_related_head tl y
(** Finally, we can have our fully-fledged PCM from the preorder *)
let pcm_of_preorder (#a: Type u#a) (q:preorder a) : pcm (hist q) = {
p = p q;
comm = comm_op q;
assoc = (fun _ _ _ -> ());
assoc_r = (fun _ _ _ -> ());
is_unit = (fun _ -> ());
refine = (fun _ -> True)
}
(***** Using the preorder *)
(**
We check that the preorder derived from the PCM derived from the preorder
satisfies the same properties as the original preorder. Here, we get back history
extension from frame-preserving updates.
*)
let frame_preserving_q_aux (#a : Type u#a) (q:preorder a) (x y:hist q) (z:hist q)
: Lemma (requires (frame_preserving (pcm_of_preorder q) x y /\ compatible (pcm_of_preorder q) x z))
(ensures (y `extends` z))
= ()
(** A non-empty history *)
let vhist (#a: Type u#a) (q:preorder a) = h:hist q{Cons? h}
(** Get the current value from an history *)
let curval (#a: Type u#a) (#q:preorder a) (v:vhist q) = Cons?.hd v
(**
Given a frame-preserving update from [x] to [y]
for any value of resource [z] (compatible with [x])
the new value [y] advances the history [z] in a preorder respecting manner
*)
let frame_preserving_q (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> curval z `q` curval y))
= ()
(** Still given a frame-preserving update from [x] to [y], this update extends the history *)
let frame_preserving_extends (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> y `extends` z))
= ()
(** Helper function that flips a preoder *)
let flip (#a: Type u#a) (p:preorder a) : preorder a = fun x y -> p y x
(**
What is the preorder induced from the PCM induced by preorder [q]? It turns out that
it is the flipped of [q], reversed extension.
*)
let frame_preserving_extends2 (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> z `flip extends` y))
[SMTPat (frame_preserving (pcm_of_preorder q) x y)]
= ()
#push-options "--warn_error -271"
let pcm_of_preorder_induces_extends (#a: Type u#a) (q:preorder a)
: Lemma (induces_preorder (pcm_of_preorder q) (flip extends))
= let fp_full (x y:hist q) (f:frame_preserving_upd (pcm_of_preorder q) x y) (v:hist q)
: Lemma (requires compatible (pcm_of_preorder q) x v)
(ensures extends (f v) v)
[SMTPat ()]
= assert (composable (pcm_of_preorder q) x v) in
()
#pop-options
let extend_history (#a:Type u#a) (#q:preorder a) (h0:vhist q) (v:a{q (curval h0) v})
: h1:vhist q{h1 `extends` h0}
= v :: h0
let property (a:Type)
= a -> prop
let stable_property (#a:Type) (pcm:pcm a)
= fact:property a {
FStar.Preorder.stable fact (preorder_of_pcm pcm)
}
let fact_valid_compat (#a:Type) (#pcm:pcm a)
(fact:stable_property pcm)
(v:a)
= forall z. compatible pcm v z ==> fact z
open Steel.FractionalPermission
open FStar.Real
noeq
type history (a:Type) (p:preorder a) =
| Witnessed : hist p -> history a p
| Current : h:vhist p -> f:perm -> history a p
let hval_tot #a #p (h:history a p{Current? h}) : a =
match h with
| Current h _ -> curval h
let hval #a #p (h:history a p{Current? h}) : Ghost.erased a =
hval_tot h | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | h: Steel.Preorder.history a p {Current? h} -> Steel.FractionalPermission.perm | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.history",
"Prims.b2t",
"Steel.Preorder.uu___is_Current",
"Steel.Preorder.vhist",
"Steel.FractionalPermission.perm"
] | [] | false | false | false | false | false | let hperm #a #p (h: history a p {Current? h}) : perm =
| match h with | Current _ f -> f | false |
Hacl.Spec.Curve25519.Field64.Lemmas.fst | Hacl.Spec.Curve25519.Field64.Lemmas.lemma_carry_pass_store_f3 | val lemma_carry_pass_store_f3: f:lseq uint64 4 ->
Lemma (let top_bit = f.[3] >>. 63ul in
let f3' = f.[3] &. u64 0x7fffffffffffffff in
v top_bit == SD.bn_v f / pow2 255 /\ v top_bit <= 1 /\
v f3' = v f.[3] % pow2 63 /\
v f.[3] == v top_bit * pow2 63 + v f3') | val lemma_carry_pass_store_f3: f:lseq uint64 4 ->
Lemma (let top_bit = f.[3] >>. 63ul in
let f3' = f.[3] &. u64 0x7fffffffffffffff in
v top_bit == SD.bn_v f / pow2 255 /\ v top_bit <= 1 /\
v f3' = v f.[3] % pow2 63 /\
v f.[3] == v top_bit * pow2 63 + v f3') | let lemma_carry_pass_store_f3 f =
let top_bit = f.[3] >>. 63ul in
assert (SL.bn_get_ith_bit f 255 == ((f.[3] >>. 63ul) &. u64 1));
mod_mask_lemma top_bit 1ul;
assert (v (mod_mask #U64 #SEC 1ul) == v (u64 1));
SL.bn_get_ith_bit_lemma f 255;
assert (v top_bit == SD.bn_v f / pow2 255 % 2);
SD.bn_eval_bound f 4;
Math.Lemmas.lemma_div_lt_nat (SD.bn_v f) 256 255;
Math.Lemmas.small_mod (SD.bn_v f / pow2 255) 2;
assert (v top_bit == SD.bn_v f / pow2 255);
let f3' = f.[3] &. u64 0x7fffffffffffffff in
mod_mask_lemma f.[3] 63ul;
assert_norm (0x7fffffffffffffff = pow2 63 - 1);
assert (v (mod_mask #U64 #SEC 63ul) == v (u64 0x7fffffffffffffff));
assert (v f3' = v f.[3] % pow2 63);
Math.Lemmas.euclidean_division_definition (v f.[3]) (pow2 63);
assert (v f.[3] == v top_bit * pow2 63 + v f3');
assert (v top_bit <= 1) | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field64.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 25,
"end_line": 242,
"start_col": 0,
"start_line": 222
} | module Hacl.Spec.Curve25519.Field64.Lemmas
open FStar.Mul
open Lib.Sequence
open Lib.IntTypes
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field64.Definition
module BSeq = Lib.ByteSequence
module SD = Hacl.Spec.Bignum.Definitions
module SL = Hacl.Spec.Bignum.Lib
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val lemma_prime: unit -> Lemma (pow2 256 % prime == 38)
let lemma_prime () =
calc (==) {
pow2 256 % prime;
(==) { Math.Lemmas.pow2_plus 255 1 }
2 * pow2 255 % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r 2 (pow2 255) prime }
2 * (pow2 255 % prime) % prime;
(==) { Math.Lemmas.sub_div_mod_1 (pow2 255) prime }
2 * (19 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r 2 19 prime }
38 % prime;
(==) { Math.Lemmas.small_mod 38 prime }
38;
}
val lemma_prime19: unit -> Lemma (pow2 255 % prime == 19)
let lemma_prime19 () =
assert_norm (pow2 255 % prime = 19 % prime);
FStar.Math.Lemmas.small_mod 19 prime
val lemma_mul_pow256_add: fn:int -> c:int ->
Lemma ((fn + c * pow2 256) % prime == (fn + c * 38) % prime)
let lemma_mul_pow256_add fn c =
calc (==) {
(fn + c * pow2 256) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_r fn (c * pow2 256) prime }
(fn + c * pow2 256 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r c (pow2 256) prime }
(fn + c * (pow2 256 % prime) % prime) % prime;
(==) { lemma_prime () }
(fn + c * 38 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_r fn (c * 38) prime }
(fn + c * 38) % prime;
}
val lemma_mul_pow255_add: fn:int -> c:int ->
Lemma ((fn + c * pow2 255) % prime == (fn + c * 19) % prime)
let lemma_mul_pow255_add fn c =
calc (==) {
(fn + c * pow2 255) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_r fn (c * pow2 255) prime }
(fn + c * pow2 255 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_mul_distr_r c (pow2 255) prime }
(fn + c * (pow2 255 % prime) % prime) % prime;
(==) { lemma_prime19 () }
(fn + c * 19 % prime) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_r fn (c * 19) prime }
(fn + c * 19) % prime;
}
val lemma_fsub4: fn1:nat -> fn2:nat -> c0:nat -> c1:nat ->
Lemma ((fn1 - fn2 + c0 * pow2 256 - c0 * 38 + c1 * pow2 256 - c1 * 38) % prime ==
(fn1 % prime - fn2 % prime) % prime)
let lemma_fsub4 fn1 fn2 c0 c1 =
calc (==) {
(fn1 - fn2 + c0 * pow2 256 - c0 * 38 + c1 * pow2 256 - c1 * 38) % prime;
(==) { lemma_mul_pow256_add (fn1 - fn2 + c0 * pow2 256 - c0 * 38 + c1 * pow2 256) (- c1) }
(fn1 - fn2 + c0 * pow2 256 - c0 * 38 + c1 * pow2 256 - c1 * pow2 256) % prime;
(==) { }
(fn1 - fn2 + c0 * pow2 256 - c0 * 38) % prime;
(==) { lemma_mul_pow256_add (fn1 - fn2 + c0 * pow2 256) (- c0) }
(fn1 - fn2 + c0 * pow2 256 - c0 * pow2 256) % prime;
(==) { }
(fn1 - fn2) % prime;
(==) { Math.Lemmas.lemma_mod_plus_distr_l fn1 (- fn2) prime }
(fn1 % prime - fn2) % prime;
(==) { Math.Lemmas.lemma_mod_sub_distr (fn1 % prime) fn2 prime }
(fn1 % prime - fn2 % prime) % prime;
}
val lemma_mul_lt: a:nat -> b:nat -> c:pos -> d:pos -> Lemma
(requires a < c /\ b < d)
(ensures a * b < c * d)
let lemma_mul_lt a b c d = ()
val carry_wide_bound: a:nat -> b:nat -> c:nat -> d:nat -> Lemma
(requires
a + b * pow2 256 == c + d * 38 /\
a < pow2 256 /\ c < pow2 256 /\ d < pow2 256)
(ensures b * 38 < pow2 63)
let carry_wide_bound a b c d =
assert_norm (38 < pow2 7);
lemma_mul_lt d 38 (pow2 256) (pow2 7);
Math.Lemmas.pow2_plus 256 7;
assert (c + d * 38 < pow2 263);
Math.Lemmas.pow2_plus 7 7;
Math.Lemmas.pow2_lt_compat 63 14
val fmul14_bound: a:nat -> b:nat -> c:nat -> d:nat -> Lemma
(requires
a + b * pow2 256 == c * d /\
a < pow2 256 /\ c < pow2 256 /\ d < pow2 17)
(ensures b * 38 < pow2 63)
let fmul14_bound a b c d =
lemma_mul_lt c d (pow2 256) (pow2 17);
//Math.Lemmas.pow2_plus 256 17;
//assert (c * d < pow2 273);
assert (b < pow2 17);
assert_norm (38 < pow2 7);
Math.Lemmas.pow2_plus 17 7;
Math.Lemmas.pow2_lt_compat 63 24
val carry_pass_store_bound: f:nat -> top_bit:nat -> r0:nat -> r1:nat -> c:nat -> Lemma
(requires
top_bit == f / pow2 255 /\
r0 + top_bit * pow2 255 == f /\
r1 + c * pow2 256 == r0 + 19 * top_bit /\
r0 < pow2 256 /\ r1 < pow2 256 /\
f < pow2 256 /\ top_bit <= 1)
(ensures c = 0 /\ r0 < pow2 255)
let carry_pass_store_bound f top_bit r0 r1 c = ()
val lemma_subtract_p4_0: f:felem4 -> f':felem4 -> Lemma
(requires
(let (f0, f1, f2, f3) = f in
let (f0', f1', f2', f3') = f' in
v f3 < pow2 63 /\
(v f3 <> 0x7fffffffffffffff || v f2 <> 0xffffffffffffffff || v f1 <> 0xffffffffffffffff || v f0 < 0xffffffffffffffed) /\
(v f0' = v f0 && v f1' = v f1 && v f2' = v f2 && v f3' = v f3)))
(ensures as_nat4 f' == as_nat4 f % prime)
let lemma_subtract_p4_0 f f' =
let (f0, f1, f2, f3) = f in
let (f0', f1', f2', f3') = f' in
assert_norm (0x7fffffffffffffff = pow2 63 - 1);
assert_norm (0xffffffffffffffff = pow2 64 - 1);
assert_norm (0xffffffffffffffed = pow2 64 - 19);
assert (as_nat4 f == v f0 + v f1 * pow2 64 + v f2 * pow2 64 * pow2 64 + v f3 * pow2 64 * pow2 64 * pow2 64);
assert (as_nat4 f <= pow2 64 - 20 + (pow2 64 - 1) * pow2 64 + (pow2 64 - 1) * pow2 64 * pow2 64 +
(pow2 63 - 1) * pow2 64 * pow2 64 * pow2 64);
assert_norm (pow2 63 * pow2 64 * pow2 64 * pow2 64 = pow2 255);
assert (as_nat4 f < pow2 255 - 19);
assert (as_nat4 f == as_nat4 f');
FStar.Math.Lemmas.modulo_lemma (as_nat4 f') prime
val lemma_subtract_p4_1: f:felem4 -> f':felem4 -> Lemma
(requires
(let (f0, f1, f2, f3) = f in
let (f0', f1', f2', f3') = f' in
(v f3 = 0x7fffffffffffffff && v f2 = 0xffffffffffffffff && v f1 = 0xffffffffffffffff && v f0 >= 0xffffffffffffffed) /\
(v f0' = v f0 - 0xffffffffffffffed && v f1' = v f1 - 0xffffffffffffffff && v f2' = v f2 - 0xffffffffffffffff &&
v f3' = v f3 - 0x7fffffffffffffff)))
(ensures as_nat4 f' == as_nat4 f % prime)
let lemma_subtract_p4_1 f f' =
let (f0, f1, f2, f3) = f in
let (f0', f1', f2', f3') = f' in
assert_norm (0x7fffffffffffffff = pow2 63 - 1);
assert_norm (0xffffffffffffffff = pow2 64 - 1);
assert_norm (0xffffffffffffffed = pow2 64 - 19);
assert (as_nat4 f' % prime ==
(v f0' + v f1' * pow2 64 + v f2' * pow2 64 * pow2 64 + v f3' * pow2 64 * pow2 64 * pow2 64) % prime);
assert (as_nat4 f' % prime ==
(v f0 - (pow2 64 - 19) + (v f1 - (pow2 64 - 1)) * pow2 64 + (v f2 - (pow2 64 - 1)) * pow2 64 * pow2 64 +
(v f3 - (pow2 63 - 1)) * pow2 64 * pow2 64 * pow2 64) % prime);
assert_norm (pow2 63 * pow2 64 * pow2 64 * pow2 64 = pow2 255);
assert (as_nat4 f' % prime ==
(v f0 + v f1 * pow2 64 + v f2 * pow2 64 * pow2 64 +
v f3 * pow2 64 * pow2 64 * pow2 64 - prime) % prime);
FStar.Math.Lemmas.lemma_mod_sub
(v f0 + v f1 * pow2 64 + v f2 * pow2 64 * pow2 64 + v f3 * pow2 64 * pow2 64 * pow2 64) 1 prime
val lemma_subtract_p: f:felem4 -> f':felem4 -> Lemma
(requires
(let (f0, f1, f2, f3) = f in
let (f0', f1', f2', f3') = f' in
v f3 < pow2 63 /\
(((v f3 <> 0x7fffffffffffffff || v f2 <> 0xffffffffffffffff || v f1 <> 0xffffffffffffffff || v f0 < 0xffffffffffffffed) /\
(v f0' = v f0 && v f1' = v f1 && v f2' = v f2 && v f3' = v f3)) \/
((v f3 = 0x7fffffffffffffff && v f2 = 0xffffffffffffffff && v f1 = 0xffffffffffffffff && v f0 >= 0xffffffffffffffed) /\
(v f0' = v f0 - 0xffffffffffffffed && v f1' = v f1 - 0xffffffffffffffff && v f2' = v f2 - 0xffffffffffffffff &&
v f3' = v f3 - 0x7fffffffffffffff)))))
(ensures as_nat4 f' == as_nat4 f % prime)
let lemma_subtract_p f f' =
let (f0, f1, f2, f3) = f in
let (f0', f1', f2', f3') = f' in
if ((v f3 <> 0x7fffffffffffffff || v f2 <> 0xffffffffffffffff || v f1 <> 0xffffffffffffffff || v f0 < 0xffffffffffffffed) &&
(v f0' = v f0 && v f1' = v f1 && v f2' = v f2 && v f3' = v f3))
then lemma_subtract_p4_0 f f'
else lemma_subtract_p4_1 f f'
val lemma_carry_pass_store_f3: f:lseq uint64 4 ->
Lemma (let top_bit = f.[3] >>. 63ul in
let f3' = f.[3] &. u64 0x7fffffffffffffff in
v top_bit == SD.bn_v f / pow2 255 /\ v top_bit <= 1 /\
v f3' = v f.[3] % pow2 63 /\
v f.[3] == v top_bit * pow2 63 + v f3') | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Hacl.Spec.Curve25519.Field64.Definition.fst.checked",
"Hacl.Spec.Bignum.Lib.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"Hacl.Spec.Bignum.Convert.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Spec.Curve25519.Field64.Lemmas.fst"
} | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Lib",
"short_module": "SL"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "SD"
},
{
"abbrev": true,
"full_module": "Lib.ByteSequence",
"short_module": "BSeq"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field64.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | f: Lib.Sequence.lseq Lib.IntTypes.uint64 4
-> FStar.Pervasives.Lemma
(ensures
(let top_bit = f.[ 3 ] >>. 63ul in
let f3' = f.[ 3 ] &. Lib.IntTypes.u64 0x7fffffffffffffff in
Lib.IntTypes.v top_bit == Hacl.Spec.Bignum.Definitions.bn_v f / Prims.pow2 255 /\
Lib.IntTypes.v top_bit <= 1 /\ Lib.IntTypes.v f3' = Lib.IntTypes.v f.[ 3 ] % Prims.pow2 63 /\
Lib.IntTypes.v f.[ 3 ] == Lib.IntTypes.v top_bit * Prims.pow2 63 + Lib.IntTypes.v f3')) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Lib.Sequence.lseq",
"Lib.IntTypes.uint64",
"Prims._assert",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Lib.IntTypes.v",
"Lib.IntTypes.U64",
"Lib.IntTypes.SEC",
"Prims.unit",
"Prims.eq2",
"Prims.int",
"Lib.Sequence.op_String_Access",
"Prims.op_Addition",
"FStar.Mul.op_Star",
"Prims.pow2",
"FStar.Math.Lemmas.euclidean_division_definition",
"Prims.op_Equality",
"Prims.op_Modulus",
"Lib.IntTypes.range_t",
"Lib.IntTypes.mod_mask",
"FStar.UInt32.__uint_to_t",
"Lib.IntTypes.u64",
"FStar.Pervasives.assert_norm",
"Prims.op_Subtraction",
"Lib.IntTypes.mod_mask_lemma",
"Lib.IntTypes.int_t",
"Lib.IntTypes.op_Amp_Dot",
"Prims.op_Division",
"Hacl.Spec.Bignum.Definitions.bn_v",
"FStar.Math.Lemmas.small_mod",
"FStar.Math.Lemmas.lemma_div_lt_nat",
"Hacl.Spec.Bignum.Definitions.bn_eval_bound",
"Hacl.Spec.Bignum.Lib.bn_get_ith_bit_lemma",
"Hacl.Spec.Bignum.Lib.bn_get_ith_bit",
"Lib.IntTypes.op_Greater_Greater_Dot"
] | [] | true | false | true | false | false | let lemma_carry_pass_store_f3 f =
| let top_bit = f.[ 3 ] >>. 63ul in
assert (SL.bn_get_ith_bit f 255 == ((f.[ 3 ] >>. 63ul) &. u64 1));
mod_mask_lemma top_bit 1ul;
assert (v (mod_mask #U64 #SEC 1ul) == v (u64 1));
SL.bn_get_ith_bit_lemma f 255;
assert (v top_bit == SD.bn_v f / pow2 255 % 2);
SD.bn_eval_bound f 4;
Math.Lemmas.lemma_div_lt_nat (SD.bn_v f) 256 255;
Math.Lemmas.small_mod (SD.bn_v f / pow2 255) 2;
assert (v top_bit == SD.bn_v f / pow2 255);
let f3' = f.[ 3 ] &. u64 0x7fffffffffffffff in
mod_mask_lemma f.[ 3 ] 63ul;
assert_norm (0x7fffffffffffffff = pow2 63 - 1);
assert (v (mod_mask #U64 #SEC 63ul) == v (u64 0x7fffffffffffffff));
assert (v f3' = v f.[ 3 ] % pow2 63);
Math.Lemmas.euclidean_division_definition (v f.[ 3 ]) (pow2 63);
assert (v f.[ 3 ] == v top_bit * pow2 63 + v f3');
assert (v top_bit <= 1) | false |
Steel.Preorder.fst | Steel.Preorder.history_compose | val history_compose (#a #p: _) (h0: history a p) (h1: history a p {history_composable h0 h1})
: history a p | val history_compose (#a #p: _) (h0: history a p) (h1: history a p {history_composable h0 h1})
: history a p | let history_compose #a #p (h0:history a p) (h1:history a p{history_composable h0 h1})
: history a p
= match h0, h1 with
| Witnessed h0, Witnessed h1 ->
Witnessed (p_op p h0 h1)
| Current h0 f, Witnessed h1
| Witnessed h1, Current h0 f ->
Current (p_op p h1 h0) f
| Current h0 f0, Current _ f1 ->
Current h0 (sum_perm f0 f1) | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 33,
"end_line": 318,
"start_col": 0,
"start_line": 309
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x
(** If [z] extends [x] and [y], then [x] and [y] are extending one or another *)
let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl
(** If [x] extends [y], then the two heads of the traces are still related by the preorder *)
let rec extends_related_head (#a: Type u#a) (#q:preorder a) (x y:hist q)
: Lemma
(ensures
x `extends` y /\
Cons? x /\
Cons? y ==> Cons?.hd y `q` Cons?.hd x)
[SMTPat (x `extends` y)]
= match x with
| [] -> ()
| _::tl -> extends_related_head tl y
(** Finally, we can have our fully-fledged PCM from the preorder *)
let pcm_of_preorder (#a: Type u#a) (q:preorder a) : pcm (hist q) = {
p = p q;
comm = comm_op q;
assoc = (fun _ _ _ -> ());
assoc_r = (fun _ _ _ -> ());
is_unit = (fun _ -> ());
refine = (fun _ -> True)
}
(***** Using the preorder *)
(**
We check that the preorder derived from the PCM derived from the preorder
satisfies the same properties as the original preorder. Here, we get back history
extension from frame-preserving updates.
*)
let frame_preserving_q_aux (#a : Type u#a) (q:preorder a) (x y:hist q) (z:hist q)
: Lemma (requires (frame_preserving (pcm_of_preorder q) x y /\ compatible (pcm_of_preorder q) x z))
(ensures (y `extends` z))
= ()
(** A non-empty history *)
let vhist (#a: Type u#a) (q:preorder a) = h:hist q{Cons? h}
(** Get the current value from an history *)
let curval (#a: Type u#a) (#q:preorder a) (v:vhist q) = Cons?.hd v
(**
Given a frame-preserving update from [x] to [y]
for any value of resource [z] (compatible with [x])
the new value [y] advances the history [z] in a preorder respecting manner
*)
let frame_preserving_q (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> curval z `q` curval y))
= ()
(** Still given a frame-preserving update from [x] to [y], this update extends the history *)
let frame_preserving_extends (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> y `extends` z))
= ()
(** Helper function that flips a preoder *)
let flip (#a: Type u#a) (p:preorder a) : preorder a = fun x y -> p y x
(**
What is the preorder induced from the PCM induced by preorder [q]? It turns out that
it is the flipped of [q], reversed extension.
*)
let frame_preserving_extends2 (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> z `flip extends` y))
[SMTPat (frame_preserving (pcm_of_preorder q) x y)]
= ()
#push-options "--warn_error -271"
let pcm_of_preorder_induces_extends (#a: Type u#a) (q:preorder a)
: Lemma (induces_preorder (pcm_of_preorder q) (flip extends))
= let fp_full (x y:hist q) (f:frame_preserving_upd (pcm_of_preorder q) x y) (v:hist q)
: Lemma (requires compatible (pcm_of_preorder q) x v)
(ensures extends (f v) v)
[SMTPat ()]
= assert (composable (pcm_of_preorder q) x v) in
()
#pop-options
let extend_history (#a:Type u#a) (#q:preorder a) (h0:vhist q) (v:a{q (curval h0) v})
: h1:vhist q{h1 `extends` h0}
= v :: h0
let property (a:Type)
= a -> prop
let stable_property (#a:Type) (pcm:pcm a)
= fact:property a {
FStar.Preorder.stable fact (preorder_of_pcm pcm)
}
let fact_valid_compat (#a:Type) (#pcm:pcm a)
(fact:stable_property pcm)
(v:a)
= forall z. compatible pcm v z ==> fact z
open Steel.FractionalPermission
open FStar.Real
noeq
type history (a:Type) (p:preorder a) =
| Witnessed : hist p -> history a p
| Current : h:vhist p -> f:perm -> history a p
let hval_tot #a #p (h:history a p{Current? h}) : a =
match h with
| Current h _ -> curval h
let hval #a #p (h:history a p{Current? h}) : Ghost.erased a =
hval_tot h
let hperm #a #p (h:history a p{Current? h}) : perm =
match h with
| Current _ f -> f
let history_composable #a #p
: symrel (history a p)
= fun h0 h1 ->
match h0, h1 with
| Witnessed h0, Witnessed h1 ->
p_composable p h0 h1
| Witnessed h0, Current h1 f
| Current h1 f, Witnessed h0 ->
extends #a #p h1 h0
| Current h0 f0, Current h1 f1 ->
h0 == h1 /\
(sum_perm f0 f1).v <=. one | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
h0: Steel.Preorder.history a p ->
h1: Steel.Preorder.history a p {Steel.Preorder.history_composable h0 h1}
-> Steel.Preorder.history a p | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.history",
"Steel.Preorder.history_composable",
"FStar.Pervasives.Native.Mktuple2",
"Steel.Preorder.hist",
"Steel.Preorder.Witnessed",
"Steel.Preorder.p_op",
"Steel.Preorder.vhist",
"Steel.FractionalPermission.perm",
"Steel.Preorder.Current",
"Steel.FractionalPermission.sum_perm"
] | [] | false | false | false | false | false | let history_compose #a #p (h0: history a p) (h1: history a p {history_composable h0 h1})
: history a p =
| match h0, h1 with
| Witnessed h0, Witnessed h1 -> Witnessed (p_op p h0 h1)
| Current h0 f, Witnessed h1 | Witnessed h1, Current h0 f -> Current (p_op p h1 h0) f
| Current h0 f0, Current _ f1 -> Current h0 (sum_perm f0 f1) | false |
FStar.List.Pure.Base.fst | FStar.List.Pure.Base.map2 | val map2 (#a1 #a2 #b: Type)
(f: a1 -> a2 -> b)
(l1:list a1)
(l2:list a2)
: Pure (list b)
(requires (length l1 == length l2))
(ensures (fun _ -> True))
(decreases l1) | val map2 (#a1 #a2 #b: Type)
(f: a1 -> a2 -> b)
(l1:list a1)
(l2:list a2)
: Pure (list b)
(requires (length l1 == length l2))
(ensures (fun _ -> True))
(decreases l1) | let rec map2 #a1 #a2 #b f l1 l2 =
match l1, l2 with
| [], [] -> []
| x1::xs1, x2::xs2 -> f x1 x2 :: map2 f xs1 xs2 | {
"file_name": "ulib/FStar.List.Pure.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 49,
"end_line": 35,
"start_col": 0,
"start_line": 32
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.List.Pure.Base
open FStar.List.Tot.Base
(** Functions on list with a pure specification *)
(** [map2] takes a pair of list of the same length [x1; ...; xn] [y1; ... ; yn]
and return the list [f x1 y1; ... ; f xn yn] *)
val map2 (#a1 #a2 #b: Type)
(f: a1 -> a2 -> b)
(l1:list a1)
(l2:list a2)
: Pure (list b)
(requires (length l1 == length l2))
(ensures (fun _ -> True)) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked"
],
"interface_file": false,
"source_file": "FStar.List.Pure.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | f: (_: a1 -> _: a2 -> b) -> l1: Prims.list a1 -> l2: Prims.list a2 -> Prims.Pure (Prims.list b) | Prims.Pure | [
""
] | [] | [
"Prims.list",
"FStar.Pervasives.Native.Mktuple2",
"Prims.Nil",
"Prims.Cons",
"FStar.List.Pure.Base.map2"
] | [
"recursion"
] | false | false | false | false | false | let rec map2 #a1 #a2 #b f l1 l2 =
| match l1, l2 with
| [], [] -> []
| x1 :: xs1, x2 :: xs2 -> f x1 x2 :: map2 f xs1 xs2 | false |
FStar.List.Pure.Base.fst | FStar.List.Pure.Base.map3 | val map3 (#a1 #a2 #a3 #b: Type)
(f: a1 -> a2 -> a3 -> b)
(l1:list a1)
(l2:list a2)
(l3:list a3)
: Pure (list b)
(requires (let n = length l1 in
(n == length l2 /\
n == length l3)))
(ensures (fun _ -> True))
(decreases l1) | val map3 (#a1 #a2 #a3 #b: Type)
(f: a1 -> a2 -> a3 -> b)
(l1:list a1)
(l2:list a2)
(l3:list a3)
: Pure (list b)
(requires (let n = length l1 in
(n == length l2 /\
n == length l3)))
(ensures (fun _ -> True))
(decreases l1) | let rec map3 #a1 #a2 #a3 #b f l1 l2 l3 =
match l1, l2, l3 with
| [], [], [] -> []
| x1::xs1, x2::xs2, x3::xs3 -> f x1 x2 x3 :: map3 f xs1 xs2 xs3 | {
"file_name": "ulib/FStar.List.Pure.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 65,
"end_line": 54,
"start_col": 0,
"start_line": 51
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.List.Pure.Base
open FStar.List.Tot.Base
(** Functions on list with a pure specification *)
(** [map2] takes a pair of list of the same length [x1; ...; xn] [y1; ... ; yn]
and return the list [f x1 y1; ... ; f xn yn] *)
val map2 (#a1 #a2 #b: Type)
(f: a1 -> a2 -> b)
(l1:list a1)
(l2:list a2)
: Pure (list b)
(requires (length l1 == length l2))
(ensures (fun _ -> True))
(decreases l1)
let rec map2 #a1 #a2 #b f l1 l2 =
match l1, l2 with
| [], [] -> []
| x1::xs1, x2::xs2 -> f x1 x2 :: map2 f xs1 xs2
(** [map3] takes three lists of the same length [x1; ...; xn]
[y1; ... ; yn] [z1; ... ; zn] and return the list
[f x1 y1 z1; ... ; f xn yn zn] *)
val map3 (#a1 #a2 #a3 #b: Type)
(f: a1 -> a2 -> a3 -> b)
(l1:list a1)
(l2:list a2)
(l3:list a3)
: Pure (list b)
(requires (let n = length l1 in
(n == length l2 /\
n == length l3)))
(ensures (fun _ -> True)) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked"
],
"interface_file": false,
"source_file": "FStar.List.Pure.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | f: (_: a1 -> _: a2 -> _: a3 -> b) -> l1: Prims.list a1 -> l2: Prims.list a2 -> l3: Prims.list a3
-> Prims.Pure (Prims.list b) | Prims.Pure | [
""
] | [] | [
"Prims.list",
"FStar.Pervasives.Native.Mktuple3",
"Prims.Nil",
"Prims.Cons",
"FStar.List.Pure.Base.map3"
] | [
"recursion"
] | false | false | false | false | false | let rec map3 #a1 #a2 #a3 #b f l1 l2 l3 =
| match l1, l2, l3 with
| [], [], [] -> []
| x1 :: xs1, x2 :: xs2, x3 :: xs3 -> f x1 x2 x3 :: map3 f xs1 xs2 xs3 | false |
Steel.Preorder.fst | Steel.Preorder.extend_history' | val extend_history' (#a #p: _) (h0: history a p {Current? h0}) (v: a{p (hval h0) v}) : history a p | val extend_history' (#a #p: _) (h0: history a p {Current? h0}) (v: a{p (hval h0) v}) : history a p | let extend_history' #a #p (h0:history a p{Current? h0})
(v:a{p (hval h0) v})
: history a p
= let Current h f = h0 in
Current (v :: h) f | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 21,
"end_line": 416,
"start_col": 0,
"start_line": 412
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x
(** If [z] extends [x] and [y], then [x] and [y] are extending one or another *)
let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl
(** If [x] extends [y], then the two heads of the traces are still related by the preorder *)
let rec extends_related_head (#a: Type u#a) (#q:preorder a) (x y:hist q)
: Lemma
(ensures
x `extends` y /\
Cons? x /\
Cons? y ==> Cons?.hd y `q` Cons?.hd x)
[SMTPat (x `extends` y)]
= match x with
| [] -> ()
| _::tl -> extends_related_head tl y
(** Finally, we can have our fully-fledged PCM from the preorder *)
let pcm_of_preorder (#a: Type u#a) (q:preorder a) : pcm (hist q) = {
p = p q;
comm = comm_op q;
assoc = (fun _ _ _ -> ());
assoc_r = (fun _ _ _ -> ());
is_unit = (fun _ -> ());
refine = (fun _ -> True)
}
(***** Using the preorder *)
(**
We check that the preorder derived from the PCM derived from the preorder
satisfies the same properties as the original preorder. Here, we get back history
extension from frame-preserving updates.
*)
let frame_preserving_q_aux (#a : Type u#a) (q:preorder a) (x y:hist q) (z:hist q)
: Lemma (requires (frame_preserving (pcm_of_preorder q) x y /\ compatible (pcm_of_preorder q) x z))
(ensures (y `extends` z))
= ()
(** A non-empty history *)
let vhist (#a: Type u#a) (q:preorder a) = h:hist q{Cons? h}
(** Get the current value from an history *)
let curval (#a: Type u#a) (#q:preorder a) (v:vhist q) = Cons?.hd v
(**
Given a frame-preserving update from [x] to [y]
for any value of resource [z] (compatible with [x])
the new value [y] advances the history [z] in a preorder respecting manner
*)
let frame_preserving_q (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> curval z `q` curval y))
= ()
(** Still given a frame-preserving update from [x] to [y], this update extends the history *)
let frame_preserving_extends (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> y `extends` z))
= ()
(** Helper function that flips a preoder *)
let flip (#a: Type u#a) (p:preorder a) : preorder a = fun x y -> p y x
(**
What is the preorder induced from the PCM induced by preorder [q]? It turns out that
it is the flipped of [q], reversed extension.
*)
let frame_preserving_extends2 (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> z `flip extends` y))
[SMTPat (frame_preserving (pcm_of_preorder q) x y)]
= ()
#push-options "--warn_error -271"
let pcm_of_preorder_induces_extends (#a: Type u#a) (q:preorder a)
: Lemma (induces_preorder (pcm_of_preorder q) (flip extends))
= let fp_full (x y:hist q) (f:frame_preserving_upd (pcm_of_preorder q) x y) (v:hist q)
: Lemma (requires compatible (pcm_of_preorder q) x v)
(ensures extends (f v) v)
[SMTPat ()]
= assert (composable (pcm_of_preorder q) x v) in
()
#pop-options
let extend_history (#a:Type u#a) (#q:preorder a) (h0:vhist q) (v:a{q (curval h0) v})
: h1:vhist q{h1 `extends` h0}
= v :: h0
let property (a:Type)
= a -> prop
let stable_property (#a:Type) (pcm:pcm a)
= fact:property a {
FStar.Preorder.stable fact (preorder_of_pcm pcm)
}
let fact_valid_compat (#a:Type) (#pcm:pcm a)
(fact:stable_property pcm)
(v:a)
= forall z. compatible pcm v z ==> fact z
open Steel.FractionalPermission
open FStar.Real
noeq
type history (a:Type) (p:preorder a) =
| Witnessed : hist p -> history a p
| Current : h:vhist p -> f:perm -> history a p
let hval_tot #a #p (h:history a p{Current? h}) : a =
match h with
| Current h _ -> curval h
let hval #a #p (h:history a p{Current? h}) : Ghost.erased a =
hval_tot h
let hperm #a #p (h:history a p{Current? h}) : perm =
match h with
| Current _ f -> f
let history_composable #a #p
: symrel (history a p)
= fun h0 h1 ->
match h0, h1 with
| Witnessed h0, Witnessed h1 ->
p_composable p h0 h1
| Witnessed h0, Current h1 f
| Current h1 f, Witnessed h0 ->
extends #a #p h1 h0
| Current h0 f0, Current h1 f1 ->
h0 == h1 /\
(sum_perm f0 f1).v <=. one
let history_compose #a #p (h0:history a p) (h1:history a p{history_composable h0 h1})
: history a p
= match h0, h1 with
| Witnessed h0, Witnessed h1 ->
Witnessed (p_op p h0 h1)
| Current h0 f, Witnessed h1
| Witnessed h1, Current h0 f ->
Current (p_op p h1 h0) f
| Current h0 f0, Current _ f1 ->
Current h0 (sum_perm f0 f1)
let unit_history #a #p : history a p = Witnessed []
let lem_is_unit #a #p (x:history a p)
: Lemma (history_composable x unit_history /\
history_compose x unit_history == x)
= match x with
| Witnessed h -> ()
| Current h _ ->
assert (forall (h:hist p). p_composable p h []);
assert (forall (h:hist p). p_op p h [] == h);
assert (forall (h:vhist p). extends #a #p h []);
assert (h =!= []);
assert (extends #a #p h [])
#push-options "--z3rlimit_factor 2"
let assoc_l #a #p (x y:history a p)
(z:history a p{history_composable y z /\
history_composable x (history_compose y z)})
: Lemma (history_composable x y /\
history_composable (history_compose x y) z /\
history_compose (history_compose x y) z ==
history_compose x (history_compose y z))
= ()
let assoc_r #a #p (x y:history a p)
(z:history a p{history_composable x y /\
history_composable (history_compose x y) z})
: Lemma (history_composable y z /\
history_composable x (history_compose y z) /\
history_compose (history_compose x y) z ==
history_compose x (history_compose y z))
= ()
#pop-options
let pcm_history #a #p : pcm (history a p) = {
p = {
composable = history_composable;
op = history_compose;
one = unit_history
};
comm = (fun _ _ -> ());
assoc = assoc_l;
assoc_r = assoc_r;
is_unit = lem_is_unit;
refine = (fun _ -> True);
}
let pcm_history_preorder #a #p : preorder (history a p) =
fun h0 h1 ->
match h0, h1 with
| Witnessed vh0, Witnessed vh1
| Current vh0 _, Witnessed vh1
| Witnessed vh0, Current vh1 _
| Current vh0 _, Current vh1 _ ->
vh1 `extends` vh0
#push-options "--z3rlimit_factor 8 --ifuel 1 --fuel 0 --warn_error -271"
let pcm_history_induces_preorder #a #p
: Lemma (induces_preorder (pcm_history #a #p)
(pcm_history_preorder #a #p))
= let aux (x y:history a p)
(f:frame_preserving_upd (pcm_history #a #p) x y)
(v:history a p)
: Lemma
(requires compatible (pcm_history #a #p) x v)
(ensures (pcm_history_preorder #a #p) v (f v))
[SMTPat ()]
= let pcm = pcm_history #a #p in
let v1 = f v in
match x, v, v1 with
| Witnessed _, Witnessed _, Witnessed _ ->
assert (composable pcm x v)
| Current _ _, Witnessed _, Witnessed _ -> ()
| Witnessed _, Current _ _, Witnessed _ -> ()
| Witnessed _, Witnessed _, Current _ _ ->
assert (composable pcm x v)
| Current _ _, Witnessed _, Current _ _ -> ()
| Witnessed _, Current _ _, Current _ _ -> ()
| Current hx _, Current hv _, Witnessed _
| Current hx _, Current hv _, Current _ _ ->
let frame = FStar.IndefiniteDescription.indefinite_description_ghost
(history a p) (fun frame -> composable pcm x frame /\ op pcm frame x == v) in
match frame with
| Current hf _ -> ()
| Witnessed hf ->
assert (extends hx hf);
assert (hx == hv);
assert (composable pcm x (Witnessed hv))
in
()
#pop-options | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
h0: Steel.Preorder.history a p {Current? h0} ->
v: a{p (FStar.Ghost.reveal (Steel.Preorder.hval h0)) v}
-> Steel.Preorder.history a p | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.history",
"Prims.b2t",
"Steel.Preorder.uu___is_Current",
"FStar.Ghost.reveal",
"Steel.Preorder.hval",
"Steel.Preorder.vhist",
"Steel.FractionalPermission.perm",
"Steel.Preorder.Current",
"Prims.Cons"
] | [] | false | false | false | false | false | let extend_history' #a #p (h0: history a p {Current? h0}) (v: a{p (hval h0) v}) : history a p =
| let Current h f = h0 in
Current (v :: h) f | false |
Steel.Preorder.fst | Steel.Preorder.unit_history | val unit_history (#a #p: _) : history a p | val unit_history (#a #p: _) : history a p | let unit_history #a #p : history a p = Witnessed [] | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 51,
"end_line": 320,
"start_col": 0,
"start_line": 320
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x
(** If [z] extends [x] and [y], then [x] and [y] are extending one or another *)
let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl
(** If [x] extends [y], then the two heads of the traces are still related by the preorder *)
let rec extends_related_head (#a: Type u#a) (#q:preorder a) (x y:hist q)
: Lemma
(ensures
x `extends` y /\
Cons? x /\
Cons? y ==> Cons?.hd y `q` Cons?.hd x)
[SMTPat (x `extends` y)]
= match x with
| [] -> ()
| _::tl -> extends_related_head tl y
(** Finally, we can have our fully-fledged PCM from the preorder *)
let pcm_of_preorder (#a: Type u#a) (q:preorder a) : pcm (hist q) = {
p = p q;
comm = comm_op q;
assoc = (fun _ _ _ -> ());
assoc_r = (fun _ _ _ -> ());
is_unit = (fun _ -> ());
refine = (fun _ -> True)
}
(***** Using the preorder *)
(**
We check that the preorder derived from the PCM derived from the preorder
satisfies the same properties as the original preorder. Here, we get back history
extension from frame-preserving updates.
*)
let frame_preserving_q_aux (#a : Type u#a) (q:preorder a) (x y:hist q) (z:hist q)
: Lemma (requires (frame_preserving (pcm_of_preorder q) x y /\ compatible (pcm_of_preorder q) x z))
(ensures (y `extends` z))
= ()
(** A non-empty history *)
let vhist (#a: Type u#a) (q:preorder a) = h:hist q{Cons? h}
(** Get the current value from an history *)
let curval (#a: Type u#a) (#q:preorder a) (v:vhist q) = Cons?.hd v
(**
Given a frame-preserving update from [x] to [y]
for any value of resource [z] (compatible with [x])
the new value [y] advances the history [z] in a preorder respecting manner
*)
let frame_preserving_q (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> curval z `q` curval y))
= ()
(** Still given a frame-preserving update from [x] to [y], this update extends the history *)
let frame_preserving_extends (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> y `extends` z))
= ()
(** Helper function that flips a preoder *)
let flip (#a: Type u#a) (p:preorder a) : preorder a = fun x y -> p y x
(**
What is the preorder induced from the PCM induced by preorder [q]? It turns out that
it is the flipped of [q], reversed extension.
*)
let frame_preserving_extends2 (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> z `flip extends` y))
[SMTPat (frame_preserving (pcm_of_preorder q) x y)]
= ()
#push-options "--warn_error -271"
let pcm_of_preorder_induces_extends (#a: Type u#a) (q:preorder a)
: Lemma (induces_preorder (pcm_of_preorder q) (flip extends))
= let fp_full (x y:hist q) (f:frame_preserving_upd (pcm_of_preorder q) x y) (v:hist q)
: Lemma (requires compatible (pcm_of_preorder q) x v)
(ensures extends (f v) v)
[SMTPat ()]
= assert (composable (pcm_of_preorder q) x v) in
()
#pop-options
let extend_history (#a:Type u#a) (#q:preorder a) (h0:vhist q) (v:a{q (curval h0) v})
: h1:vhist q{h1 `extends` h0}
= v :: h0
let property (a:Type)
= a -> prop
let stable_property (#a:Type) (pcm:pcm a)
= fact:property a {
FStar.Preorder.stable fact (preorder_of_pcm pcm)
}
let fact_valid_compat (#a:Type) (#pcm:pcm a)
(fact:stable_property pcm)
(v:a)
= forall z. compatible pcm v z ==> fact z
open Steel.FractionalPermission
open FStar.Real
noeq
type history (a:Type) (p:preorder a) =
| Witnessed : hist p -> history a p
| Current : h:vhist p -> f:perm -> history a p
let hval_tot #a #p (h:history a p{Current? h}) : a =
match h with
| Current h _ -> curval h
let hval #a #p (h:history a p{Current? h}) : Ghost.erased a =
hval_tot h
let hperm #a #p (h:history a p{Current? h}) : perm =
match h with
| Current _ f -> f
let history_composable #a #p
: symrel (history a p)
= fun h0 h1 ->
match h0, h1 with
| Witnessed h0, Witnessed h1 ->
p_composable p h0 h1
| Witnessed h0, Current h1 f
| Current h1 f, Witnessed h0 ->
extends #a #p h1 h0
| Current h0 f0, Current h1 f1 ->
h0 == h1 /\
(sum_perm f0 f1).v <=. one
let history_compose #a #p (h0:history a p) (h1:history a p{history_composable h0 h1})
: history a p
= match h0, h1 with
| Witnessed h0, Witnessed h1 ->
Witnessed (p_op p h0 h1)
| Current h0 f, Witnessed h1
| Witnessed h1, Current h0 f ->
Current (p_op p h1 h0) f
| Current h0 f0, Current _ f1 ->
Current h0 (sum_perm f0 f1) | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Steel.Preorder.history a p | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.Witnessed",
"Prims.Nil",
"Steel.Preorder.history"
] | [] | false | false | false | false | false | let unit_history #a #p : history a p =
| Witnessed [] | false |
Steel.Preorder.fst | Steel.Preorder.pcm_history_preorder | val pcm_history_preorder (#a #p: _) : preorder (history a p) | val pcm_history_preorder (#a #p: _) : preorder (history a p) | let pcm_history_preorder #a #p : preorder (history a p) =
fun h0 h1 ->
match h0, h1 with
| Witnessed vh0, Witnessed vh1
| Current vh0 _, Witnessed vh1
| Witnessed vh0, Current vh1 _
| Current vh0 _, Current vh1 _ ->
vh1 `extends` vh0 | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 23,
"end_line": 374,
"start_col": 0,
"start_line": 367
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x
(** If [z] extends [x] and [y], then [x] and [y] are extending one or another *)
let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl
(** If [x] extends [y], then the two heads of the traces are still related by the preorder *)
let rec extends_related_head (#a: Type u#a) (#q:preorder a) (x y:hist q)
: Lemma
(ensures
x `extends` y /\
Cons? x /\
Cons? y ==> Cons?.hd y `q` Cons?.hd x)
[SMTPat (x `extends` y)]
= match x with
| [] -> ()
| _::tl -> extends_related_head tl y
(** Finally, we can have our fully-fledged PCM from the preorder *)
let pcm_of_preorder (#a: Type u#a) (q:preorder a) : pcm (hist q) = {
p = p q;
comm = comm_op q;
assoc = (fun _ _ _ -> ());
assoc_r = (fun _ _ _ -> ());
is_unit = (fun _ -> ());
refine = (fun _ -> True)
}
(***** Using the preorder *)
(**
We check that the preorder derived from the PCM derived from the preorder
satisfies the same properties as the original preorder. Here, we get back history
extension from frame-preserving updates.
*)
let frame_preserving_q_aux (#a : Type u#a) (q:preorder a) (x y:hist q) (z:hist q)
: Lemma (requires (frame_preserving (pcm_of_preorder q) x y /\ compatible (pcm_of_preorder q) x z))
(ensures (y `extends` z))
= ()
(** A non-empty history *)
let vhist (#a: Type u#a) (q:preorder a) = h:hist q{Cons? h}
(** Get the current value from an history *)
let curval (#a: Type u#a) (#q:preorder a) (v:vhist q) = Cons?.hd v
(**
Given a frame-preserving update from [x] to [y]
for any value of resource [z] (compatible with [x])
the new value [y] advances the history [z] in a preorder respecting manner
*)
let frame_preserving_q (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> curval z `q` curval y))
= ()
(** Still given a frame-preserving update from [x] to [y], this update extends the history *)
let frame_preserving_extends (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> y `extends` z))
= ()
(** Helper function that flips a preoder *)
let flip (#a: Type u#a) (p:preorder a) : preorder a = fun x y -> p y x
(**
What is the preorder induced from the PCM induced by preorder [q]? It turns out that
it is the flipped of [q], reversed extension.
*)
let frame_preserving_extends2 (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> z `flip extends` y))
[SMTPat (frame_preserving (pcm_of_preorder q) x y)]
= ()
#push-options "--warn_error -271"
let pcm_of_preorder_induces_extends (#a: Type u#a) (q:preorder a)
: Lemma (induces_preorder (pcm_of_preorder q) (flip extends))
= let fp_full (x y:hist q) (f:frame_preserving_upd (pcm_of_preorder q) x y) (v:hist q)
: Lemma (requires compatible (pcm_of_preorder q) x v)
(ensures extends (f v) v)
[SMTPat ()]
= assert (composable (pcm_of_preorder q) x v) in
()
#pop-options
let extend_history (#a:Type u#a) (#q:preorder a) (h0:vhist q) (v:a{q (curval h0) v})
: h1:vhist q{h1 `extends` h0}
= v :: h0
let property (a:Type)
= a -> prop
let stable_property (#a:Type) (pcm:pcm a)
= fact:property a {
FStar.Preorder.stable fact (preorder_of_pcm pcm)
}
let fact_valid_compat (#a:Type) (#pcm:pcm a)
(fact:stable_property pcm)
(v:a)
= forall z. compatible pcm v z ==> fact z
open Steel.FractionalPermission
open FStar.Real
noeq
type history (a:Type) (p:preorder a) =
| Witnessed : hist p -> history a p
| Current : h:vhist p -> f:perm -> history a p
let hval_tot #a #p (h:history a p{Current? h}) : a =
match h with
| Current h _ -> curval h
let hval #a #p (h:history a p{Current? h}) : Ghost.erased a =
hval_tot h
let hperm #a #p (h:history a p{Current? h}) : perm =
match h with
| Current _ f -> f
let history_composable #a #p
: symrel (history a p)
= fun h0 h1 ->
match h0, h1 with
| Witnessed h0, Witnessed h1 ->
p_composable p h0 h1
| Witnessed h0, Current h1 f
| Current h1 f, Witnessed h0 ->
extends #a #p h1 h0
| Current h0 f0, Current h1 f1 ->
h0 == h1 /\
(sum_perm f0 f1).v <=. one
let history_compose #a #p (h0:history a p) (h1:history a p{history_composable h0 h1})
: history a p
= match h0, h1 with
| Witnessed h0, Witnessed h1 ->
Witnessed (p_op p h0 h1)
| Current h0 f, Witnessed h1
| Witnessed h1, Current h0 f ->
Current (p_op p h1 h0) f
| Current h0 f0, Current _ f1 ->
Current h0 (sum_perm f0 f1)
let unit_history #a #p : history a p = Witnessed []
let lem_is_unit #a #p (x:history a p)
: Lemma (history_composable x unit_history /\
history_compose x unit_history == x)
= match x with
| Witnessed h -> ()
| Current h _ ->
assert (forall (h:hist p). p_composable p h []);
assert (forall (h:hist p). p_op p h [] == h);
assert (forall (h:vhist p). extends #a #p h []);
assert (h =!= []);
assert (extends #a #p h [])
#push-options "--z3rlimit_factor 2"
let assoc_l #a #p (x y:history a p)
(z:history a p{history_composable y z /\
history_composable x (history_compose y z)})
: Lemma (history_composable x y /\
history_composable (history_compose x y) z /\
history_compose (history_compose x y) z ==
history_compose x (history_compose y z))
= ()
let assoc_r #a #p (x y:history a p)
(z:history a p{history_composable x y /\
history_composable (history_compose x y) z})
: Lemma (history_composable y z /\
history_composable x (history_compose y z) /\
history_compose (history_compose x y) z ==
history_compose x (history_compose y z))
= ()
#pop-options
let pcm_history #a #p : pcm (history a p) = {
p = {
composable = history_composable;
op = history_compose;
one = unit_history
};
comm = (fun _ _ -> ());
assoc = assoc_l;
assoc_r = assoc_r;
is_unit = lem_is_unit;
refine = (fun _ -> True);
} | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | FStar.Preorder.preorder (Steel.Preorder.history a p) | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.history",
"FStar.Pervasives.Native.Mktuple2",
"Steel.Preorder.hist",
"Steel.Preorder.extends",
"Steel.Preorder.vhist",
"Steel.FractionalPermission.perm"
] | [] | false | false | false | false | false | let pcm_history_preorder #a #p : preorder (history a p) =
| fun h0 h1 ->
match h0, h1 with
| Witnessed vh0, Witnessed vh1
| Current vh0 _, Witnessed vh1
| Witnessed vh0, Current vh1 _
| Current vh0 _, Current vh1 _ -> vh1 `extends` vh0 | false |
Steel.Preorder.fst | Steel.Preorder.pcm_history | val pcm_history (#a #p: _) : pcm (history a p) | val pcm_history (#a #p: _) : pcm (history a p) | let pcm_history #a #p : pcm (history a p) = {
p = {
composable = history_composable;
op = history_compose;
one = unit_history
};
comm = (fun _ _ -> ());
assoc = assoc_l;
assoc_r = assoc_r;
is_unit = lem_is_unit;
refine = (fun _ -> True);
} | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 1,
"end_line": 365,
"start_col": 0,
"start_line": 354
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x
(** If [z] extends [x] and [y], then [x] and [y] are extending one or another *)
let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl
(** If [x] extends [y], then the two heads of the traces are still related by the preorder *)
let rec extends_related_head (#a: Type u#a) (#q:preorder a) (x y:hist q)
: Lemma
(ensures
x `extends` y /\
Cons? x /\
Cons? y ==> Cons?.hd y `q` Cons?.hd x)
[SMTPat (x `extends` y)]
= match x with
| [] -> ()
| _::tl -> extends_related_head tl y
(** Finally, we can have our fully-fledged PCM from the preorder *)
let pcm_of_preorder (#a: Type u#a) (q:preorder a) : pcm (hist q) = {
p = p q;
comm = comm_op q;
assoc = (fun _ _ _ -> ());
assoc_r = (fun _ _ _ -> ());
is_unit = (fun _ -> ());
refine = (fun _ -> True)
}
(***** Using the preorder *)
(**
We check that the preorder derived from the PCM derived from the preorder
satisfies the same properties as the original preorder. Here, we get back history
extension from frame-preserving updates.
*)
let frame_preserving_q_aux (#a : Type u#a) (q:preorder a) (x y:hist q) (z:hist q)
: Lemma (requires (frame_preserving (pcm_of_preorder q) x y /\ compatible (pcm_of_preorder q) x z))
(ensures (y `extends` z))
= ()
(** A non-empty history *)
let vhist (#a: Type u#a) (q:preorder a) = h:hist q{Cons? h}
(** Get the current value from an history *)
let curval (#a: Type u#a) (#q:preorder a) (v:vhist q) = Cons?.hd v
(**
Given a frame-preserving update from [x] to [y]
for any value of resource [z] (compatible with [x])
the new value [y] advances the history [z] in a preorder respecting manner
*)
let frame_preserving_q (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> curval z `q` curval y))
= ()
(** Still given a frame-preserving update from [x] to [y], this update extends the history *)
let frame_preserving_extends (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> y `extends` z))
= ()
(** Helper function that flips a preoder *)
let flip (#a: Type u#a) (p:preorder a) : preorder a = fun x y -> p y x
(**
What is the preorder induced from the PCM induced by preorder [q]? It turns out that
it is the flipped of [q], reversed extension.
*)
let frame_preserving_extends2 (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> z `flip extends` y))
[SMTPat (frame_preserving (pcm_of_preorder q) x y)]
= ()
#push-options "--warn_error -271"
let pcm_of_preorder_induces_extends (#a: Type u#a) (q:preorder a)
: Lemma (induces_preorder (pcm_of_preorder q) (flip extends))
= let fp_full (x y:hist q) (f:frame_preserving_upd (pcm_of_preorder q) x y) (v:hist q)
: Lemma (requires compatible (pcm_of_preorder q) x v)
(ensures extends (f v) v)
[SMTPat ()]
= assert (composable (pcm_of_preorder q) x v) in
()
#pop-options
let extend_history (#a:Type u#a) (#q:preorder a) (h0:vhist q) (v:a{q (curval h0) v})
: h1:vhist q{h1 `extends` h0}
= v :: h0
let property (a:Type)
= a -> prop
let stable_property (#a:Type) (pcm:pcm a)
= fact:property a {
FStar.Preorder.stable fact (preorder_of_pcm pcm)
}
let fact_valid_compat (#a:Type) (#pcm:pcm a)
(fact:stable_property pcm)
(v:a)
= forall z. compatible pcm v z ==> fact z
open Steel.FractionalPermission
open FStar.Real
noeq
type history (a:Type) (p:preorder a) =
| Witnessed : hist p -> history a p
| Current : h:vhist p -> f:perm -> history a p
let hval_tot #a #p (h:history a p{Current? h}) : a =
match h with
| Current h _ -> curval h
let hval #a #p (h:history a p{Current? h}) : Ghost.erased a =
hval_tot h
let hperm #a #p (h:history a p{Current? h}) : perm =
match h with
| Current _ f -> f
let history_composable #a #p
: symrel (history a p)
= fun h0 h1 ->
match h0, h1 with
| Witnessed h0, Witnessed h1 ->
p_composable p h0 h1
| Witnessed h0, Current h1 f
| Current h1 f, Witnessed h0 ->
extends #a #p h1 h0
| Current h0 f0, Current h1 f1 ->
h0 == h1 /\
(sum_perm f0 f1).v <=. one
let history_compose #a #p (h0:history a p) (h1:history a p{history_composable h0 h1})
: history a p
= match h0, h1 with
| Witnessed h0, Witnessed h1 ->
Witnessed (p_op p h0 h1)
| Current h0 f, Witnessed h1
| Witnessed h1, Current h0 f ->
Current (p_op p h1 h0) f
| Current h0 f0, Current _ f1 ->
Current h0 (sum_perm f0 f1)
let unit_history #a #p : history a p = Witnessed []
let lem_is_unit #a #p (x:history a p)
: Lemma (history_composable x unit_history /\
history_compose x unit_history == x)
= match x with
| Witnessed h -> ()
| Current h _ ->
assert (forall (h:hist p). p_composable p h []);
assert (forall (h:hist p). p_op p h [] == h);
assert (forall (h:vhist p). extends #a #p h []);
assert (h =!= []);
assert (extends #a #p h [])
#push-options "--z3rlimit_factor 2"
let assoc_l #a #p (x y:history a p)
(z:history a p{history_composable y z /\
history_composable x (history_compose y z)})
: Lemma (history_composable x y /\
history_composable (history_compose x y) z /\
history_compose (history_compose x y) z ==
history_compose x (history_compose y z))
= ()
let assoc_r #a #p (x y:history a p)
(z:history a p{history_composable x y /\
history_composable (history_compose x y) z})
: Lemma (history_composable y z /\
history_composable x (history_compose y z) /\
history_compose (history_compose x y) z ==
history_compose x (history_compose y z))
= ()
#pop-options | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | FStar.PCM.pcm (Steel.Preorder.history a p) | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.preorder",
"FStar.PCM.Mkpcm",
"Steel.Preorder.history",
"FStar.PCM.Mkpcm'",
"Steel.Preorder.history_composable",
"Steel.Preorder.history_compose",
"Steel.Preorder.unit_history",
"FStar.PCM.__proj__Mkpcm'__item__composable",
"Prims.unit",
"Steel.Preorder.assoc_l",
"Steel.Preorder.assoc_r",
"Steel.Preorder.lem_is_unit",
"Prims.l_True",
"Prims.prop",
"FStar.PCM.pcm"
] | [] | false | false | false | false | false | let pcm_history #a #p : pcm (history a p) =
| {
p = { composable = history_composable; op = history_compose; one = unit_history };
comm = (fun _ _ -> ());
assoc = assoc_l;
assoc_r = assoc_r;
is_unit = lem_is_unit;
refine = (fun _ -> True)
} | false |
Steel.Preorder.fst | Steel.Preorder.history_composable | val history_composable (#a #p: _) : symrel (history a p) | val history_composable (#a #p: _) : symrel (history a p) | let history_composable #a #p
: symrel (history a p)
= fun h0 h1 ->
match h0, h1 with
| Witnessed h0, Witnessed h1 ->
p_composable p h0 h1
| Witnessed h0, Current h1 f
| Current h1 f, Witnessed h0 ->
extends #a #p h1 h0
| Current h0 f0, Current h1 f1 ->
h0 == h1 /\
(sum_perm f0 f1).v <=. one | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 32,
"end_line": 307,
"start_col": 0,
"start_line": 296
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x
(** If [z] extends [x] and [y], then [x] and [y] are extending one or another *)
let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl
(** If [x] extends [y], then the two heads of the traces are still related by the preorder *)
let rec extends_related_head (#a: Type u#a) (#q:preorder a) (x y:hist q)
: Lemma
(ensures
x `extends` y /\
Cons? x /\
Cons? y ==> Cons?.hd y `q` Cons?.hd x)
[SMTPat (x `extends` y)]
= match x with
| [] -> ()
| _::tl -> extends_related_head tl y
(** Finally, we can have our fully-fledged PCM from the preorder *)
let pcm_of_preorder (#a: Type u#a) (q:preorder a) : pcm (hist q) = {
p = p q;
comm = comm_op q;
assoc = (fun _ _ _ -> ());
assoc_r = (fun _ _ _ -> ());
is_unit = (fun _ -> ());
refine = (fun _ -> True)
}
(***** Using the preorder *)
(**
We check that the preorder derived from the PCM derived from the preorder
satisfies the same properties as the original preorder. Here, we get back history
extension from frame-preserving updates.
*)
let frame_preserving_q_aux (#a : Type u#a) (q:preorder a) (x y:hist q) (z:hist q)
: Lemma (requires (frame_preserving (pcm_of_preorder q) x y /\ compatible (pcm_of_preorder q) x z))
(ensures (y `extends` z))
= ()
(** A non-empty history *)
let vhist (#a: Type u#a) (q:preorder a) = h:hist q{Cons? h}
(** Get the current value from an history *)
let curval (#a: Type u#a) (#q:preorder a) (v:vhist q) = Cons?.hd v
(**
Given a frame-preserving update from [x] to [y]
for any value of resource [z] (compatible with [x])
the new value [y] advances the history [z] in a preorder respecting manner
*)
let frame_preserving_q (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> curval z `q` curval y))
= ()
(** Still given a frame-preserving update from [x] to [y], this update extends the history *)
let frame_preserving_extends (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> y `extends` z))
= ()
(** Helper function that flips a preoder *)
let flip (#a: Type u#a) (p:preorder a) : preorder a = fun x y -> p y x
(**
What is the preorder induced from the PCM induced by preorder [q]? It turns out that
it is the flipped of [q], reversed extension.
*)
let frame_preserving_extends2 (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> z `flip extends` y))
[SMTPat (frame_preserving (pcm_of_preorder q) x y)]
= ()
#push-options "--warn_error -271"
let pcm_of_preorder_induces_extends (#a: Type u#a) (q:preorder a)
: Lemma (induces_preorder (pcm_of_preorder q) (flip extends))
= let fp_full (x y:hist q) (f:frame_preserving_upd (pcm_of_preorder q) x y) (v:hist q)
: Lemma (requires compatible (pcm_of_preorder q) x v)
(ensures extends (f v) v)
[SMTPat ()]
= assert (composable (pcm_of_preorder q) x v) in
()
#pop-options
let extend_history (#a:Type u#a) (#q:preorder a) (h0:vhist q) (v:a{q (curval h0) v})
: h1:vhist q{h1 `extends` h0}
= v :: h0
let property (a:Type)
= a -> prop
let stable_property (#a:Type) (pcm:pcm a)
= fact:property a {
FStar.Preorder.stable fact (preorder_of_pcm pcm)
}
let fact_valid_compat (#a:Type) (#pcm:pcm a)
(fact:stable_property pcm)
(v:a)
= forall z. compatible pcm v z ==> fact z
open Steel.FractionalPermission
open FStar.Real
noeq
type history (a:Type) (p:preorder a) =
| Witnessed : hist p -> history a p
| Current : h:vhist p -> f:perm -> history a p
let hval_tot #a #p (h:history a p{Current? h}) : a =
match h with
| Current h _ -> curval h
let hval #a #p (h:history a p{Current? h}) : Ghost.erased a =
hval_tot h
let hperm #a #p (h:history a p{Current? h}) : perm =
match h with
| Current _ f -> f | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | FStar.PCM.symrel (Steel.Preorder.history a p) | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.history",
"FStar.Pervasives.Native.Mktuple2",
"Steel.Preorder.hist",
"Steel.Preorder.p_composable",
"Steel.Preorder.vhist",
"Steel.FractionalPermission.perm",
"Steel.Preorder.extends",
"Prims.l_and",
"Prims.eq2",
"Prims.b2t",
"FStar.Real.op_Less_Equals_Dot",
"Steel.FractionalPermission.__proj__MkPerm__item__v",
"Steel.FractionalPermission.sum_perm",
"FStar.Real.one",
"Prims.prop",
"FStar.PCM.symrel"
] | [] | false | false | false | false | false | let history_composable #a #p : symrel (history a p) =
| fun h0 h1 ->
match h0, h1 with
| Witnessed h0, Witnessed h1 -> p_composable p h0 h1
| Witnessed h0, Current h1 f | Current h1 f, Witnessed h0 -> extends #a #p h1 h0
| Current h0 f0, Current h1 f1 -> h0 == h1 /\ (sum_perm f0 f1).v <=. one | false |
FStar.List.Pure.Base.fst | FStar.List.Pure.Base.zip | val zip (#a1 #a2:Type) (l1:list a1) (l2:list a2)
: Pure (list (a1 * a2))
(requires (let n = length l1 in n == length l2))
(ensures (fun _ -> True)) | val zip (#a1 #a2:Type) (l1:list a1) (l2:list a2)
: Pure (list (a1 * a2))
(requires (let n = length l1 in n == length l2))
(ensures (fun _ -> True)) | let zip #a1 #a2 l1 l2 = map2 (fun x y -> x, y) l1 l2 | {
"file_name": "ulib/FStar.List.Pure.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 52,
"end_line": 62,
"start_col": 0,
"start_line": 62
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.List.Pure.Base
open FStar.List.Tot.Base
(** Functions on list with a pure specification *)
(** [map2] takes a pair of list of the same length [x1; ...; xn] [y1; ... ; yn]
and return the list [f x1 y1; ... ; f xn yn] *)
val map2 (#a1 #a2 #b: Type)
(f: a1 -> a2 -> b)
(l1:list a1)
(l2:list a2)
: Pure (list b)
(requires (length l1 == length l2))
(ensures (fun _ -> True))
(decreases l1)
let rec map2 #a1 #a2 #b f l1 l2 =
match l1, l2 with
| [], [] -> []
| x1::xs1, x2::xs2 -> f x1 x2 :: map2 f xs1 xs2
(** [map3] takes three lists of the same length [x1; ...; xn]
[y1; ... ; yn] [z1; ... ; zn] and return the list
[f x1 y1 z1; ... ; f xn yn zn] *)
val map3 (#a1 #a2 #a3 #b: Type)
(f: a1 -> a2 -> a3 -> b)
(l1:list a1)
(l2:list a2)
(l3:list a3)
: Pure (list b)
(requires (let n = length l1 in
(n == length l2 /\
n == length l3)))
(ensures (fun _ -> True))
(decreases l1)
let rec map3 #a1 #a2 #a3 #b f l1 l2 l3 =
match l1, l2, l3 with
| [], [], [] -> []
| x1::xs1, x2::xs2, x3::xs3 -> f x1 x2 x3 :: map3 f xs1 xs2 xs3
(** [zip] takes a pair of list of the same length and returns
the list of index-wise pairs *)
val zip (#a1 #a2:Type) (l1:list a1) (l2:list a2)
: Pure (list (a1 * a2))
(requires (let n = length l1 in n == length l2)) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked"
],
"interface_file": false,
"source_file": "FStar.List.Pure.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | l1: Prims.list a1 -> l2: Prims.list a2 -> Prims.Pure (Prims.list (a1 * a2)) | Prims.Pure | [] | [] | [
"Prims.list",
"FStar.List.Pure.Base.map2",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.Mktuple2"
] | [] | false | false | false | false | false | let zip #a1 #a2 l1 l2 =
| map2 (fun x y -> x, y) l1 l2 | false |
Steel.Preorder.fst | Steel.Preorder.lift_fact | val lift_fact (#a #p: _) (f: property a) : property (history a p) | val lift_fact (#a #p: _) (f: property a) : property (history a p) | let lift_fact #a #p (f:property a)
: property (history a p)
= fun history ->
match history with
| Witnessed h -> Cons? h /\ f (Cons?.hd h)
| Current h _ -> f (hval history) | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 39,
"end_line": 445,
"start_col": 0,
"start_line": 440
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x
(** If [z] extends [x] and [y], then [x] and [y] are extending one or another *)
let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl
(** If [x] extends [y], then the two heads of the traces are still related by the preorder *)
let rec extends_related_head (#a: Type u#a) (#q:preorder a) (x y:hist q)
: Lemma
(ensures
x `extends` y /\
Cons? x /\
Cons? y ==> Cons?.hd y `q` Cons?.hd x)
[SMTPat (x `extends` y)]
= match x with
| [] -> ()
| _::tl -> extends_related_head tl y
(** Finally, we can have our fully-fledged PCM from the preorder *)
let pcm_of_preorder (#a: Type u#a) (q:preorder a) : pcm (hist q) = {
p = p q;
comm = comm_op q;
assoc = (fun _ _ _ -> ());
assoc_r = (fun _ _ _ -> ());
is_unit = (fun _ -> ());
refine = (fun _ -> True)
}
(***** Using the preorder *)
(**
We check that the preorder derived from the PCM derived from the preorder
satisfies the same properties as the original preorder. Here, we get back history
extension from frame-preserving updates.
*)
let frame_preserving_q_aux (#a : Type u#a) (q:preorder a) (x y:hist q) (z:hist q)
: Lemma (requires (frame_preserving (pcm_of_preorder q) x y /\ compatible (pcm_of_preorder q) x z))
(ensures (y `extends` z))
= ()
(** A non-empty history *)
let vhist (#a: Type u#a) (q:preorder a) = h:hist q{Cons? h}
(** Get the current value from an history *)
let curval (#a: Type u#a) (#q:preorder a) (v:vhist q) = Cons?.hd v
(**
Given a frame-preserving update from [x] to [y]
for any value of resource [z] (compatible with [x])
the new value [y] advances the history [z] in a preorder respecting manner
*)
let frame_preserving_q (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> curval z `q` curval y))
= ()
(** Still given a frame-preserving update from [x] to [y], this update extends the history *)
let frame_preserving_extends (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> y `extends` z))
= ()
(** Helper function that flips a preoder *)
let flip (#a: Type u#a) (p:preorder a) : preorder a = fun x y -> p y x
(**
What is the preorder induced from the PCM induced by preorder [q]? It turns out that
it is the flipped of [q], reversed extension.
*)
let frame_preserving_extends2 (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> z `flip extends` y))
[SMTPat (frame_preserving (pcm_of_preorder q) x y)]
= ()
#push-options "--warn_error -271"
let pcm_of_preorder_induces_extends (#a: Type u#a) (q:preorder a)
: Lemma (induces_preorder (pcm_of_preorder q) (flip extends))
= let fp_full (x y:hist q) (f:frame_preserving_upd (pcm_of_preorder q) x y) (v:hist q)
: Lemma (requires compatible (pcm_of_preorder q) x v)
(ensures extends (f v) v)
[SMTPat ()]
= assert (composable (pcm_of_preorder q) x v) in
()
#pop-options
let extend_history (#a:Type u#a) (#q:preorder a) (h0:vhist q) (v:a{q (curval h0) v})
: h1:vhist q{h1 `extends` h0}
= v :: h0
let property (a:Type)
= a -> prop
let stable_property (#a:Type) (pcm:pcm a)
= fact:property a {
FStar.Preorder.stable fact (preorder_of_pcm pcm)
}
let fact_valid_compat (#a:Type) (#pcm:pcm a)
(fact:stable_property pcm)
(v:a)
= forall z. compatible pcm v z ==> fact z
open Steel.FractionalPermission
open FStar.Real
noeq
type history (a:Type) (p:preorder a) =
| Witnessed : hist p -> history a p
| Current : h:vhist p -> f:perm -> history a p
let hval_tot #a #p (h:history a p{Current? h}) : a =
match h with
| Current h _ -> curval h
let hval #a #p (h:history a p{Current? h}) : Ghost.erased a =
hval_tot h
let hperm #a #p (h:history a p{Current? h}) : perm =
match h with
| Current _ f -> f
let history_composable #a #p
: symrel (history a p)
= fun h0 h1 ->
match h0, h1 with
| Witnessed h0, Witnessed h1 ->
p_composable p h0 h1
| Witnessed h0, Current h1 f
| Current h1 f, Witnessed h0 ->
extends #a #p h1 h0
| Current h0 f0, Current h1 f1 ->
h0 == h1 /\
(sum_perm f0 f1).v <=. one
let history_compose #a #p (h0:history a p) (h1:history a p{history_composable h0 h1})
: history a p
= match h0, h1 with
| Witnessed h0, Witnessed h1 ->
Witnessed (p_op p h0 h1)
| Current h0 f, Witnessed h1
| Witnessed h1, Current h0 f ->
Current (p_op p h1 h0) f
| Current h0 f0, Current _ f1 ->
Current h0 (sum_perm f0 f1)
let unit_history #a #p : history a p = Witnessed []
let lem_is_unit #a #p (x:history a p)
: Lemma (history_composable x unit_history /\
history_compose x unit_history == x)
= match x with
| Witnessed h -> ()
| Current h _ ->
assert (forall (h:hist p). p_composable p h []);
assert (forall (h:hist p). p_op p h [] == h);
assert (forall (h:vhist p). extends #a #p h []);
assert (h =!= []);
assert (extends #a #p h [])
#push-options "--z3rlimit_factor 2"
let assoc_l #a #p (x y:history a p)
(z:history a p{history_composable y z /\
history_composable x (history_compose y z)})
: Lemma (history_composable x y /\
history_composable (history_compose x y) z /\
history_compose (history_compose x y) z ==
history_compose x (history_compose y z))
= ()
let assoc_r #a #p (x y:history a p)
(z:history a p{history_composable x y /\
history_composable (history_compose x y) z})
: Lemma (history_composable y z /\
history_composable x (history_compose y z) /\
history_compose (history_compose x y) z ==
history_compose x (history_compose y z))
= ()
#pop-options
let pcm_history #a #p : pcm (history a p) = {
p = {
composable = history_composable;
op = history_compose;
one = unit_history
};
comm = (fun _ _ -> ());
assoc = assoc_l;
assoc_r = assoc_r;
is_unit = lem_is_unit;
refine = (fun _ -> True);
}
let pcm_history_preorder #a #p : preorder (history a p) =
fun h0 h1 ->
match h0, h1 with
| Witnessed vh0, Witnessed vh1
| Current vh0 _, Witnessed vh1
| Witnessed vh0, Current vh1 _
| Current vh0 _, Current vh1 _ ->
vh1 `extends` vh0
#push-options "--z3rlimit_factor 8 --ifuel 1 --fuel 0 --warn_error -271"
let pcm_history_induces_preorder #a #p
: Lemma (induces_preorder (pcm_history #a #p)
(pcm_history_preorder #a #p))
= let aux (x y:history a p)
(f:frame_preserving_upd (pcm_history #a #p) x y)
(v:history a p)
: Lemma
(requires compatible (pcm_history #a #p) x v)
(ensures (pcm_history_preorder #a #p) v (f v))
[SMTPat ()]
= let pcm = pcm_history #a #p in
let v1 = f v in
match x, v, v1 with
| Witnessed _, Witnessed _, Witnessed _ ->
assert (composable pcm x v)
| Current _ _, Witnessed _, Witnessed _ -> ()
| Witnessed _, Current _ _, Witnessed _ -> ()
| Witnessed _, Witnessed _, Current _ _ ->
assert (composable pcm x v)
| Current _ _, Witnessed _, Current _ _ -> ()
| Witnessed _, Current _ _, Current _ _ -> ()
| Current hx _, Current hv _, Witnessed _
| Current hx _, Current hv _, Current _ _ ->
let frame = FStar.IndefiniteDescription.indefinite_description_ghost
(history a p) (fun frame -> composable pcm x frame /\ op pcm frame x == v) in
match frame with
| Current hf _ -> ()
| Witnessed hf ->
assert (extends hx hf);
assert (hx == hv);
assert (composable pcm x (Witnessed hv))
in
()
#pop-options
let extend_history' #a #p (h0:history a p{Current? h0})
(v:a{p (hval h0) v})
: history a p
= let Current h f = h0 in
Current (v :: h) f
let extend_history'_is_frame_preserving #a #p
(h0:history a p{Current? h0 /\ hperm h0 == full_perm})
(v:a{p (hval h0) v})
: Lemma (frame_preserving pcm_history h0 (extend_history' h0 v))
= ()
let history_val #a #p (h:history a p) (v:Ghost.erased a) (f:perm)
: prop
= Current? h /\ hval h == v /\ hperm h == f /\ f.v <=. one
let split_current #a #p (h:history a p { Current? h /\ (Current?.f h).v <=. one })
: half:history a p {
Current? h /\
composable pcm_history half half /\
op pcm_history half half == h /\
Current?.h half == Current?.h h /\
history_val half (hval h) (Current?.f half)
}
= let Current v p = h in
assert_spinoff (sum_perm (half_perm p) (half_perm p) == p);
Current v (half_perm p) | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | f: Steel.Preorder.property a -> Steel.Preorder.property (Steel.Preorder.history a p) | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.property",
"Steel.Preorder.history",
"Steel.Preorder.hist",
"Prims.l_and",
"Prims.b2t",
"Prims.uu___is_Cons",
"Prims.__proj__Cons__item__hd",
"Steel.Preorder.vhist",
"Steel.FractionalPermission.perm",
"FStar.Ghost.reveal",
"Steel.Preorder.hval",
"Prims.prop"
] | [] | false | false | false | false | false | let lift_fact #a #p (f: property a) : property (history a p) =
| function
| Witnessed h -> Cons? h /\ f (Cons?.hd h)
| Current h _ -> f (hval history) | false |
Steel.Preorder.fst | Steel.Preorder.history_val | val history_val (#a #p: _) (h: history a p) (v: Ghost.erased a) (f: perm) : prop | val history_val (#a #p: _) (h: history a p) (v: Ghost.erased a) (f: perm) : prop | let history_val #a #p (h:history a p) (v:Ghost.erased a) (f:perm)
: prop
= Current? h /\ hval h == v /\ hperm h == f /\ f.v <=. one | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 60,
"end_line": 426,
"start_col": 0,
"start_line": 424
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x
(** If [z] extends [x] and [y], then [x] and [y] are extending one or another *)
let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl
(** If [x] extends [y], then the two heads of the traces are still related by the preorder *)
let rec extends_related_head (#a: Type u#a) (#q:preorder a) (x y:hist q)
: Lemma
(ensures
x `extends` y /\
Cons? x /\
Cons? y ==> Cons?.hd y `q` Cons?.hd x)
[SMTPat (x `extends` y)]
= match x with
| [] -> ()
| _::tl -> extends_related_head tl y
(** Finally, we can have our fully-fledged PCM from the preorder *)
let pcm_of_preorder (#a: Type u#a) (q:preorder a) : pcm (hist q) = {
p = p q;
comm = comm_op q;
assoc = (fun _ _ _ -> ());
assoc_r = (fun _ _ _ -> ());
is_unit = (fun _ -> ());
refine = (fun _ -> True)
}
(***** Using the preorder *)
(**
We check that the preorder derived from the PCM derived from the preorder
satisfies the same properties as the original preorder. Here, we get back history
extension from frame-preserving updates.
*)
let frame_preserving_q_aux (#a : Type u#a) (q:preorder a) (x y:hist q) (z:hist q)
: Lemma (requires (frame_preserving (pcm_of_preorder q) x y /\ compatible (pcm_of_preorder q) x z))
(ensures (y `extends` z))
= ()
(** A non-empty history *)
let vhist (#a: Type u#a) (q:preorder a) = h:hist q{Cons? h}
(** Get the current value from an history *)
let curval (#a: Type u#a) (#q:preorder a) (v:vhist q) = Cons?.hd v
(**
Given a frame-preserving update from [x] to [y]
for any value of resource [z] (compatible with [x])
the new value [y] advances the history [z] in a preorder respecting manner
*)
let frame_preserving_q (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> curval z `q` curval y))
= ()
(** Still given a frame-preserving update from [x] to [y], this update extends the history *)
let frame_preserving_extends (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> y `extends` z))
= ()
(** Helper function that flips a preoder *)
let flip (#a: Type u#a) (p:preorder a) : preorder a = fun x y -> p y x
(**
What is the preorder induced from the PCM induced by preorder [q]? It turns out that
it is the flipped of [q], reversed extension.
*)
let frame_preserving_extends2 (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> z `flip extends` y))
[SMTPat (frame_preserving (pcm_of_preorder q) x y)]
= ()
#push-options "--warn_error -271"
let pcm_of_preorder_induces_extends (#a: Type u#a) (q:preorder a)
: Lemma (induces_preorder (pcm_of_preorder q) (flip extends))
= let fp_full (x y:hist q) (f:frame_preserving_upd (pcm_of_preorder q) x y) (v:hist q)
: Lemma (requires compatible (pcm_of_preorder q) x v)
(ensures extends (f v) v)
[SMTPat ()]
= assert (composable (pcm_of_preorder q) x v) in
()
#pop-options
let extend_history (#a:Type u#a) (#q:preorder a) (h0:vhist q) (v:a{q (curval h0) v})
: h1:vhist q{h1 `extends` h0}
= v :: h0
let property (a:Type)
= a -> prop
let stable_property (#a:Type) (pcm:pcm a)
= fact:property a {
FStar.Preorder.stable fact (preorder_of_pcm pcm)
}
let fact_valid_compat (#a:Type) (#pcm:pcm a)
(fact:stable_property pcm)
(v:a)
= forall z. compatible pcm v z ==> fact z
open Steel.FractionalPermission
open FStar.Real
noeq
type history (a:Type) (p:preorder a) =
| Witnessed : hist p -> history a p
| Current : h:vhist p -> f:perm -> history a p
let hval_tot #a #p (h:history a p{Current? h}) : a =
match h with
| Current h _ -> curval h
let hval #a #p (h:history a p{Current? h}) : Ghost.erased a =
hval_tot h
let hperm #a #p (h:history a p{Current? h}) : perm =
match h with
| Current _ f -> f
let history_composable #a #p
: symrel (history a p)
= fun h0 h1 ->
match h0, h1 with
| Witnessed h0, Witnessed h1 ->
p_composable p h0 h1
| Witnessed h0, Current h1 f
| Current h1 f, Witnessed h0 ->
extends #a #p h1 h0
| Current h0 f0, Current h1 f1 ->
h0 == h1 /\
(sum_perm f0 f1).v <=. one
let history_compose #a #p (h0:history a p) (h1:history a p{history_composable h0 h1})
: history a p
= match h0, h1 with
| Witnessed h0, Witnessed h1 ->
Witnessed (p_op p h0 h1)
| Current h0 f, Witnessed h1
| Witnessed h1, Current h0 f ->
Current (p_op p h1 h0) f
| Current h0 f0, Current _ f1 ->
Current h0 (sum_perm f0 f1)
let unit_history #a #p : history a p = Witnessed []
let lem_is_unit #a #p (x:history a p)
: Lemma (history_composable x unit_history /\
history_compose x unit_history == x)
= match x with
| Witnessed h -> ()
| Current h _ ->
assert (forall (h:hist p). p_composable p h []);
assert (forall (h:hist p). p_op p h [] == h);
assert (forall (h:vhist p). extends #a #p h []);
assert (h =!= []);
assert (extends #a #p h [])
#push-options "--z3rlimit_factor 2"
let assoc_l #a #p (x y:history a p)
(z:history a p{history_composable y z /\
history_composable x (history_compose y z)})
: Lemma (history_composable x y /\
history_composable (history_compose x y) z /\
history_compose (history_compose x y) z ==
history_compose x (history_compose y z))
= ()
let assoc_r #a #p (x y:history a p)
(z:history a p{history_composable x y /\
history_composable (history_compose x y) z})
: Lemma (history_composable y z /\
history_composable x (history_compose y z) /\
history_compose (history_compose x y) z ==
history_compose x (history_compose y z))
= ()
#pop-options
let pcm_history #a #p : pcm (history a p) = {
p = {
composable = history_composable;
op = history_compose;
one = unit_history
};
comm = (fun _ _ -> ());
assoc = assoc_l;
assoc_r = assoc_r;
is_unit = lem_is_unit;
refine = (fun _ -> True);
}
let pcm_history_preorder #a #p : preorder (history a p) =
fun h0 h1 ->
match h0, h1 with
| Witnessed vh0, Witnessed vh1
| Current vh0 _, Witnessed vh1
| Witnessed vh0, Current vh1 _
| Current vh0 _, Current vh1 _ ->
vh1 `extends` vh0
#push-options "--z3rlimit_factor 8 --ifuel 1 --fuel 0 --warn_error -271"
let pcm_history_induces_preorder #a #p
: Lemma (induces_preorder (pcm_history #a #p)
(pcm_history_preorder #a #p))
= let aux (x y:history a p)
(f:frame_preserving_upd (pcm_history #a #p) x y)
(v:history a p)
: Lemma
(requires compatible (pcm_history #a #p) x v)
(ensures (pcm_history_preorder #a #p) v (f v))
[SMTPat ()]
= let pcm = pcm_history #a #p in
let v1 = f v in
match x, v, v1 with
| Witnessed _, Witnessed _, Witnessed _ ->
assert (composable pcm x v)
| Current _ _, Witnessed _, Witnessed _ -> ()
| Witnessed _, Current _ _, Witnessed _ -> ()
| Witnessed _, Witnessed _, Current _ _ ->
assert (composable pcm x v)
| Current _ _, Witnessed _, Current _ _ -> ()
| Witnessed _, Current _ _, Current _ _ -> ()
| Current hx _, Current hv _, Witnessed _
| Current hx _, Current hv _, Current _ _ ->
let frame = FStar.IndefiniteDescription.indefinite_description_ghost
(history a p) (fun frame -> composable pcm x frame /\ op pcm frame x == v) in
match frame with
| Current hf _ -> ()
| Witnessed hf ->
assert (extends hx hf);
assert (hx == hv);
assert (composable pcm x (Witnessed hv))
in
()
#pop-options
let extend_history' #a #p (h0:history a p{Current? h0})
(v:a{p (hval h0) v})
: history a p
= let Current h f = h0 in
Current (v :: h) f
let extend_history'_is_frame_preserving #a #p
(h0:history a p{Current? h0 /\ hperm h0 == full_perm})
(v:a{p (hval h0) v})
: Lemma (frame_preserving pcm_history h0 (extend_history' h0 v))
= () | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | h: Steel.Preorder.history a p -> v: FStar.Ghost.erased a -> f: Steel.FractionalPermission.perm
-> Prims.prop | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.history",
"FStar.Ghost.erased",
"Steel.FractionalPermission.perm",
"Prims.l_and",
"Prims.b2t",
"Steel.Preorder.uu___is_Current",
"Prims.eq2",
"Steel.Preorder.hval",
"Steel.Preorder.hperm",
"FStar.Real.op_Less_Equals_Dot",
"Steel.FractionalPermission.__proj__MkPerm__item__v",
"FStar.Real.one",
"Prims.prop"
] | [] | false | false | false | false | true | let history_val #a #p (h: history a p) (v: Ghost.erased a) (f: perm) : prop =
| Current? h /\ hval h == v /\ hperm h == f /\ f.v <=. one | false |
Steel.Preorder.fst | Steel.Preorder.lift_fact_is_stable | val lift_fact_is_stable (#a #p: _) (f: property a {FStar.Preorder.stable f p})
: Lemma (FStar.Preorder.stable #(history a p) (lift_fact f) (preorder_of_pcm pcm_history)) | val lift_fact_is_stable (#a #p: _) (f: property a {FStar.Preorder.stable f p})
: Lemma (FStar.Preorder.stable #(history a p) (lift_fact f) (preorder_of_pcm pcm_history)) | let lift_fact_is_stable #a #p (f:property a{FStar.Preorder.stable f p})
: Lemma (FStar.Preorder.stable #(history a p)
(lift_fact f)
(preorder_of_pcm pcm_history))
= assert (FStar.Preorder.stable #(history a p) (lift_fact f) pcm_history_preorder);
pcm_history_induces_preorder #a #p;
stability #(history a p) (lift_fact f) pcm_history_preorder pcm_history | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 75,
"end_line": 453,
"start_col": 0,
"start_line": 447
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x
(** If [z] extends [x] and [y], then [x] and [y] are extending one or another *)
let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl
(** If [x] extends [y], then the two heads of the traces are still related by the preorder *)
let rec extends_related_head (#a: Type u#a) (#q:preorder a) (x y:hist q)
: Lemma
(ensures
x `extends` y /\
Cons? x /\
Cons? y ==> Cons?.hd y `q` Cons?.hd x)
[SMTPat (x `extends` y)]
= match x with
| [] -> ()
| _::tl -> extends_related_head tl y
(** Finally, we can have our fully-fledged PCM from the preorder *)
let pcm_of_preorder (#a: Type u#a) (q:preorder a) : pcm (hist q) = {
p = p q;
comm = comm_op q;
assoc = (fun _ _ _ -> ());
assoc_r = (fun _ _ _ -> ());
is_unit = (fun _ -> ());
refine = (fun _ -> True)
}
(***** Using the preorder *)
(**
We check that the preorder derived from the PCM derived from the preorder
satisfies the same properties as the original preorder. Here, we get back history
extension from frame-preserving updates.
*)
let frame_preserving_q_aux (#a : Type u#a) (q:preorder a) (x y:hist q) (z:hist q)
: Lemma (requires (frame_preserving (pcm_of_preorder q) x y /\ compatible (pcm_of_preorder q) x z))
(ensures (y `extends` z))
= ()
(** A non-empty history *)
let vhist (#a: Type u#a) (q:preorder a) = h:hist q{Cons? h}
(** Get the current value from an history *)
let curval (#a: Type u#a) (#q:preorder a) (v:vhist q) = Cons?.hd v
(**
Given a frame-preserving update from [x] to [y]
for any value of resource [z] (compatible with [x])
the new value [y] advances the history [z] in a preorder respecting manner
*)
let frame_preserving_q (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> curval z `q` curval y))
= ()
(** Still given a frame-preserving update from [x] to [y], this update extends the history *)
let frame_preserving_extends (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> y `extends` z))
= ()
(** Helper function that flips a preoder *)
let flip (#a: Type u#a) (p:preorder a) : preorder a = fun x y -> p y x
(**
What is the preorder induced from the PCM induced by preorder [q]? It turns out that
it is the flipped of [q], reversed extension.
*)
let frame_preserving_extends2 (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> z `flip extends` y))
[SMTPat (frame_preserving (pcm_of_preorder q) x y)]
= ()
#push-options "--warn_error -271"
let pcm_of_preorder_induces_extends (#a: Type u#a) (q:preorder a)
: Lemma (induces_preorder (pcm_of_preorder q) (flip extends))
= let fp_full (x y:hist q) (f:frame_preserving_upd (pcm_of_preorder q) x y) (v:hist q)
: Lemma (requires compatible (pcm_of_preorder q) x v)
(ensures extends (f v) v)
[SMTPat ()]
= assert (composable (pcm_of_preorder q) x v) in
()
#pop-options
let extend_history (#a:Type u#a) (#q:preorder a) (h0:vhist q) (v:a{q (curval h0) v})
: h1:vhist q{h1 `extends` h0}
= v :: h0
let property (a:Type)
= a -> prop
let stable_property (#a:Type) (pcm:pcm a)
= fact:property a {
FStar.Preorder.stable fact (preorder_of_pcm pcm)
}
let fact_valid_compat (#a:Type) (#pcm:pcm a)
(fact:stable_property pcm)
(v:a)
= forall z. compatible pcm v z ==> fact z
open Steel.FractionalPermission
open FStar.Real
noeq
type history (a:Type) (p:preorder a) =
| Witnessed : hist p -> history a p
| Current : h:vhist p -> f:perm -> history a p
let hval_tot #a #p (h:history a p{Current? h}) : a =
match h with
| Current h _ -> curval h
let hval #a #p (h:history a p{Current? h}) : Ghost.erased a =
hval_tot h
let hperm #a #p (h:history a p{Current? h}) : perm =
match h with
| Current _ f -> f
let history_composable #a #p
: symrel (history a p)
= fun h0 h1 ->
match h0, h1 with
| Witnessed h0, Witnessed h1 ->
p_composable p h0 h1
| Witnessed h0, Current h1 f
| Current h1 f, Witnessed h0 ->
extends #a #p h1 h0
| Current h0 f0, Current h1 f1 ->
h0 == h1 /\
(sum_perm f0 f1).v <=. one
let history_compose #a #p (h0:history a p) (h1:history a p{history_composable h0 h1})
: history a p
= match h0, h1 with
| Witnessed h0, Witnessed h1 ->
Witnessed (p_op p h0 h1)
| Current h0 f, Witnessed h1
| Witnessed h1, Current h0 f ->
Current (p_op p h1 h0) f
| Current h0 f0, Current _ f1 ->
Current h0 (sum_perm f0 f1)
let unit_history #a #p : history a p = Witnessed []
let lem_is_unit #a #p (x:history a p)
: Lemma (history_composable x unit_history /\
history_compose x unit_history == x)
= match x with
| Witnessed h -> ()
| Current h _ ->
assert (forall (h:hist p). p_composable p h []);
assert (forall (h:hist p). p_op p h [] == h);
assert (forall (h:vhist p). extends #a #p h []);
assert (h =!= []);
assert (extends #a #p h [])
#push-options "--z3rlimit_factor 2"
let assoc_l #a #p (x y:history a p)
(z:history a p{history_composable y z /\
history_composable x (history_compose y z)})
: Lemma (history_composable x y /\
history_composable (history_compose x y) z /\
history_compose (history_compose x y) z ==
history_compose x (history_compose y z))
= ()
let assoc_r #a #p (x y:history a p)
(z:history a p{history_composable x y /\
history_composable (history_compose x y) z})
: Lemma (history_composable y z /\
history_composable x (history_compose y z) /\
history_compose (history_compose x y) z ==
history_compose x (history_compose y z))
= ()
#pop-options
let pcm_history #a #p : pcm (history a p) = {
p = {
composable = history_composable;
op = history_compose;
one = unit_history
};
comm = (fun _ _ -> ());
assoc = assoc_l;
assoc_r = assoc_r;
is_unit = lem_is_unit;
refine = (fun _ -> True);
}
let pcm_history_preorder #a #p : preorder (history a p) =
fun h0 h1 ->
match h0, h1 with
| Witnessed vh0, Witnessed vh1
| Current vh0 _, Witnessed vh1
| Witnessed vh0, Current vh1 _
| Current vh0 _, Current vh1 _ ->
vh1 `extends` vh0
#push-options "--z3rlimit_factor 8 --ifuel 1 --fuel 0 --warn_error -271"
let pcm_history_induces_preorder #a #p
: Lemma (induces_preorder (pcm_history #a #p)
(pcm_history_preorder #a #p))
= let aux (x y:history a p)
(f:frame_preserving_upd (pcm_history #a #p) x y)
(v:history a p)
: Lemma
(requires compatible (pcm_history #a #p) x v)
(ensures (pcm_history_preorder #a #p) v (f v))
[SMTPat ()]
= let pcm = pcm_history #a #p in
let v1 = f v in
match x, v, v1 with
| Witnessed _, Witnessed _, Witnessed _ ->
assert (composable pcm x v)
| Current _ _, Witnessed _, Witnessed _ -> ()
| Witnessed _, Current _ _, Witnessed _ -> ()
| Witnessed _, Witnessed _, Current _ _ ->
assert (composable pcm x v)
| Current _ _, Witnessed _, Current _ _ -> ()
| Witnessed _, Current _ _, Current _ _ -> ()
| Current hx _, Current hv _, Witnessed _
| Current hx _, Current hv _, Current _ _ ->
let frame = FStar.IndefiniteDescription.indefinite_description_ghost
(history a p) (fun frame -> composable pcm x frame /\ op pcm frame x == v) in
match frame with
| Current hf _ -> ()
| Witnessed hf ->
assert (extends hx hf);
assert (hx == hv);
assert (composable pcm x (Witnessed hv))
in
()
#pop-options
let extend_history' #a #p (h0:history a p{Current? h0})
(v:a{p (hval h0) v})
: history a p
= let Current h f = h0 in
Current (v :: h) f
let extend_history'_is_frame_preserving #a #p
(h0:history a p{Current? h0 /\ hperm h0 == full_perm})
(v:a{p (hval h0) v})
: Lemma (frame_preserving pcm_history h0 (extend_history' h0 v))
= ()
let history_val #a #p (h:history a p) (v:Ghost.erased a) (f:perm)
: prop
= Current? h /\ hval h == v /\ hperm h == f /\ f.v <=. one
let split_current #a #p (h:history a p { Current? h /\ (Current?.f h).v <=. one })
: half:history a p {
Current? h /\
composable pcm_history half half /\
op pcm_history half half == h /\
Current?.h half == Current?.h h /\
history_val half (hval h) (Current?.f half)
}
= let Current v p = h in
assert_spinoff (sum_perm (half_perm p) (half_perm p) == p);
Current v (half_perm p)
let lift_fact #a #p (f:property a)
: property (history a p)
= fun history ->
match history with
| Witnessed h -> Cons? h /\ f (Cons?.hd h)
| Current h _ -> f (hval history) | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | f: Steel.Preorder.property a {FStar.Preorder.stable f p}
-> FStar.Pervasives.Lemma
(ensures
FStar.Preorder.stable (Steel.Preorder.lift_fact f)
(Steel.Preorder.preorder_of_pcm Steel.Preorder.pcm_history)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Preorder.relation",
"FStar.Preorder.preorder_rel",
"Steel.Preorder.property",
"FStar.Preorder.stable",
"Steel.Preorder.stability",
"Steel.Preorder.history",
"Steel.Preorder.lift_fact",
"Steel.Preorder.pcm_history_preorder",
"Steel.Preorder.pcm_history",
"Prims.unit",
"Steel.Preorder.pcm_history_induces_preorder",
"Prims._assert",
"Prims.l_True",
"Prims.squash",
"Steel.Preorder.preorder_of_pcm",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | true | false | true | false | false | let lift_fact_is_stable #a #p (f: property a {FStar.Preorder.stable f p})
: Lemma (FStar.Preorder.stable #(history a p) (lift_fact f) (preorder_of_pcm pcm_history)) =
| assert (FStar.Preorder.stable #(history a p) (lift_fact f) pcm_history_preorder);
pcm_history_induces_preorder #a #p;
stability #(history a p) (lift_fact f) pcm_history_preorder pcm_history | false |
Steel.Preorder.fst | Steel.Preorder.lem_is_unit | val lem_is_unit (#a #p: _) (x: history a p)
: Lemma (history_composable x unit_history /\ history_compose x unit_history == x) | val lem_is_unit (#a #p: _) (x: history a p)
: Lemma (history_composable x unit_history /\ history_compose x unit_history == x) | let lem_is_unit #a #p (x:history a p)
: Lemma (history_composable x unit_history /\
history_compose x unit_history == x)
= match x with
| Witnessed h -> ()
| Current h _ ->
assert (forall (h:hist p). p_composable p h []);
assert (forall (h:hist p). p_op p h [] == h);
assert (forall (h:vhist p). extends #a #p h []);
assert (h =!= []);
assert (extends #a #p h []) | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 33,
"end_line": 332,
"start_col": 0,
"start_line": 322
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x
(** If [z] extends [x] and [y], then [x] and [y] are extending one or another *)
let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl
(** If [x] extends [y], then the two heads of the traces are still related by the preorder *)
let rec extends_related_head (#a: Type u#a) (#q:preorder a) (x y:hist q)
: Lemma
(ensures
x `extends` y /\
Cons? x /\
Cons? y ==> Cons?.hd y `q` Cons?.hd x)
[SMTPat (x `extends` y)]
= match x with
| [] -> ()
| _::tl -> extends_related_head tl y
(** Finally, we can have our fully-fledged PCM from the preorder *)
let pcm_of_preorder (#a: Type u#a) (q:preorder a) : pcm (hist q) = {
p = p q;
comm = comm_op q;
assoc = (fun _ _ _ -> ());
assoc_r = (fun _ _ _ -> ());
is_unit = (fun _ -> ());
refine = (fun _ -> True)
}
(***** Using the preorder *)
(**
We check that the preorder derived from the PCM derived from the preorder
satisfies the same properties as the original preorder. Here, we get back history
extension from frame-preserving updates.
*)
let frame_preserving_q_aux (#a : Type u#a) (q:preorder a) (x y:hist q) (z:hist q)
: Lemma (requires (frame_preserving (pcm_of_preorder q) x y /\ compatible (pcm_of_preorder q) x z))
(ensures (y `extends` z))
= ()
(** A non-empty history *)
let vhist (#a: Type u#a) (q:preorder a) = h:hist q{Cons? h}
(** Get the current value from an history *)
let curval (#a: Type u#a) (#q:preorder a) (v:vhist q) = Cons?.hd v
(**
Given a frame-preserving update from [x] to [y]
for any value of resource [z] (compatible with [x])
the new value [y] advances the history [z] in a preorder respecting manner
*)
let frame_preserving_q (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> curval z `q` curval y))
= ()
(** Still given a frame-preserving update from [x] to [y], this update extends the history *)
let frame_preserving_extends (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> y `extends` z))
= ()
(** Helper function that flips a preoder *)
let flip (#a: Type u#a) (p:preorder a) : preorder a = fun x y -> p y x
(**
What is the preorder induced from the PCM induced by preorder [q]? It turns out that
it is the flipped of [q], reversed extension.
*)
let frame_preserving_extends2 (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> z `flip extends` y))
[SMTPat (frame_preserving (pcm_of_preorder q) x y)]
= ()
#push-options "--warn_error -271"
let pcm_of_preorder_induces_extends (#a: Type u#a) (q:preorder a)
: Lemma (induces_preorder (pcm_of_preorder q) (flip extends))
= let fp_full (x y:hist q) (f:frame_preserving_upd (pcm_of_preorder q) x y) (v:hist q)
: Lemma (requires compatible (pcm_of_preorder q) x v)
(ensures extends (f v) v)
[SMTPat ()]
= assert (composable (pcm_of_preorder q) x v) in
()
#pop-options
let extend_history (#a:Type u#a) (#q:preorder a) (h0:vhist q) (v:a{q (curval h0) v})
: h1:vhist q{h1 `extends` h0}
= v :: h0
let property (a:Type)
= a -> prop
let stable_property (#a:Type) (pcm:pcm a)
= fact:property a {
FStar.Preorder.stable fact (preorder_of_pcm pcm)
}
let fact_valid_compat (#a:Type) (#pcm:pcm a)
(fact:stable_property pcm)
(v:a)
= forall z. compatible pcm v z ==> fact z
open Steel.FractionalPermission
open FStar.Real
noeq
type history (a:Type) (p:preorder a) =
| Witnessed : hist p -> history a p
| Current : h:vhist p -> f:perm -> history a p
let hval_tot #a #p (h:history a p{Current? h}) : a =
match h with
| Current h _ -> curval h
let hval #a #p (h:history a p{Current? h}) : Ghost.erased a =
hval_tot h
let hperm #a #p (h:history a p{Current? h}) : perm =
match h with
| Current _ f -> f
let history_composable #a #p
: symrel (history a p)
= fun h0 h1 ->
match h0, h1 with
| Witnessed h0, Witnessed h1 ->
p_composable p h0 h1
| Witnessed h0, Current h1 f
| Current h1 f, Witnessed h0 ->
extends #a #p h1 h0
| Current h0 f0, Current h1 f1 ->
h0 == h1 /\
(sum_perm f0 f1).v <=. one
let history_compose #a #p (h0:history a p) (h1:history a p{history_composable h0 h1})
: history a p
= match h0, h1 with
| Witnessed h0, Witnessed h1 ->
Witnessed (p_op p h0 h1)
| Current h0 f, Witnessed h1
| Witnessed h1, Current h0 f ->
Current (p_op p h1 h0) f
| Current h0 f0, Current _ f1 ->
Current h0 (sum_perm f0 f1)
let unit_history #a #p : history a p = Witnessed [] | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | x: Steel.Preorder.history a p
-> FStar.Pervasives.Lemma
(ensures
Steel.Preorder.history_composable x Steel.Preorder.unit_history /\
Steel.Preorder.history_compose x Steel.Preorder.unit_history == x) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.history",
"Steel.Preorder.hist",
"Steel.Preorder.vhist",
"Steel.FractionalPermission.perm",
"Prims._assert",
"Steel.Preorder.extends",
"Prims.Nil",
"Prims.unit",
"Prims.l_not",
"Prims.eq2",
"Prims.list",
"Prims.l_Forall",
"Steel.Preorder.p_op",
"Steel.Preorder.p_composable",
"Prims.l_True",
"Prims.squash",
"Prims.l_and",
"Steel.Preorder.history_composable",
"Steel.Preorder.unit_history",
"Steel.Preorder.history_compose",
"FStar.Pervasives.pattern"
] | [] | false | false | true | false | false | let lem_is_unit #a #p (x: history a p)
: Lemma (history_composable x unit_history /\ history_compose x unit_history == x) =
| match x with
| Witnessed h -> ()
| Current h _ ->
assert (forall (h: hist p). p_composable p h []);
assert (forall (h: hist p). p_op p h [] == h);
assert (forall (h: vhist p). extends #a #p h []);
assert (h =!= []);
assert (extends #a #p h []) | false |
FStar.List.Pure.Base.fst | FStar.List.Pure.Base.zip3 | val zip3 (#a1 #a2 #a3:Type) (l1:list a1) (l2:list a2) (l3:list a3)
: Pure (list (a1 * a2 * a3))
(requires (let n = length l1 in n == length l2 /\ n == length l3))
(ensures (fun _ -> True)) | val zip3 (#a1 #a2 #a3:Type) (l1:list a1) (l2:list a2) (l3:list a3)
: Pure (list (a1 * a2 * a3))
(requires (let n = length l1 in n == length l2 /\ n == length l3))
(ensures (fun _ -> True)) | let zip3 #a1 #a2 #a3 l1 l2 l3 = map3 (fun x y z -> x,y,z) l1 l2 l3 | {
"file_name": "ulib/FStar.List.Pure.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 66,
"end_line": 70,
"start_col": 0,
"start_line": 70
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.List.Pure.Base
open FStar.List.Tot.Base
(** Functions on list with a pure specification *)
(** [map2] takes a pair of list of the same length [x1; ...; xn] [y1; ... ; yn]
and return the list [f x1 y1; ... ; f xn yn] *)
val map2 (#a1 #a2 #b: Type)
(f: a1 -> a2 -> b)
(l1:list a1)
(l2:list a2)
: Pure (list b)
(requires (length l1 == length l2))
(ensures (fun _ -> True))
(decreases l1)
let rec map2 #a1 #a2 #b f l1 l2 =
match l1, l2 with
| [], [] -> []
| x1::xs1, x2::xs2 -> f x1 x2 :: map2 f xs1 xs2
(** [map3] takes three lists of the same length [x1; ...; xn]
[y1; ... ; yn] [z1; ... ; zn] and return the list
[f x1 y1 z1; ... ; f xn yn zn] *)
val map3 (#a1 #a2 #a3 #b: Type)
(f: a1 -> a2 -> a3 -> b)
(l1:list a1)
(l2:list a2)
(l3:list a3)
: Pure (list b)
(requires (let n = length l1 in
(n == length l2 /\
n == length l3)))
(ensures (fun _ -> True))
(decreases l1)
let rec map3 #a1 #a2 #a3 #b f l1 l2 l3 =
match l1, l2, l3 with
| [], [], [] -> []
| x1::xs1, x2::xs2, x3::xs3 -> f x1 x2 x3 :: map3 f xs1 xs2 xs3
(** [zip] takes a pair of list of the same length and returns
the list of index-wise pairs *)
val zip (#a1 #a2:Type) (l1:list a1) (l2:list a2)
: Pure (list (a1 * a2))
(requires (let n = length l1 in n == length l2))
(ensures (fun _ -> True))
let zip #a1 #a2 l1 l2 = map2 (fun x y -> x, y) l1 l2
(** [zip3] takes a 3-tuple of list of the same length and returns
the list of index-wise 3-tuples *)
val zip3 (#a1 #a2 #a3:Type) (l1:list a1) (l2:list a2) (l3:list a3)
: Pure (list (a1 * a2 * a3))
(requires (let n = length l1 in n == length l2 /\ n == length l3)) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked"
],
"interface_file": false,
"source_file": "FStar.List.Pure.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | l1: Prims.list a1 -> l2: Prims.list a2 -> l3: Prims.list a3
-> Prims.Pure (Prims.list ((a1 * a2) * a3)) | Prims.Pure | [] | [] | [
"Prims.list",
"FStar.List.Pure.Base.map3",
"FStar.Pervasives.Native.tuple3",
"FStar.Pervasives.Native.Mktuple3"
] | [] | false | false | false | false | false | let zip3 #a1 #a2 #a3 l1 l2 l3 =
| map3 (fun x y z -> x, y, z) l1 l2 l3 | false |
Steel.Preorder.fst | Steel.Preorder.split_current | val split_current (#a #p: _) (h: history a p {Current? h /\ (Current?.f h).v <=. one})
: half:
history a p
{ Current? h /\ composable pcm_history half half /\ op pcm_history half half == h /\
Current?.h half == Current?.h h /\ history_val half (hval h) (Current?.f half) } | val split_current (#a #p: _) (h: history a p {Current? h /\ (Current?.f h).v <=. one})
: half:
history a p
{ Current? h /\ composable pcm_history half half /\ op pcm_history half half == h /\
Current?.h half == Current?.h h /\ history_val half (hval h) (Current?.f half) } | let split_current #a #p (h:history a p { Current? h /\ (Current?.f h).v <=. one })
: half:history a p {
Current? h /\
composable pcm_history half half /\
op pcm_history half half == h /\
Current?.h half == Current?.h h /\
history_val half (hval h) (Current?.f half)
}
= let Current v p = h in
assert_spinoff (sum_perm (half_perm p) (half_perm p) == p);
Current v (half_perm p) | {
"file_name": "lib/steel/Steel.Preorder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 27,
"end_line": 438,
"start_col": 0,
"start_line": 428
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.Preorder
open FStar.PCM
open FStar.Preorder
/// This module explores the connection between PCM and preorders. More specifically, we show here
/// that any PCM induces a preorder relation, characterized by frame-preservation for any updates.
///
/// Furthermore, we also consider the reverse relationship where we derive a PCM for any preorder,
/// by taking as elements of the PCM the trace of all the states of the element.
(**** PCM to preoder *)
(**
PCM [p] induces the preorder [q] if for any frame preserving update of [x] to [y],
the argument and result of the frame preserving update are related by q
*)
let induces_preorder (#a:Type u#a) (p:pcm a) (q:preorder a) =
forall (x y:a) (f:frame_preserving_upd p x y) (v:a).
p.refine v ==> compatible p x v ==> q v (f v)
(**
We can define a canonical preorder from any PCM by taking the quantified conjunction over all the
preorders [q] induced by this PCM.
*)
let preorder_of_pcm (#a:Type u#a) (p:pcm a) : preorder a =
fun x y -> forall (q:preorder a). induces_preorder p q ==> q x y
let frame_preserving_upd_is_preorder_preserving (#a:Type u#a) (p:pcm a)
(x y:a) (f:frame_preserving_upd p x y)
(v_old:a{p.refine v_old /\ compatible p x v_old})
: Lemma ((preorder_of_pcm p) v_old (f v_old))
= ()
(**
This canonical preorder enjoys the nice property that it preserves fact stability of any
induced preorder
*)
let stability (#a: Type u#a) (fact:a -> prop) (q:preorder a) (p:pcm a)
: Lemma
(requires stable fact q /\
induces_preorder p q)
(ensures stable fact (preorder_of_pcm p))
= ()
let stable_compatiblity (#a:Type u#a) (fact: a -> prop) (p:pcm a) (v v0 v1:a)
: Lemma
(requires
stable fact (preorder_of_pcm p) /\
p.refine v0 /\
fact v0 /\
p.refine v1 /\
frame_preserving p v v1 /\
compatible p v v0)
(ensures
fact v1)
= let f : frame_preserving_upd p v v1 = frame_preserving_val_to_fp_upd p v v1 in
frame_preserving_upd_is_preorder_preserving p v v1 f v0
(**** Preorder to PCM *)
(***** Building the preorder *)
(**
This predicate tells that the list [l] can represent a trace of elements whose evolution is
compatible with the preorder [q]
*)
let rec qhistory #a (q:preorder a) (l:list a) =
match l with
| []
| [_] -> True
| x::y::tl -> y `q` x /\ qhistory q (y::tl)
(** The history of a preorder is the type of all the traces compatible with that preorder *)
let hist (#a: Type u#a) (q:preorder a) = l:list a{qhistory q l}
(** Two compatible traces can extend each other *)
let rec extends' (#a: Type u#a) (#q:preorder a) (h0 h1:hist q) =
h0 == h1 \/ (Cons? h0 /\ extends' (Cons?.tl h0) h1)
(** This extension relation is transitive *)
let rec extends_trans #a (#q:preorder a) (x y z:hist q)
: Lemma (x `extends'` y /\ y `extends'` z ==> x `extends'` z)
[SMTPat (x `extends'` y);
SMTPat (y `extends'` z)]
= match x with
| [] -> ()
| _::tl -> extends_trans tl y z
(** And it is also reflexive, so extensibility on traces is a preorder on traces *)
let extends (#a: Type u#a) (#q:preorder a) : preorder (hist q) = extends'
module L = FStar.List.Tot
(** If [h0] extends by [h1], then the length of [h0] is superior *)
let rec extends_length_eq (#a: Type u#a) (#q:preorder a) (h0 h1:hist q)
: Lemma (ensures (extends h0 h1 ==> h0 == h1 \/ L.length h0 > L.length h1))
[SMTPat (extends h0 h1)]
= match h0 with
| [] -> ()
| hd::tl -> extends_length_eq tl h1
(**
We build our relation of composability for traces by reflexing the extension to ensure
symmetry
*)
let p_composable (#a: Type u#a) (q:preorder a) : symrel (hist q) =
fun x y -> extends x y \/ extends y x
(** The operation for the PCM is to return the full trace of two extensible traces *)
let p_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y}) : hist q =
if L.length x >= L.length y
then x
else if L.length x = L.length y
then (assert (x == y); x)
else y
(** The operation actually implements extension *)
let p_op_extends (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (ensures (p_op q x y `extends` x /\
p_op q x y `extends` y /\
(p_op q x y == x \/ p_op q x y == y)))
[SMTPat (p_op q x y)]
= extends_length_eq x y;
extends_length_eq y x
(** And the empty trace is the unit element *)
let rec p_op_nil (#a: Type u#a) (q:preorder a) (x:hist q)
: Lemma (ensures (p_composable q x [] /\ p_op q x [] == x))
[SMTPat (p_composable q x [])]
= match x with
| [] -> ()
| _::tl -> p_op_nil q tl
(** We can finally define our PCM with these operations *)
let p (#a: Type u#a) (q:preorder a) : pcm' (hist q) = {
composable = p_composable q;
op = p_op q;
one = []
}
(** Composability is commutative *)
let comm (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires p_composable q x y)
(ensures p_composable q y x)
= ()
(** As well as the compose operation *)
let comm_op (#a: Type u#a) (q:preorder a) (x:hist q) (y:hist q{p_composable q x y})
: Lemma (p_op q x y == p_op q y x)
= extends_length_eq x y;
extends_length_eq y x
(** If [z] extends [x] and [y], then [x] and [y] are extending one or another *)
let rec extends_disjunction (#a: Type u#a) (#q:preorder a) (x y z:hist q)
: Lemma (z `extends` x /\ z `extends` y ==> x `extends` y \/ y `extends` x)
[SMTPat (z `extends` x);
SMTPat (z `extends` y)]
= match z with
| [] -> ()
| _::tl -> extends_disjunction x y tl
(** If [x] extends [y], then the two heads of the traces are still related by the preorder *)
let rec extends_related_head (#a: Type u#a) (#q:preorder a) (x y:hist q)
: Lemma
(ensures
x `extends` y /\
Cons? x /\
Cons? y ==> Cons?.hd y `q` Cons?.hd x)
[SMTPat (x `extends` y)]
= match x with
| [] -> ()
| _::tl -> extends_related_head tl y
(** Finally, we can have our fully-fledged PCM from the preorder *)
let pcm_of_preorder (#a: Type u#a) (q:preorder a) : pcm (hist q) = {
p = p q;
comm = comm_op q;
assoc = (fun _ _ _ -> ());
assoc_r = (fun _ _ _ -> ());
is_unit = (fun _ -> ());
refine = (fun _ -> True)
}
(***** Using the preorder *)
(**
We check that the preorder derived from the PCM derived from the preorder
satisfies the same properties as the original preorder. Here, we get back history
extension from frame-preserving updates.
*)
let frame_preserving_q_aux (#a : Type u#a) (q:preorder a) (x y:hist q) (z:hist q)
: Lemma (requires (frame_preserving (pcm_of_preorder q) x y /\ compatible (pcm_of_preorder q) x z))
(ensures (y `extends` z))
= ()
(** A non-empty history *)
let vhist (#a: Type u#a) (q:preorder a) = h:hist q{Cons? h}
(** Get the current value from an history *)
let curval (#a: Type u#a) (#q:preorder a) (v:vhist q) = Cons?.hd v
(**
Given a frame-preserving update from [x] to [y]
for any value of resource [z] (compatible with [x])
the new value [y] advances the history [z] in a preorder respecting manner
*)
let frame_preserving_q (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> curval z `q` curval y))
= ()
(** Still given a frame-preserving update from [x] to [y], this update extends the history *)
let frame_preserving_extends (#a: Type u#a) (q:preorder a) (x y:vhist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> y `extends` z))
= ()
(** Helper function that flips a preoder *)
let flip (#a: Type u#a) (p:preorder a) : preorder a = fun x y -> p y x
(**
What is the preorder induced from the PCM induced by preorder [q]? It turns out that
it is the flipped of [q], reversed extension.
*)
let frame_preserving_extends2 (#a: Type u#a) (q:preorder a) (x y:hist q)
: Lemma (requires frame_preserving (pcm_of_preorder q) x y)
(ensures (forall (z:hist q). compatible (pcm_of_preorder q) x z ==> z `flip extends` y))
[SMTPat (frame_preserving (pcm_of_preorder q) x y)]
= ()
#push-options "--warn_error -271"
let pcm_of_preorder_induces_extends (#a: Type u#a) (q:preorder a)
: Lemma (induces_preorder (pcm_of_preorder q) (flip extends))
= let fp_full (x y:hist q) (f:frame_preserving_upd (pcm_of_preorder q) x y) (v:hist q)
: Lemma (requires compatible (pcm_of_preorder q) x v)
(ensures extends (f v) v)
[SMTPat ()]
= assert (composable (pcm_of_preorder q) x v) in
()
#pop-options
let extend_history (#a:Type u#a) (#q:preorder a) (h0:vhist q) (v:a{q (curval h0) v})
: h1:vhist q{h1 `extends` h0}
= v :: h0
let property (a:Type)
= a -> prop
let stable_property (#a:Type) (pcm:pcm a)
= fact:property a {
FStar.Preorder.stable fact (preorder_of_pcm pcm)
}
let fact_valid_compat (#a:Type) (#pcm:pcm a)
(fact:stable_property pcm)
(v:a)
= forall z. compatible pcm v z ==> fact z
open Steel.FractionalPermission
open FStar.Real
noeq
type history (a:Type) (p:preorder a) =
| Witnessed : hist p -> history a p
| Current : h:vhist p -> f:perm -> history a p
let hval_tot #a #p (h:history a p{Current? h}) : a =
match h with
| Current h _ -> curval h
let hval #a #p (h:history a p{Current? h}) : Ghost.erased a =
hval_tot h
let hperm #a #p (h:history a p{Current? h}) : perm =
match h with
| Current _ f -> f
let history_composable #a #p
: symrel (history a p)
= fun h0 h1 ->
match h0, h1 with
| Witnessed h0, Witnessed h1 ->
p_composable p h0 h1
| Witnessed h0, Current h1 f
| Current h1 f, Witnessed h0 ->
extends #a #p h1 h0
| Current h0 f0, Current h1 f1 ->
h0 == h1 /\
(sum_perm f0 f1).v <=. one
let history_compose #a #p (h0:history a p) (h1:history a p{history_composable h0 h1})
: history a p
= match h0, h1 with
| Witnessed h0, Witnessed h1 ->
Witnessed (p_op p h0 h1)
| Current h0 f, Witnessed h1
| Witnessed h1, Current h0 f ->
Current (p_op p h1 h0) f
| Current h0 f0, Current _ f1 ->
Current h0 (sum_perm f0 f1)
let unit_history #a #p : history a p = Witnessed []
let lem_is_unit #a #p (x:history a p)
: Lemma (history_composable x unit_history /\
history_compose x unit_history == x)
= match x with
| Witnessed h -> ()
| Current h _ ->
assert (forall (h:hist p). p_composable p h []);
assert (forall (h:hist p). p_op p h [] == h);
assert (forall (h:vhist p). extends #a #p h []);
assert (h =!= []);
assert (extends #a #p h [])
#push-options "--z3rlimit_factor 2"
let assoc_l #a #p (x y:history a p)
(z:history a p{history_composable y z /\
history_composable x (history_compose y z)})
: Lemma (history_composable x y /\
history_composable (history_compose x y) z /\
history_compose (history_compose x y) z ==
history_compose x (history_compose y z))
= ()
let assoc_r #a #p (x y:history a p)
(z:history a p{history_composable x y /\
history_composable (history_compose x y) z})
: Lemma (history_composable y z /\
history_composable x (history_compose y z) /\
history_compose (history_compose x y) z ==
history_compose x (history_compose y z))
= ()
#pop-options
let pcm_history #a #p : pcm (history a p) = {
p = {
composable = history_composable;
op = history_compose;
one = unit_history
};
comm = (fun _ _ -> ());
assoc = assoc_l;
assoc_r = assoc_r;
is_unit = lem_is_unit;
refine = (fun _ -> True);
}
let pcm_history_preorder #a #p : preorder (history a p) =
fun h0 h1 ->
match h0, h1 with
| Witnessed vh0, Witnessed vh1
| Current vh0 _, Witnessed vh1
| Witnessed vh0, Current vh1 _
| Current vh0 _, Current vh1 _ ->
vh1 `extends` vh0
#push-options "--z3rlimit_factor 8 --ifuel 1 --fuel 0 --warn_error -271"
let pcm_history_induces_preorder #a #p
: Lemma (induces_preorder (pcm_history #a #p)
(pcm_history_preorder #a #p))
= let aux (x y:history a p)
(f:frame_preserving_upd (pcm_history #a #p) x y)
(v:history a p)
: Lemma
(requires compatible (pcm_history #a #p) x v)
(ensures (pcm_history_preorder #a #p) v (f v))
[SMTPat ()]
= let pcm = pcm_history #a #p in
let v1 = f v in
match x, v, v1 with
| Witnessed _, Witnessed _, Witnessed _ ->
assert (composable pcm x v)
| Current _ _, Witnessed _, Witnessed _ -> ()
| Witnessed _, Current _ _, Witnessed _ -> ()
| Witnessed _, Witnessed _, Current _ _ ->
assert (composable pcm x v)
| Current _ _, Witnessed _, Current _ _ -> ()
| Witnessed _, Current _ _, Current _ _ -> ()
| Current hx _, Current hv _, Witnessed _
| Current hx _, Current hv _, Current _ _ ->
let frame = FStar.IndefiniteDescription.indefinite_description_ghost
(history a p) (fun frame -> composable pcm x frame /\ op pcm frame x == v) in
match frame with
| Current hf _ -> ()
| Witnessed hf ->
assert (extends hx hf);
assert (hx == hv);
assert (composable pcm x (Witnessed hv))
in
()
#pop-options
let extend_history' #a #p (h0:history a p{Current? h0})
(v:a{p (hval h0) v})
: history a p
= let Current h f = h0 in
Current (v :: h) f
let extend_history'_is_frame_preserving #a #p
(h0:history a p{Current? h0 /\ hperm h0 == full_perm})
(v:a{p (hval h0) v})
: Lemma (frame_preserving pcm_history h0 (extend_history' h0 v))
= ()
let history_val #a #p (h:history a p) (v:Ghost.erased a) (f:perm)
: prop
= Current? h /\ hval h == v /\ hperm h == f /\ f.v <=. one | {
"checked_file": "/",
"dependencies": [
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.Preorder.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | h: Steel.Preorder.history a p {Current? h /\ MkPerm?.v (Current?.f h) <=. FStar.Real.one}
-> half:
Steel.Preorder.history a p
{ Current? h /\ FStar.PCM.composable Steel.Preorder.pcm_history half half /\
FStar.PCM.op Steel.Preorder.pcm_history half half == h /\ Current?.h half == Current?.h h /\
Steel.Preorder.history_val half (Steel.Preorder.hval h) (Current?.f half) } | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.preorder",
"Steel.Preorder.history",
"Prims.l_and",
"Prims.b2t",
"Steel.Preorder.uu___is_Current",
"FStar.Real.op_Less_Equals_Dot",
"Steel.FractionalPermission.__proj__MkPerm__item__v",
"Steel.Preorder.__proj__Current__item__f",
"FStar.Real.one",
"Steel.Preorder.vhist",
"Steel.FractionalPermission.perm",
"Steel.Preorder.Current",
"Steel.FractionalPermission.half_perm",
"Prims.unit",
"FStar.Pervasives.assert_spinoff",
"Prims.eq2",
"Steel.FractionalPermission.sum_perm",
"FStar.PCM.composable",
"Steel.Preorder.pcm_history",
"FStar.PCM.op",
"Steel.Preorder.__proj__Current__item__h",
"Steel.Preorder.history_val",
"Steel.Preorder.hval"
] | [] | false | false | false | false | false | let split_current #a #p (h: history a p {Current? h /\ (Current?.f h).v <=. one})
: half:
history a p
{ Current? h /\ composable pcm_history half half /\ op pcm_history half half == h /\
Current?.h half == Current?.h h /\ history_val half (hval h) (Current?.f half) } =
| let Current v p = h in
assert_spinoff (sum_perm (half_perm p) (half_perm p) == p);
Current v (half_perm p) | false |
Spec.ECDSA.Test.Vectors.fst | Spec.ECDSA.Test.Vectors.siggen_vectors_sha2_256 | val siggen_vectors_sha2_256:list vec_SigGen | val siggen_vectors_sha2_256:list vec_SigGen | let siggen_vectors_sha2_256 : list vec_SigGen = [
{ msg' = "5905238877c77421f73e43ee3da6f2d9e2ccad5fc942dcec0cbd25482935faaf416983fe165b1a045ee2bcd2e6dca3bdf46c4310a7461f9a37960ca672d3feb5473e253605fb1ddfd28065b53cb5858a8ad28175bf9bd386a5e471ea7a65c17cc934a9d791e91491eb3754d03799790fe2d308d16146d5c9b0d0debd97d79ce8";
d = "519b423d715f8b581f4fa8ee59f4771a5b44c8130b4e3eacca54a56dda72b464";
qx' = "1ccbe91c075fc7f4f033bfa248db8fccd3565de94bbfb12f3c59ff46c271bf83";
qy' = "ce4014c68811f9a21a1fdb2c0e6113e06db7ca93b7404e78dc7ccd5ca89a4ca9";
k = "94a1bbb14b906a61a280f245f9e93c7f3b4a6247824f5d33b9670787642a68de";
r' = "f3ac8061b514795b8843e3d6629527ed2afd6b1f6a555a7acabb5e6f79c8c2ac";
s' = "8bf77819ca05a6b2786c76262bf7371cef97b218e96f175a3ccdda2acc058903";
};
{ msg' = "c35e2f092553c55772926bdbe87c9796827d17024dbb9233a545366e2e5987dd344deb72df987144b8c6c43bc41b654b94cc856e16b96d7a821c8ec039b503e3d86728c494a967d83011a0e090b5d54cd47f4e366c0912bc808fbb2ea96efac88fb3ebec9342738e225f7c7c2b011ce375b56621a20642b4d36e060db4524af1";
d = "0f56db78ca460b055c500064824bed999a25aaf48ebb519ac201537b85479813";
qx' = "e266ddfdc12668db30d4ca3e8f7749432c416044f2d2b8c10bf3d4012aeffa8a";
qy' = "bfa86404a2e9ffe67d47c587ef7a97a7f456b863b4d02cfc6928973ab5b1cb39";
k = "6d3e71882c3b83b156bb14e0ab184aa9fb728068d3ae9fac421187ae0b2f34c6";
r' = "976d3a4e9d23326dc0baa9fa560b7c4e53f42864f508483a6473b6a11079b2db";
s' = "1b766e9ceb71ba6c01dcd46e0af462cd4cfa652ae5017d4555b8eeefe36e1932";
};
{ msg' = "3c054e333a94259c36af09ab5b4ff9beb3492f8d5b4282d16801daccb29f70fe61a0b37ffef5c04cd1b70e85b1f549a1c4dc672985e50f43ea037efa9964f096b5f62f7ffdf8d6bfb2cc859558f5a393cb949dbd48f269343b5263dcdb9c556eca074f2e98e6d94c2c29a677afaf806edf79b15a3fcd46e7067b7669f83188ee";
d = "e283871239837e13b95f789e6e1af63bf61c918c992e62bca040d64cad1fc2ef";
qx' = "74ccd8a62fba0e667c50929a53f78c21b8ff0c3c737b0b40b1750b2302b0bde8";
qy' = "29074e21f3a0ef88b9efdf10d06aa4c295cc1671f758ca0e4cd108803d0f2614";
k = "ad5e887eb2b380b8d8280ad6e5ff8a60f4d26243e0124c2f31a297b5d0835de2";
r' = "35fb60f5ca0f3ca08542fb3cc641c8263a2cab7a90ee6a5e1583fac2bb6f6bd1";
s' = "ee59d81bc9db1055cc0ed97b159d8784af04e98511d0a9a407b99bb292572e96";
};
{ msg' = "0989122410d522af64ceb07da2c865219046b4c3d9d99b01278c07ff63eaf1039cb787ae9e2dd46436cc0415f280c562bebb83a23e639e476a02ec8cff7ea06cd12c86dcc3adefbf1a9e9a9b6646c7599ec631b0da9a60debeb9b3e19324977f3b4f36892c8a38671c8e1cc8e50fcd50f9e51deaf98272f9266fc702e4e57c30";
d = "a3d2d3b7596f6592ce98b4bfe10d41837f10027a90d7bb75349490018cf72d07";
qx' = "322f80371bf6e044bc49391d97c1714ab87f990b949bc178cb7c43b7c22d89e1";
qy' = "3c15d54a5cc6b9f09de8457e873eb3deb1fceb54b0b295da6050294fae7fd999";
k = "24fc90e1da13f17ef9fe84cc96b9471ed1aaac17e3a4bae33a115df4e5834f18";
r' = "d7c562370af617b581c84a2468cc8bd50bb1cbf322de41b7887ce07c0e5884ca";
s' = "b46d9f2d8c4bf83546ff178f1d78937c008d64e8ecc5cbb825cb21d94d670d89";
};
{ msg' = "dc66e39f9bbfd9865318531ffe9207f934fa615a5b285708a5e9c46b7775150e818d7f24d2a123df3672fff2094e3fd3df6fbe259e3989dd5edfcccbe7d45e26a775a5c4329a084f057c42c13f3248e3fd6f0c76678f890f513c32292dd306eaa84a59abe34b16cb5e38d0e885525d10336ca443e1682aa04a7af832b0eee4e7";
d = "53a0e8a8fe93db01e7ae94e1a9882a102ebd079b3a535827d583626c272d280d";
qx' = "1bcec4570e1ec2436596b8ded58f60c3b1ebc6a403bc5543040ba82963057244";
qy' = "8af62a4c683f096b28558320737bf83b9959a46ad2521004ef74cf85e67494e1";
k = "5d833e8d24cc7a402d7ee7ec852a3587cddeb48358cea71b0bedb8fabe84e0c4";
r' = "18caaf7b663507a8bcd992b836dec9dc5703c080af5e51dfa3a9a7c387182604";
s' = "77c68928ac3b88d985fb43fb615fb7ff45c18ba5c81af796c613dfa98352d29c";
};
{ msg' = "600974e7d8c5508e2c1aab0783ad0d7c4494ab2b4da265c2fe496421c4df238b0be25f25659157c8a225fb03953607f7df996acfd402f147e37aee2f1693e3bf1c35eab3ae360a2bd91d04622ea47f83d863d2dfecb618e8b8bdc39e17d15d672eee03bb4ce2cc5cf6b217e5faf3f336fdd87d972d3a8b8a593ba85955cc9d71";
d = "4af107e8e2194c830ffb712a65511bc9186a133007855b49ab4b3833aefc4a1d";
qx' = "a32e50be3dae2c8ba3f5e4bdae14cf7645420d425ead94036c22dd6c4fc59e00";
qy' = "d623bf641160c289d6742c6257ae6ba574446dd1d0e74db3aaa80900b78d4ae9";
k = "e18f96f84dfa2fd3cdfaec9159d4c338cd54ad314134f0b31e20591fc238d0ab";
r' = "8524c5024e2d9a73bde8c72d9129f57873bbad0ed05215a372a84fdbc78f2e68";
s' = "d18c2caf3b1072f87064ec5e8953f51301cada03469c640244760328eb5a05cb";
};
{ msg' = "dfa6cb9b39adda6c74cc8b2a8b53a12c499ab9dee01b4123642b4f11af336a91a5c9ce0520eb2395a6190ecbf6169c4cba81941de8e76c9c908eb843b98ce95e0da29c5d4388040264e05e07030a577cc5d176387154eabae2af52a83e85c61c7c61da930c9b19e45d7e34c8516dc3c238fddd6e450a77455d534c48a152010b";
d = "78dfaa09f1076850b3e206e477494cddcfb822aaa0128475053592c48ebaf4ab";
qx' = "8bcfe2a721ca6d753968f564ec4315be4857e28bef1908f61a366b1f03c97479";
qy' = "0f67576a30b8e20d4232d8530b52fb4c89cbc589ede291e499ddd15fe870ab96";
k = "295544dbb2da3da170741c9b2c6551d40af7ed4e891445f11a02b66a5c258a77";
r' = "c5a186d72df452015480f7f338970bfe825087f05c0088d95305f87aacc9b254";
s' = "84a58f9e9d9e735344b316b1aa1ab5185665b85147dc82d92e969d7bee31ca30";
};
{ msg' = "51d2547cbff92431174aa7fc7302139519d98071c755ff1c92e4694b58587ea560f72f32fc6dd4dee7d22bb7387381d0256e2862d0644cdf2c277c5d740fa089830eb52bf79d1e75b8596ecf0ea58a0b9df61e0c9754bfcd62efab6ea1bd216bf181c5593da79f10135a9bc6e164f1854bc8859734341aad237ba29a81a3fc8b";
d = "80e692e3eb9fcd8c7d44e7de9f7a5952686407f90025a1d87e52c7096a62618a";
qx' = "a88bc8430279c8c0400a77d751f26c0abc93e5de4ad9a4166357952fe041e767";
qy' = "2d365a1eef25ead579cc9a069b6abc1b16b81c35f18785ce26a10ba6d1381185";
k = "7c80fd66d62cc076cef2d030c17c0a69c99611549cb32c4ff662475adbe84b22";
r' = "9d0c6afb6df3bced455b459cc21387e14929392664bb8741a3693a1795ca6902";
s' = "d7f9ddd191f1f412869429209ee3814c75c72fa46a9cccf804a2f5cc0b7e739f";
};
{ msg' = "558c2ac13026402bad4a0a83ebc9468e50f7ffab06d6f981e5db1d082098065bcff6f21a7a74558b1e8612914b8b5a0aa28ed5b574c36ac4ea5868432a62bb8ef0695d27c1e3ceaf75c7b251c65ddb268696f07c16d2767973d85beb443f211e6445e7fe5d46f0dce70d58a4cd9fe70688c035688ea8c6baec65a5fc7e2c93e8";
d = "5e666c0db0214c3b627a8e48541cc84a8b6fd15f300da4dff5d18aec6c55b881";
qx' = "1bc487570f040dc94196c9befe8ab2b6de77208b1f38bdaae28f9645c4d2bc3a";
qy' = "ec81602abd8345e71867c8210313737865b8aa186851e1b48eaca140320f5d8f";
k = "2e7625a48874d86c9e467f890aaa7cd6ebdf71c0102bfdcfa24565d6af3fdce9";
r' = "2f9e2b4e9f747c657f705bffd124ee178bbc5391c86d056717b140c153570fd9";
s' = "f5413bfd85949da8d83de83ab0d19b2986613e224d1901d76919de23ccd03199";
};
{ msg' = "4d55c99ef6bd54621662c3d110c3cb627c03d6311393b264ab97b90a4b15214a5593ba2510a53d63fb34be251facb697c973e11b665cb7920f1684b0031b4dd370cb927ca7168b0bf8ad285e05e9e31e34bc24024739fdc10b78586f29eff94412034e3b606ed850ec2c1900e8e68151fc4aee5adebb066eb6da4eaa5681378e";
d = "f73f455271c877c4d5334627e37c278f68d143014b0a05aa62f308b2101c5308";
qx' = "b8188bd68701fc396dab53125d4d28ea33a91daf6d21485f4770f6ea8c565dde";
qy' = "423f058810f277f8fe076f6db56e9285a1bf2c2a1dae145095edd9c04970bc4a";
k = "62f8665fd6e26b3fa069e85281777a9b1f0dfd2c0b9f54a086d0c109ff9fd615";
r' = "1cc628533d0004b2b20e7f4baad0b8bb5e0673db159bbccf92491aef61fc9620";
s' = "880e0bbf82a8cf818ed46ba03cf0fc6c898e36fca36cc7fdb1d2db7503634430";
};
{ msg' = "f8248ad47d97c18c984f1f5c10950dc1404713c56b6ea397e01e6dd925e903b4fadfe2c9e877169e71ce3c7fe5ce70ee4255d9cdc26f6943bf48687874de64f6cf30a012512e787b88059bbf561162bdcc23a3742c835ac144cc14167b1bd6727e940540a9c99f3cbb41fb1dcb00d76dda04995847c657f4c19d303eb09eb48a";
d = "b20d705d9bd7c2b8dc60393a5357f632990e599a0975573ac67fd89b49187906";
qx' = "51f99d2d52d4a6e734484a018b7ca2f895c2929b6754a3a03224d07ae61166ce";
qy' = "4737da963c6ef7247fb88d19f9b0c667cac7fe12837fdab88c66f10d3c14cad1";
k = "72b656f6b35b9ccbc712c9f1f3b1a14cbbebaec41c4bca8da18f492a062d6f6f";
r' = "9886ae46c1415c3bc959e82b760ad760aab66885a84e620aa339fdf102465c42";
s' = "2bf3a80bc04faa35ebecc0f4864ac02d349f6f126e0f988501b8d3075409a26c";
};
{ msg' = "3b6ee2425940b3d240d35b97b6dcd61ed3423d8e71a0ada35d47b322d17b35ea0472f35edd1d252f87b8b65ef4b716669fc9ac28b00d34a9d66ad118c9d94e7f46d0b4f6c2b2d339fd6bcd351241a387cc82609057048c12c4ec3d85c661975c45b300cb96930d89370a327c98b67defaa89497aa8ef994c77f1130f752f94a4";
d = "d4234bebfbc821050341a37e1240efe5e33763cbbb2ef76a1c79e24724e5a5e7";
qx' = "8fb287f0202ad57ae841aea35f29b2e1d53e196d0ddd9aec24813d64c0922fb7";
qy' = "1f6daff1aa2dd2d6d3741623eecb5e7b612997a1039aab2e5cf2de969cfea573";
k = "d926fe10f1bfd9855610f4f5a3d666b1a149344057e35537373372ead8b1a778";
r' = "490efd106be11fc365c7467eb89b8d39e15d65175356775deab211163c2504cb";
s' = "644300fc0da4d40fb8c6ead510d14f0bd4e1321a469e9c0a581464c7186b7aa7";
};
{ msg' = "c5204b81ec0a4df5b7e9fda3dc245f98082ae7f4efe81998dcaa286bd4507ca840a53d21b01e904f55e38f78c3757d5a5a4a44b1d5d4e480be3afb5b394a5d2840af42b1b4083d40afbfe22d702f370d32dbfd392e128ea4724d66a3701da41ae2f03bb4d91bb946c7969404cb544f71eb7a49eb4c4ec55799bda1eb545143a7";
d = "b58f5211dff440626bb56d0ad483193d606cf21f36d9830543327292f4d25d8c";
qx' = "68229b48c2fe19d3db034e4c15077eb7471a66031f28a980821873915298ba76";
qy' = "303e8ee3742a893f78b810991da697083dd8f11128c47651c27a56740a80c24c";
k = "e158bf4a2d19a99149d9cdb879294ccb7aaeae03d75ddd616ef8ae51a6dc1071";
r' = "e67a9717ccf96841489d6541f4f6adb12d17b59a6bef847b6183b8fcf16a32eb";
s' = "9ae6ba6d637706849a6a9fc388cf0232d85c26ea0d1fe7437adb48de58364333";
};
{ msg' = "72e81fe221fb402148d8b7ab03549f1180bcc03d41ca59d7653801f0ba853add1f6d29edd7f9abc621b2d548f8dbf8979bd16608d2d8fc3260b4ebc0dd42482481d548c7075711b5759649c41f439fad69954956c9326841ea6492956829f9e0dc789f73633b40f6ac77bcae6dfc7930cfe89e526d1684365c5b0be2437fdb01";
d = "54c066711cdb061eda07e5275f7e95a9962c6764b84f6f1f3ab5a588e0a2afb1";
qx' = "0a7dbb8bf50cb605eb2268b081f26d6b08e012f952c4b70a5a1e6e7d46af98bb";
qy' = "f26dd7d799930062480849962ccf5004edcfd307c044f4e8f667c9baa834eeae";
k = "646fe933e96c3b8f9f507498e907fdd201f08478d0202c752a7c2cfebf4d061a";
r' = "b53ce4da1aa7c0dc77a1896ab716b921499aed78df725b1504aba1597ba0c64b";
s' = "d7c246dc7ad0e67700c373edcfdd1c0a0495fc954549ad579df6ed1438840851";
};
{ msg' = "21188c3edd5de088dacc1076b9e1bcecd79de1003c2414c3866173054dc82dde85169baa77993adb20c269f60a5226111828578bcc7c29e6e8d2dae81806152c8ba0c6ada1986a1983ebeec1473a73a04795b6319d48662d40881c1723a706f516fe75300f92408aa1dc6ae4288d2046f23c1aa2e54b7fb6448a0da922bd7f34";
d = "34fa4682bf6cb5b16783adcd18f0e6879b92185f76d7c920409f904f522db4b1";
qx' = "105d22d9c626520faca13e7ced382dcbe93498315f00cc0ac39c4821d0d73737";
qy' = "6c47f3cbbfa97dfcebe16270b8c7d5d3a5900b888c42520d751e8faf3b401ef4";
k = "a6f463ee72c9492bc792fe98163112837aebd07bab7a84aaed05be64db3086f4";
r' = "542c40a18140a6266d6f0286e24e9a7bad7650e72ef0e2131e629c076d962663";
s' = "4f7f65305e24a6bbb5cff714ba8f5a2cee5bdc89ba8d75dcbf21966ce38eb66f";
};
] | {
"file_name": "specs/tests/p256/Spec.ECDSA.Test.Vectors.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 1,
"end_line": 480,
"start_col": 1,
"start_line": 359
} | module Spec.ECDSA.Test.Vectors
open Lib.Meta
#set-options "--fuel 0 --ifuel 0"
///
/// ECDSA test vectors from NIST CAVP
/// https://csrc.nist.gov/Projects/Cryptographic-Algorithm-Validation-Program/Digital-Signatures#ecdsa2vs
///
type vec_SigVer = {
msg: hex_string;
qx: hex_string;
qy: hex_string;
r: hex_string;
s: hex_string;
result: bool;
}
type vec_SigGen = {
msg': hex_string;
d: hex_string;
qx': hex_string;
qy': hex_string;
k: hex_string;
r': hex_string;
s': hex_string;
}
let sigver_vectors_sha2_256 : list vec_SigVer = [
{ msg = "e4796db5f785f207aa30d311693b3702821dff1168fd2e04c0836825aefd850d9aa60326d88cde1a23c7745351392ca2288d632c264f197d05cd424a30336c19fd09bb229654f0222fcb881a4b35c290a093ac159ce13409111ff0358411133c24f5b8e2090d6db6558afc36f06ca1f6ef779785adba68db27a409859fc4c4a0";
qx = "87f8f2b218f49845f6f10eec3877136269f5c1a54736dbdf69f89940cad41555";
qy = "e15f369036f49842fac7a86c8a2b0557609776814448b8f5e84aa9f4395205e9";
r = "d19ff48b324915576416097d2544f7cbdf8768b1454ad20e0baac50e211f23b0";
s = "a3e81e59311cdfff2d4784949f7a2cb50ba6c3a91fa54710568e61aca3e847c6";
result = false;
};
{ msg = "069a6e6b93dfee6df6ef6997cd80dd2182c36653cef10c655d524585655462d683877f95ecc6d6c81623d8fac4e900ed0019964094e7de91f1481989ae1873004565789cbf5dc56c62aedc63f62f3b894c9c6f7788c8ecaadc9bd0e81ad91b2b3569ea12260e93924fdddd3972af5273198f5efda0746219475017557616170e";
qx = "5cf02a00d205bdfee2016f7421807fc38ae69e6b7ccd064ee689fc1a94a9f7d2";
qy = "ec530ce3cc5c9d1af463f264d685afe2b4db4b5828d7e61b748930f3ce622a85";
r = "dc23d130c6117fb5751201455e99f36f59aba1a6a21cf2d0e7481a97451d6693";
s = "d6ce7708c18dbf35d4f8aa7240922dc6823f2e7058cbc1484fcad1599db5018c";
result = false;
};
{ msg = "df04a346cf4d0e331a6db78cca2d456d31b0a000aa51441defdb97bbeb20b94d8d746429a393ba88840d661615e07def615a342abedfa4ce912e562af714959896858af817317a840dcff85a057bb91a3c2bf90105500362754a6dd321cdd86128cfc5f04667b57aa78c112411e42da304f1012d48cd6a7052d7de44ebcc01de";
qx = "2ddfd145767883ffbb0ac003ab4a44346d08fa2570b3120dcce94562422244cb";
qy = "5f70c7d11ac2b7a435ccfbbae02c3df1ea6b532cc0e9db74f93fffca7c6f9a64";
r = "9913111cff6f20c5bf453a99cd2c2019a4e749a49724a08774d14e4c113edda8";
s = "9467cd4cd21ecb56b0cab0a9a453b43386845459127a952421f5c6382866c5cc";
result = false;
};
{ msg = "e1130af6a38ccb412a9c8d13e15dbfc9e69a16385af3c3f1e5da954fd5e7c45fd75e2b8c36699228e92840c0562fbf3772f07e17f1add56588dd45f7450e1217ad239922dd9c32695dc71ff2424ca0dec1321aa47064a044b7fe3c2b97d03ce470a592304c5ef21eed9f93da56bb232d1eeb0035f9bf0dfafdcc4606272b20a3";
qx = "e424dc61d4bb3cb7ef4344a7f8957a0c5134e16f7a67c074f82e6e12f49abf3c";
qy = "970eed7aa2bc48651545949de1dddaf0127e5965ac85d1243d6f60e7dfaee927";
r = "bf96b99aa49c705c910be33142017c642ff540c76349b9dab72f981fd9347f4f";
s = "17c55095819089c2e03b9cd415abdf12444e323075d98f31920b9e0f57ec871c";
result = true;
};
{ msg = "73c5f6a67456ae48209b5f85d1e7de7758bf235300c6ae2bdceb1dcb27a7730fb68c950b7fcada0ecc4661d3578230f225a875e69aaa17f1e71c6be5c831f22663bac63d0c7a9635edb0043ff8c6f26470f02a7bc56556f1437f06dfa27b487a6c4290d8bad38d4879b334e341ba092dde4e4ae694a9c09302e2dbf443581c08";
qx = "e0fc6a6f50e1c57475673ee54e3a57f9a49f3328e743bf52f335e3eeaa3d2864";
qy = "7f59d689c91e463607d9194d99faf316e25432870816dde63f5d4b373f12f22a";
r = "1d75830cd36f4c9aa181b2c4221e87f176b7f05b7c87824e82e396c88315c407";
s = "cb2acb01dac96efc53a32d4a0d85d0c2e48955214783ecf50a4f0414a319c05a";
result = true;
};
{ msg = "666036d9b4a2426ed6585a4e0fd931a8761451d29ab04bd7dc6d0c5b9e38e6c2b263ff6cb837bd04399de3d757c6c7005f6d7a987063cf6d7e8cb38a4bf0d74a282572bd01d0f41e3fd066e3021575f0fa04f27b700d5b7ddddf50965993c3f9c7118ed78888da7cb221849b3260592b8e632d7c51e935a0ceae15207bedd548";
qx = "a849bef575cac3c6920fbce675c3b787136209f855de19ffe2e8d29b31a5ad86";
qy = "bf5fe4f7858f9b805bd8dcc05ad5e7fb889de2f822f3d8b41694e6c55c16b471";
r = "25acc3aa9d9e84c7abf08f73fa4195acc506491d6fc37cb9074528a7db87b9d6";
s = "9b21d5b5259ed3f2ef07dfec6cc90d3a37855d1ce122a85ba6a333f307d31537";
result = false;
};
{ msg = "7e80436bce57339ce8da1b5660149a20240b146d108deef3ec5da4ae256f8f894edcbbc57b34ce37089c0daa17f0c46cd82b5a1599314fd79d2fd2f446bd5a25b8e32fcf05b76d644573a6df4ad1dfea707b479d97237a346f1ec632ea5660efb57e8717a8628d7f82af50a4e84b11f21bdff6839196a880ae20b2a0918d58cd";
qx = "3dfb6f40f2471b29b77fdccba72d37c21bba019efa40c1c8f91ec405d7dcc5df";
qy = "f22f953f1e395a52ead7f3ae3fc47451b438117b1e04d613bc8555b7d6e6d1bb";
r = "548886278e5ec26bed811dbb72db1e154b6f17be70deb1b210107decb1ec2a5a";
s = "e93bfebd2f14f3d827ca32b464be6e69187f5edbd52def4f96599c37d58eee75";
result = false;
};
{ msg = "1669bfb657fdc62c3ddd63269787fc1c969f1850fb04c933dda063ef74a56ce13e3a649700820f0061efabf849a85d474326c8a541d99830eea8131eaea584f22d88c353965dabcdc4bf6b55949fd529507dfb803ab6b480cd73ca0ba00ca19c438849e2cea262a1c57d8f81cd257fb58e19dec7904da97d8386e87b84948169";
qx = "69b7667056e1e11d6caf6e45643f8b21e7a4bebda463c7fdbc13bc98efbd0214";
qy = "d3f9b12eb46c7c6fda0da3fc85bc1fd831557f9abc902a3be3cb3e8be7d1aa2f";
r = "288f7a1cd391842cce21f00e6f15471c04dc182fe4b14d92dc18910879799790";
s = "247b3c4e89a3bcadfea73c7bfd361def43715fa382b8c3edf4ae15d6e55e9979";
result = false;
};
{ msg = "3fe60dd9ad6caccf5a6f583b3ae65953563446c4510b70da115ffaa0ba04c076115c7043ab8733403cd69c7d14c212c655c07b43a7c71b9a4cffe22c2684788ec6870dc2013f269172c822256f9e7cc674791bf2d8486c0f5684283e1649576efc982ede17c7b74b214754d70402fb4bb45ad086cf2cf76b3d63f7fce39ac970";
qx = "bf02cbcf6d8cc26e91766d8af0b164fc5968535e84c158eb3bc4e2d79c3cc682";
qy = "069ba6cb06b49d60812066afa16ecf7b51352f2c03bd93ec220822b1f3dfba03";
r = "f5acb06c59c2b4927fb852faa07faf4b1852bbb5d06840935e849c4d293d1bad";
s = "049dab79c89cc02f1484c437f523e080a75f134917fda752f2d5ca397addfe5d";
result = false;
};
{ msg = "983a71b9994d95e876d84d28946a041f8f0a3f544cfcc055496580f1dfd4e312a2ad418fe69dbc61db230cc0c0ed97e360abab7d6ff4b81ee970a7e97466acfd9644f828ffec538abc383d0e92326d1c88c55e1f46a668a039beaa1be631a89129938c00a81a3ae46d4aecbf9707f764dbaccea3ef7665e4c4307fa0b0a3075c";
qx = "224a4d65b958f6d6afb2904863efd2a734b31798884801fcab5a590f4d6da9de";
qy = "178d51fddada62806f097aa615d33b8f2404e6b1479f5fd4859d595734d6d2b9";
r = "87b93ee2fecfda54deb8dff8e426f3c72c8864991f8ec2b3205bb3b416de93d2";
s = "4044a24df85be0cc76f21a4430b75b8e77b932a87f51e4eccbc45c263ebf8f66";
result = false;
};
{ msg = "4a8c071ac4fd0d52faa407b0fe5dab759f7394a5832127f2a3498f34aac287339e043b4ffa79528faf199dc917f7b066ad65505dab0e11e6948515052ce20cfdb892ffb8aa9bf3f1aa5be30a5bbe85823bddf70b39fd7ebd4a93a2f75472c1d4f606247a9821f1a8c45a6cb80545de2e0c6c0174e2392088c754e9c8443eb5af";
qx = "43691c7795a57ead8c5c68536fe934538d46f12889680a9cb6d055a066228369";
qy = "f8790110b3c3b281aa1eae037d4f1234aff587d903d93ba3af225c27ddc9ccac";
r = "8acd62e8c262fa50dd9840480969f4ef70f218ebf8ef9584f199031132c6b1ce";
s = "cfca7ed3d4347fb2a29e526b43c348ae1ce6c60d44f3191b6d8ea3a2d9c92154";
result = false;
};
{ msg = "0a3a12c3084c865daf1d302c78215d39bfe0b8bf28272b3c0b74beb4b7409db0718239de700785581514321c6440a4bbaea4c76fa47401e151e68cb6c29017f0bce4631290af5ea5e2bf3ed742ae110b04ade83a5dbd7358f29a85938e23d87ac8233072b79c94670ff0959f9c7f4517862ff829452096c78f5f2e9a7e4e9216";
qx = "9157dbfcf8cf385f5bb1568ad5c6e2a8652ba6dfc63bc1753edf5268cb7eb596";
qy = "972570f4313d47fc96f7c02d5594d77d46f91e949808825b3d31f029e8296405";
r = "dfaea6f297fa320b707866125c2a7d5d515b51a503bee817de9faa343cc48eeb";
s = "8f780ad713f9c3e5a4f7fa4c519833dfefc6a7432389b1e4af463961f09764f2";
result = false;
};
{ msg = "785d07a3c54f63dca11f5d1a5f496ee2c2f9288e55007e666c78b007d95cc28581dce51f490b30fa73dc9e2d45d075d7e3a95fb8a9e1465ad191904124160b7c60fa720ef4ef1c5d2998f40570ae2a870ef3e894c2bc617d8a1dc85c3c55774928c38789b4e661349d3f84d2441a3b856a76949b9f1f80bc161648a1cad5588e";
qx = "072b10c081a4c1713a294f248aef850e297991aca47fa96a7470abe3b8acfdda";
qy = "9581145cca04a0fb94cedce752c8f0370861916d2a94e7c647c5373ce6a4c8f5";
r = "09f5483eccec80f9d104815a1be9cc1a8e5b12b6eb482a65c6907b7480cf4f19";
s = "a4f90e560c5e4eb8696cb276e5165b6a9d486345dedfb094a76e8442d026378d";
result = false;
};
{ msg = "76f987ec5448dd72219bd30bf6b66b0775c80b394851a43ff1f537f140a6e7229ef8cd72ad58b1d2d20298539d6347dd5598812bc65323aceaf05228f738b5ad3e8d9fe4100fd767c2f098c77cb99c2992843ba3eed91d32444f3b6db6cd212dd4e5609548f4bb62812a920f6e2bf1581be1ebeebdd06ec4e971862cc42055ca";
qx = "09308ea5bfad6e5adf408634b3d5ce9240d35442f7fe116452aaec0d25be8c24";
qy = "f40c93e023ef494b1c3079b2d10ef67f3170740495ce2cc57f8ee4b0618b8ee5";
r = "5cc8aa7c35743ec0c23dde88dabd5e4fcd0192d2116f6926fef788cddb754e73";
s = "9c9c045ebaa1b828c32f82ace0d18daebf5e156eb7cbfdc1eff4399a8a900ae7";
result = false;
};
{ msg = "60cd64b2cd2be6c33859b94875120361a24085f3765cb8b2bf11e026fa9d8855dbe435acf7882e84f3c7857f96e2baab4d9afe4588e4a82e17a78827bfdb5ddbd1c211fbc2e6d884cddd7cb9d90d5bf4a7311b83f352508033812c776a0e00c003c7e0d628e50736c7512df0acfa9f2320bd102229f46495ae6d0857cc452a84";
qx = "2d98ea01f754d34bbc3003df5050200abf445ec728556d7ed7d5c54c55552b6d";
qy = "9b52672742d637a32add056dfd6d8792f2a33c2e69dafabea09b960bc61e230a";
r = "06108e525f845d0155bf60193222b3219c98e3d49424c2fb2a0987f825c17959";
s = "62b5cdd591e5b507e560167ba8f6f7cda74673eb315680cb89ccbc4eec477dce";
result = true;
};
]
let sigver_vectors_sha2_384 : list vec_SigVer = [
{ msg = "fe9838f007bdc6afcd626974fcc6833f06b6fd970427b962d75c2aeadbef386bec8d018106197fe2547d2af02e7a7949965d5fbc4c5db909a95b9858426a33c080b0b25dae8b56c5cbc6c4eec3dbd81635c79457eaef4fab39e662a1d05b2481eda8c1074ae2d1704c8a3f769686a1f965ef3c87602efc288c7f9ff8cd5e22a4";
qx = "40ded13dbbe72c629c38f07f7f95cf75a50e2a524897604c84fafde5e4cafb9f";
qy = "a17202e92d7d6a37c438779349fd79567d75a40ef22b7d09ca21ccf4aec9a66c";
r = "be34730c31730b4e412e6c52c23edbd36583ace2102b39afa11d24b6848cb77f";
s = "03655202d5fd8c9e3ae971b6f080640c406112fd95e7015874e9b6ee77752b10";
result = false;
};
{ msg = "b69043b9b331da392b5dd689142dfc72324265da08f14abcedf03ad8263e6bdccbc75098a2700bbba1979de84c8f12891aa0d000f8a1abad7dde4981533f21da59cc80d9cf94517f3b61d1a7d9eecb2fcf052e1fc9e7188c031b86305e4a436a37948071f046e306befb8511dc03a53dc8769a90a86e9b4fdbf05dcdfa35ab73";
qx = "1f80e19ffeb51dd74f1c397ac3dfd3415ab16ebd0847ed119e6c3b15a1a884b8";
qy = "9b395787371dbfb55d1347d7bed1c261d2908121fb78de1d1bf2d00666a62aed";
r = "249ca2c3eb6e04ac57334c2f75dc5e658bbb485bf187100774f5099dd13ef707";
s = "97363a05202b602d13166346694e38135bbce025be94950e9233f4c8013bf5bf";
result = false;
};
{ msg = "d2fcaaede8b879c064b0aa46e68efc278a469b80a7f7e1939ec2ebc96c76206f23395967279c181fea157ebb79dfadc68e31345f07f13305c80de0d85e4330d3a45f957c5c2526b945838ce5a9c2844b6b2a665c0f70b748b1213a8cf20ba5dbdf8cab231f433da522104a5cd027d3e36bb373c4ed404d9af0cbec6f85ec2193";
qx = "ce4dcfa7384c83443ace0fb82c4ac1adfa100a9b2c7bf09f093f8b6d084e50c2";
qy = "d98ae7b91abee648d0bfde192703741ac21daad7262af418b50e406d825eb0d6";
r = "597e1e04d93a6b444ccc447a48651f17657ff43fb65fe94461d2bf816b01af40";
s = "359fe3817963548e676d6da34c2d0866aa42499237b682002889eaf8893814d2";
result = true;
};
{ msg = "06cd86481865181cef7acdc3202824970ec2d97662b519c4b588dc9e51617c068282b1a11a15bf7efc4858a2f37a3d74b05fb5790eb68338c8009b4da9b4270514d387a2e016a99ee109841e884a7909504ef31a5454e214663f830f23a5a76f91402fca5f5d61699fa874597bdbfb1ecff8f07ddbd07ef61e97d0d5262ef314";
qx = "1b677f535ac69d1acd4592c0d12fac13c9131e5a6f8ab4f9d0afdcb3a3f327e0";
qy = "5dca2c73ec89e58ef8267cba2bb5eb0f551f412f9dc087c1a6944f0ce475277a";
r = "df0b0cd76d2555d4c38b3d70bfdf964884d0beeb9f74385f0893e87d20c9642d";
s = "128299aabf1f5496112be1fe04365f5f8215b08a040abdfeca4626f4d15c005b";
result = false;
};
{ msg = "59ad297397f3503604a4a2d098a4f00a368ad95c6101b3d38f9d49d908776c5a6c8654b006adb7939ffb6c30afa325b54185d82c3cc0d836850dce54d3408b257c3a961d11fafe2b74ba8bddfc1102fa656d1028baf94c38340c26a11e992aab71ce3732271b767358671b25225926f3a4b9ec5f82c059f0c7d1446d5d9e4251";
qx = "7ffc2853f3e17887dda13b0eb43f183ce50a5ac0f8bba75fb1921172484f9b94";
qy = "4cc523d14192f80bd5b27d30b3b41e064da87bfbae15572dd382b9a176c123a2";
r = "3156176d52eb26f9391229de4251993a41b8172f78970bb70e32a245be4bb653";
s = "62827a29e12d2f29b00fb2d02dd5f2d5412e17a4455f4431a5c996881fdfc0ee";
result = false;
};
{ msg = "8215daca87e689a20392646a6511bb7b5a82d2d995ca9de89bd9d9c0b11464b7cb1e4e9a31e3e01ad8c2cd613d5a2cb44a2a8df6899fce4c282dea1e41af0df6c36be1f320036567f8d0d32aaa79c95fe53b16668f7e1a9e5d7d039ea260fd03711b7d1c177355fc52244d49ca5b238556a5541349014683cb7da326f443b752";
qx = "5569f76dc94243cde819fb6fc85144ec67e2b5d49539f62e24d406d1b68f0058";
qy = "1208c38dbe25870deab53c486f793a1e250c9d1b8e7c147ea68b71196c440730";
r = "706f2ba4025e7c06b66d6369a3f93b2fec46c51eceff42a158f7431919506cfb";
s = "b4e75ac34a96393237fc4337789e37168d79382705b248051c9c72bcbac5f516";
result = false;
};
{ msg = "a996b1fb800f692517a2eb80e837233193dd3e82484d3f49bd19ee0db8f7b440876b07e384c90aa8b9f7b6603ca0b5a4e06c1da0edb974a2fb9b6e7c720ddf3e5c0e314c2d189402903c08c0836776c361a284db887ebcc33e615de9720b01dadade585eef687b3346468bdafb490e56d657a9e7d44d92014069005a36c1cf63";
qx = "e4b470c65b2c04db060d7105ec6911589863d3c7f7ce48726ba3f369ea3467e8";
qy = "44c38d3ae098de05f5915a5868c17fee296a6e150beb1f000df5f3bec8fc4532";
r = "c9c347ee5717e4c759ddaf09e86f4e1db2c8658593177cfda4e6514b5e3ecb87";
s = "baae01e9e44a7b04d69c8eaaed77c9e3a36ce8962f95cc50a0db146b4e49eb40";
result = false;
};
{ msg = "1a6e49a377a08e992353d6acc557b687b1b69a41d83d43a75fadb97b8c928cfebadebaaf99ea7fb13148807f56ea17384a7912e578e62b1b009fefb2aafca5ac85539433619b286f10643a56f8dfa47ba4d01c02510deaec18029ea6b9682022b139dcb70814164c4c90ec717ad9d925485398531cdd5992a2524498b337f97d";
qx = "96050c5fa2ddd1b2e5451d89ee74a0b7b54347364ddc0231715a6ef1146fe8dc";
qy = "e0888a9e78aeea87f6e1e9002b2651169f36c4ee53013cfc8c9912b7fd504858";
r = "2353d6cd3c21b8ea7dbc1cd940519812dbe365a3b15cd6aebba9d11cf269867a";
s = "85f560273cd9e82e6801e4cb1c8cd29cdac34a020da211d77453756b604b8fa7";
result = true;
};
{ msg = "3e14f737c913931bc82764ebc440b12e3ce1ffe0f858c7b8f1cbd30fbbb1644fa59be1d2cca5f64a6d7dc5ed5c4420f39227516ae8eb3019ef86274d0e4d06cde7bf5e5c413243dfc421d9f141762109810e6b6a451eeb4bd8d4be1ff111426d7e44d0a916b4fe3db3594d8dd01ae90feecf8f1e230b574180cd0b8d43a3d33b";
qx = "0c07bb79f44012299fbfd5a0f31397aaf7d757f8a38437407c1b09271c6551a0";
qy = "84fe7846d5d403dc92c0091fbd39f3c5cbca3f94c10b5cae44e2e96562131b13";
r = "49e9425f82d0a8c503009cead24e12adc9d48a08594094ca4f6d13ad1e3c571d";
s = "1f1b70aaa30a8ff639aa0935944e9b88326a213ab8fce5194c1a9dec070eb433";
result = false;
};
{ msg = "4000106127a72746db77957cbc6bfd84ae3d1d63b8190087637e93689841331e2adc1930d6df4302935f4520bbee513505cdcfca99ebc6f83af7b23b0f2e7f7defba614022ceeae9c6886e8b13f7ea253a307ac301f3536720cbe3de82ba3e98310361b61801a8304ffc91ff774948e33176ddcddf1b76437b3f02c910578d46";
qx = "71db1de1a1f38f356c91feaff5cfe395d1a5b9d23cf6aa19f38ae0bcc90a486d";
qy = "ecdd6ffb174a50f1cc792985c2f9608c399c98b8a64a69d2b5b7cdd9241f67e2";
r = "b0443b33a6f249470d2f943675009d21b9ccbead1525ae57815df86bb20470bf";
s = "316dbee27d998e09128539c269e297ac8f34b9ef8249a0619168c3495c5c1198";
result = false;
};
{ msg = "b42e547d0e7ddd5e1069bb2d158a5b4d5d9c4310942a1bfd09490311a6e684bd3c29b0dcef86a9788b4b26fed7863f3d5e5439796b5b5ffe7aa2545d0f518ad020689ca21230f3a59e7f8cca465fe21df511e78d215fa805f5f0f88938e9d198515e6b9c819930755c6c6aea5114cd2904607243051c09dd7a147756cbc204a5";
qx = "8219b225aa15472262c648cac8de9aad4173d17a231ba24352a5a1c4eea70fad";
qy = "0fee2b08ad39fbf0db0016ef2896ca99adc07efc8c415f640f3720498be26037";
r = "134fb689101aaad3954de2819d9fbd12072fe2bc36f496bbf0d13fa72114ab96";
s = "e65c232bd915b59e087e7fd5ec90bf636cfa80526345c79a0adfd75003045d6f";
result = false;
};
{ msg = "aa563223a7d5201febdf13cab80a03dce6077c26e751bc98a941196a28848abc495e0324013c9a2094fb15dc65d100c3e8a136a52c1780b395f42588900b641b6d4361432e2173195a2f60189f3fcc85f4e9659cae52576f20d1852d43c2b400deea3144c8e870e1906d677425d8c85037c7a42a9d249b2da4b516e04476bd45";
qx = "c934195de33b60cf00461fc3c45dad068e9f5f7af5c7fa78591e95aeb04e2617";
qy = "b588dd5f9965fdaa523b475c2812c251bc6973e2df21d9beaace976abf5728cb";
r = "71f302440eb4ed2a939b69e33e905e6fdc545c743458d38f7e1a1d456e35f389";
s = "54eaa0eb9cd7503b19a9658f0a04955d9f0ab20ebc8a0877e33c89ee88ad068f";
result = false;
};
{ msg = "98e4babf890f52e5a04bd2a7d79bf0ae9a71967847347d87f29fb3997454c73c7979d15b5c4f4205ec3de7835d1885fb7abcf8dcde94baf08b1d691a0c74845317286540e8c9d378fefaa4762c302492f51023c0d7adbb1cc90b7b0335f11203664e71fea621bc2f59d2dbd0ee76d6597ec75510de59b6d25fa6750a71c59435";
qx = "9e1adcd48e2e3f0e4c213501808228e587c40558f52bb54ddbb6102d4048ea92";
qy = "34eff98704790938e7e0bdf87ae39807a6b77dfdc9ecdfe6dd0f241abae1aeb2";
r = "ce4f0d7480522c8dd1b02dd0eb382f22406642f038c1ede9411883d72b3e7ed0";
s = "8546e1ee3b77f9927cdaccbc2f1cf19d6b5576b0f738bb1b86a0c66b39ca56fb";
result = false;
};
{ msg = "bb6b03ad60d6ddbf0c4d17246206e61c886f916d252bb4608149da49cef9033484080e861f91bb2400baa0cd6c5d90c2f275e2fabc12d83847f7a1c3ff0eb40c8a3dd83d07d194ba3797d27238415a2f358d7292a1991af687bcb977486980f9138b3140321485638ac7bd22ecda00ffe5009b83b90397eff24ecf22c5495d67";
qx = "93edbecb0b019c2cc03060f54cb4904b920fdb34eb83badd752be9443036ae13";
qy = "b494e9295e080a9080fe7e73249b3a5904aa84e1c028121eecd3e2cf1a55f598";
r = "eec2986d47b71995892b0915d3d5becc4dcb2ab55206d772e0189541b2184ddf";
s = "8a6c1edeb6452627ad27c8319599c54ac44cdd831ea66f13f49d90affe6ad45b";
result = true;
};
{ msg = "33a5d489f671f396c776bc1acf193bc9a74306f4692dd8e05bcdfe28fdefbd5c09b831c204a1dec81d8e3541f324f7b474d692789013bb1eca066f82fbf3f1cf3ba64e9d8963e9ecc180b9251919e2e8a1ab05847a0d76ff67a47c00e170e38e5b319a56f59cc51038f90961ea27a9a7eb292a0a1aa2f4972568669246907a35";
qx = "3205bae876f9bd50b0713959e72457165e826cbbe3895d67320909daa48b0ebc";
qy = "d1592562273e5e0f57bbfb92cedd9af7f133255684ee050af9b6f02019bbcafa";
r = "0124f3f1c61ec458561a4eaa6c155bd29e59703d14556324924683db3a4cf43b";
s = "688a5c5fc0c7ba92210c50cce5b512a468a880e05acc21ca56571d89f45f603a";
result = false;
};
]
let sigver_vectors_sha2_512 : list vec_SigVer = [
{ msg = "273b063224ab48a1bf6c7efc93429d1f89de48fc4a4fa3ffe7a49ebba1a58ff5d208a9e4bff27b418252526243ba042d1605b6df3c2ec916ceef027853a41137f7bfb6fc63844de95f58e82b9ad2565f1367d2c69bd29100f6db21a8ab7ab58affd1661add0322bd915721378df9fa233ef0b7e0a0a85be31689e21891ec8977";
qx = "484e31e69ef70bb8527853c22c6b6b4cd2a51311dde66c7b63f097dbb6ab27bf";
qy = "e1ff8177f4061d4fbbacbbc70519f0fc8c8b6053d72af0fe4f048d615004f74e";
r = "91a303d8fe3ab4176070f6406267f6b79bfe5eb5f62ae6aeb374d90667858518";
s = "e152119cefa26826ea07ec40a428869132d70812c5578c5a260e48d6800e046a";
result = false;
};
{ msg = "d64ea1a768b0de29ab018ae93baa645d078c70a2f7aa4acd4ae7526538ebd5f697a11927cfd0ddc9187c095f14ad30544cb63ede9353af8b23c18ce22843881fe2d7bde748fc69085921677858d87d2dc3e244f6c7e2c2b2bd791f450dfdd4ff0ddd35ab2ada4f1b90ab16ef2bf63b3fbe88ce8a5d5bb85430740d3744849c13";
qx = "8b75fc0129c9a78f8395c63ae9694b05cd6950665cf5da7d66118de451422624";
qy = "b394171981d4896d6e1b4ef2336d9befe7d27e1eb87f1c14b8ddda622af379dc";
r = "17e298e67ad2af76f6892fdcead00a88256573868f79dc74431b55103058f0b0";
s = "881328cd91e43d30133f6e471e0b9b04353b17893fb7614fd7333d812a3df6b4";
result = false;
};
{ msg = "1db85445c9d8d1478a97dd9d6ffbf11ebcd2114d2ed4e8b6811171d947e7d4daedea35af6177debe2ef6d93f94ff9d770b45d458e91deb4eef59856425d7b00291aff9b6c9fa02375ec1a06f71f7548721790023301cf6ac7fee1d451228106ef4472681e652c8cd59b15d6d16f1e13440d888e265817cb4a654f7246e0980df";
qx = "76e51086e078b2b116fd1e9c6fa3d53f675ae40252fb9f0cc62817bd9ce8831d";
qy = "ca7e609a0b1d14b7c9249b53da0b2050450e2a25cb6c8f81c5311974a7efb576";
r = "23b653faaa7d4552388771931803ce939dd5ee62d3fa72b019be1b2272c85592";
s = "a03c6f5c54a10861d6b8922821708e9306fd6d5d10d566845a106539cbf4fadd";
result = false;
};
{ msg = "918d9f420e927b3e0a55d276b8b40d8a2c5df748727ff72a438c7e6593f542274050dce727980d3ef90c8aa5c13d53f1e8d631ebb650dee11b94902bbd7c92b8186af9039c56c43f3110697792c8cd1614166f06d09cdb58dab168cc3680a8473b1a623bf85dba855eace579d9410d2c4ca5ede6dc1e3db81e233c34ae922f49";
qx = "bc7c8e09bd093468f706740a4130c544374fdc924a535ef02e9d3be6c6d3bbfa";
qy = "af3f813ae6646f5b6dbfb0f261fd42537705c800bb1647386343428a9f2e10fc";
r = "6bd7ce95af25abfbf14aef4b17392f1da877ab562eca38d785fe39682e9c9324";
s = "6688bea20c87bab34d420642da9bdd4c69456bdec50835887367bb4fb7cd8650";
result = false;
};
{ msg = "6e2932153301a4eef680e6428929adae988c108d668a31ff55d0489947d75ff81a46bf89e84d6401f023be6e87688fbcd784d785ca846735524acb52d00452c84040a479e7cc330936441d93bbe722a9432a6e1db112b5c9403b10272cb1347fd619d463f7a9d223ad76fde06d8a6883500fb843235abff98e241bdfb5538c3e";
qx = "9cb0cf69303dafc761d4e4687b4ecf039e6d34ab964af80810d8d558a4a8d6f7";
qy = "2d51233a1788920a86ee08a1962c79efa317fb7879e297dad2146db995fa1c78";
r = "4b9f91e4285287261a1d1c923cf619cd52c175cfe7f1be60a5258c610348ba3d";
s = "28c45f901d71c41b298638ec0d6a85d7fcb0c33bbfec5a9c810846b639289a84";
result = true;
};
{ msg = "2f48ec387f181035b350772e27f478ae6ec7487923692fae217e0f8636acd062a6ac39f7435f27a0ebcfd8187a91ef00fb68d106b8da4a1dedc5a40a4fae709e92b00fcc218de76417d75185e59dff76ec1543fb429d87c2ca8134ff5ae9b45456cad93fc67223c68293231395287dc0b756355660721a1f5df83bf5bcb8456e";
qx = "e31096c2d512fbf84f81e9bdb16f33121702897605b43a3db546f8fb695b5f6f";
qy = "6fbec6a04a8c59d61c900a851d8bf8522187d3ec2637b10fa8f377689e086bba";
r = "1b244c21c08c0c0a10477fb7a21382d405b95c755088292859ca0e71bab68361";
s = "852f4cbfd346e90f404e1dd5c4b2c1debca3ea1abefe8400685d703aea6c5c7f";
result = false;
};
{ msg = "fd2e5de421ee46c9fe6290a33f95b394bd5b7762f23178f7f6834f1f056fa9a8831446403c098ff4dd764173f974be4c89d376119613a4a1890f6fc2ddff862bda292dd49f5410d9b1cfe1d97ef4582b6152494372fc083885f540c01f86d780e6f3e75a954af2190fdae9604e3f8ab32ab0292dc0d790bd2627e37b4b4885df";
qx = "633c2ee5630b62c9ce839efd4d485a6d35e8b9430d264ffe501d28dbace79123";
qy = "4b668a1a6d1a25b089f75c2bd8d8c6a9a14fe7b729f45a82565da2e866e2c490";
r = "bf2111c93ec055a7eda90c106fce494fd866045634fd2aa28d6e018f9106994e";
s = "86b0341208a0aa55edecfd272f49cb34408ce54b7febc1d0a1c2ce77ab6988f8";
result = false;
};
{ msg = "4bc2d9a898395b12701635f1048fbfd263ec115e4150532b034d59e625238f4ed32619744c612e35ac5a23bee8d5f5651641a492217d305e5051321c273647f14bc7c4afab518554e01c82d6fc1694c8bdbeb326bb607bcaf5436303bc09f64c02c6ec50de409a484f5237f7d34e2651ada7ec429ca3b99dd87c6015d2f4b342";
qx = "f78dce40d1cb8c4af2749bf22c6f8a9a470b1e41112796215dd017e57df1b38a";
qy = "61b29b0bc03dff7fa00613b4de1e2317cfbf2badd50dee3376c032a887c5b865";
r = "4a96169a5dea36a2594011537ee0dc19e8f9f74e82c07434079447155a830152";
s = "a204eaa4e97d7553a1521d9f6baadc0b6d6183ba0f385d8593d6ca83607c4d82";
result = false;
};
{ msg = "d3356a683417508a9b913643e6ceac1281ef583f428968f9d2b6540a189d7041c477da8d207d0529720f70dab6b0da8c2168837476c1c6b63b517ed3cad48ae331cf716ecf47a0f7d00b57073ac6a4749716d49d80c4d46261d38e2e34b4f43e0f20b280842f6e3ea34fefdddfb9fa2a040ffe915e8784cfdb29b3364a34ca62";
qx = "3fcc3b3e1b103fe435ac214c756bdaad309389e1c803e6d84bbbc27039fcf900";
qy = "7f09edd1ec87a6d36dc81c1528d52a62776e666c274415a9f441d6a8df6b9237";
r = "1cac13f277354456ae67ab09b09e07eb1af2a2bf45108da70f5c8c6a4cbcd538";
s = "5d83752e540525602ba7e6fee4d4263f3eda59e67df20aac79ca67e8899fed0d";
result = false;
};
{ msg = "d7f5da9f4cf9299b7f86c52b88364ce28fe9ada55dd551a1018790f9e1205e2405ac62429d65093f74ec35a16d9f195c993cd4eb8dc0aa0dabb70a503321d8a9649160d6b3d0a0854bb68c4c39693f592ef5dd478aa2432d0865d87d48b3aea9c7d7d114165c9200e4e8d7bd02a7895ec4418e6f2fed6b244bf66209039e98a9";
qx = "5ec702d43a67ada86efbfc136cf16d96078906954a3f1f9e440674cd907e4676";
qy = "05a62044fed8470dd4fca38d89d583ce36d50d28b66ab0b51922b21da92c56d9";
r = "75f3037298f1457dba55743999976a1c2636b2b8ab2ed3df4736a6d2934acc83";
s = "19d43ad168dda1bb8ac423f8f08876515234b3d841e57faef1b5ab27359b27ef";
result = false;
};
{ msg = "68f4b444e1cc2025e8ff55e8046ead735e6e317082edf7ce65e83573501cb92c408c1c1c6c4fcca6b96ad34224f17b20be471cc9f4f97f0a5b7bfae9558bdb2ecb6e452bb743603724273d9e8d2ca22afdda35c8a371b28153d772303e4a25dc4f28e9a6dc9635331450f5af290dfa3431c3c08b91d5c97284361c03ec78f1bc";
qx = "f63afe99e1b5fc652782f86b59926af22e6072be93390fe41f541204f9c935d1";
qy = "f6e19ce5935e336183c21becf66596b8f559d2d02ee282aa87a7d6f936f7260c";
r = "cef4831e4515c77ca062282614b54a11b7dc4057e6997685c2fbfa95b392bf72";
s = "f20dc01bf38e1344ba675a22239d9893b3a3e33d9a403329a3d21650e9125b75";
result = true;
};
{ msg = "e75be05be0aaf70719b488b89aaae9008707ca528994461db7130c4368575a024bf0981c305d61265e8b97599ec35c03badd1256b80d6bf70547ad6089b983e3bcc3481828f3259e43e655e177fc423fd7e066bd3ed68d81df84f773c0f9e5f8bf4469960b8b4d7b2a372fd0edd3521f6be670908f2d90a343f416358ea70e7e";
qx = "6d11b09d2767cf8d275faee746c203486259f66dd2bfa3a65c39371a66b23385";
qy = "4eb05c73e05261e979182833f20311e5366f72f4b949665ff294f959375534c6";
r = "15a697cdb614e11c0810e1e764cd501fcabc70874c957587bc4883d9438e177f";
s = "7bf6244f92bc768063cecb5336c8eaacd23db930b28703560f241c7d93950dfd";
result = false;
};
{ msg = "0dc4a3eab66bd2e703a8fff566c34d466f9823ae42bd2104f61a6b051c0b017833fcef4d609d137ad97c209c80eebe252857aa7fafc35f16000a2bd4b4be0fa83b6e229eddfd180101f1f40d0453148053d8306833df64d59599b90194b55541d7f22dd589da9f7be519cbbb9db416c71bfe40ec090b5b7a600eec29bfd47306";
qx = "f3899caba038efb534c4cea0bd276814ffd80194473c903b81af11c8c05cb6e6";
qy = "6ea6b17402fcf2e8e737d11ffc7c2ed3b2d0bc3b8f271a381f4294cff62682c3";
r = "57b99380452e1d37b133c49b9ba493dee8630940477ca3351a43d90b99871e6a";
s = "df599c3a37105af3ecc159b3b685ccb3e151b7d5cf2d97147974ae71f466b615";
result = false;
};
{ msg = "d55e5e124a7217879ca986f285e22ac51940b35959bbf5543104b5547356fd1a0ec37c0a23209004a2ec5bcaf3335bc45e4dc990eacd29b2d9b5cf349c7ba67711356299bceab6f048df761c65f2988803133d6723a2820fefb2654cc7c5f032f833ba78a34d2878c6b0ba654ebe26b110c935abb56024bd5d0f09b367724c07";
qx = "1fd6f4b98d0755291e7a230e9f81ecf909e6350aadb08e42a3262ff19200fbd2";
qy = "5578fef79bc477acfb8ed0dc10c4f5809c14dc5492405b3792a7940650b305d7";
r = "97a99e96e407b3ada2c2dcf9ceeeb984d9a4d0aa66ddf0a74ca23cabfb1566cc";
s = "0ecac315dc199cfea3c15348c130924a1f787019fe4cd3ae47ca8b111268754a";
result = false;
};
{ msg = "7753c03b4202cb38bc0190a9f931eb31858d705d92d650320ff449fc99167fb3770b764c8988f6b34ac5a3d507a10e0aff7f88293f6a22c7ed8a24248a52dc125e416e158833fc38af29199f8ca4931068d4ccaa87e299e95642068f68c208cb782df13908f950564743ed1692502bafafaff169dc8fe674fb5e4f3ffd578c35";
qx = "2dcbd8790cee552e9f18f2b3149a2252dcd58b99ca7dc9680b92c8c43aa33874";
qy = "5dbc8bb8813c8e019d80e19acdb0792f537980fecde93db621aaf1f6d0e6ee34";
r = "2bdbd8b0d759595662cc10b10236136ef6ce429641f68cf6480f472fcc77bc9f";
s = "7e7df0c8b86f7db06caf1610166f7b9c4c75447f991d5aaf4dea720c25985c8c";
result = true;
};
] | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Meta.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.ECDSA.Test.Vectors.fst"
} | [
{
"abbrev": false,
"full_module": "Lib.Meta",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.ECDSA.Test",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.ECDSA.Test",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Prims.list Spec.ECDSA.Test.Vectors.vec_SigGen | Prims.Tot | [
"total"
] | [] | [
"Prims.Cons",
"Spec.ECDSA.Test.Vectors.vec_SigGen",
"Spec.ECDSA.Test.Vectors.Mkvec_SigGen",
"Prims.Nil"
] | [] | false | false | false | true | false | let siggen_vectors_sha2_256:list vec_SigGen =
| [
{
msg'
=
"5905238877c77421f73e43ee3da6f2d9e2ccad5fc942dcec0cbd25482935faaf416983fe165b1a045ee2bcd2e6dca3bdf46c4310a7461f9a37960ca672d3feb5473e253605fb1ddfd28065b53cb5858a8ad28175bf9bd386a5e471ea7a65c17cc934a9d791e91491eb3754d03799790fe2d308d16146d5c9b0d0debd97d79ce8";
d = "519b423d715f8b581f4fa8ee59f4771a5b44c8130b4e3eacca54a56dda72b464";
qx' = "1ccbe91c075fc7f4f033bfa248db8fccd3565de94bbfb12f3c59ff46c271bf83";
qy' = "ce4014c68811f9a21a1fdb2c0e6113e06db7ca93b7404e78dc7ccd5ca89a4ca9";
k = "94a1bbb14b906a61a280f245f9e93c7f3b4a6247824f5d33b9670787642a68de";
r' = "f3ac8061b514795b8843e3d6629527ed2afd6b1f6a555a7acabb5e6f79c8c2ac";
s' = "8bf77819ca05a6b2786c76262bf7371cef97b218e96f175a3ccdda2acc058903"
};
{
msg'
=
"c35e2f092553c55772926bdbe87c9796827d17024dbb9233a545366e2e5987dd344deb72df987144b8c6c43bc41b654b94cc856e16b96d7a821c8ec039b503e3d86728c494a967d83011a0e090b5d54cd47f4e366c0912bc808fbb2ea96efac88fb3ebec9342738e225f7c7c2b011ce375b56621a20642b4d36e060db4524af1";
d = "0f56db78ca460b055c500064824bed999a25aaf48ebb519ac201537b85479813";
qx' = "e266ddfdc12668db30d4ca3e8f7749432c416044f2d2b8c10bf3d4012aeffa8a";
qy' = "bfa86404a2e9ffe67d47c587ef7a97a7f456b863b4d02cfc6928973ab5b1cb39";
k = "6d3e71882c3b83b156bb14e0ab184aa9fb728068d3ae9fac421187ae0b2f34c6";
r' = "976d3a4e9d23326dc0baa9fa560b7c4e53f42864f508483a6473b6a11079b2db";
s' = "1b766e9ceb71ba6c01dcd46e0af462cd4cfa652ae5017d4555b8eeefe36e1932"
};
{
msg'
=
"3c054e333a94259c36af09ab5b4ff9beb3492f8d5b4282d16801daccb29f70fe61a0b37ffef5c04cd1b70e85b1f549a1c4dc672985e50f43ea037efa9964f096b5f62f7ffdf8d6bfb2cc859558f5a393cb949dbd48f269343b5263dcdb9c556eca074f2e98e6d94c2c29a677afaf806edf79b15a3fcd46e7067b7669f83188ee";
d = "e283871239837e13b95f789e6e1af63bf61c918c992e62bca040d64cad1fc2ef";
qx' = "74ccd8a62fba0e667c50929a53f78c21b8ff0c3c737b0b40b1750b2302b0bde8";
qy' = "29074e21f3a0ef88b9efdf10d06aa4c295cc1671f758ca0e4cd108803d0f2614";
k = "ad5e887eb2b380b8d8280ad6e5ff8a60f4d26243e0124c2f31a297b5d0835de2";
r' = "35fb60f5ca0f3ca08542fb3cc641c8263a2cab7a90ee6a5e1583fac2bb6f6bd1";
s' = "ee59d81bc9db1055cc0ed97b159d8784af04e98511d0a9a407b99bb292572e96"
};
{
msg'
=
"0989122410d522af64ceb07da2c865219046b4c3d9d99b01278c07ff63eaf1039cb787ae9e2dd46436cc0415f280c562bebb83a23e639e476a02ec8cff7ea06cd12c86dcc3adefbf1a9e9a9b6646c7599ec631b0da9a60debeb9b3e19324977f3b4f36892c8a38671c8e1cc8e50fcd50f9e51deaf98272f9266fc702e4e57c30";
d = "a3d2d3b7596f6592ce98b4bfe10d41837f10027a90d7bb75349490018cf72d07";
qx' = "322f80371bf6e044bc49391d97c1714ab87f990b949bc178cb7c43b7c22d89e1";
qy' = "3c15d54a5cc6b9f09de8457e873eb3deb1fceb54b0b295da6050294fae7fd999";
k = "24fc90e1da13f17ef9fe84cc96b9471ed1aaac17e3a4bae33a115df4e5834f18";
r' = "d7c562370af617b581c84a2468cc8bd50bb1cbf322de41b7887ce07c0e5884ca";
s' = "b46d9f2d8c4bf83546ff178f1d78937c008d64e8ecc5cbb825cb21d94d670d89"
};
{
msg'
=
"dc66e39f9bbfd9865318531ffe9207f934fa615a5b285708a5e9c46b7775150e818d7f24d2a123df3672fff2094e3fd3df6fbe259e3989dd5edfcccbe7d45e26a775a5c4329a084f057c42c13f3248e3fd6f0c76678f890f513c32292dd306eaa84a59abe34b16cb5e38d0e885525d10336ca443e1682aa04a7af832b0eee4e7";
d = "53a0e8a8fe93db01e7ae94e1a9882a102ebd079b3a535827d583626c272d280d";
qx' = "1bcec4570e1ec2436596b8ded58f60c3b1ebc6a403bc5543040ba82963057244";
qy' = "8af62a4c683f096b28558320737bf83b9959a46ad2521004ef74cf85e67494e1";
k = "5d833e8d24cc7a402d7ee7ec852a3587cddeb48358cea71b0bedb8fabe84e0c4";
r' = "18caaf7b663507a8bcd992b836dec9dc5703c080af5e51dfa3a9a7c387182604";
s' = "77c68928ac3b88d985fb43fb615fb7ff45c18ba5c81af796c613dfa98352d29c"
};
{
msg'
=
"600974e7d8c5508e2c1aab0783ad0d7c4494ab2b4da265c2fe496421c4df238b0be25f25659157c8a225fb03953607f7df996acfd402f147e37aee2f1693e3bf1c35eab3ae360a2bd91d04622ea47f83d863d2dfecb618e8b8bdc39e17d15d672eee03bb4ce2cc5cf6b217e5faf3f336fdd87d972d3a8b8a593ba85955cc9d71";
d = "4af107e8e2194c830ffb712a65511bc9186a133007855b49ab4b3833aefc4a1d";
qx' = "a32e50be3dae2c8ba3f5e4bdae14cf7645420d425ead94036c22dd6c4fc59e00";
qy' = "d623bf641160c289d6742c6257ae6ba574446dd1d0e74db3aaa80900b78d4ae9";
k = "e18f96f84dfa2fd3cdfaec9159d4c338cd54ad314134f0b31e20591fc238d0ab";
r' = "8524c5024e2d9a73bde8c72d9129f57873bbad0ed05215a372a84fdbc78f2e68";
s' = "d18c2caf3b1072f87064ec5e8953f51301cada03469c640244760328eb5a05cb"
};
{
msg'
=
"dfa6cb9b39adda6c74cc8b2a8b53a12c499ab9dee01b4123642b4f11af336a91a5c9ce0520eb2395a6190ecbf6169c4cba81941de8e76c9c908eb843b98ce95e0da29c5d4388040264e05e07030a577cc5d176387154eabae2af52a83e85c61c7c61da930c9b19e45d7e34c8516dc3c238fddd6e450a77455d534c48a152010b";
d = "78dfaa09f1076850b3e206e477494cddcfb822aaa0128475053592c48ebaf4ab";
qx' = "8bcfe2a721ca6d753968f564ec4315be4857e28bef1908f61a366b1f03c97479";
qy' = "0f67576a30b8e20d4232d8530b52fb4c89cbc589ede291e499ddd15fe870ab96";
k = "295544dbb2da3da170741c9b2c6551d40af7ed4e891445f11a02b66a5c258a77";
r' = "c5a186d72df452015480f7f338970bfe825087f05c0088d95305f87aacc9b254";
s' = "84a58f9e9d9e735344b316b1aa1ab5185665b85147dc82d92e969d7bee31ca30"
};
{
msg'
=
"51d2547cbff92431174aa7fc7302139519d98071c755ff1c92e4694b58587ea560f72f32fc6dd4dee7d22bb7387381d0256e2862d0644cdf2c277c5d740fa089830eb52bf79d1e75b8596ecf0ea58a0b9df61e0c9754bfcd62efab6ea1bd216bf181c5593da79f10135a9bc6e164f1854bc8859734341aad237ba29a81a3fc8b";
d = "80e692e3eb9fcd8c7d44e7de9f7a5952686407f90025a1d87e52c7096a62618a";
qx' = "a88bc8430279c8c0400a77d751f26c0abc93e5de4ad9a4166357952fe041e767";
qy' = "2d365a1eef25ead579cc9a069b6abc1b16b81c35f18785ce26a10ba6d1381185";
k = "7c80fd66d62cc076cef2d030c17c0a69c99611549cb32c4ff662475adbe84b22";
r' = "9d0c6afb6df3bced455b459cc21387e14929392664bb8741a3693a1795ca6902";
s' = "d7f9ddd191f1f412869429209ee3814c75c72fa46a9cccf804a2f5cc0b7e739f"
};
{
msg'
=
"558c2ac13026402bad4a0a83ebc9468e50f7ffab06d6f981e5db1d082098065bcff6f21a7a74558b1e8612914b8b5a0aa28ed5b574c36ac4ea5868432a62bb8ef0695d27c1e3ceaf75c7b251c65ddb268696f07c16d2767973d85beb443f211e6445e7fe5d46f0dce70d58a4cd9fe70688c035688ea8c6baec65a5fc7e2c93e8";
d = "5e666c0db0214c3b627a8e48541cc84a8b6fd15f300da4dff5d18aec6c55b881";
qx' = "1bc487570f040dc94196c9befe8ab2b6de77208b1f38bdaae28f9645c4d2bc3a";
qy' = "ec81602abd8345e71867c8210313737865b8aa186851e1b48eaca140320f5d8f";
k = "2e7625a48874d86c9e467f890aaa7cd6ebdf71c0102bfdcfa24565d6af3fdce9";
r' = "2f9e2b4e9f747c657f705bffd124ee178bbc5391c86d056717b140c153570fd9";
s' = "f5413bfd85949da8d83de83ab0d19b2986613e224d1901d76919de23ccd03199"
};
{
msg'
=
"4d55c99ef6bd54621662c3d110c3cb627c03d6311393b264ab97b90a4b15214a5593ba2510a53d63fb34be251facb697c973e11b665cb7920f1684b0031b4dd370cb927ca7168b0bf8ad285e05e9e31e34bc24024739fdc10b78586f29eff94412034e3b606ed850ec2c1900e8e68151fc4aee5adebb066eb6da4eaa5681378e";
d = "f73f455271c877c4d5334627e37c278f68d143014b0a05aa62f308b2101c5308";
qx' = "b8188bd68701fc396dab53125d4d28ea33a91daf6d21485f4770f6ea8c565dde";
qy' = "423f058810f277f8fe076f6db56e9285a1bf2c2a1dae145095edd9c04970bc4a";
k = "62f8665fd6e26b3fa069e85281777a9b1f0dfd2c0b9f54a086d0c109ff9fd615";
r' = "1cc628533d0004b2b20e7f4baad0b8bb5e0673db159bbccf92491aef61fc9620";
s' = "880e0bbf82a8cf818ed46ba03cf0fc6c898e36fca36cc7fdb1d2db7503634430"
};
{
msg'
=
"f8248ad47d97c18c984f1f5c10950dc1404713c56b6ea397e01e6dd925e903b4fadfe2c9e877169e71ce3c7fe5ce70ee4255d9cdc26f6943bf48687874de64f6cf30a012512e787b88059bbf561162bdcc23a3742c835ac144cc14167b1bd6727e940540a9c99f3cbb41fb1dcb00d76dda04995847c657f4c19d303eb09eb48a";
d = "b20d705d9bd7c2b8dc60393a5357f632990e599a0975573ac67fd89b49187906";
qx' = "51f99d2d52d4a6e734484a018b7ca2f895c2929b6754a3a03224d07ae61166ce";
qy' = "4737da963c6ef7247fb88d19f9b0c667cac7fe12837fdab88c66f10d3c14cad1";
k = "72b656f6b35b9ccbc712c9f1f3b1a14cbbebaec41c4bca8da18f492a062d6f6f";
r' = "9886ae46c1415c3bc959e82b760ad760aab66885a84e620aa339fdf102465c42";
s' = "2bf3a80bc04faa35ebecc0f4864ac02d349f6f126e0f988501b8d3075409a26c"
};
{
msg'
=
"3b6ee2425940b3d240d35b97b6dcd61ed3423d8e71a0ada35d47b322d17b35ea0472f35edd1d252f87b8b65ef4b716669fc9ac28b00d34a9d66ad118c9d94e7f46d0b4f6c2b2d339fd6bcd351241a387cc82609057048c12c4ec3d85c661975c45b300cb96930d89370a327c98b67defaa89497aa8ef994c77f1130f752f94a4";
d = "d4234bebfbc821050341a37e1240efe5e33763cbbb2ef76a1c79e24724e5a5e7";
qx' = "8fb287f0202ad57ae841aea35f29b2e1d53e196d0ddd9aec24813d64c0922fb7";
qy' = "1f6daff1aa2dd2d6d3741623eecb5e7b612997a1039aab2e5cf2de969cfea573";
k = "d926fe10f1bfd9855610f4f5a3d666b1a149344057e35537373372ead8b1a778";
r' = "490efd106be11fc365c7467eb89b8d39e15d65175356775deab211163c2504cb";
s' = "644300fc0da4d40fb8c6ead510d14f0bd4e1321a469e9c0a581464c7186b7aa7"
};
{
msg'
=
"c5204b81ec0a4df5b7e9fda3dc245f98082ae7f4efe81998dcaa286bd4507ca840a53d21b01e904f55e38f78c3757d5a5a4a44b1d5d4e480be3afb5b394a5d2840af42b1b4083d40afbfe22d702f370d32dbfd392e128ea4724d66a3701da41ae2f03bb4d91bb946c7969404cb544f71eb7a49eb4c4ec55799bda1eb545143a7";
d = "b58f5211dff440626bb56d0ad483193d606cf21f36d9830543327292f4d25d8c";
qx' = "68229b48c2fe19d3db034e4c15077eb7471a66031f28a980821873915298ba76";
qy' = "303e8ee3742a893f78b810991da697083dd8f11128c47651c27a56740a80c24c";
k = "e158bf4a2d19a99149d9cdb879294ccb7aaeae03d75ddd616ef8ae51a6dc1071";
r' = "e67a9717ccf96841489d6541f4f6adb12d17b59a6bef847b6183b8fcf16a32eb";
s' = "9ae6ba6d637706849a6a9fc388cf0232d85c26ea0d1fe7437adb48de58364333"
};
{
msg'
=
"72e81fe221fb402148d8b7ab03549f1180bcc03d41ca59d7653801f0ba853add1f6d29edd7f9abc621b2d548f8dbf8979bd16608d2d8fc3260b4ebc0dd42482481d548c7075711b5759649c41f439fad69954956c9326841ea6492956829f9e0dc789f73633b40f6ac77bcae6dfc7930cfe89e526d1684365c5b0be2437fdb01";
d = "54c066711cdb061eda07e5275f7e95a9962c6764b84f6f1f3ab5a588e0a2afb1";
qx' = "0a7dbb8bf50cb605eb2268b081f26d6b08e012f952c4b70a5a1e6e7d46af98bb";
qy' = "f26dd7d799930062480849962ccf5004edcfd307c044f4e8f667c9baa834eeae";
k = "646fe933e96c3b8f9f507498e907fdd201f08478d0202c752a7c2cfebf4d061a";
r' = "b53ce4da1aa7c0dc77a1896ab716b921499aed78df725b1504aba1597ba0c64b";
s' = "d7c246dc7ad0e67700c373edcfdd1c0a0495fc954549ad579df6ed1438840851"
};
{
msg'
=
"21188c3edd5de088dacc1076b9e1bcecd79de1003c2414c3866173054dc82dde85169baa77993adb20c269f60a5226111828578bcc7c29e6e8d2dae81806152c8ba0c6ada1986a1983ebeec1473a73a04795b6319d48662d40881c1723a706f516fe75300f92408aa1dc6ae4288d2046f23c1aa2e54b7fb6448a0da922bd7f34";
d = "34fa4682bf6cb5b16783adcd18f0e6879b92185f76d7c920409f904f522db4b1";
qx' = "105d22d9c626520faca13e7ced382dcbe93498315f00cc0ac39c4821d0d73737";
qy' = "6c47f3cbbfa97dfcebe16270b8c7d5d3a5900b888c42520d751e8faf3b401ef4";
k = "a6f463ee72c9492bc792fe98163112837aebd07bab7a84aaed05be64db3086f4";
r' = "542c40a18140a6266d6f0286e24e9a7bad7650e72ef0e2131e629c076d962663";
s' = "4f7f65305e24a6bbb5cff714ba8f5a2cee5bdc89ba8d75dcbf21966ce38eb66f"
}
] | false |
Spec.ECDSA.Test.Vectors.fst | Spec.ECDSA.Test.Vectors.siggen_vectors_sha2_384 | val siggen_vectors_sha2_384:list vec_SigGen | val siggen_vectors_sha2_384:list vec_SigGen | let siggen_vectors_sha2_384 : list vec_SigGen = [
{ msg' = "e0b8596b375f3306bbc6e77a0b42f7469d7e83635990e74aa6d713594a3a24498feff5006790742d9c2e9b47d714bee932435db747c6e733e3d8de41f2f91311f2e9fd8e025651631ffd84f66732d3473fbd1627e63dc7194048ebec93c95c159b5039ab5e79e42c80b484a943f125de3da1e04e5bf9c16671ad55a1117d3306";
d = "b6faf2c8922235c589c27368a3b3e6e2f42eb6073bf9507f19eed0746c79dced";
qx' = "e0e7b99bc62d8dd67883e39ed9fa0657789c5ff556cc1fd8dd1e2a55e9e3f243";
qy' = "63fbfd0232b95578075c903a4dbf85ad58f8350516e1ec89b0ee1f5e1362da69";
k = "9980b9cdfcef3ab8e219b9827ed6afdd4dbf20bd927e9cd01f15762703487007";
r' = "f5087878e212b703578f5c66f434883f3ef414dc23e2e8d8ab6a8d159ed5ad83";
s' = "306b4c6c20213707982dffbb30fba99b96e792163dd59dbe606e734328dd7c8a";
};
{ msg' = "099a0131179fff4c6928e49886d2fdb3a9f239b7dd5fa828a52cbbe3fcfabecfbba3e192159b887b5d13aa1e14e6a07ccbb21f6ad8b7e88fee6bea9b86dea40ffb962f38554056fb7c5bb486418915f7e7e9b9033fe3baaf9a069db98bc02fa8af3d3d1859a11375d6f98aa2ce632606d0800dff7f55b40f971a8586ed6b39e9";
d = "118958fd0ff0f0b0ed11d3cf8fa664bc17cdb5fed1f4a8fc52d0b1ae30412181";
qx' = "afda82260c9f42122a3f11c6058839488f6d7977f6f2a263c67d06e27ea2c355";
qy' = "0ae2bbdd2207c590332c5bfeb4c8b5b16622134bd4dc55382ae806435468058b";
k = "23129a99eeda3d99a44a5778a46e8e7568b91c31fb7a8628c5d9820d4bed4a6b";
r' = "e446600cab1286ebc3bb332012a2f5cc33b0a5ef7291d5a62a84de5969d77946";
s' = "cf89b12793ee1792eb26283b48fa0bdcb45ae6f6ad4b02564bf786bb97057d5a";
};
{ msg' = "0fbc07ea947c946bea26afa10c51511039b94ddbc4e2e4184ca3559260da24a14522d1497ca5e77a5d1a8e86583aeea1f5d4ff9b04a6aa0de79cd88fdb85e01f171143535f2f7c23b050289d7e05cebccdd131888572534bae0061bdcc3015206b9270b0d5af9f1da2f9de91772d178a632c3261a1e7b3fb255608b3801962f9";
d = "3e647357cd5b754fad0fdb876eaf9b1abd7b60536f383c81ce5745ec80826431";
qx' = "702b2c94d039e590dd5c8f9736e753cf5824aacf33ee3de74fe1f5f7c858d5ed";
qy' = "0c28894e907af99fb0d18c9e98f19ac80dd77abfa4bebe45055c0857b82a0f4d";
k = "9beab7722f0bcb468e5f234e074170a60225255de494108459abdf603c6e8b35";
r' = "c4021fb7185a07096547af1fb06932e37cf8bd90cf593dea48d48614fa237e5e";
s' = "7fb45d09e2172bec8d3e330aa06c43fbb5f625525485234e7714b7f6e92ba8f1";
};
{ msg' = "1e38d750d936d8522e9db1873fb4996bef97f8da3c6674a1223d29263f1234a90b751785316444e9ba698bc8ab6cd010638d182c9adad4e334b2bd7529f0ae8e9a52ad60f59804b2d780ed52bdd33b0bf5400147c28b4304e5e3434505ae7ce30d4b239e7e6f0ecf058badd5b388eddbad64d24d2430dd04b4ddee98f972988f";
d = "76c17c2efc99891f3697ba4d71850e5816a1b65562cc39a13da4b6da9051b0fd";
qx' = "d12512e934c367e4c4384dbd010e93416840288a0ba00b299b4e7c0d91578b57";
qy' = "ebf8835661d9b578f18d14ae4acf9c357c0dc8b7112fc32824a685ed72754e23";
k = "77cffa6f9a73904306f9fcd3f6bbb37f52d71e39931bb4aec28f9b076e436ccf";
r' = "4d5a9d95b0f09ce8704b0f457b39059ee606092310df65d3f8ae7a2a424cf232";
s' = "7d3c014ca470a73cef1d1da86f2a541148ad542fbccaf9149d1b0b030441a7eb";
};
{ msg' = "abcf0e0f046b2e0672d1cc6c0a114905627cbbdefdf9752f0c31660aa95f2d0ede72d17919a9e9b1add3213164e0c9b5ae3c76f1a2f79d3eeb444e6741521019d8bd5ca391b28c1063347f07afcfbb705be4b52261c19ebaf1d6f054a74d86fb5d091fa7f229450996b76f0ada5f977b09b58488eebfb5f5e9539a8fd89662ab";
d = "67b9dea6a575b5103999efffce29cca688c781782a41129fdecbce76608174de";
qx' = "b4238b029fc0b7d9a5286d8c29b6f3d5a569e9108d44d889cd795c4a385905be";
qy' = "8cb3fff8f6cca7187c6a9ad0a2b1d9f40ae01b32a7e8f8c4ca75d71a1fffb309";
k = "d02617f26ede3584f0afcfc89554cdfb2ae188c192092fdde3436335fafe43f1";
r' = "26fd9147d0c86440689ff2d75569795650140506970791c90ace0924b44f1586";
s' = "00a34b00c20a8099df4b0a757cbef8fea1cb3ea7ced5fbf7e987f70b25ee6d4f";
};
{ msg' = "dc3d4884c741a4a687593c79fb4e35c5c13c781dca16db561d7e393577f7b62ca41a6e259fc1fb8d0c4e1e062517a0fdf95558b7799f20c211796167953e6372c11829beec64869d67bf3ee1f1455dd87acfbdbcc597056e7fb347a17688ad32fda7ccc3572da7677d7255c261738f07763cd45973c728c6e9adbeecadc3d961";
d = "ecf644ea9b6c3a04fdfe2de4fdcb55fdcdfcf738c0b3176575fa91515194b566";
qx' = "c3bdc7c795ec94620a2cfff614c13a3390a5e86c892e53a24d3ed22228bc85bf";
qy' = "70480fc5cf4aacd73e24618b61b5c56c1ced8c4f1b869580ea538e68c7a61ca3";
k = "53291d51f68d9a12d1dcdc58892b2f786cc15f631f16997d2a49bace513557d4";
r' = "a860c8b286edf973ce4ce4cf6e70dc9bbf3818c36c023a845677a9963705df8b";
s' = "5630f986b1c45e36e127dd7932221c4272a8cc6e255e89f0f0ca4ec3a9f76494";
};
{ msg' = "719bf1911ae5b5e08f1d97b92a5089c0ab9d6f1c175ac7199086aeeaa416a17e6d6f8486c711d386f284f096296689a54d330c8efb0f5fa1c5ba128d3234a3da856c2a94667ef7103616a64c913135f4e1dc50e38daa60610f732ad1bedfcc396f87169392520314a6b6b9af6793dbabad4599525228cc7c9c32c4d8e097ddf6";
d = "4961485cbc978f8456ec5ac7cfc9f7d9298f99415ecae69c8491b258c029bfee";
qx' = "8d40bf2299e05d758d421972e81cfb0cce68b949240dc30f315836acc70bef03";
qy' = "5674e6f77f8b46f46cca937d83b128dffbe9bd7e0d3d08aa2cbbfdfb16f72c9a";
k = "373a825b5a74b7b9e02f8d4d876b577b4c3984168d704ba9f95b19c05ed590af";
r' = "ef6fb386ad044b63feb7445fa16b10319018e9cea9ef42bca83bdad01992234a";
s' = "ac1f42f652eb1786e57be01d847c81f7efa072ba566d4583af4f1551a3f76c65";
};
{ msg' = "7cf19f4c851e97c5bca11a39f0074c3b7bd3274e7dd75d0447b7b84995dfc9f716bf08c25347f56fcc5e5149cb3f9cfb39d408ace5a5c47e75f7a827fa0bb9921bb5b23a6053dbe1fa2bba341ac874d9b1333fc4dc224854949f5c8d8a5fedd02fb26fdfcd3be351aec0fcbef18972956c6ec0effaf057eb4420b6d28e0c008c";
d = "587907e7f215cf0d2cb2c9e6963d45b6e535ed426c828a6ea2fb637cca4c5cbd";
qx' = "660da45c413cc9c9526202c16b402af602d30daaa7c342f1e722f15199407f31";
qy' = "e6f8cbb06913cc718f2d69ba2fb3137f04a41c27c676d1a80fbf30ea3ca46439";
k = "6b8eb7c0d8af9456b95dd70561a0e902863e6dfa1c28d0fd4a0509f1c2a647b2";
r' = "08fabf9b57de81875bfa7a4118e3e44cfb38ec6a9b2014940207ba3b1c583038";
s' = "a58d199b1deba7350616230d867b2747a3459421811c291836abee715b8f67b4";
};
{ msg' = "b892ffabb809e98a99b0a79895445fc734fa1b6159f9cddb6d21e510708bdab6076633ac30aaef43db566c0d21f4381db46711fe3812c5ce0fb4a40e3d5d8ab24e4e82d3560c6dc7c37794ee17d4a144065ef99c8d1c88bc22ad8c4c27d85ad518fa5747ae35276fc104829d3f5c72fc2a9ea55a1c3a87007cd133263f79e405";
d = "24b1e5676d1a9d6b645a984141a157c124531feeb92d915110aef474b1e27666";
qx' = "b4909a5bdf25f7659f4ef35e4b811429fb2c59126e3dad09100b46aea6ebe7a6";
qy' = "760ae015fa6af5c9749c4030fdb5de6e58c6b5b1944829105cf7edf7d3a22cfb";
k = "88794923d8943b5dbcc7a7a76503880ff7da632b0883aaa60a9fcc71bf880fd6";
r' = "6ec9a340b77fae3c7827fa96d997e92722ff2a928217b6dd3c628f3d49ae4ce6";
s' = "637b54bbcfb7e7d8a41ea317fcfca8ad74eb3bb6b778bc7ef9dec009281976f7";
};
{ msg' = "8144e37014c95e13231cbd6fa64772771f93b44e37f7b02f592099cc146343edd4f4ec9fa1bc68d7f2e9ee78fc370443aa2803ff4ca52ee49a2f4daf2c8181ea7b8475b3a0f608fc3279d09e2d057fbe3f2ffbe5133796124781299c6da60cfe7ecea3abc30706ded2cdf18f9d788e59f2c31662df3abe01a9b12304fb8d5c8c";
d = "bce49c7b03dcdc72393b0a67cf5aa5df870f5aaa6137ada1edc7862e0981ec67";
qx' = "c786d9421d67b72b922cf3def2a25eeb5e73f34543eb50b152e738a98afb0ca5";
qy' = "6796271e79e2496f9e74b126b1123a3d067de56b5605d6f51c8f6e1d5bb93aba";
k = "89e690d78a5e0d2b8ce9f7fcbf34e2605fd9584760fa7729043397612dd21f94";
r' = "07e5054c384839584624e8d730454dc27e673c4a90cbf129d88b91250341854d";
s' = "f7e665b88614d0c5cbb3007cafe713763d81831525971f1747d92e4d1ca263a7";
};
{ msg' = "a3683d120807f0a030feed679785326698c3702f1983eaba1b70ddfa7f0b3188060b845e2b67ed57ee68087746710450f7427cb34655d719c0acbc09ac696adb4b22aba1b9322b7111076e67053a55f62b501a4bca0ad9d50a868f51aeeb4ef27823236f5267e8da83e143047422ce140d66e05e44dc84fb3a4506b2a5d7caa8";
d = "73188a923bc0b289e81c3db48d826917910f1b957700f8925425c1fb27cabab9";
qx' = "86662c014ab666ee770723be8da38c5cd299efc6480fc6f8c3603438fa8397b9";
qy' = "f26b3307a650c3863faaa5f642f3ba1384c3d3a02edd3d48c657c269609cc3fc";
k = "ec90584ab3b383b590626f36ed4f5110e49888aec7ae7a9c5ea62dd2dc378666";
r' = "13e9ad59112fde3af4163eb5c2400b5e9a602576d5869ac1c569075f08c90ff6";
s' = "708ac65ff2b0baaccc6dd954e2a93df46016bd04457636de06798fcc17f02be5";
};
{ msg' = "b1df8051b213fc5f636537e37e212eb20b2423e6467a9c7081336a870e6373fc835899d59e546c0ac668cc81ce4921e88f42e6da2a109a03b4f4e819a17c955b8d099ec6b282fb495258dca13ec779c459da909475519a3477223c06b99afbd77f9922e7cbef844b93f3ce5f50db816b2e0d8b1575d2e17a6b8db9111d6da578";
d = "f637d55763fe819541588e0c603f288a693cc66823c6bb7b8e003bd38580ebce";
qx' = "74a4620c578601475fc169a9b84be613b4a16cb6acab8fd98848a6ec9fbd133d";
qy' = "42b9e35d347c107e63bd55f525f915bcf1e3d2b81d002d3c39acf10fc30645a1";
k = "4d578f5099636234d9c1d566f1215d5d887ae5d47022be17dbf32a11a03f053b";
r' = "113a933ebc4d94ce1cef781e4829df0c493b0685d39fb2048ce01b21c398dbba";
s' = "3005bd4ec63dbd04ce9ff0c6246ad65d27fcf62edb2b7e461589f9f0e7446ffd";
};
{ msg' = "0b918ede985b5c491797d0a81446b2933be312f419b212e3aae9ba5914c00af431747a9d287a7c7761e9bcbc8a12aaf9d4a76d13dad59fc742f8f218ef66eb67035220a07acc1a357c5b562ecb6b895cf725c4230412fefac72097f2c2b829ed58742d7c327cad0f1058df1bddd4ae9c6d2aba25480424308684cecd6517cdd8";
d = "2e357d51517ff93b821f895932fddded8347f32596b812308e6f1baf7dd8a47f";
qx' = "7e4078a1d50c669fb2996dd9bacb0c3ac7ede4f58fa0fa1222e78dbf5d1f4186";
qy' = "0014e46e90cc171fbb83ea34c6b78202ea8137a7d926f0169147ed5ae3d6596f";
k = "be522b0940b9a40d84bf790fe6abdc252877e671f2efa63a33a65a512fc2aa5c";
r' = "a26b9ad775ac37ff4c7f042cdc4872c5e4e5e800485f488ddfaaed379f468090";
s' = "f88eae2019bebbba62b453b8ee3472ca5c67c267964cffe0cf2d2933c1723dff";
};
{ msg' = "0fab26fde1a4467ca930dbe513ccc3452b70313cccde2994eead2fde85c8da1db84d7d06a024c9e88629d5344224a4eae01b21a2665d5f7f36d5524bf5367d7f8b6a71ea05d413d4afde33777f0a3be49c9e6aa29ea447746a9e77ce27232a550b31dd4e7c9bc8913485f2dc83a56298051c92461fd46b14cc895c300a4fb874";
d = "77d60cacbbac86ab89009403c97289b5900466856887d3e6112af427f7f0f50b";
qx' = "a62032dfdb87e25ed0c70cad20d927c7effeb2638e6c88ddd670f74df16090e5";
qy' = "44c5ee2cf740ded468f5d2efe13daa7c5234645a37c073af35330d03a4fed976";
k = "06c1e692b045f425a21347ecf72833d0242906c7c1094f805566cdcb1256e394";
r' = "eb173b51fb0aec318950d097e7fda5c34e529519631c3e2c9b4550b903da417d";
s' = "ca2c13574bf1b7d56e9dc18315036a31b8bceddf3e2c2902dcb40f0cc9e31b45";
};
{ msg' = "7843f157ef8566722a7d69da67de7599ee65cb3975508f70c612b3289190e364141781e0b832f2d9627122742f4b5871ceeafcd09ba5ec90cae6bcc01ae32b50f13f63918dfb5177df9797c6273b92d103c3f7a3fc2050d2b196cc872c57b77f9bdb1782d4195445fcc6236dd8bd14c8bcbc8223a6739f6a17c9a861e8c821a6";
d = "486854e77962117f49e09378de6c9e3b3522fa752b10b2c810bf48db584d7388";
qx' = "760b5624bd64d19c866e54ccd74ad7f98851afdbc3ddeae3ec2c52a135be9cfa";
qy' = "feca15ce9350877102eee0f5af18b2fed89dc86b7df0bf7bc2963c1638e36fe8";
k = "e4f77c6442eca239b01b0254e11a4182782d96f48ab521cc3d1d68df12b5a41a";
r' = "bdff14e4600309c2c77f79a25963a955b5b500a7b2d34cb172cd6acd52905c7b";
s' = "b0479cdb3df79923ec36a104a129534c5d59f622be7d613aa04530ad2507d3a2";
};
] | {
"file_name": "specs/tests/p256/Spec.ECDSA.Test.Vectors.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 1,
"end_line": 604,
"start_col": 1,
"start_line": 483
} | module Spec.ECDSA.Test.Vectors
open Lib.Meta
#set-options "--fuel 0 --ifuel 0"
///
/// ECDSA test vectors from NIST CAVP
/// https://csrc.nist.gov/Projects/Cryptographic-Algorithm-Validation-Program/Digital-Signatures#ecdsa2vs
///
type vec_SigVer = {
msg: hex_string;
qx: hex_string;
qy: hex_string;
r: hex_string;
s: hex_string;
result: bool;
}
type vec_SigGen = {
msg': hex_string;
d: hex_string;
qx': hex_string;
qy': hex_string;
k: hex_string;
r': hex_string;
s': hex_string;
}
let sigver_vectors_sha2_256 : list vec_SigVer = [
{ msg = "e4796db5f785f207aa30d311693b3702821dff1168fd2e04c0836825aefd850d9aa60326d88cde1a23c7745351392ca2288d632c264f197d05cd424a30336c19fd09bb229654f0222fcb881a4b35c290a093ac159ce13409111ff0358411133c24f5b8e2090d6db6558afc36f06ca1f6ef779785adba68db27a409859fc4c4a0";
qx = "87f8f2b218f49845f6f10eec3877136269f5c1a54736dbdf69f89940cad41555";
qy = "e15f369036f49842fac7a86c8a2b0557609776814448b8f5e84aa9f4395205e9";
r = "d19ff48b324915576416097d2544f7cbdf8768b1454ad20e0baac50e211f23b0";
s = "a3e81e59311cdfff2d4784949f7a2cb50ba6c3a91fa54710568e61aca3e847c6";
result = false;
};
{ msg = "069a6e6b93dfee6df6ef6997cd80dd2182c36653cef10c655d524585655462d683877f95ecc6d6c81623d8fac4e900ed0019964094e7de91f1481989ae1873004565789cbf5dc56c62aedc63f62f3b894c9c6f7788c8ecaadc9bd0e81ad91b2b3569ea12260e93924fdddd3972af5273198f5efda0746219475017557616170e";
qx = "5cf02a00d205bdfee2016f7421807fc38ae69e6b7ccd064ee689fc1a94a9f7d2";
qy = "ec530ce3cc5c9d1af463f264d685afe2b4db4b5828d7e61b748930f3ce622a85";
r = "dc23d130c6117fb5751201455e99f36f59aba1a6a21cf2d0e7481a97451d6693";
s = "d6ce7708c18dbf35d4f8aa7240922dc6823f2e7058cbc1484fcad1599db5018c";
result = false;
};
{ msg = "df04a346cf4d0e331a6db78cca2d456d31b0a000aa51441defdb97bbeb20b94d8d746429a393ba88840d661615e07def615a342abedfa4ce912e562af714959896858af817317a840dcff85a057bb91a3c2bf90105500362754a6dd321cdd86128cfc5f04667b57aa78c112411e42da304f1012d48cd6a7052d7de44ebcc01de";
qx = "2ddfd145767883ffbb0ac003ab4a44346d08fa2570b3120dcce94562422244cb";
qy = "5f70c7d11ac2b7a435ccfbbae02c3df1ea6b532cc0e9db74f93fffca7c6f9a64";
r = "9913111cff6f20c5bf453a99cd2c2019a4e749a49724a08774d14e4c113edda8";
s = "9467cd4cd21ecb56b0cab0a9a453b43386845459127a952421f5c6382866c5cc";
result = false;
};
{ msg = "e1130af6a38ccb412a9c8d13e15dbfc9e69a16385af3c3f1e5da954fd5e7c45fd75e2b8c36699228e92840c0562fbf3772f07e17f1add56588dd45f7450e1217ad239922dd9c32695dc71ff2424ca0dec1321aa47064a044b7fe3c2b97d03ce470a592304c5ef21eed9f93da56bb232d1eeb0035f9bf0dfafdcc4606272b20a3";
qx = "e424dc61d4bb3cb7ef4344a7f8957a0c5134e16f7a67c074f82e6e12f49abf3c";
qy = "970eed7aa2bc48651545949de1dddaf0127e5965ac85d1243d6f60e7dfaee927";
r = "bf96b99aa49c705c910be33142017c642ff540c76349b9dab72f981fd9347f4f";
s = "17c55095819089c2e03b9cd415abdf12444e323075d98f31920b9e0f57ec871c";
result = true;
};
{ msg = "73c5f6a67456ae48209b5f85d1e7de7758bf235300c6ae2bdceb1dcb27a7730fb68c950b7fcada0ecc4661d3578230f225a875e69aaa17f1e71c6be5c831f22663bac63d0c7a9635edb0043ff8c6f26470f02a7bc56556f1437f06dfa27b487a6c4290d8bad38d4879b334e341ba092dde4e4ae694a9c09302e2dbf443581c08";
qx = "e0fc6a6f50e1c57475673ee54e3a57f9a49f3328e743bf52f335e3eeaa3d2864";
qy = "7f59d689c91e463607d9194d99faf316e25432870816dde63f5d4b373f12f22a";
r = "1d75830cd36f4c9aa181b2c4221e87f176b7f05b7c87824e82e396c88315c407";
s = "cb2acb01dac96efc53a32d4a0d85d0c2e48955214783ecf50a4f0414a319c05a";
result = true;
};
{ msg = "666036d9b4a2426ed6585a4e0fd931a8761451d29ab04bd7dc6d0c5b9e38e6c2b263ff6cb837bd04399de3d757c6c7005f6d7a987063cf6d7e8cb38a4bf0d74a282572bd01d0f41e3fd066e3021575f0fa04f27b700d5b7ddddf50965993c3f9c7118ed78888da7cb221849b3260592b8e632d7c51e935a0ceae15207bedd548";
qx = "a849bef575cac3c6920fbce675c3b787136209f855de19ffe2e8d29b31a5ad86";
qy = "bf5fe4f7858f9b805bd8dcc05ad5e7fb889de2f822f3d8b41694e6c55c16b471";
r = "25acc3aa9d9e84c7abf08f73fa4195acc506491d6fc37cb9074528a7db87b9d6";
s = "9b21d5b5259ed3f2ef07dfec6cc90d3a37855d1ce122a85ba6a333f307d31537";
result = false;
};
{ msg = "7e80436bce57339ce8da1b5660149a20240b146d108deef3ec5da4ae256f8f894edcbbc57b34ce37089c0daa17f0c46cd82b5a1599314fd79d2fd2f446bd5a25b8e32fcf05b76d644573a6df4ad1dfea707b479d97237a346f1ec632ea5660efb57e8717a8628d7f82af50a4e84b11f21bdff6839196a880ae20b2a0918d58cd";
qx = "3dfb6f40f2471b29b77fdccba72d37c21bba019efa40c1c8f91ec405d7dcc5df";
qy = "f22f953f1e395a52ead7f3ae3fc47451b438117b1e04d613bc8555b7d6e6d1bb";
r = "548886278e5ec26bed811dbb72db1e154b6f17be70deb1b210107decb1ec2a5a";
s = "e93bfebd2f14f3d827ca32b464be6e69187f5edbd52def4f96599c37d58eee75";
result = false;
};
{ msg = "1669bfb657fdc62c3ddd63269787fc1c969f1850fb04c933dda063ef74a56ce13e3a649700820f0061efabf849a85d474326c8a541d99830eea8131eaea584f22d88c353965dabcdc4bf6b55949fd529507dfb803ab6b480cd73ca0ba00ca19c438849e2cea262a1c57d8f81cd257fb58e19dec7904da97d8386e87b84948169";
qx = "69b7667056e1e11d6caf6e45643f8b21e7a4bebda463c7fdbc13bc98efbd0214";
qy = "d3f9b12eb46c7c6fda0da3fc85bc1fd831557f9abc902a3be3cb3e8be7d1aa2f";
r = "288f7a1cd391842cce21f00e6f15471c04dc182fe4b14d92dc18910879799790";
s = "247b3c4e89a3bcadfea73c7bfd361def43715fa382b8c3edf4ae15d6e55e9979";
result = false;
};
{ msg = "3fe60dd9ad6caccf5a6f583b3ae65953563446c4510b70da115ffaa0ba04c076115c7043ab8733403cd69c7d14c212c655c07b43a7c71b9a4cffe22c2684788ec6870dc2013f269172c822256f9e7cc674791bf2d8486c0f5684283e1649576efc982ede17c7b74b214754d70402fb4bb45ad086cf2cf76b3d63f7fce39ac970";
qx = "bf02cbcf6d8cc26e91766d8af0b164fc5968535e84c158eb3bc4e2d79c3cc682";
qy = "069ba6cb06b49d60812066afa16ecf7b51352f2c03bd93ec220822b1f3dfba03";
r = "f5acb06c59c2b4927fb852faa07faf4b1852bbb5d06840935e849c4d293d1bad";
s = "049dab79c89cc02f1484c437f523e080a75f134917fda752f2d5ca397addfe5d";
result = false;
};
{ msg = "983a71b9994d95e876d84d28946a041f8f0a3f544cfcc055496580f1dfd4e312a2ad418fe69dbc61db230cc0c0ed97e360abab7d6ff4b81ee970a7e97466acfd9644f828ffec538abc383d0e92326d1c88c55e1f46a668a039beaa1be631a89129938c00a81a3ae46d4aecbf9707f764dbaccea3ef7665e4c4307fa0b0a3075c";
qx = "224a4d65b958f6d6afb2904863efd2a734b31798884801fcab5a590f4d6da9de";
qy = "178d51fddada62806f097aa615d33b8f2404e6b1479f5fd4859d595734d6d2b9";
r = "87b93ee2fecfda54deb8dff8e426f3c72c8864991f8ec2b3205bb3b416de93d2";
s = "4044a24df85be0cc76f21a4430b75b8e77b932a87f51e4eccbc45c263ebf8f66";
result = false;
};
{ msg = "4a8c071ac4fd0d52faa407b0fe5dab759f7394a5832127f2a3498f34aac287339e043b4ffa79528faf199dc917f7b066ad65505dab0e11e6948515052ce20cfdb892ffb8aa9bf3f1aa5be30a5bbe85823bddf70b39fd7ebd4a93a2f75472c1d4f606247a9821f1a8c45a6cb80545de2e0c6c0174e2392088c754e9c8443eb5af";
qx = "43691c7795a57ead8c5c68536fe934538d46f12889680a9cb6d055a066228369";
qy = "f8790110b3c3b281aa1eae037d4f1234aff587d903d93ba3af225c27ddc9ccac";
r = "8acd62e8c262fa50dd9840480969f4ef70f218ebf8ef9584f199031132c6b1ce";
s = "cfca7ed3d4347fb2a29e526b43c348ae1ce6c60d44f3191b6d8ea3a2d9c92154";
result = false;
};
{ msg = "0a3a12c3084c865daf1d302c78215d39bfe0b8bf28272b3c0b74beb4b7409db0718239de700785581514321c6440a4bbaea4c76fa47401e151e68cb6c29017f0bce4631290af5ea5e2bf3ed742ae110b04ade83a5dbd7358f29a85938e23d87ac8233072b79c94670ff0959f9c7f4517862ff829452096c78f5f2e9a7e4e9216";
qx = "9157dbfcf8cf385f5bb1568ad5c6e2a8652ba6dfc63bc1753edf5268cb7eb596";
qy = "972570f4313d47fc96f7c02d5594d77d46f91e949808825b3d31f029e8296405";
r = "dfaea6f297fa320b707866125c2a7d5d515b51a503bee817de9faa343cc48eeb";
s = "8f780ad713f9c3e5a4f7fa4c519833dfefc6a7432389b1e4af463961f09764f2";
result = false;
};
{ msg = "785d07a3c54f63dca11f5d1a5f496ee2c2f9288e55007e666c78b007d95cc28581dce51f490b30fa73dc9e2d45d075d7e3a95fb8a9e1465ad191904124160b7c60fa720ef4ef1c5d2998f40570ae2a870ef3e894c2bc617d8a1dc85c3c55774928c38789b4e661349d3f84d2441a3b856a76949b9f1f80bc161648a1cad5588e";
qx = "072b10c081a4c1713a294f248aef850e297991aca47fa96a7470abe3b8acfdda";
qy = "9581145cca04a0fb94cedce752c8f0370861916d2a94e7c647c5373ce6a4c8f5";
r = "09f5483eccec80f9d104815a1be9cc1a8e5b12b6eb482a65c6907b7480cf4f19";
s = "a4f90e560c5e4eb8696cb276e5165b6a9d486345dedfb094a76e8442d026378d";
result = false;
};
{ msg = "76f987ec5448dd72219bd30bf6b66b0775c80b394851a43ff1f537f140a6e7229ef8cd72ad58b1d2d20298539d6347dd5598812bc65323aceaf05228f738b5ad3e8d9fe4100fd767c2f098c77cb99c2992843ba3eed91d32444f3b6db6cd212dd4e5609548f4bb62812a920f6e2bf1581be1ebeebdd06ec4e971862cc42055ca";
qx = "09308ea5bfad6e5adf408634b3d5ce9240d35442f7fe116452aaec0d25be8c24";
qy = "f40c93e023ef494b1c3079b2d10ef67f3170740495ce2cc57f8ee4b0618b8ee5";
r = "5cc8aa7c35743ec0c23dde88dabd5e4fcd0192d2116f6926fef788cddb754e73";
s = "9c9c045ebaa1b828c32f82ace0d18daebf5e156eb7cbfdc1eff4399a8a900ae7";
result = false;
};
{ msg = "60cd64b2cd2be6c33859b94875120361a24085f3765cb8b2bf11e026fa9d8855dbe435acf7882e84f3c7857f96e2baab4d9afe4588e4a82e17a78827bfdb5ddbd1c211fbc2e6d884cddd7cb9d90d5bf4a7311b83f352508033812c776a0e00c003c7e0d628e50736c7512df0acfa9f2320bd102229f46495ae6d0857cc452a84";
qx = "2d98ea01f754d34bbc3003df5050200abf445ec728556d7ed7d5c54c55552b6d";
qy = "9b52672742d637a32add056dfd6d8792f2a33c2e69dafabea09b960bc61e230a";
r = "06108e525f845d0155bf60193222b3219c98e3d49424c2fb2a0987f825c17959";
s = "62b5cdd591e5b507e560167ba8f6f7cda74673eb315680cb89ccbc4eec477dce";
result = true;
};
]
let sigver_vectors_sha2_384 : list vec_SigVer = [
{ msg = "fe9838f007bdc6afcd626974fcc6833f06b6fd970427b962d75c2aeadbef386bec8d018106197fe2547d2af02e7a7949965d5fbc4c5db909a95b9858426a33c080b0b25dae8b56c5cbc6c4eec3dbd81635c79457eaef4fab39e662a1d05b2481eda8c1074ae2d1704c8a3f769686a1f965ef3c87602efc288c7f9ff8cd5e22a4";
qx = "40ded13dbbe72c629c38f07f7f95cf75a50e2a524897604c84fafde5e4cafb9f";
qy = "a17202e92d7d6a37c438779349fd79567d75a40ef22b7d09ca21ccf4aec9a66c";
r = "be34730c31730b4e412e6c52c23edbd36583ace2102b39afa11d24b6848cb77f";
s = "03655202d5fd8c9e3ae971b6f080640c406112fd95e7015874e9b6ee77752b10";
result = false;
};
{ msg = "b69043b9b331da392b5dd689142dfc72324265da08f14abcedf03ad8263e6bdccbc75098a2700bbba1979de84c8f12891aa0d000f8a1abad7dde4981533f21da59cc80d9cf94517f3b61d1a7d9eecb2fcf052e1fc9e7188c031b86305e4a436a37948071f046e306befb8511dc03a53dc8769a90a86e9b4fdbf05dcdfa35ab73";
qx = "1f80e19ffeb51dd74f1c397ac3dfd3415ab16ebd0847ed119e6c3b15a1a884b8";
qy = "9b395787371dbfb55d1347d7bed1c261d2908121fb78de1d1bf2d00666a62aed";
r = "249ca2c3eb6e04ac57334c2f75dc5e658bbb485bf187100774f5099dd13ef707";
s = "97363a05202b602d13166346694e38135bbce025be94950e9233f4c8013bf5bf";
result = false;
};
{ msg = "d2fcaaede8b879c064b0aa46e68efc278a469b80a7f7e1939ec2ebc96c76206f23395967279c181fea157ebb79dfadc68e31345f07f13305c80de0d85e4330d3a45f957c5c2526b945838ce5a9c2844b6b2a665c0f70b748b1213a8cf20ba5dbdf8cab231f433da522104a5cd027d3e36bb373c4ed404d9af0cbec6f85ec2193";
qx = "ce4dcfa7384c83443ace0fb82c4ac1adfa100a9b2c7bf09f093f8b6d084e50c2";
qy = "d98ae7b91abee648d0bfde192703741ac21daad7262af418b50e406d825eb0d6";
r = "597e1e04d93a6b444ccc447a48651f17657ff43fb65fe94461d2bf816b01af40";
s = "359fe3817963548e676d6da34c2d0866aa42499237b682002889eaf8893814d2";
result = true;
};
{ msg = "06cd86481865181cef7acdc3202824970ec2d97662b519c4b588dc9e51617c068282b1a11a15bf7efc4858a2f37a3d74b05fb5790eb68338c8009b4da9b4270514d387a2e016a99ee109841e884a7909504ef31a5454e214663f830f23a5a76f91402fca5f5d61699fa874597bdbfb1ecff8f07ddbd07ef61e97d0d5262ef314";
qx = "1b677f535ac69d1acd4592c0d12fac13c9131e5a6f8ab4f9d0afdcb3a3f327e0";
qy = "5dca2c73ec89e58ef8267cba2bb5eb0f551f412f9dc087c1a6944f0ce475277a";
r = "df0b0cd76d2555d4c38b3d70bfdf964884d0beeb9f74385f0893e87d20c9642d";
s = "128299aabf1f5496112be1fe04365f5f8215b08a040abdfeca4626f4d15c005b";
result = false;
};
{ msg = "59ad297397f3503604a4a2d098a4f00a368ad95c6101b3d38f9d49d908776c5a6c8654b006adb7939ffb6c30afa325b54185d82c3cc0d836850dce54d3408b257c3a961d11fafe2b74ba8bddfc1102fa656d1028baf94c38340c26a11e992aab71ce3732271b767358671b25225926f3a4b9ec5f82c059f0c7d1446d5d9e4251";
qx = "7ffc2853f3e17887dda13b0eb43f183ce50a5ac0f8bba75fb1921172484f9b94";
qy = "4cc523d14192f80bd5b27d30b3b41e064da87bfbae15572dd382b9a176c123a2";
r = "3156176d52eb26f9391229de4251993a41b8172f78970bb70e32a245be4bb653";
s = "62827a29e12d2f29b00fb2d02dd5f2d5412e17a4455f4431a5c996881fdfc0ee";
result = false;
};
{ msg = "8215daca87e689a20392646a6511bb7b5a82d2d995ca9de89bd9d9c0b11464b7cb1e4e9a31e3e01ad8c2cd613d5a2cb44a2a8df6899fce4c282dea1e41af0df6c36be1f320036567f8d0d32aaa79c95fe53b16668f7e1a9e5d7d039ea260fd03711b7d1c177355fc52244d49ca5b238556a5541349014683cb7da326f443b752";
qx = "5569f76dc94243cde819fb6fc85144ec67e2b5d49539f62e24d406d1b68f0058";
qy = "1208c38dbe25870deab53c486f793a1e250c9d1b8e7c147ea68b71196c440730";
r = "706f2ba4025e7c06b66d6369a3f93b2fec46c51eceff42a158f7431919506cfb";
s = "b4e75ac34a96393237fc4337789e37168d79382705b248051c9c72bcbac5f516";
result = false;
};
{ msg = "a996b1fb800f692517a2eb80e837233193dd3e82484d3f49bd19ee0db8f7b440876b07e384c90aa8b9f7b6603ca0b5a4e06c1da0edb974a2fb9b6e7c720ddf3e5c0e314c2d189402903c08c0836776c361a284db887ebcc33e615de9720b01dadade585eef687b3346468bdafb490e56d657a9e7d44d92014069005a36c1cf63";
qx = "e4b470c65b2c04db060d7105ec6911589863d3c7f7ce48726ba3f369ea3467e8";
qy = "44c38d3ae098de05f5915a5868c17fee296a6e150beb1f000df5f3bec8fc4532";
r = "c9c347ee5717e4c759ddaf09e86f4e1db2c8658593177cfda4e6514b5e3ecb87";
s = "baae01e9e44a7b04d69c8eaaed77c9e3a36ce8962f95cc50a0db146b4e49eb40";
result = false;
};
{ msg = "1a6e49a377a08e992353d6acc557b687b1b69a41d83d43a75fadb97b8c928cfebadebaaf99ea7fb13148807f56ea17384a7912e578e62b1b009fefb2aafca5ac85539433619b286f10643a56f8dfa47ba4d01c02510deaec18029ea6b9682022b139dcb70814164c4c90ec717ad9d925485398531cdd5992a2524498b337f97d";
qx = "96050c5fa2ddd1b2e5451d89ee74a0b7b54347364ddc0231715a6ef1146fe8dc";
qy = "e0888a9e78aeea87f6e1e9002b2651169f36c4ee53013cfc8c9912b7fd504858";
r = "2353d6cd3c21b8ea7dbc1cd940519812dbe365a3b15cd6aebba9d11cf269867a";
s = "85f560273cd9e82e6801e4cb1c8cd29cdac34a020da211d77453756b604b8fa7";
result = true;
};
{ msg = "3e14f737c913931bc82764ebc440b12e3ce1ffe0f858c7b8f1cbd30fbbb1644fa59be1d2cca5f64a6d7dc5ed5c4420f39227516ae8eb3019ef86274d0e4d06cde7bf5e5c413243dfc421d9f141762109810e6b6a451eeb4bd8d4be1ff111426d7e44d0a916b4fe3db3594d8dd01ae90feecf8f1e230b574180cd0b8d43a3d33b";
qx = "0c07bb79f44012299fbfd5a0f31397aaf7d757f8a38437407c1b09271c6551a0";
qy = "84fe7846d5d403dc92c0091fbd39f3c5cbca3f94c10b5cae44e2e96562131b13";
r = "49e9425f82d0a8c503009cead24e12adc9d48a08594094ca4f6d13ad1e3c571d";
s = "1f1b70aaa30a8ff639aa0935944e9b88326a213ab8fce5194c1a9dec070eb433";
result = false;
};
{ msg = "4000106127a72746db77957cbc6bfd84ae3d1d63b8190087637e93689841331e2adc1930d6df4302935f4520bbee513505cdcfca99ebc6f83af7b23b0f2e7f7defba614022ceeae9c6886e8b13f7ea253a307ac301f3536720cbe3de82ba3e98310361b61801a8304ffc91ff774948e33176ddcddf1b76437b3f02c910578d46";
qx = "71db1de1a1f38f356c91feaff5cfe395d1a5b9d23cf6aa19f38ae0bcc90a486d";
qy = "ecdd6ffb174a50f1cc792985c2f9608c399c98b8a64a69d2b5b7cdd9241f67e2";
r = "b0443b33a6f249470d2f943675009d21b9ccbead1525ae57815df86bb20470bf";
s = "316dbee27d998e09128539c269e297ac8f34b9ef8249a0619168c3495c5c1198";
result = false;
};
{ msg = "b42e547d0e7ddd5e1069bb2d158a5b4d5d9c4310942a1bfd09490311a6e684bd3c29b0dcef86a9788b4b26fed7863f3d5e5439796b5b5ffe7aa2545d0f518ad020689ca21230f3a59e7f8cca465fe21df511e78d215fa805f5f0f88938e9d198515e6b9c819930755c6c6aea5114cd2904607243051c09dd7a147756cbc204a5";
qx = "8219b225aa15472262c648cac8de9aad4173d17a231ba24352a5a1c4eea70fad";
qy = "0fee2b08ad39fbf0db0016ef2896ca99adc07efc8c415f640f3720498be26037";
r = "134fb689101aaad3954de2819d9fbd12072fe2bc36f496bbf0d13fa72114ab96";
s = "e65c232bd915b59e087e7fd5ec90bf636cfa80526345c79a0adfd75003045d6f";
result = false;
};
{ msg = "aa563223a7d5201febdf13cab80a03dce6077c26e751bc98a941196a28848abc495e0324013c9a2094fb15dc65d100c3e8a136a52c1780b395f42588900b641b6d4361432e2173195a2f60189f3fcc85f4e9659cae52576f20d1852d43c2b400deea3144c8e870e1906d677425d8c85037c7a42a9d249b2da4b516e04476bd45";
qx = "c934195de33b60cf00461fc3c45dad068e9f5f7af5c7fa78591e95aeb04e2617";
qy = "b588dd5f9965fdaa523b475c2812c251bc6973e2df21d9beaace976abf5728cb";
r = "71f302440eb4ed2a939b69e33e905e6fdc545c743458d38f7e1a1d456e35f389";
s = "54eaa0eb9cd7503b19a9658f0a04955d9f0ab20ebc8a0877e33c89ee88ad068f";
result = false;
};
{ msg = "98e4babf890f52e5a04bd2a7d79bf0ae9a71967847347d87f29fb3997454c73c7979d15b5c4f4205ec3de7835d1885fb7abcf8dcde94baf08b1d691a0c74845317286540e8c9d378fefaa4762c302492f51023c0d7adbb1cc90b7b0335f11203664e71fea621bc2f59d2dbd0ee76d6597ec75510de59b6d25fa6750a71c59435";
qx = "9e1adcd48e2e3f0e4c213501808228e587c40558f52bb54ddbb6102d4048ea92";
qy = "34eff98704790938e7e0bdf87ae39807a6b77dfdc9ecdfe6dd0f241abae1aeb2";
r = "ce4f0d7480522c8dd1b02dd0eb382f22406642f038c1ede9411883d72b3e7ed0";
s = "8546e1ee3b77f9927cdaccbc2f1cf19d6b5576b0f738bb1b86a0c66b39ca56fb";
result = false;
};
{ msg = "bb6b03ad60d6ddbf0c4d17246206e61c886f916d252bb4608149da49cef9033484080e861f91bb2400baa0cd6c5d90c2f275e2fabc12d83847f7a1c3ff0eb40c8a3dd83d07d194ba3797d27238415a2f358d7292a1991af687bcb977486980f9138b3140321485638ac7bd22ecda00ffe5009b83b90397eff24ecf22c5495d67";
qx = "93edbecb0b019c2cc03060f54cb4904b920fdb34eb83badd752be9443036ae13";
qy = "b494e9295e080a9080fe7e73249b3a5904aa84e1c028121eecd3e2cf1a55f598";
r = "eec2986d47b71995892b0915d3d5becc4dcb2ab55206d772e0189541b2184ddf";
s = "8a6c1edeb6452627ad27c8319599c54ac44cdd831ea66f13f49d90affe6ad45b";
result = true;
};
{ msg = "33a5d489f671f396c776bc1acf193bc9a74306f4692dd8e05bcdfe28fdefbd5c09b831c204a1dec81d8e3541f324f7b474d692789013bb1eca066f82fbf3f1cf3ba64e9d8963e9ecc180b9251919e2e8a1ab05847a0d76ff67a47c00e170e38e5b319a56f59cc51038f90961ea27a9a7eb292a0a1aa2f4972568669246907a35";
qx = "3205bae876f9bd50b0713959e72457165e826cbbe3895d67320909daa48b0ebc";
qy = "d1592562273e5e0f57bbfb92cedd9af7f133255684ee050af9b6f02019bbcafa";
r = "0124f3f1c61ec458561a4eaa6c155bd29e59703d14556324924683db3a4cf43b";
s = "688a5c5fc0c7ba92210c50cce5b512a468a880e05acc21ca56571d89f45f603a";
result = false;
};
]
let sigver_vectors_sha2_512 : list vec_SigVer = [
{ msg = "273b063224ab48a1bf6c7efc93429d1f89de48fc4a4fa3ffe7a49ebba1a58ff5d208a9e4bff27b418252526243ba042d1605b6df3c2ec916ceef027853a41137f7bfb6fc63844de95f58e82b9ad2565f1367d2c69bd29100f6db21a8ab7ab58affd1661add0322bd915721378df9fa233ef0b7e0a0a85be31689e21891ec8977";
qx = "484e31e69ef70bb8527853c22c6b6b4cd2a51311dde66c7b63f097dbb6ab27bf";
qy = "e1ff8177f4061d4fbbacbbc70519f0fc8c8b6053d72af0fe4f048d615004f74e";
r = "91a303d8fe3ab4176070f6406267f6b79bfe5eb5f62ae6aeb374d90667858518";
s = "e152119cefa26826ea07ec40a428869132d70812c5578c5a260e48d6800e046a";
result = false;
};
{ msg = "d64ea1a768b0de29ab018ae93baa645d078c70a2f7aa4acd4ae7526538ebd5f697a11927cfd0ddc9187c095f14ad30544cb63ede9353af8b23c18ce22843881fe2d7bde748fc69085921677858d87d2dc3e244f6c7e2c2b2bd791f450dfdd4ff0ddd35ab2ada4f1b90ab16ef2bf63b3fbe88ce8a5d5bb85430740d3744849c13";
qx = "8b75fc0129c9a78f8395c63ae9694b05cd6950665cf5da7d66118de451422624";
qy = "b394171981d4896d6e1b4ef2336d9befe7d27e1eb87f1c14b8ddda622af379dc";
r = "17e298e67ad2af76f6892fdcead00a88256573868f79dc74431b55103058f0b0";
s = "881328cd91e43d30133f6e471e0b9b04353b17893fb7614fd7333d812a3df6b4";
result = false;
};
{ msg = "1db85445c9d8d1478a97dd9d6ffbf11ebcd2114d2ed4e8b6811171d947e7d4daedea35af6177debe2ef6d93f94ff9d770b45d458e91deb4eef59856425d7b00291aff9b6c9fa02375ec1a06f71f7548721790023301cf6ac7fee1d451228106ef4472681e652c8cd59b15d6d16f1e13440d888e265817cb4a654f7246e0980df";
qx = "76e51086e078b2b116fd1e9c6fa3d53f675ae40252fb9f0cc62817bd9ce8831d";
qy = "ca7e609a0b1d14b7c9249b53da0b2050450e2a25cb6c8f81c5311974a7efb576";
r = "23b653faaa7d4552388771931803ce939dd5ee62d3fa72b019be1b2272c85592";
s = "a03c6f5c54a10861d6b8922821708e9306fd6d5d10d566845a106539cbf4fadd";
result = false;
};
{ msg = "918d9f420e927b3e0a55d276b8b40d8a2c5df748727ff72a438c7e6593f542274050dce727980d3ef90c8aa5c13d53f1e8d631ebb650dee11b94902bbd7c92b8186af9039c56c43f3110697792c8cd1614166f06d09cdb58dab168cc3680a8473b1a623bf85dba855eace579d9410d2c4ca5ede6dc1e3db81e233c34ae922f49";
qx = "bc7c8e09bd093468f706740a4130c544374fdc924a535ef02e9d3be6c6d3bbfa";
qy = "af3f813ae6646f5b6dbfb0f261fd42537705c800bb1647386343428a9f2e10fc";
r = "6bd7ce95af25abfbf14aef4b17392f1da877ab562eca38d785fe39682e9c9324";
s = "6688bea20c87bab34d420642da9bdd4c69456bdec50835887367bb4fb7cd8650";
result = false;
};
{ msg = "6e2932153301a4eef680e6428929adae988c108d668a31ff55d0489947d75ff81a46bf89e84d6401f023be6e87688fbcd784d785ca846735524acb52d00452c84040a479e7cc330936441d93bbe722a9432a6e1db112b5c9403b10272cb1347fd619d463f7a9d223ad76fde06d8a6883500fb843235abff98e241bdfb5538c3e";
qx = "9cb0cf69303dafc761d4e4687b4ecf039e6d34ab964af80810d8d558a4a8d6f7";
qy = "2d51233a1788920a86ee08a1962c79efa317fb7879e297dad2146db995fa1c78";
r = "4b9f91e4285287261a1d1c923cf619cd52c175cfe7f1be60a5258c610348ba3d";
s = "28c45f901d71c41b298638ec0d6a85d7fcb0c33bbfec5a9c810846b639289a84";
result = true;
};
{ msg = "2f48ec387f181035b350772e27f478ae6ec7487923692fae217e0f8636acd062a6ac39f7435f27a0ebcfd8187a91ef00fb68d106b8da4a1dedc5a40a4fae709e92b00fcc218de76417d75185e59dff76ec1543fb429d87c2ca8134ff5ae9b45456cad93fc67223c68293231395287dc0b756355660721a1f5df83bf5bcb8456e";
qx = "e31096c2d512fbf84f81e9bdb16f33121702897605b43a3db546f8fb695b5f6f";
qy = "6fbec6a04a8c59d61c900a851d8bf8522187d3ec2637b10fa8f377689e086bba";
r = "1b244c21c08c0c0a10477fb7a21382d405b95c755088292859ca0e71bab68361";
s = "852f4cbfd346e90f404e1dd5c4b2c1debca3ea1abefe8400685d703aea6c5c7f";
result = false;
};
{ msg = "fd2e5de421ee46c9fe6290a33f95b394bd5b7762f23178f7f6834f1f056fa9a8831446403c098ff4dd764173f974be4c89d376119613a4a1890f6fc2ddff862bda292dd49f5410d9b1cfe1d97ef4582b6152494372fc083885f540c01f86d780e6f3e75a954af2190fdae9604e3f8ab32ab0292dc0d790bd2627e37b4b4885df";
qx = "633c2ee5630b62c9ce839efd4d485a6d35e8b9430d264ffe501d28dbace79123";
qy = "4b668a1a6d1a25b089f75c2bd8d8c6a9a14fe7b729f45a82565da2e866e2c490";
r = "bf2111c93ec055a7eda90c106fce494fd866045634fd2aa28d6e018f9106994e";
s = "86b0341208a0aa55edecfd272f49cb34408ce54b7febc1d0a1c2ce77ab6988f8";
result = false;
};
{ msg = "4bc2d9a898395b12701635f1048fbfd263ec115e4150532b034d59e625238f4ed32619744c612e35ac5a23bee8d5f5651641a492217d305e5051321c273647f14bc7c4afab518554e01c82d6fc1694c8bdbeb326bb607bcaf5436303bc09f64c02c6ec50de409a484f5237f7d34e2651ada7ec429ca3b99dd87c6015d2f4b342";
qx = "f78dce40d1cb8c4af2749bf22c6f8a9a470b1e41112796215dd017e57df1b38a";
qy = "61b29b0bc03dff7fa00613b4de1e2317cfbf2badd50dee3376c032a887c5b865";
r = "4a96169a5dea36a2594011537ee0dc19e8f9f74e82c07434079447155a830152";
s = "a204eaa4e97d7553a1521d9f6baadc0b6d6183ba0f385d8593d6ca83607c4d82";
result = false;
};
{ msg = "d3356a683417508a9b913643e6ceac1281ef583f428968f9d2b6540a189d7041c477da8d207d0529720f70dab6b0da8c2168837476c1c6b63b517ed3cad48ae331cf716ecf47a0f7d00b57073ac6a4749716d49d80c4d46261d38e2e34b4f43e0f20b280842f6e3ea34fefdddfb9fa2a040ffe915e8784cfdb29b3364a34ca62";
qx = "3fcc3b3e1b103fe435ac214c756bdaad309389e1c803e6d84bbbc27039fcf900";
qy = "7f09edd1ec87a6d36dc81c1528d52a62776e666c274415a9f441d6a8df6b9237";
r = "1cac13f277354456ae67ab09b09e07eb1af2a2bf45108da70f5c8c6a4cbcd538";
s = "5d83752e540525602ba7e6fee4d4263f3eda59e67df20aac79ca67e8899fed0d";
result = false;
};
{ msg = "d7f5da9f4cf9299b7f86c52b88364ce28fe9ada55dd551a1018790f9e1205e2405ac62429d65093f74ec35a16d9f195c993cd4eb8dc0aa0dabb70a503321d8a9649160d6b3d0a0854bb68c4c39693f592ef5dd478aa2432d0865d87d48b3aea9c7d7d114165c9200e4e8d7bd02a7895ec4418e6f2fed6b244bf66209039e98a9";
qx = "5ec702d43a67ada86efbfc136cf16d96078906954a3f1f9e440674cd907e4676";
qy = "05a62044fed8470dd4fca38d89d583ce36d50d28b66ab0b51922b21da92c56d9";
r = "75f3037298f1457dba55743999976a1c2636b2b8ab2ed3df4736a6d2934acc83";
s = "19d43ad168dda1bb8ac423f8f08876515234b3d841e57faef1b5ab27359b27ef";
result = false;
};
{ msg = "68f4b444e1cc2025e8ff55e8046ead735e6e317082edf7ce65e83573501cb92c408c1c1c6c4fcca6b96ad34224f17b20be471cc9f4f97f0a5b7bfae9558bdb2ecb6e452bb743603724273d9e8d2ca22afdda35c8a371b28153d772303e4a25dc4f28e9a6dc9635331450f5af290dfa3431c3c08b91d5c97284361c03ec78f1bc";
qx = "f63afe99e1b5fc652782f86b59926af22e6072be93390fe41f541204f9c935d1";
qy = "f6e19ce5935e336183c21becf66596b8f559d2d02ee282aa87a7d6f936f7260c";
r = "cef4831e4515c77ca062282614b54a11b7dc4057e6997685c2fbfa95b392bf72";
s = "f20dc01bf38e1344ba675a22239d9893b3a3e33d9a403329a3d21650e9125b75";
result = true;
};
{ msg = "e75be05be0aaf70719b488b89aaae9008707ca528994461db7130c4368575a024bf0981c305d61265e8b97599ec35c03badd1256b80d6bf70547ad6089b983e3bcc3481828f3259e43e655e177fc423fd7e066bd3ed68d81df84f773c0f9e5f8bf4469960b8b4d7b2a372fd0edd3521f6be670908f2d90a343f416358ea70e7e";
qx = "6d11b09d2767cf8d275faee746c203486259f66dd2bfa3a65c39371a66b23385";
qy = "4eb05c73e05261e979182833f20311e5366f72f4b949665ff294f959375534c6";
r = "15a697cdb614e11c0810e1e764cd501fcabc70874c957587bc4883d9438e177f";
s = "7bf6244f92bc768063cecb5336c8eaacd23db930b28703560f241c7d93950dfd";
result = false;
};
{ msg = "0dc4a3eab66bd2e703a8fff566c34d466f9823ae42bd2104f61a6b051c0b017833fcef4d609d137ad97c209c80eebe252857aa7fafc35f16000a2bd4b4be0fa83b6e229eddfd180101f1f40d0453148053d8306833df64d59599b90194b55541d7f22dd589da9f7be519cbbb9db416c71bfe40ec090b5b7a600eec29bfd47306";
qx = "f3899caba038efb534c4cea0bd276814ffd80194473c903b81af11c8c05cb6e6";
qy = "6ea6b17402fcf2e8e737d11ffc7c2ed3b2d0bc3b8f271a381f4294cff62682c3";
r = "57b99380452e1d37b133c49b9ba493dee8630940477ca3351a43d90b99871e6a";
s = "df599c3a37105af3ecc159b3b685ccb3e151b7d5cf2d97147974ae71f466b615";
result = false;
};
{ msg = "d55e5e124a7217879ca986f285e22ac51940b35959bbf5543104b5547356fd1a0ec37c0a23209004a2ec5bcaf3335bc45e4dc990eacd29b2d9b5cf349c7ba67711356299bceab6f048df761c65f2988803133d6723a2820fefb2654cc7c5f032f833ba78a34d2878c6b0ba654ebe26b110c935abb56024bd5d0f09b367724c07";
qx = "1fd6f4b98d0755291e7a230e9f81ecf909e6350aadb08e42a3262ff19200fbd2";
qy = "5578fef79bc477acfb8ed0dc10c4f5809c14dc5492405b3792a7940650b305d7";
r = "97a99e96e407b3ada2c2dcf9ceeeb984d9a4d0aa66ddf0a74ca23cabfb1566cc";
s = "0ecac315dc199cfea3c15348c130924a1f787019fe4cd3ae47ca8b111268754a";
result = false;
};
{ msg = "7753c03b4202cb38bc0190a9f931eb31858d705d92d650320ff449fc99167fb3770b764c8988f6b34ac5a3d507a10e0aff7f88293f6a22c7ed8a24248a52dc125e416e158833fc38af29199f8ca4931068d4ccaa87e299e95642068f68c208cb782df13908f950564743ed1692502bafafaff169dc8fe674fb5e4f3ffd578c35";
qx = "2dcbd8790cee552e9f18f2b3149a2252dcd58b99ca7dc9680b92c8c43aa33874";
qy = "5dbc8bb8813c8e019d80e19acdb0792f537980fecde93db621aaf1f6d0e6ee34";
r = "2bdbd8b0d759595662cc10b10236136ef6ce429641f68cf6480f472fcc77bc9f";
s = "7e7df0c8b86f7db06caf1610166f7b9c4c75447f991d5aaf4dea720c25985c8c";
result = true;
};
]
let siggen_vectors_sha2_256 : list vec_SigGen = [
{ msg' = "5905238877c77421f73e43ee3da6f2d9e2ccad5fc942dcec0cbd25482935faaf416983fe165b1a045ee2bcd2e6dca3bdf46c4310a7461f9a37960ca672d3feb5473e253605fb1ddfd28065b53cb5858a8ad28175bf9bd386a5e471ea7a65c17cc934a9d791e91491eb3754d03799790fe2d308d16146d5c9b0d0debd97d79ce8";
d = "519b423d715f8b581f4fa8ee59f4771a5b44c8130b4e3eacca54a56dda72b464";
qx' = "1ccbe91c075fc7f4f033bfa248db8fccd3565de94bbfb12f3c59ff46c271bf83";
qy' = "ce4014c68811f9a21a1fdb2c0e6113e06db7ca93b7404e78dc7ccd5ca89a4ca9";
k = "94a1bbb14b906a61a280f245f9e93c7f3b4a6247824f5d33b9670787642a68de";
r' = "f3ac8061b514795b8843e3d6629527ed2afd6b1f6a555a7acabb5e6f79c8c2ac";
s' = "8bf77819ca05a6b2786c76262bf7371cef97b218e96f175a3ccdda2acc058903";
};
{ msg' = "c35e2f092553c55772926bdbe87c9796827d17024dbb9233a545366e2e5987dd344deb72df987144b8c6c43bc41b654b94cc856e16b96d7a821c8ec039b503e3d86728c494a967d83011a0e090b5d54cd47f4e366c0912bc808fbb2ea96efac88fb3ebec9342738e225f7c7c2b011ce375b56621a20642b4d36e060db4524af1";
d = "0f56db78ca460b055c500064824bed999a25aaf48ebb519ac201537b85479813";
qx' = "e266ddfdc12668db30d4ca3e8f7749432c416044f2d2b8c10bf3d4012aeffa8a";
qy' = "bfa86404a2e9ffe67d47c587ef7a97a7f456b863b4d02cfc6928973ab5b1cb39";
k = "6d3e71882c3b83b156bb14e0ab184aa9fb728068d3ae9fac421187ae0b2f34c6";
r' = "976d3a4e9d23326dc0baa9fa560b7c4e53f42864f508483a6473b6a11079b2db";
s' = "1b766e9ceb71ba6c01dcd46e0af462cd4cfa652ae5017d4555b8eeefe36e1932";
};
{ msg' = "3c054e333a94259c36af09ab5b4ff9beb3492f8d5b4282d16801daccb29f70fe61a0b37ffef5c04cd1b70e85b1f549a1c4dc672985e50f43ea037efa9964f096b5f62f7ffdf8d6bfb2cc859558f5a393cb949dbd48f269343b5263dcdb9c556eca074f2e98e6d94c2c29a677afaf806edf79b15a3fcd46e7067b7669f83188ee";
d = "e283871239837e13b95f789e6e1af63bf61c918c992e62bca040d64cad1fc2ef";
qx' = "74ccd8a62fba0e667c50929a53f78c21b8ff0c3c737b0b40b1750b2302b0bde8";
qy' = "29074e21f3a0ef88b9efdf10d06aa4c295cc1671f758ca0e4cd108803d0f2614";
k = "ad5e887eb2b380b8d8280ad6e5ff8a60f4d26243e0124c2f31a297b5d0835de2";
r' = "35fb60f5ca0f3ca08542fb3cc641c8263a2cab7a90ee6a5e1583fac2bb6f6bd1";
s' = "ee59d81bc9db1055cc0ed97b159d8784af04e98511d0a9a407b99bb292572e96";
};
{ msg' = "0989122410d522af64ceb07da2c865219046b4c3d9d99b01278c07ff63eaf1039cb787ae9e2dd46436cc0415f280c562bebb83a23e639e476a02ec8cff7ea06cd12c86dcc3adefbf1a9e9a9b6646c7599ec631b0da9a60debeb9b3e19324977f3b4f36892c8a38671c8e1cc8e50fcd50f9e51deaf98272f9266fc702e4e57c30";
d = "a3d2d3b7596f6592ce98b4bfe10d41837f10027a90d7bb75349490018cf72d07";
qx' = "322f80371bf6e044bc49391d97c1714ab87f990b949bc178cb7c43b7c22d89e1";
qy' = "3c15d54a5cc6b9f09de8457e873eb3deb1fceb54b0b295da6050294fae7fd999";
k = "24fc90e1da13f17ef9fe84cc96b9471ed1aaac17e3a4bae33a115df4e5834f18";
r' = "d7c562370af617b581c84a2468cc8bd50bb1cbf322de41b7887ce07c0e5884ca";
s' = "b46d9f2d8c4bf83546ff178f1d78937c008d64e8ecc5cbb825cb21d94d670d89";
};
{ msg' = "dc66e39f9bbfd9865318531ffe9207f934fa615a5b285708a5e9c46b7775150e818d7f24d2a123df3672fff2094e3fd3df6fbe259e3989dd5edfcccbe7d45e26a775a5c4329a084f057c42c13f3248e3fd6f0c76678f890f513c32292dd306eaa84a59abe34b16cb5e38d0e885525d10336ca443e1682aa04a7af832b0eee4e7";
d = "53a0e8a8fe93db01e7ae94e1a9882a102ebd079b3a535827d583626c272d280d";
qx' = "1bcec4570e1ec2436596b8ded58f60c3b1ebc6a403bc5543040ba82963057244";
qy' = "8af62a4c683f096b28558320737bf83b9959a46ad2521004ef74cf85e67494e1";
k = "5d833e8d24cc7a402d7ee7ec852a3587cddeb48358cea71b0bedb8fabe84e0c4";
r' = "18caaf7b663507a8bcd992b836dec9dc5703c080af5e51dfa3a9a7c387182604";
s' = "77c68928ac3b88d985fb43fb615fb7ff45c18ba5c81af796c613dfa98352d29c";
};
{ msg' = "600974e7d8c5508e2c1aab0783ad0d7c4494ab2b4da265c2fe496421c4df238b0be25f25659157c8a225fb03953607f7df996acfd402f147e37aee2f1693e3bf1c35eab3ae360a2bd91d04622ea47f83d863d2dfecb618e8b8bdc39e17d15d672eee03bb4ce2cc5cf6b217e5faf3f336fdd87d972d3a8b8a593ba85955cc9d71";
d = "4af107e8e2194c830ffb712a65511bc9186a133007855b49ab4b3833aefc4a1d";
qx' = "a32e50be3dae2c8ba3f5e4bdae14cf7645420d425ead94036c22dd6c4fc59e00";
qy' = "d623bf641160c289d6742c6257ae6ba574446dd1d0e74db3aaa80900b78d4ae9";
k = "e18f96f84dfa2fd3cdfaec9159d4c338cd54ad314134f0b31e20591fc238d0ab";
r' = "8524c5024e2d9a73bde8c72d9129f57873bbad0ed05215a372a84fdbc78f2e68";
s' = "d18c2caf3b1072f87064ec5e8953f51301cada03469c640244760328eb5a05cb";
};
{ msg' = "dfa6cb9b39adda6c74cc8b2a8b53a12c499ab9dee01b4123642b4f11af336a91a5c9ce0520eb2395a6190ecbf6169c4cba81941de8e76c9c908eb843b98ce95e0da29c5d4388040264e05e07030a577cc5d176387154eabae2af52a83e85c61c7c61da930c9b19e45d7e34c8516dc3c238fddd6e450a77455d534c48a152010b";
d = "78dfaa09f1076850b3e206e477494cddcfb822aaa0128475053592c48ebaf4ab";
qx' = "8bcfe2a721ca6d753968f564ec4315be4857e28bef1908f61a366b1f03c97479";
qy' = "0f67576a30b8e20d4232d8530b52fb4c89cbc589ede291e499ddd15fe870ab96";
k = "295544dbb2da3da170741c9b2c6551d40af7ed4e891445f11a02b66a5c258a77";
r' = "c5a186d72df452015480f7f338970bfe825087f05c0088d95305f87aacc9b254";
s' = "84a58f9e9d9e735344b316b1aa1ab5185665b85147dc82d92e969d7bee31ca30";
};
{ msg' = "51d2547cbff92431174aa7fc7302139519d98071c755ff1c92e4694b58587ea560f72f32fc6dd4dee7d22bb7387381d0256e2862d0644cdf2c277c5d740fa089830eb52bf79d1e75b8596ecf0ea58a0b9df61e0c9754bfcd62efab6ea1bd216bf181c5593da79f10135a9bc6e164f1854bc8859734341aad237ba29a81a3fc8b";
d = "80e692e3eb9fcd8c7d44e7de9f7a5952686407f90025a1d87e52c7096a62618a";
qx' = "a88bc8430279c8c0400a77d751f26c0abc93e5de4ad9a4166357952fe041e767";
qy' = "2d365a1eef25ead579cc9a069b6abc1b16b81c35f18785ce26a10ba6d1381185";
k = "7c80fd66d62cc076cef2d030c17c0a69c99611549cb32c4ff662475adbe84b22";
r' = "9d0c6afb6df3bced455b459cc21387e14929392664bb8741a3693a1795ca6902";
s' = "d7f9ddd191f1f412869429209ee3814c75c72fa46a9cccf804a2f5cc0b7e739f";
};
{ msg' = "558c2ac13026402bad4a0a83ebc9468e50f7ffab06d6f981e5db1d082098065bcff6f21a7a74558b1e8612914b8b5a0aa28ed5b574c36ac4ea5868432a62bb8ef0695d27c1e3ceaf75c7b251c65ddb268696f07c16d2767973d85beb443f211e6445e7fe5d46f0dce70d58a4cd9fe70688c035688ea8c6baec65a5fc7e2c93e8";
d = "5e666c0db0214c3b627a8e48541cc84a8b6fd15f300da4dff5d18aec6c55b881";
qx' = "1bc487570f040dc94196c9befe8ab2b6de77208b1f38bdaae28f9645c4d2bc3a";
qy' = "ec81602abd8345e71867c8210313737865b8aa186851e1b48eaca140320f5d8f";
k = "2e7625a48874d86c9e467f890aaa7cd6ebdf71c0102bfdcfa24565d6af3fdce9";
r' = "2f9e2b4e9f747c657f705bffd124ee178bbc5391c86d056717b140c153570fd9";
s' = "f5413bfd85949da8d83de83ab0d19b2986613e224d1901d76919de23ccd03199";
};
{ msg' = "4d55c99ef6bd54621662c3d110c3cb627c03d6311393b264ab97b90a4b15214a5593ba2510a53d63fb34be251facb697c973e11b665cb7920f1684b0031b4dd370cb927ca7168b0bf8ad285e05e9e31e34bc24024739fdc10b78586f29eff94412034e3b606ed850ec2c1900e8e68151fc4aee5adebb066eb6da4eaa5681378e";
d = "f73f455271c877c4d5334627e37c278f68d143014b0a05aa62f308b2101c5308";
qx' = "b8188bd68701fc396dab53125d4d28ea33a91daf6d21485f4770f6ea8c565dde";
qy' = "423f058810f277f8fe076f6db56e9285a1bf2c2a1dae145095edd9c04970bc4a";
k = "62f8665fd6e26b3fa069e85281777a9b1f0dfd2c0b9f54a086d0c109ff9fd615";
r' = "1cc628533d0004b2b20e7f4baad0b8bb5e0673db159bbccf92491aef61fc9620";
s' = "880e0bbf82a8cf818ed46ba03cf0fc6c898e36fca36cc7fdb1d2db7503634430";
};
{ msg' = "f8248ad47d97c18c984f1f5c10950dc1404713c56b6ea397e01e6dd925e903b4fadfe2c9e877169e71ce3c7fe5ce70ee4255d9cdc26f6943bf48687874de64f6cf30a012512e787b88059bbf561162bdcc23a3742c835ac144cc14167b1bd6727e940540a9c99f3cbb41fb1dcb00d76dda04995847c657f4c19d303eb09eb48a";
d = "b20d705d9bd7c2b8dc60393a5357f632990e599a0975573ac67fd89b49187906";
qx' = "51f99d2d52d4a6e734484a018b7ca2f895c2929b6754a3a03224d07ae61166ce";
qy' = "4737da963c6ef7247fb88d19f9b0c667cac7fe12837fdab88c66f10d3c14cad1";
k = "72b656f6b35b9ccbc712c9f1f3b1a14cbbebaec41c4bca8da18f492a062d6f6f";
r' = "9886ae46c1415c3bc959e82b760ad760aab66885a84e620aa339fdf102465c42";
s' = "2bf3a80bc04faa35ebecc0f4864ac02d349f6f126e0f988501b8d3075409a26c";
};
{ msg' = "3b6ee2425940b3d240d35b97b6dcd61ed3423d8e71a0ada35d47b322d17b35ea0472f35edd1d252f87b8b65ef4b716669fc9ac28b00d34a9d66ad118c9d94e7f46d0b4f6c2b2d339fd6bcd351241a387cc82609057048c12c4ec3d85c661975c45b300cb96930d89370a327c98b67defaa89497aa8ef994c77f1130f752f94a4";
d = "d4234bebfbc821050341a37e1240efe5e33763cbbb2ef76a1c79e24724e5a5e7";
qx' = "8fb287f0202ad57ae841aea35f29b2e1d53e196d0ddd9aec24813d64c0922fb7";
qy' = "1f6daff1aa2dd2d6d3741623eecb5e7b612997a1039aab2e5cf2de969cfea573";
k = "d926fe10f1bfd9855610f4f5a3d666b1a149344057e35537373372ead8b1a778";
r' = "490efd106be11fc365c7467eb89b8d39e15d65175356775deab211163c2504cb";
s' = "644300fc0da4d40fb8c6ead510d14f0bd4e1321a469e9c0a581464c7186b7aa7";
};
{ msg' = "c5204b81ec0a4df5b7e9fda3dc245f98082ae7f4efe81998dcaa286bd4507ca840a53d21b01e904f55e38f78c3757d5a5a4a44b1d5d4e480be3afb5b394a5d2840af42b1b4083d40afbfe22d702f370d32dbfd392e128ea4724d66a3701da41ae2f03bb4d91bb946c7969404cb544f71eb7a49eb4c4ec55799bda1eb545143a7";
d = "b58f5211dff440626bb56d0ad483193d606cf21f36d9830543327292f4d25d8c";
qx' = "68229b48c2fe19d3db034e4c15077eb7471a66031f28a980821873915298ba76";
qy' = "303e8ee3742a893f78b810991da697083dd8f11128c47651c27a56740a80c24c";
k = "e158bf4a2d19a99149d9cdb879294ccb7aaeae03d75ddd616ef8ae51a6dc1071";
r' = "e67a9717ccf96841489d6541f4f6adb12d17b59a6bef847b6183b8fcf16a32eb";
s' = "9ae6ba6d637706849a6a9fc388cf0232d85c26ea0d1fe7437adb48de58364333";
};
{ msg' = "72e81fe221fb402148d8b7ab03549f1180bcc03d41ca59d7653801f0ba853add1f6d29edd7f9abc621b2d548f8dbf8979bd16608d2d8fc3260b4ebc0dd42482481d548c7075711b5759649c41f439fad69954956c9326841ea6492956829f9e0dc789f73633b40f6ac77bcae6dfc7930cfe89e526d1684365c5b0be2437fdb01";
d = "54c066711cdb061eda07e5275f7e95a9962c6764b84f6f1f3ab5a588e0a2afb1";
qx' = "0a7dbb8bf50cb605eb2268b081f26d6b08e012f952c4b70a5a1e6e7d46af98bb";
qy' = "f26dd7d799930062480849962ccf5004edcfd307c044f4e8f667c9baa834eeae";
k = "646fe933e96c3b8f9f507498e907fdd201f08478d0202c752a7c2cfebf4d061a";
r' = "b53ce4da1aa7c0dc77a1896ab716b921499aed78df725b1504aba1597ba0c64b";
s' = "d7c246dc7ad0e67700c373edcfdd1c0a0495fc954549ad579df6ed1438840851";
};
{ msg' = "21188c3edd5de088dacc1076b9e1bcecd79de1003c2414c3866173054dc82dde85169baa77993adb20c269f60a5226111828578bcc7c29e6e8d2dae81806152c8ba0c6ada1986a1983ebeec1473a73a04795b6319d48662d40881c1723a706f516fe75300f92408aa1dc6ae4288d2046f23c1aa2e54b7fb6448a0da922bd7f34";
d = "34fa4682bf6cb5b16783adcd18f0e6879b92185f76d7c920409f904f522db4b1";
qx' = "105d22d9c626520faca13e7ced382dcbe93498315f00cc0ac39c4821d0d73737";
qy' = "6c47f3cbbfa97dfcebe16270b8c7d5d3a5900b888c42520d751e8faf3b401ef4";
k = "a6f463ee72c9492bc792fe98163112837aebd07bab7a84aaed05be64db3086f4";
r' = "542c40a18140a6266d6f0286e24e9a7bad7650e72ef0e2131e629c076d962663";
s' = "4f7f65305e24a6bbb5cff714ba8f5a2cee5bdc89ba8d75dcbf21966ce38eb66f";
};
] | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Meta.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.ECDSA.Test.Vectors.fst"
} | [
{
"abbrev": false,
"full_module": "Lib.Meta",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.ECDSA.Test",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.ECDSA.Test",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Prims.list Spec.ECDSA.Test.Vectors.vec_SigGen | Prims.Tot | [
"total"
] | [] | [
"Prims.Cons",
"Spec.ECDSA.Test.Vectors.vec_SigGen",
"Spec.ECDSA.Test.Vectors.Mkvec_SigGen",
"Prims.Nil"
] | [] | false | false | false | true | false | let siggen_vectors_sha2_384:list vec_SigGen =
| [
{
msg'
=
"e0b8596b375f3306bbc6e77a0b42f7469d7e83635990e74aa6d713594a3a24498feff5006790742d9c2e9b47d714bee932435db747c6e733e3d8de41f2f91311f2e9fd8e025651631ffd84f66732d3473fbd1627e63dc7194048ebec93c95c159b5039ab5e79e42c80b484a943f125de3da1e04e5bf9c16671ad55a1117d3306";
d = "b6faf2c8922235c589c27368a3b3e6e2f42eb6073bf9507f19eed0746c79dced";
qx' = "e0e7b99bc62d8dd67883e39ed9fa0657789c5ff556cc1fd8dd1e2a55e9e3f243";
qy' = "63fbfd0232b95578075c903a4dbf85ad58f8350516e1ec89b0ee1f5e1362da69";
k = "9980b9cdfcef3ab8e219b9827ed6afdd4dbf20bd927e9cd01f15762703487007";
r' = "f5087878e212b703578f5c66f434883f3ef414dc23e2e8d8ab6a8d159ed5ad83";
s' = "306b4c6c20213707982dffbb30fba99b96e792163dd59dbe606e734328dd7c8a"
};
{
msg'
=
"099a0131179fff4c6928e49886d2fdb3a9f239b7dd5fa828a52cbbe3fcfabecfbba3e192159b887b5d13aa1e14e6a07ccbb21f6ad8b7e88fee6bea9b86dea40ffb962f38554056fb7c5bb486418915f7e7e9b9033fe3baaf9a069db98bc02fa8af3d3d1859a11375d6f98aa2ce632606d0800dff7f55b40f971a8586ed6b39e9";
d = "118958fd0ff0f0b0ed11d3cf8fa664bc17cdb5fed1f4a8fc52d0b1ae30412181";
qx' = "afda82260c9f42122a3f11c6058839488f6d7977f6f2a263c67d06e27ea2c355";
qy' = "0ae2bbdd2207c590332c5bfeb4c8b5b16622134bd4dc55382ae806435468058b";
k = "23129a99eeda3d99a44a5778a46e8e7568b91c31fb7a8628c5d9820d4bed4a6b";
r' = "e446600cab1286ebc3bb332012a2f5cc33b0a5ef7291d5a62a84de5969d77946";
s' = "cf89b12793ee1792eb26283b48fa0bdcb45ae6f6ad4b02564bf786bb97057d5a"
};
{
msg'
=
"0fbc07ea947c946bea26afa10c51511039b94ddbc4e2e4184ca3559260da24a14522d1497ca5e77a5d1a8e86583aeea1f5d4ff9b04a6aa0de79cd88fdb85e01f171143535f2f7c23b050289d7e05cebccdd131888572534bae0061bdcc3015206b9270b0d5af9f1da2f9de91772d178a632c3261a1e7b3fb255608b3801962f9";
d = "3e647357cd5b754fad0fdb876eaf9b1abd7b60536f383c81ce5745ec80826431";
qx' = "702b2c94d039e590dd5c8f9736e753cf5824aacf33ee3de74fe1f5f7c858d5ed";
qy' = "0c28894e907af99fb0d18c9e98f19ac80dd77abfa4bebe45055c0857b82a0f4d";
k = "9beab7722f0bcb468e5f234e074170a60225255de494108459abdf603c6e8b35";
r' = "c4021fb7185a07096547af1fb06932e37cf8bd90cf593dea48d48614fa237e5e";
s' = "7fb45d09e2172bec8d3e330aa06c43fbb5f625525485234e7714b7f6e92ba8f1"
};
{
msg'
=
"1e38d750d936d8522e9db1873fb4996bef97f8da3c6674a1223d29263f1234a90b751785316444e9ba698bc8ab6cd010638d182c9adad4e334b2bd7529f0ae8e9a52ad60f59804b2d780ed52bdd33b0bf5400147c28b4304e5e3434505ae7ce30d4b239e7e6f0ecf058badd5b388eddbad64d24d2430dd04b4ddee98f972988f";
d = "76c17c2efc99891f3697ba4d71850e5816a1b65562cc39a13da4b6da9051b0fd";
qx' = "d12512e934c367e4c4384dbd010e93416840288a0ba00b299b4e7c0d91578b57";
qy' = "ebf8835661d9b578f18d14ae4acf9c357c0dc8b7112fc32824a685ed72754e23";
k = "77cffa6f9a73904306f9fcd3f6bbb37f52d71e39931bb4aec28f9b076e436ccf";
r' = "4d5a9d95b0f09ce8704b0f457b39059ee606092310df65d3f8ae7a2a424cf232";
s' = "7d3c014ca470a73cef1d1da86f2a541148ad542fbccaf9149d1b0b030441a7eb"
};
{
msg'
=
"abcf0e0f046b2e0672d1cc6c0a114905627cbbdefdf9752f0c31660aa95f2d0ede72d17919a9e9b1add3213164e0c9b5ae3c76f1a2f79d3eeb444e6741521019d8bd5ca391b28c1063347f07afcfbb705be4b52261c19ebaf1d6f054a74d86fb5d091fa7f229450996b76f0ada5f977b09b58488eebfb5f5e9539a8fd89662ab";
d = "67b9dea6a575b5103999efffce29cca688c781782a41129fdecbce76608174de";
qx' = "b4238b029fc0b7d9a5286d8c29b6f3d5a569e9108d44d889cd795c4a385905be";
qy' = "8cb3fff8f6cca7187c6a9ad0a2b1d9f40ae01b32a7e8f8c4ca75d71a1fffb309";
k = "d02617f26ede3584f0afcfc89554cdfb2ae188c192092fdde3436335fafe43f1";
r' = "26fd9147d0c86440689ff2d75569795650140506970791c90ace0924b44f1586";
s' = "00a34b00c20a8099df4b0a757cbef8fea1cb3ea7ced5fbf7e987f70b25ee6d4f"
};
{
msg'
=
"dc3d4884c741a4a687593c79fb4e35c5c13c781dca16db561d7e393577f7b62ca41a6e259fc1fb8d0c4e1e062517a0fdf95558b7799f20c211796167953e6372c11829beec64869d67bf3ee1f1455dd87acfbdbcc597056e7fb347a17688ad32fda7ccc3572da7677d7255c261738f07763cd45973c728c6e9adbeecadc3d961";
d = "ecf644ea9b6c3a04fdfe2de4fdcb55fdcdfcf738c0b3176575fa91515194b566";
qx' = "c3bdc7c795ec94620a2cfff614c13a3390a5e86c892e53a24d3ed22228bc85bf";
qy' = "70480fc5cf4aacd73e24618b61b5c56c1ced8c4f1b869580ea538e68c7a61ca3";
k = "53291d51f68d9a12d1dcdc58892b2f786cc15f631f16997d2a49bace513557d4";
r' = "a860c8b286edf973ce4ce4cf6e70dc9bbf3818c36c023a845677a9963705df8b";
s' = "5630f986b1c45e36e127dd7932221c4272a8cc6e255e89f0f0ca4ec3a9f76494"
};
{
msg'
=
"719bf1911ae5b5e08f1d97b92a5089c0ab9d6f1c175ac7199086aeeaa416a17e6d6f8486c711d386f284f096296689a54d330c8efb0f5fa1c5ba128d3234a3da856c2a94667ef7103616a64c913135f4e1dc50e38daa60610f732ad1bedfcc396f87169392520314a6b6b9af6793dbabad4599525228cc7c9c32c4d8e097ddf6";
d = "4961485cbc978f8456ec5ac7cfc9f7d9298f99415ecae69c8491b258c029bfee";
qx' = "8d40bf2299e05d758d421972e81cfb0cce68b949240dc30f315836acc70bef03";
qy' = "5674e6f77f8b46f46cca937d83b128dffbe9bd7e0d3d08aa2cbbfdfb16f72c9a";
k = "373a825b5a74b7b9e02f8d4d876b577b4c3984168d704ba9f95b19c05ed590af";
r' = "ef6fb386ad044b63feb7445fa16b10319018e9cea9ef42bca83bdad01992234a";
s' = "ac1f42f652eb1786e57be01d847c81f7efa072ba566d4583af4f1551a3f76c65"
};
{
msg'
=
"7cf19f4c851e97c5bca11a39f0074c3b7bd3274e7dd75d0447b7b84995dfc9f716bf08c25347f56fcc5e5149cb3f9cfb39d408ace5a5c47e75f7a827fa0bb9921bb5b23a6053dbe1fa2bba341ac874d9b1333fc4dc224854949f5c8d8a5fedd02fb26fdfcd3be351aec0fcbef18972956c6ec0effaf057eb4420b6d28e0c008c";
d = "587907e7f215cf0d2cb2c9e6963d45b6e535ed426c828a6ea2fb637cca4c5cbd";
qx' = "660da45c413cc9c9526202c16b402af602d30daaa7c342f1e722f15199407f31";
qy' = "e6f8cbb06913cc718f2d69ba2fb3137f04a41c27c676d1a80fbf30ea3ca46439";
k = "6b8eb7c0d8af9456b95dd70561a0e902863e6dfa1c28d0fd4a0509f1c2a647b2";
r' = "08fabf9b57de81875bfa7a4118e3e44cfb38ec6a9b2014940207ba3b1c583038";
s' = "a58d199b1deba7350616230d867b2747a3459421811c291836abee715b8f67b4"
};
{
msg'
=
"b892ffabb809e98a99b0a79895445fc734fa1b6159f9cddb6d21e510708bdab6076633ac30aaef43db566c0d21f4381db46711fe3812c5ce0fb4a40e3d5d8ab24e4e82d3560c6dc7c37794ee17d4a144065ef99c8d1c88bc22ad8c4c27d85ad518fa5747ae35276fc104829d3f5c72fc2a9ea55a1c3a87007cd133263f79e405";
d = "24b1e5676d1a9d6b645a984141a157c124531feeb92d915110aef474b1e27666";
qx' = "b4909a5bdf25f7659f4ef35e4b811429fb2c59126e3dad09100b46aea6ebe7a6";
qy' = "760ae015fa6af5c9749c4030fdb5de6e58c6b5b1944829105cf7edf7d3a22cfb";
k = "88794923d8943b5dbcc7a7a76503880ff7da632b0883aaa60a9fcc71bf880fd6";
r' = "6ec9a340b77fae3c7827fa96d997e92722ff2a928217b6dd3c628f3d49ae4ce6";
s' = "637b54bbcfb7e7d8a41ea317fcfca8ad74eb3bb6b778bc7ef9dec009281976f7"
};
{
msg'
=
"8144e37014c95e13231cbd6fa64772771f93b44e37f7b02f592099cc146343edd4f4ec9fa1bc68d7f2e9ee78fc370443aa2803ff4ca52ee49a2f4daf2c8181ea7b8475b3a0f608fc3279d09e2d057fbe3f2ffbe5133796124781299c6da60cfe7ecea3abc30706ded2cdf18f9d788e59f2c31662df3abe01a9b12304fb8d5c8c";
d = "bce49c7b03dcdc72393b0a67cf5aa5df870f5aaa6137ada1edc7862e0981ec67";
qx' = "c786d9421d67b72b922cf3def2a25eeb5e73f34543eb50b152e738a98afb0ca5";
qy' = "6796271e79e2496f9e74b126b1123a3d067de56b5605d6f51c8f6e1d5bb93aba";
k = "89e690d78a5e0d2b8ce9f7fcbf34e2605fd9584760fa7729043397612dd21f94";
r' = "07e5054c384839584624e8d730454dc27e673c4a90cbf129d88b91250341854d";
s' = "f7e665b88614d0c5cbb3007cafe713763d81831525971f1747d92e4d1ca263a7"
};
{
msg'
=
"a3683d120807f0a030feed679785326698c3702f1983eaba1b70ddfa7f0b3188060b845e2b67ed57ee68087746710450f7427cb34655d719c0acbc09ac696adb4b22aba1b9322b7111076e67053a55f62b501a4bca0ad9d50a868f51aeeb4ef27823236f5267e8da83e143047422ce140d66e05e44dc84fb3a4506b2a5d7caa8";
d = "73188a923bc0b289e81c3db48d826917910f1b957700f8925425c1fb27cabab9";
qx' = "86662c014ab666ee770723be8da38c5cd299efc6480fc6f8c3603438fa8397b9";
qy' = "f26b3307a650c3863faaa5f642f3ba1384c3d3a02edd3d48c657c269609cc3fc";
k = "ec90584ab3b383b590626f36ed4f5110e49888aec7ae7a9c5ea62dd2dc378666";
r' = "13e9ad59112fde3af4163eb5c2400b5e9a602576d5869ac1c569075f08c90ff6";
s' = "708ac65ff2b0baaccc6dd954e2a93df46016bd04457636de06798fcc17f02be5"
};
{
msg'
=
"b1df8051b213fc5f636537e37e212eb20b2423e6467a9c7081336a870e6373fc835899d59e546c0ac668cc81ce4921e88f42e6da2a109a03b4f4e819a17c955b8d099ec6b282fb495258dca13ec779c459da909475519a3477223c06b99afbd77f9922e7cbef844b93f3ce5f50db816b2e0d8b1575d2e17a6b8db9111d6da578";
d = "f637d55763fe819541588e0c603f288a693cc66823c6bb7b8e003bd38580ebce";
qx' = "74a4620c578601475fc169a9b84be613b4a16cb6acab8fd98848a6ec9fbd133d";
qy' = "42b9e35d347c107e63bd55f525f915bcf1e3d2b81d002d3c39acf10fc30645a1";
k = "4d578f5099636234d9c1d566f1215d5d887ae5d47022be17dbf32a11a03f053b";
r' = "113a933ebc4d94ce1cef781e4829df0c493b0685d39fb2048ce01b21c398dbba";
s' = "3005bd4ec63dbd04ce9ff0c6246ad65d27fcf62edb2b7e461589f9f0e7446ffd"
};
{
msg'
=
"0b918ede985b5c491797d0a81446b2933be312f419b212e3aae9ba5914c00af431747a9d287a7c7761e9bcbc8a12aaf9d4a76d13dad59fc742f8f218ef66eb67035220a07acc1a357c5b562ecb6b895cf725c4230412fefac72097f2c2b829ed58742d7c327cad0f1058df1bddd4ae9c6d2aba25480424308684cecd6517cdd8";
d = "2e357d51517ff93b821f895932fddded8347f32596b812308e6f1baf7dd8a47f";
qx' = "7e4078a1d50c669fb2996dd9bacb0c3ac7ede4f58fa0fa1222e78dbf5d1f4186";
qy' = "0014e46e90cc171fbb83ea34c6b78202ea8137a7d926f0169147ed5ae3d6596f";
k = "be522b0940b9a40d84bf790fe6abdc252877e671f2efa63a33a65a512fc2aa5c";
r' = "a26b9ad775ac37ff4c7f042cdc4872c5e4e5e800485f488ddfaaed379f468090";
s' = "f88eae2019bebbba62b453b8ee3472ca5c67c267964cffe0cf2d2933c1723dff"
};
{
msg'
=
"0fab26fde1a4467ca930dbe513ccc3452b70313cccde2994eead2fde85c8da1db84d7d06a024c9e88629d5344224a4eae01b21a2665d5f7f36d5524bf5367d7f8b6a71ea05d413d4afde33777f0a3be49c9e6aa29ea447746a9e77ce27232a550b31dd4e7c9bc8913485f2dc83a56298051c92461fd46b14cc895c300a4fb874";
d = "77d60cacbbac86ab89009403c97289b5900466856887d3e6112af427f7f0f50b";
qx' = "a62032dfdb87e25ed0c70cad20d927c7effeb2638e6c88ddd670f74df16090e5";
qy' = "44c5ee2cf740ded468f5d2efe13daa7c5234645a37c073af35330d03a4fed976";
k = "06c1e692b045f425a21347ecf72833d0242906c7c1094f805566cdcb1256e394";
r' = "eb173b51fb0aec318950d097e7fda5c34e529519631c3e2c9b4550b903da417d";
s' = "ca2c13574bf1b7d56e9dc18315036a31b8bceddf3e2c2902dcb40f0cc9e31b45"
};
{
msg'
=
"7843f157ef8566722a7d69da67de7599ee65cb3975508f70c612b3289190e364141781e0b832f2d9627122742f4b5871ceeafcd09ba5ec90cae6bcc01ae32b50f13f63918dfb5177df9797c6273b92d103c3f7a3fc2050d2b196cc872c57b77f9bdb1782d4195445fcc6236dd8bd14c8bcbc8223a6739f6a17c9a861e8c821a6";
d = "486854e77962117f49e09378de6c9e3b3522fa752b10b2c810bf48db584d7388";
qx' = "760b5624bd64d19c866e54ccd74ad7f98851afdbc3ddeae3ec2c52a135be9cfa";
qy' = "feca15ce9350877102eee0f5af18b2fed89dc86b7df0bf7bc2963c1638e36fe8";
k = "e4f77c6442eca239b01b0254e11a4182782d96f48ab521cc3d1d68df12b5a41a";
r' = "bdff14e4600309c2c77f79a25963a955b5b500a7b2d34cb172cd6acd52905c7b";
s' = "b0479cdb3df79923ec36a104a129534c5d59f622be7d613aa04530ad2507d3a2"
}
] | false |
Spec.ECDSA.Test.Vectors.fst | Spec.ECDSA.Test.Vectors.sigver_vectors_sha2_384 | val sigver_vectors_sha2_384:list vec_SigVer | val sigver_vectors_sha2_384:list vec_SigVer | let sigver_vectors_sha2_384 : list vec_SigVer = [
{ msg = "fe9838f007bdc6afcd626974fcc6833f06b6fd970427b962d75c2aeadbef386bec8d018106197fe2547d2af02e7a7949965d5fbc4c5db909a95b9858426a33c080b0b25dae8b56c5cbc6c4eec3dbd81635c79457eaef4fab39e662a1d05b2481eda8c1074ae2d1704c8a3f769686a1f965ef3c87602efc288c7f9ff8cd5e22a4";
qx = "40ded13dbbe72c629c38f07f7f95cf75a50e2a524897604c84fafde5e4cafb9f";
qy = "a17202e92d7d6a37c438779349fd79567d75a40ef22b7d09ca21ccf4aec9a66c";
r = "be34730c31730b4e412e6c52c23edbd36583ace2102b39afa11d24b6848cb77f";
s = "03655202d5fd8c9e3ae971b6f080640c406112fd95e7015874e9b6ee77752b10";
result = false;
};
{ msg = "b69043b9b331da392b5dd689142dfc72324265da08f14abcedf03ad8263e6bdccbc75098a2700bbba1979de84c8f12891aa0d000f8a1abad7dde4981533f21da59cc80d9cf94517f3b61d1a7d9eecb2fcf052e1fc9e7188c031b86305e4a436a37948071f046e306befb8511dc03a53dc8769a90a86e9b4fdbf05dcdfa35ab73";
qx = "1f80e19ffeb51dd74f1c397ac3dfd3415ab16ebd0847ed119e6c3b15a1a884b8";
qy = "9b395787371dbfb55d1347d7bed1c261d2908121fb78de1d1bf2d00666a62aed";
r = "249ca2c3eb6e04ac57334c2f75dc5e658bbb485bf187100774f5099dd13ef707";
s = "97363a05202b602d13166346694e38135bbce025be94950e9233f4c8013bf5bf";
result = false;
};
{ msg = "d2fcaaede8b879c064b0aa46e68efc278a469b80a7f7e1939ec2ebc96c76206f23395967279c181fea157ebb79dfadc68e31345f07f13305c80de0d85e4330d3a45f957c5c2526b945838ce5a9c2844b6b2a665c0f70b748b1213a8cf20ba5dbdf8cab231f433da522104a5cd027d3e36bb373c4ed404d9af0cbec6f85ec2193";
qx = "ce4dcfa7384c83443ace0fb82c4ac1adfa100a9b2c7bf09f093f8b6d084e50c2";
qy = "d98ae7b91abee648d0bfde192703741ac21daad7262af418b50e406d825eb0d6";
r = "597e1e04d93a6b444ccc447a48651f17657ff43fb65fe94461d2bf816b01af40";
s = "359fe3817963548e676d6da34c2d0866aa42499237b682002889eaf8893814d2";
result = true;
};
{ msg = "06cd86481865181cef7acdc3202824970ec2d97662b519c4b588dc9e51617c068282b1a11a15bf7efc4858a2f37a3d74b05fb5790eb68338c8009b4da9b4270514d387a2e016a99ee109841e884a7909504ef31a5454e214663f830f23a5a76f91402fca5f5d61699fa874597bdbfb1ecff8f07ddbd07ef61e97d0d5262ef314";
qx = "1b677f535ac69d1acd4592c0d12fac13c9131e5a6f8ab4f9d0afdcb3a3f327e0";
qy = "5dca2c73ec89e58ef8267cba2bb5eb0f551f412f9dc087c1a6944f0ce475277a";
r = "df0b0cd76d2555d4c38b3d70bfdf964884d0beeb9f74385f0893e87d20c9642d";
s = "128299aabf1f5496112be1fe04365f5f8215b08a040abdfeca4626f4d15c005b";
result = false;
};
{ msg = "59ad297397f3503604a4a2d098a4f00a368ad95c6101b3d38f9d49d908776c5a6c8654b006adb7939ffb6c30afa325b54185d82c3cc0d836850dce54d3408b257c3a961d11fafe2b74ba8bddfc1102fa656d1028baf94c38340c26a11e992aab71ce3732271b767358671b25225926f3a4b9ec5f82c059f0c7d1446d5d9e4251";
qx = "7ffc2853f3e17887dda13b0eb43f183ce50a5ac0f8bba75fb1921172484f9b94";
qy = "4cc523d14192f80bd5b27d30b3b41e064da87bfbae15572dd382b9a176c123a2";
r = "3156176d52eb26f9391229de4251993a41b8172f78970bb70e32a245be4bb653";
s = "62827a29e12d2f29b00fb2d02dd5f2d5412e17a4455f4431a5c996881fdfc0ee";
result = false;
};
{ msg = "8215daca87e689a20392646a6511bb7b5a82d2d995ca9de89bd9d9c0b11464b7cb1e4e9a31e3e01ad8c2cd613d5a2cb44a2a8df6899fce4c282dea1e41af0df6c36be1f320036567f8d0d32aaa79c95fe53b16668f7e1a9e5d7d039ea260fd03711b7d1c177355fc52244d49ca5b238556a5541349014683cb7da326f443b752";
qx = "5569f76dc94243cde819fb6fc85144ec67e2b5d49539f62e24d406d1b68f0058";
qy = "1208c38dbe25870deab53c486f793a1e250c9d1b8e7c147ea68b71196c440730";
r = "706f2ba4025e7c06b66d6369a3f93b2fec46c51eceff42a158f7431919506cfb";
s = "b4e75ac34a96393237fc4337789e37168d79382705b248051c9c72bcbac5f516";
result = false;
};
{ msg = "a996b1fb800f692517a2eb80e837233193dd3e82484d3f49bd19ee0db8f7b440876b07e384c90aa8b9f7b6603ca0b5a4e06c1da0edb974a2fb9b6e7c720ddf3e5c0e314c2d189402903c08c0836776c361a284db887ebcc33e615de9720b01dadade585eef687b3346468bdafb490e56d657a9e7d44d92014069005a36c1cf63";
qx = "e4b470c65b2c04db060d7105ec6911589863d3c7f7ce48726ba3f369ea3467e8";
qy = "44c38d3ae098de05f5915a5868c17fee296a6e150beb1f000df5f3bec8fc4532";
r = "c9c347ee5717e4c759ddaf09e86f4e1db2c8658593177cfda4e6514b5e3ecb87";
s = "baae01e9e44a7b04d69c8eaaed77c9e3a36ce8962f95cc50a0db146b4e49eb40";
result = false;
};
{ msg = "1a6e49a377a08e992353d6acc557b687b1b69a41d83d43a75fadb97b8c928cfebadebaaf99ea7fb13148807f56ea17384a7912e578e62b1b009fefb2aafca5ac85539433619b286f10643a56f8dfa47ba4d01c02510deaec18029ea6b9682022b139dcb70814164c4c90ec717ad9d925485398531cdd5992a2524498b337f97d";
qx = "96050c5fa2ddd1b2e5451d89ee74a0b7b54347364ddc0231715a6ef1146fe8dc";
qy = "e0888a9e78aeea87f6e1e9002b2651169f36c4ee53013cfc8c9912b7fd504858";
r = "2353d6cd3c21b8ea7dbc1cd940519812dbe365a3b15cd6aebba9d11cf269867a";
s = "85f560273cd9e82e6801e4cb1c8cd29cdac34a020da211d77453756b604b8fa7";
result = true;
};
{ msg = "3e14f737c913931bc82764ebc440b12e3ce1ffe0f858c7b8f1cbd30fbbb1644fa59be1d2cca5f64a6d7dc5ed5c4420f39227516ae8eb3019ef86274d0e4d06cde7bf5e5c413243dfc421d9f141762109810e6b6a451eeb4bd8d4be1ff111426d7e44d0a916b4fe3db3594d8dd01ae90feecf8f1e230b574180cd0b8d43a3d33b";
qx = "0c07bb79f44012299fbfd5a0f31397aaf7d757f8a38437407c1b09271c6551a0";
qy = "84fe7846d5d403dc92c0091fbd39f3c5cbca3f94c10b5cae44e2e96562131b13";
r = "49e9425f82d0a8c503009cead24e12adc9d48a08594094ca4f6d13ad1e3c571d";
s = "1f1b70aaa30a8ff639aa0935944e9b88326a213ab8fce5194c1a9dec070eb433";
result = false;
};
{ msg = "4000106127a72746db77957cbc6bfd84ae3d1d63b8190087637e93689841331e2adc1930d6df4302935f4520bbee513505cdcfca99ebc6f83af7b23b0f2e7f7defba614022ceeae9c6886e8b13f7ea253a307ac301f3536720cbe3de82ba3e98310361b61801a8304ffc91ff774948e33176ddcddf1b76437b3f02c910578d46";
qx = "71db1de1a1f38f356c91feaff5cfe395d1a5b9d23cf6aa19f38ae0bcc90a486d";
qy = "ecdd6ffb174a50f1cc792985c2f9608c399c98b8a64a69d2b5b7cdd9241f67e2";
r = "b0443b33a6f249470d2f943675009d21b9ccbead1525ae57815df86bb20470bf";
s = "316dbee27d998e09128539c269e297ac8f34b9ef8249a0619168c3495c5c1198";
result = false;
};
{ msg = "b42e547d0e7ddd5e1069bb2d158a5b4d5d9c4310942a1bfd09490311a6e684bd3c29b0dcef86a9788b4b26fed7863f3d5e5439796b5b5ffe7aa2545d0f518ad020689ca21230f3a59e7f8cca465fe21df511e78d215fa805f5f0f88938e9d198515e6b9c819930755c6c6aea5114cd2904607243051c09dd7a147756cbc204a5";
qx = "8219b225aa15472262c648cac8de9aad4173d17a231ba24352a5a1c4eea70fad";
qy = "0fee2b08ad39fbf0db0016ef2896ca99adc07efc8c415f640f3720498be26037";
r = "134fb689101aaad3954de2819d9fbd12072fe2bc36f496bbf0d13fa72114ab96";
s = "e65c232bd915b59e087e7fd5ec90bf636cfa80526345c79a0adfd75003045d6f";
result = false;
};
{ msg = "aa563223a7d5201febdf13cab80a03dce6077c26e751bc98a941196a28848abc495e0324013c9a2094fb15dc65d100c3e8a136a52c1780b395f42588900b641b6d4361432e2173195a2f60189f3fcc85f4e9659cae52576f20d1852d43c2b400deea3144c8e870e1906d677425d8c85037c7a42a9d249b2da4b516e04476bd45";
qx = "c934195de33b60cf00461fc3c45dad068e9f5f7af5c7fa78591e95aeb04e2617";
qy = "b588dd5f9965fdaa523b475c2812c251bc6973e2df21d9beaace976abf5728cb";
r = "71f302440eb4ed2a939b69e33e905e6fdc545c743458d38f7e1a1d456e35f389";
s = "54eaa0eb9cd7503b19a9658f0a04955d9f0ab20ebc8a0877e33c89ee88ad068f";
result = false;
};
{ msg = "98e4babf890f52e5a04bd2a7d79bf0ae9a71967847347d87f29fb3997454c73c7979d15b5c4f4205ec3de7835d1885fb7abcf8dcde94baf08b1d691a0c74845317286540e8c9d378fefaa4762c302492f51023c0d7adbb1cc90b7b0335f11203664e71fea621bc2f59d2dbd0ee76d6597ec75510de59b6d25fa6750a71c59435";
qx = "9e1adcd48e2e3f0e4c213501808228e587c40558f52bb54ddbb6102d4048ea92";
qy = "34eff98704790938e7e0bdf87ae39807a6b77dfdc9ecdfe6dd0f241abae1aeb2";
r = "ce4f0d7480522c8dd1b02dd0eb382f22406642f038c1ede9411883d72b3e7ed0";
s = "8546e1ee3b77f9927cdaccbc2f1cf19d6b5576b0f738bb1b86a0c66b39ca56fb";
result = false;
};
{ msg = "bb6b03ad60d6ddbf0c4d17246206e61c886f916d252bb4608149da49cef9033484080e861f91bb2400baa0cd6c5d90c2f275e2fabc12d83847f7a1c3ff0eb40c8a3dd83d07d194ba3797d27238415a2f358d7292a1991af687bcb977486980f9138b3140321485638ac7bd22ecda00ffe5009b83b90397eff24ecf22c5495d67";
qx = "93edbecb0b019c2cc03060f54cb4904b920fdb34eb83badd752be9443036ae13";
qy = "b494e9295e080a9080fe7e73249b3a5904aa84e1c028121eecd3e2cf1a55f598";
r = "eec2986d47b71995892b0915d3d5becc4dcb2ab55206d772e0189541b2184ddf";
s = "8a6c1edeb6452627ad27c8319599c54ac44cdd831ea66f13f49d90affe6ad45b";
result = true;
};
{ msg = "33a5d489f671f396c776bc1acf193bc9a74306f4692dd8e05bcdfe28fdefbd5c09b831c204a1dec81d8e3541f324f7b474d692789013bb1eca066f82fbf3f1cf3ba64e9d8963e9ecc180b9251919e2e8a1ab05847a0d76ff67a47c00e170e38e5b319a56f59cc51038f90961ea27a9a7eb292a0a1aa2f4972568669246907a35";
qx = "3205bae876f9bd50b0713959e72457165e826cbbe3895d67320909daa48b0ebc";
qy = "d1592562273e5e0f57bbfb92cedd9af7f133255684ee050af9b6f02019bbcafa";
r = "0124f3f1c61ec458561a4eaa6c155bd29e59703d14556324924683db3a4cf43b";
s = "688a5c5fc0c7ba92210c50cce5b512a468a880e05acc21ca56571d89f45f603a";
result = false;
};
] | {
"file_name": "specs/tests/p256/Spec.ECDSA.Test.Vectors.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 1,
"end_line": 247,
"start_col": 1,
"start_line": 141
} | module Spec.ECDSA.Test.Vectors
open Lib.Meta
#set-options "--fuel 0 --ifuel 0"
///
/// ECDSA test vectors from NIST CAVP
/// https://csrc.nist.gov/Projects/Cryptographic-Algorithm-Validation-Program/Digital-Signatures#ecdsa2vs
///
type vec_SigVer = {
msg: hex_string;
qx: hex_string;
qy: hex_string;
r: hex_string;
s: hex_string;
result: bool;
}
type vec_SigGen = {
msg': hex_string;
d: hex_string;
qx': hex_string;
qy': hex_string;
k: hex_string;
r': hex_string;
s': hex_string;
}
let sigver_vectors_sha2_256 : list vec_SigVer = [
{ msg = "e4796db5f785f207aa30d311693b3702821dff1168fd2e04c0836825aefd850d9aa60326d88cde1a23c7745351392ca2288d632c264f197d05cd424a30336c19fd09bb229654f0222fcb881a4b35c290a093ac159ce13409111ff0358411133c24f5b8e2090d6db6558afc36f06ca1f6ef779785adba68db27a409859fc4c4a0";
qx = "87f8f2b218f49845f6f10eec3877136269f5c1a54736dbdf69f89940cad41555";
qy = "e15f369036f49842fac7a86c8a2b0557609776814448b8f5e84aa9f4395205e9";
r = "d19ff48b324915576416097d2544f7cbdf8768b1454ad20e0baac50e211f23b0";
s = "a3e81e59311cdfff2d4784949f7a2cb50ba6c3a91fa54710568e61aca3e847c6";
result = false;
};
{ msg = "069a6e6b93dfee6df6ef6997cd80dd2182c36653cef10c655d524585655462d683877f95ecc6d6c81623d8fac4e900ed0019964094e7de91f1481989ae1873004565789cbf5dc56c62aedc63f62f3b894c9c6f7788c8ecaadc9bd0e81ad91b2b3569ea12260e93924fdddd3972af5273198f5efda0746219475017557616170e";
qx = "5cf02a00d205bdfee2016f7421807fc38ae69e6b7ccd064ee689fc1a94a9f7d2";
qy = "ec530ce3cc5c9d1af463f264d685afe2b4db4b5828d7e61b748930f3ce622a85";
r = "dc23d130c6117fb5751201455e99f36f59aba1a6a21cf2d0e7481a97451d6693";
s = "d6ce7708c18dbf35d4f8aa7240922dc6823f2e7058cbc1484fcad1599db5018c";
result = false;
};
{ msg = "df04a346cf4d0e331a6db78cca2d456d31b0a000aa51441defdb97bbeb20b94d8d746429a393ba88840d661615e07def615a342abedfa4ce912e562af714959896858af817317a840dcff85a057bb91a3c2bf90105500362754a6dd321cdd86128cfc5f04667b57aa78c112411e42da304f1012d48cd6a7052d7de44ebcc01de";
qx = "2ddfd145767883ffbb0ac003ab4a44346d08fa2570b3120dcce94562422244cb";
qy = "5f70c7d11ac2b7a435ccfbbae02c3df1ea6b532cc0e9db74f93fffca7c6f9a64";
r = "9913111cff6f20c5bf453a99cd2c2019a4e749a49724a08774d14e4c113edda8";
s = "9467cd4cd21ecb56b0cab0a9a453b43386845459127a952421f5c6382866c5cc";
result = false;
};
{ msg = "e1130af6a38ccb412a9c8d13e15dbfc9e69a16385af3c3f1e5da954fd5e7c45fd75e2b8c36699228e92840c0562fbf3772f07e17f1add56588dd45f7450e1217ad239922dd9c32695dc71ff2424ca0dec1321aa47064a044b7fe3c2b97d03ce470a592304c5ef21eed9f93da56bb232d1eeb0035f9bf0dfafdcc4606272b20a3";
qx = "e424dc61d4bb3cb7ef4344a7f8957a0c5134e16f7a67c074f82e6e12f49abf3c";
qy = "970eed7aa2bc48651545949de1dddaf0127e5965ac85d1243d6f60e7dfaee927";
r = "bf96b99aa49c705c910be33142017c642ff540c76349b9dab72f981fd9347f4f";
s = "17c55095819089c2e03b9cd415abdf12444e323075d98f31920b9e0f57ec871c";
result = true;
};
{ msg = "73c5f6a67456ae48209b5f85d1e7de7758bf235300c6ae2bdceb1dcb27a7730fb68c950b7fcada0ecc4661d3578230f225a875e69aaa17f1e71c6be5c831f22663bac63d0c7a9635edb0043ff8c6f26470f02a7bc56556f1437f06dfa27b487a6c4290d8bad38d4879b334e341ba092dde4e4ae694a9c09302e2dbf443581c08";
qx = "e0fc6a6f50e1c57475673ee54e3a57f9a49f3328e743bf52f335e3eeaa3d2864";
qy = "7f59d689c91e463607d9194d99faf316e25432870816dde63f5d4b373f12f22a";
r = "1d75830cd36f4c9aa181b2c4221e87f176b7f05b7c87824e82e396c88315c407";
s = "cb2acb01dac96efc53a32d4a0d85d0c2e48955214783ecf50a4f0414a319c05a";
result = true;
};
{ msg = "666036d9b4a2426ed6585a4e0fd931a8761451d29ab04bd7dc6d0c5b9e38e6c2b263ff6cb837bd04399de3d757c6c7005f6d7a987063cf6d7e8cb38a4bf0d74a282572bd01d0f41e3fd066e3021575f0fa04f27b700d5b7ddddf50965993c3f9c7118ed78888da7cb221849b3260592b8e632d7c51e935a0ceae15207bedd548";
qx = "a849bef575cac3c6920fbce675c3b787136209f855de19ffe2e8d29b31a5ad86";
qy = "bf5fe4f7858f9b805bd8dcc05ad5e7fb889de2f822f3d8b41694e6c55c16b471";
r = "25acc3aa9d9e84c7abf08f73fa4195acc506491d6fc37cb9074528a7db87b9d6";
s = "9b21d5b5259ed3f2ef07dfec6cc90d3a37855d1ce122a85ba6a333f307d31537";
result = false;
};
{ msg = "7e80436bce57339ce8da1b5660149a20240b146d108deef3ec5da4ae256f8f894edcbbc57b34ce37089c0daa17f0c46cd82b5a1599314fd79d2fd2f446bd5a25b8e32fcf05b76d644573a6df4ad1dfea707b479d97237a346f1ec632ea5660efb57e8717a8628d7f82af50a4e84b11f21bdff6839196a880ae20b2a0918d58cd";
qx = "3dfb6f40f2471b29b77fdccba72d37c21bba019efa40c1c8f91ec405d7dcc5df";
qy = "f22f953f1e395a52ead7f3ae3fc47451b438117b1e04d613bc8555b7d6e6d1bb";
r = "548886278e5ec26bed811dbb72db1e154b6f17be70deb1b210107decb1ec2a5a";
s = "e93bfebd2f14f3d827ca32b464be6e69187f5edbd52def4f96599c37d58eee75";
result = false;
};
{ msg = "1669bfb657fdc62c3ddd63269787fc1c969f1850fb04c933dda063ef74a56ce13e3a649700820f0061efabf849a85d474326c8a541d99830eea8131eaea584f22d88c353965dabcdc4bf6b55949fd529507dfb803ab6b480cd73ca0ba00ca19c438849e2cea262a1c57d8f81cd257fb58e19dec7904da97d8386e87b84948169";
qx = "69b7667056e1e11d6caf6e45643f8b21e7a4bebda463c7fdbc13bc98efbd0214";
qy = "d3f9b12eb46c7c6fda0da3fc85bc1fd831557f9abc902a3be3cb3e8be7d1aa2f";
r = "288f7a1cd391842cce21f00e6f15471c04dc182fe4b14d92dc18910879799790";
s = "247b3c4e89a3bcadfea73c7bfd361def43715fa382b8c3edf4ae15d6e55e9979";
result = false;
};
{ msg = "3fe60dd9ad6caccf5a6f583b3ae65953563446c4510b70da115ffaa0ba04c076115c7043ab8733403cd69c7d14c212c655c07b43a7c71b9a4cffe22c2684788ec6870dc2013f269172c822256f9e7cc674791bf2d8486c0f5684283e1649576efc982ede17c7b74b214754d70402fb4bb45ad086cf2cf76b3d63f7fce39ac970";
qx = "bf02cbcf6d8cc26e91766d8af0b164fc5968535e84c158eb3bc4e2d79c3cc682";
qy = "069ba6cb06b49d60812066afa16ecf7b51352f2c03bd93ec220822b1f3dfba03";
r = "f5acb06c59c2b4927fb852faa07faf4b1852bbb5d06840935e849c4d293d1bad";
s = "049dab79c89cc02f1484c437f523e080a75f134917fda752f2d5ca397addfe5d";
result = false;
};
{ msg = "983a71b9994d95e876d84d28946a041f8f0a3f544cfcc055496580f1dfd4e312a2ad418fe69dbc61db230cc0c0ed97e360abab7d6ff4b81ee970a7e97466acfd9644f828ffec538abc383d0e92326d1c88c55e1f46a668a039beaa1be631a89129938c00a81a3ae46d4aecbf9707f764dbaccea3ef7665e4c4307fa0b0a3075c";
qx = "224a4d65b958f6d6afb2904863efd2a734b31798884801fcab5a590f4d6da9de";
qy = "178d51fddada62806f097aa615d33b8f2404e6b1479f5fd4859d595734d6d2b9";
r = "87b93ee2fecfda54deb8dff8e426f3c72c8864991f8ec2b3205bb3b416de93d2";
s = "4044a24df85be0cc76f21a4430b75b8e77b932a87f51e4eccbc45c263ebf8f66";
result = false;
};
{ msg = "4a8c071ac4fd0d52faa407b0fe5dab759f7394a5832127f2a3498f34aac287339e043b4ffa79528faf199dc917f7b066ad65505dab0e11e6948515052ce20cfdb892ffb8aa9bf3f1aa5be30a5bbe85823bddf70b39fd7ebd4a93a2f75472c1d4f606247a9821f1a8c45a6cb80545de2e0c6c0174e2392088c754e9c8443eb5af";
qx = "43691c7795a57ead8c5c68536fe934538d46f12889680a9cb6d055a066228369";
qy = "f8790110b3c3b281aa1eae037d4f1234aff587d903d93ba3af225c27ddc9ccac";
r = "8acd62e8c262fa50dd9840480969f4ef70f218ebf8ef9584f199031132c6b1ce";
s = "cfca7ed3d4347fb2a29e526b43c348ae1ce6c60d44f3191b6d8ea3a2d9c92154";
result = false;
};
{ msg = "0a3a12c3084c865daf1d302c78215d39bfe0b8bf28272b3c0b74beb4b7409db0718239de700785581514321c6440a4bbaea4c76fa47401e151e68cb6c29017f0bce4631290af5ea5e2bf3ed742ae110b04ade83a5dbd7358f29a85938e23d87ac8233072b79c94670ff0959f9c7f4517862ff829452096c78f5f2e9a7e4e9216";
qx = "9157dbfcf8cf385f5bb1568ad5c6e2a8652ba6dfc63bc1753edf5268cb7eb596";
qy = "972570f4313d47fc96f7c02d5594d77d46f91e949808825b3d31f029e8296405";
r = "dfaea6f297fa320b707866125c2a7d5d515b51a503bee817de9faa343cc48eeb";
s = "8f780ad713f9c3e5a4f7fa4c519833dfefc6a7432389b1e4af463961f09764f2";
result = false;
};
{ msg = "785d07a3c54f63dca11f5d1a5f496ee2c2f9288e55007e666c78b007d95cc28581dce51f490b30fa73dc9e2d45d075d7e3a95fb8a9e1465ad191904124160b7c60fa720ef4ef1c5d2998f40570ae2a870ef3e894c2bc617d8a1dc85c3c55774928c38789b4e661349d3f84d2441a3b856a76949b9f1f80bc161648a1cad5588e";
qx = "072b10c081a4c1713a294f248aef850e297991aca47fa96a7470abe3b8acfdda";
qy = "9581145cca04a0fb94cedce752c8f0370861916d2a94e7c647c5373ce6a4c8f5";
r = "09f5483eccec80f9d104815a1be9cc1a8e5b12b6eb482a65c6907b7480cf4f19";
s = "a4f90e560c5e4eb8696cb276e5165b6a9d486345dedfb094a76e8442d026378d";
result = false;
};
{ msg = "76f987ec5448dd72219bd30bf6b66b0775c80b394851a43ff1f537f140a6e7229ef8cd72ad58b1d2d20298539d6347dd5598812bc65323aceaf05228f738b5ad3e8d9fe4100fd767c2f098c77cb99c2992843ba3eed91d32444f3b6db6cd212dd4e5609548f4bb62812a920f6e2bf1581be1ebeebdd06ec4e971862cc42055ca";
qx = "09308ea5bfad6e5adf408634b3d5ce9240d35442f7fe116452aaec0d25be8c24";
qy = "f40c93e023ef494b1c3079b2d10ef67f3170740495ce2cc57f8ee4b0618b8ee5";
r = "5cc8aa7c35743ec0c23dde88dabd5e4fcd0192d2116f6926fef788cddb754e73";
s = "9c9c045ebaa1b828c32f82ace0d18daebf5e156eb7cbfdc1eff4399a8a900ae7";
result = false;
};
{ msg = "60cd64b2cd2be6c33859b94875120361a24085f3765cb8b2bf11e026fa9d8855dbe435acf7882e84f3c7857f96e2baab4d9afe4588e4a82e17a78827bfdb5ddbd1c211fbc2e6d884cddd7cb9d90d5bf4a7311b83f352508033812c776a0e00c003c7e0d628e50736c7512df0acfa9f2320bd102229f46495ae6d0857cc452a84";
qx = "2d98ea01f754d34bbc3003df5050200abf445ec728556d7ed7d5c54c55552b6d";
qy = "9b52672742d637a32add056dfd6d8792f2a33c2e69dafabea09b960bc61e230a";
r = "06108e525f845d0155bf60193222b3219c98e3d49424c2fb2a0987f825c17959";
s = "62b5cdd591e5b507e560167ba8f6f7cda74673eb315680cb89ccbc4eec477dce";
result = true;
};
] | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Meta.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.ECDSA.Test.Vectors.fst"
} | [
{
"abbrev": false,
"full_module": "Lib.Meta",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.ECDSA.Test",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.ECDSA.Test",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Prims.list Spec.ECDSA.Test.Vectors.vec_SigVer | Prims.Tot | [
"total"
] | [] | [
"Prims.Cons",
"Spec.ECDSA.Test.Vectors.vec_SigVer",
"Spec.ECDSA.Test.Vectors.Mkvec_SigVer",
"Prims.Nil"
] | [] | false | false | false | true | false | let sigver_vectors_sha2_384:list vec_SigVer =
| [
{
msg
=
"fe9838f007bdc6afcd626974fcc6833f06b6fd970427b962d75c2aeadbef386bec8d018106197fe2547d2af02e7a7949965d5fbc4c5db909a95b9858426a33c080b0b25dae8b56c5cbc6c4eec3dbd81635c79457eaef4fab39e662a1d05b2481eda8c1074ae2d1704c8a3f769686a1f965ef3c87602efc288c7f9ff8cd5e22a4";
qx = "40ded13dbbe72c629c38f07f7f95cf75a50e2a524897604c84fafde5e4cafb9f";
qy = "a17202e92d7d6a37c438779349fd79567d75a40ef22b7d09ca21ccf4aec9a66c";
r = "be34730c31730b4e412e6c52c23edbd36583ace2102b39afa11d24b6848cb77f";
s = "03655202d5fd8c9e3ae971b6f080640c406112fd95e7015874e9b6ee77752b10";
result = false
};
{
msg
=
"b69043b9b331da392b5dd689142dfc72324265da08f14abcedf03ad8263e6bdccbc75098a2700bbba1979de84c8f12891aa0d000f8a1abad7dde4981533f21da59cc80d9cf94517f3b61d1a7d9eecb2fcf052e1fc9e7188c031b86305e4a436a37948071f046e306befb8511dc03a53dc8769a90a86e9b4fdbf05dcdfa35ab73";
qx = "1f80e19ffeb51dd74f1c397ac3dfd3415ab16ebd0847ed119e6c3b15a1a884b8";
qy = "9b395787371dbfb55d1347d7bed1c261d2908121fb78de1d1bf2d00666a62aed";
r = "249ca2c3eb6e04ac57334c2f75dc5e658bbb485bf187100774f5099dd13ef707";
s = "97363a05202b602d13166346694e38135bbce025be94950e9233f4c8013bf5bf";
result = false
};
{
msg
=
"d2fcaaede8b879c064b0aa46e68efc278a469b80a7f7e1939ec2ebc96c76206f23395967279c181fea157ebb79dfadc68e31345f07f13305c80de0d85e4330d3a45f957c5c2526b945838ce5a9c2844b6b2a665c0f70b748b1213a8cf20ba5dbdf8cab231f433da522104a5cd027d3e36bb373c4ed404d9af0cbec6f85ec2193";
qx = "ce4dcfa7384c83443ace0fb82c4ac1adfa100a9b2c7bf09f093f8b6d084e50c2";
qy = "d98ae7b91abee648d0bfde192703741ac21daad7262af418b50e406d825eb0d6";
r = "597e1e04d93a6b444ccc447a48651f17657ff43fb65fe94461d2bf816b01af40";
s = "359fe3817963548e676d6da34c2d0866aa42499237b682002889eaf8893814d2";
result = true
};
{
msg
=
"06cd86481865181cef7acdc3202824970ec2d97662b519c4b588dc9e51617c068282b1a11a15bf7efc4858a2f37a3d74b05fb5790eb68338c8009b4da9b4270514d387a2e016a99ee109841e884a7909504ef31a5454e214663f830f23a5a76f91402fca5f5d61699fa874597bdbfb1ecff8f07ddbd07ef61e97d0d5262ef314";
qx = "1b677f535ac69d1acd4592c0d12fac13c9131e5a6f8ab4f9d0afdcb3a3f327e0";
qy = "5dca2c73ec89e58ef8267cba2bb5eb0f551f412f9dc087c1a6944f0ce475277a";
r = "df0b0cd76d2555d4c38b3d70bfdf964884d0beeb9f74385f0893e87d20c9642d";
s = "128299aabf1f5496112be1fe04365f5f8215b08a040abdfeca4626f4d15c005b";
result = false
};
{
msg
=
"59ad297397f3503604a4a2d098a4f00a368ad95c6101b3d38f9d49d908776c5a6c8654b006adb7939ffb6c30afa325b54185d82c3cc0d836850dce54d3408b257c3a961d11fafe2b74ba8bddfc1102fa656d1028baf94c38340c26a11e992aab71ce3732271b767358671b25225926f3a4b9ec5f82c059f0c7d1446d5d9e4251";
qx = "7ffc2853f3e17887dda13b0eb43f183ce50a5ac0f8bba75fb1921172484f9b94";
qy = "4cc523d14192f80bd5b27d30b3b41e064da87bfbae15572dd382b9a176c123a2";
r = "3156176d52eb26f9391229de4251993a41b8172f78970bb70e32a245be4bb653";
s = "62827a29e12d2f29b00fb2d02dd5f2d5412e17a4455f4431a5c996881fdfc0ee";
result = false
};
{
msg
=
"8215daca87e689a20392646a6511bb7b5a82d2d995ca9de89bd9d9c0b11464b7cb1e4e9a31e3e01ad8c2cd613d5a2cb44a2a8df6899fce4c282dea1e41af0df6c36be1f320036567f8d0d32aaa79c95fe53b16668f7e1a9e5d7d039ea260fd03711b7d1c177355fc52244d49ca5b238556a5541349014683cb7da326f443b752";
qx = "5569f76dc94243cde819fb6fc85144ec67e2b5d49539f62e24d406d1b68f0058";
qy = "1208c38dbe25870deab53c486f793a1e250c9d1b8e7c147ea68b71196c440730";
r = "706f2ba4025e7c06b66d6369a3f93b2fec46c51eceff42a158f7431919506cfb";
s = "b4e75ac34a96393237fc4337789e37168d79382705b248051c9c72bcbac5f516";
result = false
};
{
msg
=
"a996b1fb800f692517a2eb80e837233193dd3e82484d3f49bd19ee0db8f7b440876b07e384c90aa8b9f7b6603ca0b5a4e06c1da0edb974a2fb9b6e7c720ddf3e5c0e314c2d189402903c08c0836776c361a284db887ebcc33e615de9720b01dadade585eef687b3346468bdafb490e56d657a9e7d44d92014069005a36c1cf63";
qx = "e4b470c65b2c04db060d7105ec6911589863d3c7f7ce48726ba3f369ea3467e8";
qy = "44c38d3ae098de05f5915a5868c17fee296a6e150beb1f000df5f3bec8fc4532";
r = "c9c347ee5717e4c759ddaf09e86f4e1db2c8658593177cfda4e6514b5e3ecb87";
s = "baae01e9e44a7b04d69c8eaaed77c9e3a36ce8962f95cc50a0db146b4e49eb40";
result = false
};
{
msg
=
"1a6e49a377a08e992353d6acc557b687b1b69a41d83d43a75fadb97b8c928cfebadebaaf99ea7fb13148807f56ea17384a7912e578e62b1b009fefb2aafca5ac85539433619b286f10643a56f8dfa47ba4d01c02510deaec18029ea6b9682022b139dcb70814164c4c90ec717ad9d925485398531cdd5992a2524498b337f97d";
qx = "96050c5fa2ddd1b2e5451d89ee74a0b7b54347364ddc0231715a6ef1146fe8dc";
qy = "e0888a9e78aeea87f6e1e9002b2651169f36c4ee53013cfc8c9912b7fd504858";
r = "2353d6cd3c21b8ea7dbc1cd940519812dbe365a3b15cd6aebba9d11cf269867a";
s = "85f560273cd9e82e6801e4cb1c8cd29cdac34a020da211d77453756b604b8fa7";
result = true
};
{
msg
=
"3e14f737c913931bc82764ebc440b12e3ce1ffe0f858c7b8f1cbd30fbbb1644fa59be1d2cca5f64a6d7dc5ed5c4420f39227516ae8eb3019ef86274d0e4d06cde7bf5e5c413243dfc421d9f141762109810e6b6a451eeb4bd8d4be1ff111426d7e44d0a916b4fe3db3594d8dd01ae90feecf8f1e230b574180cd0b8d43a3d33b";
qx = "0c07bb79f44012299fbfd5a0f31397aaf7d757f8a38437407c1b09271c6551a0";
qy = "84fe7846d5d403dc92c0091fbd39f3c5cbca3f94c10b5cae44e2e96562131b13";
r = "49e9425f82d0a8c503009cead24e12adc9d48a08594094ca4f6d13ad1e3c571d";
s = "1f1b70aaa30a8ff639aa0935944e9b88326a213ab8fce5194c1a9dec070eb433";
result = false
};
{
msg
=
"4000106127a72746db77957cbc6bfd84ae3d1d63b8190087637e93689841331e2adc1930d6df4302935f4520bbee513505cdcfca99ebc6f83af7b23b0f2e7f7defba614022ceeae9c6886e8b13f7ea253a307ac301f3536720cbe3de82ba3e98310361b61801a8304ffc91ff774948e33176ddcddf1b76437b3f02c910578d46";
qx = "71db1de1a1f38f356c91feaff5cfe395d1a5b9d23cf6aa19f38ae0bcc90a486d";
qy = "ecdd6ffb174a50f1cc792985c2f9608c399c98b8a64a69d2b5b7cdd9241f67e2";
r = "b0443b33a6f249470d2f943675009d21b9ccbead1525ae57815df86bb20470bf";
s = "316dbee27d998e09128539c269e297ac8f34b9ef8249a0619168c3495c5c1198";
result = false
};
{
msg
=
"b42e547d0e7ddd5e1069bb2d158a5b4d5d9c4310942a1bfd09490311a6e684bd3c29b0dcef86a9788b4b26fed7863f3d5e5439796b5b5ffe7aa2545d0f518ad020689ca21230f3a59e7f8cca465fe21df511e78d215fa805f5f0f88938e9d198515e6b9c819930755c6c6aea5114cd2904607243051c09dd7a147756cbc204a5";
qx = "8219b225aa15472262c648cac8de9aad4173d17a231ba24352a5a1c4eea70fad";
qy = "0fee2b08ad39fbf0db0016ef2896ca99adc07efc8c415f640f3720498be26037";
r = "134fb689101aaad3954de2819d9fbd12072fe2bc36f496bbf0d13fa72114ab96";
s = "e65c232bd915b59e087e7fd5ec90bf636cfa80526345c79a0adfd75003045d6f";
result = false
};
{
msg
=
"aa563223a7d5201febdf13cab80a03dce6077c26e751bc98a941196a28848abc495e0324013c9a2094fb15dc65d100c3e8a136a52c1780b395f42588900b641b6d4361432e2173195a2f60189f3fcc85f4e9659cae52576f20d1852d43c2b400deea3144c8e870e1906d677425d8c85037c7a42a9d249b2da4b516e04476bd45";
qx = "c934195de33b60cf00461fc3c45dad068e9f5f7af5c7fa78591e95aeb04e2617";
qy = "b588dd5f9965fdaa523b475c2812c251bc6973e2df21d9beaace976abf5728cb";
r = "71f302440eb4ed2a939b69e33e905e6fdc545c743458d38f7e1a1d456e35f389";
s = "54eaa0eb9cd7503b19a9658f0a04955d9f0ab20ebc8a0877e33c89ee88ad068f";
result = false
};
{
msg
=
"98e4babf890f52e5a04bd2a7d79bf0ae9a71967847347d87f29fb3997454c73c7979d15b5c4f4205ec3de7835d1885fb7abcf8dcde94baf08b1d691a0c74845317286540e8c9d378fefaa4762c302492f51023c0d7adbb1cc90b7b0335f11203664e71fea621bc2f59d2dbd0ee76d6597ec75510de59b6d25fa6750a71c59435";
qx = "9e1adcd48e2e3f0e4c213501808228e587c40558f52bb54ddbb6102d4048ea92";
qy = "34eff98704790938e7e0bdf87ae39807a6b77dfdc9ecdfe6dd0f241abae1aeb2";
r = "ce4f0d7480522c8dd1b02dd0eb382f22406642f038c1ede9411883d72b3e7ed0";
s = "8546e1ee3b77f9927cdaccbc2f1cf19d6b5576b0f738bb1b86a0c66b39ca56fb";
result = false
};
{
msg
=
"bb6b03ad60d6ddbf0c4d17246206e61c886f916d252bb4608149da49cef9033484080e861f91bb2400baa0cd6c5d90c2f275e2fabc12d83847f7a1c3ff0eb40c8a3dd83d07d194ba3797d27238415a2f358d7292a1991af687bcb977486980f9138b3140321485638ac7bd22ecda00ffe5009b83b90397eff24ecf22c5495d67";
qx = "93edbecb0b019c2cc03060f54cb4904b920fdb34eb83badd752be9443036ae13";
qy = "b494e9295e080a9080fe7e73249b3a5904aa84e1c028121eecd3e2cf1a55f598";
r = "eec2986d47b71995892b0915d3d5becc4dcb2ab55206d772e0189541b2184ddf";
s = "8a6c1edeb6452627ad27c8319599c54ac44cdd831ea66f13f49d90affe6ad45b";
result = true
};
{
msg
=
"33a5d489f671f396c776bc1acf193bc9a74306f4692dd8e05bcdfe28fdefbd5c09b831c204a1dec81d8e3541f324f7b474d692789013bb1eca066f82fbf3f1cf3ba64e9d8963e9ecc180b9251919e2e8a1ab05847a0d76ff67a47c00e170e38e5b319a56f59cc51038f90961ea27a9a7eb292a0a1aa2f4972568669246907a35";
qx = "3205bae876f9bd50b0713959e72457165e826cbbe3895d67320909daa48b0ebc";
qy = "d1592562273e5e0f57bbfb92cedd9af7f133255684ee050af9b6f02019bbcafa";
r = "0124f3f1c61ec458561a4eaa6c155bd29e59703d14556324924683db3a4cf43b";
s = "688a5c5fc0c7ba92210c50cce5b512a468a880e05acc21ca56571d89f45f603a";
result = false
}
] | false |
Vale.PPC64LE.Machine_s.fst | Vale.PPC64LE.Machine_s.pow2_32 | val pow2_32 : Prims.int | let pow2_32 = Vale.Def.Words_s.pow2_32 | {
"file_name": "vale/specs/hardware/Vale.PPC64LE.Machine_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 45,
"end_line": 7,
"start_col": 7,
"start_line": 7
} | module Vale.PPC64LE.Machine_s
open Vale.Arch.Heap
include Vale.Arch.HeapTypes_s
irreducible let va_qattr = () | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.HeapTypes_s.fst.checked",
"Vale.Arch.Heap.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Map.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "Vale.PPC64LE.Machine_s.fst"
} | [
{
"abbrev": false,
"full_module": "Vale.Arch.HeapTypes_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Heap",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Prims.int | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Words_s.pow2_32"
] | [] | false | false | false | true | false | let pow2_32 =
| Vale.Def.Words_s.pow2_32 | false |
|
Vale.PPC64LE.Machine_s.fst | Vale.PPC64LE.Machine_s.nat16 | val nat16 : Type0 | let nat16 = Vale.Def.Words_s.nat16 | {
"file_name": "vale/specs/hardware/Vale.PPC64LE.Machine_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 41,
"end_line": 11,
"start_col": 7,
"start_line": 11
} | module Vale.PPC64LE.Machine_s
open Vale.Arch.Heap
include Vale.Arch.HeapTypes_s
irreducible let va_qattr = ()
unfold let pow2_8 = Vale.Def.Words_s.pow2_8
unfold let pow2_32 = Vale.Def.Words_s.pow2_32
unfold let pow2_64 = Vale.Def.Words_s.pow2_64 | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.HeapTypes_s.fst.checked",
"Vale.Arch.Heap.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Map.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "Vale.PPC64LE.Machine_s.fst"
} | [
{
"abbrev": false,
"full_module": "Vale.Arch.HeapTypes_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Heap",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Words_s.nat16"
] | [] | false | false | false | true | true | let nat16 =
| Vale.Def.Words_s.nat16 | false |
|
Vale.PPC64LE.Machine_s.fst | Vale.PPC64LE.Machine_s.nat8 | val nat8 : Type0 | let nat8 = Vale.Def.Words_s.nat8 | {
"file_name": "vale/specs/hardware/Vale.PPC64LE.Machine_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 39,
"end_line": 10,
"start_col": 7,
"start_line": 10
} | module Vale.PPC64LE.Machine_s
open Vale.Arch.Heap
include Vale.Arch.HeapTypes_s
irreducible let va_qattr = ()
unfold let pow2_8 = Vale.Def.Words_s.pow2_8
unfold let pow2_32 = Vale.Def.Words_s.pow2_32
unfold let pow2_64 = Vale.Def.Words_s.pow2_64 | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.HeapTypes_s.fst.checked",
"Vale.Arch.Heap.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Map.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "Vale.PPC64LE.Machine_s.fst"
} | [
{
"abbrev": false,
"full_module": "Vale.Arch.HeapTypes_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Heap",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Words_s.nat8"
] | [] | false | false | false | true | true | let nat8 =
| Vale.Def.Words_s.nat8 | false |
|
Vale.PPC64LE.Machine_s.fst | Vale.PPC64LE.Machine_s.pow2_64 | val pow2_64 : Prims.int | let pow2_64 = Vale.Def.Words_s.pow2_64 | {
"file_name": "vale/specs/hardware/Vale.PPC64LE.Machine_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 45,
"end_line": 8,
"start_col": 7,
"start_line": 8
} | module Vale.PPC64LE.Machine_s
open Vale.Arch.Heap
include Vale.Arch.HeapTypes_s
irreducible let va_qattr = ()
unfold let pow2_8 = Vale.Def.Words_s.pow2_8 | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.HeapTypes_s.fst.checked",
"Vale.Arch.Heap.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Map.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "Vale.PPC64LE.Machine_s.fst"
} | [
{
"abbrev": false,
"full_module": "Vale.Arch.HeapTypes_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Heap",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Prims.int | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Words_s.pow2_64"
] | [] | false | false | false | true | false | let pow2_64 =
| Vale.Def.Words_s.pow2_64 | false |
|
Vale.PPC64LE.Machine_s.fst | Vale.PPC64LE.Machine_s.pow2_8 | val pow2_8 : Prims.int | let pow2_8 = Vale.Def.Words_s.pow2_8 | {
"file_name": "vale/specs/hardware/Vale.PPC64LE.Machine_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 43,
"end_line": 6,
"start_col": 7,
"start_line": 6
} | module Vale.PPC64LE.Machine_s
open Vale.Arch.Heap
include Vale.Arch.HeapTypes_s | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.HeapTypes_s.fst.checked",
"Vale.Arch.Heap.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Map.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "Vale.PPC64LE.Machine_s.fst"
} | [
{
"abbrev": false,
"full_module": "Vale.Arch.HeapTypes_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Heap",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Prims.int | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Words_s.pow2_8"
] | [] | false | false | false | true | false | let pow2_8 =
| Vale.Def.Words_s.pow2_8 | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.