file_name stringlengths 5 52 | name stringlengths 4 95 | original_source_type stringlengths 0 23k | source_type stringlengths 9 23k | source_definition stringlengths 9 57.9k | source dict | source_range dict | file_context stringlengths 0 721k | dependencies dict | opens_and_abbrevs listlengths 2 94 | vconfig dict | interleaved bool 1
class | verbose_type stringlengths 1 7.42k | effect stringclasses 118
values | effect_flags listlengths 0 2 | mutual_with listlengths 0 11 | ideal_premises listlengths 0 236 | proof_features listlengths 0 1 | is_simple_lemma bool 2
classes | is_div bool 2
classes | is_proof bool 2
classes | is_simply_typed bool 2
classes | is_type bool 2
classes | partial_definition stringlengths 5 3.99k | completed_definiton stringlengths 1 1.63M | isa_cross_project_example bool 1
class |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Vale.Poly1305.X64.fst | Vale.Poly1305.X64.va_wpProof_Poly1305_last_block | val va_wpProof_Poly1305_last_block : va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Poly1305_last_block va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Poly1305_last_block ())
([va_Mod_flags; va_Mod_reg64 r... | val va_wpProof_Poly1305_last_block : va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Poly1305_last_block va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Poly1305_last_block ())
([va_Mod_flags; va_Mod_reg64 r... | let va_wpProof_Poly1305_last_block va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Poly1305_last_block (va_code_Poly1305_last_block ()) va_s0 in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_reg64 rRbp va_sM (va_update_reg64
rRbx va_sM (va_update_reg64 rR14 va_sM (va_update... | {
"file_name": "obj/Vale.Poly1305.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 2017,
"start_col": 0,
"start_line": 2006
} | module Vale.Poly1305.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.Poly1305.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": null
},
{
"abbrev": false,
... | {
"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... | false | va_s0: Vale.X64.Decls.va_state -> va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_state",
"Prims.unit",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_Mod_reg64",
"Vale.X64.Machine_s.rRbp",
"Vale.X64.Mac... | [] | false | false | false | false | false | let va_wpProof_Poly1305_last_block va_s0 va_k =
| let va_sM, va_f0 = va_lemma_Poly1305_last_block (va_code_Poly1305_last_block ()) va_s0 in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_flags va_sM
(va_update_reg64 rRbp
va_sM
(va_update_reg64 rRbx
va_sM
(va_update_reg64 r... | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.swap_neg_mul | val swap_neg_mul: a:int -> b:int -> Lemma ((-a) * b = a * (-b)) | val swap_neg_mul: a:int -> b:int -> Lemma ((-a) * b = a * (-b)) | let swap_neg_mul a b =
neg_mul_left a b;
neg_mul_right a b | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 19,
"end_line": 139,
"start_col": 0,
"start_line": 137
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int -> FStar.Pervasives.Lemma (ensures (- a) * b = a * (- b)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"FStar.Math.Lemmas.neg_mul_right",
"Prims.unit",
"FStar.Math.Lemmas.neg_mul_left"
] | [] | true | false | true | false | false | let swap_neg_mul a b =
| neg_mul_left a b;
neg_mul_right a b | false |
Vale.Poly1305.X64.fst | Vale.Poly1305.X64.va_codegen_success_Poly1305 | val va_codegen_success_Poly1305 : win:bool -> Tot va_pbool | val va_codegen_success_Poly1305 : win:bool -> Tot va_pbool | let va_codegen_success_Poly1305 win =
(va_pbool_and (va_codegen_success_CreateHeaplets ()) (va_pbool_and (va_codegen_success_Mov64
(va_op_dst_opr64_reg64 rRax) (va_op_opr64_reg64 rRdi)) (va_pbool_and (va_codegen_success_Mov64
(va_op_dst_opr64_reg64 rR11) (va_op_opr64_reg64 rRsi)) (va_pbool_and (if win then va... | {
"file_name": "obj/Vale.Poly1305.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 34,
"end_line": 2810,
"start_col": 0,
"start_line": 2777
} | module Vale.Poly1305.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.Poly1305.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": null
},
{
"abbrev": false,
... | {
"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... | false | win: Prims.bool -> Vale.X64.Decls.va_pbool | Prims.Tot | [
"total"
] | [] | [
"Prims.bool",
"Vale.X64.Decls.va_pbool_and",
"Vale.X64.InsMem.va_codegen_success_CreateHeaplets",
"Vale.X64.InsBasic.va_codegen_success_Mov64",
"Vale.X64.Decls.va_op_dst_opr64_reg64",
"Vale.X64.Machine_s.rRax",
"Vale.X64.Decls.va_op_opr64_reg64",
"Vale.X64.Machine_s.rRdi",
"Vale.X64.Machine_s.rR11",... | [] | false | false | false | true | false | let va_codegen_success_Poly1305 win =
| (va_pbool_and (va_codegen_success_CreateHeaplets ())
(va_pbool_and (va_codegen_success_Mov64 (va_op_dst_opr64_reg64 rRax) (va_op_opr64_reg64 rRdi))
(va_pbool_and (va_codegen_success_Mov64 (va_op_dst_opr64_reg64 rR11)
(va_op_opr64_reg64 rRsi))
(va_pbool_and (if win
... | false |
Vale.Poly1305.X64.fst | Vale.Poly1305.X64.va_quick_Poly1305_reduce_last | val va_quick_Poly1305_reduce_last: Prims.unit
-> (va_quickCode unit (va_code_Poly1305_reduce_last ())) | val va_quick_Poly1305_reduce_last: Prims.unit
-> (va_quickCode unit (va_code_Poly1305_reduce_last ())) | let va_quick_Poly1305_reduce_last () : (va_quickCode unit (va_code_Poly1305_reduce_last ())) =
(va_QProc (va_code_Poly1305_reduce_last ()) ([va_Mod_flags; va_Mod_reg64 rRbp; va_Mod_reg64 rRbx;
va_Mod_reg64 rR14; va_Mod_reg64 rRax; va_Mod_reg64 rR10; va_Mod_reg64 rR9; va_Mod_reg64 rR8])
va_wp_Poly1305_reduce_l... | {
"file_name": "obj/Vale.Poly1305.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 63,
"end_line": 2204,
"start_col": 0,
"start_line": 2201
} | module Vale.Poly1305.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.Poly1305.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": null
},
{
"abbrev": false,
... | {
"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... | false | _: Prims.unit
-> Vale.X64.QuickCode.va_quickCode Prims.unit (Vale.Poly1305.X64.va_code_Poly1305_reduce_last ()) | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"Vale.X64.QuickCode.va_QProc",
"Vale.Poly1305.X64.va_code_Poly1305_reduce_last",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_Mod_reg64",
"Vale.X64.Machine_s.rRbp",
"Vale.X64.Machine_s.rRbx",
"Vale.X64.Machine_s.rR14",
"Vale.X6... | [] | false | false | false | false | false | let va_quick_Poly1305_reduce_last () : (va_quickCode unit (va_code_Poly1305_reduce_last ())) =
| (va_QProc (va_code_Poly1305_reduce_last ())
([
va_Mod_flags;
va_Mod_reg64 rRbp;
va_Mod_reg64 rRbx;
va_Mod_reg64 rR14;
va_Mod_reg64 rRax;
va_Mod_reg64 rR10;
va_Mod_reg64 rR9;
va_Mod_reg64 rR8
])
va_wp_Poly1305_reduce_last
va_wpProof_Poly13... | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.mul_ineq1 | val mul_ineq1: a:int -> b:nat -> c:int -> d:nat -> Lemma
(requires (-b < a /\ a < b /\
-d < c /\ c < d))
(ensures (-(b * d) < a * c /\ a * c < b * d)) | val mul_ineq1: a:int -> b:nat -> c:int -> d:nat -> Lemma
(requires (-b < a /\ a < b /\
-d < c /\ c < d))
(ensures (-(b * d) < a * c /\ a * c < b * d)) | let mul_ineq1 a b c d =
if a = 0 || c = 0 then ()
else begin
lemma_abs_bound a b;
lemma_abs_bound c d;
lemma_abs_mul a c;
lemma_mult_lt_left (abs a) (abs c) d;
lemma_mult_lt_right d (abs a) b;
lemma_abs_bound (a * c) (b * d);
()
end | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 195,
"start_col": 0,
"start_line": 185
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.nat -> c: Prims.int -> d: Prims.nat
-> FStar.Pervasives.Lemma (requires - b < a /\ a < b /\ - d < c /\ c < d)
(ensures - b * d < a * c /\ a * c < b * d) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.nat",
"Prims.op_BarBar",
"Prims.op_Equality",
"Prims.bool",
"Prims.unit",
"FStar.Math.Lemmas.lemma_abs_bound",
"FStar.Mul.op_Star",
"FStar.Math.Lemmas.lemma_mult_lt_right",
"FStar.Math.Lib.abs",
"FStar.Math.Lemmas.lemma_mult_lt_left",
"FStar.Math.Lemmas.lemma_abs_mul"
] | [] | false | false | true | false | false | let mul_ineq1 a b c d =
| if a = 0 || c = 0
then ()
else
(lemma_abs_bound a b;
lemma_abs_bound c d;
lemma_abs_mul a c;
lemma_mult_lt_left (abs a) (abs c) d;
lemma_mult_lt_right d (abs a) b;
lemma_abs_bound (a * c) (b * d);
()) | false |
Vale.Poly1305.X64.fst | Vale.Poly1305.X64.va_lemma_Poly1305_blocks_body0 | val va_lemma_Poly1305_blocks_body0 : va_b0:va_code -> va_s0:va_state -> va_old:va_state ->
va_in_ctx_b:buffer64 -> va_in_h_in:int -> va_in_inp_b:buffer64 -> va_in_length:int ->
va_in_n:(va_int_range 18446744073709551616 18446744073709551616) -> va_in_p:(va_int_range
1361129467683753853853498429727072845819 136112... | val va_lemma_Poly1305_blocks_body0 : va_b0:va_code -> va_s0:va_state -> va_old:va_state ->
va_in_ctx_b:buffer64 -> va_in_h_in:int -> va_in_inp_b:buffer64 -> va_in_length:int ->
va_in_n:(va_int_range 18446744073709551616 18446744073709551616) -> va_in_p:(va_int_range
1361129467683753853853498429727072845819 136112... | let va_lemma_Poly1305_blocks_body0 va_b0 va_s0 va_old va_in_ctx_b va_in_h_in va_in_inp_b
va_in_length va_in_n va_in_p va_in_r va_in_h va_in_word_index =
let va_old = va_expand_state va_old in
let (va_mods:va_mods_t) = [va_Mod_reg64 rRsi; va_Mod_reg64 rRdx; va_Mod_reg64 rRbx; va_Mod_reg64
rRbp; va_Mod_reg64 rR... | {
"file_name": "obj/Vale.Poly1305.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 31,
"end_line": 905,
"start_col": 0,
"start_line": 822
} | module Vale.Poly1305.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.Poly1305.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": null
},
{
"abbrev": false,
... | {
"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... | false |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
va_old: Vale.X64.Decls.va_state ->
va_in_ctx_b: Vale.X64.Memory.buffer64 ->
va_in_h_in: Prims.int ->
va_in_inp_b: Vale.X64.Memory.buffer64 ->
va_in_length: Prims.int ->
va_in_n: Vale.X64.Decls.va_int_range 18446744073709... | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.Memory.buffer64",
"Prims.int",
"Vale.X64.Decls.va_int_range",
"Prims.nat",
"Vale.X64.QuickCodes.fuel",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.Mktuple4",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.tuple4",
... | [] | false | false | false | false | false | let va_lemma_Poly1305_blocks_body0
va_b0
va_s0
va_old
va_in_ctx_b
va_in_h_in
va_in_inp_b
va_in_length
va_in_n
va_in_p
va_in_r
va_in_h
va_in_word_index
=
| let va_old = va_expand_state va_old in
let va_mods:va_mods_t =
[
va_Mod_reg64 rRsi; va_Mod_reg64 rRdx; va_Mod_reg64 rRbx; va_Mod_reg64 rRbp; va_Mod_reg64 rRax;
va_Mod_reg64 rR9; va_Mod_reg64 rR8; va_Mod_reg64 rR15; va_Mod_reg64 rR14; va_Mod_reg64 rR10;
va_Mod_ok; va_Mod_flags
]
in
let va_qc =
va_qcode... | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.pow2_double_mult | val pow2_double_mult: n:nat -> Lemma (2 * pow2 n = pow2 (n + 1)) | val pow2_double_mult: n:nat -> Lemma (2 * pow2 n = pow2 (n + 1)) | let pow2_double_mult n = pow2_double_sum n | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 42,
"end_line": 229,
"start_col": 0,
"start_line": 229
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 0,
"max_fuel": 1,
"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... | false | n: Prims.nat -> FStar.Pervasives.Lemma (ensures 2 * Prims.pow2 n = Prims.pow2 (n + 1)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"FStar.Math.Lemmas.pow2_double_sum",
"Prims.unit"
] | [] | true | false | true | false | false | let pow2_double_mult n =
| pow2_double_sum n | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.pow2_lt_compat | val pow2_lt_compat: n:nat -> m:nat -> Lemma
(requires (m < n))
(ensures (pow2 m < pow2 n))
(decreases m) | val pow2_lt_compat: n:nat -> m:nat -> Lemma
(requires (m < n))
(ensures (pow2 m < pow2 n))
(decreases m) | let rec pow2_lt_compat n m =
match m with
| 0 -> ()
| _ -> pow2_lt_compat (n-1) (m-1) | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 35,
"end_line": 238,
"start_col": 0,
"start_line": 235
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 0,
"max_fuel": 1,
"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... | false | n: Prims.nat -> m: Prims.nat
-> FStar.Pervasives.Lemma (requires m < n) (ensures Prims.pow2 m < Prims.pow2 n) (decreases m) | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.nat",
"Prims.int",
"FStar.Math.Lemmas.pow2_lt_compat",
"Prims.op_Subtraction",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec pow2_lt_compat n m =
| match m with
| 0 -> ()
| _ -> pow2_lt_compat (n - 1) (m - 1) | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.pow2_le_compat | val pow2_le_compat: n:nat -> m:nat -> Lemma
(requires (m <= n))
(ensures (pow2 m <= pow2 n)) | val pow2_le_compat: n:nat -> m:nat -> Lemma
(requires (m <= n))
(ensures (pow2 m <= pow2 n)) | let pow2_le_compat n m =
if m < n then pow2_lt_compat n m | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 245,
"start_col": 0,
"start_line": 244
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | n: Prims.nat -> m: Prims.nat
-> FStar.Pervasives.Lemma (requires m <= n) (ensures Prims.pow2 m <= Prims.pow2 n) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"Prims.op_LessThan",
"FStar.Math.Lemmas.pow2_lt_compat",
"Prims.bool",
"Prims.unit"
] | [] | false | false | true | false | false | let pow2_le_compat n m =
| if m < n then pow2_lt_compat n m | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.lemma_div_lt_nat | val lemma_div_lt_nat: a:int -> n:nat -> m:nat{m <= n} ->
Lemma (requires (a < pow2 n))
(ensures (a / pow2 m < pow2 (n-m))) | val lemma_div_lt_nat: a:int -> n:nat -> m:nat{m <= n} ->
Lemma (requires (a < pow2 n))
(ensures (a / pow2 m < pow2 (n-m))) | let lemma_div_lt_nat a n m =
lemma_div_mod a (pow2 m);
assert(a = pow2 m * (a / pow2 m) + a % pow2 m);
pow2_plus m (n-m);
assert(pow2 n = pow2 m * pow2 (n - m)) | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 40,
"end_line": 286,
"start_col": 0,
"start_line": 282
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> n: Prims.nat -> m: Prims.nat{m <= n}
-> FStar.Pervasives.Lemma (requires a < Prims.pow2 n)
(ensures a / Prims.pow2 m < Prims.pow2 (n - m)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims._assert",
"Prims.op_Equality",
"Prims.pow2",
"FStar.Mul.op_Star",
"Prims.op_Subtraction",
"Prims.unit",
"FStar.Math.Lemmas.pow2_plus",
"Prims.op_Addition",
"Prims.op_Division",
"Prims.op_Modulus",
"FStar.Math.Lemma... | [] | true | false | true | false | false | let lemma_div_lt_nat a n m =
| lemma_div_mod a (pow2 m);
assert (a = pow2 m * (a / pow2 m) + a % pow2 m);
pow2_plus m (n - m);
assert (pow2 n = pow2 m * pow2 (n - m)) | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.pow2_minus | val pow2_minus: n:nat -> m:nat{ n >= m } -> Lemma
((pow2 n) / (pow2 m) = pow2 (n - m)) | val pow2_minus: n:nat -> m:nat{ n >= m } -> Lemma
((pow2 n) / (pow2 m) = pow2 (n - m)) | let pow2_minus n m =
pow2_plus (n - m) m;
slash_star_axiom (pow2 (n - m)) (pow2 m) (pow2 n) | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 51,
"end_line": 262,
"start_col": 0,
"start_line": 260
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | n: Prims.nat -> m: Prims.nat{n >= m}
-> FStar.Pervasives.Lemma (ensures Prims.pow2 n / Prims.pow2 m = Prims.pow2 (n - m)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"FStar.Math.Lib.slash_star_axiom",
"Prims.pow2",
"Prims.op_Subtraction",
"Prims.unit",
"FStar.Math.Lemmas.pow2_plus"
] | [] | true | false | true | false | false | let pow2_minus n m =
| pow2_plus (n - m) m;
slash_star_axiom (pow2 (n - m)) (pow2 m) (pow2 n) | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.pow2_plus | val pow2_plus: n:nat -> m:nat -> Lemma
(ensures (pow2 n * pow2 m = pow2 (n + m)))
(decreases n) | val pow2_plus: n:nat -> m:nat -> Lemma
(ensures (pow2 n * pow2 m = pow2 (n + m)))
(decreases n) | let rec pow2_plus n m =
match n with
| 0 -> ()
| _ -> pow2_plus (n - 1) m | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 28,
"end_line": 254,
"start_col": 0,
"start_line": 251
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 0,
"max_fuel": 1,
"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... | false | n: Prims.nat -> m: Prims.nat
-> FStar.Pervasives.Lemma (ensures Prims.pow2 n * Prims.pow2 m = Prims.pow2 (n + m)) (decreases n) | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.nat",
"Prims.int",
"FStar.Math.Lemmas.pow2_plus",
"Prims.op_Subtraction",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec pow2_plus n m =
| match n with
| 0 -> ()
| _ -> pow2_plus (n - 1) m | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.lemma_div_lt | val lemma_div_lt (a:int) (n:nat) (m:nat) : Lemma
(requires m <= n /\ a < pow2 n)
(ensures a / pow2 m < pow2 (n-m)) | val lemma_div_lt (a:int) (n:nat) (m:nat) : Lemma
(requires m <= n /\ a < pow2 n)
(ensures a / pow2 m < pow2 (n-m)) | let lemma_div_lt a n m =
if a >= 0 then lemma_div_lt_nat a n m | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 39,
"end_line": 292,
"start_col": 0,
"start_line": 291
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> n: Prims.nat -> m: Prims.nat
-> FStar.Pervasives.Lemma (requires m <= n /\ a < Prims.pow2 n)
(ensures a / Prims.pow2 m < Prims.pow2 (n - m)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.nat",
"Prims.op_GreaterThanOrEqual",
"FStar.Math.Lemmas.lemma_div_lt_nat",
"Prims.bool",
"Prims.unit"
] | [] | false | false | true | false | false | let lemma_div_lt a n m =
| if a >= 0 then lemma_div_lt_nat a n m | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.lt_multiple_is_equal | val lt_multiple_is_equal (a:nat) (b:nat) (x:int) (n:nonzero) : Lemma
(requires a < n /\ b < n /\ a == b + x * n)
(ensures a == b /\ x == 0) | val lt_multiple_is_equal (a:nat) (b:nat) (x:int) (n:nonzero) : Lemma
(requires a < n /\ b < n /\ a == b + x * n)
(ensures a == b /\ x == 0) | let lt_multiple_is_equal a b x n =
assert (0 * n == 0);
bounded_multiple_is_zero x n | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 30,
"end_line": 310,
"start_col": 0,
"start_line": 308
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.nat -> b: Prims.nat -> x: Prims.int -> n: Prims.nonzero
-> FStar.Pervasives.Lemma (requires a < n /\ b < n /\ a == b + x * n) (ensures a == b /\ x == 0) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"Prims.int",
"Prims.nonzero",
"FStar.Math.Lemmas.bounded_multiple_is_zero",
"Prims.unit",
"Prims._assert",
"Prims.eq2",
"FStar.Mul.op_Star"
] | [] | true | false | true | false | false | let lt_multiple_is_equal a b x n =
| assert (0 * n == 0);
bounded_multiple_is_zero x n | false |
Vale.Poly1305.X64.fst | Vale.Poly1305.X64.va_qcode_Poly1305_reduce_last | val va_qcode_Poly1305_reduce_last (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Poly1305_reduce_last ())) | val va_qcode_Poly1305_reduce_last (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Poly1305_reduce_last ())) | let va_qcode_Poly1305_reduce_last (va_mods:va_mods_t) : (va_quickCode unit
(va_code_Poly1305_reduce_last ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let (h:Prims.int) =
Vale.Poly1305.Math.lowerUpper192 (Vale.Poly1305.Math.lowerUpper128 (va_get_reg64 rR14 va_s)
(va_get_re... | {
"file_name": "obj/Vale.Poly1305.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 30,
"end_line": 2129,
"start_col": 0,
"start_line": 2071
} | module Vale.Poly1305.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.Poly1305.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": null
},
{
"abbrev": false,
... | {
"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... | false | va_mods: Vale.X64.QuickCode.va_mods_t
-> Vale.X64.QuickCode.va_quickCode Prims.unit (Vale.Poly1305.X64.va_code_Poly1305_reduce_last ()) | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.QuickCode.va_mods_t",
"Vale.X64.QuickCodes.qblock",
"Prims.unit",
"Prims.Cons",
"Vale.X64.Decls.va_code",
"Vale.X64.InsBasic.va_code_Mov64",
"Vale.X64.Decls.va_op_dst_opr64_reg64",
"Vale.X64.Machine_s.rR8",
"Vale.X64.Decls.va_op_opr64_reg64",
"Vale.X64.Machine_s.rR14",
"Vale.X64.Machin... | [] | false | false | false | false | false | let va_qcode_Poly1305_reduce_last (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Poly1305_reduce_last ())) =
| (qblock va_mods
(fun (va_s: va_state) ->
let va_old_s:va_state = va_s in
let h:Prims.int =
Vale.Poly1305.Math.lowerUpper192 (Vale.Poly1305.Math.lowerUpper128 (va_get_reg64 rR14 va_s
)
(va_get_reg64 rRbx va_s))
(va_get_reg64 rRbp va_s)
in
... | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.lemma_div_mod_plus | val lemma_div_mod_plus (a k: int) (n: pos)
: Lemma ((a + k * n) / n = a / n + k /\ (a + k * n) % n = a % n) | val lemma_div_mod_plus (a k: int) (n: pos)
: Lemma ((a + k * n) / n = a / n + k /\ (a + k * n) % n = a % n) | let lemma_div_mod_plus (a:int) (k:int) (n:pos) : Lemma ((a + k * n) / n = a / n + k /\
(a + k * n) % n = a % n) =
lemma_div_plus a k n;
lemma_mod_plus a k n | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 345,
"start_col": 0,
"start_line": 342
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> k: Prims.int -> n: Prims.pos
-> FStar.Pervasives.Lemma (ensures (a + k * n) / n = a / n + k /\ (a + k * n) % n = a % n) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Math.Lemmas.lemma_mod_plus",
"Prims.unit",
"FStar.Math.Lemmas.lemma_div_plus",
"Prims.l_True",
"Prims.squash",
"Prims.l_and",
"Prims.b2t",
"Prims.op_Equality",
"Prims.op_Division",
"Prims.op_Addition",
"FStar.Mul.op_Star",
"Prims.op_Modulus",
"Prims.Nil",... | [] | true | false | true | false | false | let lemma_div_mod_plus (a k: int) (n: pos)
: Lemma ((a + k * n) / n = a / n + k /\ (a + k * n) % n = a % n) =
| lemma_div_plus a k n;
lemma_mod_plus a k n | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.add_div_mod_1 | val add_div_mod_1 (a:int) (n:pos) : Lemma ((a + n) % n == a % n /\ (a + n) / n == a / n + 1) | val add_div_mod_1 (a:int) (n:pos) : Lemma ((a + n) % n == a % n /\ (a + n) / n == a / n + 1) | let add_div_mod_1 a n =
lemma_mod_plus a 1 n;
lemma_div_plus a 1 n | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 350,
"start_col": 0,
"start_line": 348
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> n: Prims.pos
-> FStar.Pervasives.Lemma (ensures (a + n) % n == a % n /\ (a + n) / n == a / n + 1) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Math.Lemmas.lemma_div_plus",
"Prims.unit",
"FStar.Math.Lemmas.lemma_mod_plus"
] | [] | true | false | true | false | false | let add_div_mod_1 a n =
| lemma_mod_plus a 1 n;
lemma_div_plus a 1 n | false |
Vale.Poly1305.X64.fst | Vale.Poly1305.X64.va_code_Poly1305_impl | val va_code_Poly1305_impl : va_dummy:unit -> Tot va_code | val va_code_Poly1305_impl : va_dummy:unit -> Tot va_code | let va_code_Poly1305_impl () =
(va_Block (va_CCons (va_code_Load64_buffer (va_op_heaplet_mem_heaplet 1) (va_op_dst_opr64_reg64
rR11) (va_op_reg_opr64_reg64 rRdi) 24 Public) (va_CCons (va_code_Load64_buffer
(va_op_heaplet_mem_heaplet 1) (va_op_dst_opr64_reg64 rR12) (va_op_reg_opr64_reg64 rRdi) 32
Public) (... | {
"file_name": "obj/Vale.Poly1305.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 34,
"end_line": 2348,
"start_col": 0,
"start_line": 2315
} | module Vale.Poly1305.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.Poly1305.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": null
},
{
"abbrev": false,
... | {
"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... | false | va_dummy: Prims.unit -> Vale.X64.Decls.va_code | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"Vale.X64.Decls.va_Block",
"Vale.X64.Decls.va_CCons",
"Vale.X64.InsMem.va_code_Load64_buffer",
"Vale.X64.Decls.va_op_heaplet_mem_heaplet",
"Vale.X64.Decls.va_op_dst_opr64_reg64",
"Vale.X64.Machine_s.rR11",
"Vale.X64.Decls.va_op_reg_opr64_reg64",
"Vale.X64.Machine_s.rRdi",
"Vale.Arch.... | [] | false | false | false | true | false | let va_code_Poly1305_impl () =
| (va_Block (va_CCons (va_code_Load64_buffer (va_op_heaplet_mem_heaplet 1)
(va_op_dst_opr64_reg64 rR11)
(va_op_reg_opr64_reg64 rRdi)
24
Public)
(va_CCons (va_code_Load64_buffer (va_op_heaplet_mem_heaplet 1)
(va_op_dst_opr64_reg64 rR12)
... | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.cancel_mul_mod | val cancel_mul_mod (a:int) (n:pos) : Lemma ((a * n) % n == 0) | val cancel_mul_mod (a:int) (n:pos) : Lemma ((a * n) % n == 0) | let cancel_mul_mod (a:int) (n:pos) =
small_mod 0 n;
lemma_mod_plus 0 a n | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 22,
"end_line": 367,
"start_col": 0,
"start_line": 365
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> n: Prims.pos -> FStar.Pervasives.Lemma (ensures a * n % n == 0) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Math.Lemmas.lemma_mod_plus",
"Prims.unit",
"FStar.Math.Lemmas.small_mod"
] | [] | true | false | true | false | false | let cancel_mul_mod (a: int) (n: pos) =
| small_mod 0 n;
lemma_mod_plus 0 a n | false |
Vale.Poly1305.X64.fst | Vale.Poly1305.X64.va_lemma_Poly1305_add_key_s | val va_lemma_Poly1305_add_key_s : va_b0:va_code -> va_s0:va_state
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Poly1305_add_key_s ()) va_s0 /\ va_get_ok va_s0))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
(let (h_in:Vale.Def.Words_s... | val va_lemma_Poly1305_add_key_s : va_b0:va_code -> va_s0:va_state
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Poly1305_add_key_s ()) va_s0 /\ va_get_ok va_s0))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
(let (h_in:Vale.Def.Words_s... | let va_lemma_Poly1305_add_key_s va_b0 va_s0 =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_reg64 rRbx; va_Mod_reg64 rR14; va_Mod_ok] in
let va_qc = va_qcode_Poly1305_add_key_s va_mods in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_Poly1305_add_key_s ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> le... | {
"file_name": "obj/Vale.Poly1305.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 2271,
"start_col": 0,
"start_line": 2256
} | module Vale.Poly1305.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.Poly1305.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": null
},
{
"abbrev": false,
... | {
"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... | false | va_b0: Vale.X64.Decls.va_code -> va_s0: Vale.X64.Decls.va_state
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.v... | [] | false | false | false | false | false | let va_lemma_Poly1305_add_key_s va_b0 va_s0 =
| let va_mods:va_mods_t = [va_Mod_flags; va_Mod_reg64 rRbx; va_Mod_reg64 rR14; va_Mod_ok] in
let va_qc = va_qcode_Poly1305_add_key_s va_mods in
let va_sM, va_fM, va_g =
va_wp_sound_code_norm (va_code_Poly1305_add_key_s ())
va_qc
va_s0
(fun va_s0 va_sM va_g ->
let () = va_g in
label va_range1... | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.lemma_mod_sub_distr | val lemma_mod_sub_distr (a:int) (b:int) (n:pos) : Lemma ((a - b % n) % n = (a - b) % n) | val lemma_mod_sub_distr (a:int) (b:int) (n:pos) : Lemma ((a - b % n) % n = (a - b) % n) | let lemma_mod_sub_distr (a:int) (b:int) (n:pos) =
calc (==) {
(a - b%n) % n;
== { lemma_mod_plus (a - (b % n)) (-(b / n)) n }
(a - b%n + n * (-(b/n))) % n;
== { neg_mul_right n (b/n) }
(a - b%n - n * (b/n)) % n;
== { lemma_div_mod b n }
(a - b) % n;
} | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 389,
"start_col": 0,
"start_line": 380
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int -> n: Prims.pos
-> FStar.Pervasives.Lemma (ensures (a - b % n) % n = (a - b) % n) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Prims.op_Modulus",
"Prims.op_Subtraction",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"FStar.Mul.op_Star",
"Prims.op_Division",
"Prims.op_Addition",
"Prims.op_Minus",
"FSt... | [] | false | false | true | false | false | let lemma_mod_sub_distr (a b: int) (n: pos) =
| calc ( == ) {
(a - b % n) % n;
( == ) { lemma_mod_plus (a - (b % n)) (- (b / n)) n }
(a - b % n + n * (- (b / n))) % n;
( == ) { neg_mul_right n (b / n) }
(a - b % n - n * (b / n)) % n;
( == ) { lemma_div_mod b n }
(a - b) % n;
} | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.lemma_mod_mul_distr_r | val lemma_mod_mul_distr_r (a:int) (b:int) (n:pos) : Lemma ((a * b) % n = (a * (b % n)) % n) | val lemma_mod_mul_distr_r (a:int) (b:int) (n:pos) : Lemma ((a * b) % n = (a * (b % n)) % n) | let lemma_mod_mul_distr_r (a:int) (b:int) (n:pos) =
calc (==) {
(a * b) % n;
== { swap_mul a b }
(b * a) % n;
== { lemma_mod_mul_distr_l b a n }
(b%n * a) % n;
== { swap_mul a (b%n) }
(a * (b%n)) % n;
} | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 435,
"start_col": 0,
"start_line": 426
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int -> n: Prims.pos
-> FStar.Pervasives.Lemma (ensures a * b % n = a * (b % n) % n) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Prims.op_Modulus",
"FStar.Mul.op_Star",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"FStar.Calc.calc_init",
"FStar.Calc.calc_pack",
"FStar.Math.Lemmas.swap_mul",
"Prims.squas... | [] | false | false | true | false | false | let lemma_mod_mul_distr_r (a b: int) (n: pos) =
| calc ( == ) {
(a * b) % n;
( == ) { swap_mul a b }
(b * a) % n;
( == ) { lemma_mod_mul_distr_l b a n }
((b % n) * a) % n;
( == ) { swap_mul a (b % n) }
(a * (b % n)) % n;
} | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.lemma_mod_sub_1 | val lemma_mod_sub_1: a:pos -> b:pos{a < b} -> Lemma ((-a) % b = b - (a%b)) | val lemma_mod_sub_1: a:pos -> b:pos{a < b} -> Lemma ((-a) % b = b - (a%b)) | let lemma_mod_sub_1 a b =
calc (==) {
(-a) % b;
== { lemma_mod_plus (-a) 1 b }
((-a) + 1*b) % b;
== {}
(b - a) % b;
== { small_mod (b-a) b }
b - a;
== { small_mod a b }
b - a%b;
} | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 406,
"start_col": 0,
"start_line": 395
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.pos -> b: Prims.pos{a < b} -> FStar.Pervasives.Lemma (ensures (- a) % b = b - a % b) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Calc.calc_finish",
"Prims.int",
"Prims.eq2",
"Prims.op_Modulus",
"Prims.op_Minus",
"Prims.op_Subtraction",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"Prims.op_Addition",
"FStar.Mul.o... | [] | false | false | true | false | false | let lemma_mod_sub_1 a b =
| calc ( == ) {
(- a) % b;
( == ) { lemma_mod_plus (- a) 1 b }
((- a) + 1 * b) % b;
( == ) { () }
(b - a) % b;
( == ) { small_mod (b - a) b }
b - a;
( == ) { small_mod a b }
b - a % b;
} | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.sub_div_mod_1 | val sub_div_mod_1 (a:int) (n:pos) : Lemma ((a - n) % n == a % n /\ (a - n) / n == a / n - 1) | val sub_div_mod_1 (a:int) (n:pos) : Lemma ((a - n) % n == a % n /\ (a - n) / n == a / n - 1) | let sub_div_mod_1 a n =
lemma_mod_plus a (-1) n;
lemma_div_plus a (-1) n | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 355,
"start_col": 0,
"start_line": 353
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> n: Prims.pos
-> FStar.Pervasives.Lemma (ensures (a - n) % n == a % n /\ (a - n) / n == a / n - 1) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Math.Lemmas.lemma_div_plus",
"Prims.op_Minus",
"Prims.unit",
"FStar.Math.Lemmas.lemma_mod_plus"
] | [] | true | false | true | false | false | let sub_div_mod_1 a n =
| lemma_mod_plus a (- 1) n;
lemma_div_plus a (- 1) n | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.lemma_mod_plus | val lemma_mod_plus (a:int) (k:int) (n:pos) : Lemma ((a + k * n) % n = a % n) | val lemma_mod_plus (a:int) (k:int) (n:pos) : Lemma ((a + k * n) % n = a % n) | let lemma_mod_plus (a:int) (k:int) (n:pos) =
calc (==) {
(a+k*n)%n - a%n;
== { lemma_div_mod a n; lemma_div_mod (a+k*n) n }
((a + k*n) - n*((a + k*n)/n)) - (a - n*(a/n));
== {}
n*k + n*(a/n) - n*((a + k*n)/n);
== { distributivity_add_right n k (a/n);
distributivity_sub_right n (k + a/... | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 4,
"end_line": 325,
"start_col": 0,
"start_line": 313
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> k: Prims.int -> n: Prims.pos
-> FStar.Pervasives.Lemma (ensures (a + k * n) % n = a % n) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"Prims.unit",
"FStar.Math.Lemmas.lt_multiple_is_equal",
"Prims.op_Modulus",
"Prims.op_Addition",
"FStar.Mul.op_Star",
"Prims.op_Subtraction",
"Prims.op_Division",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"FStar... | [] | false | false | true | false | false | let lemma_mod_plus (a k: int) (n: pos) =
| calc ( == ) {
(a + k * n) % n - a % n;
( == ) { (lemma_div_mod a n;
lemma_div_mod (a + k * n) n) }
((a + k * n) - n * ((a + k * n) / n)) - (a - n * (a / n));
( == ) { () }
n * k + n * (a / n) - n * ((a + k * n) / n);
( == ) { (distributivity_add_right n k (a / n);
distributivity_sub_right n (k + a /... | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.lemma_mod_add_distr | val lemma_mod_add_distr (a:int) (b:int) (n:pos) : Lemma ((a + b % n) % n = (a + b) % n) | val lemma_mod_add_distr (a:int) (b:int) (n:pos) : Lemma ((a + b % n) % n = (a + b) % n) | let lemma_mod_add_distr (a:int) (b:int) (n:pos) =
calc (==) {
(a + b%n) % n;
== { lemma_mod_plus (a + (b % n)) (b / n) n }
(a + b%n + n * (b/n)) % n;
== { lemma_div_mod b n }
(a + b) % n;
} | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 377,
"start_col": 0,
"start_line": 370
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int -> n: Prims.pos
-> FStar.Pervasives.Lemma (ensures (a + b % n) % n = (a + b) % n) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Prims.op_Modulus",
"Prims.op_Addition",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"FStar.Mul.op_Star",
"Prims.op_Division",
"FStar.Calc.calc_init",
"FStar.Calc.calc_pack",
... | [] | false | false | true | false | false | let lemma_mod_add_distr (a b: int) (n: pos) =
| calc ( == ) {
(a + b % n) % n;
( == ) { lemma_mod_plus (a + (b % n)) (b / n) n }
(a + b % n + n * (b / n)) % n;
( == ) { lemma_div_mod b n }
(a + b) % n;
} | false |
Vale.Poly1305.X64.fst | Vale.Poly1305.X64.va_lemma_Poly1305_reduce_last | val va_lemma_Poly1305_reduce_last : va_b0:va_code -> va_s0:va_state
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Poly1305_reduce_last ()) va_s0 /\ va_get_ok va_s0 /\
(let (h:Prims.int) = Vale.Poly1305.Math.lowerUpper192 (Vale.Poly1305.Math.lowerUpper128
(va_get_reg64 rR14 va_s0) ... | val va_lemma_Poly1305_reduce_last : va_b0:va_code -> va_s0:va_state
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Poly1305_reduce_last ()) va_s0 /\ va_get_ok va_s0 /\
(let (h:Prims.int) = Vale.Poly1305.Math.lowerUpper192 (Vale.Poly1305.Math.lowerUpper128
(va_get_reg64 rR14 va_s0) ... | let va_lemma_Poly1305_reduce_last va_b0 va_s0 =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_reg64 rRbp; va_Mod_reg64 rRbx; va_Mod_reg64 rR14;
va_Mod_reg64 rRax; va_Mod_reg64 rR10; va_Mod_reg64 rR9; va_Mod_reg64 rR8; va_Mod_ok] in
let va_qc = va_qcode_Poly1305_reduce_last va_mods in
let (va_sM, va_fM, va_g... | {
"file_name": "obj/Vale.Poly1305.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 2164,
"start_col": 0,
"start_line": 2147
} | module Vale.Poly1305.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.Poly1305.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": null
},
{
"abbrev": false,
... | {
"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... | false | va_b0: Vale.X64.Decls.va_code -> va_s0: Vale.X64.Decls.va_state
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.v... | [] | false | false | false | false | false | let va_lemma_Poly1305_reduce_last va_b0 va_s0 =
| let va_mods:va_mods_t =
[
va_Mod_flags;
va_Mod_reg64 rRbp;
va_Mod_reg64 rRbx;
va_Mod_reg64 rR14;
va_Mod_reg64 rRax;
va_Mod_reg64 rR10;
va_Mod_reg64 rR9;
va_Mod_reg64 rR8;
va_Mod_ok
]
in
let va_qc = va_qcode_Poly1305_reduce_last va_mods in
let va_sM, va_fM, va_g =
va_wp_sound_co... | false |
Vale.Poly1305.X64.fst | Vale.Poly1305.X64.va_lemma_Poly1305_blocks | val va_lemma_Poly1305_blocks : va_b0:va_code -> va_s0:va_state -> r:int -> h_in:int ->
ctx_b:buffer64 -> inp_b:buffer64
-> Ghost (va_state & va_fuel & int)
(requires (va_require_total va_b0 (va_code_Poly1305_blocks ()) va_s0 /\ va_get_ok va_s0 /\ (let
(n:(va_int_range 18446744073709551616 18446744073709551616... | val va_lemma_Poly1305_blocks : va_b0:va_code -> va_s0:va_state -> r:int -> h_in:int ->
ctx_b:buffer64 -> inp_b:buffer64
-> Ghost (va_state & va_fuel & int)
(requires (va_require_total va_b0 (va_code_Poly1305_blocks ()) va_s0 /\ va_get_ok va_s0 /\ (let
(n:(va_int_range 18446744073709551616 18446744073709551616... | let va_lemma_Poly1305_blocks va_b0 va_s0 r h_in ctx_b inp_b =
let (va_mods:va_mods_t) = [va_Mod_mem_heaplet 1; va_Mod_flags; va_Mod_reg64 rR15; va_Mod_reg64
rRax; va_Mod_reg64 rRbp; va_Mod_reg64 rRbx; va_Mod_reg64 rR14; va_Mod_reg64 rR13; va_Mod_reg64
rR12; va_Mod_reg64 rR11; va_Mod_reg64 rR10; va_Mod_reg64 r... | {
"file_name": "obj/Vale.Poly1305.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 19,
"end_line": 1572,
"start_col": 0,
"start_line": 1503
} | module Vale.Poly1305.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.Poly1305.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": null
},
{
"abbrev": false,
... | {
"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... | false |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
r: Prims.int ->
h_in: Prims.int ->
ctx_b: Vale.X64.Memory.buffer64 ->
inp_b: Vale.X64.Memory.buffer64
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.int) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Prims.int",
"Vale.X64.Memory.buffer64",
"Vale.X64.QuickCodes.fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.X64.Decls.va_fuel",
"Prims.unit",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.Qui... | [] | false | false | false | false | false | let va_lemma_Poly1305_blocks va_b0 va_s0 r h_in ctx_b inp_b =
| let va_mods:va_mods_t =
[
va_Mod_mem_heaplet 1; va_Mod_flags; va_Mod_reg64 rR15; va_Mod_reg64 rRax; va_Mod_reg64 rRbp;
va_Mod_reg64 rRbx; va_Mod_reg64 rR14; va_Mod_reg64 rR13; va_Mod_reg64 rR12; va_Mod_reg64 rR11;
va_Mod_reg64 rR10; va_Mod_reg64 rR9; va_Mod_reg64 rR8; va_Mod_reg64 rRdx; va_Mod_reg64 rRsi;... | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.lemma_mod_plus_distr_l | val lemma_mod_plus_distr_l: a:int -> b:int -> p:pos -> Lemma
((a + b) % p = ((a % p) + b) % p) | val lemma_mod_plus_distr_l: a:int -> b:int -> p:pos -> Lemma
((a + b) % p = ((a % p) + b) % p) | let lemma_mod_plus_distr_l a b p =
let q = (a - (a % p)) / p in
lemma_mod_spec2 a p;
lemma_mod_plus (a % p + b) q p | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 485,
"start_col": 0,
"start_line": 482
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int -> p: Prims.pos
-> FStar.Pervasives.Lemma (ensures (a + b) % p = (a % p + b) % p) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Math.Lemmas.lemma_mod_plus",
"Prims.op_Addition",
"Prims.op_Modulus",
"Prims.unit",
"FStar.Math.Lemmas.lemma_mod_spec2",
"Prims.op_Division",
"Prims.op_Subtraction"
] | [] | true | false | true | false | false | let lemma_mod_plus_distr_l a b p =
| let q = (a - (a % p)) / p in
lemma_mod_spec2 a p;
lemma_mod_plus (a % p + b) q p | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.lemma_mod_mul_distr_l | val lemma_mod_mul_distr_l (a:int) (b:int) (n:pos) : Lemma
(requires True)
(ensures (a * b) % n = ((a % n) * b) % n) | val lemma_mod_mul_distr_l (a:int) (b:int) (n:pos) : Lemma
(requires True)
(ensures (a * b) % n = ((a % n) * b) % n) | let lemma_mod_mul_distr_l a b n =
calc (==) {
(a * b) % n;
== { lemma_div_mod a n }
((n * (a/n) + a%n) * b) % n;
== { distributivity_add_left (n * (a/n)) (a%n) b }
(n * (a/n) * b + (a%n) * b) % n;
== { paren_mul_right n (a/n) b; swap_mul ((a/n) * b) n }
((a%n) * b + ((a/n) * b) * n) % ... | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 423,
"start_col": 0,
"start_line": 412
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int -> n: Prims.pos
-> FStar.Pervasives.Lemma (ensures a * b % n = (a % n) * b % n) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Prims.op_Modulus",
"FStar.Mul.op_Star",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"Prims.op_Addition",
"Prims.op_Division",
"FStar.Calc.calc_init",
"FStar.Calc.calc_pack",
... | [] | false | false | true | false | false | let lemma_mod_mul_distr_l a b n =
| calc ( == ) {
(a * b) % n;
( == ) { lemma_div_mod a n }
((n * (a / n) + a % n) * b) % n;
( == ) { distributivity_add_left (n * (a / n)) (a % n) b }
((n * (a / n)) * b + (a % n) * b) % n;
( == ) { (paren_mul_right n (a / n) b;
swap_mul ((a / n) * b) n) }
((a % n) * b + ((a / n) * b) * n) % n;
( == ) ... | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.small_division_lemma_2 | val small_division_lemma_2 (a:int) (n:pos) : Lemma
(requires a / n = 0)
(ensures 0 <= a /\ a < n) | val small_division_lemma_2 (a:int) (n:pos) : Lemma
(requires a / n = 0)
(ensures 0 <= a /\ a < n) | let small_division_lemma_2 (a:int) (n:pos) = lemma_div_mod a n | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 529,
"start_col": 0,
"start_line": 529
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> n: Prims.pos
-> FStar.Pervasives.Lemma (requires a / n = 0) (ensures 0 <= a /\ a < n) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Math.Lemmas.lemma_div_mod",
"Prims.unit"
] | [] | true | false | true | false | false | let small_division_lemma_2 (a: int) (n: pos) =
| lemma_div_mod a n | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.lemma_div_plus | val lemma_div_plus (a:int) (k:int) (n:pos) : Lemma ((a + k * n) / n = a / n + k) | val lemma_div_plus (a:int) (k:int) (n:pos) : Lemma ((a + k * n) / n = a / n + k) | let lemma_div_plus (a:int) (k:int) (n:pos) =
calc (==) {
n * ((a+k*n)/n - a/n);
== { distributivity_sub_right n ((a+k*n)/n) (a/n) }
n * ((a+k*n)/n) - n*(a/n);
== { lemma_div_mod (a+k*n) n; lemma_div_mod a n }
(a + k*n - (a+k*n)%n) - (a - a%n);
== {}
k*n - (a+k*n)%n + a%n;
== { lemma_mo... | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 40,
"end_line": 340,
"start_col": 0,
"start_line": 328
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> k: Prims.int -> n: Prims.pos
-> FStar.Pervasives.Lemma (ensures (a + k * n) / n = a / n + k) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Math.Lemmas.lemma_cancel_mul",
"Prims.op_Subtraction",
"Prims.op_Division",
"Prims.op_Addition",
"FStar.Mul.op_Star",
"Prims.unit",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"FStar.Calc.calc_step",
"Prims... | [] | false | false | true | false | false | let lemma_div_plus (a k: int) (n: pos) =
| calc ( == ) {
n * ((a + k * n) / n - a / n);
( == ) { distributivity_sub_right n ((a + k * n) / n) (a / n) }
n * ((a + k * n) / n) - n * (a / n);
( == ) { (lemma_div_mod (a + k * n) n;
lemma_div_mod a n) }
(a + k * n - (a + k * n) % n) - (a - a % n);
( == ) { () }
k * n - (a + k * n) % n + a % n;
( ... | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.div_exact_r | val div_exact_r (a:int) (n:pos) : Lemma
(requires (a % n = 0))
(ensures (a = (a / n) * n)) | val div_exact_r (a:int) (n:pos) : Lemma
(requires (a % n = 0))
(ensures (a = (a / n) * n)) | let div_exact_r (a:int) (n:pos) = lemma_div_exact a n | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 455,
"start_col": 0,
"start_line": 455
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> n: Prims.pos
-> FStar.Pervasives.Lemma (requires a % n = 0) (ensures a = (a / n) * n) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Math.Lemmas.lemma_div_exact",
"Prims.unit"
] | [] | true | false | true | false | false | let div_exact_r (a: int) (n: pos) =
| lemma_div_exact a n | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.lemma_mod_mod | val lemma_mod_mod: a:int -> b:int -> p:pos -> Lemma
(requires (a = b % p))
(ensures (a % p = b % p)) | val lemma_mod_mod: a:int -> b:int -> p:pos -> Lemma
(requires (a = b % p))
(ensures (a % p = b % p)) | let lemma_mod_mod a b p =
lemma_mod_lt b p;
modulo_lemma (b % p) p | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 497,
"start_col": 0,
"start_line": 495
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int -> p: Prims.pos
-> FStar.Pervasives.Lemma (requires a = b % p) (ensures a % p = b % p) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Math.Lemmas.modulo_lemma",
"Prims.op_Modulus",
"Prims.unit",
"FStar.Math.Lemmas.lemma_mod_lt"
] | [] | true | false | true | false | false | let lemma_mod_mod a b p =
| lemma_mod_lt b p;
modulo_lemma (b % p) p | false |
Vale.Poly1305.X64.fst | Vale.Poly1305.X64.va_quick_Poly1305_add_key_s | val va_quick_Poly1305_add_key_s: Prims.unit -> (va_quickCode unit (va_code_Poly1305_add_key_s ())) | val va_quick_Poly1305_add_key_s: Prims.unit -> (va_quickCode unit (va_code_Poly1305_add_key_s ())) | let va_quick_Poly1305_add_key_s () : (va_quickCode unit (va_code_Poly1305_add_key_s ())) =
(va_QProc (va_code_Poly1305_add_key_s ()) ([va_Mod_flags; va_Mod_reg64 rRbx; va_Mod_reg64 rR14])
va_wp_Poly1305_add_key_s va_wpProof_Poly1305_add_key_s) | {
"file_name": "obj/Vale.Poly1305.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 59,
"end_line": 2302,
"start_col": 0,
"start_line": 2300
} | module Vale.Poly1305.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.Poly1305.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": null
},
{
"abbrev": false,
... | {
"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... | false | _: Prims.unit
-> Vale.X64.QuickCode.va_quickCode Prims.unit (Vale.Poly1305.X64.va_code_Poly1305_add_key_s ()) | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"Vale.X64.QuickCode.va_QProc",
"Vale.Poly1305.X64.va_code_Poly1305_add_key_s",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_Mod_reg64",
"Vale.X64.Machine_s.rRbx",
"Vale.X64.Machine_s.rR14",
"Prims.Nil",
"Vale.Poly1305.X64.va_wp... | [] | false | false | false | false | false | let va_quick_Poly1305_add_key_s () : (va_quickCode unit (va_code_Poly1305_add_key_s ())) =
| (va_QProc (va_code_Poly1305_add_key_s ())
([va_Mod_flags; va_Mod_reg64 rRbx; va_Mod_reg64 rR14])
va_wp_Poly1305_add_key_s
va_wpProof_Poly1305_add_key_s) | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.lemma_mod_plus_distr_r | val lemma_mod_plus_distr_r: a:int -> b:int -> p:pos -> Lemma
((a + b) % p = (a + (b % p)) % p) | val lemma_mod_plus_distr_r: a:int -> b:int -> p:pos -> Lemma
((a + b) % p = (a + (b % p)) % p) | let lemma_mod_plus_distr_r a b p =
lemma_mod_plus_distr_l b a p | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 30,
"end_line": 490,
"start_col": 0,
"start_line": 489
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int -> p: Prims.pos
-> FStar.Pervasives.Lemma (ensures (a + b) % p = (a + b % p) % p) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Math.Lemmas.lemma_mod_plus_distr_l",
"Prims.unit"
] | [] | true | false | true | false | false | let lemma_mod_plus_distr_r a b p =
| lemma_mod_plus_distr_l b a p | false |
Vale.Poly1305.X64.fst | Vale.Poly1305.X64.va_wpProof_Poly1305_reduce_last | val va_wpProof_Poly1305_reduce_last : va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Poly1305_reduce_last va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Poly1305_reduce_last ())
([va_Mod_flags; va_Mod_reg6... | val va_wpProof_Poly1305_reduce_last : va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Poly1305_reduce_last va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Poly1305_reduce_last ())
([va_Mod_flags; va_Mod_reg6... | let va_wpProof_Poly1305_reduce_last va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Poly1305_reduce_last (va_code_Poly1305_reduce_last ()) va_s0 in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_reg64 rRbp va_sM (va_update_reg64
rRbx va_sM (va_update_reg64 rR14 va_sM (va_upd... | {
"file_name": "obj/Vale.Poly1305.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 2198,
"start_col": 0,
"start_line": 2189
} | module Vale.Poly1305.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.Poly1305.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": null
},
{
"abbrev": false,
... | {
"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... | false | va_s0: Vale.X64.Decls.va_state -> va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_state",
"Prims.unit",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_Mod_reg64",
"Vale.X64.Machine_s.rRbp",
"Vale.X64.Mac... | [] | false | false | false | false | false | let va_wpProof_Poly1305_reduce_last va_s0 va_k =
| let va_sM, va_f0 = va_lemma_Poly1305_reduce_last (va_code_Poly1305_reduce_last ()) va_s0 in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_flags va_sM
(va_update_reg64 rRbp
va_sM
(va_update_reg64 rRbx
va_sM
(va_update_reg64... | false |
Vale.Poly1305.X64.fst | Vale.Poly1305.X64.va_qcode_Poly1305_add_key_s | val va_qcode_Poly1305_add_key_s (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Poly1305_add_key_s ())) | val va_qcode_Poly1305_add_key_s (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Poly1305_add_key_s ())) | let va_qcode_Poly1305_add_key_s (va_mods:va_mods_t) : (va_quickCode unit
(va_code_Poly1305_add_key_s ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(h_in:Vale.Def.Words_s.nat128) = Vale.Poly1305.Math.lowerUpper128 (va_get_reg64 rR14 va_s)
(va_get_reg64 rRbx va_s) in let... | {
"file_name": "obj/Vale.Poly1305.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 52,
"end_line": 2242,
"start_col": 0,
"start_line": 2223
} | module Vale.Poly1305.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.Poly1305.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": null
},
{
"abbrev": false,
... | {
"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... | false | va_mods: Vale.X64.QuickCode.va_mods_t
-> Vale.X64.QuickCode.va_quickCode Prims.unit (Vale.Poly1305.X64.va_code_Poly1305_add_key_s ()) | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.QuickCode.va_mods_t",
"Vale.X64.QuickCodes.qblock",
"Prims.unit",
"Prims.Cons",
"Vale.X64.Decls.va_code",
"Vale.X64.InsBasic.va_code_Add64Wrap",
"Vale.X64.Decls.va_op_dst_opr64_reg64",
"Vale.X64.Machine_s.rR14",
"Vale.X64.Decls.va_op_opr64_reg64",
"Vale.X64.Machine_s.rRax",
"Vale.X64.I... | [] | false | false | false | false | false | let va_qcode_Poly1305_add_key_s (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Poly1305_add_key_s ())) =
| (qblock va_mods
(fun (va_s: va_state) ->
let va_old_s:va_state = va_s in
let h_in:Vale.Def.Words_s.nat128 =
Vale.Poly1305.Math.lowerUpper128 (va_get_reg64 rR14 va_s) (va_get_reg64 rRbx va_s)
in
let key_s:Vale.Def.Words_s.nat128 =
Vale.Poly1305.Math.lowerUpper128 (... | false |
Vale.Poly1305.X64.fst | Vale.Poly1305.X64.va_wpProof_Poly1305_add_key_s | val va_wpProof_Poly1305_add_key_s : va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Poly1305_add_key_s va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Poly1305_add_key_s ()) ([va_Mod_flags;
va_Mod_reg64 rRbx... | val va_wpProof_Poly1305_add_key_s : va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Poly1305_add_key_s va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Poly1305_add_key_s ()) ([va_Mod_flags;
va_Mod_reg64 rRbx... | let va_wpProof_Poly1305_add_key_s va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Poly1305_add_key_s (va_code_Poly1305_add_key_s ()) va_s0 in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_reg64 rRbx va_sM (va_update_reg64
rR14 va_sM (va_update_ok va_sM va_s0)))));
va_lemm... | {
"file_name": "obj/Vale.Poly1305.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 2297,
"start_col": 0,
"start_line": 2290
} | module Vale.Poly1305.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.Poly1305.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": null
},
{
"abbrev": false,
... | {
"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... | false | va_s0: Vale.X64.Decls.va_state -> va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_state",
"Prims.unit",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_Mod_reg64",
"Vale.X64.Machine_s.rRbx",
"Vale.X64.Mac... | [] | false | false | false | false | false | let va_wpProof_Poly1305_add_key_s va_s0 va_k =
| let va_sM, va_f0 = va_lemma_Poly1305_add_key_s (va_code_Poly1305_add_key_s ()) va_s0 in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_flags va_sM
(va_update_reg64 rRbx va_sM (va_update_reg64 rR14 va_sM (va_update_ok va_sM va_s0)))));
va_lemma_norm_mods ([va_Mod_flags; va_Mod_reg64 rRbx... | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.division_definition_lemma_1 | val division_definition_lemma_1: a:int -> b:pos -> m:int{a - b < m * b} ->
Lemma (m > a / b - 1) | val division_definition_lemma_1: a:int -> b:pos -> m:int{a - b < m * b} ->
Lemma (m > a / b - 1) | let division_definition_lemma_1 a b m =
if a / b - 1 < 0 then () else begin
division_propriety a b;
multiplication_order_lemma m (a / b - 1) b
end | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 548,
"start_col": 0,
"start_line": 544
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.pos -> m: Prims.int{a - b < m * b}
-> FStar.Pervasives.Lemma (ensures m > a / b - 1) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.op_Subtraction",
"FStar.Mul.op_Star",
"Prims.op_Division",
"Prims.bool",
"FStar.Math.Lemmas.multiplication_order_lemma",
"Prims.unit",
"FStar.Math.Lemmas.division_propriety"
] | [] | false | false | true | false | false | let division_definition_lemma_1 a b m =
| if a / b - 1 < 0
then ()
else
(division_propriety a b;
multiplication_order_lemma m (a / b - 1) b) | false |
Vale.Poly1305.X64.fst | Vale.Poly1305.X64.va_lemma_Poly1305_last_block | val va_lemma_Poly1305_last_block : va_b0:va_code -> va_s0:va_state
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Poly1305_last_block ()) va_s0 /\ va_get_ok va_s0 /\
(let (n:(va_int_range 18446744073709551616 18446744073709551616)) = 18446744073709551616 in let
(p:(va_int_range 136... | val va_lemma_Poly1305_last_block : va_b0:va_code -> va_s0:va_state
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Poly1305_last_block ()) va_s0 /\ va_get_ok va_s0 /\
(let (n:(va_int_range 18446744073709551616 18446744073709551616)) = 18446744073709551616 in let
(p:(va_int_range 136... | let va_lemma_Poly1305_last_block va_b0 va_s0 =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_reg64 rRbp; va_Mod_reg64 rRbx; va_Mod_reg64 rR14;
va_Mod_reg64 rR10; va_Mod_reg64 rR9; va_Mod_reg64 rR8; va_Mod_reg64 rRdx; va_Mod_reg64 rRcx;
va_Mod_reg64 rRax; va_Mod_ok] in
let va_qc = va_qcode_Poly1305_last_bl... | {
"file_name": "obj/Vale.Poly1305.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 1962,
"start_col": 0,
"start_line": 1931
} | module Vale.Poly1305.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.Poly1305.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": null
},
{
"abbrev": false,
... | {
"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... | false | va_b0: Vale.X64.Decls.va_code -> va_s0: Vale.X64.Decls.va_state
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.v... | [] | false | false | false | false | false | let va_lemma_Poly1305_last_block va_b0 va_s0 =
| let va_mods:va_mods_t =
[
va_Mod_flags; va_Mod_reg64 rRbp; va_Mod_reg64 rRbx; va_Mod_reg64 rR14; va_Mod_reg64 rR10;
va_Mod_reg64 rR9; va_Mod_reg64 rR8; va_Mod_reg64 rRdx; va_Mod_reg64 rRcx; va_Mod_reg64 rRax;
va_Mod_ok
]
in
let va_qc = va_qcode_Poly1305_last_block va_mods in
let va_sM, va_fM, va_g =
v... | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.lemma_mul_sub_distr | val lemma_mul_sub_distr: a:int -> b:int -> c:int -> Lemma
(a * b - a * c = a * (b - c)) | val lemma_mul_sub_distr: a:int -> b:int -> c:int -> Lemma
(a * b - a * c = a * (b - c)) | let lemma_mul_sub_distr a b c =
distributivity_sub_right a b c | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 445,
"start_col": 0,
"start_line": 444
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int -> c: Prims.int
-> FStar.Pervasives.Lemma (ensures a * b - a * c = a * (b - c)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"FStar.Math.Lemmas.distributivity_sub_right",
"Prims.unit"
] | [] | true | false | true | false | false | let lemma_mul_sub_distr a b c =
| distributivity_sub_right a b c | false |
Vale.Poly1305.X64.fst | Vale.Poly1305.X64.reveal_logand128 | val reveal_logand128 (x y: nat128)
: Lemma (requires True) (ensures Vale.Def.Types_s.iand x y == FStar.UInt.logand #128 x y) | val reveal_logand128 (x y: nat128)
: Lemma (requires True) (ensures Vale.Def.Types_s.iand x y == FStar.UInt.logand #128 x y) | let reveal_logand128 (x y:nat128) : Lemma
(requires True)
(ensures Vale.Def.Types_s.iand x y == FStar.UInt.logand #128 x y)
= Vale.Def.TypesNative_s.reveal_iand 128 x y | {
"file_name": "obj/Vale.Poly1305.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 46,
"end_line": 2308,
"start_col": 0,
"start_line": 2305
} | module Vale.Poly1305.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.Poly1305.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": null
},
{
"abbrev": false,
... | {
"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... | false | x: Vale.X64.Machine_s.nat128 -> y: Vale.X64.Machine_s.nat128
-> FStar.Pervasives.Lemma (ensures Vale.Def.Types_s.iand x y == FStar.UInt.logand x y) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.X64.Machine_s.nat128",
"Vale.Def.TypesNative_s.reveal_iand",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"Prims.int",
"Prims.l_or",
"Prims.l_and",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"Prims.op_LessThan",
"Vale.Def.Words_s.pow2_128",
"FStar.UInt.size",
"Vale.D... | [] | true | false | true | false | false | let reveal_logand128 (x y: nat128)
: Lemma (requires True) (ensures Vale.Def.Types_s.iand x y == FStar.UInt.logand #128 x y) =
| Vale.Def.TypesNative_s.reveal_iand 128 x y | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.division_definition_lemma_2 | val division_definition_lemma_2: a:int -> b:pos -> m:int{m * b <= a} ->
Lemma (m < a / b + 1) | val division_definition_lemma_2: a:int -> b:pos -> m:int{m * b <= a} ->
Lemma (m < a / b + 1) | let division_definition_lemma_2 a b m =
division_propriety a b;
multiplication_order_lemma (a / b + 1) m b | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 44,
"end_line": 553,
"start_col": 0,
"start_line": 551
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.pos -> m: Prims.int{m * b <= a}
-> FStar.Pervasives.Lemma (ensures m < a / b + 1) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"FStar.Math.Lemmas.multiplication_order_lemma",
"Prims.op_Addition",
"Prims.op_Division",
"Prims.unit",
"FStar.Math.Lemmas.division_propriety"
] | [] | true | false | true | false | false | let division_definition_lemma_2 a b m =
| division_propriety a b;
multiplication_order_lemma (a / b + 1) m b | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.lemma_mod_spec | val lemma_mod_spec: a:int -> p:pos -> Lemma
(a / p = (a - (a % p)) / p) | val lemma_mod_spec: a:int -> p:pos -> Lemma
(a / p = (a - (a % p)) / p) | let lemma_mod_spec a p =
calc (==) {
(a - a%p)/p;
== { lemma_div_mod a p }
(p*(a/p))/p;
== { cancel_mul_div (a/p) p }
a/p;
} | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 467,
"start_col": 0,
"start_line": 460
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> p: Prims.pos -> FStar.Pervasives.Lemma (ensures a / p = (a - a % p) / p) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Prims.op_Division",
"Prims.op_Subtraction",
"Prims.op_Modulus",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"FStar.Mul.op_Star",
"FStar.Calc.calc_init",
"FStar.Calc.calc_pack... | [] | false | false | true | false | false | let lemma_mod_spec a p =
| calc ( == ) {
(a - a % p) / p;
( == ) { lemma_div_mod a p }
(p * (a / p)) / p;
( == ) { cancel_mul_div (a / p) p }
a / p;
} | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.lemma_mod_spec2 | val lemma_mod_spec2: a:int -> p:pos -> Lemma
(let q:int = (a - (a % p)) / p in a = (a % p) + q * p) | val lemma_mod_spec2: a:int -> p:pos -> Lemma
(let q:int = (a - (a % p)) / p in a = (a % p) + q * p) | let lemma_mod_spec2 a p =
calc (==) {
(a % p) + ((a - (a % p)) / p) * p;
== { lemma_mod_spec a p }
(a % p) + (a / p) * p;
== { lemma_div_mod a p }
a;
} | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 478,
"start_col": 0,
"start_line": 471
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> p: Prims.pos
-> FStar.Pervasives.Lemma
(ensures
(let q = (a - a % p) / p in
a = a % p + q * p)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Prims.op_Addition",
"Prims.op_Modulus",
"FStar.Mul.op_Star",
"Prims.op_Division",
"Prims.op_Subtraction",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"FStar.Calc.calc_init",
... | [] | false | false | true | false | false | let lemma_mod_spec2 a p =
| calc ( == ) {
(a % p) + ((a - (a % p)) / p) * p;
( == ) { lemma_mod_spec a p }
(a % p) + (a / p) * p;
( == ) { lemma_div_mod a p }
a;
} | false |
Vale.Poly1305.X64.fst | Vale.Poly1305.X64.va_quick_Poly1305_impl | val va_quick_Poly1305_impl (key_r key_s: nat128) (ctx_b inp_b: buffer64) (finish: nat64)
: (va_quickCode int (va_code_Poly1305_impl ())) | val va_quick_Poly1305_impl (key_r key_s: nat128) (ctx_b inp_b: buffer64) (finish: nat64)
: (va_quickCode int (va_code_Poly1305_impl ())) | let va_quick_Poly1305_impl (key_r:nat128) (key_s:nat128) (ctx_b:buffer64) (inp_b:buffer64)
(finish:nat64) : (va_quickCode int (va_code_Poly1305_impl ())) =
(va_QProc (va_code_Poly1305_impl ()) ([va_Mod_mem_heaplet 1; va_Mod_flags; va_Mod_reg64 rR15;
va_Mod_reg64 rR14; va_Mod_reg64 rR13; va_Mod_reg64 rR12; va_Mo... | {
"file_name": "obj/Vale.Poly1305.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 24,
"end_line": 2742,
"start_col": 0,
"start_line": 2735
} | module Vale.Poly1305.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.Poly1305.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": null
},
{
"abbrev": false,
... | {
"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... | false |
key_r: Vale.X64.Machine_s.nat128 ->
key_s: Vale.X64.Machine_s.nat128 ->
ctx_b: Vale.X64.Memory.buffer64 ->
inp_b: Vale.X64.Memory.buffer64 ->
finish: Vale.X64.Memory.nat64
-> Vale.X64.QuickCode.va_quickCode Prims.int (Vale.Poly1305.X64.va_code_Poly1305_impl ()) | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Machine_s.nat128",
"Vale.X64.Memory.buffer64",
"Vale.X64.Memory.nat64",
"Vale.X64.QuickCode.va_QProc",
"Prims.int",
"Vale.Poly1305.X64.va_code_Poly1305_impl",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_mem_heaplet",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64... | [] | false | false | false | false | false | let va_quick_Poly1305_impl (key_r key_s: nat128) (ctx_b inp_b: buffer64) (finish: nat64)
: (va_quickCode int (va_code_Poly1305_impl ())) =
| (va_QProc (va_code_Poly1305_impl ())
([
va_Mod_mem_heaplet 1; va_Mod_flags; va_Mod_reg64 rR15; va_Mod_reg64 rR14; va_Mod_reg64 rR13;
va_Mod_reg64 rR12; va_Mod_reg64 rR11; va_Mod_reg64 rR10; va_Mod_reg64 rR9; va_Mod_reg64 rR8;
va_Mod_reg64 rRbp; va_Mod_reg64 rRbx; va_Mod_reg64 rRsi; va_Mod_re... | false |
Steel.ST.HigherArray.fsti | Steel.ST.HigherArray.ptrdiff | val ptrdiff (#t: _) (#p0 #p1: perm) (#s0 #s1: Ghost.erased (Seq.seq t)) (a0 a1: array t)
: ST UP.t
((pts_to a0 p0 s0) `star` (pts_to a1 p1 s1))
(fun _ -> (pts_to a0 p0 s0) `star` (pts_to a1 p1 s1))
(base (ptr_of a0) == base (ptr_of a1) /\ UP.fits (offset (ptr_of a0) - offset (ptr_of a1)))
(f... | val ptrdiff (#t: _) (#p0 #p1: perm) (#s0 #s1: Ghost.erased (Seq.seq t)) (a0 a1: array t)
: ST UP.t
((pts_to a0 p0 s0) `star` (pts_to a1 p1 s1))
(fun _ -> (pts_to a0 p0 s0) `star` (pts_to a1 p1 s1))
(base (ptr_of a0) == base (ptr_of a1) /\ UP.fits (offset (ptr_of a0) - offset (ptr_of a1)))
(f... | let ptrdiff (#t:_) (#p0 #p1:perm) (#s0 #s1:Ghost.erased (Seq.seq t))
(a0:array t)
(a1:array t)
: ST UP.t
(pts_to a0 p0 s0 `star` pts_to a1 p1 s1)
(fun _ -> pts_to a0 p0 s0 `star` pts_to a1 p1 s1)
(base (ptr_of a0) == base (ptr_of a1) /\ UP.fits (offset (ptr_of a0) - offset (ptr_of a1... | {
"file_name": "lib/steel/Steel.ST.HigherArray.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 14,
"end_line": 636,
"start_col": 0,
"start_line": 613
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.Util.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.SizeT.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.PtrdiffT.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.fsti.checked",
"FS... | [
{
"abbrev": false,
"full_module": "Steel.ST.Util",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.PtrdiffT",
"short_module": "UP"
},
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "US"
},
{
"abbrev": true,
"full_module": "Stee... | {
"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... | false | a0: Steel.ST.HigherArray.array t -> a1: Steel.ST.HigherArray.array t
-> Steel.ST.Effect.ST FStar.PtrdiffT.t | Steel.ST.Effect.ST | [] | [] | [
"Steel.FractionalPermission.perm",
"FStar.Ghost.erased",
"FStar.Seq.Base.seq",
"Steel.ST.HigherArray.array",
"Steel.ST.HigherArray.ptr",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Steel.ST.HigherArray.offset",
"FStar.Ghost.reveal",
"Steel.ST.HigherArray.base_le... | [] | false | true | false | false | false | let ptrdiff (#t: _) (#p0 #p1: perm) (#s0 #s1: Ghost.erased (Seq.seq t)) (a0 a1: array t)
: ST UP.t
((pts_to a0 p0 s0) `star` (pts_to a1 p1 s1))
(fun _ -> (pts_to a0 p0 s0) `star` (pts_to a1 p1 s1))
(base (ptr_of a0) == base (ptr_of a1) /\ UP.fits (offset (ptr_of a0) - offset (ptr_of a1)))
(f... | let (| pt0 , len0 |) = a0 in
let (| pt1 , len1 |) = a1 in
rewrite (pts_to a0 _ _) (pts_to (| pt0, len0 |) p0 s0);
rewrite (pts_to a1 _ _) (pts_to (| pt1, len1 |) p1 s1);
let res = ptrdiff_ptr pt0 len0 pt1 len1 in
rewrite (pts_to (| pt0, len0 |) p0 s0) (pts_to a0 _ _);
rewrite (pts_to (| pt1, len1 |) p1 s1) (pts_to a1 _... | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.multiple_modulo_lemma | val multiple_modulo_lemma (a:int) (n:pos) : Lemma ((a * n) % n = 0) | val multiple_modulo_lemma (a:int) (n:pos) : Lemma ((a * n) % n = 0) | let multiple_modulo_lemma (a:int) (n:pos) = cancel_mul_mod a n | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 568,
"start_col": 0,
"start_line": 568
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> n: Prims.pos -> FStar.Pervasives.Lemma (ensures a * n % n = 0) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Math.Lemmas.cancel_mul_mod",
"Prims.unit"
] | [] | true | false | true | false | false | let multiple_modulo_lemma (a: int) (n: pos) =
| cancel_mul_mod a n | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.multiple_division_lemma | val multiple_division_lemma (a:int) (n:nonzero) : Lemma ((a * n) / n = a) | val multiple_division_lemma (a:int) (n:nonzero) : Lemma ((a * n) / n = a) | let multiple_division_lemma (a:int) (n:nonzero) = cancel_mul_div a n | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 68,
"end_line": 564,
"start_col": 0,
"start_line": 564
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> n: Prims.nonzero -> FStar.Pervasives.Lemma (ensures a * n / n = a) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.nonzero",
"FStar.Math.Lemmas.cancel_mul_div",
"Prims.unit"
] | [] | true | false | true | false | false | let multiple_division_lemma (a: int) (n: nonzero) =
| cancel_mul_div a n | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.division_sub_lemma | val division_sub_lemma (a:int) (n:pos) (b:nat) : Lemma ((a - b * n) / n = a / n - b) | val division_sub_lemma (a:int) (n:pos) (b:nat) : Lemma ((a - b * n) / n = a / n - b) | let division_sub_lemma (a:int) (n:pos) (b:nat) =
neg_mul_left b n;
lemma_div_plus a (-b) n | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 25,
"end_line": 608,
"start_col": 0,
"start_line": 606
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> n: Prims.pos -> b: Prims.nat
-> FStar.Pervasives.Lemma (ensures (a - b * n) / n = a / n - b) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"Prims.nat",
"FStar.Math.Lemmas.lemma_div_plus",
"Prims.op_Minus",
"Prims.unit",
"FStar.Math.Lemmas.neg_mul_left"
] | [] | true | false | true | false | false | let division_sub_lemma (a: int) (n: pos) (b: nat) =
| neg_mul_left b n;
lemma_div_plus a (- b) n | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.division_definition | val division_definition: a:int -> b:pos -> m:int{a - b < m * b && m * b <= a} ->
Lemma (m = a / b) | val division_definition: a:int -> b:pos -> m:int{a - b < m * b && m * b <= a} ->
Lemma (m = a / b) | let division_definition a b m =
division_definition_lemma_1 a b m;
division_definition_lemma_2 a b m | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 35,
"end_line": 560,
"start_col": 0,
"start_line": 558
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.pos -> m: Prims.int{a - b < m * b && m * b <= a}
-> FStar.Pervasives.Lemma (ensures m = a / b) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"Prims.b2t",
"Prims.op_AmpAmp",
"Prims.op_LessThan",
"Prims.op_Subtraction",
"FStar.Mul.op_Star",
"Prims.op_LessThanOrEqual",
"FStar.Math.Lemmas.division_definition_lemma_2",
"Prims.unit",
"FStar.Math.Lemmas.division_definition_lemma_1"
] | [] | true | false | true | false | false | let division_definition a b m =
| division_definition_lemma_1 a b m;
division_definition_lemma_2 a b m | false |
Vale.Poly1305.X64.fst | Vale.Poly1305.X64.va_wp_Poly1305_impl | val va_wp_Poly1305_impl
(key_r key_s: nat128)
(ctx_b inp_b: buffer64)
(finish: nat64)
(va_s0: va_state)
(va_k: (va_state -> int -> Type0))
: Type0 | val va_wp_Poly1305_impl
(key_r key_s: nat128)
(ctx_b inp_b: buffer64)
(finish: nat64)
(va_s0: va_state)
(va_k: (va_state -> int -> Type0))
: Type0 | let va_wp_Poly1305_impl (key_r:nat128) (key_s:nat128) (ctx_b:buffer64) (inp_b:buffer64)
(finish:nat64) (va_s0:va_state) (va_k:(va_state -> int -> Type0)) : Type0 =
(va_get_ok va_s0 /\ (let (n:(va_int_range 18446744073709551616 18446744073709551616)) = pow2_64
in Vale.X64.Decls.validDstAddrs64 (va_get_mem_heaple... | {
"file_name": "obj/Vale.Poly1305.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 34,
"end_line": 2703,
"start_col": 0,
"start_line": 2661
} | module Vale.Poly1305.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.Poly1305.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": null
},
{
"abbrev": false,
... | {
"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... | false |
key_r: Vale.X64.Machine_s.nat128 ->
key_s: Vale.X64.Machine_s.nat128 ->
ctx_b: Vale.X64.Memory.buffer64 ->
inp_b: Vale.X64.Memory.buffer64 ->
finish: Vale.X64.Memory.nat64 ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.int -> Type0)
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Machine_s.nat128",
"Vale.X64.Memory.buffer64",
"Vale.X64.Memory.nat64",
"Vale.X64.Decls.va_state",
"Prims.int",
"Prims.l_and",
"Prims.b2t",
"Vale.X64.Decls.va_get_ok",
"Vale.X64.Decls.validDstAddrs64",
"Vale.X64.Decls.va_get_mem_heaplet",
"Vale.X64.Decls.va_get_reg64",
"Vale.X64.Mach... | [] | false | false | false | true | true | let va_wp_Poly1305_impl
(key_r key_s: nat128)
(ctx_b inp_b: buffer64)
(finish: nat64)
(va_s0: va_state)
(va_k: (va_state -> int -> Type0))
: Type0 =
| (va_get_ok va_s0 /\
(let n:(va_int_range 18446744073709551616 18446744073709551616) = pow2_64 in
Vale.X64.Decls.validDstAddrs64 (va_get_mem_heaplet 1 va_s0)
(va_get_reg64 rRdi va_s0)
ctx_b
24
(va_get_mem_layout va_s0)
Public /\
Vale.X64.Decls.validSrcAddrs64 (va_get_mem_heaplet 0... | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.modulo_addition_lemma | val modulo_addition_lemma (a:int) (n:pos) (b:int) : Lemma ((a + b * n) % n = a % n) | val modulo_addition_lemma (a:int) (n:pos) (b:int) : Lemma ((a + b * n) % n = a % n) | let modulo_addition_lemma (a:int) (n:pos) (b:int) = lemma_mod_plus a b n | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 72,
"end_line": 625,
"start_col": 0,
"start_line": 625
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> n: Prims.pos -> b: Prims.int
-> FStar.Pervasives.Lemma (ensures (a + b * n) % n = a % n) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Math.Lemmas.lemma_mod_plus",
"Prims.unit"
] | [] | true | false | true | false | false | let modulo_addition_lemma (a: int) (n: pos) (b: int) =
| lemma_mod_plus a b n | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.modulo_distributivity | val modulo_distributivity: a:int -> b:int -> c:pos -> Lemma ((a + b) % c == (a % c + b % c) % c) | val modulo_distributivity: a:int -> b:int -> c:pos -> Lemma ((a + b) % c == (a % c + b % c) % c) | let modulo_distributivity a b c =
calc (==) {
(a + b) % c;
== { lemma_mod_plus_distr_l a b c }
((a % c) + b) % c;
== { lemma_mod_plus_distr_r (a % c) b c }
((a % c) + (b % c)) % c;
} | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 584,
"start_col": 0,
"start_line": 577
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int -> c: Prims.pos
-> FStar.Pervasives.Lemma (ensures (a + b) % c == (a % c + b % c) % c) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Prims.op_Modulus",
"Prims.op_Addition",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"FStar.Calc.calc_init",
"FStar.Calc.calc_pack",
"FStar.Math.Lemmas.lemma_mod_plus_distr_l",
... | [] | false | false | true | false | false | let modulo_distributivity a b c =
| calc ( == ) {
(a + b) % c;
( == ) { lemma_mod_plus_distr_l a b c }
((a % c) + b) % c;
( == ) { lemma_mod_plus_distr_r (a % c) b c }
((a % c) + (b % c)) % c;
} | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.lemma_mod_plus_mul_distr | val lemma_mod_plus_mul_distr: a:int -> b:int -> c:int -> p:pos -> Lemma
(((a + b) * c) % p = ((((a % p) + (b % p)) % p) * (c % p)) % p) | val lemma_mod_plus_mul_distr: a:int -> b:int -> c:int -> p:pos -> Lemma
(((a + b) * c) % p = ((((a % p) + (b % p)) % p) * (c % p)) % p) | let lemma_mod_plus_mul_distr a b c p =
calc (==) {
((a + b) * c) % p;
== { lemma_mod_mul_distr_l (a + b) c p }
(((a + b) % p) * c) % p;
== { lemma_mod_mul_distr_r ((a + b) % p) c p }
(((a + b) % p) * (c % p)) % p;
== { modulo_distributivity a b p }
((((a % p) + (b % p)) % p) * (c % p)) % p... | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 621,
"start_col": 0,
"start_line": 612
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int -> c: Prims.int -> p: Prims.pos
-> FStar.Pervasives.Lemma (ensures (a + b) * c % p = ((a % p + b % p) % p) * (c % p) % p) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Prims.op_Modulus",
"FStar.Mul.op_Star",
"Prims.op_Addition",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"FStar.Calc.calc_init",
"FStar.Calc.calc_pack",
"FStar.Math.Lemmas.le... | [] | false | false | true | false | false | let lemma_mod_plus_mul_distr a b c p =
| calc ( == ) {
((a + b) * c) % p;
( == ) { lemma_mod_mul_distr_l (a + b) c p }
(((a + b) % p) * c) % p;
( == ) { lemma_mod_mul_distr_r ((a + b) % p) c p }
(((a + b) % p) * (c % p)) % p;
( == ) { modulo_distributivity a b p }
((((a % p) + (b % p)) % p) * (c % p)) % p;
} | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.lemma_mod_sub | val lemma_mod_sub (a:int) (n:pos) (b:int) : Lemma (ensures (a - b * n) % n = a % n) | val lemma_mod_sub (a:int) (n:pos) (b:int) : Lemma (ensures (a - b * n) % n = a % n) | let lemma_mod_sub (a:int) (n:pos) (b:int) =
neg_mul_left b n;
lemma_mod_plus a (-b) n | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 25,
"end_line": 631,
"start_col": 0,
"start_line": 629
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> n: Prims.pos -> b: Prims.int
-> FStar.Pervasives.Lemma (ensures (a - b * n) % n = a % n) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Math.Lemmas.lemma_mod_plus",
"Prims.op_Minus",
"Prims.unit",
"FStar.Math.Lemmas.neg_mul_left"
] | [] | true | false | true | false | false | let lemma_mod_sub (a: int) (n: pos) (b: int) =
| neg_mul_left b n;
lemma_mod_plus a (- b) n | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.division_addition_lemma | val division_addition_lemma: a:int -> b:pos -> n:int ->
Lemma ( (a + n * b) / b = a / b + n ) | val division_addition_lemma: a:int -> b:pos -> n:int ->
Lemma ( (a + n * b) / b = a / b + n ) | let division_addition_lemma a b n = division_definition (a + n * b) b (a / b + n) | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 81,
"end_line": 573,
"start_col": 0,
"start_line": 573
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.pos -> n: Prims.int
-> FStar.Pervasives.Lemma (ensures (a + n * b) / b = a / b + n) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Math.Lemmas.division_definition",
"Prims.op_Addition",
"FStar.Mul.op_Star",
"Prims.op_Division",
"Prims.unit"
] | [] | true | false | true | false | false | let division_addition_lemma a b n =
| division_definition (a + n * b) b (a / b + n) | false |
Vale.Poly1305.X64.fst | Vale.Poly1305.X64.va_qcode_Poly1305_last_block | val va_qcode_Poly1305_last_block (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Poly1305_last_block ())) | val va_qcode_Poly1305_last_block (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Poly1305_last_block ())) | let va_qcode_Poly1305_last_block (va_mods:va_mods_t) : (va_quickCode unit
(va_code_Poly1305_last_block ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let (n:(va_int_range
18446744073709551616 18446744073709551616)) = 18446744073709551616 in let (p:(va_int_range
136112946768... | {
"file_name": "obj/Vale.Poly1305.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 46,
"end_line": 1895,
"start_col": 0,
"start_line": 1734
} | module Vale.Poly1305.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.Poly1305.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": null
},
{
"abbrev": false,
... | {
"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... | false | va_mods: Vale.X64.QuickCode.va_mods_t
-> Vale.X64.QuickCode.va_quickCode Prims.unit (Vale.Poly1305.X64.va_code_Poly1305_last_block ()) | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.QuickCode.va_mods_t",
"Vale.X64.QuickCodes.qblock",
"Prims.unit",
"Prims.Cons",
"Vale.X64.Decls.va_code",
"Vale.X64.Machine_s.IfElse",
"Vale.X64.Decls.ins",
"Vale.X64.Decls.ocmp",
"Vale.X64.QuickCodes.cmp_to_ocmp",
"Vale.X64.QuickCodes.Cmp_lt",
"Vale.X64.Decls.va_op_cmp_reg64",
"Vale... | [] | false | false | false | false | false | let va_qcode_Poly1305_last_block (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Poly1305_last_block ())) =
| (qblock va_mods
(fun (va_s: va_state) ->
let va_old_s:va_state = va_s in
let n:(va_int_range 18446744073709551616 18446744073709551616) = 18446744073709551616 in
let p:(va_int_range 1361129467683753853853498429727072845819
1361129467683753853853498429727072845819) =
(va... | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.pow2_multiplication_division_lemma_2 | val pow2_multiplication_division_lemma_2: a:int -> b:nat -> c:nat{c <= b} ->
Lemma ( (a * pow2 c) / pow2 b = a / pow2 (b - c)) | val pow2_multiplication_division_lemma_2: a:int -> b:nat -> c:nat{c <= b} ->
Lemma ( (a * pow2 c) / pow2 b = a / pow2 (b - c)) | let pow2_multiplication_division_lemma_2 a b c =
pow2_plus c (b - c);
division_multiplication_lemma (a * pow2 c) (pow2 c) (pow2 (b - c));
multiple_division_lemma a (pow2 c) | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 36,
"end_line": 827,
"start_col": 0,
"start_line": 824
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.nat -> c: Prims.nat{c <= b}
-> FStar.Pervasives.Lemma (ensures a * Prims.pow2 c / Prims.pow2 b = a / Prims.pow2 (b - c)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Math.Lemmas.multiple_division_lemma",
"Prims.pow2",
"Prims.unit",
"FStar.Math.Lemmas.division_multiplication_lemma",
"FStar.Mul.op_Star",
"Prims.op_Subtraction",
"FStar.Math.Lemmas.pow2_plus"
] | [] | true | false | true | false | false | let pow2_multiplication_division_lemma_2 a b c =
| pow2_plus c (b - c);
division_multiplication_lemma (a * pow2 c) (pow2 c) (pow2 (b - c));
multiple_division_lemma a (pow2 c) | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.mod_mul_div_exact | val mod_mul_div_exact (a:int) (b:pos) (n:pos) : Lemma
(requires (a % (b * n) == 0))
(ensures (a / b) % n == 0) | val mod_mul_div_exact (a:int) (b:pos) (n:pos) : Lemma
(requires (a % (b * n) == 0))
(ensures (a / b) % n == 0) | let mod_mul_div_exact (a:int) (b:pos) (n:pos) =
calc (==) {
(a / b) % n;
== { lemma_div_mod a (b * n) (* + hyp *) }
(((b*n)*(a / (b*n))) / b) % n;
== { paren_mul_right b n (a / (b*n)) }
((b*(n*(a / (b*n)))) / b) % n;
== { cancel_mul_div (n * (a / (b * n))) b }
(n*(a / (b*n))) % n;
== {... | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 665,
"start_col": 0,
"start_line": 654
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.pos -> n: Prims.pos
-> FStar.Pervasives.Lemma (requires a % (b * n) == 0) (ensures a / b % n == 0) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Prims.op_Modulus",
"Prims.op_Division",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"FStar.Mul.op_Star",
"FStar.Calc.calc_init",
"FStar.Calc.calc_pack",
"FStar.Math.Lemmas.le... | [] | false | false | true | false | false | let mod_mul_div_exact (a: int) (b n: pos) =
| calc ( == ) {
(a / b) % n;
( == ) { lemma_div_mod a (b * n) }
(((b * n) * (a / (b * n))) / b) % n;
( == ) { paren_mul_right b n (a / (b * n)) }
((b * (n * (a / (b * n)))) / b) % n;
( == ) { cancel_mul_div (n * (a / (b * n))) b }
(n * (a / (b * n))) % n;
( == ) { cancel_mul_mod (a / (b * n)) n }
0;
} | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.cancel_fraction | val cancel_fraction (a:int) (b:pos) (c:pos) : Lemma ((a * c) / (b * c) == a / b) | val cancel_fraction (a:int) (b:pos) (c:pos) : Lemma ((a * c) / (b * c) == a / b) | let cancel_fraction a b c =
calc (==) {
(a * c) / (b * c);
== { swap_mul b c }
(a * c) / (c * b);
== { division_multiplication_lemma (a * c) c b }
((a * c) / c) / b;
== { cancel_mul_div a c }
a / b;
} | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 735,
"start_col": 8,
"start_line": 726
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.pos -> c: Prims.pos
-> FStar.Pervasives.Lemma (ensures a * c / (b * c) == a / b) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Prims.op_Division",
"FStar.Mul.op_Star",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"FStar.Calc.calc_init",
"FStar.Calc.calc_pack",
"FStar.Math.Lemmas.swap_mul",
"Prims.squa... | [] | false | false | true | false | false | let cancel_fraction a b c =
| calc ( == ) {
(a * c) / (b * c);
( == ) { swap_mul b c }
(a * c) / (c * b);
( == ) { division_multiplication_lemma (a * c) c b }
((a * c) / c) / b;
( == ) { cancel_mul_div a c }
a / b;
} | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.lemma_div_lt_cancel | val lemma_div_lt_cancel (a : int) (b : pos) (n : int) :
Lemma (requires (a < b * n))
(ensures (a / b < n)) | val lemma_div_lt_cancel (a : int) (b : pos) (n : int) :
Lemma (requires (a < b * n))
(ensures (a / b < n)) | let lemma_div_lt_cancel a b n =
(* by contradiction *)
if a / b >= n then begin
calc (>=) {
a;
>= { slash_decr_axiom a b }
(a / b) * b;
>= {}
n * b;
};
assert False
end | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 693,
"start_col": 8,
"start_line": 682
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.pos -> n: Prims.int
-> FStar.Pervasives.Lemma (requires a < b * n) (ensures a / b < n) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"Prims.op_GreaterThanOrEqual",
"Prims.op_Division",
"Prims._assert",
"Prims.l_False",
"Prims.unit",
"FStar.Calc.calc_finish",
"Prims.b2t",
"FStar.Mul.op_Star",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"FStar.Calc.calc_step",
"FStar.Calc.calc_init",
... | [] | false | false | true | false | false | let lemma_div_lt_cancel a b n =
| if a / b >= n
then
(calc ( >= ) {
a;
( >= ) { slash_decr_axiom a b }
(a / b) * b;
( >= ) { () }
n * b;
};
assert False) | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.lemma_mod_mult_zero | val lemma_mod_mult_zero (a : int) (b : pos) (c : pos) : Lemma ((a % (b * c)) / b / c == 0) | val lemma_mod_mult_zero (a : int) (b : pos) (c : pos) : Lemma ((a % (b * c)) / b / c == 0) | let lemma_mod_mult_zero a b c =
(* < 1 *)
lemma_mod_lt a (b * c);
lemma_div_lt_cancel (a % (b * c)) b c;
lemma_div_lt_cancel ((a % (b * c)) / b) c 1;
(* >= 0 *)
nat_over_pos_is_nat (a % (b * c)) b;
nat_over_pos_is_nat ((a % (b * c)) / b) c;
() | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 4,
"end_line": 705,
"start_col": 8,
"start_line": 696
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.pos -> c: Prims.pos
-> FStar.Pervasives.Lemma (ensures a % (b * c) / b / c == 0) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"Prims.unit",
"FStar.Math.Lemmas.nat_over_pos_is_nat",
"Prims.op_Division",
"Prims.op_Modulus",
"FStar.Mul.op_Star",
"FStar.Math.Lemmas.lemma_div_lt_cancel",
"FStar.Math.Lemmas.lemma_mod_lt"
] | [] | true | false | true | false | false | let lemma_mod_mult_zero a b c =
| lemma_mod_lt a (b * c);
lemma_div_lt_cancel (a % (b * c)) b c;
lemma_div_lt_cancel ((a % (b * c)) / b) c 1;
nat_over_pos_is_nat (a % (b * c)) b;
nat_over_pos_is_nat ((a % (b * c)) / b) c;
() | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.pow2_modulo_modulo_lemma_1 | val pow2_modulo_modulo_lemma_1: a:int -> b:nat -> c:nat{c >= b} ->
Lemma ( (a % pow2 c) % pow2 b = a % pow2 b ) | val pow2_modulo_modulo_lemma_1: a:int -> b:nat -> c:nat{c >= b} ->
Lemma ( (a % pow2 c) % pow2 b = a % pow2 b ) | let pow2_modulo_modulo_lemma_1 a b c =
pow2_plus (c - b) b;
modulo_modulo_lemma a (pow2 b) (pow2 (c - b)) | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 47,
"end_line": 867,
"start_col": 0,
"start_line": 865
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.nat -> c: Prims.nat{c >= b}
-> FStar.Pervasives.Lemma (ensures a % Prims.pow2 c % Prims.pow2 b = a % Prims.pow2 b) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.nat",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"FStar.Math.Lemmas.modulo_modulo_lemma",
"Prims.pow2",
"Prims.op_Subtraction",
"Prims.unit",
"FStar.Math.Lemmas.pow2_plus"
] | [] | true | false | true | false | false | let pow2_modulo_modulo_lemma_1 a b c =
| pow2_plus (c - b) b;
modulo_modulo_lemma a (pow2 b) (pow2 (c - b)) | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.pow2_multiplication_division_lemma_1 | val pow2_multiplication_division_lemma_1: a:int -> b:nat -> c:nat{c >= b} ->
Lemma ( (a * pow2 c) / pow2 b = a * pow2 (c - b)) | val pow2_multiplication_division_lemma_1: a:int -> b:nat -> c:nat{c >= b} ->
Lemma ( (a * pow2 c) / pow2 b = a * pow2 (c - b)) | let pow2_multiplication_division_lemma_1 a b c =
pow2_plus (c - b) b;
paren_mul_right a (pow2 (c - b)) (pow2 b);
paren_mul_left a (pow2 (c - b)) (pow2 b);
multiple_division_lemma (a * pow2 (c - b)) (pow2 b) | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 820,
"start_col": 0,
"start_line": 816
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.nat -> c: Prims.nat{c >= b}
-> FStar.Pervasives.Lemma (ensures a * Prims.pow2 c / Prims.pow2 b = a * Prims.pow2 (c - b)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.nat",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"FStar.Math.Lemmas.multiple_division_lemma",
"FStar.Mul.op_Star",
"Prims.pow2",
"Prims.op_Subtraction",
"Prims.unit",
"FStar.Math.Lemmas.paren_mul_left",
"FStar.Math.Lemmas.paren_mul_right",
"FStar.Math.Lemmas.pow2_plus"
] | [] | true | false | true | false | false | let pow2_multiplication_division_lemma_1 a b c =
| pow2_plus (c - b) b;
paren_mul_right a (pow2 (c - b)) (pow2 b);
paren_mul_left a (pow2 (c - b)) (pow2 b);
multiple_division_lemma (a * pow2 (c - b)) (pow2 b) | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.pow2_modulo_modulo_lemma_2 | val pow2_modulo_modulo_lemma_2: a:int -> b:nat -> c:nat{c <= b} ->
Lemma ( (a % pow2 c) % pow2 b = a % pow2 c ) | val pow2_modulo_modulo_lemma_2: a:int -> b:nat -> c:nat{c <= b} ->
Lemma ( (a % pow2 c) % pow2 b = a % pow2 c ) | let pow2_modulo_modulo_lemma_2 a b c =
pow2_le_compat b c;
small_modulo_lemma_1 (a % pow2 c) (pow2 b) | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 44,
"end_line": 873,
"start_col": 0,
"start_line": 871
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.nat -> c: Prims.nat{c <= b}
-> FStar.Pervasives.Lemma (ensures a % Prims.pow2 c % Prims.pow2 b = a % Prims.pow2 c) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Math.Lemmas.small_modulo_lemma_1",
"Prims.op_Modulus",
"Prims.pow2",
"Prims.unit",
"FStar.Math.Lemmas.pow2_le_compat"
] | [] | true | false | true | false | false | let pow2_modulo_modulo_lemma_2 a b c =
| pow2_le_compat b c;
small_modulo_lemma_1 (a % pow2 c) (pow2 b) | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.modulo_scale_lemma | val modulo_scale_lemma : a:int -> b:pos -> c:pos -> Lemma ((a * b) % (b * c) == (a % c) * b) | val modulo_scale_lemma : a:int -> b:pos -> c:pos -> Lemma ((a * b) % (b * c) == (a % c) * b) | let modulo_scale_lemma a b c =
calc (==) {
(a * b) % (b * c);
== { lemma_div_mod (a * b) (b * c) }
a * b - (b * c) * ((a * b) / (b * c));
== { cancel_fraction a c b }
a * b - (b * c) * (a / c);
== { paren_mul_right b c (a / c) }
a * b - b * (c * (a / c));
== { swap_mul b (c * (a / c));... | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 751,
"start_col": 0,
"start_line": 738
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.pos -> c: Prims.pos
-> FStar.Pervasives.Lemma (ensures a * b % (b * c) == (a % c) * b) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Prims.op_Modulus",
"FStar.Mul.op_Star",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"Prims.op_Subtraction",
"Prims.op_Division",
"FStar.Calc.calc_init",
"FStar.Calc.calc_pack... | [] | false | false | true | false | false | let modulo_scale_lemma a b c =
| calc ( == ) {
(a * b) % (b * c);
( == ) { lemma_div_mod (a * b) (b * c) }
a * b - (b * c) * ((a * b) / (b * c));
( == ) { cancel_fraction a c b }
a * b - (b * c) * (a / c);
( == ) { paren_mul_right b c (a / c) }
a * b - b * (c * (a / c));
( == ) { (swap_mul b (c * (a / c));
distributivity_sub_left a... | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.pow2_modulo_division_lemma_2 | val pow2_modulo_division_lemma_2: a:int -> b:nat -> c:nat{c <= b} ->
Lemma ( (a % pow2 c) / pow2 b = 0 ) | val pow2_modulo_division_lemma_2: a:int -> b:nat -> c:nat{c <= b} ->
Lemma ( (a % pow2 c) / pow2 b = 0 ) | let pow2_modulo_division_lemma_2 a b c =
pow2_le_compat b c;
small_division_lemma_1 (a % pow2 c) (pow2 b) | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 46,
"end_line": 861,
"start_col": 0,
"start_line": 859
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.nat -> c: Prims.nat{c <= b}
-> FStar.Pervasives.Lemma (ensures a % Prims.pow2 c / Prims.pow2 b = 0) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Math.Lemmas.small_division_lemma_1",
"Prims.op_Modulus",
"Prims.pow2",
"Prims.unit",
"FStar.Math.Lemmas.pow2_le_compat"
] | [] | true | false | true | false | false | let pow2_modulo_division_lemma_2 a b c =
| pow2_le_compat b c;
small_division_lemma_1 (a % pow2 c) (pow2 b) | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.modulo_division_lemma_0 | val modulo_division_lemma_0 (a: nat) (b c: pos)
: Lemma (a / (b * c) <= a /\ (a - (a / (b * c)) * (b * c)) / b = a / b - ((a / (b * c)) * c)) | val modulo_division_lemma_0 (a: nat) (b c: pos)
: Lemma (a / (b * c) <= a /\ (a - (a / (b * c)) * (b * c)) / b = a / b - ((a / (b * c)) * c)) | let modulo_division_lemma_0 (a:nat) (b:pos) (c:pos) : Lemma
(a / (b*c) <= a /\ (a - (a / (b * c)) * (b * c)) / b = a / b - ((a / (b * c)) * c))
= slash_decr_axiom a (b*c);
calc (==) {
(a / (b*c)) * (b * c);
== { swap_mul b c }
(a / (b*c)) * (c * b);
== { paren_mul_right (a / (b*c)) c b }... | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 6,
"end_line": 769,
"start_col": 0,
"start_line": 756
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.nat -> b: Prims.pos -> c: Prims.pos
-> FStar.Pervasives.Lemma
(ensures a / (b * c) <= a /\ (a - (a / (b * c)) * (b * c)) / b = a / b - (a / (b * c)) * c) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"Prims.pos",
"Prims.unit",
"FStar.Math.Lemmas.division_sub_lemma",
"FStar.Mul.op_Star",
"Prims.op_Division",
"FStar.Math.Lemmas.lemma_div_mod",
"Prims.cut",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Prims.Cons",
"FStar.Preorder.re... | [] | false | false | true | false | false | let modulo_division_lemma_0 (a: nat) (b c: pos)
: Lemma (a / (b * c) <= a /\ (a - (a / (b * c)) * (b * c)) / b = a / b - ((a / (b * c)) * c)) =
| slash_decr_axiom a (b * c);
calc ( == ) {
(a / (b * c)) * (b * c);
( == ) { swap_mul b c }
(a / (b * c)) * (c * b);
( == ) { paren_mul_right (a / (b * c)) c b }
((a / (b * c)) * c) * b;
};
cut ((a / (b * c)) * (b * c) = ((a / (b * c)) * c) * b);
lemma_div_mod a (b * c);
division_sub_lemma a b ((a / (b * c)) *... | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.pow2_multiplication_modulo_lemma_2 | val pow2_multiplication_modulo_lemma_2: a:int -> b:nat -> c:nat{c <= b} ->
Lemma ( (a * pow2 c) % pow2 b = (a % pow2 (b - c)) * pow2 c ) | val pow2_multiplication_modulo_lemma_2: a:int -> b:nat -> c:nat{c <= b} ->
Lemma ( (a * pow2 c) % pow2 b = (a % pow2 (b - c)) * pow2 c ) | let pow2_multiplication_modulo_lemma_2 a b c =
calc (==) {
(a * pow2 c) % pow2 b;
== {}
(a * pow2 c) % pow2 (c + (b-c));
== { pow2_plus c (b-c) }
(a * pow2 c) % (pow2 c * pow2 (b-c));
== { modulo_scale_lemma a (pow2 c) (pow2 (b-c)) }
(a % pow2 (b - c)) * pow2 c;
} | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 849,
"start_col": 0,
"start_line": 840
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.nat -> c: Prims.nat{c <= b}
-> FStar.Pervasives.Lemma
(ensures a * Prims.pow2 c % Prims.pow2 b = (a % Prims.pow2 (b - c)) * Prims.pow2 c) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Prims.op_Modulus",
"FStar.Mul.op_Star",
"Prims.pow2",
"Prims.op_Subtraction",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"Prims.op... | [] | false | false | true | false | false | let pow2_multiplication_modulo_lemma_2 a b c =
| calc ( == ) {
(a * pow2 c) % pow2 b;
( == ) { () }
(a * pow2 c) % pow2 (c + (b - c));
( == ) { pow2_plus c (b - c) }
(a * pow2 c) % (pow2 c * pow2 (b - c));
( == ) { modulo_scale_lemma a (pow2 c) (pow2 (b - c)) }
(a % pow2 (b - c)) * pow2 c;
} | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.lemma_mod_plus_injective | val lemma_mod_plus_injective (n:pos) (a:int) (b:nat) (c:nat) : Lemma
(requires b < n /\ c < n /\ (a + b) % n = (a + c) % n)
(ensures b = c) | val lemma_mod_plus_injective (n:pos) (a:int) (b:nat) (c:nat) : Lemma
(requires b < n /\ c < n /\ (a + b) % n = (a + c) % n)
(ensures b = c) | let lemma_mod_plus_injective (n:pos) (a:int) (b:nat) (c:nat) =
small_mod b n;
small_mod c n;
mod_add_both (a + b) (a + c) (-a) n | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 37,
"end_line": 912,
"start_col": 0,
"start_line": 909
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | n: Prims.pos -> a: Prims.int -> b: Prims.nat -> c: Prims.nat
-> FStar.Pervasives.Lemma (requires b < n /\ c < n /\ (a + b) % n = (a + c) % n) (ensures b = c) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"Prims.int",
"Prims.nat",
"FStar.Math.Lemmas.mod_add_both",
"Prims.op_Addition",
"Prims.op_Minus",
"Prims.unit",
"FStar.Math.Lemmas.small_mod"
] | [] | true | false | true | false | false | let lemma_mod_plus_injective (n: pos) (a: int) (b c: nat) =
| small_mod b n;
small_mod c n;
mod_add_both (a + b) (a + c) (- a) n | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.mod_mult_exact | val mod_mult_exact (a:int) (n:pos) (q:pos) : Lemma
(requires (a % (n * q) == 0))
(ensures a % n == 0) | val mod_mult_exact (a:int) (n:pos) (q:pos) : Lemma
(requires (a % (n * q) == 0))
(ensures a % n == 0) | let mod_mult_exact (a:int) (n:pos) (q:pos) =
calc (==) {
a % n;
== { lemma_div_mod a (n * q) }
((n * q) * (a / (n * q)) + a % (n * q)) % n;
== { (* hyp *) }
((n * q) * (a / (n * q))) % n;
== { paren_mul_right n q (a / (n * q));
swap_mul n (q * (a / (n * q))) }
((q * (a / (n * q)... | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 649,
"start_col": 0,
"start_line": 637
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> n: Prims.pos -> q: Prims.pos
-> FStar.Pervasives.Lemma (requires a % (n * q) == 0) (ensures a % n == 0) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Prims.op_Modulus",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"FStar.Mul.op_Star",
"Prims.op_Division",
"Prims.op_Addition",
"FStar.Calc.calc_init",
"FStar.Calc.calc_pack",
... | [] | false | false | true | false | false | let mod_mult_exact (a: int) (n q: pos) =
| calc ( == ) {
a % n;
( == ) { lemma_div_mod a (n * q) }
((n * q) * (a / (n * q)) + a % (n * q)) % n;
( == ) { () }
((n * q) * (a / (n * q))) % n;
( == ) { (paren_mul_right n q (a / (n * q));
swap_mul n (q * (a / (n * q)))) }
((q * (a / (n * q))) * n) % n;
( == ) { multiple_modulo_lemma (q * (a / (n ... | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.pow2_multiplication_modulo_lemma_1 | val pow2_multiplication_modulo_lemma_1: a:int -> b:nat -> c:nat{c >= b} ->
Lemma ( (a * pow2 c) % pow2 b = 0 ) | val pow2_multiplication_modulo_lemma_1: a:int -> b:nat -> c:nat{c >= b} ->
Lemma ( (a * pow2 c) % pow2 b = 0 ) | let pow2_multiplication_modulo_lemma_1 a b c =
pow2_plus (c - b) b;
paren_mul_right a (pow2 (c - b)) (pow2 b);
paren_mul_left a (pow2 (c - b)) (pow2 b);
multiple_modulo_lemma (a * pow2 (c - b)) (pow2 b) | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 51,
"end_line": 835,
"start_col": 0,
"start_line": 831
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.nat -> c: Prims.nat{c >= b}
-> FStar.Pervasives.Lemma (ensures a * Prims.pow2 c % Prims.pow2 b = 0) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.nat",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"FStar.Math.Lemmas.multiple_modulo_lemma",
"FStar.Mul.op_Star",
"Prims.pow2",
"Prims.op_Subtraction",
"Prims.unit",
"FStar.Math.Lemmas.paren_mul_left",
"FStar.Math.Lemmas.paren_mul_right",
"FStar.Math.Lemmas.pow2_plus"
] | [] | true | false | true | false | false | let pow2_multiplication_modulo_lemma_1 a b c =
| pow2_plus (c - b) b;
paren_mul_right a (pow2 (c - b)) (pow2 b);
paren_mul_left a (pow2 (c - b)) (pow2 b);
multiple_modulo_lemma (a * pow2 (c - b)) (pow2 b) | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.mod_pow2_div2 | val mod_pow2_div2 (a:int) (m:pos) : Lemma
(requires a % pow2 m == 0)
(ensures (a / 2) % pow2 (m - 1) == 0) | val mod_pow2_div2 (a:int) (m:pos) : Lemma
(requires a % pow2 m == 0)
(ensures (a / 2) % pow2 (m - 1) == 0) | let mod_pow2_div2 (a:int) (m:pos) : Lemma
(requires a % pow2 m == 0)
(ensures (a / 2) % pow2 (m - 1) == 0)
=
mod_mul_div_exact a 2 (pow2 (m - 1)) | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 38,
"end_line": 675,
"start_col": 0,
"start_line": 671
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 0,
"max_fuel": 1,
"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... | false | a: Prims.int -> m: Prims.pos
-> FStar.Pervasives.Lemma (requires a % Prims.pow2 m == 0)
(ensures a / 2 % Prims.pow2 (m - 1) == 0) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Math.Lemmas.mod_mul_div_exact",
"Prims.pow2",
"Prims.op_Subtraction",
"Prims.unit",
"Prims.eq2",
"Prims.op_Modulus",
"Prims.squash",
"Prims.op_Division",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | true | false | true | false | false | let mod_pow2_div2 (a: int) (m: pos)
: Lemma (requires a % pow2 m == 0) (ensures (a / 2) % pow2 (m - 1) == 0) =
| mod_mul_div_exact a 2 (pow2 (m - 1)) | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.modulo_add | val modulo_add : p:pos -> a:int -> b:int -> c:int -> Lemma
(requires (b % p = c % p))
(ensures ((a + b) % p = (a + c) % p)) | val modulo_add : p:pos -> a:int -> b:int -> c:int -> Lemma
(requires (b % p = c % p))
(ensures ((a + b) % p = (a + c) % p)) | let modulo_add p a b c =
modulo_distributivity a b p;
modulo_distributivity a c p | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 29,
"end_line": 880,
"start_col": 0,
"start_line": 878
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: Prims.pos -> a: Prims.int -> b: Prims.int -> c: Prims.int
-> FStar.Pervasives.Lemma (requires b % p = c % p) (ensures (a + b) % p = (a + c) % p) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"Prims.int",
"FStar.Math.Lemmas.modulo_distributivity",
"Prims.unit"
] | [] | true | false | true | false | false | let modulo_add p a b c =
| modulo_distributivity a b p;
modulo_distributivity a c p | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.lemma_mod_twice | val lemma_mod_twice : a:int -> p:pos -> Lemma ((a % p) % p == a % p) | val lemma_mod_twice : a:int -> p:pos -> Lemma ((a % p) % p == a % p) | let lemma_mod_twice a p = lemma_mod_mod (a % p) a p | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 51,
"end_line": 883,
"start_col": 0,
"start_line": 883
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> p: Prims.pos -> FStar.Pervasives.Lemma (ensures a % p % p == a % p) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Math.Lemmas.lemma_mod_mod",
"Prims.op_Modulus",
"Prims.unit"
] | [] | true | false | true | false | false | let lemma_mod_twice a p =
| lemma_mod_mod (a % p) a p | false |
Vale.Poly1305.X64.fst | Vale.Poly1305.X64.va_wpProof_Poly1305 | val va_wpProof_Poly1305 : win:bool -> ctx_b:buffer64 -> inp_b:buffer64 -> len_in:nat64 ->
finish_in:nat64 -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Poly1305 win ctx_b inp_b len_in finish_in va_s0 va_k))
(ensures (fun (va_sM,... | val va_wpProof_Poly1305 : win:bool -> ctx_b:buffer64 -> inp_b:buffer64 -> len_in:nat64 ->
finish_in:nat64 -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Poly1305 win ctx_b inp_b len_in finish_in va_s0 va_k))
(ensures (fun (va_sM,... | let va_wpProof_Poly1305 win ctx_b inp_b len_in finish_in va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Poly1305 (va_code_Poly1305 win) va_s0 win ctx_b inp_b len_in
finish_in in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_stackTaint va_sM (va_update_stack va_sM
(va_update_mem_layout va_sM ... | {
"file_name": "obj/Vale.Poly1305.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 3015,
"start_col": 0,
"start_line": 2996
} | module Vale.Poly1305.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.Poly1305.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": null
},
{
"abbrev": false,
... | {
"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... | false |
win: Prims.bool ->
ctx_b: Vale.X64.Memory.buffer64 ->
inp_b: Vale.X64.Memory.buffer64 ->
len_in: Vale.X64.Memory.nat64 ->
finish_in: Vale.X64.Memory.nat64 ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_s... | Prims.Ghost | [] | [] | [
"Prims.bool",
"Vale.X64.Memory.buffer64",
"Vale.X64.Memory.nat64",
"Vale.X64.Decls.va_state",
"Prims.unit",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_stackTaint",
"... | [] | false | false | false | false | false | let va_wpProof_Poly1305 win ctx_b inp_b len_in finish_in va_s0 va_k =
| let va_sM, va_f0 =
va_lemma_Poly1305 (va_code_Poly1305 win) va_s0 win ctx_b inp_b len_in finish_in
in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_stackTaint va_sM
(va_update_stack va_sM
(va_update_mem_layout va_sM
(va_update_mem_heaplet 1
... | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.modulo_sub | val modulo_sub : p:pos -> a:int -> b:int -> c:int -> Lemma
(requires ((a + b) % p = (a + c) % p))
(ensures (b % p = c % p)) | val modulo_sub : p:pos -> a:int -> b:int -> c:int -> Lemma
(requires ((a + b) % p = (a + c) % p))
(ensures (b % p = c % p)) | let modulo_sub p a b c =
modulo_add p (-a) (a + b) (a + c) | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 35,
"end_line": 890,
"start_col": 0,
"start_line": 889
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: Prims.pos -> a: Prims.int -> b: Prims.int -> c: Prims.int
-> FStar.Pervasives.Lemma (requires (a + b) % p = (a + c) % p) (ensures b % p = c % p) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"Prims.int",
"FStar.Math.Lemmas.modulo_add",
"Prims.op_Minus",
"Prims.op_Addition",
"Prims.unit"
] | [] | true | false | true | false | false | let modulo_sub p a b c =
| modulo_add p (- a) (a + b) (a + c) | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.mod_add_both | val mod_add_both (a:int) (b:int) (x:int) (n:pos) : Lemma
(requires a % n == b % n)
(ensures (a + x) % n == (b + x) % n) | val mod_add_both (a:int) (b:int) (x:int) (n:pos) : Lemma
(requires a % n == b % n)
(ensures (a + x) % n == (b + x) % n) | let mod_add_both (a:int) (b:int) (x:int) (n:pos) =
calc (==) {
(a + x) % n;
== { modulo_distributivity a x n }
((a % n) + (x % n)) % n;
== { (* hyp *) }
((b % n) + (x % n)) % n;
== { modulo_distributivity b x n }
(b + x) % n;
} | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 904,
"start_col": 0,
"start_line": 895
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int -> x: Prims.int -> n: Prims.pos
-> FStar.Pervasives.Lemma (requires a % n == b % n) (ensures (a + x) % n == (b + x) % n) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Prims.op_Modulus",
"Prims.op_Addition",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"FStar.Calc.calc_init",
"FStar.Calc.calc_pack",
"FStar.Math.Lemmas.modulo_distributivity",
... | [] | false | false | true | false | false | let mod_add_both (a b x: int) (n: pos) =
| calc ( == ) {
(a + x) % n;
( == ) { modulo_distributivity a x n }
((a % n) + (x % n)) % n;
( == ) { () }
((b % n) + (x % n)) % n;
( == ) { modulo_distributivity b x n }
(b + x) % n;
} | false |
Vale.X64.QuickCodes.fsti | Vale.X64.QuickCodes.codes | val codes : Type0 | let codes = va_codes | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 27,
"end_line": 15,
"start_col": 7,
"start_line": 15
} | module Vale.X64.QuickCodes
// Optimized weakest precondition generation for 'quick' procedures
open FStar.Mul
open FStar.Range
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.QuickCode | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.X64.Decls.fs... | [
{
"abbrev": false,
"full_module": "Vale.X64.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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... | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_codes"
] | [] | false | false | false | true | true | let codes =
| va_codes | false | |
Vale.Poly1305.X64.fst | Vale.Poly1305.X64.va_wpProof_Poly1305_impl | val va_wpProof_Poly1305_impl : key_r:nat128 -> key_s:nat128 -> ctx_b:buffer64 -> inp_b:buffer64 ->
finish:nat64 -> va_s0:va_state -> va_k:(va_state -> int -> Type0)
-> Ghost (va_state & va_fuel & int)
(requires (va_t_require va_s0 /\ va_wp_Poly1305_impl key_r key_s ctx_b inp_b finish va_s0 va_k))
(ensures (fun ... | val va_wpProof_Poly1305_impl : key_r:nat128 -> key_s:nat128 -> ctx_b:buffer64 -> inp_b:buffer64 ->
finish:nat64 -> va_s0:va_state -> va_k:(va_state -> int -> Type0)
-> Ghost (va_state & va_fuel & int)
(requires (va_t_require va_s0 /\ va_wp_Poly1305_impl key_r key_s ctx_b inp_b finish va_s0 va_k))
(ensures (fun ... | let va_wpProof_Poly1305_impl key_r key_s ctx_b inp_b finish va_s0 va_k =
let (va_sM, va_f0, h) = va_lemma_Poly1305_impl (va_code_Poly1305_impl ()) va_s0 key_r key_s ctx_b
inp_b finish in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_mem_heaplet 1 va_sM (va_update_flags va_sM (va_update_reg64... | {
"file_name": "obj/Vale.Poly1305.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 2732,
"start_col": 0,
"start_line": 2716
} | module Vale.Poly1305.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.Poly1305.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": null
},
{
"abbrev": false,
... | {
"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... | false |
key_r: Vale.X64.Machine_s.nat128 ->
key_s: Vale.X64.Machine_s.nat128 ->
ctx_b: Vale.X64.Memory.buffer64 ->
inp_b: Vale.X64.Memory.buffer64 ->
finish: Vale.X64.Memory.nat64 ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.int -> Type0)
-> Prims.Ghost ((Val... | Prims.Ghost | [] | [] | [
"Vale.X64.Machine_s.nat128",
"Vale.X64.Memory.buffer64",
"Vale.X64.Memory.nat64",
"Vale.X64.Decls.va_state",
"Prims.int",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Prims.unit",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.Qui... | [] | false | false | false | false | false | let va_wpProof_Poly1305_impl key_r key_s ctx_b inp_b finish va_s0 va_k =
| let va_sM, va_f0, h =
va_lemma_Poly1305_impl (va_code_Poly1305_impl ()) va_s0 key_r key_s ctx_b inp_b finish
in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_mem_heaplet 1
va_sM
(va_update_flags va_sM
(va_update_reg64 rR15
va_sM
... | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.modulo_division_lemma | val modulo_division_lemma: a:nat -> b:pos -> c:pos ->
Lemma ((a % (b * c)) / b = (a / b) % c) | val modulo_division_lemma: a:nat -> b:pos -> c:pos ->
Lemma ((a % (b * c)) / b = (a / b) % c) | let modulo_division_lemma a b c =
calc (==) {
(a % (b * c)) / b;
== { lemma_div_mod a (b * c) }
(a - (b * c) * (a / (b * c))) / b;
== { paren_mul_right b c ((a / (b * c))); neg_mul_right b (c * (a / (b * c))) }
(a + b * (-(c * (a / (b * c))))) / b;
== { lemma_div_plus a (-(c * (a / (b * c)))) ... | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 787,
"start_col": 0,
"start_line": 774
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.nat -> b: Prims.pos -> c: Prims.pos
-> FStar.Pervasives.Lemma (ensures a % (b * c) / b = a / b % c) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"Prims.pos",
"FStar.Calc.calc_finish",
"Prims.int",
"Prims.eq2",
"Prims.op_Division",
"Prims.op_Modulus",
"FStar.Mul.op_Star",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"Prims.op_Subtraction",
"Prims.op_Addition",
"Prims.op... | [] | false | false | true | false | false | let modulo_division_lemma a b c =
| calc ( == ) {
(a % (b * c)) / b;
( == ) { lemma_div_mod a (b * c) }
(a - (b * c) * (a / (b * c))) / b;
( == ) { (paren_mul_right b c ((a / (b * c)));
neg_mul_right b (c * (a / (b * c)))) }
(a + b * (- (c * (a / (b * c))))) / b;
( == ) { lemma_div_plus a (- (c * (a / (b * c)))) b }
(a / b) - c * (a / (... | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.pow2_modulo_division_lemma_1 | val pow2_modulo_division_lemma_1: a:nat -> b:nat -> c:nat{c >= b} ->
Lemma ( (a % pow2 c) / pow2 b = (a / pow2 b) % (pow2 (c - b)) ) | val pow2_modulo_division_lemma_1: a:nat -> b:nat -> c:nat{c >= b} ->
Lemma ( (a % pow2 c) / pow2 b = (a / pow2 b) % (pow2 (c - b)) ) | let pow2_modulo_division_lemma_1 a b c =
pow2_plus (c - b) b;
modulo_division_lemma a (pow2 b) (pow2 (c - b)) | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 49,
"end_line": 855,
"start_col": 0,
"start_line": 853
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.nat -> b: Prims.nat -> c: Prims.nat{c >= b}
-> FStar.Pervasives.Lemma
(ensures a % Prims.pow2 c / Prims.pow2 b = a / Prims.pow2 b % Prims.pow2 (c - b)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"FStar.Math.Lemmas.modulo_division_lemma",
"Prims.pow2",
"Prims.op_Subtraction",
"Prims.unit",
"FStar.Math.Lemmas.pow2_plus"
] | [] | true | false | true | false | false | let pow2_modulo_division_lemma_1 a b c =
| pow2_plus (c - b) b;
modulo_division_lemma a (pow2 b) (pow2 (c - b)) | false |
Vale.X64.QuickCodes.fsti | Vale.X64.QuickCodes.eval | val eval : c: Vale.X64.Decls.va_code ->
s0: Vale.X64.Decls.va_state ->
f0: Vale.X64.Decls.va_fuel ->
sN: Vale.X64.Decls.va_state
-> Vale.Def.Prop_s.prop0 | let eval = eval_code | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 27,
"end_line": 17,
"start_col": 7,
"start_line": 17
} | module Vale.X64.QuickCodes
// Optimized weakest precondition generation for 'quick' procedures
open FStar.Mul
open FStar.Range
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.QuickCode
unfold let code ... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.X64.Decls.fs... | [
{
"abbrev": false,
"full_module": "Vale.X64.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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... | false |
c: Vale.X64.Decls.va_code ->
s0: Vale.X64.Decls.va_state ->
f0: Vale.X64.Decls.va_fuel ->
sN: Vale.X64.Decls.va_state
-> Vale.Def.Prop_s.prop0 | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.eval_code"
] | [] | false | false | false | true | false | let eval =
| eval_code | false | |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.modulo_sub_lemma | val modulo_sub_lemma (a : int) (b : nat) (c : pos) :
Lemma
(requires (b < c /\ (a - b) % c = 0))
(ensures (b = a % c)) | val modulo_sub_lemma (a : int) (b : nat) (c : pos) :
Lemma
(requires (b < c /\ (a - b) % c = 0))
(ensures (b = a % c)) | let modulo_sub_lemma a b c =
calc (==) {
b;
== { modulo_lemma b c }
b % c;
== { lemma_mod_twice b c }
(b%c) % c;
== { (* hyp *) }
(b%c + (a-b)%c) % c;
== { modulo_distributivity b (a-b) c }
(b+(a-b)) % c;
== {}
a % c;
} | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 932,
"start_col": 0,
"start_line": 919
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.nat -> c: Prims.pos
-> FStar.Pervasives.Lemma (requires b < c /\ (a - b) % c = 0) (ensures b = a % c) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.nat",
"Prims.pos",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Prims.op_Modulus",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"Prims.op_Addition",
"Prims.op_Subtraction",
"FStar.Calc.calc_init",
"FStar.Calc.calc_pack",
"FS... | [] | false | false | true | false | false | let modulo_sub_lemma a b c =
| calc ( == ) {
b;
( == ) { modulo_lemma b c }
b % c;
( == ) { lemma_mod_twice b c }
(b % c) % c;
( == ) { () }
(b % c + (a - b) % c) % c;
( == ) { modulo_distributivity b (a - b) c }
(b + (a - b)) % c;
( == ) { () }
a % c;
} | false |
Vale.X64.QuickCodes.fsti | Vale.X64.QuickCodes.code | val code : Type0 | let code = va_code | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 25,
"end_line": 14,
"start_col": 7,
"start_line": 14
} | module Vale.X64.QuickCodes
// Optimized weakest precondition generation for 'quick' procedures
open FStar.Mul
open FStar.Range
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.QuickCode | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.X64.Decls.fs... | [
{
"abbrev": false,
"full_module": "Vale.X64.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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... | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_code"
] | [] | false | false | false | true | true | let code =
| va_code | false | |
Vale.X64.QuickCodes.fsti | Vale.X64.QuickCodes.labeled_wrap | val labeled_wrap (r: range) (msg: string) (p: Type0) : GTot Type0 | val labeled_wrap (r: range) (msg: string) (p: Type0) : GTot Type0 | let labeled_wrap (r:range) (msg:string) (p:Type0) : GTot Type0 = labeled r msg p | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 80,
"end_line": 20,
"start_col": 0,
"start_line": 20
} | module Vale.X64.QuickCodes
// Optimized weakest precondition generation for 'quick' procedures
open FStar.Mul
open FStar.Range
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.QuickCode
unfold let code ... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.X64.Decls.fs... | [
{
"abbrev": false,
"full_module": "Vale.X64.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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... | false | r: FStar.Range.range -> msg: Prims.string -> p: Type0 -> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"FStar.Range.range",
"Prims.string",
"FStar.Range.labeled"
] | [] | false | false | false | false | true | let labeled_wrap (r: range) (msg: string) (p: Type0) : GTot Type0 =
| labeled r msg p | false |
Vale.X64.QuickCodes.fsti | Vale.X64.QuickCodes.fuel | val fuel : Type0 | let fuel = va_fuel | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 25,
"end_line": 16,
"start_col": 7,
"start_line": 16
} | module Vale.X64.QuickCodes
// Optimized weakest precondition generation for 'quick' procedures
open FStar.Mul
open FStar.Range
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.QuickCode
unfold let code ... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.X64.Decls.fs... | [
{
"abbrev": false,
"full_module": "Vale.X64.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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... | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_fuel"
] | [] | false | false | false | true | true | let fuel =
| va_fuel | false | |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.division_multiplication_lemma | val division_multiplication_lemma (a:int) (b:pos) (c:pos) : Lemma
(a / (b * c) = (a / b) / c) | val division_multiplication_lemma (a:int) (b:pos) (c:pos) : Lemma
(a / (b * c) = (a / b) / c) | let division_multiplication_lemma (a:int) (b:pos) (c:pos) =
calc (==) {
a / b / c;
== { lemma_div_mod a (b * c) }
((b * c) * (a / (b * c)) + a % (b * c)) / b / c;
== { paren_mul_right b c (a / (b * c)) }
(b * (c * (a / (b * c))) + a % (b * c)) / b / c;
== { lemma_div_plus (a % (b * c)) (c * (a... | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 723,
"start_col": 0,
"start_line": 710
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.pos -> c: Prims.pos
-> FStar.Pervasives.Lemma (ensures a / (b * c) = a / b / c) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Prims.op_Division",
"FStar.Mul.op_Star",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"Prims.op_Addition",
"Prims.op_Modulus",
"FStar.Calc.calc_init",
"FStar.Calc.calc_pack",
... | [] | false | false | true | false | false | let division_multiplication_lemma (a: int) (b c: pos) =
| calc ( == ) {
a / b / c;
( == ) { lemma_div_mod a (b * c) }
((b * c) * (a / (b * c)) + a % (b * c)) / b / c;
( == ) { paren_mul_right b c (a / (b * c)) }
(b * (c * (a / (b * c))) + a % (b * c)) / b / c;
( == ) { lemma_div_plus (a % (b * c)) (c * (a / (b * c))) b }
(c * (a / (b * c)) + ((a % (b * c)) / b))... | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.modulo_modulo_lemma | val modulo_modulo_lemma (a:int) (b:pos) (c:pos) : Lemma
((a % (b * c)) % b = a % b) | val modulo_modulo_lemma (a:int) (b:pos) (c:pos) : Lemma
((a % (b * c)) % b = a % b) | let modulo_modulo_lemma (a:int) (b:pos) (c:pos) =
pos_times_pos_is_pos b c;
calc (==) {
(a % (b * c)) % b;
== { calc (==) {
a % (b * c);
== { lemma_div_mod a (b * c) }
a - (b * c) * (a / (b * c));
== { paren_mul_right b c (a / (b * c)) }
a - b... | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 812,
"start_col": 0,
"start_line": 792
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.pos -> c: Prims.pos
-> FStar.Pervasives.Lemma (ensures a % (b * c) % b = a % b) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Prims.op_Modulus",
"FStar.Mul.op_Star",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"Prims.op_Addition",
"Prims.op_Minus",
"Prims.op_Division",
"Prims.op_Subtraction",
"FSt... | [] | false | false | true | false | false | let modulo_modulo_lemma (a: int) (b c: pos) =
| pos_times_pos_is_pos b c;
calc ( == ) {
(a % (b * c)) % b;
( == ) { calc ( == ) {
a % (b * c);
( == ) { lemma_div_mod a (b * c) }
a - (b * c) * (a / (b * c));
( == ) { paren_mul_right b c (a / (b * c)) }
a - b * (c * (a / (b * c)));
} }
(a - b * (c * (a / (b * c)))) % b;
( == ) { () }
(a... | false |
Vale.X64.QuickCodes.fsti | Vale.X64.QuickCodes.precedes_wrap | val precedes_wrap (#a: Type) (x y: a) : GTot Type0 | val precedes_wrap (#a: Type) (x y: a) : GTot Type0 | let precedes_wrap (#a:Type) (x y:a) : GTot Type0 = precedes x y | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 63,
"end_line": 35,
"start_col": 0,
"start_line": 35
} | module Vale.X64.QuickCodes
// Optimized weakest precondition generation for 'quick' procedures
open FStar.Mul
open FStar.Range
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.QuickCode
unfold let code ... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.X64.Decls.fs... | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"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... | false | x: a -> y: a -> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.precedes"
] | [] | false | false | false | false | true | let precedes_wrap (#a: Type) (x y: a) : GTot Type0 =
| precedes x y | false |
FStar.Math.Lemmas.fst | FStar.Math.Lemmas.lemma_div_le | val lemma_div_le: a:int -> b:int -> d:pos ->
Lemma (requires (a <= b))
(ensures (a / d <= b / d)) | val lemma_div_le: a:int -> b:int -> d:pos ->
Lemma (requires (a <= b))
(ensures (a / d <= b / d)) | let lemma_div_le a b d =
calc (==>) {
(a <= b) <: Type0;
==> { lemma_div_mod a d; lemma_div_mod b d }
d * (a/d) + a%d <= d * (b/d) + b%d;
==> {}
d * (a/d) - d * (b/d) <= b%d - a%d;
==> {}
d * (a/d - b/d) <= b%d - a%d;
==> { (* a%d >= 0, and b%d < d*) }
d * (a/d - b/d) < d;
==> ... | {
"file_name": "ulib/FStar.Math.Lemmas.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 602,
"start_col": 0,
"start_line": 589
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Math.Lemmas.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int -> d: Prims.pos
-> FStar.Pervasives.Lemma (requires a <= b) (ensures a / d <= b / d) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Calc.calc_finish",
"Prims.logical",
"Prims.l_imp",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Subtraction",
"Prims.op_Division",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"Prims.op_LessThan",
"FS... | [] | false | false | true | false | false | let lemma_div_le a b d =
| calc ( ==> ) {
(a <= b) <: Type0;
( ==> ) { (lemma_div_mod a d;
lemma_div_mod b d) }
d * (a / d) + a % d <= d * (b / d) + b % d;
( ==> ) { () }
d * (a / d) - d * (b / d) <= b % d - a % d;
( ==> ) { () }
d * (a / d - b / d) <= b % d - a % d;
( ==> ) { () }
d * (a / d - b / d) < d;
( ==> ) { () }
... | false |
Vale.Poly1305.X64.fst | Vale.Poly1305.X64.va_lemma_Poly1305_blocks_while0 | val va_lemma_Poly1305_blocks_while0 : va_b0:va_code -> va_s0:va_state -> va_old:va_state ->
va_in_ctx_b:buffer64 -> va_in_h_in:int -> va_in_inp_b:buffer64 -> va_in_length:int ->
va_in_n:(va_int_range 18446744073709551616 18446744073709551616) -> va_in_p:(va_int_range
1361129467683753853853498429727072845819 13611... | val va_lemma_Poly1305_blocks_while0 : va_b0:va_code -> va_s0:va_state -> va_old:va_state ->
va_in_ctx_b:buffer64 -> va_in_h_in:int -> va_in_inp_b:buffer64 -> va_in_length:int ->
va_in_n:(va_int_range 18446744073709551616 18446744073709551616) -> va_in_p:(va_int_range
1361129467683753853853498429727072845819 13611... | let va_lemma_Poly1305_blocks_while0 va_b0 va_s0 va_old va_in_ctx_b va_in_h_in va_in_inp_b
va_in_length va_in_n va_in_p va_in_r va_in_h va_in_word_index =
let va_old = va_expand_state va_old in
let (va_mods:va_mods_t) = [va_Mod_reg64 rRsi; va_Mod_reg64 rRdx; va_Mod_reg64 rRbx; va_Mod_reg64
rRbp; va_Mod_reg64 r... | {
"file_name": "obj/Vale.Poly1305.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 31,
"end_line": 1227,
"start_col": 0,
"start_line": 1144
} | module Vale.Poly1305.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.Poly1305.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": null
},
{
"abbrev": false,
... | {
"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... | false |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
va_old: Vale.X64.Decls.va_state ->
va_in_ctx_b: Vale.X64.Memory.buffer64 ->
va_in_h_in: Prims.int ->
va_in_inp_b: Vale.X64.Memory.buffer64 ->
va_in_length: Prims.int ->
va_in_n: Vale.X64.Decls.va_int_range 18446744073709... | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.Memory.buffer64",
"Prims.int",
"Vale.X64.Decls.va_int_range",
"Prims.nat",
"Vale.X64.QuickCodes.fuel",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.Mktuple4",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.tuple4",
... | [] | false | false | false | false | false | let va_lemma_Poly1305_blocks_while0
va_b0
va_s0
va_old
va_in_ctx_b
va_in_h_in
va_in_inp_b
va_in_length
va_in_n
va_in_p
va_in_r
va_in_h
va_in_word_index
=
| let va_old = va_expand_state va_old in
let va_mods:va_mods_t =
[
va_Mod_reg64 rRsi; va_Mod_reg64 rRdx; va_Mod_reg64 rRbx; va_Mod_reg64 rRbp; va_Mod_reg64 rRax;
va_Mod_reg64 rR9; va_Mod_reg64 rR8; va_Mod_reg64 rR15; va_Mod_reg64 rR14; va_Mod_reg64 rR10;
va_Mod_ok; va_Mod_flags
]
in
let va_qc =
va_qcode... | false |
Vale.X64.QuickCodes.fsti | Vale.X64.QuickCodes.va_QEmpty | val va_QEmpty (#a: Type0) (v: a) : quickCodes a [] | val va_QEmpty (#a: Type0) (v: a) : quickCodes a [] | let va_QEmpty (#a:Type0) (v:a) : quickCodes a [] = QEmpty v | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 78,
"end_line": 73,
"start_col": 19,
"start_line": 73
} | module Vale.X64.QuickCodes
// Optimized weakest precondition generation for 'quick' procedures
open FStar.Mul
open FStar.Range
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.QuickCode
unfold let code ... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.X64.Decls.fs... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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... | false | v: a -> Vale.X64.QuickCodes.quickCodes a [] | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.QuickCodes.QEmpty",
"Vale.X64.QuickCodes.quickCodes",
"Prims.Nil",
"Vale.X64.Machine_s.precode",
"Vale.X64.Decls.ins",
"Vale.X64.Decls.ocmp"
] | [] | false | false | false | true | false | let va_QEmpty (#a: Type0) (v: a) : quickCodes a [] =
| QEmpty v | false |
Vale.X64.QuickCodes.fsti | Vale.X64.QuickCodes.if_code | val if_code (b: bool) (c1 c2: code) : code | val if_code (b: bool) (c1 c2: code) : code | let if_code (b:bool) (c1:code) (c2:code) : code = if b then c1 else c2 | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 70,
"end_line": 50,
"start_col": 0,
"start_line": 50
} | module Vale.X64.QuickCodes
// Optimized weakest precondition generation for 'quick' procedures
open FStar.Mul
open FStar.Range
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.QuickCode
unfold let code ... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.X64.Decls.fs... | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"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... | false | b: Prims.bool -> c1: Vale.X64.QuickCodes.code -> c2: Vale.X64.QuickCodes.code
-> Vale.X64.QuickCodes.code | Prims.Tot | [
"total"
] | [] | [
"Prims.bool",
"Vale.X64.QuickCodes.code"
] | [] | false | false | false | true | false | let if_code (b: bool) (c1 c2: code) : code =
| if b then c1 else c2 | false |
Vale.X64.QuickCodes.fsti | Vale.X64.QuickCodes.va_QSeq | val va_QSeq
(#a: Type0)
(#b: Type)
(#c: code)
(#cs: codes)
(r: range)
(msg: string)
(qc: quickCode b c)
(qcs: quickCodes a cs)
: quickCodes a (c :: cs) | val va_QSeq
(#a: Type0)
(#b: Type)
(#c: code)
(#cs: codes)
(r: range)
(msg: string)
(qc: quickCode b c)
(qcs: quickCodes a cs)
: quickCodes a (c :: cs) | let va_QSeq (#a:Type0) (#b:Type) (#c:code) (#cs:codes) (r:range) (msg:string) (qc:quickCode b c) (qcs:quickCodes a cs) : quickCodes a (c::cs) = QSeq r msg qc qcs | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 180,
"end_line": 75,
"start_col": 19,
"start_line": 75
} | module Vale.X64.QuickCodes
// Optimized weakest precondition generation for 'quick' procedures
open FStar.Mul
open FStar.Range
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.QuickCode
unfold let code ... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.X64.Decls.fs... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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... | false |
r: FStar.Range.range ->
msg: Prims.string ->
qc: Vale.X64.QuickCode.quickCode b c ->
qcs: Vale.X64.QuickCodes.quickCodes a cs
-> Vale.X64.QuickCodes.quickCodes a (c :: cs) | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.QuickCodes.code",
"Vale.X64.QuickCodes.codes",
"FStar.Range.range",
"Prims.string",
"Vale.X64.QuickCode.quickCode",
"Vale.X64.QuickCodes.quickCodes",
"Vale.X64.QuickCodes.QSeq",
"Prims.Cons",
"Vale.X64.Decls.va_code"
] | [] | false | false | false | false | false | let va_QSeq
(#a: Type0)
(#b: Type)
(#c: code)
(#cs: codes)
(r: range)
(msg: string)
(qc: quickCode b c)
(qcs: quickCodes a cs)
: quickCodes a (c :: cs) =
| QSeq r msg qc qcs | false |
Vale.Poly1305.X64.fst | Vale.Poly1305.X64.va_qcode_Poly1305 | val va_qcode_Poly1305
(va_mods: va_mods_t)
(win: bool)
(ctx_b inp_b: buffer64)
(len_in finish_in: nat64)
: (va_quickCode unit (va_code_Poly1305 win)) | val va_qcode_Poly1305
(va_mods: va_mods_t)
(win: bool)
(ctx_b inp_b: buffer64)
(len_in finish_in: nat64)
: (va_quickCode unit (va_code_Poly1305 win)) | let va_qcode_Poly1305 (va_mods:va_mods_t) (win:bool) (ctx_b:buffer64) (inp_b:buffer64)
(len_in:nat64) (finish_in:nat64) : (va_quickCode unit (va_code_Poly1305 win)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(ctx_in:(va_int_range 0 18446744073709551615)) = va_if win (fun _ -... | {
"file_name": "obj/Vale.Poly1305.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 78,
"end_line": 2900,
"start_col": 0,
"start_line": 2813
} | module Vale.Poly1305.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.Poly1305.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Poly1305.Spec_s",
"short_module": null
},
{
"abbrev": false,
... | {
"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... | false |
va_mods: Vale.X64.QuickCode.va_mods_t ->
win: Prims.bool ->
ctx_b: Vale.X64.Memory.buffer64 ->
inp_b: Vale.X64.Memory.buffer64 ->
len_in: Vale.X64.Memory.nat64 ->
finish_in: Vale.X64.Memory.nat64
-> Vale.X64.QuickCode.va_quickCode Prims.unit (Vale.Poly1305.X64.va_code_Poly1305 win) | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.QuickCode.va_mods_t",
"Prims.bool",
"Vale.X64.Memory.buffer64",
"Vale.X64.Memory.nat64",
"Vale.X64.QuickCodes.qblock",
"Prims.unit",
"Prims.Cons",
"Vale.X64.Decls.va_code",
"Vale.X64.InsMem.va_code_CreateHeaplets",
"Vale.X64.InsBasic.va_code_Mov64",
"Vale.X64.Decls.va_op_dst_opr64_reg6... | [] | false | false | false | false | false | let va_qcode_Poly1305
(va_mods: va_mods_t)
(win: bool)
(ctx_b inp_b: buffer64)
(len_in finish_in: nat64)
: (va_quickCode unit (va_code_Poly1305 win)) =
| (qblock va_mods
(fun (va_s: va_state) ->
let va_old_s:va_state = va_s in
let ctx_in:(va_int_range 0 18446744073709551615) =
va_if win (fun _ -> va_get_reg64 rRcx va_s) (fun _ -> va_get_reg64 rRdi va_s)
in
let inp_in:(va_int_range 0 18446744073709551615) =
va_if wi... | false |
Vale.X64.QuickCodes.fsti | Vale.X64.QuickCodes.va_QBind | val va_QBind
(#a: Type0)
(#b: Type)
(#c: code)
(#cs: codes)
(r: range)
(msg: string)
(qc: quickCode b c)
(qcs: (va_state -> b -> GTot (quickCodes a cs)))
: quickCodes a (c :: cs) | val va_QBind
(#a: Type0)
(#b: Type)
(#c: code)
(#cs: codes)
(r: range)
(msg: string)
(qc: quickCode b c)
(qcs: (va_state -> b -> GTot (quickCodes a cs)))
: quickCodes a (c :: cs) | let va_QBind (#a:Type0) (#b:Type) (#c:code) (#cs:codes) (r:range) (msg:string) (qc:quickCode b c) (qcs:va_state -> b -> GTot (quickCodes a cs)) : quickCodes a (c::cs) = QBind r msg qc qcs | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 206,
"end_line": 72,
"start_col": 19,
"start_line": 72
} | module Vale.X64.QuickCodes
// Optimized weakest precondition generation for 'quick' procedures
open FStar.Mul
open FStar.Range
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.QuickCode
unfold let code ... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.X64.Decls.fs... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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... | false |
r: FStar.Range.range ->
msg: Prims.string ->
qc: Vale.X64.QuickCode.quickCode b c ->
qcs: (_: Vale.X64.Decls.va_state -> _: b -> Prims.GTot (Vale.X64.QuickCodes.quickCodes a cs))
-> Vale.X64.QuickCodes.quickCodes a (c :: cs) | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.QuickCodes.code",
"Vale.X64.QuickCodes.codes",
"FStar.Range.range",
"Prims.string",
"Vale.X64.QuickCode.quickCode",
"Vale.X64.Decls.va_state",
"Vale.X64.QuickCodes.quickCodes",
"Vale.X64.QuickCodes.QBind",
"Prims.Cons",
"Vale.X64.Decls.va_code"
] | [] | false | false | false | false | false | let va_QBind
(#a: Type0)
(#b: Type)
(#c: code)
(#cs: codes)
(r: range)
(msg: string)
(qc: quickCode b c)
(qcs: (va_state -> b -> GTot (quickCodes a cs)))
: quickCodes a (c :: cs) =
| QBind r msg qc qcs | false |
Vale.X64.QuickCodes.fsti | Vale.X64.QuickCodes.wp_proc | val wp_proc (#a: Type0) (c: code) (qc: quickCode a c) (s0: va_state) (k: (va_state -> a -> Type0))
: Type0 | val wp_proc (#a: Type0) (c: code) (qc: quickCode a c) (s0: va_state) (k: (va_state -> a -> Type0))
: Type0 | let wp_proc (#a:Type0) (c:code) (qc:quickCode a c) (s0:va_state) (k:va_state -> a -> Type0) : Type0 =
match qc with
| QProc _ _ wp _ -> wp s0 k | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 29,
"end_line": 97,
"start_col": 0,
"start_line": 95
} | module Vale.X64.QuickCodes
// Optimized weakest precondition generation for 'quick' procedures
open FStar.Mul
open FStar.Range
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.QuickCode
unfold let code ... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.X64.Decls.fs... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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... | false |
c: Vale.X64.QuickCodes.code ->
qc: Vale.X64.QuickCode.quickCode a c ->
s0: Vale.X64.Decls.va_state ->
k: (_: Vale.X64.Decls.va_state -> _: a -> Type0)
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.QuickCodes.code",
"Vale.X64.QuickCode.quickCode",
"Vale.X64.Decls.va_state",
"Vale.X64.Decls.va_code",
"Vale.X64.QuickCode.mods_t",
"Vale.X64.QuickCode.quickProc_wp",
"Vale.X64.QuickCode.t_proof"
] | [] | false | false | false | false | true | let wp_proc (#a: Type0) (c: code) (qc: quickCode a c) (s0: va_state) (k: (va_state -> a -> Type0))
: Type0 =
| match qc with | QProc _ _ wp _ -> wp s0 k | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.