effect stringclasses 48
values | original_source_type stringlengths 0 23k | opens_and_abbrevs listlengths 2 92 | isa_cross_project_example bool 1
class | source_definition stringlengths 9 57.9k | partial_definition stringlengths 7 23.3k | is_div bool 2
classes | is_type null | is_proof bool 2
classes | completed_definiton stringlengths 1 250k | dependencies dict | effect_flags listlengths 0 2 | ideal_premises listlengths 0 236 | mutual_with listlengths 0 11 | file_context stringlengths 0 407k | interleaved bool 1
class | is_simply_typed bool 2
classes | file_name stringlengths 5 48 | vconfig dict | is_simple_lemma null | source_type stringlengths 10 23k | proof_features listlengths 0 1 | name stringlengths 8 95 | source dict | verbose_type stringlengths 1 7.42k | source_range dict |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
FStar.Pervasives.Lemma | val slice_append_back (#a: Type) (x y: seq a) (i: nat)
: Lemma (requires length x <= i /\ i <= length x + length y)
(ensures slice (append x y) 0 i == append x (slice y 0 (i - length x))) | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_... | false | let slice_append_back (#a:Type) (x y:seq a) (i:nat) : Lemma
(requires length x <= i /\ i <= length x + length y)
(ensures slice (append x y) 0 i == append x (slice y 0 (i - length x)))
=
assert (equal (slice (append x y) 0 i) (append x (slice y 0 (i - length x))));
() | val slice_append_back (#a: Type) (x y: seq a) (i: nat)
: Lemma (requires length x <= i /\ i <= length x + length y)
(ensures slice (append x y) 0 i == append x (slice y 0 (i - length x)))
let slice_append_back (#a: Type) (x y: seq a) (i: nat)
: Lemma (requires length x <= i /\ i <= length x + length y)
... | false | null | true | assert (equal (slice (append x y) 0 i) (append x (slice y 0 (i - length x))));
() | {
"checked_file": "Vale.AES.GCM.fst.checked",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fst... | [
"lemma"
] | [
"FStar.Seq.Base.seq",
"Prims.nat",
"Prims.unit",
"Prims._assert",
"FStar.Seq.Base.equal",
"FStar.Seq.Base.slice",
"FStar.Seq.Base.append",
"Prims.op_Subtraction",
"FStar.Seq.Base.length",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Prims.squash",
"Prims.... | [] | module Vale.AES.GCM
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_s
open Vale.AES.AES_s
open Vale.AES.GCM_helpers
open Vale.AES.GCTR_s
open Vale.AES.GCTR
open Vale.AES.GHash_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Calc
open Vale.... | false | false | Vale.AES.GCM.fst | {
"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_el... | null | val slice_append_back (#a: Type) (x y: seq a) (i: nat)
: Lemma (requires length x <= i /\ i <= length x + length y)
(ensures slice (append x y) 0 i == append x (slice y 0 (i - length x))) | [] | Vale.AES.GCM.slice_append_back | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | x: FStar.Seq.Base.seq a -> y: FStar.Seq.Base.seq a -> i: Prims.nat
-> FStar.Pervasives.Lemma
(requires
FStar.Seq.Base.length x <= i /\ i <= FStar.Seq.Base.length x + FStar.Seq.Base.length y)
(ensures
FStar.Seq.Base.slice (FStar.Seq.Base.append x y) 0 i ==
FStar.Seq.Base.append x (F... | {
"end_col": 4,
"end_line": 319,
"start_col": 2,
"start_line": 318
} |
FStar.Pervasives.Lemma | val lemma_compute_iv_hard (iv:supported_iv_LE) (quads:seq quad32) (length_quad h_LE j0:quad32) : Lemma
(requires
~(length iv == 96/8) /\
quads == le_bytes_to_seq_quad32 (pad_to_128_bits iv) /\
j0 == ghash_incremental h_LE (Mkfour 0 0 0 0) (append quads (create 1 length_quad)) /\
length_quad == reverse... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_... | false | let lemma_compute_iv_hard (iv:supported_iv_LE) (quads:seq quad32) (length_quad h_LE j0:quad32) : Lemma
(requires
~(length iv == 96/8) /\
quads == le_bytes_to_seq_quad32 (pad_to_128_bits iv) /\
j0 == ghash_incremental h_LE (Mkfour 0 0 0 0) (append quads (create 1 length_quad)) /\
length_quad == reverse... | val lemma_compute_iv_hard (iv:supported_iv_LE) (quads:seq quad32) (length_quad h_LE j0:quad32) : Lemma
(requires
~(length iv == 96/8) /\
quads == le_bytes_to_seq_quad32 (pad_to_128_bits iv) /\
j0 == ghash_incremental h_LE (Mkfour 0 0 0 0) (append quads (create 1 length_quad)) /\
length_quad == reverse... | false | null | true | assert (two_to_nat32 (Mktwo 0 0) == 0);
let q0 = Mkfour 0 0 0 0 in
lemma_insert_nat64_nat32s q0 0 0;
assert (insert_nat64 q0 0 1 == q0);
insert_nat64_reveal ();
assert (length_quad == reverse_bytes_quad32 (insert_nat64_def (Mkfour 0 0 0 0) (8 * length iv) 0));
ghash_incremental_to_ghash h_LE (append quads (create 1 len... | {
"checked_file": "Vale.AES.GCM.fst.checked",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fst... | [
"lemma"
] | [
"Vale.AES.GCM_s.supported_iv_LE",
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.quad32",
"Prims.unit",
"Vale.AES.GCM_s.compute_iv_BE_reveal",
"Vale.AES.GHash.ghash_incremental_to_ghash",
"FStar.Seq.Base.append",
"FStar.Seq.Base.create",
"Prims._assert",
"Prims.eq2",
"Vale.Def.Types_s.reverse_bytes_qua... | [] | module Vale.AES.GCM
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_s
open Vale.AES.AES_s
open Vale.AES.GCM_helpers
open Vale.AES.GCTR_s
open Vale.AES.GCTR
open Vale.AES.GHash_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Calc
open Vale.... | false | false | Vale.AES.GCM.fst | {
"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_el... | null | val lemma_compute_iv_hard (iv:supported_iv_LE) (quads:seq quad32) (length_quad h_LE j0:quad32) : Lemma
(requires
~(length iv == 96/8) /\
quads == le_bytes_to_seq_quad32 (pad_to_128_bits iv) /\
j0 == ghash_incremental h_LE (Mkfour 0 0 0 0) (append quads (create 1 length_quad)) /\
length_quad == reverse... | [] | Vale.AES.GCM.lemma_compute_iv_hard | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
iv: Vale.AES.GCM_s.supported_iv_LE ->
quads: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
length_quad: Vale.Def.Types_s.quad32 ->
h_LE: Vale.Def.Types_s.quad32 ->
j0: Vale.Def.Types_s.quad32
-> FStar.Pervasives.Lemma
(requires
~(FStar.Seq.Base.length iv == 96 / 8) /\
quads ... | {
"end_col": 4,
"end_line": 147,
"start_col": 2,
"start_line": 139
} |
FStar.Pervasives.Lemma | val gcm_encrypt_LE_fst_helper
(iv: supported_iv_LE)
(iv_enc iv_BE: quad32)
(plain auth cipher: seq nat8)
(alg: algorithm)
(key: seq nat32)
: Lemma
(requires
is_aes_key_LE alg key /\
(let h_LE = aes_encrypt_LE alg key (Mkfour 0 0 0 0) in
iv_enc == inc32 (... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_... | false | let gcm_encrypt_LE_fst_helper (iv:supported_iv_LE) (iv_enc iv_BE:quad32) (plain auth cipher:seq nat8) (alg:algorithm) (key:seq nat32) : Lemma
(requires
is_aes_key_LE alg key /\
(let h_LE = aes_encrypt_LE alg key (Mkfour 0 0 0 0) in
iv_enc == inc32 (compute_iv_BE h_LE iv) 1 /\
cipher == gctr_encrypt_LE ... | val gcm_encrypt_LE_fst_helper
(iv: supported_iv_LE)
(iv_enc iv_BE: quad32)
(plain auth cipher: seq nat8)
(alg: algorithm)
(key: seq nat32)
: Lemma
(requires
is_aes_key_LE alg key /\
(let h_LE = aes_encrypt_LE alg key (Mkfour 0 0 0 0) in
iv_enc == inc32 (... | false | null | true | gcm_encrypt_LE_reveal () | {
"checked_file": "Vale.AES.GCM.fst.checked",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fst... | [
"lemma"
] | [
"Vale.AES.GCM_s.supported_iv_LE",
"Vale.Def.Types_s.quad32",
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat8",
"Vale.AES.AES_common_s.algorithm",
"Vale.Def.Words_s.nat32",
"Vale.AES.GCM_s.gcm_encrypt_LE_reveal",
"Prims.unit",
"Prims.l_and",
"Vale.AES.AES_s.is_aes_key_LE",
"Prims.eq2",
"Vale.AES.G... | [] | module Vale.AES.GCM
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_s
open Vale.AES.AES_s
open Vale.AES.GCM_helpers
open Vale.AES.GCTR_s
open Vale.AES.GCTR
open Vale.AES.GHash_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Calc
open Vale.... | false | false | Vale.AES.GCM.fst | {
"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_el... | null | val gcm_encrypt_LE_fst_helper
(iv: supported_iv_LE)
(iv_enc iv_BE: quad32)
(plain auth cipher: seq nat8)
(alg: algorithm)
(key: seq nat32)
: Lemma
(requires
is_aes_key_LE alg key /\
(let h_LE = aes_encrypt_LE alg key (Mkfour 0 0 0 0) in
iv_enc == inc32 (... | [] | Vale.AES.GCM.gcm_encrypt_LE_fst_helper | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
iv: Vale.AES.GCM_s.supported_iv_LE ->
iv_enc: Vale.Def.Types_s.quad32 ->
iv_BE: Vale.Def.Types_s.quad32 ->
plain: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 ->
auth: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 ->
cipher: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 ->
alg: Vale.AES.AES_common_s.algo... | {
"end_col": 26,
"end_line": 160,
"start_col": 2,
"start_line": 160
} |
FStar.Pervasives.Lemma | val lemma_gcm_encrypt_decrypt_equiv (alg:algorithm) (key:seq nat32) (iv:supported_iv_LE) (j0_BE:quad32) (plain cipher auth alleged_tag:seq nat8) : Lemma
(requires
is_aes_key_LE alg key /\
(let h_LE = aes_encrypt_LE alg key (Mkfour 0 0 0 0) in
j0_BE = compute_iv_BE h_LE iv) /\
length cipher < pow2_32 /\... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_... | false | let lemma_gcm_encrypt_decrypt_equiv (alg:algorithm) (key:seq nat32) (iv:supported_iv_LE) (j0_BE:quad32) (plain cipher auth alleged_tag:seq nat8) : Lemma
(requires
is_aes_key_LE alg key /\
(let h_LE = aes_encrypt_LE alg key (Mkfour 0 0 0 0) in
j0_BE = compute_iv_BE h_LE iv) /\
length cipher < pow2_32 /\... | val lemma_gcm_encrypt_decrypt_equiv (alg:algorithm) (key:seq nat32) (iv:supported_iv_LE) (j0_BE:quad32) (plain cipher auth alleged_tag:seq nat8) : Lemma
(requires
is_aes_key_LE alg key /\
(let h_LE = aes_encrypt_LE alg key (Mkfour 0 0 0 0) in
j0_BE = compute_iv_BE h_LE iv) /\
length cipher < pow2_32 /\... | false | null | true | gcm_encrypt_LE_reveal ();
gcm_decrypt_LE_reveal ();
() | {
"checked_file": "Vale.AES.GCM.fst.checked",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fst... | [
"lemma"
] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat32",
"Vale.AES.GCM_s.supported_iv_LE",
"Vale.Def.Types_s.quad32",
"Vale.Def.Words_s.nat8",
"Prims.unit",
"Vale.AES.GCM_s.gcm_decrypt_LE_reveal",
"Vale.AES.GCM_s.gcm_encrypt_LE_reveal",
"Prims.l_and",
"Vale.AES.AES_s.is... | [] | module Vale.AES.GCM
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_s
open Vale.AES.AES_s
open Vale.AES.GCM_helpers
open Vale.AES.GCTR_s
open Vale.AES.GCTR
open Vale.AES.GHash_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Calc
open Vale.... | false | false | Vale.AES.GCM.fst | {
"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_el... | null | val lemma_gcm_encrypt_decrypt_equiv (alg:algorithm) (key:seq nat32) (iv:supported_iv_LE) (j0_BE:quad32) (plain cipher auth alleged_tag:seq nat8) : Lemma
(requires
is_aes_key_LE alg key /\
(let h_LE = aes_encrypt_LE alg key (Mkfour 0 0 0 0) in
j0_BE = compute_iv_BE h_LE iv) /\
length cipher < pow2_32 /\... | [] | Vale.AES.GCM.lemma_gcm_encrypt_decrypt_equiv | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Words_s.nat32 ->
iv: Vale.AES.GCM_s.supported_iv_LE ->
j0_BE: Vale.Def.Types_s.quad32 ->
plain: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 ->
cipher: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 ->
auth: FStar.Seq.Base.seq V... | {
"end_col": 4,
"end_line": 728,
"start_col": 2,
"start_line": 726
} |
FStar.Pervasives.Lemma | val lemma_le_bytes_to_quad32_prefix_equality
(b0: seq nat8 {length b0 == 16})
(b1: seq nat8 {length b1 == 16})
: Lemma (requires slice b0 0 12 == slice b1 0 12)
(ensures lower3_equal (le_bytes_to_quad32 b0) (le_bytes_to_quad32 b1)) | [
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Seq_s",
"short_module": null
},
{
"abbrev": false,
"ful... | false | let lemma_le_bytes_to_quad32_prefix_equality (b0:seq nat8 {length b0 == 16}) (b1:seq nat8 {length b1 == 16}) : Lemma
(requires slice b0 0 12 == slice b1 0 12)
(ensures lower3_equal (le_bytes_to_quad32 b0) (le_bytes_to_quad32 b1))
=
let q0 = le_bytes_to_quad32 b0 in
let q1 = le_bytes_to_quad32 b1 in
le_bytes... | val lemma_le_bytes_to_quad32_prefix_equality
(b0: seq nat8 {length b0 == 16})
(b1: seq nat8 {length b1 == 16})
: Lemma (requires slice b0 0 12 == slice b1 0 12)
(ensures lower3_equal (le_bytes_to_quad32 b0) (le_bytes_to_quad32 b1))
let lemma_le_bytes_to_quad32_prefix_equality
(b0: seq nat8 {... | false | null | true | let q0 = le_bytes_to_quad32 b0 in
let q1 = le_bytes_to_quad32 b1 in
le_bytes_to_quad32_reveal ();
reveal_opaque (`%seq_to_seq_four_LE) (seq_to_seq_four_LE #nat8);
assert (forall (i: int).
(0 <= i /\ i < 12) ==>
(index b0 i == index (slice b0 0 12) i /\ index b1 i == index (slice b1 0 12) i)) | {
"checked_file": "Vale.AES.GCM.fst.checked",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fst... | [
"lemma"
] | [
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat8",
"Prims.eq2",
"Prims.int",
"FStar.Seq.Base.length",
"Prims._assert",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_LessThan",
"FStar.Seq.Base.index",
"FStar.Seq.Base.slice",
"Prims.unit",
... | [] | module Vale.AES.GCM
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_s
open Vale.AES.AES_s
open Vale.AES.GCM_helpers
open Vale.AES.GCTR_s
open Vale.AES.GCTR
open Vale.AES.GHash_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Calc
open Vale.... | false | false | Vale.AES.GCM.fst | {
"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_el... | null | val lemma_le_bytes_to_quad32_prefix_equality
(b0: seq nat8 {length b0 == 16})
(b1: seq nat8 {length b1 == 16})
: Lemma (requires slice b0 0 12 == slice b1 0 12)
(ensures lower3_equal (le_bytes_to_quad32 b0) (le_bytes_to_quad32 b1)) | [] | Vale.AES.GCM.lemma_le_bytes_to_quad32_prefix_equality | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
b0: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 {FStar.Seq.Base.length b0 == 16} ->
b1: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 {FStar.Seq.Base.length b1 == 16}
-> FStar.Pervasives.Lemma (requires FStar.Seq.Base.slice b0 0 12 == FStar.Seq.Base.slice b1 0 12)
(ensures
Vale.AES.GCM.lower3_equal (Va... | {
"end_col": 80,
"end_line": 48,
"start_col": 3,
"start_line": 37
} |
FStar.Pervasives.Lemma | val lemma_length_simplifier (s bytes t:seq quad32) (num_bytes:nat) : Lemma
(requires t == (if num_bytes > (length s) * 16 then append s bytes else s) /\
(num_bytes <= (length s) * 16 ==> num_bytes == (length s * 16)) /\
length s * 16 <= num_bytes /\
num_bytes < length s * 16 + 16 /... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_... | false | let lemma_length_simplifier (s bytes t:seq quad32) (num_bytes:nat) : Lemma
(requires t == (if num_bytes > (length s) * 16 then append s bytes else s) /\
(num_bytes <= (length s) * 16 ==> num_bytes == (length s * 16)) /\
length s * 16 <= num_bytes /\
num_bytes < length s * 16 + 16 /... | val lemma_length_simplifier (s bytes t:seq quad32) (num_bytes:nat) : Lemma
(requires t == (if num_bytes > (length s) * 16 then append s bytes else s) /\
(num_bytes <= (length s) * 16 ==> num_bytes == (length s * 16)) /\
length s * 16 <= num_bytes /\
num_bytes < length s * 16 + 16 /... | false | null | true | if num_bytes > (length s) * 16
then (())
else
(calc ( == ) {
slice (le_seq_quad32_to_bytes (append s bytes)) 0 num_bytes;
( == ) { append_distributes_le_seq_quad32_to_bytes s bytes }
slice (append (le_seq_quad32_to_bytes s) (le_seq_quad32_to_bytes bytes)) 0 num_bytes;
( == ) { Vale.Lib.Seqs.le... | {
"checked_file": "Vale.AES.GCM.fst.checked",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fst... | [
"lemma"
] | [
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.quad32",
"Prims.nat",
"Prims.op_GreaterThan",
"FStar.Mul.op_Star",
"FStar.Seq.Base.length",
"Prims.bool",
"Prims.unit",
"FStar.Calc.calc_finish",
"Vale.Def.Types_s.nat8",
"Prims.eq2",
"FStar.Seq.Base.slice",
"Vale.Def.Types_s.le_seq_quad32_to_bytes",
... | [] | module Vale.AES.GCM
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_s
open Vale.AES.AES_s
open Vale.AES.GCM_helpers
open Vale.AES.GCTR_s
open Vale.AES.GCTR
open Vale.AES.GHash_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Calc
open Vale.... | false | false | Vale.AES.GCM.fst | {
"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_el... | null | val lemma_length_simplifier (s bytes t:seq quad32) (num_bytes:nat) : Lemma
(requires t == (if num_bytes > (length s) * 16 then append s bytes else s) /\
(num_bytes <= (length s) * 16 ==> num_bytes == (length s * 16)) /\
length s * 16 <= num_bytes /\
num_bytes < length s * 16 + 16 /... | [] | Vale.AES.GCM.lemma_length_simplifier | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
s: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
bytes: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
t: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
num_bytes: Prims.nat
-> FStar.Pervasives.Lemma
(requires
t ==
(match num_bytes > FStar.Seq.Base.length s * 16 with
| t... | {
"end_col": 3,
"end_line": 611,
"start_col": 2,
"start_line": 598
} |
FStar.Pervasives.Lemma | val gcm_encrypt_LE_snd_helper
(iv: supported_iv_LE)
(j0_BE length_quad32 hash mac: quad32)
(plain auth cipher: seq nat8)
(alg: algorithm)
(key: seq nat32)
: Lemma
(requires
is_aes_key_LE alg key /\
(let h_LE = aes_encrypt_LE alg key (Mkfour 0 0 0 0) in
j... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_... | false | let gcm_encrypt_LE_snd_helper (iv:supported_iv_LE) (j0_BE length_quad32 hash mac:quad32) (plain auth cipher:seq nat8) (alg:algorithm) (key:seq nat32) : Lemma
(requires
is_aes_key_LE alg key /\
(let h_LE = aes_encrypt_LE alg key (Mkfour 0 0 0 0) in
j0_BE = compute_iv_BE h_LE iv /\
length plain < pow2_32... | val gcm_encrypt_LE_snd_helper
(iv: supported_iv_LE)
(j0_BE length_quad32 hash mac: quad32)
(plain auth cipher: seq nat8)
(alg: algorithm)
(key: seq nat32)
: Lemma
(requires
is_aes_key_LE alg key /\
(let h_LE = aes_encrypt_LE alg key (Mkfour 0 0 0 0) in
j... | false | null | true | insert_nat64_reveal ();
gcm_encrypt_LE_reveal () | {
"checked_file": "Vale.AES.GCM.fst.checked",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fst... | [
"lemma"
] | [
"Vale.AES.GCM_s.supported_iv_LE",
"Vale.Def.Types_s.quad32",
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat8",
"Vale.AES.AES_common_s.algorithm",
"Vale.Def.Words_s.nat32",
"Vale.AES.GCM_s.gcm_encrypt_LE_reveal",
"Prims.unit",
"Vale.Def.Types_s.insert_nat64_reveal",
"Prims.l_and",
"Vale.AES.AES_s.is... | [] | module Vale.AES.GCM
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_s
open Vale.AES.AES_s
open Vale.AES.GCM_helpers
open Vale.AES.GCTR_s
open Vale.AES.GCTR
open Vale.AES.GHash_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Calc
open Vale.... | false | false | Vale.AES.GCM.fst | {
"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_el... | null | val gcm_encrypt_LE_snd_helper
(iv: supported_iv_LE)
(j0_BE length_quad32 hash mac: quad32)
(plain auth cipher: seq nat8)
(alg: algorithm)
(key: seq nat32)
: Lemma
(requires
is_aes_key_LE alg key /\
(let h_LE = aes_encrypt_LE alg key (Mkfour 0 0 0 0) in
j... | [] | Vale.AES.GCM.gcm_encrypt_LE_snd_helper | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
iv: Vale.AES.GCM_s.supported_iv_LE ->
j0_BE: Vale.Def.Types_s.quad32 ->
length_quad32: Vale.Def.Types_s.quad32 ->
hash: Vale.Def.Types_s.quad32 ->
mac: Vale.Def.Types_s.quad32 ->
plain: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 ->
auth: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 ->
cipher:... | {
"end_col": 26,
"end_line": 198,
"start_col": 2,
"start_line": 197
} |
FStar.Pervasives.Lemma | val decrypt_helper
(alg:algorithm) (key:seq nat8) (iv:supported_iv_LE) (cipher:seq nat8) (auth:seq nat8)
(rax:nat64) (alleged_tag_quad computed_tag:quad32) : Lemma
(requires
is_aes_key alg key /\
length cipher < pow2_32 /\
length auth < pow2_32 /\
(if alleged_tag_quad = computed_tag then rax =... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_... | false | let decrypt_helper
(alg:algorithm) (key:seq nat8) (iv:supported_iv_LE) (cipher:seq nat8) (auth:seq nat8)
(rax:nat64) (alleged_tag_quad computed_tag:quad32) : Lemma
(requires
is_aes_key alg key /\
length cipher < pow2_32 /\
length auth < pow2_32 /\
(if alleged_tag_quad = computed_tag then rax =... | val decrypt_helper
(alg:algorithm) (key:seq nat8) (iv:supported_iv_LE) (cipher:seq nat8) (auth:seq nat8)
(rax:nat64) (alleged_tag_quad computed_tag:quad32) : Lemma
(requires
is_aes_key alg key /\
length cipher < pow2_32 /\
length auth < pow2_32 /\
(if alleged_tag_quad = computed_tag then rax =... | false | null | true | gcm_decrypt_LE_reveal ();
insert_nat64_reveal ();
le_quad32_to_bytes_injective_specific alleged_tag_quad computed_tag;
() | {
"checked_file": "Vale.AES.GCM.fst.checked",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fst... | [
"lemma"
] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat8",
"Vale.AES.GCM_s.supported_iv_LE",
"Vale.Def.Words_s.nat64",
"Vale.Def.Types_s.quad32",
"Prims.unit",
"Vale.Arch.Types.le_quad32_to_bytes_injective_specific",
"Vale.Def.Types_s.insert_nat64_reveal",
"Vale.AES.GCM_s.gc... | [] | module Vale.AES.GCM
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_s
open Vale.AES.AES_s
open Vale.AES.GCM_helpers
open Vale.AES.GCTR_s
open Vale.AES.GCTR
open Vale.AES.GHash_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Calc
open Vale.... | false | false | Vale.AES.GCM.fst | {
"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_el... | null | val decrypt_helper
(alg:algorithm) (key:seq nat8) (iv:supported_iv_LE) (cipher:seq nat8) (auth:seq nat8)
(rax:nat64) (alleged_tag_quad computed_tag:quad32) : Lemma
(requires
is_aes_key alg key /\
length cipher < pow2_32 /\
length auth < pow2_32 /\
(if alleged_tag_quad = computed_tag then rax =... | [] | Vale.AES.GCM.decrypt_helper | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 ->
iv: Vale.AES.GCM_s.supported_iv_LE ->
cipher: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 ->
auth: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 ->
rax: Vale.Def.Words_s.nat64 ->
alleged_tag_quad: Vale.Def.Type... | {
"end_col": 4,
"end_line": 1174,
"start_col": 2,
"start_line": 1159
} |
FStar.Pervasives.Lemma | val gcm_blocks_helper_dec_simplified (alg:algorithm) (key:seq nat32)
(p128x6 p128 p_bytes c128x6 c128 c_bytes:seq quad32)
(auth_bytes alleged_tag:seq nat8)
(p_num_bytes:nat)
(iv:supported_iv_LE) (j0_BE:quad32) : Lemma
(requires // Required by... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_... | false | let gcm_blocks_helper_dec_simplified (alg:algorithm) (key:seq nat32)
(p128x6 p128 p_bytes c128x6 c128 c_bytes:seq quad32)
(auth_bytes alleged_tag:seq nat8)
(p_num_bytes:nat)
(iv:supported_iv_LE) (j0_BE:quad32) : Lemma
(requires // Required by... | val gcm_blocks_helper_dec_simplified (alg:algorithm) (key:seq nat32)
(p128x6 p128 p_bytes c128x6 c128 c_bytes:seq quad32)
(auth_bytes alleged_tag:seq nat8)
(p_num_bytes:nat)
(iv:supported_iv_LE) (j0_BE:quad32) : Lemma
(requires // Required by... | false | null | true | gcm_blocks_helper_enc alg key p128x6 p128 p_bytes c128x6 c128 c_bytes auth_bytes p_num_bytes iv
j0_BE;
let plain_raw_quads =
if p_num_bytes > (length p128x6 + length p128) * 16
then append (append p128x6 p128) p_bytes
else append p128x6 p128
in
let cipher_raw_quads:seq quad32 =
if p_num_bytes > (length p128x6... | {
"checked_file": "Vale.AES.GCM.fst.checked",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fst... | [
"lemma"
] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat32",
"Vale.Def.Types_s.quad32",
"Vale.Def.Words_s.nat8",
"Prims.nat",
"Vale.AES.GCM_s.supported_iv_LE",
"Prims.unit",
"Vale.AES.GCM.lemma_gcm_encrypt_decrypt_equiv",
"Prims._assert",
"Prims.eq2",
"Vale.Def.Types_s.na... | [] | module Vale.AES.GCM
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_s
open Vale.AES.AES_s
open Vale.AES.GCM_helpers
open Vale.AES.GCTR_s
open Vale.AES.GCTR
open Vale.AES.GHash_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Calc
open Vale.... | false | false | Vale.AES.GCM.fst | {
"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_el... | null | val gcm_blocks_helper_dec_simplified (alg:algorithm) (key:seq nat32)
(p128x6 p128 p_bytes c128x6 c128 c_bytes:seq quad32)
(auth_bytes alleged_tag:seq nat8)
(p_num_bytes:nat)
(iv:supported_iv_LE) (j0_BE:quad32) : Lemma
(requires // Required by... | [] | Vale.AES.GCM.gcm_blocks_helper_dec_simplified | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Words_s.nat32 ->
p128x6: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
p128: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
p_bytes: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
c128x6: FStar.Seq.Base.seq Vale.Def.Types_s.... | {
"end_col": 4,
"end_line": 798,
"start_col": 2,
"start_line": 778
} |
FStar.Pervasives.Lemma | val gcm_blocks_helper_simplified (alg:algorithm) (key:seq nat32)
(a128 a_bytes p128x6 p128 p_bytes c128x6 c128 c_bytes:seq quad32)
(p_num_bytes a_num_bytes:nat)
(iv:supported_iv_LE) (j0_BE h enc_hash length_quad:quad32) : Lemma
(requires // Required by gcm_bloc... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_... | false | let gcm_blocks_helper_simplified (alg:algorithm) (key:seq nat32)
(a128 a_bytes p128x6 p128 p_bytes c128x6 c128 c_bytes:seq quad32)
(p_num_bytes a_num_bytes:nat)
(iv:supported_iv_LE) (j0_BE h enc_hash length_quad:quad32) : Lemma
(requires // Required by gcm_bloc... | val gcm_blocks_helper_simplified (alg:algorithm) (key:seq nat32)
(a128 a_bytes p128x6 p128 p_bytes c128x6 c128 c_bytes:seq quad32)
(p_num_bytes a_num_bytes:nat)
(iv:supported_iv_LE) (j0_BE h enc_hash length_quad:quad32) : Lemma
(requires // Required by gcm_bloc... | false | null | true | gcm_blocks_helper alg key a128 a_bytes p128x6 p128 p_bytes c128x6 c128 c_bytes p_num_bytes
a_num_bytes iv j0_BE h enc_hash length_quad;
let auth_raw_quads = if a_num_bytes > (length a128) * 16 then append a128 a_bytes else a128 in
let plain_raw_quads =
if p_num_bytes > (length p128x6 + length p128) * 16
then appe... | {
"checked_file": "Vale.AES.GCM.fst.checked",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fst... | [
"lemma"
] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat32",
"Vale.Def.Types_s.quad32",
"Prims.nat",
"Vale.AES.GCM_s.supported_iv_LE",
"Prims.unit",
"Vale.AES.GCM.lemma_length_simplifier",
"FStar.Seq.Base.append",
"Prims.op_GreaterThan",
"FStar.Mul.op_Star",
"Prims.op_Add... | [] | module Vale.AES.GCM
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_s
open Vale.AES.AES_s
open Vale.AES.GCM_helpers
open Vale.AES.GCTR_s
open Vale.AES.GCTR
open Vale.AES.GHash_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Calc
open Vale.... | false | false | Vale.AES.GCM.fst | {
"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_el... | null | val gcm_blocks_helper_simplified (alg:algorithm) (key:seq nat32)
(a128 a_bytes p128x6 p128 p_bytes c128x6 c128 c_bytes:seq quad32)
(p_num_bytes a_num_bytes:nat)
(iv:supported_iv_LE) (j0_BE h enc_hash length_quad:quad32) : Lemma
(requires // Required by gcm_bloc... | [] | Vale.AES.GCM.gcm_blocks_helper_simplified | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Words_s.nat32 ->
a128: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
a_bytes: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
p128x6: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
p128: FStar.Seq.Base.seq Vale.Def.Types_s.qu... | {
"end_col": 4,
"end_line": 712,
"start_col": 2,
"start_line": 695
} |
FStar.Pervasives.Lemma | val gcm_blocks_dec_helper_simplified (alg:algorithm) (key:seq nat32)
(a128 a_bytes p128x6 p128 p_bytes c128x6 c128 c_bytes:seq quad32)
(p_num_bytes a_num_bytes:nat)
(iv:supported_iv_LE) (j0_BE h enc_hash length_quad:quad32) : Lemma
(requires // Required by gcm_... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_... | false | let gcm_blocks_dec_helper_simplified (alg:algorithm) (key:seq nat32)
(a128 a_bytes p128x6 p128 p_bytes c128x6 c128 c_bytes:seq quad32)
(p_num_bytes a_num_bytes:nat)
(iv:supported_iv_LE) (j0_BE h enc_hash length_quad:quad32) : Lemma
(requires // Required by gcm_... | val gcm_blocks_dec_helper_simplified (alg:algorithm) (key:seq nat32)
(a128 a_bytes p128x6 p128 p_bytes c128x6 c128 c_bytes:seq quad32)
(p_num_bytes a_num_bytes:nat)
(iv:supported_iv_LE) (j0_BE h enc_hash length_quad:quad32) : Lemma
(requires // Required by gcm_... | false | null | true | gcm_blocks_dec_helper alg key a128 a_bytes p128x6 p128 p_bytes c128x6 c128 c_bytes p_num_bytes
a_num_bytes iv j0_BE h enc_hash length_quad;
let auth_raw_quads = if a_num_bytes > (length a128) * 16 then append a128 a_bytes else a128 in
let plain_raw_quads =
if p_num_bytes > (length p128x6 + length p128) * 16
then ... | {
"checked_file": "Vale.AES.GCM.fst.checked",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fst... | [
"lemma"
] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat32",
"Vale.Def.Types_s.quad32",
"Prims.nat",
"Vale.AES.GCM_s.supported_iv_LE",
"Prims.unit",
"Vale.AES.GCM.lemma_length_simplifier",
"FStar.Seq.Base.append",
"Prims.op_GreaterThan",
"FStar.Mul.op_Star",
"Prims.op_Add... | [] | module Vale.AES.GCM
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_s
open Vale.AES.AES_s
open Vale.AES.GCM_helpers
open Vale.AES.GCTR_s
open Vale.AES.GCTR
open Vale.AES.GHash_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Calc
open Vale.... | false | false | Vale.AES.GCM.fst | {
"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_el... | null | val gcm_blocks_dec_helper_simplified (alg:algorithm) (key:seq nat32)
(a128 a_bytes p128x6 p128 p_bytes c128x6 c128 c_bytes:seq quad32)
(p_num_bytes a_num_bytes:nat)
(iv:supported_iv_LE) (j0_BE h enc_hash length_quad:quad32) : Lemma
(requires // Required by gcm_... | [] | Vale.AES.GCM.gcm_blocks_dec_helper_simplified | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Words_s.nat32 ->
a128: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
a_bytes: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
p128x6: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
p128: FStar.Seq.Base.seq Vale.Def.Types_s.qu... | {
"end_col": 4,
"end_line": 1145,
"start_col": 2,
"start_line": 1128
} |
FStar.Pervasives.Lemma | val gcm_blocks_helper_enc
(alg: algorithm)
(key: seq nat32)
(p128x6 p128 p_bytes c128x6 c128 c_bytes: seq quad32)
(auth_bytes: seq nat8)
(p_num_bytes: nat)
(iv: supported_iv_LE)
(j0_BE: quad32)
: Lemma
(requires
length p128x6 * 16 + length p128 * 16 <= p_num_b... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_... | false | let gcm_blocks_helper_enc (alg:algorithm) (key:seq nat32)
(p128x6 p128 p_bytes c128x6 c128 c_bytes:seq quad32)
(auth_bytes:seq nat8)
(p_num_bytes:nat)
(iv:supported_iv_LE) (j0_BE:quad32) : Lemma
(requires // Required by gcm_blocks
... | val gcm_blocks_helper_enc
(alg: algorithm)
(key: seq nat32)
(p128x6 p128 p_bytes c128x6 c128 c_bytes: seq quad32)
(auth_bytes: seq nat8)
(p_num_bytes: nat)
(iv: supported_iv_LE)
(j0_BE: quad32)
: Lemma
(requires
length p128x6 * 16 + length p128 * 16 <= p_num_b... | false | null | true | let ctr_BE_2:quad32 = inc32 j0_BE 1 in
let plain:seq quad32 =
if p_num_bytes > (length p128x6 + length p128) * 16
then append (append p128x6 p128) p_bytes
else append p128x6 p128
in
let cipher:seq quad32 =
if p_num_bytes > (length p128x6 + length p128) * 16
then append (append c128x6 c128) c_bytes
else appe... | {
"checked_file": "Vale.AES.GCM.fst.checked",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fst... | [
"lemma"
] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat32",
"Vale.Def.Types_s.quad32",
"Vale.Def.Words_s.nat8",
"Prims.nat",
"Vale.AES.GCM_s.supported_iv_LE",
"Prims.unit",
"Vale.AES.GCM.gcm_encrypt_LE_fst_helper",
"Prims.op_GreaterThan",
"FStar.Mul.op_Star",
"Prims.op_A... | [] | module Vale.AES.GCM
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_s
open Vale.AES.AES_s
open Vale.AES.GCM_helpers
open Vale.AES.GCTR_s
open Vale.AES.GCTR
open Vale.AES.GHash_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Calc
open Vale.... | false | false | Vale.AES.GCM.fst | {
"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_el... | null | val gcm_blocks_helper_enc
(alg: algorithm)
(key: seq nat32)
(p128x6 p128 p_bytes c128x6 c128 c_bytes: seq quad32)
(auth_bytes: seq nat8)
(p_num_bytes: nat)
(iv: supported_iv_LE)
(j0_BE: quad32)
: Lemma
(requires
length p128x6 * 16 + length p128 * 16 <= p_num_b... | [] | Vale.AES.GCM.gcm_blocks_helper_enc | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Words_s.nat32 ->
p128x6: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
p128: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
p_bytes: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
c128x6: FStar.Seq.Base.seq Vale.Def.Types_s.... | {
"end_col": 4,
"end_line": 311,
"start_col": 3,
"start_line": 259
} |
FStar.Pervasives.Lemma | val lemma_compute_iv_easy (iv_b iv_extra_b:seq quad32) (iv:supported_iv_LE) (num_bytes:nat64) (h_LE j0:quad32) : Lemma
(requires
length iv_extra_b == 1 /\
length iv_b * (128/8) <= num_bytes /\ num_bytes < length iv_b * (128/8) + 128/8 /\
num_bytes == 96/8 /\
(let iv_BE = reverse_bytes_quad32 (index iv... | [
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Seq_s",
"short_module": null
},
{
"abbrev": false,
"ful... | false | let lemma_compute_iv_easy (iv_b iv_extra_b:seq quad32) (iv:supported_iv_LE) (num_bytes:nat64) (h_LE j0:quad32) : Lemma
(requires
length iv_extra_b == 1 /\
length iv_b * (128/8) <= num_bytes /\ num_bytes < length iv_b * (128/8) + 128/8 /\
num_bytes == 96/8 /\
(let iv_BE = reverse_bytes_quad32 (index iv... | val lemma_compute_iv_easy (iv_b iv_extra_b:seq quad32) (iv:supported_iv_LE) (num_bytes:nat64) (h_LE j0:quad32) : Lemma
(requires
length iv_extra_b == 1 /\
length iv_b * (128/8) <= num_bytes /\ num_bytes < length iv_b * (128/8) + 128/8 /\
num_bytes == 96/8 /\
(let iv_BE = reverse_bytes_quad32 (index iv... | false | null | true | assert (length iv == 12);
assert (length iv_b == 0);
lemma_empty iv_b;
append_empty_l iv_extra_b;
assert (append iv_b iv_extra_b == iv_extra_b);
let q = index iv_extra_b 0 in
le_seq_quad32_to_bytes_of_singleton q;
assert (equal iv_extra_b (create 1 q));
assert (le_seq_quad32_to_bytes iv_extra_b == le_quad32_to_bytes q)... | {
"checked_file": "Vale.AES.GCM.fst.checked",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fst... | [
"lemma"
] | [
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.quad32",
"Vale.AES.GCM_s.supported_iv_LE",
"Vale.Def.Words_s.nat64",
"Prims.unit",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Vale.AES.GCM_s.compute_iv_BE",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"FStar.Calc.calc_step",
"Vale.AES.GCM.set_to... | [] | module Vale.AES.GCM
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_s
open Vale.AES.AES_s
open Vale.AES.GCM_helpers
open Vale.AES.GCTR_s
open Vale.AES.GCTR
open Vale.AES.GHash_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Calc
open Vale.... | false | false | Vale.AES.GCM.fst | {
"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_el... | null | val lemma_compute_iv_easy (iv_b iv_extra_b:seq quad32) (iv:supported_iv_LE) (num_bytes:nat64) (h_LE j0:quad32) : Lemma
(requires
length iv_extra_b == 1 /\
length iv_b * (128/8) <= num_bytes /\ num_bytes < length iv_b * (128/8) + 128/8 /\
num_bytes == 96/8 /\
(let iv_BE = reverse_bytes_quad32 (index iv... | [] | Vale.AES.GCM.lemma_compute_iv_easy | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
iv_b: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
iv_extra_b: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
iv: Vale.AES.GCM_s.supported_iv_LE ->
num_bytes: Vale.Def.Words_s.nat64 ->
h_LE: Vale.Def.Types_s.quad32 ->
j0: Vale.Def.Types_s.quad32
-> FStar.Pervasives.Lemma
(requires
... | {
"end_col": 4,
"end_line": 121,
"start_col": 2,
"start_line": 69
} |
FStar.Pervasives.Lemma | val gcm_blocks_dec_helper
(alg: algorithm)
(key: seq nat32)
(a128 a_bytes p128x6 p128 p_bytes c128x6 c128 c_bytes: seq quad32)
(p_num_bytes a_num_bytes: nat)
(iv: supported_iv_LE)
(j0_BE h enc_hash length_quad: quad32)
: Lemma
(requires
length p128x6 * 16 + length p... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_... | false | let gcm_blocks_dec_helper (alg:algorithm) (key:seq nat32)
(a128 a_bytes p128x6 p128 p_bytes c128x6 c128 c_bytes:seq quad32)
(p_num_bytes a_num_bytes:nat)
(iv:supported_iv_LE) (j0_BE h enc_hash length_quad:quad32) : Lemma
(requires // Required by gcm_blocks
... | val gcm_blocks_dec_helper
(alg: algorithm)
(key: seq nat32)
(a128 a_bytes p128x6 p128 p_bytes c128x6 c128 c_bytes: seq quad32)
(p_num_bytes a_num_bytes: nat)
(iv: supported_iv_LE)
(j0_BE h enc_hash length_quad: quad32)
: Lemma
(requires
length p128x6 * 16 + length p... | false | null | true | insert_nat64_reveal ();
let ctr_BE_1:quad32 = j0_BE in
let ctr_BE_2:quad32 = inc32 j0_BE 1 in
let plain:seq quad32 =
if p_num_bytes > (length p128x6 + length p128) * 16
then append (append p128x6 p128) p_bytes
else append p128x6 p128
in
let cipher:seq quad32 =
if p_num_bytes > (length p128x6 + length p128) * 16... | {
"checked_file": "Vale.AES.GCM.fst.checked",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fst... | [
"lemma"
] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat32",
"Vale.Def.Types_s.quad32",
"Prims.nat",
"Vale.AES.GCM_s.supported_iv_LE",
"Prims.unit",
"Prims.op_GreaterThan",
"FStar.Mul.op_Star",
"Prims.op_Addition",
"FStar.Seq.Base.length",
"FStar.Calc.calc_finish",
"Pri... | [] | module Vale.AES.GCM
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_s
open Vale.AES.AES_s
open Vale.AES.GCM_helpers
open Vale.AES.GCTR_s
open Vale.AES.GCTR
open Vale.AES.GHash_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Calc
open Vale.... | false | false | Vale.AES.GCM.fst | {
"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_el... | null | val gcm_blocks_dec_helper
(alg: algorithm)
(key: seq nat32)
(a128 a_bytes p128x6 p128 p_bytes c128x6 c128 c_bytes: seq quad32)
(p_num_bytes a_num_bytes: nat)
(iv: supported_iv_LE)
(j0_BE h enc_hash length_quad: quad32)
: Lemma
(requires
length p128x6 * 16 + length p... | [] | Vale.AES.GCM.gcm_blocks_dec_helper | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Words_s.nat32 ->
a128: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
a_bytes: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
p128x6: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
p128: FStar.Seq.Base.seq Vale.Def.Types_s.qu... | {
"end_col": 4,
"end_line": 1047,
"start_col": 2,
"start_line": 890
} |
FStar.Pervasives.Lemma | val gcm_blocks_helper
(alg: algorithm)
(key: seq nat32)
(a128 a_bytes p128x6 p128 p_bytes c128x6 c128 c_bytes: seq quad32)
(p_num_bytes a_num_bytes: nat)
(iv: supported_iv_LE)
(j0_BE h enc_hash length_quad: quad32)
: Lemma
(requires
length p128x6 * 16 + length p128 ... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_... | false | let gcm_blocks_helper (alg:algorithm) (key:seq nat32)
(a128 a_bytes p128x6 p128 p_bytes c128x6 c128 c_bytes:seq quad32)
(p_num_bytes a_num_bytes:nat)
(iv:supported_iv_LE) (j0_BE h enc_hash length_quad:quad32) : Lemma
(requires // Required by gcm_blocks
... | val gcm_blocks_helper
(alg: algorithm)
(key: seq nat32)
(a128 a_bytes p128x6 p128 p_bytes c128x6 c128 c_bytes: seq quad32)
(p_num_bytes a_num_bytes: nat)
(iv: supported_iv_LE)
(j0_BE h enc_hash length_quad: quad32)
: Lemma
(requires
length p128x6 * 16 + length p128 ... | false | null | true | let ctr_BE_1:quad32 = j0_BE in
let ctr_BE_2:quad32 = inc32 j0_BE 1 in
let plain:seq quad32 =
if p_num_bytes > (length p128x6 + length p128) * 16
then append (append p128x6 p128) p_bytes
else append p128x6 p128
in
let cipher:seq quad32 =
if p_num_bytes > (length p128x6 + length p128) * 16
then append (append c... | {
"checked_file": "Vale.AES.GCM.fst.checked",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fst... | [
"lemma"
] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat32",
"Vale.Def.Types_s.quad32",
"Prims.nat",
"Vale.AES.GCM_s.supported_iv_LE",
"Prims.unit",
"Prims.op_GreaterThan",
"FStar.Mul.op_Star",
"Prims.op_Addition",
"FStar.Seq.Base.length",
"Vale.AES.GCM.gcm_encrypt_LE_snd... | [] | module Vale.AES.GCM
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_s
open Vale.AES.AES_s
open Vale.AES.GCM_helpers
open Vale.AES.GCTR_s
open Vale.AES.GCTR
open Vale.AES.GHash_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Calc
open Vale.... | false | false | Vale.AES.GCM.fst | {
"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_el... | null | val gcm_blocks_helper
(alg: algorithm)
(key: seq nat32)
(a128 a_bytes p128x6 p128 p_bytes c128x6 c128 c_bytes: seq quad32)
(p_num_bytes a_num_bytes: nat)
(iv: supported_iv_LE)
(j0_BE h enc_hash length_quad: quad32)
: Lemma
(requires
length p128x6 * 16 + length p128 ... | [] | Vale.AES.GCM.gcm_blocks_helper | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Words_s.nat32 ->
a128: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
a_bytes: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
p128x6: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
p128: FStar.Seq.Base.seq Vale.Def.Types_s.qu... | {
"end_col": 4,
"end_line": 585,
"start_col": 3,
"start_line": 424
} |
Prims.Tot | [
{
"abbrev": false,
"full_module": "Spec.Agile.HMAC",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let reseed_interval = pow2 10 | let reseed_interval = | false | null | false | pow2 10 | {
"checked_file": "Spec.HMAC_DRBG.fsti.checked",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HMAC.fsti.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_fi... | [
"total"
] | [
"Prims.pow2"
] | [] | module Spec.HMAC_DRBG
open Lib.IntTypes
open FStar.Seq
open FStar.Mul
open Spec.Hash.Definitions
open Spec.Agile.HMAC
/// HMAC-DRBG
///
/// See 10.1.2 in
/// https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-90Ar1.pdf
///
#set-options "--max_fuel 0 --max_ifuel 0"
let is_supported_alg = function
|... | false | true | Spec.HMAC_DRBG.fsti | {
"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_el... | null | val reseed_interval : Prims.pos | [] | Spec.HMAC_DRBG.reseed_interval | {
"file_name": "specs/drbg/Spec.HMAC_DRBG.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Prims.pos | {
"end_col": 47,
"end_line": 24,
"start_col": 40,
"start_line": 24
} | |
Prims.Tot | [
{
"abbrev": false,
"full_module": "Spec.Agile.HMAC",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let max_output_length = pow2 16 | let max_output_length = | false | null | false | pow2 16 | {
"checked_file": "Spec.HMAC_DRBG.fsti.checked",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HMAC.fsti.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_fi... | [
"total"
] | [
"Prims.pow2"
] | [] | module Spec.HMAC_DRBG
open Lib.IntTypes
open FStar.Seq
open FStar.Mul
open Spec.Hash.Definitions
open Spec.Agile.HMAC
/// HMAC-DRBG
///
/// See 10.1.2 in
/// https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-90Ar1.pdf
///
#set-options "--max_fuel 0 --max_ifuel 0"
let is_supported_alg = function
|... | false | true | Spec.HMAC_DRBG.fsti | {
"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_el... | null | val max_output_length : Prims.pos | [] | Spec.HMAC_DRBG.max_output_length | {
"file_name": "specs/drbg/Spec.HMAC_DRBG.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Prims.pos | {
"end_col": 47,
"end_line": 25,
"start_col": 40,
"start_line": 25
} | |
Prims.Tot | [
{
"abbrev": false,
"full_module": "Spec.Agile.HMAC",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let is_supported_alg = function
| SHA1 | SHA2_256 | SHA2_384 | SHA2_512 -> true
| _ -> false | let is_supported_alg = | false | null | false | function
| SHA1 | SHA2_256 | SHA2_384 | SHA2_512 -> true
| _ -> false | {
"checked_file": "Spec.HMAC_DRBG.fsti.checked",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HMAC.fsti.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_fi... | [
"total"
] | [
"Spec.Hash.Definitions.hash_alg",
"Prims.bool"
] | [] | module Spec.HMAC_DRBG
open Lib.IntTypes
open FStar.Seq
open FStar.Mul
open Spec.Hash.Definitions
open Spec.Agile.HMAC
/// HMAC-DRBG
///
/// See 10.1.2 in
/// https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-90Ar1.pdf
///
#set-options "--max_fuel 0 --max_ifuel 0" | false | true | Spec.HMAC_DRBG.fsti | {
"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_el... | null | val is_supported_alg : _: Spec.Hash.Definitions.hash_alg -> Prims.bool | [] | Spec.HMAC_DRBG.is_supported_alg | {
"file_name": "specs/drbg/Spec.HMAC_DRBG.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | _: Spec.Hash.Definitions.hash_alg -> Prims.bool | {
"end_col": 14,
"end_line": 20,
"start_col": 23,
"start_line": 18
} | |
Prims.Tot | [
{
"abbrev": false,
"full_module": "Spec.Agile.HMAC",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let supported_alg = a:hash_alg{ is_supported_alg a } | let supported_alg = | false | null | false | a: hash_alg{is_supported_alg a} | {
"checked_file": "Spec.HMAC_DRBG.fsti.checked",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HMAC.fsti.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_fi... | [
"total"
] | [
"Spec.Hash.Definitions.hash_alg",
"Prims.b2t",
"Spec.HMAC_DRBG.is_supported_alg"
] | [] | module Spec.HMAC_DRBG
open Lib.IntTypes
open FStar.Seq
open FStar.Mul
open Spec.Hash.Definitions
open Spec.Agile.HMAC
/// HMAC-DRBG
///
/// See 10.1.2 in
/// https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-90Ar1.pdf
///
#set-options "--max_fuel 0 --max_ifuel 0"
let is_supported_alg = function
|... | false | true | Spec.HMAC_DRBG.fsti | {
"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_el... | null | val supported_alg : Type0 | [] | Spec.HMAC_DRBG.supported_alg | {
"file_name": "specs/drbg/Spec.HMAC_DRBG.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Type0 | {
"end_col": 52,
"end_line": 22,
"start_col": 20,
"start_line": 22
} | |
Prims.Tot | [
{
"abbrev": false,
"full_module": "Spec.Agile.HMAC",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let max_length = pow2 16 | let max_length = | false | null | false | pow2 16 | {
"checked_file": "Spec.HMAC_DRBG.fsti.checked",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HMAC.fsti.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_fi... | [
"total"
] | [
"Prims.pow2"
] | [] | module Spec.HMAC_DRBG
open Lib.IntTypes
open FStar.Seq
open FStar.Mul
open Spec.Hash.Definitions
open Spec.Agile.HMAC
/// HMAC-DRBG
///
/// See 10.1.2 in
/// https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-90Ar1.pdf
///
#set-options "--max_fuel 0 --max_ifuel 0"
let is_supported_alg = function
|... | false | true | Spec.HMAC_DRBG.fsti | {
"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_el... | null | val max_length : Prims.pos | [] | Spec.HMAC_DRBG.max_length | {
"file_name": "specs/drbg/Spec.HMAC_DRBG.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Prims.pos | {
"end_col": 47,
"end_line": 26,
"start_col": 40,
"start_line": 26
} | |
Prims.Tot | [
{
"abbrev": false,
"full_module": "Spec.Agile.HMAC",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let max_personalization_string_length = pow2 16 | let max_personalization_string_length = | false | null | false | pow2 16 | {
"checked_file": "Spec.HMAC_DRBG.fsti.checked",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HMAC.fsti.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_fi... | [
"total"
] | [
"Prims.pow2"
] | [] | module Spec.HMAC_DRBG
open Lib.IntTypes
open FStar.Seq
open FStar.Mul
open Spec.Hash.Definitions
open Spec.Agile.HMAC
/// HMAC-DRBG
///
/// See 10.1.2 in
/// https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-90Ar1.pdf
///
#set-options "--max_fuel 0 --max_ifuel 0"
let is_supported_alg = function
|... | false | true | Spec.HMAC_DRBG.fsti | {
"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_el... | null | val max_personalization_string_length : Prims.pos | [] | Spec.HMAC_DRBG.max_personalization_string_length | {
"file_name": "specs/drbg/Spec.HMAC_DRBG.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Prims.pos | {
"end_col": 47,
"end_line": 27,
"start_col": 40,
"start_line": 27
} | |
Prims.Tot | [
{
"abbrev": false,
"full_module": "Spec.Agile.HMAC",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let max_additional_input_length = pow2 16 | let max_additional_input_length = | false | null | false | pow2 16 | {
"checked_file": "Spec.HMAC_DRBG.fsti.checked",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HMAC.fsti.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_fi... | [
"total"
] | [
"Prims.pow2"
] | [] | module Spec.HMAC_DRBG
open Lib.IntTypes
open FStar.Seq
open FStar.Mul
open Spec.Hash.Definitions
open Spec.Agile.HMAC
/// HMAC-DRBG
///
/// See 10.1.2 in
/// https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-90Ar1.pdf
///
#set-options "--max_fuel 0 --max_ifuel 0"
let is_supported_alg = function
|... | false | true | Spec.HMAC_DRBG.fsti | {
"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_el... | null | val max_additional_input_length : Prims.pos | [] | Spec.HMAC_DRBG.max_additional_input_length | {
"file_name": "specs/drbg/Spec.HMAC_DRBG.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Prims.pos | {
"end_col": 47,
"end_line": 28,
"start_col": 40,
"start_line": 28
} | |
Prims.Tot | [
{
"abbrev": false,
"full_module": "Spec.Agile.HMAC",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let min_length (a:supported_alg) =
match a with
| SHA1 -> 16
| SHA2_256 | SHA2_384 | SHA2_512 -> 32 | let min_length (a: supported_alg) = | false | null | false | match a with
| SHA1 -> 16
| SHA2_256 | SHA2_384 | SHA2_512 -> 32 | {
"checked_file": "Spec.HMAC_DRBG.fsti.checked",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HMAC.fsti.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_fi... | [
"total"
] | [
"Spec.HMAC_DRBG.supported_alg",
"Prims.int"
] | [] | module Spec.HMAC_DRBG
open Lib.IntTypes
open FStar.Seq
open FStar.Mul
open Spec.Hash.Definitions
open Spec.Agile.HMAC
/// HMAC-DRBG
///
/// See 10.1.2 in
/// https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-90Ar1.pdf
///
#set-options "--max_fuel 0 --max_ifuel 0"
let is_supported_alg = function
|... | false | true | Spec.HMAC_DRBG.fsti | {
"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_el... | null | val min_length : a: Spec.HMAC_DRBG.supported_alg -> Prims.int | [] | Spec.HMAC_DRBG.min_length | {
"file_name": "specs/drbg/Spec.HMAC_DRBG.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | a: Spec.HMAC_DRBG.supported_alg -> Prims.int | {
"end_col": 40,
"end_line": 35,
"start_col": 2,
"start_line": 33
} | |
Prims.Tot | val le_to_n (s:Seq.seq u8) : Tot nat | [
{
"abbrev": true,
"full_module": "LowStar.Endianness",
"short_module": "LE"
},
{
"abbrev": true,
"full_module": "FStar.Endianness",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_m... | false | let le_to_n s = E.le_to_n s | val le_to_n (s:Seq.seq u8) : Tot nat
let le_to_n s = | false | null | false | E.le_to_n s | {
"checked_file": "LowStar.PrefixFreezableBuffer.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Endianness.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",... | [
"total"
] | [
"FStar.Seq.Base.seq",
"LowStar.PrefixFreezableBuffer.u8",
"FStar.Endianness.le_to_n",
"Prims.nat"
] | [] | (*
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 agre... | false | true | LowStar.PrefixFreezableBuffer.fst | {
"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_el... | null | val le_to_n (s:Seq.seq u8) : Tot nat | [] | LowStar.PrefixFreezableBuffer.le_to_n | {
"file_name": "ulib/LowStar.PrefixFreezableBuffer.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | s: FStar.Seq.Base.seq LowStar.PrefixFreezableBuffer.u8 -> Prims.nat | {
"end_col": 27,
"end_line": 43,
"start_col": 16,
"start_line": 43
} |
Prims.Tot | val prefix_freezable_preorder : srel u8 | [
{
"abbrev": true,
"full_module": "LowStar.Endianness",
"short_module": "LE"
},
{
"abbrev": true,
"full_module": "FStar.Endianness",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_m... | false | let prefix_freezable_preorder = pre | val prefix_freezable_preorder : srel u8
let prefix_freezable_preorder = | false | null | false | pre | {
"checked_file": "LowStar.PrefixFreezableBuffer.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Endianness.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",... | [
"total"
] | [
"LowStar.PrefixFreezableBuffer.pre"
] | [] | (*
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 agre... | false | true | LowStar.PrefixFreezableBuffer.fst | {
"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_el... | null | val prefix_freezable_preorder : srel u8 | [] | LowStar.PrefixFreezableBuffer.prefix_freezable_preorder | {
"file_name": "ulib/LowStar.PrefixFreezableBuffer.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | LowStar.Monotonic.Buffer.srel LowStar.PrefixFreezableBuffer.u8 | {
"end_col": 35,
"end_line": 45,
"start_col": 32,
"start_line": 45
} |
FStar.HyperStack.ST.Stack | val recall_frozen_until (b:buffer) (n:nat)
: Stack
unit
(requires fun h ->
(recallable b \/ live h b) /\
b `witnessed` frozen_until_at_least n)
(ensures fun h0 _ h1 ->
h0 == h1 /\
frozen_until_at_least n (as_seq h1 b)) | [
{
"abbrev": true,
"full_module": "LowStar.Endianness",
"short_module": "LE"
},
{
"abbrev": true,
"full_module": "FStar.Endianness",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_m... | false | let recall_frozen_until b n =
recall_p b (frozen_until_at_least n) | val recall_frozen_until (b:buffer) (n:nat)
: Stack
unit
(requires fun h ->
(recallable b \/ live h b) /\
b `witnessed` frozen_until_at_least n)
(ensures fun h0 _ h1 ->
h0 == h1 /\
frozen_until_at_least n (as_seq h1 b))
let recall_frozen_until b n = | true | null | false | recall_p b (frozen_until_at_least n) | {
"checked_file": "LowStar.PrefixFreezableBuffer.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Endianness.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",... | [] | [
"LowStar.PrefixFreezableBuffer.buffer",
"Prims.nat",
"LowStar.Monotonic.Buffer.recall_p",
"LowStar.PrefixFreezableBuffer.u8",
"LowStar.PrefixFreezableBuffer.prefix_freezable_preorder",
"LowStar.PrefixFreezableBuffer.frozen_until_at_least",
"Prims.unit"
] | [] | (*
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 agre... | false | false | LowStar.PrefixFreezableBuffer.fst | {
"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_el... | null | val recall_frozen_until (b:buffer) (n:nat)
: Stack
unit
(requires fun h ->
(recallable b \/ live h b) /\
b `witnessed` frozen_until_at_least n)
(ensures fun h0 _ h1 ->
h0 == h1 /\
frozen_until_at_least n (as_seq h1 b)) | [] | LowStar.PrefixFreezableBuffer.recall_frozen_until | {
"file_name": "ulib/LowStar.PrefixFreezableBuffer.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | b: LowStar.PrefixFreezableBuffer.buffer -> n: Prims.nat -> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 38,
"end_line": 145,
"start_col": 2,
"start_line": 145
} |
FStar.HyperStack.ST.Stack | val recall_frozen_until_default (b:buffer)
: Stack
unit
(requires fun h -> recallable b \/ live h b)
(ensures fun h0 _ h1 ->
h0 == h1 /\
frozen_until_at_least 4 (as_seq h1 b)) | [
{
"abbrev": true,
"full_module": "LowStar.Endianness",
"short_module": "LE"
},
{
"abbrev": true,
"full_module": "FStar.Endianness",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_m... | false | let recall_frozen_until_default b =
recall_p b (frozen_until_at_least 4) | val recall_frozen_until_default (b:buffer)
: Stack
unit
(requires fun h -> recallable b \/ live h b)
(ensures fun h0 _ h1 ->
h0 == h1 /\
frozen_until_at_least 4 (as_seq h1 b))
let recall_frozen_until_default b = | true | null | false | recall_p b (frozen_until_at_least 4) | {
"checked_file": "LowStar.PrefixFreezableBuffer.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Endianness.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",... | [] | [
"LowStar.PrefixFreezableBuffer.buffer",
"LowStar.Monotonic.Buffer.recall_p",
"LowStar.PrefixFreezableBuffer.u8",
"LowStar.PrefixFreezableBuffer.prefix_freezable_preorder",
"LowStar.PrefixFreezableBuffer.frozen_until_at_least",
"Prims.unit"
] | [] | (*
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 agre... | false | false | LowStar.PrefixFreezableBuffer.fst | {
"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_el... | null | val recall_frozen_until_default (b:buffer)
: Stack
unit
(requires fun h -> recallable b \/ live h b)
(ensures fun h0 _ h1 ->
h0 == h1 /\
frozen_until_at_least 4 (as_seq h1 b)) | [] | LowStar.PrefixFreezableBuffer.recall_frozen_until_default | {
"file_name": "ulib/LowStar.PrefixFreezableBuffer.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | b: LowStar.PrefixFreezableBuffer.buffer -> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 38,
"end_line": 148,
"start_col": 2,
"start_line": 148
} |
FStar.HyperStack.ST.Stack | val recall_slice (b:buffer) (i j:u32) (snap:G.erased (Seq.seq u8))
: Stack
unit
(requires fun h ->
(recallable b \/ live h b) /\
b `witnessed` slice_is i j snap)
(ensures fun h0 _ h1 ->
h0 == h1 /\
slice_is i j snap (as_seq h1 b)) | [
{
"abbrev": true,
"full_module": "LowStar.Endianness",
"short_module": "LE"
},
{
"abbrev": true,
"full_module": "FStar.Endianness",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_m... | false | let recall_slice b i j snap =
recall_p b (slice_is i j snap) | val recall_slice (b:buffer) (i j:u32) (snap:G.erased (Seq.seq u8))
: Stack
unit
(requires fun h ->
(recallable b \/ live h b) /\
b `witnessed` slice_is i j snap)
(ensures fun h0 _ h1 ->
h0 == h1 /\
slice_is i j snap (as_seq h1 b))
let recall_slice b i j snap = | true | null | false | recall_p b (slice_is i j snap) | {
"checked_file": "LowStar.PrefixFreezableBuffer.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Endianness.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",... | [] | [
"LowStar.PrefixFreezableBuffer.buffer",
"LowStar.PrefixFreezableBuffer.u32",
"FStar.Ghost.erased",
"FStar.Seq.Base.seq",
"LowStar.PrefixFreezableBuffer.u8",
"LowStar.Monotonic.Buffer.recall_p",
"LowStar.PrefixFreezableBuffer.prefix_freezable_preorder",
"LowStar.PrefixFreezableBuffer.slice_is",
"Prim... | [] | (*
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 agre... | false | false | LowStar.PrefixFreezableBuffer.fst | {
"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_el... | null | val recall_slice (b:buffer) (i j:u32) (snap:G.erased (Seq.seq u8))
: Stack
unit
(requires fun h ->
(recallable b \/ live h b) /\
b `witnessed` slice_is i j snap)
(ensures fun h0 _ h1 ->
h0 == h1 /\
slice_is i j snap (as_seq h1 b)) | [] | LowStar.PrefixFreezableBuffer.recall_slice | {
"file_name": "ulib/LowStar.PrefixFreezableBuffer.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
b: LowStar.PrefixFreezableBuffer.buffer ->
i: LowStar.PrefixFreezableBuffer.u32 ->
j: LowStar.PrefixFreezableBuffer.u32 ->
snap: FStar.Ghost.erased (FStar.Seq.Base.seq LowStar.PrefixFreezableBuffer.u8)
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 32,
"end_line": 139,
"start_col": 2,
"start_line": 139
} |
FStar.HyperStack.ST.Stack | val witness_frozen_until (b:buffer) (n:nat)
: Stack
unit
(requires fun h -> frozen_until_at_least n (as_seq h b))
(ensures fun h0 _ h1 ->
h0 == h1 /\
b `witnessed` frozen_until_at_least n) | [
{
"abbrev": true,
"full_module": "LowStar.Endianness",
"short_module": "LE"
},
{
"abbrev": true,
"full_module": "FStar.Endianness",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_m... | false | let witness_frozen_until b n =
witness_p b (frozen_until_at_least n) | val witness_frozen_until (b:buffer) (n:nat)
: Stack
unit
(requires fun h -> frozen_until_at_least n (as_seq h b))
(ensures fun h0 _ h1 ->
h0 == h1 /\
b `witnessed` frozen_until_at_least n)
let witness_frozen_until b n = | true | null | false | witness_p b (frozen_until_at_least n) | {
"checked_file": "LowStar.PrefixFreezableBuffer.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Endianness.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",... | [] | [
"LowStar.PrefixFreezableBuffer.buffer",
"Prims.nat",
"LowStar.Monotonic.Buffer.witness_p",
"LowStar.PrefixFreezableBuffer.u8",
"LowStar.PrefixFreezableBuffer.prefix_freezable_preorder",
"LowStar.PrefixFreezableBuffer.frozen_until_at_least",
"Prims.unit"
] | [] | (*
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 agre... | false | false | LowStar.PrefixFreezableBuffer.fst | {
"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_el... | null | val witness_frozen_until (b:buffer) (n:nat)
: Stack
unit
(requires fun h -> frozen_until_at_least n (as_seq h b))
(ensures fun h0 _ h1 ->
h0 == h1 /\
b `witnessed` frozen_until_at_least n) | [] | LowStar.PrefixFreezableBuffer.witness_frozen_until | {
"file_name": "ulib/LowStar.PrefixFreezableBuffer.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | b: LowStar.PrefixFreezableBuffer.buffer -> n: Prims.nat -> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 39,
"end_line": 142,
"start_col": 2,
"start_line": 142
} |
FStar.HyperStack.ST.Stack | val witness_slice (b:buffer) (i j:u32) (snap:G.erased (Seq.seq u8))
: Stack
unit
(requires fun h -> slice_is i j snap (as_seq h b))
(ensures fun h0 _ h1 ->
h0 == h1 /\
b `witnessed` slice_is i j snap) | [
{
"abbrev": true,
"full_module": "LowStar.Endianness",
"short_module": "LE"
},
{
"abbrev": true,
"full_module": "FStar.Endianness",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_m... | false | let witness_slice b i j snap =
witness_p b (slice_is i j snap) | val witness_slice (b:buffer) (i j:u32) (snap:G.erased (Seq.seq u8))
: Stack
unit
(requires fun h -> slice_is i j snap (as_seq h b))
(ensures fun h0 _ h1 ->
h0 == h1 /\
b `witnessed` slice_is i j snap)
let witness_slice b i j snap = | true | null | false | witness_p b (slice_is i j snap) | {
"checked_file": "LowStar.PrefixFreezableBuffer.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Endianness.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",... | [] | [
"LowStar.PrefixFreezableBuffer.buffer",
"LowStar.PrefixFreezableBuffer.u32",
"FStar.Ghost.erased",
"FStar.Seq.Base.seq",
"LowStar.PrefixFreezableBuffer.u8",
"LowStar.Monotonic.Buffer.witness_p",
"LowStar.PrefixFreezableBuffer.prefix_freezable_preorder",
"LowStar.PrefixFreezableBuffer.slice_is",
"Pri... | [] | (*
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 agre... | false | false | LowStar.PrefixFreezableBuffer.fst | {
"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_el... | null | val witness_slice (b:buffer) (i j:u32) (snap:G.erased (Seq.seq u8))
: Stack
unit
(requires fun h -> slice_is i j snap (as_seq h b))
(ensures fun h0 _ h1 ->
h0 == h1 /\
b `witnessed` slice_is i j snap) | [] | LowStar.PrefixFreezableBuffer.witness_slice | {
"file_name": "ulib/LowStar.PrefixFreezableBuffer.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
b: LowStar.PrefixFreezableBuffer.buffer ->
i: LowStar.PrefixFreezableBuffer.u32 ->
j: LowStar.PrefixFreezableBuffer.u32 ->
snap: FStar.Ghost.erased (FStar.Seq.Base.seq LowStar.PrefixFreezableBuffer.u8)
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 33,
"end_line": 136,
"start_col": 2,
"start_line": 136
} |
FStar.HyperStack.ST.ST | val gcmalloc (r:HS.rid) (len:u32)
: ST (b:lbuffer len{frameOf b == r /\ recallable b})
(requires fun _ -> malloc_pre r len)
(ensures alloc_post_mem_common) | [
{
"abbrev": true,
"full_module": "LowStar.Endianness",
"short_module": "LE"
},
{
"abbrev": true,
"full_module": "FStar.Endianness",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_m... | false | let gcmalloc r len =
let h0 = ST.get () in
let b = mgcmalloc #_ #prefix_freezable_preorder r 0uy (U32.add len 4ul) in
let h = ST.get () in E.le_to_n_zeros (Seq.slice (as_seq h b) 0 4);
assert (fresh_loc (loc_buffer b) h0 h); //TODO: necessary for firing modifies_remove_new_locs lemma?
update_frozen_unti... | val gcmalloc (r:HS.rid) (len:u32)
: ST (b:lbuffer len{frameOf b == r /\ recallable b})
(requires fun _ -> malloc_pre r len)
(ensures alloc_post_mem_common)
let gcmalloc r len = | true | null | false | let h0 = ST.get () in
let b = mgcmalloc #_ #prefix_freezable_preorder r 0uy (U32.add len 4ul) in
let h = ST.get () in
E.le_to_n_zeros (Seq.slice (as_seq h b) 0 4);
assert (fresh_loc (loc_buffer b) h0 h);
update_frozen_until_alloc b;
b | {
"checked_file": "LowStar.PrefixFreezableBuffer.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Endianness.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",... | [] | [
"FStar.Monotonic.HyperHeap.rid",
"LowStar.PrefixFreezableBuffer.u32",
"LowStar.PrefixFreezableBuffer.lbuffer",
"Prims.l_and",
"Prims.eq2",
"LowStar.Monotonic.Buffer.frameOf",
"LowStar.PrefixFreezableBuffer.u8",
"LowStar.PrefixFreezableBuffer.prefix_freezable_preorder",
"LowStar.Monotonic.Buffer.reca... | [] | (*
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 agre... | false | false | LowStar.PrefixFreezableBuffer.fst | {
"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_el... | null | val gcmalloc (r:HS.rid) (len:u32)
: ST (b:lbuffer len{frameOf b == r /\ recallable b})
(requires fun _ -> malloc_pre r len)
(ensures alloc_post_mem_common) | [] | LowStar.PrefixFreezableBuffer.gcmalloc | {
"file_name": "ulib/LowStar.PrefixFreezableBuffer.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | r: FStar.Monotonic.HyperHeap.rid -> len: LowStar.PrefixFreezableBuffer.u32
-> FStar.HyperStack.ST.ST
(b:
LowStar.PrefixFreezableBuffer.lbuffer len
{LowStar.Monotonic.Buffer.frameOf b == r /\ LowStar.Monotonic.Buffer.recallable b}) | {
"end_col": 3,
"end_line": 74,
"start_col": 20,
"start_line": 65
} |
FStar.HyperStack.ST.StackInline | val alloca (len:u32)
: StackInline
(lbuffer len)
(requires fun _ -> alloca_pre len)
(ensures fun h0 b h1 ->
alloc_post_mem_common h0 b h1 /\ frameOf b == HS.get_tip h0) | [
{
"abbrev": true,
"full_module": "LowStar.Endianness",
"short_module": "LE"
},
{
"abbrev": true,
"full_module": "FStar.Endianness",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_m... | false | let alloca len =
let h0 = ST.get () in
let b = malloca #_ #prefix_freezable_preorder 0uy (U32.add len 4ul) in
let h = ST.get () in E.le_to_n_zeros (Seq.slice (as_seq h b) 0 4);
assert (fresh_loc (loc_buffer b) h0 h); //TODO: necessary for firing modifies_remove_new_locs lemma?
update_frozen_until_alloc ... | val alloca (len:u32)
: StackInline
(lbuffer len)
(requires fun _ -> alloca_pre len)
(ensures fun h0 b h1 ->
alloc_post_mem_common h0 b h1 /\ frameOf b == HS.get_tip h0)
let alloca len = | true | null | false | let h0 = ST.get () in
let b = malloca #_ #prefix_freezable_preorder 0uy (U32.add len 4ul) in
let h = ST.get () in
E.le_to_n_zeros (Seq.slice (as_seq h b) 0 4);
assert (fresh_loc (loc_buffer b) h0 h);
update_frozen_until_alloc b;
b | {
"checked_file": "LowStar.PrefixFreezableBuffer.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Endianness.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",... | [] | [
"LowStar.PrefixFreezableBuffer.u32",
"LowStar.PrefixFreezableBuffer.lbuffer",
"Prims.unit",
"LowStar.PrefixFreezableBuffer.update_frozen_until_alloc",
"Prims._assert",
"LowStar.Monotonic.Buffer.fresh_loc",
"LowStar.Monotonic.Buffer.loc_buffer",
"LowStar.PrefixFreezableBuffer.u8",
"LowStar.PrefixFree... | [] | (*
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 agre... | false | false | LowStar.PrefixFreezableBuffer.fst | {
"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_el... | null | val alloca (len:u32)
: StackInline
(lbuffer len)
(requires fun _ -> alloca_pre len)
(ensures fun h0 b h1 ->
alloc_post_mem_common h0 b h1 /\ frameOf b == HS.get_tip h0) | [] | LowStar.PrefixFreezableBuffer.alloca | {
"file_name": "ulib/LowStar.PrefixFreezableBuffer.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | len: LowStar.PrefixFreezableBuffer.u32
-> FStar.HyperStack.ST.StackInline (LowStar.PrefixFreezableBuffer.lbuffer len) | {
"end_col": 3,
"end_line": 96,
"start_col": 16,
"start_line": 87
} |
FStar.HyperStack.ST.Stack | val frozen_until_st (b:buffer)
: Stack
u32
(requires fun h -> live h b)
(ensures fun h0 r h1 ->
h0 == h1 /\
U32.v r == frozen_until (as_seq h1 b)) | [
{
"abbrev": true,
"full_module": "LowStar.Endianness",
"short_module": "LE"
},
{
"abbrev": true,
"full_module": "FStar.Endianness",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_m... | false | let frozen_until_st b = LE.load32_le_i b 0ul | val frozen_until_st (b:buffer)
: Stack
u32
(requires fun h -> live h b)
(ensures fun h0 r h1 ->
h0 == h1 /\
U32.v r == frozen_until (as_seq h1 b))
let frozen_until_st b = | true | null | false | LE.load32_le_i b 0ul | {
"checked_file": "LowStar.PrefixFreezableBuffer.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Endianness.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",... | [] | [
"LowStar.PrefixFreezableBuffer.buffer",
"LowStar.Endianness.load32_le_i",
"LowStar.PrefixFreezableBuffer.prefix_freezable_preorder",
"FStar.UInt32.__uint_to_t",
"LowStar.Endianness.u32",
"LowStar.PrefixFreezableBuffer.u32"
] | [] | (*
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 agre... | false | false | LowStar.PrefixFreezableBuffer.fst | {
"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_el... | null | val frozen_until_st (b:buffer)
: Stack
u32
(requires fun h -> live h b)
(ensures fun h0 r h1 ->
h0 == h1 /\
U32.v r == frozen_until (as_seq h1 b)) | [] | LowStar.PrefixFreezableBuffer.frozen_until_st | {
"file_name": "ulib/LowStar.PrefixFreezableBuffer.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | b: LowStar.PrefixFreezableBuffer.buffer
-> FStar.HyperStack.ST.Stack LowStar.PrefixFreezableBuffer.u32 | {
"end_col": 44,
"end_line": 133,
"start_col": 24,
"start_line": 133
} |
FStar.HyperStack.ST.ST | val malloc (r:HS.rid) (len:u32)
: ST
(b:lbuffer len{frameOf b == r /\ freeable b})
(requires fun _ -> malloc_pre r len)
(ensures alloc_post_mem_common) | [
{
"abbrev": true,
"full_module": "LowStar.Endianness",
"short_module": "LE"
},
{
"abbrev": true,
"full_module": "FStar.Endianness",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_m... | false | let malloc r len =
let h0 = ST.get () in
let b = mmalloc #_ #prefix_freezable_preorder r 0uy (U32.add len 4ul) in
let h = ST.get () in E.le_to_n_zeros (Seq.slice (as_seq h b) 0 4);
assert (fresh_loc (loc_buffer b) h0 h); //TODO: necessary for firing modifies_remove_new_locs lemma?
update_frozen_until_al... | val malloc (r:HS.rid) (len:u32)
: ST
(b:lbuffer len{frameOf b == r /\ freeable b})
(requires fun _ -> malloc_pre r len)
(ensures alloc_post_mem_common)
let malloc r len = | true | null | false | let h0 = ST.get () in
let b = mmalloc #_ #prefix_freezable_preorder r 0uy (U32.add len 4ul) in
let h = ST.get () in
E.le_to_n_zeros (Seq.slice (as_seq h b) 0 4);
assert (fresh_loc (loc_buffer b) h0 h);
update_frozen_until_alloc b;
b | {
"checked_file": "LowStar.PrefixFreezableBuffer.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Endianness.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",... | [] | [
"FStar.Monotonic.HyperHeap.rid",
"LowStar.PrefixFreezableBuffer.u32",
"LowStar.PrefixFreezableBuffer.lbuffer",
"Prims.l_and",
"Prims.eq2",
"LowStar.Monotonic.Buffer.frameOf",
"LowStar.PrefixFreezableBuffer.u8",
"LowStar.PrefixFreezableBuffer.prefix_freezable_preorder",
"LowStar.Monotonic.Buffer.free... | [] | (*
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 agre... | false | false | LowStar.PrefixFreezableBuffer.fst | {
"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_el... | null | val malloc (r:HS.rid) (len:u32)
: ST
(b:lbuffer len{frameOf b == r /\ freeable b})
(requires fun _ -> malloc_pre r len)
(ensures alloc_post_mem_common) | [] | LowStar.PrefixFreezableBuffer.malloc | {
"file_name": "ulib/LowStar.PrefixFreezableBuffer.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | r: FStar.Monotonic.HyperHeap.rid -> len: LowStar.PrefixFreezableBuffer.u32
-> FStar.HyperStack.ST.ST
(b:
LowStar.PrefixFreezableBuffer.lbuffer len
{LowStar.Monotonic.Buffer.frameOf b == r /\ LowStar.Monotonic.Buffer.freeable b}) | {
"end_col": 3,
"end_line": 85,
"start_col": 18,
"start_line": 76
} |
FStar.HyperStack.ST.Stack | val update_frozen_until_alloc (b: mbuffer u8 prefix_freezable_preorder prefix_freezable_preorder)
: Stack unit
(requires fun h -> live h b /\ length b >= 4 /\ frozen_until (as_seq h b) == 0)
(ensures
fun h0 _ h1 ->
live h1 b /\ modifies (loc_buffer b) h0 h1 /\ frozen_until (as_seq h1 b... | [
{
"abbrev": true,
"full_module": "LowStar.Endianness",
"short_module": "LE"
},
{
"abbrev": true,
"full_module": "FStar.Endianness",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_m... | false | let update_frozen_until_alloc
(b:mbuffer u8 prefix_freezable_preorder prefix_freezable_preorder)
: Stack
unit
(requires fun h ->
live h b /\
length b >= 4 /\
frozen_until (as_seq h b) == 0)
(ensures fun h0 _ h1 ->
live h1 b /\
modifies (loc_buffer b) h0 h1 /\
frozen_... | val update_frozen_until_alloc (b: mbuffer u8 prefix_freezable_preorder prefix_freezable_preorder)
: Stack unit
(requires fun h -> live h b /\ length b >= 4 /\ frozen_until (as_seq h b) == 0)
(ensures
fun h0 _ h1 ->
live h1 b /\ modifies (loc_buffer b) h0 h1 /\ frozen_until (as_seq h1 b... | true | null | false | LE.store32_le_i b 0ul 4ul;
witness_p b (frozen_until_at_least 4) | {
"checked_file": "LowStar.PrefixFreezableBuffer.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Endianness.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",... | [] | [
"LowStar.Monotonic.Buffer.mbuffer",
"LowStar.PrefixFreezableBuffer.u8",
"LowStar.PrefixFreezableBuffer.prefix_freezable_preorder",
"LowStar.Monotonic.Buffer.witness_p",
"LowStar.PrefixFreezableBuffer.frozen_until_at_least",
"Prims.unit",
"LowStar.Endianness.store32_le_i",
"FStar.UInt32.__uint_to_t",
... | [] | (*
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 agre... | false | false | LowStar.PrefixFreezableBuffer.fst | {
"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_el... | null | val update_frozen_until_alloc (b: mbuffer u8 prefix_freezable_preorder prefix_freezable_preorder)
: Stack unit
(requires fun h -> live h b /\ length b >= 4 /\ frozen_until (as_seq h b) == 0)
(ensures
fun h0 _ h1 ->
live h1 b /\ modifies (loc_buffer b) h0 h1 /\ frozen_until (as_seq h1 b... | [] | LowStar.PrefixFreezableBuffer.update_frozen_until_alloc | {
"file_name": "ulib/LowStar.PrefixFreezableBuffer.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
b:
LowStar.Monotonic.Buffer.mbuffer LowStar.PrefixFreezableBuffer.u8
LowStar.PrefixFreezableBuffer.prefix_freezable_preorder
LowStar.PrefixFreezableBuffer.prefix_freezable_preorder
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 41,
"end_line": 63,
"start_col": 4,
"start_line": 62
} |
FStar.HyperStack.ST.Stack | val upd (b:buffer) (i:u32) (v:u8)
: Stack
unit
(requires fun h ->
live h b /\ U32.v i < length b /\
U32.v i >= frozen_until (as_seq h b))
(ensures fun h0 _ h1 ->
(not (g_is_null b)) /\
modifies (loc_buffer b) h0 h1 /\
live h1 b /\
frozen_until (as_seq h0 b) == frozen_u... | [
{
"abbrev": true,
"full_module": "LowStar.Endianness",
"short_module": "LE"
},
{
"abbrev": true,
"full_module": "FStar.Endianness",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_m... | false | let upd b i v =
recall_p b (frozen_until_at_least 4);
upd b i v | val upd (b:buffer) (i:u32) (v:u8)
: Stack
unit
(requires fun h ->
live h b /\ U32.v i < length b /\
U32.v i >= frozen_until (as_seq h b))
(ensures fun h0 _ h1 ->
(not (g_is_null b)) /\
modifies (loc_buffer b) h0 h1 /\
live h1 b /\
frozen_until (as_seq h0 b) == frozen_u... | true | null | false | recall_p b (frozen_until_at_least 4);
upd b i v | {
"checked_file": "LowStar.PrefixFreezableBuffer.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Endianness.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",... | [] | [
"LowStar.PrefixFreezableBuffer.buffer",
"LowStar.PrefixFreezableBuffer.u32",
"LowStar.PrefixFreezableBuffer.u8",
"LowStar.Monotonic.Buffer.upd",
"LowStar.PrefixFreezableBuffer.prefix_freezable_preorder",
"Prims.unit",
"LowStar.Monotonic.Buffer.recall_p",
"LowStar.PrefixFreezableBuffer.frozen_until_at_... | [] | (*
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 agre... | false | false | LowStar.PrefixFreezableBuffer.fst | {
"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_el... | null | val upd (b:buffer) (i:u32) (v:u8)
: Stack
unit
(requires fun h ->
live h b /\ U32.v i < length b /\
U32.v i >= frozen_until (as_seq h b))
(ensures fun h0 _ h1 ->
(not (g_is_null b)) /\
modifies (loc_buffer b) h0 h1 /\
live h1 b /\
frozen_until (as_seq h0 b) == frozen_u... | [] | LowStar.PrefixFreezableBuffer.upd | {
"file_name": "ulib/LowStar.PrefixFreezableBuffer.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
b: LowStar.PrefixFreezableBuffer.buffer ->
i: LowStar.PrefixFreezableBuffer.u32 ->
v: LowStar.PrefixFreezableBuffer.u8
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 11,
"end_line": 100,
"start_col": 2,
"start_line": 99
} |
FStar.Pervasives.Lemma | val le_pre_post_index (s1 s2: Seq.seq u8)
: Lemma
(ensures
(Seq.length s1 == Seq.length s2 /\ Seq.length s1 >= 4 /\
Seq.equal (Seq.slice s1 0 0) (Seq.slice s2 0 0) /\
Seq.equal (Seq.slice s1 4 (Seq.length s1)) (Seq.slice s2 4 (Seq.length s2))) ==>
(forall (i: nat). {:pattern (Seq.ind... | [
{
"abbrev": true,
"full_module": "LowStar.Endianness",
"short_module": "LE"
},
{
"abbrev": true,
"full_module": "FStar.Endianness",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_m... | false | let le_pre_post_index
(s1 s2:Seq.seq u8)
: Lemma
(ensures
(Seq.length s1 == Seq.length s2 /\
Seq.length s1 >= 4 /\
Seq.equal (Seq.slice s1 0 0) (Seq.slice s2 0 0) /\
Seq.equal (Seq.slice s1 4 (Seq.length s1))
(Seq.slice s2 4 (Seq.length s2))) ==>
(forall (i:nat... | val le_pre_post_index (s1 s2: Seq.seq u8)
: Lemma
(ensures
(Seq.length s1 == Seq.length s2 /\ Seq.length s1 >= 4 /\
Seq.equal (Seq.slice s1 0 0) (Seq.slice s2 0 0) /\
Seq.equal (Seq.slice s1 4 (Seq.length s1)) (Seq.slice s2 4 (Seq.length s2))) ==>
(forall (i: nat). {:pattern (Seq.ind... | false | null | true | assert (forall (s: Seq.seq u8).
Seq.length s >= 4 ==>
(forall (i: nat).
(i >= 4 /\ i < Seq.length s) ==>
Seq.index s i == Seq.index (Seq.slice s 4 (Seq.length s)) (i - 4))) | {
"checked_file": "LowStar.PrefixFreezableBuffer.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Endianness.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",... | [
"lemma"
] | [
"FStar.Seq.Base.seq",
"LowStar.PrefixFreezableBuffer.u8",
"Prims._assert",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"FStar.Seq.Base.length",
"Prims.nat",
"Prims.l_and",
"Prims.op_LessThan",
"Prims.eq2",
"FStar.Seq.Base.index",
"FStar.Seq.Base.slice",
"... | [] | (*
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 agre... | false | false | LowStar.PrefixFreezableBuffer.fst | {
"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_el... | null | val le_pre_post_index (s1 s2: Seq.seq u8)
: Lemma
(ensures
(Seq.length s1 == Seq.length s2 /\ Seq.length s1 >= 4 /\
Seq.equal (Seq.slice s1 0 0) (Seq.slice s2 0 0) /\
Seq.equal (Seq.slice s1 4 (Seq.length s1)) (Seq.slice s2 4 (Seq.length s2))) ==>
(forall (i: nat). {:pattern (Seq.ind... | [] | LowStar.PrefixFreezableBuffer.le_pre_post_index | {
"file_name": "ulib/LowStar.PrefixFreezableBuffer.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
s1: FStar.Seq.Base.seq LowStar.PrefixFreezableBuffer.u8 ->
s2: FStar.Seq.Base.seq LowStar.PrefixFreezableBuffer.u8
-> FStar.Pervasives.Lemma
(ensures
FStar.Seq.Base.length s1 == FStar.Seq.Base.length s2 /\ FStar.Seq.Base.length s1 >= 4 /\
FStar.Seq.Base.equal (FStar.Seq.Base.slice s1 0 0) (FS... | {
"end_col": 77,
"end_line": 125,
"start_col": 4,
"start_line": 121
} |
FStar.HyperStack.ST.Stack | val freeze (b:buffer) (i:u32)
: Stack
unit
(requires fun h ->
live h b /\
U32.v i <= length b /\
U32.v i >= frozen_until (as_seq h b))
(ensures fun h0 _ h1 ->
(not (g_is_null b)) /\
modifies (loc_buffer b) h0 h1 /\
live h1 b /\
frozen_until (as_seq h1 b) == U32.v... | [
{
"abbrev": true,
"full_module": "LowStar.Endianness",
"short_module": "LE"
},
{
"abbrev": true,
"full_module": "FStar.Endianness",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_m... | false | let freeze b i =
recall_p b (frozen_until_at_least 4);
FStar.Classical.forall_intro_2 le_pre_post_index;
LE.store32_le_i b 0ul i;
witness_p b (frozen_until_at_least (U32.v i)) | val freeze (b:buffer) (i:u32)
: Stack
unit
(requires fun h ->
live h b /\
U32.v i <= length b /\
U32.v i >= frozen_until (as_seq h b))
(ensures fun h0 _ h1 ->
(not (g_is_null b)) /\
modifies (loc_buffer b) h0 h1 /\
live h1 b /\
frozen_until (as_seq h1 b) == U32.v... | true | null | false | recall_p b (frozen_until_at_least 4);
FStar.Classical.forall_intro_2 le_pre_post_index;
LE.store32_le_i b 0ul i;
witness_p b (frozen_until_at_least (U32.v i)) | {
"checked_file": "LowStar.PrefixFreezableBuffer.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Endianness.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",... | [] | [
"LowStar.PrefixFreezableBuffer.buffer",
"LowStar.PrefixFreezableBuffer.u32",
"LowStar.Monotonic.Buffer.witness_p",
"LowStar.PrefixFreezableBuffer.u8",
"LowStar.PrefixFreezableBuffer.prefix_freezable_preorder",
"LowStar.PrefixFreezableBuffer.frozen_until_at_least",
"FStar.UInt32.v",
"Prims.unit",
"Lo... | [] | (*
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 agre... | false | false | LowStar.PrefixFreezableBuffer.fst | {
"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_el... | null | val freeze (b:buffer) (i:u32)
: Stack
unit
(requires fun h ->
live h b /\
U32.v i <= length b /\
U32.v i >= frozen_until (as_seq h b))
(ensures fun h0 _ h1 ->
(not (g_is_null b)) /\
modifies (loc_buffer b) h0 h1 /\
live h1 b /\
frozen_until (as_seq h1 b) == U32.v... | [] | LowStar.PrefixFreezableBuffer.freeze | {
"file_name": "ulib/LowStar.PrefixFreezableBuffer.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | b: LowStar.PrefixFreezableBuffer.buffer -> i: LowStar.PrefixFreezableBuffer.u32
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 47,
"end_line": 131,
"start_col": 2,
"start_line": 128
} |
FStar.Pervasives.Lemma | val repeati_extensionality:
#a:Type0
-> n:nat
-> f:(i:nat{i < n} -> a -> a)
-> g:(i:nat{i < n} -> a -> a)
-> acc0:a ->
Lemma
(requires (forall (i:nat{i < n}) (acc:a). f i acc == g i acc))
(ensures Loops.repeati n f acc0 == Loops.repeati n g acc0) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let rec repeati_extensionality #a n f g acc0 =
if n = 0 then begin
Loops.eq_repeati0 n f acc0;
Loops.eq_repeati0 n g acc0 end
else begin
Loops.unfold_repeati n f acc0 (n-1);
Loops.unfold_repeati n g acc0 (n-1);
repeati_extensionality #a (n-1) f g acc0 end | val repeati_extensionality:
#a:Type0
-> n:nat
-> f:(i:nat{i < n} -> a -> a)
-> g:(i:nat{i < n} -> a -> a)
-> acc0:a ->
Lemma
(requires (forall (i:nat{i < n}) (acc:a). f i acc == g i acc))
(ensures Loops.repeati n f acc0 == Loops.repeati n g acc0)
let rec repeati_extensionality #a n f g acc0 = | false | null | true | if n = 0
then
(Loops.eq_repeati0 n f acc0;
Loops.eq_repeati0 n g acc0)
else
(Loops.unfold_repeati n f acc0 (n - 1);
Loops.unfold_repeati n g acc0 (n - 1);
repeati_extensionality #a (n - 1) f g acc0) | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.op_Equality",
"Prims.int",
"Lib.LoopCombinators.eq_repeati0",
"Prims.unit",
"Prims.bool",
"Lib.Sequence.Lemmas.repeati_extensionality",
"Prims.op_Subtraction",
"Lib.LoopCombinators.unfold_repeati"
] | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'" | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val repeati_extensionality:
#a:Type0
-> n:nat
-> f:(i:nat{i < n} -> a -> a)
-> g:(i:nat{i < n} -> a -> a)
-> acc0:a ->
Lemma
(requires (forall (i:nat{i < n}) (acc:a). f i acc == g i acc))
(ensures Loops.repeati n f acc0 == Loops.repeati n g acc0) | [
"recursion"
] | Lib.Sequence.Lemmas.repeati_extensionality | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
n: Prims.nat ->
f: (i: Prims.nat{i < n} -> _: a -> a) ->
g: (i: Prims.nat{i < n} -> _: a -> a) ->
acc0: a
-> FStar.Pervasives.Lemma (requires forall (i: Prims.nat{i < n}) (acc: a). f i acc == g i acc)
(ensures Lib.LoopCombinators.repeati n f acc0 == Lib.LoopCombinators.repeati n g acc0) | {
"end_col": 48,
"end_line": 19,
"start_col": 2,
"start_line": 13
} |
FStar.Pervasives.Lemma | val repeati_right_shift:
#a:Type
-> n:nat
-> f:(i:nat{i < n} -> a -> a)
-> g:(i:nat{i < 1 + n} -> a -> a)
-> acc0:a ->
Lemma
(requires (forall (i:nat{i < n}) (acc:a). f i acc == g (i + 1) acc))
(ensures Loops.repeati n f (g 0 acc0) == Loops.repeati (n + 1) g acc0) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let repeati_right_shift #a n f g acc0 =
let acc1 = g 0 acc0 in
repeati_right_extensionality n 1 f g acc1;
// Got:
// repeat_right 0 n (fun _ -> a) f acc1 == repeat_right 1 (n + 1) (fun _ -> a) g acc1
Loops.repeati_def n f acc1;
// Got:
// repeati n f acc1 == repeat_right 0 n (fun _ -> a) f acc1
Loops.re... | val repeati_right_shift:
#a:Type
-> n:nat
-> f:(i:nat{i < n} -> a -> a)
-> g:(i:nat{i < 1 + n} -> a -> a)
-> acc0:a ->
Lemma
(requires (forall (i:nat{i < n}) (acc:a). f i acc == g (i + 1) acc))
(ensures Loops.repeati n f (g 0 acc0) == Loops.repeati (n + 1) g acc0)
let repeati_right_shift #a n f g acc0... | false | null | true | let acc1 = g 0 acc0 in
repeati_right_extensionality n 1 f g acc1;
Loops.repeati_def n f acc1;
Loops.repeat_right_plus 0 1 (n + 1) (Loops.fixed_a a) g acc0;
Loops.unfold_repeat_right 0 (n + 1) (Loops.fixed_a a) g acc0 0;
Loops.eq_repeat_right 0 (n + 1) (Loops.fixed_a a) g acc0;
Loops.repeati_def (n + 1) g acc0 | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.op_Addition",
"Lib.LoopCombinators.repeati_def",
"Prims.unit",
"Lib.LoopCombinators.eq_repeat_right",
"Lib.LoopCombinators.fixed_a",
"Lib.LoopCombinators.unfold_repeat_right",
"Lib.LoopCombinators.repeat_right_plus",
"Lib.Sequence.Lemmas.repe... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val repeati_right_shift:
#a:Type
-> n:nat
-> f:(i:nat{i < n} -> a -> a)
-> g:(i:nat{i < 1 + n} -> a -> a)
-> acc0:a ->
Lemma
(requires (forall (i:nat{i < n}) (acc:a). f i acc == g (i + 1) acc))
(ensures Loops.repeati n f (g 0 acc0) == Loops.repeati (n + 1) g acc0) | [] | Lib.Sequence.Lemmas.repeati_right_shift | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
n: Prims.nat ->
f: (i: Prims.nat{i < n} -> _: a -> a) ->
g: (i: Prims.nat{i < 1 + n} -> _: a -> a) ->
acc0: a
-> FStar.Pervasives.Lemma
(requires forall (i: Prims.nat{i < n}) (acc: a). f i acc == g (i + 1) acc)
(ensures
Lib.LoopCombinators.repeati n f (g 0 acc0) == Lib.LoopCombina... | {
"end_col": 34,
"end_line": 60,
"start_col": 39,
"start_line": 46
} |
FStar.Pervasives.Lemma | val split_len_lemma: blocksize:pos -> len:nat -> len0:nat ->
Lemma
(requires len0 <= len /\ len0 % blocksize = 0)
(ensures
(let len1 = len - len0 in
let n0 = len0 / blocksize in
let n1 = len1 / blocksize in
let n = len / blocksize in
len % blocksize = len1 % blocksize /\
n0 * blocksize = le... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let split_len_lemma blocksize len len0 =
let len1 = len - len0 in
let n0 = len0 / blocksize in
let n1 = len1 / blocksize in
let n = len / blocksize in
Math.Lemmas.lemma_mod_sub_distr len len0 blocksize;
//assert (len % blocksize = len1 % blocksize);
Math.Lemmas.lemma_div_exact len0 blocksize;
//assert... | val split_len_lemma: blocksize:pos -> len:nat -> len0:nat ->
Lemma
(requires len0 <= len /\ len0 % blocksize = 0)
(ensures
(let len1 = len - len0 in
let n0 = len0 / blocksize in
let n1 = len1 / blocksize in
let n = len / blocksize in
len % blocksize = len1 % blocksize /\
n0 * blocksize = le... | false | null | true | let len1 = len - len0 in
let n0 = len0 / blocksize in
let n1 = len1 / blocksize in
let n = len / blocksize in
Math.Lemmas.lemma_mod_sub_distr len len0 blocksize;
Math.Lemmas.lemma_div_exact len0 blocksize;
len0_div_bs blocksize len len0 | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Prims.pos",
"Prims.nat",
"Lib.Sequence.Lemmas.len0_div_bs",
"Prims.unit",
"FStar.Math.Lemmas.lemma_div_exact",
"FStar.Math.Lemmas.lemma_mod_sub_distr",
"Prims.int",
"Prims.op_Division",
"Prims.op_Subtraction"
] | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val split_len_lemma: blocksize:pos -> len:nat -> len0:nat ->
Lemma
(requires len0 <= len /\ len0 % blocksize = 0)
(ensures
(let len1 = len - len0 in
let n0 = len0 / blocksize in
let n1 = len1 / blocksize in
let n = len / blocksize in
len % blocksize = len1 % blocksize /\
n0 * blocksize = le... | [] | Lib.Sequence.Lemmas.split_len_lemma | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | blocksize: Prims.pos -> len: Prims.nat -> len0: Prims.nat
-> FStar.Pervasives.Lemma (requires len0 <= len /\ len0 % blocksize = 0)
(ensures
(let len1 = len - len0 in
let n0 = len0 / blocksize in
let n1 = len1 / blocksize in
let n = len / blocksize in
len % blocksi... | {
"end_col": 32,
"end_line": 159,
"start_col": 40,
"start_line": 147
} |
FStar.Pervasives.Lemma | val repeati_right_extensionality:
#a:Type
-> n:nat
-> lo_g:nat
-> f:(i:nat{i < n} -> a -> a)
-> g:(i:nat{lo_g <= i /\ i < lo_g + n} -> a -> a)
-> acc0:a ->
Lemma
(requires (forall (i:nat{i < n}) (acc:a). f i acc == g (lo_g + i) acc))
(ensures
Loops.repeat_right 0 n (Loops.fixed_a a) f acc0 ==
... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let repeati_right_extensionality #a n lo_g f g acc0 =
repeat_gen_right_extensionality n lo_g (Loops.fixed_a a) (Loops.fixed_a a) f g acc0 | val repeati_right_extensionality:
#a:Type
-> n:nat
-> lo_g:nat
-> f:(i:nat{i < n} -> a -> a)
-> g:(i:nat{lo_g <= i /\ i < lo_g + n} -> a -> a)
-> acc0:a ->
Lemma
(requires (forall (i:nat{i < n}) (acc:a). f i acc == g (lo_g + i) acc))
(ensures
Loops.repeat_right 0 n (Loops.fixed_a a) f acc0 ==
... | false | null | true | repeat_gen_right_extensionality n lo_g (Loops.fixed_a a) (Loops.fixed_a a) f g acc0 | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.l_and",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Lib.Sequence.Lemmas.repeat_gen_right_extensionality",
"Lib.LoopCombinators.fixed_a",
"Prims.unit"
] | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val repeati_right_extensionality:
#a:Type
-> n:nat
-> lo_g:nat
-> f:(i:nat{i < n} -> a -> a)
-> g:(i:nat{lo_g <= i /\ i < lo_g + n} -> a -> a)
-> acc0:a ->
Lemma
(requires (forall (i:nat{i < n}) (acc:a). f i acc == g (lo_g + i) acc))
(ensures
Loops.repeat_right 0 n (Loops.fixed_a a) f acc0 ==
... | [] | Lib.Sequence.Lemmas.repeati_right_extensionality | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
n: Prims.nat ->
lo_g: Prims.nat ->
f: (i: Prims.nat{i < n} -> _: a -> a) ->
g: (i: Prims.nat{lo_g <= i /\ i < lo_g + n} -> _: a -> a) ->
acc0: a
-> FStar.Pervasives.Lemma
(requires forall (i: Prims.nat{i < n}) (acc: a). f i acc == g (lo_g + i) acc)
(ensures
Lib.LoopCombinators... | {
"end_col": 85,
"end_line": 43,
"start_col": 2,
"start_line": 43
} |
FStar.Pervasives.Lemma | val len0_le_len_fraction: blocksize:pos -> len:nat -> len0:nat ->
Lemma
(requires len0 <= len /\ len0 % blocksize = 0)
(ensures len0 <= len / blocksize * blocksize) | [
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "Lib.Loo... | false | let len0_le_len_fraction blocksize len len0 =
Math.Lemmas.lemma_div_le len0 len blocksize;
Math.Lemmas.lemma_mult_le_right blocksize (len0 / blocksize) (len / blocksize) | val len0_le_len_fraction: blocksize:pos -> len:nat -> len0:nat ->
Lemma
(requires len0 <= len /\ len0 % blocksize = 0)
(ensures len0 <= len / blocksize * blocksize)
let len0_le_len_fraction blocksize len len0 = | false | null | true | Math.Lemmas.lemma_div_le len0 len blocksize;
Math.Lemmas.lemma_mult_le_right blocksize (len0 / blocksize) (len / blocksize) | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Prims.pos",
"Prims.nat",
"FStar.Math.Lemmas.lemma_mult_le_right",
"Prims.op_Division",
"Prims.unit",
"FStar.Math.Lemmas.lemma_div_le"
] | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val len0_le_len_fraction: blocksize:pos -> len:nat -> len0:nat ->
Lemma
(requires len0 <= len /\ len0 % blocksize = 0)
(ensures len0 <= len / blocksize * blocksize) | [] | Lib.Sequence.Lemmas.len0_le_len_fraction | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | blocksize: Prims.pos -> len: Prims.nat -> len0: Prims.nat
-> FStar.Pervasives.Lemma (requires len0 <= len /\ len0 % blocksize = 0)
(ensures len0 <= (len / blocksize) * blocksize) | {
"end_col": 80,
"end_line": 392,
"start_col": 2,
"start_line": 391
} |
FStar.Pervasives.Lemma | val split_len_lemma0: blocksize:pos -> n:nat -> len0:nat ->
Lemma
(requires len0 <= n * blocksize /\ len0 % blocksize = 0)
(ensures
(let len = n * blocksize in
let len1 = len - len0 in
let n0 = len0 / blocksize in
let n1 = len1 / blocksize in
len % blocksize = 0 /\ len1 % blocksize = 0 /\ n0 + ... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let split_len_lemma0 blocksize n len0 =
let len = n * blocksize in
let len1 = len - len0 in
let n0 = len0 / blocksize in
let n1 = len1 / blocksize in
Math.Lemmas.cancel_mul_mod n blocksize;
//assert (len % blocksize = 0);
Math.Lemmas.lemma_mod_sub_distr len len0 blocksize;
//assert (len1 % blocksize = ... | val split_len_lemma0: blocksize:pos -> n:nat -> len0:nat ->
Lemma
(requires len0 <= n * blocksize /\ len0 % blocksize = 0)
(ensures
(let len = n * blocksize in
let len1 = len - len0 in
let n0 = len0 / blocksize in
let n1 = len1 / blocksize in
len % blocksize = 0 /\ len1 % blocksize = 0 /\ n0 + ... | false | null | true | let len = n * blocksize in
let len1 = len - len0 in
let n0 = len0 / blocksize in
let n1 = len1 / blocksize in
Math.Lemmas.cancel_mul_mod n blocksize;
Math.Lemmas.lemma_mod_sub_distr len len0 blocksize;
Math.Lemmas.lemma_div_exact len0 blocksize;
Math.Lemmas.lemma_div_exact len1 blocksize;
len0_div_bs blocksize len len0 | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Prims.pos",
"Prims.nat",
"Lib.Sequence.Lemmas.len0_div_bs",
"Prims.unit",
"FStar.Math.Lemmas.lemma_div_exact",
"FStar.Math.Lemmas.lemma_mod_sub_distr",
"FStar.Math.Lemmas.cancel_mul_mod",
"Prims.int",
"Prims.op_Division",
"Prims.op_Subtraction",
"FStar.Mul.op_Star"
] | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val split_len_lemma0: blocksize:pos -> n:nat -> len0:nat ->
Lemma
(requires len0 <= n * blocksize /\ len0 % blocksize = 0)
(ensures
(let len = n * blocksize in
let len1 = len - len0 in
let n0 = len0 / blocksize in
let n1 = len1 / blocksize in
len % blocksize = 0 /\ len1 % blocksize = 0 /\ n0 + ... | [] | Lib.Sequence.Lemmas.split_len_lemma0 | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | blocksize: Prims.pos -> n: Prims.nat -> len0: Prims.nat
-> FStar.Pervasives.Lemma (requires len0 <= n * blocksize /\ len0 % blocksize = 0)
(ensures
(let len = n * blocksize in
let len1 = len - len0 in
let n0 = len0 / blocksize in
let n1 = len1 / blocksize in
len %... | {
"end_col": 32,
"end_line": 143,
"start_col": 39,
"start_line": 126
} |
Prims.Tot | val repeat_gen_blocks_multi:
#inp_t:Type0
-> blocksize:size_pos
-> mi:nat
-> hi:nat
-> n:nat{mi + n <= hi}
-> inp:seq inp_t{length inp == n * blocksize}
-> a:(i:nat{i <= hi} -> Type)
-> f:(i:nat{i < hi} -> lseq inp_t blocksize -> a i -> a (i + 1))
-> acc0:a mi ->
a (mi + n) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let repeat_gen_blocks_multi #inp_t blocksize mi hi n inp a f acc0 =
Loops.repeat_right mi (mi + n) a (repeat_gen_blocks_f blocksize mi hi n inp a f) acc0 | val repeat_gen_blocks_multi:
#inp_t:Type0
-> blocksize:size_pos
-> mi:nat
-> hi:nat
-> n:nat{mi + n <= hi}
-> inp:seq inp_t{length inp == n * blocksize}
-> a:(i:nat{i <= hi} -> Type)
-> f:(i:nat{i < hi} -> lseq inp_t blocksize -> a i -> a (i + 1))
-> acc0:a mi ->
a (mi + n)
let repeat_gen_blocks_m... | false | null | false | Loops.repeat_right mi (mi + n) a (repeat_gen_blocks_f blocksize mi hi n inp a f) acc0 | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"total"
] | [
"Lib.IntTypes.size_pos",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Lib.Sequence.seq",
"Prims.eq2",
"Prims.int",
"Lib.Sequence.length",
"FStar.Mul.op_Star",
"Prims.op_LessThan",
"Lib.Sequence.lseq",
"Lib.LoopCombinators.repeat_right",
"Lib.Sequence.Lemmas.r... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val repeat_gen_blocks_multi:
#inp_t:Type0
-> blocksize:size_pos
-> mi:nat
-> hi:nat
-> n:nat{mi + n <= hi}
-> inp:seq inp_t{length inp == n * blocksize}
-> a:(i:nat{i <= hi} -> Type)
-> f:(i:nat{i < hi} -> lseq inp_t blocksize -> a i -> a (i + 1))
-> acc0:a mi ->
a (mi + n) | [] | Lib.Sequence.Lemmas.repeat_gen_blocks_multi | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
mi: Prims.nat ->
hi: Prims.nat ->
n: Prims.nat{mi + n <= hi} ->
inp: Lib.Sequence.seq inp_t {Lib.Sequence.length inp == n * blocksize} ->
a: (i: Prims.nat{i <= hi} -> Type) ->
f: (i: Prims.nat{i < hi} -> _: Lib.Sequence.lseq inp_t blocksize -> _: a i -> a... | {
"end_col": 87,
"end_line": 64,
"start_col": 2,
"start_line": 64
} |
Prims.Tot | val map_blocks_acc:
#a:Type0
-> blocksize:size_pos
-> mi:nat
-> hi:nat
-> inp:seq a{mi + length inp / blocksize <= hi}
-> f:(i:nat{i < hi} -> lseq a blocksize -> lseq a blocksize)
-> l:(i:nat{i <= hi} -> rem:nat{rem < blocksize} -> lseq a rem -> lseq a rem)
-> acc0:map_blocks_a a blocksize hi mi ->
... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let map_blocks_acc #a blocksize mi hi inp f l acc0 =
repeat_gen_blocks #a blocksize mi hi inp
(map_blocks_a a blocksize hi)
(repeat_gen_blocks_map_f blocksize hi f)
(repeat_gen_blocks_map_l blocksize hi l) acc0 | val map_blocks_acc:
#a:Type0
-> blocksize:size_pos
-> mi:nat
-> hi:nat
-> inp:seq a{mi + length inp / blocksize <= hi}
-> f:(i:nat{i < hi} -> lseq a blocksize -> lseq a blocksize)
-> l:(i:nat{i <= hi} -> rem:nat{rem < blocksize} -> lseq a rem -> lseq a rem)
-> acc0:map_blocks_a a blocksize hi mi ->
... | false | null | false | repeat_gen_blocks #a
blocksize
mi
hi
inp
(map_blocks_a a blocksize hi)
(repeat_gen_blocks_map_f blocksize hi f)
(repeat_gen_blocks_map_l blocksize hi l)
acc0 | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"total"
] | [
"Lib.IntTypes.size_pos",
"Prims.nat",
"Lib.Sequence.seq",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Prims.op_Division",
"Lib.Sequence.length",
"Prims.op_LessThan",
"Lib.Sequence.lseq",
"Lib.Sequence.map_blocks_a",
"Lib.Sequence.Lemmas.repeat_gen_blocks",
"Lib.Sequence.Le... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val map_blocks_acc:
#a:Type0
-> blocksize:size_pos
-> mi:nat
-> hi:nat
-> inp:seq a{mi + length inp / blocksize <= hi}
-> f:(i:nat{i < hi} -> lseq a blocksize -> lseq a blocksize)
-> l:(i:nat{i <= hi} -> rem:nat{rem < blocksize} -> lseq a rem -> lseq a rem)
-> acc0:map_blocks_a a blocksize hi mi ->
... | [] | Lib.Sequence.Lemmas.map_blocks_acc | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
mi: Prims.nat ->
hi: Prims.nat ->
inp: Lib.Sequence.seq a {mi + Lib.Sequence.length inp / blocksize <= hi} ->
f: (i: Prims.nat{i < hi} -> _: Lib.Sequence.lseq a blocksize -> Lib.Sequence.lseq a blocksize) ->
l:
(i: Prims.nat{i <= hi} -> rem: Prims.nat{r... | {
"end_col": 49,
"end_line": 655,
"start_col": 2,
"start_line": 652
} |
FStar.Pervasives.Lemma | val len0_div_bs: blocksize:pos -> len:nat -> len0:nat ->
Lemma
(requires len0 <= len /\ len0 % blocksize == 0)
(ensures len0 / blocksize + (len - len0) / blocksize == len / blocksize) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let len0_div_bs blocksize len len0 =
let k = len0 / blocksize in
calc (==) {
k + (len - len0) / blocksize;
== { Math.Lemmas.lemma_div_exact len0 blocksize }
k + (len - k * blocksize) / blocksize;
== { Math.Lemmas.division_sub_lemma len blocksize k }
k + len / blocksize - k;
== { }
len / ... | val len0_div_bs: blocksize:pos -> len:nat -> len0:nat ->
Lemma
(requires len0 <= len /\ len0 % blocksize == 0)
(ensures len0 / blocksize + (len - len0) / blocksize == len / blocksize)
let len0_div_bs blocksize len len0 = | false | null | true | let k = len0 / blocksize in
calc ( == ) {
k + (len - len0) / blocksize;
( == ) { Math.Lemmas.lemma_div_exact len0 blocksize }
k + (len - k * blocksize) / blocksize;
( == ) { Math.Lemmas.division_sub_lemma len blocksize k }
k + len / blocksize - k;
( == ) { () }
len / blocksize;
} | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Prims.pos",
"Prims.nat",
"FStar.Calc.calc_finish",
"Prims.int",
"Prims.eq2",
"Prims.op_Addition",
"Prims.op_Division",
"Prims.op_Subtraction",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"FStar.Mul.op_Star",
"FStar.Calc.calc_init",
"FSta... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val len0_div_bs: blocksize:pos -> len:nat -> len0:nat ->
Lemma
(requires len0 <= len /\ len0 % blocksize == 0)
(ensures len0 / blocksize + (len - len0) / blocksize == len / blocksize) | [] | Lib.Sequence.Lemmas.len0_div_bs | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | blocksize: Prims.pos -> len: Prims.nat -> len0: Prims.nat
-> FStar.Pervasives.Lemma (requires len0 <= len /\ len0 % blocksize == 0)
(ensures len0 / blocksize + (len - len0) / blocksize == len / blocksize) | {
"end_col": 3,
"end_line": 123,
"start_col": 36,
"start_line": 113
} |
Prims.Tot | val map_blocks_multi_acc:
#a:Type0
-> blocksize:size_pos
-> mi:nat
-> hi:nat
-> n:nat{mi + n <= hi}
-> inp:seq a{length inp == n * blocksize}
-> f:(i:nat{i < hi} -> lseq a blocksize -> lseq a blocksize)
-> acc0:map_blocks_a a blocksize hi mi ->
out:seq a {length out == length acc0 + length inp} | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let map_blocks_multi_acc #a blocksize mi hi n inp f acc0 =
repeat_gen_blocks_multi #a blocksize mi hi n inp
(map_blocks_a a blocksize hi)
(repeat_gen_blocks_map_f blocksize hi f) acc0 | val map_blocks_multi_acc:
#a:Type0
-> blocksize:size_pos
-> mi:nat
-> hi:nat
-> n:nat{mi + n <= hi}
-> inp:seq a{length inp == n * blocksize}
-> f:(i:nat{i < hi} -> lseq a blocksize -> lseq a blocksize)
-> acc0:map_blocks_a a blocksize hi mi ->
out:seq a {length out == length acc0 + length inp}
let ... | false | null | false | repeat_gen_blocks_multi #a
blocksize
mi
hi
n
inp
(map_blocks_a a blocksize hi)
(repeat_gen_blocks_map_f blocksize hi f)
acc0 | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"total"
] | [
"Lib.IntTypes.size_pos",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Lib.Sequence.seq",
"Prims.eq2",
"Prims.int",
"Lib.Sequence.length",
"FStar.Mul.op_Star",
"Prims.op_LessThan",
"Lib.Sequence.lseq",
"Lib.Sequence.map_blocks_a",
"Lib.Sequence.Lemmas.repeat_g... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val map_blocks_multi_acc:
#a:Type0
-> blocksize:size_pos
-> mi:nat
-> hi:nat
-> n:nat{mi + n <= hi}
-> inp:seq a{length inp == n * blocksize}
-> f:(i:nat{i < hi} -> lseq a blocksize -> lseq a blocksize)
-> acc0:map_blocks_a a blocksize hi mi ->
out:seq a {length out == length acc0 + length inp} | [] | Lib.Sequence.Lemmas.map_blocks_multi_acc | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
mi: Prims.nat ->
hi: Prims.nat ->
n: Prims.nat{mi + n <= hi} ->
inp: Lib.Sequence.seq a {Lib.Sequence.length inp == n * blocksize} ->
f: (i: Prims.nat{i < hi} -> _: Lib.Sequence.lseq a blocksize -> Lib.Sequence.lseq a blocksize) ->
acc0: Lib.Sequence.map_... | {
"end_col": 49,
"end_line": 648,
"start_col": 2,
"start_line": 646
} |
Prims.Tot | val repeat_gen_blocks:
#inp_t:Type0
-> #c:Type0
-> blocksize:size_pos
-> mi:nat
-> hi:nat
-> inp:seq inp_t{mi + length inp / blocksize <= hi}
-> a:(i:nat{i <= hi} -> Type)
-> f:(i:nat{i < hi} -> lseq inp_t blocksize -> a i -> a (i + 1))
-> l:(i:nat{i <= hi} -> len:nat{len < blocksize} -> lseq inp_t ... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let repeat_gen_blocks #inp_t #c blocksize mi hi inp a f l acc0 =
let len = length inp in
let nb = len / blocksize in
let rem = len % blocksize in
let blocks = Seq.slice inp 0 (nb * blocksize) in
let last = Seq.slice inp (nb * blocksize) len in
Math.Lemmas.cancel_mul_div nb blocksize;
let acc = repeat_gen_... | val repeat_gen_blocks:
#inp_t:Type0
-> #c:Type0
-> blocksize:size_pos
-> mi:nat
-> hi:nat
-> inp:seq inp_t{mi + length inp / blocksize <= hi}
-> a:(i:nat{i <= hi} -> Type)
-> f:(i:nat{i < hi} -> lseq inp_t blocksize -> a i -> a (i + 1))
-> l:(i:nat{i <= hi} -> len:nat{len < blocksize} -> lseq inp_t ... | false | null | false | let len = length inp in
let nb = len / blocksize in
let rem = len % blocksize in
let blocks = Seq.slice inp 0 (nb * blocksize) in
let last = Seq.slice inp (nb * blocksize) len in
Math.Lemmas.cancel_mul_div nb blocksize;
let acc = repeat_gen_blocks_multi #inp_t blocksize mi hi nb blocks a f acc0 in
l (mi + nb) rem last ... | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"total"
] | [
"Lib.IntTypes.size_pos",
"Prims.nat",
"Lib.Sequence.seq",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Prims.op_Division",
"Lib.Sequence.length",
"Prims.op_LessThan",
"Lib.Sequence.lseq",
"Lib.Sequence.Lemmas.repeat_gen_blocks_multi",
"Prims.unit",
"FStar.Math.Lemmas.cancel... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val repeat_gen_blocks:
#inp_t:Type0
-> #c:Type0
-> blocksize:size_pos
-> mi:nat
-> hi:nat
-> inp:seq inp_t{mi + length inp / blocksize <= hi}
-> a:(i:nat{i <= hi} -> Type)
-> f:(i:nat{i < hi} -> lseq inp_t blocksize -> a i -> a (i + 1))
-> l:(i:nat{i <= hi} -> len:nat{len < blocksize} -> lseq inp_t ... | [] | Lib.Sequence.Lemmas.repeat_gen_blocks | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
mi: Prims.nat ->
hi: Prims.nat ->
inp: Lib.Sequence.seq inp_t {mi + Lib.Sequence.length inp / blocksize <= hi} ->
a: (i: Prims.nat{i <= hi} -> Type) ->
f: (i: Prims.nat{i < hi} -> _: Lib.Sequence.lseq inp_t blocksize -> _: a i -> a (i + 1)) ->
l:
(
... | {
"end_col": 26,
"end_line": 78,
"start_col": 64,
"start_line": 70
} |
FStar.Pervasives.Lemma | val repeat_blocks_multi_extensionality:
#a:Type0
-> #b:Type0
-> blocksize:size_pos
-> inp:seq a{length inp % blocksize = 0}
-> f:(lseq a blocksize -> b -> b)
-> g:(lseq a blocksize -> b -> b)
-> init:b ->
Lemma
(requires
(forall (block:lseq a blocksize) (acc:b). f block acc == g block acc))
(e... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let repeat_blocks_multi_extensionality #a #b blocksize inp f g init =
let len = length inp in
let nb = len / blocksize in
let f_rep = repeat_blocks_f blocksize inp f nb in
let g_rep = repeat_blocks_f blocksize inp g nb in
lemma_repeat_blocks_multi blocksize inp f init;
lemma_repeat_blocks_multi blocksize i... | val repeat_blocks_multi_extensionality:
#a:Type0
-> #b:Type0
-> blocksize:size_pos
-> inp:seq a{length inp % blocksize = 0}
-> f:(lseq a blocksize -> b -> b)
-> g:(lseq a blocksize -> b -> b)
-> init:b ->
Lemma
(requires
(forall (block:lseq a blocksize) (acc:b). f block acc == g block acc))
(e... | false | null | true | let len = length inp in
let nb = len / blocksize in
let f_rep = repeat_blocks_f blocksize inp f nb in
let g_rep = repeat_blocks_f blocksize inp g nb in
lemma_repeat_blocks_multi blocksize inp f init;
lemma_repeat_blocks_multi blocksize inp g init;
let aux (i: nat{i < nb}) (acc: b) : Lemma (f_rep i acc == g_rep i acc) =... | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Lib.IntTypes.size_pos",
"Lib.Sequence.seq",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Lib.Sequence.length",
"Lib.Sequence.lseq",
"Lib.Sequence.Lemmas.repeati_extensionality",
"Prims.unit",
"FStar.Classical.forall_intro_2",
"Prims.nat",
"Prims.op_LessThan",
"Prims... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val repeat_blocks_multi_extensionality:
#a:Type0
-> #b:Type0
-> blocksize:size_pos
-> inp:seq a{length inp % blocksize = 0}
-> f:(lseq a blocksize -> b -> b)
-> g:(lseq a blocksize -> b -> b)
-> init:b ->
Lemma
(requires
(forall (block:lseq a blocksize) (acc:b). f block acc == g block acc))
(e... | [] | Lib.Sequence.Lemmas.repeat_blocks_multi_extensionality | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
inp: Lib.Sequence.seq a {Lib.Sequence.length inp % blocksize = 0} ->
f: (_: Lib.Sequence.lseq a blocksize -> _: b -> b) ->
g: (_: Lib.Sequence.lseq a blocksize -> _: b -> b) ->
init: b
-> FStar.Pervasives.Lemma
(requires forall (block: Lib.Sequence.lseq a... | {
"end_col": 44,
"end_line": 605,
"start_col": 69,
"start_line": 591
} |
FStar.Pervasives.Lemma | val repeat_blocks_is_repeat_gen_blocks:
#a:Type0
-> #b:Type0
-> #c:Type0
-> hi:nat
-> blocksize:size_pos
-> inp:seq a{length inp / blocksize <= hi}
-> f:(lseq a blocksize -> b -> b)
-> l:(len:nat{len < blocksize} -> s:lseq a len -> b -> c)
-> acc0:b ->
Lemma
(repeat_blocks #a #b #c blocksize in... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let repeat_blocks_is_repeat_gen_blocks #a #b #c hi blocksize inp f l acc0 =
let len = length inp in
let nb = len / blocksize in
//let rem = len % blocksize in
Math.Lemmas.cancel_mul_div nb blocksize;
Math.Lemmas.cancel_mul_mod nb blocksize;
let blocks = Seq.slice inp 0 (nb * blocksize) in
lemma_repeat_b... | val repeat_blocks_is_repeat_gen_blocks:
#a:Type0
-> #b:Type0
-> #c:Type0
-> hi:nat
-> blocksize:size_pos
-> inp:seq a{length inp / blocksize <= hi}
-> f:(lseq a blocksize -> b -> b)
-> l:(len:nat{len < blocksize} -> s:lseq a len -> b -> c)
-> acc0:b ->
Lemma
(repeat_blocks #a #b #c blocksize in... | false | null | true | let len = length inp in
let nb = len / blocksize in
Math.Lemmas.cancel_mul_div nb blocksize;
Math.Lemmas.cancel_mul_mod nb blocksize;
let blocks = Seq.slice inp 0 (nb * blocksize) in
lemma_repeat_blocks_via_multi #a #b #c blocksize inp f l acc0;
calc ( == ) {
repeat_blocks_multi blocksize blocks f acc0;
( == ) { re... | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Prims.nat",
"Lib.IntTypes.size_pos",
"Lib.Sequence.seq",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Division",
"Lib.Sequence.length",
"Lib.Sequence.lseq",
"Prims.op_LessThan",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Lib.Sequence.repeat_blocks_multi",
"Lib.Sequence.Lemmas.repeat_gen_... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val repeat_blocks_is_repeat_gen_blocks:
#a:Type0
-> #b:Type0
-> #c:Type0
-> hi:nat
-> blocksize:size_pos
-> inp:seq a{length inp / blocksize <= hi}
-> f:(lseq a blocksize -> b -> b)
-> l:(len:nat{len < blocksize} -> s:lseq a len -> b -> c)
-> acc0:b ->
Lemma
(repeat_blocks #a #b #c blocksize in... | [] | Lib.Sequence.Lemmas.repeat_blocks_is_repeat_gen_blocks | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
hi: Prims.nat ->
blocksize: Lib.IntTypes.size_pos ->
inp: Lib.Sequence.seq a {Lib.Sequence.length inp / blocksize <= hi} ->
f: (_: Lib.Sequence.lseq a blocksize -> _: b -> b) ->
l: (len: Prims.nat{len < blocksize} -> s: Lib.Sequence.lseq a len -> _: b -> c) ->
acc0: b
-> FStar.Pervasives.Lemm... | {
"end_col": 5,
"end_line": 515,
"start_col": 75,
"start_line": 501
} |
FStar.Pervasives.Lemma | val repeat_blocks_extensionality:
#a:Type0
-> #b:Type0
-> #c:Type0
-> blocksize:size_pos
-> inp:seq a
-> f1:(lseq a blocksize -> b -> b)
-> f2:(lseq a blocksize -> b -> b)
-> l1:(len:nat{len < blocksize} -> s:lseq a len -> b -> c)
-> l2:(len:nat{len < blocksize} -> s:lseq a len -> b -> c)
-> acc0:... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let repeat_blocks_extensionality #a #b #c blocksize inp f1 f2 l1 l2 acc0 =
let len = length inp in
let nb = len / blocksize in
let f_rep1 = repeat_blocks_f blocksize inp f1 nb in
let f_rep2 = repeat_blocks_f blocksize inp f2 nb in
let acc1 = Loops.repeati nb f_rep1 acc0 in
let acc2 = Loops.repeati nb f_re... | val repeat_blocks_extensionality:
#a:Type0
-> #b:Type0
-> #c:Type0
-> blocksize:size_pos
-> inp:seq a
-> f1:(lseq a blocksize -> b -> b)
-> f2:(lseq a blocksize -> b -> b)
-> l1:(len:nat{len < blocksize} -> s:lseq a len -> b -> c)
-> l2:(len:nat{len < blocksize} -> s:lseq a len -> b -> c)
-> acc0:... | false | null | true | let len = length inp in
let nb = len / blocksize in
let f_rep1 = repeat_blocks_f blocksize inp f1 nb in
let f_rep2 = repeat_blocks_f blocksize inp f2 nb in
let acc1 = Loops.repeati nb f_rep1 acc0 in
let acc2 = Loops.repeati nb f_rep2 acc0 in
lemma_repeat_blocks blocksize inp f1 l1 acc0;
lemma_repeat_blocks blocksize in... | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Lib.IntTypes.size_pos",
"Lib.Sequence.seq",
"Lib.Sequence.lseq",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.Sequence.Lemmas.repeati_extensionality",
"Prims.unit",
"FStar.Classical.forall_intro_2",
"Prims.eq2",
"Prims.l_True",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasives.pattern... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val repeat_blocks_extensionality:
#a:Type0
-> #b:Type0
-> #c:Type0
-> blocksize:size_pos
-> inp:seq a
-> f1:(lseq a blocksize -> b -> b)
-> f2:(lseq a blocksize -> b -> b)
-> l1:(len:nat{len < blocksize} -> s:lseq a len -> b -> c)
-> l2:(len:nat{len < blocksize} -> s:lseq a len -> b -> c)
-> acc0:... | [] | Lib.Sequence.Lemmas.repeat_blocks_extensionality | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
inp: Lib.Sequence.seq a ->
f1: (_: Lib.Sequence.lseq a blocksize -> _: b -> b) ->
f2: (_: Lib.Sequence.lseq a blocksize -> _: b -> b) ->
l1: (len: Prims.nat{len < blocksize} -> s: Lib.Sequence.lseq a len -> _: b -> c) ->
l2: (len: Prims.nat{len < blocksize} -... | {
"end_col": 46,
"end_line": 451,
"start_col": 74,
"start_line": 434
} |
FStar.Pervasives.Lemma | val map_blocks_extensionality:
#a:Type0
-> blocksize:size_pos
-> inp:seq a
-> f:(block (length inp) blocksize -> lseq a blocksize -> lseq a blocksize)
-> l_f:(last (length inp) blocksize -> rem:size_nat{rem < blocksize} -> s:lseq a rem -> lseq a rem)
-> g:(block (length inp) blocksize -> lseq a blocksize ... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let map_blocks_extensionality #a blocksize inp f l_f g l_g =
let len = length inp in
let n = len / blocksize in
let blocks = Seq.slice inp 0 (n * blocksize) in
lemma_map_blocks blocksize inp f l_f;
lemma_map_blocks blocksize inp g l_g;
map_blocks_multi_extensionality #a blocksize n n blocks f g | val map_blocks_extensionality:
#a:Type0
-> blocksize:size_pos
-> inp:seq a
-> f:(block (length inp) blocksize -> lseq a blocksize -> lseq a blocksize)
-> l_f:(last (length inp) blocksize -> rem:size_nat{rem < blocksize} -> s:lseq a rem -> lseq a rem)
-> g:(block (length inp) blocksize -> lseq a blocksize ... | false | null | true | let len = length inp in
let n = len / blocksize in
let blocks = Seq.slice inp 0 (n * blocksize) in
lemma_map_blocks blocksize inp f l_f;
lemma_map_blocks blocksize inp g l_g;
map_blocks_multi_extensionality #a blocksize n n blocks f g | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Lib.IntTypes.size_pos",
"Lib.Sequence.seq",
"Lib.Sequence.block",
"Lib.Sequence.length",
"Lib.Sequence.lseq",
"Lib.Sequence.last",
"Lib.IntTypes.size_nat",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.Sequence.Lemmas.map_blocks_multi_extensionality",
"Prims.unit",
"Lib.Sequence.lemma_map_blocks",
... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val map_blocks_extensionality:
#a:Type0
-> blocksize:size_pos
-> inp:seq a
-> f:(block (length inp) blocksize -> lseq a blocksize -> lseq a blocksize)
-> l_f:(last (length inp) blocksize -> rem:size_nat{rem < blocksize} -> s:lseq a rem -> lseq a rem)
-> g:(block (length inp) blocksize -> lseq a blocksize ... | [] | Lib.Sequence.Lemmas.map_blocks_extensionality | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
inp: Lib.Sequence.seq a ->
f:
(_: Lib.Sequence.block (Lib.Sequence.length inp) blocksize -> _: Lib.Sequence.lseq a blocksize
-> Lib.Sequence.lseq a blocksize) ->
l_f:
(
_: Lib.Sequence.last (Lib.Sequence.length inp) blocksize ->
... | {
"end_col": 61,
"end_line": 639,
"start_col": 60,
"start_line": 632
} |
FStar.Pervasives.Lemma | val lemma_repeat_blocks_via_multi:
#a:Type0
-> #b:Type0
-> #c:Type0
-> blocksize:size_pos
-> inp:seq a
-> f:(lseq a blocksize -> b -> b)
-> l:(len:nat{len < blocksize} -> s:lseq a len -> b -> c)
-> acc0:b ->
Lemma
(let len = length inp in
let nb = len / blocksize in
let rem = len % blocks... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let lemma_repeat_blocks_via_multi #a #b #c blocksize inp f l acc0 =
let len = length inp in
let nb = len / blocksize in
let blocks = Seq.slice inp 0 (nb * blocksize) in
Math.Lemmas.cancel_mul_div nb blocksize;
Math.Lemmas.cancel_mul_mod nb blocksize;
let f_rep_b = repeat_blocks_f blocksize blocks f nb in
... | val lemma_repeat_blocks_via_multi:
#a:Type0
-> #b:Type0
-> #c:Type0
-> blocksize:size_pos
-> inp:seq a
-> f:(lseq a blocksize -> b -> b)
-> l:(len:nat{len < blocksize} -> s:lseq a len -> b -> c)
-> acc0:b ->
Lemma
(let len = length inp in
let nb = len / blocksize in
let rem = len % blocks... | false | null | true | let len = length inp in
let nb = len / blocksize in
let blocks = Seq.slice inp 0 (nb * blocksize) in
Math.Lemmas.cancel_mul_div nb blocksize;
Math.Lemmas.cancel_mul_mod nb blocksize;
let f_rep_b = repeat_blocks_f blocksize blocks f nb in
let f_rep = repeat_blocks_f blocksize inp f nb in
let aux (i: nat{i < nb}) (acc: b... | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Lib.IntTypes.size_pos",
"Lib.Sequence.seq",
"Lib.Sequence.lseq",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Lib.LoopCombinators.repeati",
"Lib.Sequence.repeat_blocks_multi",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val lemma_repeat_blocks_via_multi:
#a:Type0
-> #b:Type0
-> #c:Type0
-> blocksize:size_pos
-> inp:seq a
-> f:(lseq a blocksize -> b -> b)
-> l:(len:nat{len < blocksize} -> s:lseq a len -> b -> c)
-> acc0:b ->
Lemma
(let len = length inp in
let nb = len / blocksize in
let rem = len % blocks... | [] | Lib.Sequence.Lemmas.lemma_repeat_blocks_via_multi | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
inp: Lib.Sequence.seq a ->
f: (_: Lib.Sequence.lseq a blocksize -> _: b -> b) ->
l: (len: Prims.nat{len < blocksize} -> s: Lib.Sequence.lseq a len -> _: b -> c) ->
acc0: b
-> FStar.Pervasives.Lemma
(ensures
(let len = Lib.Sequence.length inp in
... | {
"end_col": 3,
"end_line": 476,
"start_col": 67,
"start_line": 454
} |
FStar.Pervasives.Lemma | val aux_repeat_bf_s1:
#inp_t:Type0
-> blocksize:size_pos
-> len0:nat{len0 % blocksize == 0}
-> mi:nat
-> hi:nat
-> n:nat{mi + n <= hi}
-> inp:seq inp_t{len0 <= length inp /\ length inp == n * blocksize}
-> a:(i:nat{i <= hi} -> Type)
-> f:(i:nat{i < hi} -> lseq inp_t blocksize -> a i -> a (i + 1))
... | [
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "Lib.Loo... | false | let aux_repeat_bf_s1 #inp_t blocksize len0 mi hi n inp a f i acc =
let len = length inp in
let len1 = len - len0 in
let n0 = len0 / blocksize in
let n1 = len1 / blocksize in
split_len_lemma0 blocksize n len0;
let t1 = Seq.slice inp len0 len in
let repeat_bf_s1 = repeat_gen_blocks_f blocksize (mi + n0) hi... | val aux_repeat_bf_s1:
#inp_t:Type0
-> blocksize:size_pos
-> len0:nat{len0 % blocksize == 0}
-> mi:nat
-> hi:nat
-> n:nat{mi + n <= hi}
-> inp:seq inp_t{len0 <= length inp /\ length inp == n * blocksize}
-> a:(i:nat{i <= hi} -> Type)
-> f:(i:nat{i < hi} -> lseq inp_t blocksize -> a i -> a (i + 1))
... | false | null | true | let len = length inp in
let len1 = len - len0 in
let n0 = len0 / blocksize in
let n1 = len1 / blocksize in
split_len_lemma0 blocksize n len0;
let t1 = Seq.slice inp len0 len in
let repeat_bf_s1 = repeat_gen_blocks_f blocksize (mi + n0) hi n1 t1 a f in
let repeat_bf_t = repeat_gen_blocks_f blocksize mi hi n inp a f in
l... | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Lib.IntTypes.size_pos",
"Prims.nat",
"Prims.eq2",
"Prims.int",
"Prims.op_Modulus",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Lib.Sequence.seq",
"Prims.l_and",
"Lib.Sequence.length",
"FStar.Mul.op_Star",
"Prims.op_LessThan",
"Lib.Sequence.lseq",
"Prims.op_Division",
... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val aux_repeat_bf_s1:
#inp_t:Type0
-> blocksize:size_pos
-> len0:nat{len0 % blocksize == 0}
-> mi:nat
-> hi:nat
-> n:nat{mi + n <= hi}
-> inp:seq inp_t{len0 <= length inp /\ length inp == n * blocksize}
-> a:(i:nat{i <= hi} -> Type)
-> f:(i:nat{i < hi} -> lseq inp_t blocksize -> a i -> a (i + 1))
... | [] | Lib.Sequence.Lemmas.aux_repeat_bf_s1 | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
len0: Prims.nat{len0 % blocksize == 0} ->
mi: Prims.nat ->
hi: Prims.nat ->
n: Prims.nat{mi + n <= hi} ->
inp:
Lib.Sequence.seq inp_t
{len0 <= Lib.Sequence.length inp /\ Lib.Sequence.length inp == n * blocksize} ->
a: (i: Prims.nat{i <= hi} ... | {
"end_col": 46,
"end_line": 267,
"start_col": 66,
"start_line": 233
} |
FStar.Pervasives.Lemma | val repeat_blocks_multi_is_repeat_gen_blocks_multi:
#a:Type0
-> #b:Type0
-> hi:nat
-> blocksize:size_pos
-> inp:seq a{length inp % blocksize = 0 /\ length inp / blocksize <= hi}
-> f:(lseq a blocksize -> b -> b)
-> acc0:b ->
Lemma
(let n = length inp / blocksize in
Math.Lemmas.div_exact_r (leng... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let repeat_blocks_multi_is_repeat_gen_blocks_multi #a #b hi blocksize inp f acc0 =
let len = length inp in
let n = len / blocksize in
Math.Lemmas.div_exact_r len blocksize;
let f_rep = repeat_blocks_f blocksize inp f n in
let f_gen = repeat_gen_blocks_f blocksize 0 hi n inp (Loops.fixed_a b) (Loops.fixed_i f... | val repeat_blocks_multi_is_repeat_gen_blocks_multi:
#a:Type0
-> #b:Type0
-> hi:nat
-> blocksize:size_pos
-> inp:seq a{length inp % blocksize = 0 /\ length inp / blocksize <= hi}
-> f:(lseq a blocksize -> b -> b)
-> acc0:b ->
Lemma
(let n = length inp / blocksize in
Math.Lemmas.div_exact_r (leng... | false | null | true | let len = length inp in
let n = len / blocksize in
Math.Lemmas.div_exact_r len blocksize;
let f_rep = repeat_blocks_f blocksize inp f n in
let f_gen = repeat_gen_blocks_f blocksize 0 hi n inp (Loops.fixed_a b) (Loops.fixed_i f) in
let aux (i: nat{i < n}) (acc: b) : Lemma (f_rep i acc == f_gen i acc) = () in
calc ( == )... | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Prims.nat",
"Lib.IntTypes.size_pos",
"Lib.Sequence.seq",
"Prims.l_and",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Lib.Sequence.length",
"Prims.op_LessThanOrEqual",
"Prims.op_Division",
"Lib.Sequence.lseq",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Lib.Sequence.re... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val repeat_blocks_multi_is_repeat_gen_blocks_multi:
#a:Type0
-> #b:Type0
-> hi:nat
-> blocksize:size_pos
-> inp:seq a{length inp % blocksize = 0 /\ length inp / blocksize <= hi}
-> f:(lseq a blocksize -> b -> b)
-> acc0:b ->
Lemma
(let n = length inp / blocksize in
Math.Lemmas.div_exact_r (leng... | [] | Lib.Sequence.Lemmas.repeat_blocks_multi_is_repeat_gen_blocks_multi | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
hi: Prims.nat ->
blocksize: Lib.IntTypes.size_pos ->
inp:
Lib.Sequence.seq a
{Lib.Sequence.length inp % blocksize = 0 /\ Lib.Sequence.length inp / blocksize <= hi} ->
f: (_: Lib.Sequence.lseq a blocksize -> _: b -> b) ->
acc0: b
-> FStar.Pervasives.Lemma
(ensures
(let n = ... | {
"end_col": 5,
"end_line": 498,
"start_col": 82,
"start_line": 479
} |
FStar.Pervasives.Lemma | val map_blocks_acc_is_map_blocks0:
#a:Type0
-> blocksize:size_pos
-> hi:nat
-> inp:seq a{length inp / blocksize <= hi}
-> f:(i:nat{i < hi} -> lseq a blocksize -> lseq a blocksize)
-> l:(i:nat{i <= hi} -> rem:nat{rem < blocksize} -> lseq a rem -> lseq a rem) ->
Lemma (map_blocks_acc #a blocksize 0 hi inp... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let map_blocks_acc_is_map_blocks0 #a blocksize hi inp f l =
let len = length inp in
let n = len / blocksize in
let f_sh = f_shift blocksize 0 hi n f in
let l_sh = l_shift blocksize 0 hi n l in
calc (==) {
map_blocks_acc #a blocksize 0 hi inp f l Seq.empty;
(==) { map_blocks_acc_is_map_blocks blocksiz... | val map_blocks_acc_is_map_blocks0:
#a:Type0
-> blocksize:size_pos
-> hi:nat
-> inp:seq a{length inp / blocksize <= hi}
-> f:(i:nat{i < hi} -> lseq a blocksize -> lseq a blocksize)
-> l:(i:nat{i <= hi} -> rem:nat{rem < blocksize} -> lseq a rem -> lseq a rem) ->
Lemma (map_blocks_acc #a blocksize 0 hi inp... | false | null | true | let len = length inp in
let n = len / blocksize in
let f_sh = f_shift blocksize 0 hi n f in
let l_sh = l_shift blocksize 0 hi n l in
calc ( == ) {
map_blocks_acc #a blocksize 0 hi inp f l Seq.empty;
( == ) { map_blocks_acc_is_map_blocks blocksize 0 hi inp f l Seq.empty }
Seq.append Seq.empty (map_blocks #a blocks... | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Lib.IntTypes.size_pos",
"Prims.nat",
"Lib.Sequence.seq",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Division",
"Lib.Sequence.length",
"Prims.op_LessThan",
"Lib.Sequence.lseq",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Lib.Sequence.Lemmas.map_blocks_acc",
"FStar.Seq.Base.empty",
"Lib... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val map_blocks_acc_is_map_blocks0:
#a:Type0
-> blocksize:size_pos
-> hi:nat
-> inp:seq a{length inp / blocksize <= hi}
-> f:(i:nat{i < hi} -> lseq a blocksize -> lseq a blocksize)
-> l:(i:nat{i <= hi} -> rem:nat{rem < blocksize} -> lseq a rem -> lseq a rem) ->
Lemma (map_blocks_acc #a blocksize 0 hi inp... | [] | Lib.Sequence.Lemmas.map_blocks_acc_is_map_blocks0 | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
hi: Prims.nat ->
inp: Lib.Sequence.seq a {Lib.Sequence.length inp / blocksize <= hi} ->
f: (i: Prims.nat{i < hi} -> _: Lib.Sequence.lseq a blocksize -> Lib.Sequence.lseq a blocksize) ->
l:
(i: Prims.nat{i <= hi} -> rem: Prims.nat{rem < blocksize} -> _: Lib.... | {
"end_col": 5,
"end_line": 783,
"start_col": 59,
"start_line": 769
} |
FStar.Pervasives.Lemma | val repeat_gen_blocks_multi_extensionality_zero:
#inp_t:Type0
-> blocksize:size_pos
-> mi:nat
-> hi_f:nat
-> hi_g:nat
-> n:nat{mi + n <= hi_f /\ n <= hi_g}
-> inp:seq inp_t{length inp == n * blocksize}
-> a_f:(i:nat{i <= hi_f} -> Type)
-> a_g:(i:nat{i <= hi_g} -> Type)
-> f:(i:nat{i < hi_f} -> lse... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let repeat_gen_blocks_multi_extensionality_zero #inp_t blocksize mi hi_f hi_g n inp a_f a_g f g acc0 =
let f_rep = repeat_gen_blocks_f blocksize mi hi_f n inp a_f f in
let g_rep = repeat_gen_blocks_f blocksize 0 hi_g n inp a_g g in
repeat_gen_right_extensionality n mi a_g a_f g_rep f_rep acc0 | val repeat_gen_blocks_multi_extensionality_zero:
#inp_t:Type0
-> blocksize:size_pos
-> mi:nat
-> hi_f:nat
-> hi_g:nat
-> n:nat{mi + n <= hi_f /\ n <= hi_g}
-> inp:seq inp_t{length inp == n * blocksize}
-> a_f:(i:nat{i <= hi_f} -> Type)
-> a_g:(i:nat{i <= hi_g} -> Type)
-> f:(i:nat{i < hi_f} -> lse... | false | null | true | let f_rep = repeat_gen_blocks_f blocksize mi hi_f n inp a_f f in
let g_rep = repeat_gen_blocks_f blocksize 0 hi_g n inp a_g g in
repeat_gen_right_extensionality n mi a_g a_f g_rep f_rep acc0 | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Lib.IntTypes.size_pos",
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Lib.Sequence.seq",
"Prims.eq2",
"Prims.int",
"Lib.Sequence.length",
"FStar.Mul.op_Star",
"Prims.op_LessThan",
"Lib.Sequence.lseq",
"Lib.Sequence.Lemmas.repeat_gen_right_exten... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val repeat_gen_blocks_multi_extensionality_zero:
#inp_t:Type0
-> blocksize:size_pos
-> mi:nat
-> hi_f:nat
-> hi_g:nat
-> n:nat{mi + n <= hi_f /\ n <= hi_g}
-> inp:seq inp_t{length inp == n * blocksize}
-> a_f:(i:nat{i <= hi_f} -> Type)
-> a_g:(i:nat{i <= hi_g} -> Type)
-> f:(i:nat{i < hi_f} -> lse... | [] | Lib.Sequence.Lemmas.repeat_gen_blocks_multi_extensionality_zero | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
mi: Prims.nat ->
hi_f: Prims.nat ->
hi_g: Prims.nat ->
n: Prims.nat{mi + n <= hi_f /\ n <= hi_g} ->
inp: Lib.Sequence.seq inp_t {Lib.Sequence.length inp == n * blocksize} ->
a_f: (i: Prims.nat{i <= hi_f} -> Type) ->
a_g: (i: Prims.nat{i <= hi_g} -> Ty... | {
"end_col": 63,
"end_line": 87,
"start_col": 102,
"start_line": 84
} |
FStar.Pervasives.Lemma | val aux_repeat_bf_s0:
#inp_t:Type0
-> blocksize:size_pos
-> len0:nat{len0 % blocksize == 0}
-> mi:nat
-> hi:nat
-> n:nat{mi + n <= hi}
-> inp:seq inp_t{len0 <= length inp /\ length inp == n * blocksize}
-> a:(i:nat{i <= hi} -> Type)
-> f:(i:nat{i < hi} -> lseq inp_t blocksize -> a i -> a (i + 1))
... | [
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "Lib.Loo... | false | let aux_repeat_bf_s0 #inp_t blocksize len0 mi hi n inp a f i acc =
let len = length inp in
let n0 = len0 / blocksize in
split_len_lemma0 blocksize n len0;
let t0 = Seq.slice inp 0 len0 in
let repeat_bf_s0 = repeat_gen_blocks_f blocksize mi hi n0 t0 a f in
let repeat_bf_t = repeat_gen_blocks_f blocksize mi... | val aux_repeat_bf_s0:
#inp_t:Type0
-> blocksize:size_pos
-> len0:nat{len0 % blocksize == 0}
-> mi:nat
-> hi:nat
-> n:nat{mi + n <= hi}
-> inp:seq inp_t{len0 <= length inp /\ length inp == n * blocksize}
-> a:(i:nat{i <= hi} -> Type)
-> f:(i:nat{i < hi} -> lseq inp_t blocksize -> a i -> a (i + 1))
... | false | null | true | let len = length inp in
let n0 = len0 / blocksize in
split_len_lemma0 blocksize n len0;
let t0 = Seq.slice inp 0 len0 in
let repeat_bf_s0 = repeat_gen_blocks_f blocksize mi hi n0 t0 a f in
let repeat_bf_t = repeat_gen_blocks_f blocksize mi hi n inp a f in
let i_b = i - mi in
Math.Lemmas.lemma_mult_le_right blocksize (i... | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Lib.IntTypes.size_pos",
"Prims.nat",
"Prims.eq2",
"Prims.int",
"Prims.op_Modulus",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Lib.Sequence.seq",
"Prims.l_and",
"Lib.Sequence.length",
"FStar.Mul.op_Star",
"Prims.op_LessThan",
"Lib.Sequence.lseq",
"Prims.op_Division",
... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val aux_repeat_bf_s0:
#inp_t:Type0
-> blocksize:size_pos
-> len0:nat{len0 % blocksize == 0}
-> mi:nat
-> hi:nat
-> n:nat{mi + n <= hi}
-> inp:seq inp_t{len0 <= length inp /\ length inp == n * blocksize}
-> a:(i:nat{i <= hi} -> Type)
-> f:(i:nat{i < hi} -> lseq inp_t blocksize -> a i -> a (i + 1))
... | [] | Lib.Sequence.Lemmas.aux_repeat_bf_s0 | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
len0: Prims.nat{len0 % blocksize == 0} ->
mi: Prims.nat ->
hi: Prims.nat ->
n: Prims.nat{mi + n <= hi} ->
inp:
Lib.Sequence.seq inp_t
{len0 <= Lib.Sequence.length inp /\ Lib.Sequence.length inp == n * blocksize} ->
a: (i: Prims.nat{i <= hi} ... | {
"end_col": 46,
"end_line": 205,
"start_col": 66,
"start_line": 189
} |
FStar.Pervasives.Lemma | val repeat_gen_blocks_multi_split_slice:
#inp_t:Type0
-> blocksize:size_pos
-> len0:nat{len0 % blocksize == 0}
-> mi:nat
-> hi:nat
-> inp:seq inp_t{len0 <= length inp / blocksize * blocksize /\ mi + length inp / blocksize <= hi}
-> a:(i:nat{i <= hi} -> Type)
-> f:(i:nat{i < hi} -> lseq inp_t blocksize... | [
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "Lib.Loo... | false | let repeat_gen_blocks_multi_split_slice #inp_t blocksize len0 mi hi inp a f acc0 =
let len = length inp in
let n = len / blocksize in
split_len_lemma blocksize len len0;
let blocks = Seq.slice inp 0 (n * blocksize) in
split_len_lemma0 blocksize n len0;
repeat_gen_blocks_multi_split blocksize len0 mi hi n bl... | val repeat_gen_blocks_multi_split_slice:
#inp_t:Type0
-> blocksize:size_pos
-> len0:nat{len0 % blocksize == 0}
-> mi:nat
-> hi:nat
-> inp:seq inp_t{len0 <= length inp / blocksize * blocksize /\ mi + length inp / blocksize <= hi}
-> a:(i:nat{i <= hi} -> Type)
-> f:(i:nat{i < hi} -> lseq inp_t blocksize... | false | null | true | let len = length inp in
let n = len / blocksize in
split_len_lemma blocksize len len0;
let blocks = Seq.slice inp 0 (n * blocksize) in
split_len_lemma0 blocksize n len0;
repeat_gen_blocks_multi_split blocksize len0 mi hi n blocks a f acc0 | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Lib.IntTypes.size_pos",
"Prims.nat",
"Prims.eq2",
"Prims.int",
"Prims.op_Modulus",
"Lib.Sequence.seq",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Prims.op_Division",
"Lib.Sequence.length",
"Prims.op_Addition",
"Prims.op_LessThan",
"Lib.Sequence.lseq",
... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val repeat_gen_blocks_multi_split_slice:
#inp_t:Type0
-> blocksize:size_pos
-> len0:nat{len0 % blocksize == 0}
-> mi:nat
-> hi:nat
-> inp:seq inp_t{len0 <= length inp / blocksize * blocksize /\ mi + length inp / blocksize <= hi}
-> a:(i:nat{i <= hi} -> Type)
-> f:(i:nat{i < hi} -> lseq inp_t blocksize... | [] | Lib.Sequence.Lemmas.repeat_gen_blocks_multi_split_slice | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
len0: Prims.nat{len0 % blocksize == 0} ->
mi: Prims.nat ->
hi: Prims.nat ->
inp:
Lib.Sequence.seq inp_t
{ len0 <= (Lib.Sequence.length inp / blocksize) * blocksize /\
mi + Lib.Sequence.length inp / blocksize <= hi } ->
a: (i: Prims.nat... | {
"end_col": 70,
"end_line": 347,
"start_col": 82,
"start_line": 341
} |
FStar.Pervasives.Lemma | val slice_slice_last:
#inp_t:Type0
-> blocksize:size_pos
-> len0:nat{len0 % blocksize = 0}
-> inp:seq inp_t{len0 <= length inp} ->
Lemma
(let len = length inp in
let len1 = len - len0 in
let n = len / blocksize in
let n1 = len1 / blocksize in
let t1 = Seq.slice inp len0 len in
Seq.sli... | [
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "Lib.Loo... | false | let slice_slice_last #inp_t blocksize len0 inp =
let len = length inp in
let len1 = len - len0 in
let n = len / blocksize in
let n0 = len0 / blocksize in
let n1 = len1 / blocksize in
calc (==) {
len0 + n1 * blocksize;
(==) { len0_div_bs blocksize len len0 }
len0 + (n - n0) * blocksize;
(==)... | val slice_slice_last:
#inp_t:Type0
-> blocksize:size_pos
-> len0:nat{len0 % blocksize = 0}
-> inp:seq inp_t{len0 <= length inp} ->
Lemma
(let len = length inp in
let len1 = len - len0 in
let n = len / blocksize in
let n1 = len1 / blocksize in
let t1 = Seq.slice inp len0 len in
Seq.sli... | false | null | true | let len = length inp in
let len1 = len - len0 in
let n = len / blocksize in
let n0 = len0 / blocksize in
let n1 = len1 / blocksize in
calc ( == ) {
len0 + n1 * blocksize;
( == ) { len0_div_bs blocksize len len0 }
len0 + (n - n0) * blocksize;
( == ) { Math.Lemmas.distributivity_sub_left n n0 blocksize }
len0 +... | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Lib.IntTypes.size_pos",
"Prims.nat",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Lib.Sequence.seq",
"Prims.op_LessThanOrEqual",
"Lib.Sequence.length",
"FStar.Seq.Properties.slice_slice",
"FStar.Mul.op_Star",
"FStar.Seq.Base.seq",
"FStar.Seq.Base.slice",
"Prims.unit... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val slice_slice_last:
#inp_t:Type0
-> blocksize:size_pos
-> len0:nat{len0 % blocksize = 0}
-> inp:seq inp_t{len0 <= length inp} ->
Lemma
(let len = length inp in
let len1 = len - len0 in
let n = len / blocksize in
let n1 = len1 / blocksize in
let t1 = Seq.slice inp len0 len in
Seq.sli... | [] | Lib.Sequence.Lemmas.slice_slice_last | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
len0: Prims.nat{len0 % blocksize = 0} ->
inp: Lib.Sequence.seq inp_t {len0 <= Lib.Sequence.length inp}
-> FStar.Pervasives.Lemma
(ensures
(let len = Lib.Sequence.length inp in
let len1 = len - len0 in
let n = len / blocksize in
let n1 ... | {
"end_col": 52,
"end_line": 382,
"start_col": 48,
"start_line": 364
} |
FStar.Pervasives.Lemma | val map_blocks_multi_acc_is_map_blocks_multi0:
#a:Type0
-> blocksize:size_pos
-> hi:nat
-> n:nat{n <= hi}
-> inp:seq a{length inp == n * blocksize}
-> f:(i:nat{i < hi} -> lseq a blocksize -> lseq a blocksize) ->
Lemma (map_blocks_multi_acc blocksize 0 hi n inp f Seq.empty `Seq.equal` map_blocks_multi bl... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let map_blocks_multi_acc_is_map_blocks_multi0 #a blocksize hi n inp f =
let f_sh = f_shift blocksize 0 hi n f in
let a_map = map_blocks_a a blocksize n in
let acc0 : a_map 0 = Seq.empty #a in
calc (==) {
map_blocks_multi_acc blocksize 0 hi n inp f Seq.empty;
(==) { map_blocks_multi_acc_is_map_blocks_mu... | val map_blocks_multi_acc_is_map_blocks_multi0:
#a:Type0
-> blocksize:size_pos
-> hi:nat
-> n:nat{n <= hi}
-> inp:seq a{length inp == n * blocksize}
-> f:(i:nat{i < hi} -> lseq a blocksize -> lseq a blocksize) ->
Lemma (map_blocks_multi_acc blocksize 0 hi n inp f Seq.empty `Seq.equal` map_blocks_multi bl... | false | null | true | let f_sh = f_shift blocksize 0 hi n f in
let a_map = map_blocks_a a blocksize n in
let acc0:a_map 0 = Seq.empty #a in
calc ( == ) {
map_blocks_multi_acc blocksize 0 hi n inp f Seq.empty;
( == ) { map_blocks_multi_acc_is_map_blocks_multi #a blocksize 0 hi n inp f Seq.empty }
Seq.append Seq.empty (map_blocks_multi ... | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Lib.IntTypes.size_pos",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Lib.Sequence.seq",
"Prims.eq2",
"Prims.int",
"Lib.Sequence.length",
"FStar.Mul.op_Star",
"Prims.op_LessThan",
"Lib.Sequence.lseq",
"FStar.Calc.calc_finish",
"Prims.op_Addition",
"FStar.Seq.Base.empty",
"Lib.S... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val map_blocks_multi_acc_is_map_blocks_multi0:
#a:Type0
-> blocksize:size_pos
-> hi:nat
-> n:nat{n <= hi}
-> inp:seq a{length inp == n * blocksize}
-> f:(i:nat{i < hi} -> lseq a blocksize -> lseq a blocksize) ->
Lemma (map_blocks_multi_acc blocksize 0 hi n inp f Seq.empty `Seq.equal` map_blocks_multi bl... | [] | Lib.Sequence.Lemmas.map_blocks_multi_acc_is_map_blocks_multi0 | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
hi: Prims.nat ->
n: Prims.nat{n <= hi} ->
inp: Lib.Sequence.seq a {Lib.Sequence.length inp == n * blocksize} ->
f: (i: Prims.nat{i < hi} -> _: Lib.Sequence.lseq a blocksize -> Lib.Sequence.lseq a blocksize)
-> FStar.Pervasives.Lemma
(ensures
FStar.Seq... | {
"end_col": 5,
"end_line": 766,
"start_col": 71,
"start_line": 753
} |
FStar.Pervasives.Lemma | val repeat_gen_right_extensionality:
n:nat
-> lo_g:nat
-> a_f:(i:nat{i <= n} -> Type)
-> a_g:(i:nat{lo_g <= i /\ i <= lo_g + n} -> Type)
-> f:(i:nat{i < n} -> a_f i -> a_f (i + 1))
-> g:(i:nat{lo_g <= i /\ i < lo_g + n} -> a_g i -> a_g (i + 1))
-> acc0:a_f 0 ->
Lemma
(requires
(forall (i:nat{i <... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let rec repeat_gen_right_extensionality n lo_g a_f a_g f g acc0 =
if n = 0 then begin
Loops.eq_repeat_right 0 n a_f f acc0;
Loops.eq_repeat_right lo_g (lo_g+n) a_g g acc0 end
else begin
Loops.unfold_repeat_right 0 n a_f f acc0 (n-1);
Loops.unfold_repeat_right lo_g (lo_g+n) a_g g acc0 (lo_g+n-1);
... | val repeat_gen_right_extensionality:
n:nat
-> lo_g:nat
-> a_f:(i:nat{i <= n} -> Type)
-> a_g:(i:nat{lo_g <= i /\ i <= lo_g + n} -> Type)
-> f:(i:nat{i < n} -> a_f i -> a_f (i + 1))
-> g:(i:nat{lo_g <= i /\ i < lo_g + n} -> a_g i -> a_g (i + 1))
-> acc0:a_f 0 ->
Lemma
(requires
(forall (i:nat{i <... | false | null | true | if n = 0
then
(Loops.eq_repeat_right 0 n a_f f acc0;
Loops.eq_repeat_right lo_g (lo_g + n) a_g g acc0)
else
(Loops.unfold_repeat_right 0 n a_f f acc0 (n - 1);
Loops.unfold_repeat_right lo_g (lo_g + n) a_g g acc0 (lo_g + n - 1);
repeat_gen_right_extensionality (n - 1) lo_g a_f a_g f g acc0) | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.l_and",
"Prims.op_Addition",
"Prims.op_LessThan",
"Prims.op_Equality",
"Prims.int",
"Lib.LoopCombinators.eq_repeat_right",
"Prims.unit",
"Prims.bool",
"Lib.Sequence.Lemmas.repeat_gen_right_extensionality",
"Prims.op_Subtraction",
... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val repeat_gen_right_extensionality:
n:nat
-> lo_g:nat
-> a_f:(i:nat{i <= n} -> Type)
-> a_g:(i:nat{lo_g <= i /\ i <= lo_g + n} -> Type)
-> f:(i:nat{i < n} -> a_f i -> a_f (i + 1))
-> g:(i:nat{lo_g <= i /\ i < lo_g + n} -> a_g i -> a_g (i + 1))
-> acc0:a_f 0 ->
Lemma
(requires
(forall (i:nat{i <... | [
"recursion"
] | Lib.Sequence.Lemmas.repeat_gen_right_extensionality | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
n: Prims.nat ->
lo_g: Prims.nat ->
a_f: (i: Prims.nat{i <= n} -> Type) ->
a_g: (i: Prims.nat{lo_g <= i /\ i <= lo_g + n} -> Type) ->
f: (i: Prims.nat{i < n} -> _: a_f i -> a_f (i + 1)) ->
g: (i: Prims.nat{lo_g <= i /\ i < lo_g + n} -> _: a_g i -> a_g (i + 1)) ->
acc0: a_f 0
-> FStar.Perva... | {
"end_col": 67,
"end_line": 39,
"start_col": 2,
"start_line": 33
} |
FStar.Pervasives.Lemma | val map_blocks_multi_acc_is_map_blocks_multi:
#a:Type0
-> blocksize:size_pos
-> mi:nat
-> hi:nat
-> n:nat{mi + n <= hi}
-> inp:seq a{length inp == n * blocksize}
-> f:(i:nat{i < hi} -> lseq a blocksize -> lseq a blocksize)
-> acc0:map_blocks_a a blocksize hi mi ->
Lemma
(map_blocks_multi_acc bloc... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let map_blocks_multi_acc_is_map_blocks_multi #a blocksize mi hi n inp f acc0 =
let f_map = repeat_gen_blocks_map_f blocksize hi f in
let a_map = map_blocks_a a blocksize hi in
let f_gen = repeat_gen_blocks_f blocksize mi hi n inp a_map f_map in
let f_map_s = f_shift blocksize mi hi n f in
let a_map_s = map_b... | val map_blocks_multi_acc_is_map_blocks_multi:
#a:Type0
-> blocksize:size_pos
-> mi:nat
-> hi:nat
-> n:nat{mi + n <= hi}
-> inp:seq a{length inp == n * blocksize}
-> f:(i:nat{i < hi} -> lseq a blocksize -> lseq a blocksize)
-> acc0:map_blocks_a a blocksize hi mi ->
Lemma
(map_blocks_multi_acc bloc... | false | null | true | let f_map = repeat_gen_blocks_map_f blocksize hi f in
let a_map = map_blocks_a a blocksize hi in
let f_gen = repeat_gen_blocks_f blocksize mi hi n inp a_map f_map in
let f_map_s = f_shift blocksize mi hi n f in
let a_map_s = map_blocks_a a blocksize n in
let f_gen_s = map_blocks_f #a blocksize n inp f_map_s in
calc ( =... | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Lib.IntTypes.size_pos",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Lib.Sequence.seq",
"Prims.eq2",
"Prims.int",
"Lib.Sequence.length",
"FStar.Mul.op_Star",
"Prims.op_LessThan",
"Lib.Sequence.lseq",
"Lib.Sequence.map_blocks_a",
"FStar.Calc.calc_finish",
"... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val map_blocks_multi_acc_is_map_blocks_multi:
#a:Type0
-> blocksize:size_pos
-> mi:nat
-> hi:nat
-> n:nat{mi + n <= hi}
-> inp:seq a{length inp == n * blocksize}
-> f:(i:nat{i < hi} -> lseq a blocksize -> lseq a blocksize)
-> acc0:map_blocks_a a blocksize hi mi ->
Lemma
(map_blocks_multi_acc bloc... | [] | Lib.Sequence.Lemmas.map_blocks_multi_acc_is_map_blocks_multi | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
mi: Prims.nat ->
hi: Prims.nat ->
n: Prims.nat{mi + n <= hi} ->
inp: Lib.Sequence.seq a {Lib.Sequence.length inp == n * blocksize} ->
f: (i: Prims.nat{i < hi} -> _: Lib.Sequence.lseq a blocksize -> Lib.Sequence.lseq a blocksize) ->
acc0: Lib.Sequence.map_... | {
"end_col": 3,
"end_line": 738,
"start_col": 78,
"start_line": 719
} |
FStar.Pervasives.Lemma | val map_blocks_acc_is_map_blocks:
#a:Type0
-> blocksize:size_pos
-> mi:nat
-> hi:nat
-> inp:seq a{mi + length inp / blocksize <= hi}
-> f:(i:nat{i < hi} -> lseq a blocksize -> lseq a blocksize)
-> l:(i:nat{i <= hi} -> rem:nat{rem < blocksize} -> lseq a rem -> lseq a rem)
-> acc0:map_blocks_a a blocksi... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let map_blocks_acc_is_map_blocks #a blocksize mi hi inp f l acc0 =
let len = length inp in
let n = len / blocksize in
Math.Lemmas.cancel_mul_div n blocksize;
let blocks = Seq.slice inp 0 (n * blocksize) in
let f_sh = f_shift blocksize mi hi n f in
let l_sh = l_shift blocksize mi hi n l in
lemma_map_block... | val map_blocks_acc_is_map_blocks:
#a:Type0
-> blocksize:size_pos
-> mi:nat
-> hi:nat
-> inp:seq a{mi + length inp / blocksize <= hi}
-> f:(i:nat{i < hi} -> lseq a blocksize -> lseq a blocksize)
-> l:(i:nat{i <= hi} -> rem:nat{rem < blocksize} -> lseq a rem -> lseq a rem)
-> acc0:map_blocks_a a blocksi... | false | null | true | let len = length inp in
let n = len / blocksize in
Math.Lemmas.cancel_mul_div n blocksize;
let blocks = Seq.slice inp 0 (n * blocksize) in
let f_sh = f_shift blocksize mi hi n f in
let l_sh = l_shift blocksize mi hi n l in
lemma_map_blocks #a blocksize inp f_sh l_sh;
map_blocks_multi_acc_is_map_blocks_multi #a blocksiz... | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Lib.IntTypes.size_pos",
"Prims.nat",
"Lib.Sequence.seq",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Prims.op_Division",
"Lib.Sequence.length",
"Prims.op_LessThan",
"Lib.Sequence.lseq",
"Lib.Sequence.map_blocks_a",
"Lib.Sequence.Lemmas.map_blocks_multi_acc_is_map_blocks_mul... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val map_blocks_acc_is_map_blocks:
#a:Type0
-> blocksize:size_pos
-> mi:nat
-> hi:nat
-> inp:seq a{mi + length inp / blocksize <= hi}
-> f:(i:nat{i < hi} -> lseq a blocksize -> lseq a blocksize)
-> l:(i:nat{i <= hi} -> rem:nat{rem < blocksize} -> lseq a rem -> lseq a rem)
-> acc0:map_blocks_a a blocksi... | [] | Lib.Sequence.Lemmas.map_blocks_acc_is_map_blocks | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
mi: Prims.nat ->
hi: Prims.nat ->
inp: Lib.Sequence.seq a {mi + Lib.Sequence.length inp / blocksize <= hi} ->
f: (i: Prims.nat{i < hi} -> _: Lib.Sequence.lseq a blocksize -> Lib.Sequence.lseq a blocksize) ->
l:
(i: Prims.nat{i <= hi} -> rem: Prims.nat{r... | {
"end_col": 77,
"end_line": 750,
"start_col": 66,
"start_line": 741
} |
FStar.Pervasives.Lemma | val repeat_right_extensionality:
n:nat
-> lo:nat
-> a_f:(i:nat{lo <= i /\ i <= lo + n} -> Type)
-> a_g:(i:nat{lo <= i /\ i <= lo + n} -> Type)
-> f:(i:nat{lo <= i /\ i < lo + n} -> a_f i -> a_f (i + 1))
-> g:(i:nat{lo <= i /\ i < lo + n} -> a_g i -> a_g (i + 1))
-> acc0:a_f lo ->
Lemma
(requires
... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let rec repeat_right_extensionality n lo a_f a_g f g acc0 =
if n = 0 then begin
Loops.eq_repeat_right lo (lo + n) a_f f acc0;
Loops.eq_repeat_right lo (lo + n) a_g g acc0 end
else begin
Loops.unfold_repeat_right lo (lo + n) a_f f acc0 (lo + n - 1);
Loops.unfold_repeat_right lo (lo + n) a_g g acc0 (l... | val repeat_right_extensionality:
n:nat
-> lo:nat
-> a_f:(i:nat{lo <= i /\ i <= lo + n} -> Type)
-> a_g:(i:nat{lo <= i /\ i <= lo + n} -> Type)
-> f:(i:nat{lo <= i /\ i < lo + n} -> a_f i -> a_f (i + 1))
-> g:(i:nat{lo <= i /\ i < lo + n} -> a_g i -> a_g (i + 1))
-> acc0:a_f lo ->
Lemma
(requires
... | false | null | true | if n = 0
then
(Loops.eq_repeat_right lo (lo + n) a_f f acc0;
Loops.eq_repeat_right lo (lo + n) a_g g acc0)
else
(Loops.unfold_repeat_right lo (lo + n) a_f f acc0 (lo + n - 1);
Loops.unfold_repeat_right lo (lo + n) a_g g acc0 (lo + n - 1);
repeat_right_extensionality (n - 1) lo a_f a_g f g acc0) | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Prims.op_LessThan",
"Prims.op_Equality",
"Prims.int",
"Lib.LoopCombinators.eq_repeat_right",
"Prims.unit",
"Prims.bool",
"Lib.Sequence.Lemmas.repeat_right_extensionality",
"Prims.op_Subtraction",
"Li... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val repeat_right_extensionality:
n:nat
-> lo:nat
-> a_f:(i:nat{lo <= i /\ i <= lo + n} -> Type)
-> a_g:(i:nat{lo <= i /\ i <= lo + n} -> Type)
-> f:(i:nat{lo <= i /\ i < lo + n} -> a_f i -> a_f (i + 1))
-> g:(i:nat{lo <= i /\ i < lo + n} -> a_g i -> a_g (i + 1))
-> acc0:a_f lo ->
Lemma
(requires
... | [
"recursion"
] | Lib.Sequence.Lemmas.repeat_right_extensionality | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
n: Prims.nat ->
lo: Prims.nat ->
a_f: (i: Prims.nat{lo <= i /\ i <= lo + n} -> Type) ->
a_g: (i: Prims.nat{lo <= i /\ i <= lo + n} -> Type) ->
f: (i: Prims.nat{lo <= i /\ i < lo + n} -> _: a_f i -> a_f (i + 1)) ->
g: (i: Prims.nat{lo <= i /\ i < lo + n} -> _: a_g i -> a_g (i + 1)) ->
acc0: ... | {
"end_col": 63,
"end_line": 29,
"start_col": 2,
"start_line": 23
} |
FStar.Pervasives.Lemma | val repeat_gen_blocks_extensionality_zero:
#inp_t:Type0
-> #c:Type0
-> blocksize:size_pos
-> mi:nat
-> hi_f:nat
-> hi_g:nat
-> n:nat{mi + n <= hi_f /\ n <= hi_g}
-> inp:seq inp_t{n == length inp / blocksize}
-> a_f:(i:nat{i <= hi_f} -> Type)
-> a_g:(i:nat{i <= hi_g} -> Type)
-> f:(i:nat{i < hi_f... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let repeat_gen_blocks_extensionality_zero #inp_t #c blocksize mi hi_f hi_g n inp a_f a_g f l_f g l_g acc0 =
let len = length inp in
let rem = len % blocksize in
Math.Lemmas.cancel_mul_div n blocksize;
Math.Lemmas.cancel_mul_mod n blocksize;
let blocks = Seq.slice inp 0 (n * blocksize) in
let block_l = Seq.s... | val repeat_gen_blocks_extensionality_zero:
#inp_t:Type0
-> #c:Type0
-> blocksize:size_pos
-> mi:nat
-> hi_f:nat
-> hi_g:nat
-> n:nat{mi + n <= hi_f /\ n <= hi_g}
-> inp:seq inp_t{n == length inp / blocksize}
-> a_f:(i:nat{i <= hi_f} -> Type)
-> a_g:(i:nat{i <= hi_g} -> Type)
-> f:(i:nat{i < hi_f... | false | null | true | let len = length inp in
let rem = len % blocksize in
Math.Lemmas.cancel_mul_div n blocksize;
Math.Lemmas.cancel_mul_mod n blocksize;
let blocks = Seq.slice inp 0 (n * blocksize) in
let block_l = Seq.slice inp (n * blocksize) len in
let acc_f = repeat_gen_blocks_multi blocksize mi hi_f n blocks a_f f acc0 in
let acc_g =... | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Lib.IntTypes.size_pos",
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Lib.Sequence.seq",
"Prims.eq2",
"Prims.int",
"Prims.op_Division",
"Lib.Sequence.length",
"Prims.op_LessThan",
"Lib.Sequence.lseq",
"FStar.Calc.calc_finish",
"Lib.Sequence.L... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val repeat_gen_blocks_extensionality_zero:
#inp_t:Type0
-> #c:Type0
-> blocksize:size_pos
-> mi:nat
-> hi_f:nat
-> hi_g:nat
-> n:nat{mi + n <= hi_f /\ n <= hi_g}
-> inp:seq inp_t{n == length inp / blocksize}
-> a_f:(i:nat{i <= hi_f} -> Type)
-> a_g:(i:nat{i <= hi_g} -> Type)
-> f:(i:nat{i < hi_f... | [] | Lib.Sequence.Lemmas.repeat_gen_blocks_extensionality_zero | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
mi: Prims.nat ->
hi_f: Prims.nat ->
hi_g: Prims.nat ->
n: Prims.nat{mi + n <= hi_f /\ n <= hi_g} ->
inp: Lib.Sequence.seq inp_t {n == Lib.Sequence.length inp / blocksize} ->
a_f: (i: Prims.nat{i <= hi_f} -> Type) ->
a_g: (i: Prims.nat{i <= hi_g} -> Ty... | {
"end_col": 5,
"end_line": 110,
"start_col": 107,
"start_line": 90
} |
FStar.Pervasives.Lemma | val map_blocks_is_empty:
#a:Type0
-> blocksize:size_pos
-> hi:nat
-> inp:seq a{length inp == 0}
-> f:(i:nat{i < hi} -> lseq a blocksize -> lseq a blocksize)
-> l:(i:nat{i <= hi} -> rem:nat{rem < blocksize} -> lseq a rem -> lseq a rem) ->
Lemma (map_blocks #a blocksize inp f l == Seq.empty) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let map_blocks_is_empty #a blocksize hi inp f l =
let len = length inp in
let nb = len / blocksize in
let rem = len % blocksize in
let blocks = Seq.slice inp 0 (nb * blocksize) in
assert (rem == 0);
calc (==) {
map_blocks blocksize inp f l;
(==) { lemma_map_blocks blocksize inp f l }
map_blocks... | val map_blocks_is_empty:
#a:Type0
-> blocksize:size_pos
-> hi:nat
-> inp:seq a{length inp == 0}
-> f:(i:nat{i < hi} -> lseq a blocksize -> lseq a blocksize)
-> l:(i:nat{i <= hi} -> rem:nat{rem < blocksize} -> lseq a rem -> lseq a rem) ->
Lemma (map_blocks #a blocksize inp f l == Seq.empty)
let map_block... | false | null | true | let len = length inp in
let nb = len / blocksize in
let rem = len % blocksize in
let blocks = Seq.slice inp 0 (nb * blocksize) in
assert (rem == 0);
calc ( == ) {
map_blocks blocksize inp f l;
( == ) { lemma_map_blocks blocksize inp f l }
map_blocks_multi #a blocksize nb nb blocks f;
( == ) { lemma_map_blocks_m... | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Lib.IntTypes.size_pos",
"Prims.nat",
"Lib.Sequence.seq",
"Prims.eq2",
"Prims.int",
"Lib.Sequence.length",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.Sequence.lseq",
"Prims.op_LessThanOrEqual",
"FStar.Calc.calc_finish",
"Lib.Sequence.map_blocks",
"FStar.Seq.Base.empty",
"Prims.Cons",
"FStar.... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val map_blocks_is_empty:
#a:Type0
-> blocksize:size_pos
-> hi:nat
-> inp:seq a{length inp == 0}
-> f:(i:nat{i < hi} -> lseq a blocksize -> lseq a blocksize)
-> l:(i:nat{i <= hi} -> rem:nat{rem < blocksize} -> lseq a rem -> lseq a rem) ->
Lemma (map_blocks #a blocksize inp f l == Seq.empty) | [] | Lib.Sequence.Lemmas.map_blocks_is_empty | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
hi: Prims.nat ->
inp: Lib.Sequence.seq a {Lib.Sequence.length inp == 0} ->
f: (i: Prims.nat{i < hi} -> _: Lib.Sequence.lseq a blocksize -> Lib.Sequence.lseq a blocksize) ->
l:
(i: Prims.nat{i <= hi} -> rem: Prims.nat{rem < blocksize} -> _: Lib.Sequence.lseq... | {
"end_col": 5,
"end_line": 801,
"start_col": 49,
"start_line": 786
} |
FStar.Pervasives.Lemma | val repeat_gen_blocks_split:
#inp_t:Type0
-> #c:Type0
-> blocksize:size_pos
-> len0:nat{len0 % blocksize == 0}
-> hi:nat
-> mi:nat{mi <= hi}
-> inp:seq inp_t{len0 <= length inp /\ mi + length inp / blocksize <= hi}
-> a:(i:nat{i <= hi} -> Type)
-> f:(i:nat{i < hi} -> lseq inp_t blocksize -> a i -> a... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let repeat_gen_blocks_split #inp_t #c blocksize len0 hi mi inp a f l acc0 =
let len = length inp in
let len1 = len - len0 in
let n = len / blocksize in
let n0 = len0 / blocksize in
let n1 = len1 / blocksize in
len0_le_len_fraction blocksize len len0;
split_len_lemma blocksize len len0;
split_len_lemma0 ... | val repeat_gen_blocks_split:
#inp_t:Type0
-> #c:Type0
-> blocksize:size_pos
-> len0:nat{len0 % blocksize == 0}
-> hi:nat
-> mi:nat{mi <= hi}
-> inp:seq inp_t{len0 <= length inp /\ mi + length inp / blocksize <= hi}
-> a:(i:nat{i <= hi} -> Type)
-> f:(i:nat{i < hi} -> lseq inp_t blocksize -> a i -> a... | false | null | true | let len = length inp in
let len1 = len - len0 in
let n = len / blocksize in
let n0 = len0 / blocksize in
let n1 = len1 / blocksize in
len0_le_len_fraction blocksize len len0;
split_len_lemma blocksize len len0;
split_len_lemma0 blocksize n len0;
let t0 = Seq.slice inp 0 len0 in
let t1 = Seq.slice inp len0 len in
let ac... | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Lib.IntTypes.size_pos",
"Prims.nat",
"Prims.eq2",
"Prims.int",
"Prims.op_Modulus",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Lib.Sequence.seq",
"Prims.l_and",
"Lib.Sequence.length",
"Prims.op_Addition",
"Prims.op_Division",
"Prims.op_LessThan",
"Lib.Sequence.lseq",
"FStar.Calc.calc_fini... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val repeat_gen_blocks_split:
#inp_t:Type0
-> #c:Type0
-> blocksize:size_pos
-> len0:nat{len0 % blocksize == 0}
-> hi:nat
-> mi:nat{mi <= hi}
-> inp:seq inp_t{len0 <= length inp /\ mi + length inp / blocksize <= hi}
-> a:(i:nat{i <= hi} -> Type)
-> f:(i:nat{i < hi} -> lseq inp_t blocksize -> a i -> a... | [] | Lib.Sequence.Lemmas.repeat_gen_blocks_split | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
len0: Prims.nat{len0 % blocksize == 0} ->
hi: Prims.nat ->
mi: Prims.nat{mi <= hi} ->
inp:
Lib.Sequence.seq inp_t
{len0 <= Lib.Sequence.length inp /\ mi + Lib.Sequence.length inp / blocksize <= hi} ->
a: (i: Prims.nat{i <= hi} -> Type) ->
f:... | {
"end_col": 5,
"end_line": 427,
"start_col": 75,
"start_line": 395
} |
FStar.Pervasives.Lemma | val map_blocks_multi_extensionality:
#a:Type0
-> blocksize:size_pos
-> max:nat
-> n:nat{n <= max}
-> inp:seq a{length inp == max * blocksize}
-> f:(i:nat{i < max} -> lseq a blocksize -> lseq a blocksize)
-> g:(i:nat{i < max} -> lseq a blocksize -> lseq a blocksize) ->
Lemma
(requires
(forall (i:... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let map_blocks_multi_extensionality #a blocksize max n inp f g =
let a_map = map_blocks_a a blocksize max in
let acc0 : a_map 0 = Seq.empty #a in
calc (==) {
map_blocks_multi blocksize max n inp f;
(==) { lemma_map_blocks_multi blocksize max n inp f }
Loops.repeat_gen n a_map (map_blocks_f #a blocksi... | val map_blocks_multi_extensionality:
#a:Type0
-> blocksize:size_pos
-> max:nat
-> n:nat{n <= max}
-> inp:seq a{length inp == max * blocksize}
-> f:(i:nat{i < max} -> lseq a blocksize -> lseq a blocksize)
-> g:(i:nat{i < max} -> lseq a blocksize -> lseq a blocksize) ->
Lemma
(requires
(forall (i:... | false | null | true | let a_map = map_blocks_a a blocksize max in
let acc0:a_map 0 = Seq.empty #a in
calc ( == ) {
map_blocks_multi blocksize max n inp f;
( == ) { lemma_map_blocks_multi blocksize max n inp f }
Loops.repeat_gen n a_map (map_blocks_f #a blocksize max inp f) acc0;
( == ) { Loops.repeat_gen_def n a_map (map_blocks_f #a... | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Lib.IntTypes.size_pos",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Lib.Sequence.seq",
"Prims.eq2",
"Prims.int",
"Lib.Sequence.length",
"FStar.Mul.op_Star",
"Prims.op_LessThan",
"Lib.Sequence.lseq",
"FStar.Calc.calc_finish",
"Lib.Sequence.map_blocks_multi",
"Prims.Cons",
"FSt... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val map_blocks_multi_extensionality:
#a:Type0
-> blocksize:size_pos
-> max:nat
-> n:nat{n <= max}
-> inp:seq a{length inp == max * blocksize}
-> f:(i:nat{i < max} -> lseq a blocksize -> lseq a blocksize)
-> g:(i:nat{i < max} -> lseq a blocksize -> lseq a blocksize) ->
Lemma
(requires
(forall (i:... | [] | Lib.Sequence.Lemmas.map_blocks_multi_extensionality | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
max: Prims.nat ->
n: Prims.nat{n <= max} ->
inp: Lib.Sequence.seq a {Lib.Sequence.length inp == max * blocksize} ->
f: (i: Prims.nat{i < max} -> _: Lib.Sequence.lseq a blocksize -> Lib.Sequence.lseq a blocksize) ->
g: (i: Prims.nat{i < max} -> _: Lib.Sequence... | {
"end_col": 5,
"end_line": 629,
"start_col": 64,
"start_line": 612
} |
FStar.Pervasives.Lemma | val repeat_blocks_multi_split:
#a:Type0
-> #b:Type0
-> blocksize:size_pos
-> len0:nat{len0 % blocksize = 0}
-> inp:seq a{len0 <= length inp /\ length inp % blocksize = 0}
-> f:(lseq a blocksize -> b -> b)
-> acc0:b ->
Lemma
(let len = length inp in
Math.Lemmas.lemma_div_exact len blocksize;
... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let repeat_blocks_multi_split #a #b blocksize len0 inp f acc0 =
let len = length inp in
let len1 = len - len0 in
let n = len / blocksize in
let n0 = len0 / blocksize in
let n1 = len1 / blocksize in
len0_le_len_fraction blocksize len len0;
split_len_lemma0 blocksize n len0;
let t0 = Seq.slice inp 0 len0... | val repeat_blocks_multi_split:
#a:Type0
-> #b:Type0
-> blocksize:size_pos
-> len0:nat{len0 % blocksize = 0}
-> inp:seq a{len0 <= length inp /\ length inp % blocksize = 0}
-> f:(lseq a blocksize -> b -> b)
-> acc0:b ->
Lemma
(let len = length inp in
Math.Lemmas.lemma_div_exact len blocksize;
... | false | null | true | let len = length inp in
let len1 = len - len0 in
let n = len / blocksize in
let n0 = len0 / blocksize in
let n1 = len1 / blocksize in
len0_le_len_fraction blocksize len len0;
split_len_lemma0 blocksize n len0;
let t0 = Seq.slice inp 0 len0 in
let t1 = Seq.slice inp len0 len in
let acc1 = repeat_gen_blocks_multi blocksi... | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Lib.IntTypes.size_pos",
"Prims.nat",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Lib.Sequence.seq",
"Prims.l_and",
"Prims.op_LessThanOrEqual",
"Lib.Sequence.length",
"Lib.Sequence.lseq",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Lib.Sequence.repeat_blocks_multi",
"... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val repeat_blocks_multi_split:
#a:Type0
-> #b:Type0
-> blocksize:size_pos
-> len0:nat{len0 % blocksize = 0}
-> inp:seq a{len0 <= length inp /\ length inp % blocksize = 0}
-> f:(lseq a blocksize -> b -> b)
-> acc0:b ->
Lemma
(let len = length inp in
Math.Lemmas.lemma_div_exact len blocksize;
... | [] | Lib.Sequence.Lemmas.repeat_blocks_multi_split | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
len0: Prims.nat{len0 % blocksize = 0} ->
inp:
Lib.Sequence.seq a
{len0 <= Lib.Sequence.length inp /\ Lib.Sequence.length inp % blocksize = 0} ->
f: (_: Lib.Sequence.lseq a blocksize -> _: b -> b) ->
acc0: b
-> FStar.Pervasives.Lemma
(ensures
... | {
"end_col": 5,
"end_line": 551,
"start_col": 63,
"start_line": 518
} |
FStar.Pervasives.Lemma | val repeat_blocks_split:
#a:Type0
-> #b:Type0
-> #c:Type0
-> blocksize:size_pos
-> len0:nat{len0 % blocksize = 0}
-> inp:seq a{len0 <= length inp}
-> f:(lseq a blocksize -> b -> b)
-> l:(len:nat{len < blocksize} -> s:lseq a len -> b -> c)
-> acc0:b ->
Lemma
(let len = length inp in
split_l... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let repeat_blocks_split #a #b #c blocksize len0 inp f l acc0 =
let len = length inp in
let len1 = len - len0 in
let n = len / blocksize in
let n0 = len0 / blocksize in
let n1 = len1 / blocksize in
len0_le_len_fraction blocksize len len0;
split_len_lemma blocksize len len0;
let t0 = Seq.slice inp 0 len0... | val repeat_blocks_split:
#a:Type0
-> #b:Type0
-> #c:Type0
-> blocksize:size_pos
-> len0:nat{len0 % blocksize = 0}
-> inp:seq a{len0 <= length inp}
-> f:(lseq a blocksize -> b -> b)
-> l:(len:nat{len < blocksize} -> s:lseq a len -> b -> c)
-> acc0:b ->
Lemma
(let len = length inp in
split_l... | false | null | true | let len = length inp in
let len1 = len - len0 in
let n = len / blocksize in
let n0 = len0 / blocksize in
let n1 = len1 / blocksize in
len0_le_len_fraction blocksize len len0;
split_len_lemma blocksize len len0;
let t0 = Seq.slice inp 0 len0 in
let t1 = Seq.slice inp len0 len in
let acc1 = repeat_gen_blocks_multi blocks... | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Lib.IntTypes.size_pos",
"Prims.nat",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Lib.Sequence.seq",
"Prims.op_LessThanOrEqual",
"Lib.Sequence.length",
"Lib.Sequence.lseq",
"Prims.op_LessThan",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Lib.Sequence.repeat_blocks",
"... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val repeat_blocks_split:
#a:Type0
-> #b:Type0
-> #c:Type0
-> blocksize:size_pos
-> len0:nat{len0 % blocksize = 0}
-> inp:seq a{len0 <= length inp}
-> f:(lseq a blocksize -> b -> b)
-> l:(len:nat{len < blocksize} -> s:lseq a len -> b -> c)
-> acc0:b ->
Lemma
(let len = length inp in
split_l... | [] | Lib.Sequence.Lemmas.repeat_blocks_split | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
len0: Prims.nat{len0 % blocksize = 0} ->
inp: Lib.Sequence.seq a {len0 <= Lib.Sequence.length inp} ->
f: (_: Lib.Sequence.lseq a blocksize -> _: b -> b) ->
l: (len: Prims.nat{len < blocksize} -> s: Lib.Sequence.lseq a len -> _: b -> c) ->
acc0: b
-> FStar.P... | {
"end_col": 5,
"end_line": 589,
"start_col": 62,
"start_line": 554
} |
FStar.Pervasives.Lemma | val repeat_gen_blocks_multi_split:
#inp_t:Type0
-> blocksize:size_pos
-> len0:nat{len0 % blocksize == 0}
-> mi:nat
-> hi:nat
-> n:nat{mi + n <= hi}
-> inp:seq inp_t{len0 <= length inp /\ length inp == n * blocksize}
-> a:(i:nat{i <= hi} -> Type)
-> f:(i:nat{i < hi} -> lseq inp_t blocksize -> a i -> ... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let repeat_gen_blocks_multi_split #inp_t blocksize len0 mi hi n inp a f acc0 =
let len = length inp in
let len1 = len - len0 in
let n0 = len0 / blocksize in
let n1 = len1 / blocksize in
split_len_lemma0 blocksize n len0;
let t0 = Seq.slice inp 0 len0 in
let t1 = Seq.slice inp len0 len in
let repeat_bf... | val repeat_gen_blocks_multi_split:
#inp_t:Type0
-> blocksize:size_pos
-> len0:nat{len0 % blocksize == 0}
-> mi:nat
-> hi:nat
-> n:nat{mi + n <= hi}
-> inp:seq inp_t{len0 <= length inp /\ length inp == n * blocksize}
-> a:(i:nat{i <= hi} -> Type)
-> f:(i:nat{i < hi} -> lseq inp_t blocksize -> a i -> ... | false | null | true | let len = length inp in
let len1 = len - len0 in
let n0 = len0 / blocksize in
let n1 = len1 / blocksize in
split_len_lemma0 blocksize n len0;
let t0 = Seq.slice inp 0 len0 in
let t1 = Seq.slice inp len0 len in
let repeat_bf_s0 = repeat_gen_blocks_f blocksize mi hi n0 t0 a f in
let repeat_bf_s1 = repeat_gen_blocks_f blo... | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Lib.IntTypes.size_pos",
"Prims.nat",
"Prims.eq2",
"Prims.int",
"Prims.op_Modulus",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Lib.Sequence.seq",
"Prims.l_and",
"Lib.Sequence.length",
"FStar.Mul.op_Star",
"Prims.op_LessThan",
"Lib.Sequence.lseq",
"FStar.Calc.calc_fini... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val repeat_gen_blocks_multi_split:
#inp_t:Type0
-> blocksize:size_pos
-> len0:nat{len0 % blocksize == 0}
-> mi:nat
-> hi:nat
-> n:nat{mi + n <= hi}
-> inp:seq inp_t{len0 <= length inp /\ length inp == n * blocksize}
-> a:(i:nat{i <= hi} -> Type)
-> f:(i:nat{i < hi} -> lseq inp_t blocksize -> a i -> ... | [] | Lib.Sequence.Lemmas.repeat_gen_blocks_multi_split | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
len0: Prims.nat{len0 % blocksize == 0} ->
mi: Prims.nat ->
hi: Prims.nat ->
n: Prims.nat{mi + n <= hi} ->
inp:
Lib.Sequence.seq inp_t
{len0 <= Lib.Sequence.length inp /\ Lib.Sequence.length inp == n * blocksize} ->
a: (i: Prims.nat{i <= hi} ... | {
"end_col": 3,
"end_line": 307,
"start_col": 78,
"start_line": 270
} |
FStar.Pervasives.Lemma | val map_blocks_multi_acc_is_map_blocks_multi_:
#a:Type0
-> blocksize:size_pos
-> mi:nat
-> hi_f:nat
-> hi_g:nat
-> n:nat{mi + hi_g <= hi_f /\ n <= hi_g}
-> inp:seq a{length inp == hi_g * blocksize}
-> f:(i:nat{i < hi_f} -> lseq a blocksize -> lseq a blocksize)
-> acc0:map_blocks_a a blocksize hi_f m... | [
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "Lib.Loo... | false | let rec map_blocks_multi_acc_is_map_blocks_multi_ #a blocksize mi hi_f hi_g n inp f acc0 =
let a_f = map_blocks_a a blocksize hi_f in
let a_g = map_blocks_a a blocksize hi_g in
let f_gen_map = repeat_gen_blocks_map_f blocksize hi_f f in
let f_gen = repeat_gen_blocks_f blocksize mi hi_f hi_g inp a_f f_gen_map in... | val map_blocks_multi_acc_is_map_blocks_multi_:
#a:Type0
-> blocksize:size_pos
-> mi:nat
-> hi_f:nat
-> hi_g:nat
-> n:nat{mi + hi_g <= hi_f /\ n <= hi_g}
-> inp:seq a{length inp == hi_g * blocksize}
-> f:(i:nat{i < hi_f} -> lseq a blocksize -> lseq a blocksize)
-> acc0:map_blocks_a a blocksize hi_f m... | false | null | true | let a_f = map_blocks_a a blocksize hi_f in
let a_g = map_blocks_a a blocksize hi_g in
let f_gen_map = repeat_gen_blocks_map_f blocksize hi_f f in
let f_gen = repeat_gen_blocks_f blocksize mi hi_f hi_g inp a_f f_gen_map in
let f_sh = f_shift blocksize mi hi_f hi_g f in
let f_map = map_blocks_f #a blocksize hi_g inp f_sh... | {
"checked_file": "Lib.Sequence.Lemmas.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.M... | [
"lemma"
] | [
"Lib.IntTypes.size_pos",
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Lib.Sequence.seq",
"Prims.eq2",
"Prims.int",
"Lib.Sequence.length",
"FStar.Mul.op_Star",
"Prims.op_LessThan",
"Lib.Sequence.lseq",
"Lib.Sequence.map_blocks_a",
"Prims.op_Eq... | [] | module Lib.Sequence.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0 \
--using_facts_from '-* +Prims +FStar.Pervasives +FStar.Math.Lemmas +FStar.Seq \
+Lib.IntTypes +Lib.Sequence +Lib.Sequence.Lemmas +Lib.LoopCombinators'"
let rec repeati_extensi... | false | false | Lib.Sequence.Lemmas.fst | {
"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_el... | null | val map_blocks_multi_acc_is_map_blocks_multi_:
#a:Type0
-> blocksize:size_pos
-> mi:nat
-> hi_f:nat
-> hi_g:nat
-> n:nat{mi + hi_g <= hi_f /\ n <= hi_g}
-> inp:seq a{length inp == hi_g * blocksize}
-> f:(i:nat{i < hi_f} -> lseq a blocksize -> lseq a blocksize)
-> acc0:map_blocks_a a blocksize hi_f m... | [
"recursion"
] | Lib.Sequence.Lemmas.map_blocks_multi_acc_is_map_blocks_multi_ | {
"file_name": "lib/Lib.Sequence.Lemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
blocksize: Lib.IntTypes.size_pos ->
mi: Prims.nat ->
hi_f: Prims.nat ->
hi_g: Prims.nat ->
n: Prims.nat{mi + hi_g <= hi_f /\ n <= hi_g} ->
inp: Lib.Sequence.seq a {Lib.Sequence.length inp == hi_g * blocksize} ->
f: (i: Prims.nat{i < hi_f} -> _: Lib.Sequence.lseq a blocksize -> Lib.Sequence.... | {
"end_col": 11,
"end_line": 716,
"start_col": 90,
"start_line": 685
} |
Prims.GTot | val serialize32_bounded_vlgen_precond (min: nat) (max: nat{min <= max}) (sk k: parser_kind)
: GTot bool | [
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.VLGen",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let serialize32_bounded_vlgen_precond
(min: nat)
(max: nat { min <= max } )
(sk: parser_kind)
(k: parser_kind)
: GTot bool
= match sk.parser_kind_high with
| None -> false
| Some kmax ->
let max' = match k.parser_kind_high with
| None -> max
| Some km -> if km < max then km else max
in
... | val serialize32_bounded_vlgen_precond (min: nat) (max: nat{min <= max}) (sk k: parser_kind)
: GTot bool
let serialize32_bounded_vlgen_precond (min: nat) (max: nat{min <= max}) (sk k: parser_kind)
: GTot bool = | false | null | false | match sk.parser_kind_high with
| None -> false
| Some kmax ->
let max' =
match k.parser_kind_high with
| None -> max
| Some km -> if km < max then km else max
in
kmax + max' < 4294967296 | {
"checked_file": "LowParse.SLow.VLGen.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.VLGen.fst.checked",
"LowParse.SLow.FLData.fst.checked",
"LowParse.SLow.Combinators.fst.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Nativ... | [
"sometrivial"
] | [
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_high",
"Prims.op_LessThan",
"Prims.op_Addition",
"Prims.int",
"Prims.bool"
] | [] | module LowParse.SLow.VLGen
include LowParse.SLow.Combinators
include LowParse.SLow.FLData
include LowParse.Spec.VLGen
module U32 = FStar.UInt32
module B32 = LowParse.Bytes32
inline_for_extraction
let parse32_bounded_vlgen
(vmin: der_length_t)
(min: U32.t { U32.v min == vmin } )
(vmax: der_length_t)
(max: U32.... | false | false | LowParse.SLow.VLGen.fst | {
"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_el... | null | val serialize32_bounded_vlgen_precond (min: nat) (max: nat{min <= max}) (sk k: parser_kind)
: GTot bool | [] | LowParse.SLow.VLGen.serialize32_bounded_vlgen_precond | {
"file_name": "src/lowparse/LowParse.SLow.VLGen.fst",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} |
min: Prims.nat ->
max: Prims.nat{min <= max} ->
sk: LowParse.Spec.Base.parser_kind ->
k: LowParse.Spec.Base.parser_kind
-> Prims.GTot Prims.bool | {
"end_col": 28,
"end_line": 70,
"start_col": 2,
"start_line": 63
} |
Prims.Tot | val serialize32_vlgen
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#sk: parser_kind)
(#pk: parser sk (bounded_int32 min max))
(#ssk: serializer pk)
(ssk32: serializer32 ssk {sk.parser_kind_subkind == Some ParserStrong})
(#k: parser_kind)
(#t: Type)
(#p: pa... | [
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.VLGen",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let serialize32_vlgen
(min: nat)
(max: nat { min <= max /\ max < 4294967296 } )
(#sk: parser_kind)
(#pk: parser sk (bounded_int32 min max))
(#ssk: serializer pk)
(ssk32: serializer32 ssk { sk.parser_kind_subkind == Some ParserStrong } )
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(#s: serializer p... | val serialize32_vlgen
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#sk: parser_kind)
(#pk: parser sk (bounded_int32 min max))
(#ssk: serializer pk)
(ssk32: serializer32 ssk {sk.parser_kind_subkind == Some ParserStrong})
(#k: parser_kind)
(#t: Type)
(#p: pa... | false | null | false | serialize32_synth' _
(synth_vlgen min max s)
_
(serialize32_bounded_vlgen min max ssk32 s32)
(synth_vlgen_recip min max s)
() | {
"checked_file": "LowParse.SLow.VLGen.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.VLGen.fst.checked",
"LowParse.SLow.FLData.fst.checked",
"LowParse.SLow.Combinators.fst.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Nativ... | [
"total"
] | [
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_LessThan",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.BoundedInt.bounded_int32",
"LowParse.Spec.Base.serializer",
"LowParse.SLow.Base.serializer32",
"Prims.eq2",
"FStar.Pervasives.... | [] | module LowParse.SLow.VLGen
include LowParse.SLow.Combinators
include LowParse.SLow.FLData
include LowParse.Spec.VLGen
module U32 = FStar.UInt32
module B32 = LowParse.Bytes32
inline_for_extraction
let parse32_bounded_vlgen
(vmin: der_length_t)
(min: U32.t { U32.v min == vmin } )
(vmax: der_length_t)
(max: U32.... | false | false | LowParse.SLow.VLGen.fst | {
"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_el... | null | val serialize32_vlgen
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#sk: parser_kind)
(#pk: parser sk (bounded_int32 min max))
(#ssk: serializer pk)
(ssk32: serializer32 ssk {sk.parser_kind_subkind == Some ParserStrong})
(#k: parser_kind)
(#t: Type)
(#p: pa... | [] | LowParse.SLow.VLGen.serialize32_vlgen | {
"file_name": "src/lowparse/LowParse.SLow.VLGen.fst",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} |
min: Prims.nat ->
max: Prims.nat{min <= max /\ max < 4294967296} ->
ssk32:
LowParse.SLow.Base.serializer32 ssk
{ Mkparser_kind'?.parser_kind_subkind sk ==
FStar.Pervasives.Native.Some LowParse.Spec.Base.ParserStrong } ->
s32:
LowParse.SLow.Base.partial_serializer32 s
... | {
"end_col": 6,
"end_line": 114,
"start_col": 2,
"start_line": 108
} |
Prims.Tot | val size32_vlgen
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#sk: parser_kind)
(#pk: parser sk (bounded_int32 min max))
(#ssk: serializer pk)
(ssk32: size32 ssk {sk.parser_kind_subkind == Some ParserStrong})
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
... | [
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.VLGen",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let size32_vlgen
(min: nat)
(max: nat { min <= max /\ max < 4294967296 } )
(#sk: parser_kind)
(#pk: parser sk (bounded_int32 min max))
(#ssk: serializer pk)
(ssk32: size32 ssk { sk.parser_kind_subkind == Some ParserStrong } )
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(#s: serializer p)
(s32: s... | val size32_vlgen
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#sk: parser_kind)
(#pk: parser sk (bounded_int32 min max))
(#ssk: serializer pk)
(ssk32: size32 ssk {sk.parser_kind_subkind == Some ParserStrong})
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
... | false | null | false | size32_synth' _
(synth_vlgen min max s)
_
(size32_bounded_vlgen min max ssk32 s32)
(synth_vlgen_recip min max s)
() | {
"checked_file": "LowParse.SLow.VLGen.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.VLGen.fst.checked",
"LowParse.SLow.FLData.fst.checked",
"LowParse.SLow.Combinators.fst.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Nativ... | [
"total"
] | [
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_LessThan",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.BoundedInt.bounded_int32",
"LowParse.Spec.Base.serializer",
"LowParse.SLow.Base.size32",
"Prims.eq2",
"FStar.Pervasives.Native... | [] | module LowParse.SLow.VLGen
include LowParse.SLow.Combinators
include LowParse.SLow.FLData
include LowParse.Spec.VLGen
module U32 = FStar.UInt32
module B32 = LowParse.Bytes32
inline_for_extraction
let parse32_bounded_vlgen
(vmin: der_length_t)
(min: U32.t { U32.v min == vmin } )
(vmax: der_length_t)
(max: U32.... | false | false | LowParse.SLow.VLGen.fst | {
"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_el... | null | val size32_vlgen
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#sk: parser_kind)
(#pk: parser sk (bounded_int32 min max))
(#ssk: serializer pk)
(ssk32: size32 ssk {sk.parser_kind_subkind == Some ParserStrong})
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
... | [] | LowParse.SLow.VLGen.size32_vlgen | {
"file_name": "src/lowparse/LowParse.SLow.VLGen.fst",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} |
min: Prims.nat ->
max: Prims.nat{min <= max /\ max < 4294967296} ->
ssk32:
LowParse.SLow.Base.size32 ssk
{ Mkparser_kind'?.parser_kind_subkind sk ==
FStar.Pervasives.Native.Some LowParse.Spec.Base.ParserStrong } ->
s32:
LowParse.SLow.Base.size32 s
{ LowParse.Spec.V... | {
"end_col": 6,
"end_line": 157,
"start_col": 2,
"start_line": 151
} |
Prims.Tot | val serialize32_bounded_vlgen
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#sk: parser_kind)
(#pk: parser sk (bounded_int32 min max))
(#ssk: serializer pk)
(ssk32: serializer32 ssk {sk.parser_kind_subkind == Some ParserStrong})
(#k: parser_kind)
(#t: Type)
... | [
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.VLGen",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let serialize32_bounded_vlgen
(min: nat)
(max: nat { min <= max /\ max < 4294967296 } )
(#sk: parser_kind)
(#pk: parser sk (bounded_int32 min max))
(#ssk: serializer pk)
(ssk32: serializer32 ssk { sk.parser_kind_subkind == Some ParserStrong } )
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(#s: seri... | val serialize32_bounded_vlgen
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#sk: parser_kind)
(#pk: parser sk (bounded_int32 min max))
(#ssk: serializer pk)
(ssk32: serializer32 ssk {sk.parser_kind_subkind == Some ParserStrong})
(#k: parser_kind)
(#t: Type)
... | false | null | false | fun (input: parse_bounded_vldata_strong_t min max s) ->
(([@@ inline_let ]let _ = serialize_bounded_vlgen_unfold min max ssk s input in
let sp = s32 input in
let len = B32.len sp in
(ssk32 len) `B32.append` sp)
<:
(res: _{serializer32_correct (serialize_bounded_vlgen min max ssk s) input res... | {
"checked_file": "LowParse.SLow.VLGen.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.VLGen.fst.checked",
"LowParse.SLow.FLData.fst.checked",
"LowParse.SLow.Combinators.fst.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Nativ... | [
"total"
] | [
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_LessThan",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.BoundedInt.bounded_int32",
"LowParse.Spec.Base.serializer",
"LowParse.SLow.Base.serializer32",
"Prims.eq2",
"FStar.Pervasives.... | [] | module LowParse.SLow.VLGen
include LowParse.SLow.Combinators
include LowParse.SLow.FLData
include LowParse.Spec.VLGen
module U32 = FStar.UInt32
module B32 = LowParse.Bytes32
inline_for_extraction
let parse32_bounded_vlgen
(vmin: der_length_t)
(min: U32.t { U32.v min == vmin } )
(vmax: der_length_t)
(max: U32.... | false | false | LowParse.SLow.VLGen.fst | {
"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_el... | null | val serialize32_bounded_vlgen
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#sk: parser_kind)
(#pk: parser sk (bounded_int32 min max))
(#ssk: serializer pk)
(ssk32: serializer32 ssk {sk.parser_kind_subkind == Some ParserStrong})
(#k: parser_kind)
(#t: Type)
... | [] | LowParse.SLow.VLGen.serialize32_bounded_vlgen | {
"file_name": "src/lowparse/LowParse.SLow.VLGen.fst",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} |
min: Prims.nat ->
max: Prims.nat{min <= max /\ max < 4294967296} ->
ssk32:
LowParse.SLow.Base.serializer32 ssk
{ Mkparser_kind'?.parser_kind_subkind sk ==
FStar.Pervasives.Native.Some LowParse.Spec.Base.ParserStrong } ->
s32:
LowParse.SLow.Base.partial_serializer32 s
... | {
"end_col": 92,
"end_line": 92,
"start_col": 2,
"start_line": 86
} |
Prims.Tot | val parse32_vlgen
(vmin: nat)
(min: U32.t{U32.v min == vmin})
(vmax: nat)
(max: U32.t{U32.v max == vmax /\ U32.v min <= U32.v max})
(#sk: parser_kind)
(#pk: parser sk (bounded_int32 (U32.v min) (U32.v max)))
(pk32: parser32 pk)
(#k: parser_kind)
(#t: Type)
(#p... | [
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.VLGen",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let parse32_vlgen
(vmin: nat)
(min: U32.t { U32.v min == vmin } )
(vmax: nat)
(max: U32.t { U32.v max == vmax /\ U32.v min <= U32.v max } )
(#sk: parser_kind)
(#pk: parser sk (bounded_int32 (U32.v min) (U32.v max)))
(pk32: parser32 pk)
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p... | val parse32_vlgen
(vmin: nat)
(min: U32.t{U32.v min == vmin})
(vmax: nat)
(max: U32.t{U32.v max == vmax /\ U32.v min <= U32.v max})
(#sk: parser_kind)
(#pk: parser sk (bounded_int32 (U32.v min) (U32.v max)))
(pk32: parser32 pk)
(#k: parser_kind)
(#t: Type)
(#p... | false | null | false | parse32_synth' _
(synth_vlgen (U32.v min) (U32.v max) s)
(parse32_bounded_vlgen vmin min vmax max pk32 s p32)
() | {
"checked_file": "LowParse.SLow.VLGen.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.VLGen.fst.checked",
"LowParse.SLow.FLData.fst.checked",
"LowParse.SLow.Combinators.fst.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Nativ... | [
"total"
] | [
"Prims.nat",
"FStar.UInt32.t",
"Prims.eq2",
"Prims.int",
"Prims.l_or",
"FStar.UInt.size",
"FStar.UInt32.n",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"FStar.UInt32.v",
"Prims.l_and",
"Prims.op_LessThanOrEqual",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Sp... | [] | module LowParse.SLow.VLGen
include LowParse.SLow.Combinators
include LowParse.SLow.FLData
include LowParse.Spec.VLGen
module U32 = FStar.UInt32
module B32 = LowParse.Bytes32
inline_for_extraction
let parse32_bounded_vlgen
(vmin: der_length_t)
(min: U32.t { U32.v min == vmin } )
(vmax: der_length_t)
(max: U32.... | false | false | LowParse.SLow.VLGen.fst | {
"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_el... | null | val parse32_vlgen
(vmin: nat)
(min: U32.t{U32.v min == vmin})
(vmax: nat)
(max: U32.t{U32.v max == vmax /\ U32.v min <= U32.v max})
(#sk: parser_kind)
(#pk: parser sk (bounded_int32 (U32.v min) (U32.v max)))
(pk32: parser32 pk)
(#k: parser_kind)
(#t: Type)
(#p... | [] | LowParse.SLow.VLGen.parse32_vlgen | {
"file_name": "src/lowparse/LowParse.SLow.VLGen.fst",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} |
vmin: Prims.nat ->
min: FStar.UInt32.t{FStar.UInt32.v min == vmin} ->
vmax: Prims.nat ->
max: FStar.UInt32.t{FStar.UInt32.v max == vmax /\ FStar.UInt32.v min <= FStar.UInt32.v max} ->
pk32: LowParse.SLow.Base.parser32 pk ->
s:
LowParse.Spec.Base.serializer p
{LowParse.Spec.VLGen.p... | {
"end_col": 6,
"end_line": 55,
"start_col": 2,
"start_line": 51
} |
Prims.Tot | val size32_bounded_vlgen
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#sk: parser_kind)
(#pk: parser sk (bounded_int32 min max))
(#ssk: serializer pk)
(ssk32: size32 ssk {sk.parser_kind_subkind == Some ParserStrong})
(#k: parser_kind)
(#t: Type)
(#p: parse... | [
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.VLGen",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let size32_bounded_vlgen
(min: nat)
(max: nat { min <= max /\ max < 4294967296 } )
(#sk: parser_kind)
(#pk: parser sk (bounded_int32 min max))
(#ssk: serializer pk)
(ssk32: size32 ssk { sk.parser_kind_subkind == Some ParserStrong } )
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(#s: serializer p)
... | val size32_bounded_vlgen
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#sk: parser_kind)
(#pk: parser sk (bounded_int32 min max))
(#ssk: serializer pk)
(ssk32: size32 ssk {sk.parser_kind_subkind == Some ParserStrong})
(#k: parser_kind)
(#t: Type)
(#p: parse... | false | null | false | fun (input: parse_bounded_vldata_strong_t min max s) ->
(([@@ inline_let ]let _ = serialize_bounded_vlgen_unfold min max ssk s input in
let sp = s32 input in
(ssk32 sp) `U32.add` sp)
<:
(res: _{size32_postcond (serialize_bounded_vlgen min max ssk s) input res})) | {
"checked_file": "LowParse.SLow.VLGen.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.VLGen.fst.checked",
"LowParse.SLow.FLData.fst.checked",
"LowParse.SLow.Combinators.fst.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Nativ... | [
"total"
] | [
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_LessThan",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.BoundedInt.bounded_int32",
"LowParse.Spec.Base.serializer",
"LowParse.SLow.Base.size32",
"Prims.eq2",
"FStar.Pervasives.Native... | [] | module LowParse.SLow.VLGen
include LowParse.SLow.Combinators
include LowParse.SLow.FLData
include LowParse.Spec.VLGen
module U32 = FStar.UInt32
module B32 = LowParse.Bytes32
inline_for_extraction
let parse32_bounded_vlgen
(vmin: der_length_t)
(min: U32.t { U32.v min == vmin } )
(vmax: der_length_t)
(max: U32.... | false | false | LowParse.SLow.VLGen.fst | {
"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_el... | null | val size32_bounded_vlgen
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#sk: parser_kind)
(#pk: parser sk (bounded_int32 min max))
(#ssk: serializer pk)
(ssk32: size32 ssk {sk.parser_kind_subkind == Some ParserStrong})
(#k: parser_kind)
(#t: Type)
(#p: parse... | [] | LowParse.SLow.VLGen.size32_bounded_vlgen | {
"file_name": "src/lowparse/LowParse.SLow.VLGen.fst",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} |
min: Prims.nat ->
max: Prims.nat{min <= max /\ max < 4294967296} ->
ssk32:
LowParse.SLow.Base.size32 ssk
{ Mkparser_kind'?.parser_kind_subkind sk ==
FStar.Pervasives.Native.Some LowParse.Spec.Base.ParserStrong } ->
s32:
LowParse.SLow.Base.size32 s
{LowParse.SLow.VL... | {
"end_col": 87,
"end_line": 135,
"start_col": 2,
"start_line": 130
} |
Prims.Tot | val parse32_bounded_vlgen
(vmin: der_length_t)
(min: U32.t{U32.v min == vmin})
(vmax: der_length_t)
(max: U32.t{U32.v max == vmax /\ U32.v min <= U32.v max})
(#sk: parser_kind)
(#pk: parser sk (bounded_int32 (U32.v min) (U32.v max)))
(pk32: parser32 pk)
(#k: parser_kind)
... | [
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.VLGen",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let parse32_bounded_vlgen
(vmin: der_length_t)
(min: U32.t { U32.v min == vmin } )
(vmax: der_length_t)
(max: U32.t { U32.v max == vmax /\ U32.v min <= U32.v max } )
(#sk: parser_kind)
(#pk: parser sk (bounded_int32 (U32.v min) (U32.v max)))
(pk32: parser32 pk)
(#k: parser_kind)
(#t: Type)
(#p: pars... | val parse32_bounded_vlgen
(vmin: der_length_t)
(min: U32.t{U32.v min == vmin})
(vmax: der_length_t)
(max: U32.t{U32.v max == vmax /\ U32.v min <= U32.v max})
(#sk: parser_kind)
(#pk: parser sk (bounded_int32 (U32.v min) (U32.v max)))
(pk32: parser32 pk)
(#k: parser_kind)
... | false | null | false | fun (input: bytes32) ->
(([@@ inline_let ]let _ =
parse_bounded_vlgen_unfold_aux (U32.v min) (U32.v max) pk s (B32.reveal input)
in
match pk32 input with
| None -> None
| Some (sz, consumed) ->
let input' = B32.slice input consumed (B32.len input) in
match parse32_fldat... | {
"checked_file": "LowParse.SLow.VLGen.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.VLGen.fst.checked",
"LowParse.SLow.FLData.fst.checked",
"LowParse.SLow.Combinators.fst.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Nativ... | [
"total"
] | [
"LowParse.Spec.DER.der_length_t",
"FStar.UInt32.t",
"Prims.eq2",
"Prims.int",
"Prims.l_or",
"FStar.UInt.size",
"FStar.UInt32.n",
"Prims.l_and",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"Prims.op_LessThanOrEqual",
"LowParse.Spec.DER.der_length_max",
"FStar.UInt32.v",
"LowParse.Spec.Base.... | [] | module LowParse.SLow.VLGen
include LowParse.SLow.Combinators
include LowParse.SLow.FLData
include LowParse.Spec.VLGen
module U32 = FStar.UInt32
module B32 = LowParse.Bytes32
inline_for_extraction
let parse32_bounded_vlgen
(vmin: der_length_t)
(min: U32.t { U32.v min == vmin } )
(vmax: der_length_t)
(max: U32.... | false | false | LowParse.SLow.VLGen.fst | {
"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_el... | null | val parse32_bounded_vlgen
(vmin: der_length_t)
(min: U32.t{U32.v min == vmin})
(vmax: der_length_t)
(max: U32.t{U32.v max == vmax /\ U32.v min <= U32.v max})
(#sk: parser_kind)
(#pk: parser sk (bounded_int32 (U32.v min) (U32.v max)))
(pk32: parser32 pk)
(#k: parser_kind)
... | [] | LowParse.SLow.VLGen.parse32_bounded_vlgen | {
"file_name": "src/lowparse/LowParse.SLow.VLGen.fst",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} |
vmin: LowParse.Spec.DER.der_length_t ->
min: FStar.UInt32.t{FStar.UInt32.v min == vmin} ->
vmax: LowParse.Spec.DER.der_length_t ->
max: FStar.UInt32.t{FStar.UInt32.v max == vmax /\ FStar.UInt32.v min <= FStar.UInt32.v max} ->
pk32: LowParse.SLow.Base.parser32 pk ->
s: LowParse.Spec.Base.seriali... | {
"end_col": 99,
"end_line": 34,
"start_col": 2,
"start_line": 24
} |
Prims.Tot | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Va... | false | let poly128 = p:poly{degree p < 128} | let poly128 = | false | null | false | p: poly{degree p < 128} | {
"checked_file": "Vale.AES.GHash.fsti.checked",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.Bits.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.... | [
"total"
] | [
"Vale.Math.Poly2_s.poly",
"Prims.b2t",
"Prims.op_LessThan",
"Vale.Math.Poly2_s.degree"
] | [] | module Vale.AES.GHash
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GHash_s
open Vale.AES.GF128_s
open Vale.AES.GCTR_s
open Vale.AES.GCM_helpers
open Vale.Lib.Seqs_s
open Vale.Lib.Seqs
open FStar.Seq
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly... | false | true | Vale.AES.GHash.fsti | {
"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_el... | null | val poly128 : Type0 | [] | Vale.AES.GHash.poly128 | {
"file_name": "vale/code/crypto/aes/Vale.AES.GHash.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Type0 | {
"end_col": 36,
"end_line": 25,
"start_col": 14,
"start_line": 25
} | |
Prims.Tot | val ghash_incremental0 (h y_prev: quad32) (x: seq quad32) : quad32 | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"fu... | false | let ghash_incremental0 (h:quad32) (y_prev:quad32) (x:seq quad32) : quad32 =
if length x > 0 then ghash_incremental h y_prev x else y_prev | val ghash_incremental0 (h y_prev: quad32) (x: seq quad32) : quad32
let ghash_incremental0 (h y_prev: quad32) (x: seq quad32) : quad32 = | false | null | false | if length x > 0 then ghash_incremental h y_prev x else y_prev | {
"checked_file": "Vale.AES.GHash.fsti.checked",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.Bits.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.... | [
"total"
] | [
"Vale.Def.Types_s.quad32",
"FStar.Seq.Base.seq",
"Prims.op_GreaterThan",
"FStar.Seq.Base.length",
"Vale.AES.GHash.ghash_incremental",
"Prims.bool"
] | [] | module Vale.AES.GHash
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GHash_s
open Vale.AES.GF128_s
open Vale.AES.GCTR_s
open Vale.AES.GCM_helpers
open Vale.Lib.Seqs_s
open Vale.Lib.Seqs
open FStar.Seq
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly... | false | true | Vale.AES.GHash.fsti | {
"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_el... | null | val ghash_incremental0 (h y_prev: quad32) (x: seq quad32) : quad32 | [] | Vale.AES.GHash.ghash_incremental0 | {
"file_name": "vale/code/crypto/aes/Vale.AES.GHash.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
h: Vale.Def.Types_s.quad32 ->
y_prev: Vale.Def.Types_s.quad32 ->
x: FStar.Seq.Base.seq Vale.Def.Types_s.quad32
-> Vale.Def.Types_s.quad32 | {
"end_col": 63,
"end_line": 139,
"start_col": 2,
"start_line": 139
} |
Prims.Tot | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"fu... | false | let ghash_incremental = opaque_make ghash_incremental_def | let ghash_incremental = | false | null | false | opaque_make ghash_incremental_def | {
"checked_file": "Vale.AES.GHash.fsti.checked",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.Bits.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.... | [
"total"
] | [
"Vale.Def.Opaque_s.opaque_make",
"Vale.Def.Types_s.quad32",
"FStar.Seq.Base.seq",
"Vale.AES.GHash.ghash_incremental_def"
] | [] | module Vale.AES.GHash
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GHash_s
open Vale.AES.GF128_s
open Vale.AES.GCTR_s
open Vale.AES.GCM_helpers
open Vale.Lib.Seqs_s
open Vale.Lib.Seqs
open FStar.Seq
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly... | false | true | Vale.AES.GHash.fsti | {
"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_el... | null | val ghash_incremental : _: Vale.Def.Types_s.quad32 ->
_: Vale.Def.Types_s.quad32 ->
_: FStar.Seq.Base.seq Vale.Def.Types_s.quad32
-> Prims.Tot Vale.Def.Types_s.quad32 | [] | Vale.AES.GHash.ghash_incremental | {
"file_name": "vale/code/crypto/aes/Vale.AES.GHash.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
_: Vale.Def.Types_s.quad32 ->
_: Vale.Def.Types_s.quad32 ->
_: FStar.Seq.Base.seq Vale.Def.Types_s.quad32
-> Prims.Tot Vale.Def.Types_s.quad32 | {
"end_col": 76,
"end_line": 109,
"start_col": 43,
"start_line": 109
} | |
FStar.Pervasives.Lemma | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"fu... | false | let ghash_incremental_reveal = opaque_revealer (`%ghash_incremental) ghash_incremental ghash_incremental_def | let ghash_incremental_reveal = | false | null | true | opaque_revealer (`%ghash_incremental) ghash_incremental ghash_incremental_def | {
"checked_file": "Vale.AES.GHash.fsti.checked",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.Bits.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.... | [
"lemma"
] | [
"Vale.Def.Opaque_s.opaque_revealer",
"Vale.Def.Types_s.quad32",
"FStar.Seq.Base.seq",
"Vale.AES.GHash.ghash_incremental",
"Vale.AES.GHash.ghash_incremental_def"
] | [] | module Vale.AES.GHash
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GHash_s
open Vale.AES.GF128_s
open Vale.AES.GCTR_s
open Vale.AES.GCM_helpers
open Vale.Lib.Seqs_s
open Vale.Lib.Seqs
open FStar.Seq
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly... | false | false | Vale.AES.GHash.fsti | {
"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_el... | null | val ghash_incremental_reveal : _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures Vale.AES.GHash.ghash_incremental == Vale.AES.GHash.ghash_incremental_def) | [] | Vale.AES.GHash.ghash_incremental_reveal | {
"file_name": "vale/code/crypto/aes/Vale.AES.GHash.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures Vale.AES.GHash.ghash_incremental == Vale.AES.GHash.ghash_incremental_def) | {
"end_col": 120,
"end_line": 110,
"start_col": 43,
"start_line": 110
} | |
Prims.Tot | val fun_seq_quad32_LE_poly128 (s: seq quad32) : (int -> poly128) | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Va... | false | let fun_seq_quad32_LE_poly128 (s:seq quad32) : (int -> poly128) =
fun (i:int) -> if 0 <= i && i < length s then of_quad32 (reverse_bytes_quad32 (index s i)) else zero | val fun_seq_quad32_LE_poly128 (s: seq quad32) : (int -> poly128)
let fun_seq_quad32_LE_poly128 (s: seq quad32) : (int -> poly128) = | false | null | false | fun (i: int) ->
if 0 <= i && i < length s then of_quad32 (reverse_bytes_quad32 (index s i)) else zero | {
"checked_file": "Vale.AES.GHash.fsti.checked",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.Bits.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.... | [
"total"
] | [
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.quad32",
"Prims.int",
"Prims.op_AmpAmp",
"Prims.op_LessThanOrEqual",
"Prims.op_LessThan",
"FStar.Seq.Base.length",
"Vale.Math.Poly2.Bits_s.of_quad32",
"Vale.Def.Types_s.reverse_bytes_quad32",
"FStar.Seq.Base.index",
"Prims.bool",
"Vale.Math.Poly2_s.zero"... | [] | module Vale.AES.GHash
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GHash_s
open Vale.AES.GF128_s
open Vale.AES.GCTR_s
open Vale.AES.GCM_helpers
open Vale.Lib.Seqs_s
open Vale.Lib.Seqs
open FStar.Seq
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly... | false | true | Vale.AES.GHash.fsti | {
"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_el... | null | val fun_seq_quad32_LE_poly128 (s: seq quad32) : (int -> poly128) | [] | Vale.AES.GHash.fun_seq_quad32_LE_poly128 | {
"file_name": "vale/code/crypto/aes/Vale.AES.GHash.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | s: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 -> _: Prims.int -> Vale.AES.GHash.poly128 | {
"end_col": 102,
"end_line": 28,
"start_col": 2,
"start_line": 28
} |
Prims.Tot | val ghash_poly (h init: poly) (data: (int -> poly128)) (j k: int) : Tot poly (decreases (k - j)) | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Va... | false | let rec ghash_poly (h:poly) (init:poly) (data:int -> poly128) (j:int) (k:int) : Tot poly (decreases (k - j)) =
if k <= j then init else
gf128_mul_rev (ghash_poly h init data j (k - 1) +. data (k - 1)) h | val ghash_poly (h init: poly) (data: (int -> poly128)) (j k: int) : Tot poly (decreases (k - j))
let rec ghash_poly (h init: poly) (data: (int -> poly128)) (j k: int) : Tot poly (decreases (k - j)) = | false | null | false | if k <= j then init else gf128_mul_rev (ghash_poly h init data j (k - 1) +. data (k - 1)) h | {
"checked_file": "Vale.AES.GHash.fsti.checked",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.Bits.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.... | [
"total",
""
] | [
"Vale.Math.Poly2_s.poly",
"Prims.int",
"Vale.AES.GHash.poly128",
"Prims.op_LessThanOrEqual",
"Prims.bool",
"Vale.AES.GF128.gf128_mul_rev",
"Vale.Math.Poly2.op_Plus_Dot",
"Vale.AES.GHash.ghash_poly",
"Prims.op_Subtraction"
] | [] | module Vale.AES.GHash
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GHash_s
open Vale.AES.GF128_s
open Vale.AES.GCTR_s
open Vale.AES.GCM_helpers
open Vale.Lib.Seqs_s
open Vale.Lib.Seqs
open FStar.Seq
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly... | false | true | Vale.AES.GHash.fsti | {
"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_el... | null | val ghash_poly (h init: poly) (data: (int -> poly128)) (j k: int) : Tot poly (decreases (k - j)) | [
"recursion"
] | Vale.AES.GHash.ghash_poly | {
"file_name": "vale/code/crypto/aes/Vale.AES.GHash.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
h: Vale.Math.Poly2_s.poly ->
init: Vale.Math.Poly2_s.poly ->
data: (_: Prims.int -> Vale.AES.GHash.poly128) ->
j: Prims.int ->
k: Prims.int
-> Prims.Tot Vale.Math.Poly2_s.poly | {
"end_col": 68,
"end_line": 32,
"start_col": 2,
"start_line": 31
} |
Prims.Tot | val ghash_incremental_def (h_LE y_prev: quad32) (x: seq quad32) : Tot quad32 (decreases %[length x]) | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"fu... | false | let rec ghash_incremental_def (h_LE:quad32) (y_prev:quad32) (x:seq quad32) : Tot quad32 (decreases %[length x]) =
if length x = 0 then y_prev else
let y_i_minus_1 = ghash_incremental_def h_LE y_prev (all_but_last x) in
let x_i = last x in
let xor_LE = quad32_xor y_i_minus_1 x_i in
gf128_mul_LE xor_LE h_LE | val ghash_incremental_def (h_LE y_prev: quad32) (x: seq quad32) : Tot quad32 (decreases %[length x])
let rec ghash_incremental_def (h_LE y_prev: quad32) (x: seq quad32)
: Tot quad32 (decreases %[length x]) = | false | null | false | if length x = 0
then y_prev
else
let y_i_minus_1 = ghash_incremental_def h_LE y_prev (all_but_last x) in
let x_i = last x in
let xor_LE = quad32_xor y_i_minus_1 x_i in
gf128_mul_LE xor_LE h_LE | {
"checked_file": "Vale.AES.GHash.fsti.checked",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.Bits.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.... | [
"total",
""
] | [
"Vale.Def.Types_s.quad32",
"FStar.Seq.Base.seq",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"Prims.bool",
"Vale.AES.GHash_s.gf128_mul_LE",
"Vale.Def.Types_s.quad32_xor",
"FStar.Seq.Properties.last",
"Vale.AES.GHash.ghash_incremental_def",
"Vale.Lib.Seqs_s.all_but_last"
] | [] | module Vale.AES.GHash
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GHash_s
open Vale.AES.GF128_s
open Vale.AES.GCTR_s
open Vale.AES.GCM_helpers
open Vale.Lib.Seqs_s
open Vale.Lib.Seqs
open FStar.Seq
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly... | false | true | Vale.AES.GHash.fsti | {
"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_el... | null | val ghash_incremental_def (h_LE y_prev: quad32) (x: seq quad32) : Tot quad32 (decreases %[length x]) | [
"recursion"
] | Vale.AES.GHash.ghash_incremental_def | {
"file_name": "vale/code/crypto/aes/Vale.AES.GHash.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
h_LE: Vale.Def.Types_s.quad32 ->
y_prev: Vale.Def.Types_s.quad32 ->
x: FStar.Seq.Base.seq Vale.Def.Types_s.quad32
-> Prims.Tot Vale.Def.Types_s.quad32 | {
"end_col": 26,
"end_line": 108,
"start_col": 2,
"start_line": 104
} |
Prims.Tot | val hkeys_reqs_priv (hkeys: seq quad32) (h_BE: quad32) : Vale.Def.Prop_s.prop0 | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"fu... | false | let hkeys_reqs_priv (hkeys:seq quad32) (h_BE:quad32) : Vale.Def.Prop_s.prop0
=
let h = of_quad32 (reverse_bytes_quad32 (reverse_bytes_quad32 h_BE)) in
length hkeys >= 8 /\
index hkeys 2 == h_BE /\
of_quad32 (index hkeys 0) == gf128_power h 1 /\
of_quad32 (index hkeys 1) == gf128_power h 2 /\
of_quad32 (in... | val hkeys_reqs_priv (hkeys: seq quad32) (h_BE: quad32) : Vale.Def.Prop_s.prop0
let hkeys_reqs_priv (hkeys: seq quad32) (h_BE: quad32) : Vale.Def.Prop_s.prop0 = | false | null | false | let h = of_quad32 (reverse_bytes_quad32 (reverse_bytes_quad32 h_BE)) in
length hkeys >= 8 /\ index hkeys 2 == h_BE /\ of_quad32 (index hkeys 0) == gf128_power h 1 /\
of_quad32 (index hkeys 1) == gf128_power h 2 /\ of_quad32 (index hkeys 3) == gf128_power h 3 /\
of_quad32 (index hkeys 4) == gf128_power h 4 /\ index hkey... | {
"checked_file": "Vale.AES.GHash.fsti.checked",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.Bits.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.... | [
"total"
] | [
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.quad32",
"Prims.l_and",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"FStar.Seq.Base.length",
"Prims.eq2",
"FStar.Seq.Base.index",
"Vale.Math.Poly2_s.poly",
"Vale.Math.Poly2.Bits_s.of_quad32",
"Vale.AES.GHash.gf128_power",
"Prims.op_Equality",
"Vale.Def... | [] | module Vale.AES.GHash
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GHash_s
open Vale.AES.GF128_s
open Vale.AES.GCTR_s
open Vale.AES.GCM_helpers
open Vale.Lib.Seqs_s
open Vale.Lib.Seqs
open FStar.Seq
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly... | false | true | Vale.AES.GHash.fsti | {
"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_el... | null | val hkeys_reqs_priv (hkeys: seq quad32) (h_BE: quad32) : Vale.Def.Prop_s.prop0 | [] | Vale.AES.GHash.hkeys_reqs_priv | {
"file_name": "vale/code/crypto/aes/Vale.AES.GHash.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | hkeys: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 -> h_BE: Vale.Def.Types_s.quad32
-> Vale.Def.Prop_s.prop0 | {
"end_col": 46,
"end_line": 53,
"start_col": 3,
"start_line": 43
} |
Prims.Tot | val ghash_unroll (h prev: poly) (data: (int -> poly128)) (k: int) (m n: nat) : poly | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"fu... | false | let rec ghash_unroll (h:poly) (prev:poly) (data:int -> poly128) (k:int) (m n:nat) : poly =
let d = data (k + m) in
let p = gf128_power h (n + 1) in
if m = 0 then (prev +. d) *. p else
ghash_unroll h prev data k (m - 1) (n + 1) +. d *. p | val ghash_unroll (h prev: poly) (data: (int -> poly128)) (k: int) (m n: nat) : poly
let rec ghash_unroll (h prev: poly) (data: (int -> poly128)) (k: int) (m n: nat) : poly = | false | null | false | let d = data (k + m) in
let p = gf128_power h (n + 1) in
if m = 0 then (prev +. d) *. p else ghash_unroll h prev data k (m - 1) (n + 1) +. d *. p | {
"checked_file": "Vale.AES.GHash.fsti.checked",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.Bits.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.... | [
"total"
] | [
"Vale.Math.Poly2_s.poly",
"Prims.int",
"Vale.AES.GHash.poly128",
"Prims.nat",
"Prims.op_Equality",
"Vale.Math.Poly2.op_Star_Dot",
"Vale.Math.Poly2.op_Plus_Dot",
"Prims.bool",
"Vale.AES.GHash.ghash_unroll",
"Prims.op_Subtraction",
"Prims.op_Addition",
"Vale.AES.GHash.gf128_power"
] | [] | module Vale.AES.GHash
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GHash_s
open Vale.AES.GF128_s
open Vale.AES.GCTR_s
open Vale.AES.GCM_helpers
open Vale.Lib.Seqs_s
open Vale.Lib.Seqs
open FStar.Seq
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly... | false | true | Vale.AES.GHash.fsti | {
"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_el... | null | val ghash_unroll (h prev: poly) (data: (int -> poly128)) (k: int) (m n: nat) : poly | [
"recursion"
] | Vale.AES.GHash.ghash_unroll | {
"file_name": "vale/code/crypto/aes/Vale.AES.GHash.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
h: Vale.Math.Poly2_s.poly ->
prev: Vale.Math.Poly2_s.poly ->
data: (_: Prims.int -> Vale.AES.GHash.poly128) ->
k: Prims.int ->
m: Prims.nat ->
n: Prims.nat
-> Vale.Math.Poly2_s.poly | {
"end_col": 54,
"end_line": 63,
"start_col": 90,
"start_line": 59
} |
Prims.Tot | val ghash_unroll_back (h prev: poly) (data: (int -> poly128)) (k: int) (n m: nat) : poly | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"fu... | false | let rec ghash_unroll_back (h:poly) (prev:poly) (data:int -> poly128) (k:int) (n m:nat) : poly =
let d = data (k + (n - 1 - m)) in
let p = gf128_power h (m + 1) in
let v = if m = n - 1 then prev +. d else d in
if m = 0 then v *. p else
ghash_unroll_back h prev data k n (m - 1) +. v *. p | val ghash_unroll_back (h prev: poly) (data: (int -> poly128)) (k: int) (n m: nat) : poly
let rec ghash_unroll_back (h prev: poly) (data: (int -> poly128)) (k: int) (n m: nat) : poly = | false | null | false | let d = data (k + (n - 1 - m)) in
let p = gf128_power h (m + 1) in
let v = if m = n - 1 then prev +. d else d in
if m = 0 then v *. p else ghash_unroll_back h prev data k n (m - 1) +. v *. p | {
"checked_file": "Vale.AES.GHash.fsti.checked",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.Bits.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.... | [
"total"
] | [
"Vale.Math.Poly2_s.poly",
"Prims.int",
"Vale.AES.GHash.poly128",
"Prims.nat",
"Prims.op_Equality",
"Vale.Math.Poly2.op_Star_Dot",
"Prims.bool",
"Vale.Math.Poly2.op_Plus_Dot",
"Vale.AES.GHash.ghash_unroll_back",
"Prims.op_Subtraction",
"Vale.AES.GHash.gf128_power",
"Prims.op_Addition"
] | [] | module Vale.AES.GHash
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GHash_s
open Vale.AES.GF128_s
open Vale.AES.GCTR_s
open Vale.AES.GCM_helpers
open Vale.Lib.Seqs_s
open Vale.Lib.Seqs
open FStar.Seq
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly... | false | true | Vale.AES.GHash.fsti | {
"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_el... | null | val ghash_unroll_back (h prev: poly) (data: (int -> poly128)) (k: int) (n m: nat) : poly | [
"recursion"
] | Vale.AES.GHash.ghash_unroll_back | {
"file_name": "vale/code/crypto/aes/Vale.AES.GHash.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
h: Vale.Math.Poly2_s.poly ->
prev: Vale.Math.Poly2_s.poly ->
data: (_: Prims.int -> Vale.AES.GHash.poly128) ->
k: Prims.int ->
n: Prims.nat ->
m: Prims.nat
-> Vale.Math.Poly2_s.poly | {
"end_col": 53,
"end_line": 71,
"start_col": 95,
"start_line": 66
} |
FStar.Pervasives.Lemma | val lemma_add_manip (x y z: poly) : Lemma (x +. y +. z == x +. z +. y) | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"fu... | false | let lemma_add_manip (x y z:poly) : Lemma
(x +. y +. z == x +. z +. y)
=
calc (==) {
x +. y +. z;
== { lemma_add_associate x y z }
x +. (y +. z);
== { lemma_add_commute y z }
x +. (z +. y);
== { lemma_add_associate x z y }
x +. z +. y;
};
() | val lemma_add_manip (x y z: poly) : Lemma (x +. y +. z == x +. z +. y)
let lemma_add_manip (x y z: poly) : Lemma (x +. y +. z == x +. z +. y) = | false | null | true | calc ( == ) {
x +. y +. z;
( == ) { lemma_add_associate x y z }
x +. (y +. z);
( == ) { lemma_add_commute y z }
x +. (z +. y);
( == ) { lemma_add_associate x z y }
x +. z +. y;
};
() | {
"checked_file": "Vale.AES.GHash.fsti.checked",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.Bits.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.... | [
"lemma"
] | [
"Vale.Math.Poly2_s.poly",
"Prims.unit",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Vale.Math.Poly2.op_Plus_Dot",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"FStar.Calc.calc_step",
"FStar.Calc.calc_init",
"FStar.Calc.calc_pack",
"Vale.Math.Poly2.lemma_add_associate",
"Prims.squash",
... | [] | module Vale.AES.GHash
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GHash_s
open Vale.AES.GF128_s
open Vale.AES.GCTR_s
open Vale.AES.GCM_helpers
open Vale.Lib.Seqs_s
open Vale.Lib.Seqs
open FStar.Seq
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly... | false | false | Vale.AES.GHash.fsti | {
"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_el... | null | val lemma_add_manip (x y z: poly) : Lemma (x +. y +. z == x +. z +. y) | [] | Vale.AES.GHash.lemma_add_manip | {
"file_name": "vale/code/crypto/aes/Vale.AES.GHash.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | x: Vale.Math.Poly2_s.poly -> y: Vale.Math.Poly2_s.poly -> z: Vale.Math.Poly2_s.poly
-> FStar.Pervasives.Lemma (ensures x +. y +. z == x +. z +. y) | {
"end_col": 4,
"end_line": 101,
"start_col": 2,
"start_line": 92
} |
Prims.Tot | val synth_u32_le (x: bounded_integer 4) : Tot U32.t | [
{
"abbrev": false,
"full_module": "LowParse.Spec.Combinators // for make_total_constant_size_parser_precond",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowParse.Math",
"short_modu... | false | let synth_u32_le
(x: bounded_integer 4)
: Tot U32.t
= x | val synth_u32_le (x: bounded_integer 4) : Tot U32.t
let synth_u32_le (x: bounded_integer 4) : Tot U32.t = | false | null | false | x | {
"checked_file": "LowParse.Spec.BoundedInt.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"LowParse.Math.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FSta... | [
"total"
] | [
"LowParse.Spec.BoundedInt.bounded_integer",
"FStar.UInt32.t"
] | [] | module LowParse.Spec.BoundedInt
open LowParse.Spec.Combinators // for make_total_constant_size_parser_precond
module Seq = FStar.Seq
module E = FStar.Endianness
module U8 = FStar.UInt8
module U16 = FStar.UInt16
module U32 = FStar.UInt32
module M = LowParse.Math
module Cast = FStar.Int.Cast
(* bounded integers *)
l... | false | false | LowParse.Spec.BoundedInt.fst | {
"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_el... | null | val synth_u32_le (x: bounded_integer 4) : Tot U32.t | [] | LowParse.Spec.BoundedInt.synth_u32_le | {
"file_name": "src/lowparse/LowParse.Spec.BoundedInt.fst",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | x: LowParse.Spec.BoundedInt.bounded_integer 4 -> FStar.UInt32.t | {
"end_col": 3,
"end_line": 159,
"start_col": 2,
"start_line": 159
} |
Prims.Tot | val parse_bounded_integer
(i: integer_size)
: Tot (parser (parse_bounded_integer_kind i) (bounded_integer i)) | [
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowParse.Math",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Combinators // for make_total_constant_size_parser_precond",
"short_modul... | false | let parse_bounded_integer
(i: integer_size)
: Tot (parser (parse_bounded_integer_kind i) (bounded_integer i))
= decode_bounded_integer_injective i;
make_total_constant_size_parser i (bounded_integer i) (decode_bounded_integer i) | val parse_bounded_integer
(i: integer_size)
: Tot (parser (parse_bounded_integer_kind i) (bounded_integer i))
let parse_bounded_integer (i: integer_size)
: Tot (parser (parse_bounded_integer_kind i) (bounded_integer i)) = | false | null | false | decode_bounded_integer_injective i;
make_total_constant_size_parser i (bounded_integer i) (decode_bounded_integer i) | {
"checked_file": "LowParse.Spec.BoundedInt.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"LowParse.Math.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FSta... | [
"total"
] | [
"LowParse.Spec.BoundedInt.integer_size",
"LowParse.Spec.Combinators.make_total_constant_size_parser",
"LowParse.Spec.BoundedInt.bounded_integer",
"LowParse.Spec.BoundedInt.decode_bounded_integer",
"Prims.unit",
"LowParse.Spec.BoundedInt.decode_bounded_integer_injective",
"LowParse.Spec.Base.parser",
"... | [] | module LowParse.Spec.BoundedInt
open LowParse.Spec.Combinators // for make_total_constant_size_parser_precond
module Seq = FStar.Seq
module E = FStar.Endianness
module U8 = FStar.UInt8
module U16 = FStar.UInt16
module U32 = FStar.UInt32
module M = LowParse.Math
module Cast = FStar.Int.Cast
(* bounded integers *)
l... | false | false | LowParse.Spec.BoundedInt.fst | {
"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_el... | null | val parse_bounded_integer
(i: integer_size)
: Tot (parser (parse_bounded_integer_kind i) (bounded_integer i)) | [] | LowParse.Spec.BoundedInt.parse_bounded_integer | {
"file_name": "src/lowparse/LowParse.Spec.BoundedInt.fst",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | i: LowParse.Spec.BoundedInt.integer_size
-> LowParse.Spec.Base.parser (LowParse.Spec.BoundedInt.parse_bounded_integer_kind i)
(LowParse.Spec.BoundedInt.bounded_integer i) | {
"end_col": 82,
"end_line": 64,
"start_col": 2,
"start_line": 63
} |
Prims.Tot | val parse_bounded_integer_le
(i: integer_size)
: Tot (parser (parse_bounded_integer_kind i) (bounded_integer i)) | [
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowParse.Math",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Combinators // for make_total_constant_size_parser_precond",
"short_modul... | false | let parse_bounded_integer_le
i
= bounded_integer_of_le_injective i;
make_total_constant_size_parser i (bounded_integer i) (bounded_integer_of_le i) | val parse_bounded_integer_le
(i: integer_size)
: Tot (parser (parse_bounded_integer_kind i) (bounded_integer i))
let parse_bounded_integer_le i = | false | null | false | bounded_integer_of_le_injective i;
make_total_constant_size_parser i (bounded_integer i) (bounded_integer_of_le i) | {
"checked_file": "LowParse.Spec.BoundedInt.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"LowParse.Math.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FSta... | [
"total"
] | [
"LowParse.Spec.BoundedInt.integer_size",
"LowParse.Spec.Combinators.make_total_constant_size_parser",
"LowParse.Spec.BoundedInt.bounded_integer",
"LowParse.Spec.BoundedInt.bounded_integer_of_le",
"Prims.unit",
"LowParse.Spec.BoundedInt.bounded_integer_of_le_injective",
"LowParse.Spec.Base.parser",
"Lo... | [] | module LowParse.Spec.BoundedInt
open LowParse.Spec.Combinators // for make_total_constant_size_parser_precond
module Seq = FStar.Seq
module E = FStar.Endianness
module U8 = FStar.UInt8
module U16 = FStar.UInt16
module U32 = FStar.UInt32
module M = LowParse.Math
module Cast = FStar.Int.Cast
(* bounded integers *)
l... | false | false | LowParse.Spec.BoundedInt.fst | {
"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_el... | null | val parse_bounded_integer_le
(i: integer_size)
: Tot (parser (parse_bounded_integer_kind i) (bounded_integer i)) | [] | LowParse.Spec.BoundedInt.parse_bounded_integer_le | {
"file_name": "src/lowparse/LowParse.Spec.BoundedInt.fst",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | i: LowParse.Spec.BoundedInt.integer_size
-> LowParse.Spec.Base.parser (LowParse.Spec.BoundedInt.parse_bounded_integer_kind i)
(LowParse.Spec.BoundedInt.bounded_integer i) | {
"end_col": 81,
"end_line": 143,
"start_col": 2,
"start_line": 142
} |
Prims.Tot | val synth_u16_le (x: bounded_integer 2) : Tot U16.t | [
{
"abbrev": false,
"full_module": "LowParse.Spec.Combinators // for make_total_constant_size_parser_precond",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowParse.Math",
"short_modu... | false | let synth_u16_le
(x: bounded_integer 2)
: Tot U16.t
= Cast.uint32_to_uint16 x | val synth_u16_le (x: bounded_integer 2) : Tot U16.t
let synth_u16_le (x: bounded_integer 2) : Tot U16.t = | false | null | false | Cast.uint32_to_uint16 x | {
"checked_file": "LowParse.Spec.BoundedInt.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"LowParse.Math.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FSta... | [
"total"
] | [
"LowParse.Spec.BoundedInt.bounded_integer",
"FStar.Int.Cast.uint32_to_uint16",
"FStar.UInt16.t"
] | [] | module LowParse.Spec.BoundedInt
open LowParse.Spec.Combinators // for make_total_constant_size_parser_precond
module Seq = FStar.Seq
module E = FStar.Endianness
module U8 = FStar.UInt8
module U16 = FStar.UInt16
module U32 = FStar.UInt32
module M = LowParse.Math
module Cast = FStar.Int.Cast
(* bounded integers *)
l... | false | false | LowParse.Spec.BoundedInt.fst | {
"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_el... | null | val synth_u16_le (x: bounded_integer 2) : Tot U16.t | [] | LowParse.Spec.BoundedInt.synth_u16_le | {
"file_name": "src/lowparse/LowParse.Spec.BoundedInt.fst",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | x: LowParse.Spec.BoundedInt.bounded_integer 2 -> FStar.UInt16.t | {
"end_col": 25,
"end_line": 149,
"start_col": 2,
"start_line": 149
} |
Prims.Tot | val serialize_bounded_integer_le
(sz: integer_size)
: Tot (serializer (parse_bounded_integer_le sz)) | [
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowParse.Math",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Combinators // for make_total_constant_size_parser_precond",
"short_modul... | false | let serialize_bounded_integer_le
sz
= serialize_bounded_integer_le_correct sz;
serialize_bounded_integer_le' sz | val serialize_bounded_integer_le
(sz: integer_size)
: Tot (serializer (parse_bounded_integer_le sz))
let serialize_bounded_integer_le sz = | false | null | false | serialize_bounded_integer_le_correct sz;
serialize_bounded_integer_le' sz | {
"checked_file": "LowParse.Spec.BoundedInt.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"LowParse.Math.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FSta... | [
"total"
] | [
"LowParse.Spec.BoundedInt.integer_size",
"LowParse.Spec.BoundedInt.serialize_bounded_integer_le'",
"Prims.unit",
"LowParse.Spec.BoundedInt.serialize_bounded_integer_le_correct",
"LowParse.Spec.Base.serializer",
"LowParse.Spec.BoundedInt.parse_bounded_integer_kind",
"LowParse.Spec.BoundedInt.bounded_inte... | [] | module LowParse.Spec.BoundedInt
open LowParse.Spec.Combinators // for make_total_constant_size_parser_precond
module Seq = FStar.Seq
module E = FStar.Endianness
module U8 = FStar.UInt8
module U16 = FStar.UInt16
module U32 = FStar.UInt32
module M = LowParse.Math
module Cast = FStar.Int.Cast
(* bounded integers *)
l... | false | false | LowParse.Spec.BoundedInt.fst | {
"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_el... | null | val serialize_bounded_integer_le
(sz: integer_size)
: Tot (serializer (parse_bounded_integer_le sz)) | [] | LowParse.Spec.BoundedInt.serialize_bounded_integer_le | {
"file_name": "src/lowparse/LowParse.Spec.BoundedInt.fst",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | sz: LowParse.Spec.BoundedInt.integer_size
-> LowParse.Spec.Base.serializer (LowParse.Spec.BoundedInt.parse_bounded_integer_le sz) | {
"end_col": 34,
"end_line": 193,
"start_col": 2,
"start_line": 192
} |
Prims.Tot | val serialize_bounded_integer
(sz: integer_size)
: Tot (serializer (parse_bounded_integer sz)) | [
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowParse.Math",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Combinators // for make_total_constant_size_parser_precond",
"short_modul... | false | let serialize_bounded_integer
sz
: Tot (serializer (parse_bounded_integer sz))
= serialize_bounded_integer_correct sz;
serialize_bounded_integer' sz | val serialize_bounded_integer
(sz: integer_size)
: Tot (serializer (parse_bounded_integer sz))
let serialize_bounded_integer sz : Tot (serializer (parse_bounded_integer sz)) = | false | null | false | serialize_bounded_integer_correct sz;
serialize_bounded_integer' sz | {
"checked_file": "LowParse.Spec.BoundedInt.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"LowParse.Math.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FSta... | [
"total"
] | [
"LowParse.Spec.BoundedInt.integer_size",
"LowParse.Spec.BoundedInt.serialize_bounded_integer'",
"Prims.unit",
"LowParse.Spec.BoundedInt.serialize_bounded_integer_correct",
"LowParse.Spec.Base.serializer",
"LowParse.Spec.BoundedInt.parse_bounded_integer_kind",
"LowParse.Spec.BoundedInt.bounded_integer",
... | [] | module LowParse.Spec.BoundedInt
open LowParse.Spec.Combinators // for make_total_constant_size_parser_precond
module Seq = FStar.Seq
module E = FStar.Endianness
module U8 = FStar.UInt8
module U16 = FStar.UInt16
module U32 = FStar.UInt32
module M = LowParse.Math
module Cast = FStar.Int.Cast
(* bounded integers *)
l... | false | false | LowParse.Spec.BoundedInt.fst | {
"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_el... | null | val serialize_bounded_integer
(sz: integer_size)
: Tot (serializer (parse_bounded_integer sz)) | [] | LowParse.Spec.BoundedInt.serialize_bounded_integer | {
"file_name": "src/lowparse/LowParse.Spec.BoundedInt.fst",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | sz: LowParse.Spec.BoundedInt.integer_size
-> LowParse.Spec.Base.serializer (LowParse.Spec.BoundedInt.parse_bounded_integer sz) | {
"end_col": 31,
"end_line": 104,
"start_col": 2,
"start_line": 103
} |
Prims.Tot | val parse_u16_le : parser parse_u16_kind U16.t | [
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowParse.Math",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Combinators // for make_total_constant_size_parser_precond",
"short_modul... | false | let parse_u16_le = parse_bounded_integer_le 2 `parse_synth` synth_u16_le | val parse_u16_le : parser parse_u16_kind U16.t
let parse_u16_le = | false | null | false | (parse_bounded_integer_le 2) `parse_synth` synth_u16_le | {
"checked_file": "LowParse.Spec.BoundedInt.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"LowParse.Math.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FSta... | [
"total"
] | [
"LowParse.Spec.Combinators.parse_synth",
"LowParse.Spec.BoundedInt.parse_bounded_integer_kind",
"LowParse.Spec.BoundedInt.bounded_integer",
"FStar.UInt16.t",
"LowParse.Spec.BoundedInt.parse_bounded_integer_le",
"LowParse.Spec.BoundedInt.synth_u16_le"
] | [] | module LowParse.Spec.BoundedInt
open LowParse.Spec.Combinators // for make_total_constant_size_parser_precond
module Seq = FStar.Seq
module E = FStar.Endianness
module U8 = FStar.UInt8
module U16 = FStar.UInt16
module U32 = FStar.UInt32
module M = LowParse.Math
module Cast = FStar.Int.Cast
(* bounded integers *)
l... | false | true | LowParse.Spec.BoundedInt.fst | {
"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_el... | null | val parse_u16_le : parser parse_u16_kind U16.t | [] | LowParse.Spec.BoundedInt.parse_u16_le | {
"file_name": "src/lowparse/LowParse.Spec.BoundedInt.fst",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | LowParse.Spec.Base.parser LowParse.Spec.Int.parse_u16_kind FStar.UInt16.t | {
"end_col": 72,
"end_line": 153,
"start_col": 19,
"start_line": 153
} |
Prims.Tot | val parse_u32_le : parser parse_u32_kind U32.t | [
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowParse.Math",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Combinators // for make_total_constant_size_parser_precond",
"short_modul... | false | let parse_u32_le = parse_bounded_integer_le 4 `parse_synth` synth_u32_le | val parse_u32_le : parser parse_u32_kind U32.t
let parse_u32_le = | false | null | false | (parse_bounded_integer_le 4) `parse_synth` synth_u32_le | {
"checked_file": "LowParse.Spec.BoundedInt.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"LowParse.Math.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FSta... | [
"total"
] | [
"LowParse.Spec.Combinators.parse_synth",
"LowParse.Spec.BoundedInt.parse_bounded_integer_kind",
"LowParse.Spec.BoundedInt.bounded_integer",
"FStar.UInt32.t",
"LowParse.Spec.BoundedInt.parse_bounded_integer_le",
"LowParse.Spec.BoundedInt.synth_u32_le"
] | [] | module LowParse.Spec.BoundedInt
open LowParse.Spec.Combinators // for make_total_constant_size_parser_precond
module Seq = FStar.Seq
module E = FStar.Endianness
module U8 = FStar.UInt8
module U16 = FStar.UInt16
module U32 = FStar.UInt32
module M = LowParse.Math
module Cast = FStar.Int.Cast
(* bounded integers *)
l... | false | true | LowParse.Spec.BoundedInt.fst | {
"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_el... | null | val parse_u32_le : parser parse_u32_kind U32.t | [] | LowParse.Spec.BoundedInt.parse_u32_le | {
"file_name": "src/lowparse/LowParse.Spec.BoundedInt.fst",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | LowParse.Spec.Base.parser LowParse.Spec.Int.parse_u32_kind FStar.UInt32.t | {
"end_col": 72,
"end_line": 161,
"start_col": 19,
"start_line": 161
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.