effect
stringclasses 48
values | original_source_type
stringlengths 0
23k
| opens_and_abbrevs
listlengths 2
92
| isa_cross_project_example
bool 1
class | source_definition
stringlengths 9
57.9k
| partial_definition
stringlengths 7
23.3k
| is_div
bool 2
classes | is_type
null | is_proof
bool 2
classes | completed_definiton
stringlengths 1
250k
| dependencies
dict | effect_flags
sequencelengths 0
2
| ideal_premises
sequencelengths 0
236
| mutual_with
sequencelengths 0
11
| file_context
stringlengths 0
407k
| interleaved
bool 1
class | is_simply_typed
bool 2
classes | file_name
stringlengths 5
48
| vconfig
dict | is_simple_lemma
null | source_type
stringlengths 10
23k
| proof_features
sequencelengths 0
1
| name
stringlengths 8
95
| source
dict | verbose_type
stringlengths 1
7.42k
| source_range
dict |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Prims.Tot | val term_of_nvar (x: nvar) : term | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let term_of_nvar (x:nvar) : term =
tm_var { nm_index=snd x; nm_ppname=fst x} | val term_of_nvar (x: nvar) : term
let term_of_nvar (x: nvar) : term = | false | null | false | tm_var ({ nm_index = snd x; nm_ppname = fst x }) | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"Pulse.Syntax.Base.nvar",
"Pulse.Syntax.Pure.tm_var",
"Pulse.Syntax.Base.Mknm",
"FStar.Pervasives.Native.snd",
"Pulse.Syntax.Base.ppname",
"Pulse.Syntax.Base.var",
"FStar.Pervasives.Native.fst",
"Pulse.Syntax.Base.term"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util
let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x
let u0 : universe = R.pack_universe R.Uv_Zero
let u1 : universe = R.pack_universe (R.Uv_Succ u0)
let u2 : universe = R.pack_universe (R.Uv_Succ u1)
let u_zero = u0
let u_succ (u:universe) : universe =
R.pack_universe (R.Uv_Succ u)
let u_var (s:string) : universe =
R.pack_universe (R.Uv_Name (R.pack_ident (s, FStar.Range.range_0)))
let u_max (u0 u1:universe) : universe =
R.pack_universe (R.Uv_Max [u0; u1])
let u_unknown : universe = R.pack_universe R.Uv_Unk
let tm_bvar (bv:bv) : term =
tm_fstar (R.pack_ln (R.Tv_BVar (R.pack_bv (RT.make_bv_with_name bv.bv_ppname.name bv.bv_index))))
bv.bv_ppname.range
let tm_var (nm:nm) : term =
tm_fstar (R.pack_ln (R.Tv_Var (R.pack_namedv (RT.make_namedv_with_name nm.nm_ppname.name nm.nm_index))))
nm.nm_ppname.range
let tm_fvar (l:fv) : term =
tm_fstar (R.pack_ln (R.Tv_FVar (R.pack_fv l.fv_name)))
l.fv_range
let tm_uinst (l:fv) (us:list universe) : term =
tm_fstar (R.pack_ln (R.Tv_UInst (R.pack_fv l.fv_name) us))
l.fv_range
let tm_constant (c:constant) : term =
tm_fstar (R.pack_ln (R.Tv_Const c)) FStar.Range.range_0
let tm_refine (b:binder) (t:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder b.binder_ppname.name (elab_term b.binder_ty) in
tm_fstar (R.pack_ln (R.Tv_Refine rb (elab_term t)))
FStar.Range.range_0
let tm_let (t e1 e2:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder RT.pp_name_default (elab_term t) in
tm_fstar (R.pack_ln (R.Tv_Let false
[]
rb
(elab_term e1)
(elab_term e2)))
FStar.Range.range_0
let tm_pureapp (head:term) (q:option qualifier) (arg:term) : term =
tm_fstar (R.mk_app (elab_term head) [(elab_term arg, elab_qual q)])
FStar.Range.range_0
let tm_arrow (b:binder) (q:option qualifier) (c:comp) : term =
tm_fstar (mk_arrow_with_name b.binder_ppname.name (elab_term b.binder_ty, elab_qual q)
(elab_comp c))
FStar.Range.range_0
let tm_type (u:universe) : term =
tm_fstar (R.pack_ln (R.Tv_Type u)) FStar.Range.range_0
let mk_bvar (s:string) (r:Range.range) (i:index) : term =
tm_bvar {bv_index=i;bv_ppname=mk_ppname (RT.seal_pp_name s) r}
let null_var (v:var) : term =
tm_var {nm_index=v;nm_ppname=ppname_default}
let null_bvar (i:index) : term =
tm_bvar {bv_index=i;bv_ppname=ppname_default} | false | true | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val term_of_nvar (x: nvar) : term | [] | Pulse.Syntax.Pure.term_of_nvar | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | x: Pulse.Syntax.Base.nvar -> Pulse.Syntax.Base.term | {
"end_col": 43,
"end_line": 85,
"start_col": 2,
"start_line": 85
} |
Prims.Tot | val null_var (v: var) : term | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let null_var (v:var) : term =
tm_var {nm_index=v;nm_ppname=ppname_default} | val null_var (v: var) : term
let null_var (v: var) : term = | false | null | false | tm_var ({ nm_index = v; nm_ppname = ppname_default }) | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"Pulse.Syntax.Base.var",
"Pulse.Syntax.Pure.tm_var",
"Pulse.Syntax.Base.Mknm",
"Pulse.Syntax.Base.ppname_default",
"Pulse.Syntax.Base.term"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util
let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x
let u0 : universe = R.pack_universe R.Uv_Zero
let u1 : universe = R.pack_universe (R.Uv_Succ u0)
let u2 : universe = R.pack_universe (R.Uv_Succ u1)
let u_zero = u0
let u_succ (u:universe) : universe =
R.pack_universe (R.Uv_Succ u)
let u_var (s:string) : universe =
R.pack_universe (R.Uv_Name (R.pack_ident (s, FStar.Range.range_0)))
let u_max (u0 u1:universe) : universe =
R.pack_universe (R.Uv_Max [u0; u1])
let u_unknown : universe = R.pack_universe R.Uv_Unk
let tm_bvar (bv:bv) : term =
tm_fstar (R.pack_ln (R.Tv_BVar (R.pack_bv (RT.make_bv_with_name bv.bv_ppname.name bv.bv_index))))
bv.bv_ppname.range
let tm_var (nm:nm) : term =
tm_fstar (R.pack_ln (R.Tv_Var (R.pack_namedv (RT.make_namedv_with_name nm.nm_ppname.name nm.nm_index))))
nm.nm_ppname.range
let tm_fvar (l:fv) : term =
tm_fstar (R.pack_ln (R.Tv_FVar (R.pack_fv l.fv_name)))
l.fv_range
let tm_uinst (l:fv) (us:list universe) : term =
tm_fstar (R.pack_ln (R.Tv_UInst (R.pack_fv l.fv_name) us))
l.fv_range
let tm_constant (c:constant) : term =
tm_fstar (R.pack_ln (R.Tv_Const c)) FStar.Range.range_0
let tm_refine (b:binder) (t:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder b.binder_ppname.name (elab_term b.binder_ty) in
tm_fstar (R.pack_ln (R.Tv_Refine rb (elab_term t)))
FStar.Range.range_0
let tm_let (t e1 e2:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder RT.pp_name_default (elab_term t) in
tm_fstar (R.pack_ln (R.Tv_Let false
[]
rb
(elab_term e1)
(elab_term e2)))
FStar.Range.range_0
let tm_pureapp (head:term) (q:option qualifier) (arg:term) : term =
tm_fstar (R.mk_app (elab_term head) [(elab_term arg, elab_qual q)])
FStar.Range.range_0
let tm_arrow (b:binder) (q:option qualifier) (c:comp) : term =
tm_fstar (mk_arrow_with_name b.binder_ppname.name (elab_term b.binder_ty, elab_qual q)
(elab_comp c))
FStar.Range.range_0
let tm_type (u:universe) : term =
tm_fstar (R.pack_ln (R.Tv_Type u)) FStar.Range.range_0
let mk_bvar (s:string) (r:Range.range) (i:index) : term =
tm_bvar {bv_index=i;bv_ppname=mk_ppname (RT.seal_pp_name s) r} | false | true | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val null_var (v: var) : term | [] | Pulse.Syntax.Pure.null_var | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | v: Pulse.Syntax.Base.var -> Pulse.Syntax.Base.term | {
"end_col": 46,
"end_line": 79,
"start_col": 2,
"start_line": 79
} |
Prims.Tot | val u_succ (u: universe) : universe | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let u_succ (u:universe) : universe =
R.pack_universe (R.Uv_Succ u) | val u_succ (u: universe) : universe
let u_succ (u: universe) : universe = | false | null | false | R.pack_universe (R.Uv_Succ u) | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"Pulse.Syntax.Base.universe",
"FStar.Reflection.V2.Builtins.pack_universe",
"FStar.Reflection.V2.Data.Uv_Succ"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util
let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x
let u0 : universe = R.pack_universe R.Uv_Zero
let u1 : universe = R.pack_universe (R.Uv_Succ u0)
let u2 : universe = R.pack_universe (R.Uv_Succ u1)
let u_zero = u0 | false | true | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val u_succ (u: universe) : universe | [] | Pulse.Syntax.Pure.u_succ | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | u5: Pulse.Syntax.Base.universe -> Pulse.Syntax.Base.universe | {
"end_col": 31,
"end_line": 23,
"start_col": 2,
"start_line": 23
} |
Prims.Tot | val u_unknown:universe | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let u_unknown : universe = R.pack_universe R.Uv_Unk | val u_unknown:universe
let u_unknown:universe = | false | null | false | R.pack_universe R.Uv_Unk | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"FStar.Reflection.V2.Builtins.pack_universe",
"FStar.Reflection.V2.Data.Uv_Unk"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util
let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x
let u0 : universe = R.pack_universe R.Uv_Zero
let u1 : universe = R.pack_universe (R.Uv_Succ u0)
let u2 : universe = R.pack_universe (R.Uv_Succ u1)
let u_zero = u0
let u_succ (u:universe) : universe =
R.pack_universe (R.Uv_Succ u)
let u_var (s:string) : universe =
R.pack_universe (R.Uv_Name (R.pack_ident (s, FStar.Range.range_0)))
let u_max (u0 u1:universe) : universe = | false | true | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val u_unknown:universe | [] | Pulse.Syntax.Pure.u_unknown | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | Pulse.Syntax.Base.universe | {
"end_col": 51,
"end_line": 28,
"start_col": 27,
"start_line": 28
} |
Prims.Tot | val u_max (u0 u1: universe) : universe | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let u_max (u0 u1:universe) : universe =
R.pack_universe (R.Uv_Max [u0; u1]) | val u_max (u0 u1: universe) : universe
let u_max (u0 u1: universe) : universe = | false | null | false | R.pack_universe (R.Uv_Max [u0; u1]) | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"Pulse.Syntax.Base.universe",
"FStar.Reflection.V2.Builtins.pack_universe",
"FStar.Reflection.V2.Data.Uv_Max",
"Prims.Cons",
"FStar.Reflection.Types.universe",
"Prims.Nil"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util
let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x
let u0 : universe = R.pack_universe R.Uv_Zero
let u1 : universe = R.pack_universe (R.Uv_Succ u0)
let u2 : universe = R.pack_universe (R.Uv_Succ u1)
let u_zero = u0
let u_succ (u:universe) : universe =
R.pack_universe (R.Uv_Succ u)
let u_var (s:string) : universe =
R.pack_universe (R.Uv_Name (R.pack_ident (s, FStar.Range.range_0))) | false | true | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val u_max (u0 u1: universe) : universe | [] | Pulse.Syntax.Pure.u_max | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | u0: Pulse.Syntax.Base.universe -> u1: Pulse.Syntax.Base.universe -> Pulse.Syntax.Base.universe | {
"end_col": 37,
"end_line": 27,
"start_col": 2,
"start_line": 27
} |
Prims.Tot | val term_of_no_name_var (x: var) : term | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let term_of_no_name_var (x:var) : term =
term_of_nvar (v_as_nv x) | val term_of_no_name_var (x: var) : term
let term_of_no_name_var (x: var) : term = | false | null | false | term_of_nvar (v_as_nv x) | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"Pulse.Syntax.Base.var",
"Pulse.Syntax.Pure.term_of_nvar",
"Pulse.Syntax.Base.v_as_nv",
"Pulse.Syntax.Base.term"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util
let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x
let u0 : universe = R.pack_universe R.Uv_Zero
let u1 : universe = R.pack_universe (R.Uv_Succ u0)
let u2 : universe = R.pack_universe (R.Uv_Succ u1)
let u_zero = u0
let u_succ (u:universe) : universe =
R.pack_universe (R.Uv_Succ u)
let u_var (s:string) : universe =
R.pack_universe (R.Uv_Name (R.pack_ident (s, FStar.Range.range_0)))
let u_max (u0 u1:universe) : universe =
R.pack_universe (R.Uv_Max [u0; u1])
let u_unknown : universe = R.pack_universe R.Uv_Unk
let tm_bvar (bv:bv) : term =
tm_fstar (R.pack_ln (R.Tv_BVar (R.pack_bv (RT.make_bv_with_name bv.bv_ppname.name bv.bv_index))))
bv.bv_ppname.range
let tm_var (nm:nm) : term =
tm_fstar (R.pack_ln (R.Tv_Var (R.pack_namedv (RT.make_namedv_with_name nm.nm_ppname.name nm.nm_index))))
nm.nm_ppname.range
let tm_fvar (l:fv) : term =
tm_fstar (R.pack_ln (R.Tv_FVar (R.pack_fv l.fv_name)))
l.fv_range
let tm_uinst (l:fv) (us:list universe) : term =
tm_fstar (R.pack_ln (R.Tv_UInst (R.pack_fv l.fv_name) us))
l.fv_range
let tm_constant (c:constant) : term =
tm_fstar (R.pack_ln (R.Tv_Const c)) FStar.Range.range_0
let tm_refine (b:binder) (t:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder b.binder_ppname.name (elab_term b.binder_ty) in
tm_fstar (R.pack_ln (R.Tv_Refine rb (elab_term t)))
FStar.Range.range_0
let tm_let (t e1 e2:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder RT.pp_name_default (elab_term t) in
tm_fstar (R.pack_ln (R.Tv_Let false
[]
rb
(elab_term e1)
(elab_term e2)))
FStar.Range.range_0
let tm_pureapp (head:term) (q:option qualifier) (arg:term) : term =
tm_fstar (R.mk_app (elab_term head) [(elab_term arg, elab_qual q)])
FStar.Range.range_0
let tm_arrow (b:binder) (q:option qualifier) (c:comp) : term =
tm_fstar (mk_arrow_with_name b.binder_ppname.name (elab_term b.binder_ty, elab_qual q)
(elab_comp c))
FStar.Range.range_0
let tm_type (u:universe) : term =
tm_fstar (R.pack_ln (R.Tv_Type u)) FStar.Range.range_0
let mk_bvar (s:string) (r:Range.range) (i:index) : term =
tm_bvar {bv_index=i;bv_ppname=mk_ppname (RT.seal_pp_name s) r}
let null_var (v:var) : term =
tm_var {nm_index=v;nm_ppname=ppname_default}
let null_bvar (i:index) : term =
tm_bvar {bv_index=i;bv_ppname=ppname_default}
let term_of_nvar (x:nvar) : term =
tm_var { nm_index=snd x; nm_ppname=fst x} | false | true | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val term_of_no_name_var (x: var) : term | [] | Pulse.Syntax.Pure.term_of_no_name_var | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | x: Pulse.Syntax.Base.var -> Pulse.Syntax.Base.term | {
"end_col": 26,
"end_line": 87,
"start_col": 2,
"start_line": 87
} |
Prims.Tot | val is_fvar (t: term) : option (R.name & list universe) | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let is_fvar (t:term) : option (R.name & list universe) =
let open R in
match t.t with
| Tm_FStar host_term ->
begin match inspect_ln host_term with
| Tv_FVar fv -> Some (inspect_fv fv, [])
| Tv_UInst fv us -> Some (inspect_fv fv, us)
| _ -> None
end
| _ -> None | val is_fvar (t: term) : option (R.name & list universe)
let is_fvar (t: term) : option (R.name & list universe) = | false | null | false | let open R in
match t.t with
| Tm_FStar host_term ->
(match inspect_ln host_term with
| Tv_FVar fv -> Some (inspect_fv fv, [])
| Tv_UInst fv us -> Some (inspect_fv fv, us)
| _ -> None)
| _ -> None | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"Pulse.Syntax.Base.term",
"Pulse.Syntax.Base.__proj__Mkterm__item__t",
"Pulse.Syntax.Base.host_term",
"FStar.Reflection.V2.Builtins.inspect_ln",
"FStar.Reflection.Types.fv",
"FStar.Pervasives.Native.Some",
"FStar.Pervasives.Native.tuple2",
"FStar.Reflection.Types.name",
"Prims.list",
"Pulse.Syntax.Base.universe",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Reflection.V2.Builtins.inspect_fv",
"Prims.Nil",
"FStar.Reflection.V2.Data.universes",
"FStar.Reflection.V2.Data.term_view",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.option",
"Pulse.Syntax.Base.term'"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util
let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x
let u0 : universe = R.pack_universe R.Uv_Zero
let u1 : universe = R.pack_universe (R.Uv_Succ u0)
let u2 : universe = R.pack_universe (R.Uv_Succ u1)
let u_zero = u0
let u_succ (u:universe) : universe =
R.pack_universe (R.Uv_Succ u)
let u_var (s:string) : universe =
R.pack_universe (R.Uv_Name (R.pack_ident (s, FStar.Range.range_0)))
let u_max (u0 u1:universe) : universe =
R.pack_universe (R.Uv_Max [u0; u1])
let u_unknown : universe = R.pack_universe R.Uv_Unk
let tm_bvar (bv:bv) : term =
tm_fstar (R.pack_ln (R.Tv_BVar (R.pack_bv (RT.make_bv_with_name bv.bv_ppname.name bv.bv_index))))
bv.bv_ppname.range
let tm_var (nm:nm) : term =
tm_fstar (R.pack_ln (R.Tv_Var (R.pack_namedv (RT.make_namedv_with_name nm.nm_ppname.name nm.nm_index))))
nm.nm_ppname.range
let tm_fvar (l:fv) : term =
tm_fstar (R.pack_ln (R.Tv_FVar (R.pack_fv l.fv_name)))
l.fv_range
let tm_uinst (l:fv) (us:list universe) : term =
tm_fstar (R.pack_ln (R.Tv_UInst (R.pack_fv l.fv_name) us))
l.fv_range
let tm_constant (c:constant) : term =
tm_fstar (R.pack_ln (R.Tv_Const c)) FStar.Range.range_0
let tm_refine (b:binder) (t:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder b.binder_ppname.name (elab_term b.binder_ty) in
tm_fstar (R.pack_ln (R.Tv_Refine rb (elab_term t)))
FStar.Range.range_0
let tm_let (t e1 e2:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder RT.pp_name_default (elab_term t) in
tm_fstar (R.pack_ln (R.Tv_Let false
[]
rb
(elab_term e1)
(elab_term e2)))
FStar.Range.range_0
let tm_pureapp (head:term) (q:option qualifier) (arg:term) : term =
tm_fstar (R.mk_app (elab_term head) [(elab_term arg, elab_qual q)])
FStar.Range.range_0
let tm_arrow (b:binder) (q:option qualifier) (c:comp) : term =
tm_fstar (mk_arrow_with_name b.binder_ppname.name (elab_term b.binder_ty, elab_qual q)
(elab_comp c))
FStar.Range.range_0
let tm_type (u:universe) : term =
tm_fstar (R.pack_ln (R.Tv_Type u)) FStar.Range.range_0
let mk_bvar (s:string) (r:Range.range) (i:index) : term =
tm_bvar {bv_index=i;bv_ppname=mk_ppname (RT.seal_pp_name s) r}
let null_var (v:var) : term =
tm_var {nm_index=v;nm_ppname=ppname_default}
let null_bvar (i:index) : term =
tm_bvar {bv_index=i;bv_ppname=ppname_default}
let term_of_nvar (x:nvar) : term =
tm_var { nm_index=snd x; nm_ppname=fst x}
let term_of_no_name_var (x:var) : term =
term_of_nvar (v_as_nv x)
let is_var (t:term) : option nm =
let open R in
match t.t with
| Tm_FStar host_term ->
begin match R.inspect_ln host_term with
| R.Tv_Var nv ->
let nv_view = R.inspect_namedv nv in
Some {nm_index=nv_view.uniq;
nm_ppname=mk_ppname (nv_view.ppname) t.range}
| _ -> None
end
| _ -> None | false | true | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val is_fvar (t: term) : option (R.name & list universe) | [] | Pulse.Syntax.Pure.is_fvar | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | t: Pulse.Syntax.Base.term
-> FStar.Pervasives.Native.option (FStar.Reflection.Types.name *
Prims.list Pulse.Syntax.Base.universe) | {
"end_col": 13,
"end_line": 112,
"start_col": 2,
"start_line": 104
} |
Prims.Tot | val is_pure_app (t: term) : option (term & option qualifier & term) | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let is_pure_app (t:term) : option (term & option qualifier & term) =
match t.t with
| Tm_FStar host_term ->
begin match R.inspect_ln host_term with
| R.Tv_App hd (arg, q) ->
let? hd =
match readback_ty hd with
| Some hd -> Some hd <: option term
| _ -> None in
let q = readback_qual q in
let? arg =
match readback_ty arg with
| Some arg -> Some arg <: option term
| _ -> None in
Some (hd, q, arg)
| _ -> None
end
| _ -> None | val is_pure_app (t: term) : option (term & option qualifier & term)
let is_pure_app (t: term) : option (term & option qualifier & term) = | false | null | false | match t.t with
| Tm_FStar host_term ->
(match R.inspect_ln host_term with
| R.Tv_App hd (arg, q) ->
let? hd =
match readback_ty hd with
| Some hd -> Some hd <: option term
| _ -> None
in
let q = readback_qual q in
let? arg =
match readback_ty arg with
| Some arg -> Some arg <: option term
| _ -> None
in
Some (hd, q, arg)
| _ -> None)
| _ -> None | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"Pulse.Syntax.Base.term",
"Pulse.Syntax.Base.__proj__Mkterm__item__t",
"Pulse.Syntax.Base.host_term",
"FStar.Reflection.V2.Builtins.inspect_ln",
"FStar.Reflection.Types.term",
"FStar.Reflection.V2.Data.aqualv",
"Pulse.Syntax.Pure.op_let_Question",
"FStar.Pervasives.Native.tuple3",
"FStar.Pervasives.Native.option",
"Pulse.Syntax.Base.qualifier",
"Pulse.Readback.readback_ty",
"Prims.eq2",
"Pulse.Elaborate.Pure.elab_term",
"FStar.Pervasives.Native.Some",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.Mktuple3",
"Pulse.Readback.readback_qual",
"FStar.Reflection.V2.Data.term_view",
"Pulse.Syntax.Base.term'"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util
let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x
let u0 : universe = R.pack_universe R.Uv_Zero
let u1 : universe = R.pack_universe (R.Uv_Succ u0)
let u2 : universe = R.pack_universe (R.Uv_Succ u1)
let u_zero = u0
let u_succ (u:universe) : universe =
R.pack_universe (R.Uv_Succ u)
let u_var (s:string) : universe =
R.pack_universe (R.Uv_Name (R.pack_ident (s, FStar.Range.range_0)))
let u_max (u0 u1:universe) : universe =
R.pack_universe (R.Uv_Max [u0; u1])
let u_unknown : universe = R.pack_universe R.Uv_Unk
let tm_bvar (bv:bv) : term =
tm_fstar (R.pack_ln (R.Tv_BVar (R.pack_bv (RT.make_bv_with_name bv.bv_ppname.name bv.bv_index))))
bv.bv_ppname.range
let tm_var (nm:nm) : term =
tm_fstar (R.pack_ln (R.Tv_Var (R.pack_namedv (RT.make_namedv_with_name nm.nm_ppname.name nm.nm_index))))
nm.nm_ppname.range
let tm_fvar (l:fv) : term =
tm_fstar (R.pack_ln (R.Tv_FVar (R.pack_fv l.fv_name)))
l.fv_range
let tm_uinst (l:fv) (us:list universe) : term =
tm_fstar (R.pack_ln (R.Tv_UInst (R.pack_fv l.fv_name) us))
l.fv_range
let tm_constant (c:constant) : term =
tm_fstar (R.pack_ln (R.Tv_Const c)) FStar.Range.range_0
let tm_refine (b:binder) (t:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder b.binder_ppname.name (elab_term b.binder_ty) in
tm_fstar (R.pack_ln (R.Tv_Refine rb (elab_term t)))
FStar.Range.range_0
let tm_let (t e1 e2:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder RT.pp_name_default (elab_term t) in
tm_fstar (R.pack_ln (R.Tv_Let false
[]
rb
(elab_term e1)
(elab_term e2)))
FStar.Range.range_0
let tm_pureapp (head:term) (q:option qualifier) (arg:term) : term =
tm_fstar (R.mk_app (elab_term head) [(elab_term arg, elab_qual q)])
FStar.Range.range_0
let tm_arrow (b:binder) (q:option qualifier) (c:comp) : term =
tm_fstar (mk_arrow_with_name b.binder_ppname.name (elab_term b.binder_ty, elab_qual q)
(elab_comp c))
FStar.Range.range_0
let tm_type (u:universe) : term =
tm_fstar (R.pack_ln (R.Tv_Type u)) FStar.Range.range_0
let mk_bvar (s:string) (r:Range.range) (i:index) : term =
tm_bvar {bv_index=i;bv_ppname=mk_ppname (RT.seal_pp_name s) r}
let null_var (v:var) : term =
tm_var {nm_index=v;nm_ppname=ppname_default}
let null_bvar (i:index) : term =
tm_bvar {bv_index=i;bv_ppname=ppname_default}
let term_of_nvar (x:nvar) : term =
tm_var { nm_index=snd x; nm_ppname=fst x}
let term_of_no_name_var (x:var) : term =
term_of_nvar (v_as_nv x)
let is_var (t:term) : option nm =
let open R in
match t.t with
| Tm_FStar host_term ->
begin match R.inspect_ln host_term with
| R.Tv_Var nv ->
let nv_view = R.inspect_namedv nv in
Some {nm_index=nv_view.uniq;
nm_ppname=mk_ppname (nv_view.ppname) t.range}
| _ -> None
end
| _ -> None
let is_fvar (t:term) : option (R.name & list universe) =
let open R in
match t.t with
| Tm_FStar host_term ->
begin match inspect_ln host_term with
| Tv_FVar fv -> Some (inspect_fv fv, [])
| Tv_UInst fv us -> Some (inspect_fv fv, us)
| _ -> None
end
| _ -> None | false | true | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val is_pure_app (t: term) : option (term & option qualifier & term) | [] | Pulse.Syntax.Pure.is_pure_app | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | t: Pulse.Syntax.Base.term
-> FStar.Pervasives.Native.option ((Pulse.Syntax.Base.term *
FStar.Pervasives.Native.option Pulse.Syntax.Base.qualifier) *
Pulse.Syntax.Base.term) | {
"end_col": 13,
"end_line": 131,
"start_col": 2,
"start_line": 115
} |
Prims.Tot | val op_let_Question (f: option 'a) (g: ('a -> option 'b)) : option 'b | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x | val op_let_Question (f: option 'a) (g: ('a -> option 'b)) : option 'b
let op_let_Question (f: option 'a) (g: ('a -> option 'b)) : option 'b = | false | null | false | match f with
| None -> None
| Some x -> g x | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"FStar.Pervasives.Native.option",
"FStar.Pervasives.Native.None"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util | false | false | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val op_let_Question (f: option 'a) (g: ('a -> option 'b)) : option 'b | [] | Pulse.Syntax.Pure.op_let_Question | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | f: FStar.Pervasives.Native.option 'a -> g: (_: 'a -> FStar.Pervasives.Native.option 'b)
-> FStar.Pervasives.Native.option 'b | {
"end_col": 17,
"end_line": 15,
"start_col": 2,
"start_line": 13
} |
Prims.Tot | val tm_let (t e1 e2: term) : term | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let tm_let (t e1 e2:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder RT.pp_name_default (elab_term t) in
tm_fstar (R.pack_ln (R.Tv_Let false
[]
rb
(elab_term e1)
(elab_term e2)))
FStar.Range.range_0 | val tm_let (t e1 e2: term) : term
let tm_let (t e1 e2: term) : term = | false | null | false | let rb:R.simple_binder = RT.mk_simple_binder RT.pp_name_default (elab_term t) in
tm_fstar (R.pack_ln (R.Tv_Let false [] rb (elab_term e1) (elab_term e2))) FStar.Range.range_0 | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"Pulse.Syntax.Base.term",
"Pulse.Syntax.Base.tm_fstar",
"FStar.Reflection.V2.Builtins.pack_ln",
"FStar.Reflection.V2.Data.Tv_Let",
"Prims.Nil",
"FStar.Reflection.Types.term",
"Pulse.Elaborate.Pure.elab_term",
"FStar.Range.range_0",
"FStar.Reflection.V2.Data.simple_binder",
"FStar.Reflection.Typing.mk_simple_binder",
"FStar.Reflection.Typing.pp_name_default"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util
let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x
let u0 : universe = R.pack_universe R.Uv_Zero
let u1 : universe = R.pack_universe (R.Uv_Succ u0)
let u2 : universe = R.pack_universe (R.Uv_Succ u1)
let u_zero = u0
let u_succ (u:universe) : universe =
R.pack_universe (R.Uv_Succ u)
let u_var (s:string) : universe =
R.pack_universe (R.Uv_Name (R.pack_ident (s, FStar.Range.range_0)))
let u_max (u0 u1:universe) : universe =
R.pack_universe (R.Uv_Max [u0; u1])
let u_unknown : universe = R.pack_universe R.Uv_Unk
let tm_bvar (bv:bv) : term =
tm_fstar (R.pack_ln (R.Tv_BVar (R.pack_bv (RT.make_bv_with_name bv.bv_ppname.name bv.bv_index))))
bv.bv_ppname.range
let tm_var (nm:nm) : term =
tm_fstar (R.pack_ln (R.Tv_Var (R.pack_namedv (RT.make_namedv_with_name nm.nm_ppname.name nm.nm_index))))
nm.nm_ppname.range
let tm_fvar (l:fv) : term =
tm_fstar (R.pack_ln (R.Tv_FVar (R.pack_fv l.fv_name)))
l.fv_range
let tm_uinst (l:fv) (us:list universe) : term =
tm_fstar (R.pack_ln (R.Tv_UInst (R.pack_fv l.fv_name) us))
l.fv_range
let tm_constant (c:constant) : term =
tm_fstar (R.pack_ln (R.Tv_Const c)) FStar.Range.range_0
let tm_refine (b:binder) (t:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder b.binder_ppname.name (elab_term b.binder_ty) in
tm_fstar (R.pack_ln (R.Tv_Refine rb (elab_term t)))
FStar.Range.range_0 | false | true | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val tm_let (t e1 e2: term) : term | [] | Pulse.Syntax.Pure.tm_let | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | t: Pulse.Syntax.Base.term -> e1: Pulse.Syntax.Base.term -> e2: Pulse.Syntax.Base.term
-> Pulse.Syntax.Base.term | {
"end_col": 30,
"end_line": 61,
"start_col": 34,
"start_line": 54
} |
Prims.Tot | val tm_uinst (l: fv) (us: list universe) : term | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let tm_uinst (l:fv) (us:list universe) : term =
tm_fstar (R.pack_ln (R.Tv_UInst (R.pack_fv l.fv_name) us))
l.fv_range | val tm_uinst (l: fv) (us: list universe) : term
let tm_uinst (l: fv) (us: list universe) : term = | false | null | false | tm_fstar (R.pack_ln (R.Tv_UInst (R.pack_fv l.fv_name) us)) l.fv_range | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"Pulse.Syntax.Base.fv",
"Prims.list",
"Pulse.Syntax.Base.universe",
"Pulse.Syntax.Base.tm_fstar",
"FStar.Reflection.V2.Builtins.pack_ln",
"FStar.Reflection.V2.Data.Tv_UInst",
"FStar.Reflection.V2.Builtins.pack_fv",
"Pulse.Syntax.Base.__proj__Mkfv__item__fv_name",
"Pulse.Syntax.Base.__proj__Mkfv__item__fv_range",
"Pulse.Syntax.Base.term"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util
let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x
let u0 : universe = R.pack_universe R.Uv_Zero
let u1 : universe = R.pack_universe (R.Uv_Succ u0)
let u2 : universe = R.pack_universe (R.Uv_Succ u1)
let u_zero = u0
let u_succ (u:universe) : universe =
R.pack_universe (R.Uv_Succ u)
let u_var (s:string) : universe =
R.pack_universe (R.Uv_Name (R.pack_ident (s, FStar.Range.range_0)))
let u_max (u0 u1:universe) : universe =
R.pack_universe (R.Uv_Max [u0; u1])
let u_unknown : universe = R.pack_universe R.Uv_Unk
let tm_bvar (bv:bv) : term =
tm_fstar (R.pack_ln (R.Tv_BVar (R.pack_bv (RT.make_bv_with_name bv.bv_ppname.name bv.bv_index))))
bv.bv_ppname.range
let tm_var (nm:nm) : term =
tm_fstar (R.pack_ln (R.Tv_Var (R.pack_namedv (RT.make_namedv_with_name nm.nm_ppname.name nm.nm_index))))
nm.nm_ppname.range
let tm_fvar (l:fv) : term =
tm_fstar (R.pack_ln (R.Tv_FVar (R.pack_fv l.fv_name)))
l.fv_range | false | true | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val tm_uinst (l: fv) (us: list universe) : term | [] | Pulse.Syntax.Pure.tm_uinst | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | l: Pulse.Syntax.Base.fv -> us: Prims.list Pulse.Syntax.Base.universe -> Pulse.Syntax.Base.term | {
"end_col": 21,
"end_line": 44,
"start_col": 2,
"start_line": 43
} |
Prims.Tot | val tm_constant (c: constant) : term | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let tm_constant (c:constant) : term =
tm_fstar (R.pack_ln (R.Tv_Const c)) FStar.Range.range_0 | val tm_constant (c: constant) : term
let tm_constant (c: constant) : term = | false | null | false | tm_fstar (R.pack_ln (R.Tv_Const c)) FStar.Range.range_0 | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"Pulse.Syntax.Base.constant",
"Pulse.Syntax.Base.tm_fstar",
"FStar.Reflection.V2.Builtins.pack_ln",
"FStar.Reflection.V2.Data.Tv_Const",
"FStar.Range.range_0",
"Pulse.Syntax.Base.term"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util
let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x
let u0 : universe = R.pack_universe R.Uv_Zero
let u1 : universe = R.pack_universe (R.Uv_Succ u0)
let u2 : universe = R.pack_universe (R.Uv_Succ u1)
let u_zero = u0
let u_succ (u:universe) : universe =
R.pack_universe (R.Uv_Succ u)
let u_var (s:string) : universe =
R.pack_universe (R.Uv_Name (R.pack_ident (s, FStar.Range.range_0)))
let u_max (u0 u1:universe) : universe =
R.pack_universe (R.Uv_Max [u0; u1])
let u_unknown : universe = R.pack_universe R.Uv_Unk
let tm_bvar (bv:bv) : term =
tm_fstar (R.pack_ln (R.Tv_BVar (R.pack_bv (RT.make_bv_with_name bv.bv_ppname.name bv.bv_index))))
bv.bv_ppname.range
let tm_var (nm:nm) : term =
tm_fstar (R.pack_ln (R.Tv_Var (R.pack_namedv (RT.make_namedv_with_name nm.nm_ppname.name nm.nm_index))))
nm.nm_ppname.range
let tm_fvar (l:fv) : term =
tm_fstar (R.pack_ln (R.Tv_FVar (R.pack_fv l.fv_name)))
l.fv_range
let tm_uinst (l:fv) (us:list universe) : term =
tm_fstar (R.pack_ln (R.Tv_UInst (R.pack_fv l.fv_name) us))
l.fv_range | false | true | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val tm_constant (c: constant) : term | [] | Pulse.Syntax.Pure.tm_constant | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | c: Pulse.Syntax.Base.constant -> Pulse.Syntax.Base.term | {
"end_col": 57,
"end_line": 47,
"start_col": 2,
"start_line": 47
} |
Prims.Tot | val tm_refine (b: binder) (t: term) : term | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let tm_refine (b:binder) (t:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder b.binder_ppname.name (elab_term b.binder_ty) in
tm_fstar (R.pack_ln (R.Tv_Refine rb (elab_term t)))
FStar.Range.range_0 | val tm_refine (b: binder) (t: term) : term
let tm_refine (b: binder) (t: term) : term = | false | null | false | let rb:R.simple_binder = RT.mk_simple_binder b.binder_ppname.name (elab_term b.binder_ty) in
tm_fstar (R.pack_ln (R.Tv_Refine rb (elab_term t))) FStar.Range.range_0 | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"Pulse.Syntax.Base.binder",
"Pulse.Syntax.Base.term",
"Pulse.Syntax.Base.tm_fstar",
"FStar.Reflection.V2.Builtins.pack_ln",
"FStar.Reflection.V2.Data.Tv_Refine",
"Pulse.Elaborate.Pure.elab_term",
"FStar.Range.range_0",
"FStar.Reflection.V2.Data.simple_binder",
"FStar.Reflection.Typing.mk_simple_binder",
"Pulse.Syntax.Base.__proj__Mkppname__item__name",
"Pulse.Syntax.Base.__proj__Mkbinder__item__binder_ppname",
"Pulse.Syntax.Base.__proj__Mkbinder__item__binder_ty"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util
let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x
let u0 : universe = R.pack_universe R.Uv_Zero
let u1 : universe = R.pack_universe (R.Uv_Succ u0)
let u2 : universe = R.pack_universe (R.Uv_Succ u1)
let u_zero = u0
let u_succ (u:universe) : universe =
R.pack_universe (R.Uv_Succ u)
let u_var (s:string) : universe =
R.pack_universe (R.Uv_Name (R.pack_ident (s, FStar.Range.range_0)))
let u_max (u0 u1:universe) : universe =
R.pack_universe (R.Uv_Max [u0; u1])
let u_unknown : universe = R.pack_universe R.Uv_Unk
let tm_bvar (bv:bv) : term =
tm_fstar (R.pack_ln (R.Tv_BVar (R.pack_bv (RT.make_bv_with_name bv.bv_ppname.name bv.bv_index))))
bv.bv_ppname.range
let tm_var (nm:nm) : term =
tm_fstar (R.pack_ln (R.Tv_Var (R.pack_namedv (RT.make_namedv_with_name nm.nm_ppname.name nm.nm_index))))
nm.nm_ppname.range
let tm_fvar (l:fv) : term =
tm_fstar (R.pack_ln (R.Tv_FVar (R.pack_fv l.fv_name)))
l.fv_range
let tm_uinst (l:fv) (us:list universe) : term =
tm_fstar (R.pack_ln (R.Tv_UInst (R.pack_fv l.fv_name) us))
l.fv_range
let tm_constant (c:constant) : term =
tm_fstar (R.pack_ln (R.Tv_Const c)) FStar.Range.range_0 | false | true | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val tm_refine (b: binder) (t: term) : term | [] | Pulse.Syntax.Pure.tm_refine | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | b: Pulse.Syntax.Base.binder -> t: Pulse.Syntax.Base.term -> Pulse.Syntax.Base.term | {
"end_col": 30,
"end_line": 52,
"start_col": 42,
"start_line": 49
} |
Prims.Tot | val tm_type (u: universe) : term | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let tm_type (u:universe) : term =
tm_fstar (R.pack_ln (R.Tv_Type u)) FStar.Range.range_0 | val tm_type (u: universe) : term
let tm_type (u: universe) : term = | false | null | false | tm_fstar (R.pack_ln (R.Tv_Type u)) FStar.Range.range_0 | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"Pulse.Syntax.Base.universe",
"Pulse.Syntax.Base.tm_fstar",
"FStar.Reflection.V2.Builtins.pack_ln",
"FStar.Reflection.V2.Data.Tv_Type",
"FStar.Range.range_0",
"Pulse.Syntax.Base.term"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util
let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x
let u0 : universe = R.pack_universe R.Uv_Zero
let u1 : universe = R.pack_universe (R.Uv_Succ u0)
let u2 : universe = R.pack_universe (R.Uv_Succ u1)
let u_zero = u0
let u_succ (u:universe) : universe =
R.pack_universe (R.Uv_Succ u)
let u_var (s:string) : universe =
R.pack_universe (R.Uv_Name (R.pack_ident (s, FStar.Range.range_0)))
let u_max (u0 u1:universe) : universe =
R.pack_universe (R.Uv_Max [u0; u1])
let u_unknown : universe = R.pack_universe R.Uv_Unk
let tm_bvar (bv:bv) : term =
tm_fstar (R.pack_ln (R.Tv_BVar (R.pack_bv (RT.make_bv_with_name bv.bv_ppname.name bv.bv_index))))
bv.bv_ppname.range
let tm_var (nm:nm) : term =
tm_fstar (R.pack_ln (R.Tv_Var (R.pack_namedv (RT.make_namedv_with_name nm.nm_ppname.name nm.nm_index))))
nm.nm_ppname.range
let tm_fvar (l:fv) : term =
tm_fstar (R.pack_ln (R.Tv_FVar (R.pack_fv l.fv_name)))
l.fv_range
let tm_uinst (l:fv) (us:list universe) : term =
tm_fstar (R.pack_ln (R.Tv_UInst (R.pack_fv l.fv_name) us))
l.fv_range
let tm_constant (c:constant) : term =
tm_fstar (R.pack_ln (R.Tv_Const c)) FStar.Range.range_0
let tm_refine (b:binder) (t:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder b.binder_ppname.name (elab_term b.binder_ty) in
tm_fstar (R.pack_ln (R.Tv_Refine rb (elab_term t)))
FStar.Range.range_0
let tm_let (t e1 e2:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder RT.pp_name_default (elab_term t) in
tm_fstar (R.pack_ln (R.Tv_Let false
[]
rb
(elab_term e1)
(elab_term e2)))
FStar.Range.range_0
let tm_pureapp (head:term) (q:option qualifier) (arg:term) : term =
tm_fstar (R.mk_app (elab_term head) [(elab_term arg, elab_qual q)])
FStar.Range.range_0
let tm_arrow (b:binder) (q:option qualifier) (c:comp) : term =
tm_fstar (mk_arrow_with_name b.binder_ppname.name (elab_term b.binder_ty, elab_qual q)
(elab_comp c))
FStar.Range.range_0 | false | true | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val tm_type (u: universe) : term | [] | Pulse.Syntax.Pure.tm_type | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | u26: Pulse.Syntax.Base.universe -> Pulse.Syntax.Base.term | {
"end_col": 56,
"end_line": 73,
"start_col": 2,
"start_line": 73
} |
Prims.Tot | val tm_pureapp (head: term) (q: option qualifier) (arg: term) : term | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let tm_pureapp (head:term) (q:option qualifier) (arg:term) : term =
tm_fstar (R.mk_app (elab_term head) [(elab_term arg, elab_qual q)])
FStar.Range.range_0 | val tm_pureapp (head: term) (q: option qualifier) (arg: term) : term
let tm_pureapp (head: term) (q: option qualifier) (arg: term) : term = | false | null | false | tm_fstar (R.mk_app (elab_term head) [(elab_term arg, elab_qual q)]) FStar.Range.range_0 | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"Pulse.Syntax.Base.term",
"FStar.Pervasives.Native.option",
"Pulse.Syntax.Base.qualifier",
"Pulse.Syntax.Base.tm_fstar",
"FStar.Reflection.V2.Derived.mk_app",
"Pulse.Elaborate.Pure.elab_term",
"Prims.Cons",
"FStar.Reflection.V2.Data.argv",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Reflection.Types.term",
"FStar.Reflection.V2.Data.aqualv",
"Pulse.Elaborate.Pure.elab_qual",
"Prims.Nil",
"FStar.Range.range_0"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util
let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x
let u0 : universe = R.pack_universe R.Uv_Zero
let u1 : universe = R.pack_universe (R.Uv_Succ u0)
let u2 : universe = R.pack_universe (R.Uv_Succ u1)
let u_zero = u0
let u_succ (u:universe) : universe =
R.pack_universe (R.Uv_Succ u)
let u_var (s:string) : universe =
R.pack_universe (R.Uv_Name (R.pack_ident (s, FStar.Range.range_0)))
let u_max (u0 u1:universe) : universe =
R.pack_universe (R.Uv_Max [u0; u1])
let u_unknown : universe = R.pack_universe R.Uv_Unk
let tm_bvar (bv:bv) : term =
tm_fstar (R.pack_ln (R.Tv_BVar (R.pack_bv (RT.make_bv_with_name bv.bv_ppname.name bv.bv_index))))
bv.bv_ppname.range
let tm_var (nm:nm) : term =
tm_fstar (R.pack_ln (R.Tv_Var (R.pack_namedv (RT.make_namedv_with_name nm.nm_ppname.name nm.nm_index))))
nm.nm_ppname.range
let tm_fvar (l:fv) : term =
tm_fstar (R.pack_ln (R.Tv_FVar (R.pack_fv l.fv_name)))
l.fv_range
let tm_uinst (l:fv) (us:list universe) : term =
tm_fstar (R.pack_ln (R.Tv_UInst (R.pack_fv l.fv_name) us))
l.fv_range
let tm_constant (c:constant) : term =
tm_fstar (R.pack_ln (R.Tv_Const c)) FStar.Range.range_0
let tm_refine (b:binder) (t:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder b.binder_ppname.name (elab_term b.binder_ty) in
tm_fstar (R.pack_ln (R.Tv_Refine rb (elab_term t)))
FStar.Range.range_0
let tm_let (t e1 e2:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder RT.pp_name_default (elab_term t) in
tm_fstar (R.pack_ln (R.Tv_Let false
[]
rb
(elab_term e1)
(elab_term e2)))
FStar.Range.range_0 | false | true | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val tm_pureapp (head: term) (q: option qualifier) (arg: term) : term | [] | Pulse.Syntax.Pure.tm_pureapp | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} |
head: Pulse.Syntax.Base.term ->
q: FStar.Pervasives.Native.option Pulse.Syntax.Base.qualifier ->
arg: Pulse.Syntax.Base.term
-> Pulse.Syntax.Base.term | {
"end_col": 30,
"end_line": 65,
"start_col": 2,
"start_line": 64
} |
Prims.Tot | val is_var (t: term) : option nm | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let is_var (t:term) : option nm =
let open R in
match t.t with
| Tm_FStar host_term ->
begin match R.inspect_ln host_term with
| R.Tv_Var nv ->
let nv_view = R.inspect_namedv nv in
Some {nm_index=nv_view.uniq;
nm_ppname=mk_ppname (nv_view.ppname) t.range}
| _ -> None
end
| _ -> None | val is_var (t: term) : option nm
let is_var (t: term) : option nm = | false | null | false | let open R in
match t.t with
| Tm_FStar host_term ->
(match R.inspect_ln host_term with
| R.Tv_Var nv ->
let nv_view = R.inspect_namedv nv in
Some ({ nm_index = nv_view.uniq; nm_ppname = mk_ppname (nv_view.ppname) t.range })
| _ -> None)
| _ -> None | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"Pulse.Syntax.Base.term",
"Pulse.Syntax.Base.__proj__Mkterm__item__t",
"Pulse.Syntax.Base.host_term",
"FStar.Reflection.V2.Builtins.inspect_ln",
"FStar.Reflection.Types.namedv",
"FStar.Pervasives.Native.Some",
"Pulse.Syntax.Base.nm",
"Pulse.Syntax.Base.Mknm",
"FStar.Reflection.V2.Data.__proj__Mknamedv_view__item__uniq",
"Pulse.Syntax.Base.mk_ppname",
"FStar.Reflection.V2.Data.__proj__Mknamedv_view__item__ppname",
"Pulse.Syntax.Base.__proj__Mkterm__item__range",
"FStar.Reflection.V2.Data.namedv_view",
"Prims.precedes",
"FStar.Reflection.V2.Builtins.inspect_namedv",
"FStar.Reflection.V2.Data.term_view",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.option",
"Pulse.Syntax.Base.term'"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util
let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x
let u0 : universe = R.pack_universe R.Uv_Zero
let u1 : universe = R.pack_universe (R.Uv_Succ u0)
let u2 : universe = R.pack_universe (R.Uv_Succ u1)
let u_zero = u0
let u_succ (u:universe) : universe =
R.pack_universe (R.Uv_Succ u)
let u_var (s:string) : universe =
R.pack_universe (R.Uv_Name (R.pack_ident (s, FStar.Range.range_0)))
let u_max (u0 u1:universe) : universe =
R.pack_universe (R.Uv_Max [u0; u1])
let u_unknown : universe = R.pack_universe R.Uv_Unk
let tm_bvar (bv:bv) : term =
tm_fstar (R.pack_ln (R.Tv_BVar (R.pack_bv (RT.make_bv_with_name bv.bv_ppname.name bv.bv_index))))
bv.bv_ppname.range
let tm_var (nm:nm) : term =
tm_fstar (R.pack_ln (R.Tv_Var (R.pack_namedv (RT.make_namedv_with_name nm.nm_ppname.name nm.nm_index))))
nm.nm_ppname.range
let tm_fvar (l:fv) : term =
tm_fstar (R.pack_ln (R.Tv_FVar (R.pack_fv l.fv_name)))
l.fv_range
let tm_uinst (l:fv) (us:list universe) : term =
tm_fstar (R.pack_ln (R.Tv_UInst (R.pack_fv l.fv_name) us))
l.fv_range
let tm_constant (c:constant) : term =
tm_fstar (R.pack_ln (R.Tv_Const c)) FStar.Range.range_0
let tm_refine (b:binder) (t:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder b.binder_ppname.name (elab_term b.binder_ty) in
tm_fstar (R.pack_ln (R.Tv_Refine rb (elab_term t)))
FStar.Range.range_0
let tm_let (t e1 e2:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder RT.pp_name_default (elab_term t) in
tm_fstar (R.pack_ln (R.Tv_Let false
[]
rb
(elab_term e1)
(elab_term e2)))
FStar.Range.range_0
let tm_pureapp (head:term) (q:option qualifier) (arg:term) : term =
tm_fstar (R.mk_app (elab_term head) [(elab_term arg, elab_qual q)])
FStar.Range.range_0
let tm_arrow (b:binder) (q:option qualifier) (c:comp) : term =
tm_fstar (mk_arrow_with_name b.binder_ppname.name (elab_term b.binder_ty, elab_qual q)
(elab_comp c))
FStar.Range.range_0
let tm_type (u:universe) : term =
tm_fstar (R.pack_ln (R.Tv_Type u)) FStar.Range.range_0
let mk_bvar (s:string) (r:Range.range) (i:index) : term =
tm_bvar {bv_index=i;bv_ppname=mk_ppname (RT.seal_pp_name s) r}
let null_var (v:var) : term =
tm_var {nm_index=v;nm_ppname=ppname_default}
let null_bvar (i:index) : term =
tm_bvar {bv_index=i;bv_ppname=ppname_default}
let term_of_nvar (x:nvar) : term =
tm_var { nm_index=snd x; nm_ppname=fst x}
let term_of_no_name_var (x:var) : term =
term_of_nvar (v_as_nv x) | false | true | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val is_var (t: term) : option nm | [] | Pulse.Syntax.Pure.is_var | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | t: Pulse.Syntax.Base.term -> FStar.Pervasives.Native.option Pulse.Syntax.Base.nm | {
"end_col": 13,
"end_line": 100,
"start_col": 2,
"start_line": 90
} |
Prims.Tot | val leftmost_head (t: term) : option term | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let leftmost_head (t:term) : option term =
match t.t with
| Tm_FStar host_term ->
let hd, _ = R.collect_app_ln host_term in
(match readback_ty hd with
| Some t -> Some t
| None -> None)
| _ -> None | val leftmost_head (t: term) : option term
let leftmost_head (t: term) : option term = | false | null | false | match t.t with
| Tm_FStar host_term ->
let hd, _ = R.collect_app_ln host_term in
(match readback_ty hd with
| Some t -> Some t
| None -> None)
| _ -> None | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"Pulse.Syntax.Base.term",
"Pulse.Syntax.Base.__proj__Mkterm__item__t",
"Pulse.Syntax.Base.host_term",
"FStar.Reflection.Types.term",
"Prims.list",
"FStar.Reflection.V2.Data.argv",
"Pulse.Readback.readback_ty",
"Prims.eq2",
"Pulse.Elaborate.Pure.elab_term",
"FStar.Pervasives.Native.Some",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.option",
"FStar.Pervasives.Native.tuple2",
"FStar.Reflection.V2.Derived.collect_app_ln",
"Pulse.Syntax.Base.term'"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util
let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x
let u0 : universe = R.pack_universe R.Uv_Zero
let u1 : universe = R.pack_universe (R.Uv_Succ u0)
let u2 : universe = R.pack_universe (R.Uv_Succ u1)
let u_zero = u0
let u_succ (u:universe) : universe =
R.pack_universe (R.Uv_Succ u)
let u_var (s:string) : universe =
R.pack_universe (R.Uv_Name (R.pack_ident (s, FStar.Range.range_0)))
let u_max (u0 u1:universe) : universe =
R.pack_universe (R.Uv_Max [u0; u1])
let u_unknown : universe = R.pack_universe R.Uv_Unk
let tm_bvar (bv:bv) : term =
tm_fstar (R.pack_ln (R.Tv_BVar (R.pack_bv (RT.make_bv_with_name bv.bv_ppname.name bv.bv_index))))
bv.bv_ppname.range
let tm_var (nm:nm) : term =
tm_fstar (R.pack_ln (R.Tv_Var (R.pack_namedv (RT.make_namedv_with_name nm.nm_ppname.name nm.nm_index))))
nm.nm_ppname.range
let tm_fvar (l:fv) : term =
tm_fstar (R.pack_ln (R.Tv_FVar (R.pack_fv l.fv_name)))
l.fv_range
let tm_uinst (l:fv) (us:list universe) : term =
tm_fstar (R.pack_ln (R.Tv_UInst (R.pack_fv l.fv_name) us))
l.fv_range
let tm_constant (c:constant) : term =
tm_fstar (R.pack_ln (R.Tv_Const c)) FStar.Range.range_0
let tm_refine (b:binder) (t:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder b.binder_ppname.name (elab_term b.binder_ty) in
tm_fstar (R.pack_ln (R.Tv_Refine rb (elab_term t)))
FStar.Range.range_0
let tm_let (t e1 e2:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder RT.pp_name_default (elab_term t) in
tm_fstar (R.pack_ln (R.Tv_Let false
[]
rb
(elab_term e1)
(elab_term e2)))
FStar.Range.range_0
let tm_pureapp (head:term) (q:option qualifier) (arg:term) : term =
tm_fstar (R.mk_app (elab_term head) [(elab_term arg, elab_qual q)])
FStar.Range.range_0
let tm_arrow (b:binder) (q:option qualifier) (c:comp) : term =
tm_fstar (mk_arrow_with_name b.binder_ppname.name (elab_term b.binder_ty, elab_qual q)
(elab_comp c))
FStar.Range.range_0
let tm_type (u:universe) : term =
tm_fstar (R.pack_ln (R.Tv_Type u)) FStar.Range.range_0
let mk_bvar (s:string) (r:Range.range) (i:index) : term =
tm_bvar {bv_index=i;bv_ppname=mk_ppname (RT.seal_pp_name s) r}
let null_var (v:var) : term =
tm_var {nm_index=v;nm_ppname=ppname_default}
let null_bvar (i:index) : term =
tm_bvar {bv_index=i;bv_ppname=ppname_default}
let term_of_nvar (x:nvar) : term =
tm_var { nm_index=snd x; nm_ppname=fst x}
let term_of_no_name_var (x:var) : term =
term_of_nvar (v_as_nv x)
let is_var (t:term) : option nm =
let open R in
match t.t with
| Tm_FStar host_term ->
begin match R.inspect_ln host_term with
| R.Tv_Var nv ->
let nv_view = R.inspect_namedv nv in
Some {nm_index=nv_view.uniq;
nm_ppname=mk_ppname (nv_view.ppname) t.range}
| _ -> None
end
| _ -> None
let is_fvar (t:term) : option (R.name & list universe) =
let open R in
match t.t with
| Tm_FStar host_term ->
begin match inspect_ln host_term with
| Tv_FVar fv -> Some (inspect_fv fv, [])
| Tv_UInst fv us -> Some (inspect_fv fv, us)
| _ -> None
end
| _ -> None
let is_pure_app (t:term) : option (term & option qualifier & term) =
match t.t with
| Tm_FStar host_term ->
begin match R.inspect_ln host_term with
| R.Tv_App hd (arg, q) ->
let? hd =
match readback_ty hd with
| Some hd -> Some hd <: option term
| _ -> None in
let q = readback_qual q in
let? arg =
match readback_ty arg with
| Some arg -> Some arg <: option term
| _ -> None in
Some (hd, q, arg)
| _ -> None
end
| _ -> None | false | true | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val leftmost_head (t: term) : option term | [] | Pulse.Syntax.Pure.leftmost_head | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | t: Pulse.Syntax.Base.term -> FStar.Pervasives.Native.option Pulse.Syntax.Base.term | {
"end_col": 13,
"end_line": 140,
"start_col": 2,
"start_line": 134
} |
Prims.Tot | val is_fvar_app (t: term) : option (R.name & list universe & option qualifier & option term) | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let is_fvar_app (t:term) : option (R.name &
list universe &
option qualifier &
option term) =
match is_fvar t with
| Some (l, us) -> Some (l, us, None, None)
| None ->
match is_pure_app t with
| Some (head, q, arg) ->
(match is_fvar head with
| Some (l, us) -> Some (l, us, q, Some arg)
| None -> None)
| _ -> None | val is_fvar_app (t: term) : option (R.name & list universe & option qualifier & option term)
let is_fvar_app (t: term) : option (R.name & list universe & option qualifier & option term) = | false | null | false | match is_fvar t with
| Some (l, us) -> Some (l, us, None, None)
| None ->
match is_pure_app t with
| Some (head, q, arg) ->
(match is_fvar head with
| Some (l, us) -> Some (l, us, q, Some arg)
| None -> None)
| _ -> None | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"Pulse.Syntax.Base.term",
"Pulse.Syntax.Pure.is_fvar",
"FStar.Reflection.Types.name",
"Prims.list",
"Pulse.Syntax.Base.universe",
"FStar.Pervasives.Native.Some",
"FStar.Pervasives.Native.tuple4",
"FStar.Pervasives.Native.option",
"Pulse.Syntax.Base.qualifier",
"FStar.Pervasives.Native.Mktuple4",
"FStar.Pervasives.Native.None",
"Pulse.Syntax.Pure.is_pure_app",
"FStar.Pervasives.Native.tuple3"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util
let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x
let u0 : universe = R.pack_universe R.Uv_Zero
let u1 : universe = R.pack_universe (R.Uv_Succ u0)
let u2 : universe = R.pack_universe (R.Uv_Succ u1)
let u_zero = u0
let u_succ (u:universe) : universe =
R.pack_universe (R.Uv_Succ u)
let u_var (s:string) : universe =
R.pack_universe (R.Uv_Name (R.pack_ident (s, FStar.Range.range_0)))
let u_max (u0 u1:universe) : universe =
R.pack_universe (R.Uv_Max [u0; u1])
let u_unknown : universe = R.pack_universe R.Uv_Unk
let tm_bvar (bv:bv) : term =
tm_fstar (R.pack_ln (R.Tv_BVar (R.pack_bv (RT.make_bv_with_name bv.bv_ppname.name bv.bv_index))))
bv.bv_ppname.range
let tm_var (nm:nm) : term =
tm_fstar (R.pack_ln (R.Tv_Var (R.pack_namedv (RT.make_namedv_with_name nm.nm_ppname.name nm.nm_index))))
nm.nm_ppname.range
let tm_fvar (l:fv) : term =
tm_fstar (R.pack_ln (R.Tv_FVar (R.pack_fv l.fv_name)))
l.fv_range
let tm_uinst (l:fv) (us:list universe) : term =
tm_fstar (R.pack_ln (R.Tv_UInst (R.pack_fv l.fv_name) us))
l.fv_range
let tm_constant (c:constant) : term =
tm_fstar (R.pack_ln (R.Tv_Const c)) FStar.Range.range_0
let tm_refine (b:binder) (t:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder b.binder_ppname.name (elab_term b.binder_ty) in
tm_fstar (R.pack_ln (R.Tv_Refine rb (elab_term t)))
FStar.Range.range_0
let tm_let (t e1 e2:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder RT.pp_name_default (elab_term t) in
tm_fstar (R.pack_ln (R.Tv_Let false
[]
rb
(elab_term e1)
(elab_term e2)))
FStar.Range.range_0
let tm_pureapp (head:term) (q:option qualifier) (arg:term) : term =
tm_fstar (R.mk_app (elab_term head) [(elab_term arg, elab_qual q)])
FStar.Range.range_0
let tm_arrow (b:binder) (q:option qualifier) (c:comp) : term =
tm_fstar (mk_arrow_with_name b.binder_ppname.name (elab_term b.binder_ty, elab_qual q)
(elab_comp c))
FStar.Range.range_0
let tm_type (u:universe) : term =
tm_fstar (R.pack_ln (R.Tv_Type u)) FStar.Range.range_0
let mk_bvar (s:string) (r:Range.range) (i:index) : term =
tm_bvar {bv_index=i;bv_ppname=mk_ppname (RT.seal_pp_name s) r}
let null_var (v:var) : term =
tm_var {nm_index=v;nm_ppname=ppname_default}
let null_bvar (i:index) : term =
tm_bvar {bv_index=i;bv_ppname=ppname_default}
let term_of_nvar (x:nvar) : term =
tm_var { nm_index=snd x; nm_ppname=fst x}
let term_of_no_name_var (x:var) : term =
term_of_nvar (v_as_nv x)
let is_var (t:term) : option nm =
let open R in
match t.t with
| Tm_FStar host_term ->
begin match R.inspect_ln host_term with
| R.Tv_Var nv ->
let nv_view = R.inspect_namedv nv in
Some {nm_index=nv_view.uniq;
nm_ppname=mk_ppname (nv_view.ppname) t.range}
| _ -> None
end
| _ -> None
let is_fvar (t:term) : option (R.name & list universe) =
let open R in
match t.t with
| Tm_FStar host_term ->
begin match inspect_ln host_term with
| Tv_FVar fv -> Some (inspect_fv fv, [])
| Tv_UInst fv us -> Some (inspect_fv fv, us)
| _ -> None
end
| _ -> None
let is_pure_app (t:term) : option (term & option qualifier & term) =
match t.t with
| Tm_FStar host_term ->
begin match R.inspect_ln host_term with
| R.Tv_App hd (arg, q) ->
let? hd =
match readback_ty hd with
| Some hd -> Some hd <: option term
| _ -> None in
let q = readback_qual q in
let? arg =
match readback_ty arg with
| Some arg -> Some arg <: option term
| _ -> None in
Some (hd, q, arg)
| _ -> None
end
| _ -> None
let leftmost_head (t:term) : option term =
match t.t with
| Tm_FStar host_term ->
let hd, _ = R.collect_app_ln host_term in
(match readback_ty hd with
| Some t -> Some t
| None -> None)
| _ -> None
let is_fvar_app (t:term) : option (R.name &
list universe &
option qualifier & | false | true | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val is_fvar_app (t: term) : option (R.name & list universe & option qualifier & option term) | [] | Pulse.Syntax.Pure.is_fvar_app | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | t: Pulse.Syntax.Base.term
-> FStar.Pervasives.Native.option (((FStar.Reflection.Types.name *
Prims.list Pulse.Syntax.Base.universe) *
FStar.Pervasives.Native.option Pulse.Syntax.Base.qualifier) *
FStar.Pervasives.Native.option Pulse.Syntax.Base.term) | {
"end_col": 15,
"end_line": 154,
"start_col": 2,
"start_line": 146
} |
Prims.Tot | val unreveal (t: term) : option term | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let unreveal (t:term) : option term =
match is_pure_app t with
| Some (head, None, arg) ->
(match is_pure_app head with
| Some (head, Some Implicit, _) ->
(match is_fvar head with
| Some (l, _) ->
if l = ["FStar"; "Ghost"; "reveal"]
then Some arg
else None
| _ -> None)
| _ -> None)
| _ -> None | val unreveal (t: term) : option term
let unreveal (t: term) : option term = | false | null | false | match is_pure_app t with
| Some (head, None, arg) ->
(match is_pure_app head with
| Some (head, Some Implicit, _) ->
(match is_fvar head with
| Some (l, _) -> if l = ["FStar"; "Ghost"; "reveal"] then Some arg else None
| _ -> None)
| _ -> None)
| _ -> None | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"Pulse.Syntax.Base.term",
"Pulse.Syntax.Pure.is_pure_app",
"Pulse.Syntax.Pure.is_fvar",
"FStar.Reflection.Types.name",
"Prims.list",
"Pulse.Syntax.Base.universe",
"Prims.op_Equality",
"Prims.string",
"Prims.Cons",
"Prims.Nil",
"FStar.Pervasives.Native.Some",
"Prims.bool",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.option",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.tuple3",
"Pulse.Syntax.Base.qualifier"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util
let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x
let u0 : universe = R.pack_universe R.Uv_Zero
let u1 : universe = R.pack_universe (R.Uv_Succ u0)
let u2 : universe = R.pack_universe (R.Uv_Succ u1)
let u_zero = u0
let u_succ (u:universe) : universe =
R.pack_universe (R.Uv_Succ u)
let u_var (s:string) : universe =
R.pack_universe (R.Uv_Name (R.pack_ident (s, FStar.Range.range_0)))
let u_max (u0 u1:universe) : universe =
R.pack_universe (R.Uv_Max [u0; u1])
let u_unknown : universe = R.pack_universe R.Uv_Unk
let tm_bvar (bv:bv) : term =
tm_fstar (R.pack_ln (R.Tv_BVar (R.pack_bv (RT.make_bv_with_name bv.bv_ppname.name bv.bv_index))))
bv.bv_ppname.range
let tm_var (nm:nm) : term =
tm_fstar (R.pack_ln (R.Tv_Var (R.pack_namedv (RT.make_namedv_with_name nm.nm_ppname.name nm.nm_index))))
nm.nm_ppname.range
let tm_fvar (l:fv) : term =
tm_fstar (R.pack_ln (R.Tv_FVar (R.pack_fv l.fv_name)))
l.fv_range
let tm_uinst (l:fv) (us:list universe) : term =
tm_fstar (R.pack_ln (R.Tv_UInst (R.pack_fv l.fv_name) us))
l.fv_range
let tm_constant (c:constant) : term =
tm_fstar (R.pack_ln (R.Tv_Const c)) FStar.Range.range_0
let tm_refine (b:binder) (t:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder b.binder_ppname.name (elab_term b.binder_ty) in
tm_fstar (R.pack_ln (R.Tv_Refine rb (elab_term t)))
FStar.Range.range_0
let tm_let (t e1 e2:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder RT.pp_name_default (elab_term t) in
tm_fstar (R.pack_ln (R.Tv_Let false
[]
rb
(elab_term e1)
(elab_term e2)))
FStar.Range.range_0
let tm_pureapp (head:term) (q:option qualifier) (arg:term) : term =
tm_fstar (R.mk_app (elab_term head) [(elab_term arg, elab_qual q)])
FStar.Range.range_0
let tm_arrow (b:binder) (q:option qualifier) (c:comp) : term =
tm_fstar (mk_arrow_with_name b.binder_ppname.name (elab_term b.binder_ty, elab_qual q)
(elab_comp c))
FStar.Range.range_0
let tm_type (u:universe) : term =
tm_fstar (R.pack_ln (R.Tv_Type u)) FStar.Range.range_0
let mk_bvar (s:string) (r:Range.range) (i:index) : term =
tm_bvar {bv_index=i;bv_ppname=mk_ppname (RT.seal_pp_name s) r}
let null_var (v:var) : term =
tm_var {nm_index=v;nm_ppname=ppname_default}
let null_bvar (i:index) : term =
tm_bvar {bv_index=i;bv_ppname=ppname_default}
let term_of_nvar (x:nvar) : term =
tm_var { nm_index=snd x; nm_ppname=fst x}
let term_of_no_name_var (x:var) : term =
term_of_nvar (v_as_nv x)
let is_var (t:term) : option nm =
let open R in
match t.t with
| Tm_FStar host_term ->
begin match R.inspect_ln host_term with
| R.Tv_Var nv ->
let nv_view = R.inspect_namedv nv in
Some {nm_index=nv_view.uniq;
nm_ppname=mk_ppname (nv_view.ppname) t.range}
| _ -> None
end
| _ -> None
let is_fvar (t:term) : option (R.name & list universe) =
let open R in
match t.t with
| Tm_FStar host_term ->
begin match inspect_ln host_term with
| Tv_FVar fv -> Some (inspect_fv fv, [])
| Tv_UInst fv us -> Some (inspect_fv fv, us)
| _ -> None
end
| _ -> None
let is_pure_app (t:term) : option (term & option qualifier & term) =
match t.t with
| Tm_FStar host_term ->
begin match R.inspect_ln host_term with
| R.Tv_App hd (arg, q) ->
let? hd =
match readback_ty hd with
| Some hd -> Some hd <: option term
| _ -> None in
let q = readback_qual q in
let? arg =
match readback_ty arg with
| Some arg -> Some arg <: option term
| _ -> None in
Some (hd, q, arg)
| _ -> None
end
| _ -> None
let leftmost_head (t:term) : option term =
match t.t with
| Tm_FStar host_term ->
let hd, _ = R.collect_app_ln host_term in
(match readback_ty hd with
| Some t -> Some t
| None -> None)
| _ -> None
let is_fvar_app (t:term) : option (R.name &
list universe &
option qualifier &
option term) =
match is_fvar t with
| Some (l, us) -> Some (l, us, None, None)
| None ->
match is_pure_app t with
| Some (head, q, arg) ->
(match is_fvar head with
| Some (l, us) -> Some (l, us, q, Some arg)
| None -> None)
| _ -> None
// | Tm_PureApp head q arg ->
// begin match is_fvar head with
// | Some (l, us) -> Some (l, us, q, Some arg)
// | None -> None
// end
// | _ -> None
let is_arrow (t:term) : option (binder & option qualifier & comp) =
match t.t with
| Tm_FStar host_term ->
begin match R.inspect_ln host_term with
| R.Tv_Arrow b c ->
let {ppname;qual;sort} = R.inspect_binder b in
begin match qual with
| R.Q_Meta _ -> None
| _ ->
let q = readback_qual qual in
let c_view = R.inspect_comp c in
begin match c_view with
| R.C_Total c_t ->
let? binder_ty = readback_ty sort in
let? c =
match readback_comp c_t with
| Some c -> Some c <: option Pulse.Syntax.Base.comp
| None -> None in
Some ({binder_ty;
binder_ppname=mk_ppname ppname (T.range_of_term host_term)},
q,
c)
| _ -> None
end
end
| _ -> None
end
| _ -> None
// TODO: write it better, with pattern matching on reflection syntax
let is_eq2 (t:term) : option (term & term) =
match is_pure_app t with
| Some (head, None, a2) ->
(match is_pure_app head with
| Some (head, None, a1) ->
(match is_pure_app head with
| Some (head, Some Implicit, _) ->
(match is_fvar head with
| Some (l, _) ->
if l = ["Pulse"; "Steel"; "Wrapper"; "eq2_prop"] ||
l = ["Prims"; "eq2"]
then Some (a1, a2)
else None
| _ -> None)
| _ -> None)
| _ -> None)
| _ -> None | false | true | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val unreveal (t: term) : option term | [] | Pulse.Syntax.Pure.unreveal | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | t: Pulse.Syntax.Base.term -> FStar.Pervasives.Native.option Pulse.Syntax.Base.term | {
"end_col": 13,
"end_line": 224,
"start_col": 2,
"start_line": 213
} |
Prims.Tot | val tm_fvar (l: fv) : term | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let tm_fvar (l:fv) : term =
tm_fstar (R.pack_ln (R.Tv_FVar (R.pack_fv l.fv_name)))
l.fv_range | val tm_fvar (l: fv) : term
let tm_fvar (l: fv) : term = | false | null | false | tm_fstar (R.pack_ln (R.Tv_FVar (R.pack_fv l.fv_name))) l.fv_range | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"Pulse.Syntax.Base.fv",
"Pulse.Syntax.Base.tm_fstar",
"FStar.Reflection.V2.Builtins.pack_ln",
"FStar.Reflection.V2.Data.Tv_FVar",
"FStar.Reflection.V2.Builtins.pack_fv",
"Pulse.Syntax.Base.__proj__Mkfv__item__fv_name",
"Pulse.Syntax.Base.__proj__Mkfv__item__fv_range",
"Pulse.Syntax.Base.term"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util
let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x
let u0 : universe = R.pack_universe R.Uv_Zero
let u1 : universe = R.pack_universe (R.Uv_Succ u0)
let u2 : universe = R.pack_universe (R.Uv_Succ u1)
let u_zero = u0
let u_succ (u:universe) : universe =
R.pack_universe (R.Uv_Succ u)
let u_var (s:string) : universe =
R.pack_universe (R.Uv_Name (R.pack_ident (s, FStar.Range.range_0)))
let u_max (u0 u1:universe) : universe =
R.pack_universe (R.Uv_Max [u0; u1])
let u_unknown : universe = R.pack_universe R.Uv_Unk
let tm_bvar (bv:bv) : term =
tm_fstar (R.pack_ln (R.Tv_BVar (R.pack_bv (RT.make_bv_with_name bv.bv_ppname.name bv.bv_index))))
bv.bv_ppname.range
let tm_var (nm:nm) : term =
tm_fstar (R.pack_ln (R.Tv_Var (R.pack_namedv (RT.make_namedv_with_name nm.nm_ppname.name nm.nm_index))))
nm.nm_ppname.range | false | true | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val tm_fvar (l: fv) : term | [] | Pulse.Syntax.Pure.tm_fvar | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | l: Pulse.Syntax.Base.fv -> Pulse.Syntax.Base.term | {
"end_col": 21,
"end_line": 40,
"start_col": 2,
"start_line": 39
} |
Prims.Tot | val tm_var (nm: nm) : term | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let tm_var (nm:nm) : term =
tm_fstar (R.pack_ln (R.Tv_Var (R.pack_namedv (RT.make_namedv_with_name nm.nm_ppname.name nm.nm_index))))
nm.nm_ppname.range | val tm_var (nm: nm) : term
let tm_var (nm: nm) : term = | false | null | false | tm_fstar (R.pack_ln (R.Tv_Var
(R.pack_namedv (RT.make_namedv_with_name nm.nm_ppname.name nm.nm_index))))
nm.nm_ppname.range | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"Pulse.Syntax.Base.nm",
"Pulse.Syntax.Base.tm_fstar",
"FStar.Reflection.V2.Builtins.pack_ln",
"FStar.Reflection.V2.Data.Tv_Var",
"FStar.Reflection.V2.Builtins.pack_namedv",
"FStar.Reflection.Typing.make_namedv_with_name",
"Pulse.Syntax.Base.__proj__Mkppname__item__name",
"Pulse.Syntax.Base.__proj__Mknm__item__nm_ppname",
"Pulse.Syntax.Base.__proj__Mknm__item__nm_index",
"Pulse.Syntax.Base.__proj__Mkppname__item__range",
"Pulse.Syntax.Base.term"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util
let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x
let u0 : universe = R.pack_universe R.Uv_Zero
let u1 : universe = R.pack_universe (R.Uv_Succ u0)
let u2 : universe = R.pack_universe (R.Uv_Succ u1)
let u_zero = u0
let u_succ (u:universe) : universe =
R.pack_universe (R.Uv_Succ u)
let u_var (s:string) : universe =
R.pack_universe (R.Uv_Name (R.pack_ident (s, FStar.Range.range_0)))
let u_max (u0 u1:universe) : universe =
R.pack_universe (R.Uv_Max [u0; u1])
let u_unknown : universe = R.pack_universe R.Uv_Unk
let tm_bvar (bv:bv) : term =
tm_fstar (R.pack_ln (R.Tv_BVar (R.pack_bv (RT.make_bv_with_name bv.bv_ppname.name bv.bv_index))))
bv.bv_ppname.range | false | true | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val tm_var (nm: nm) : term | [] | Pulse.Syntax.Pure.tm_var | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | nm: Pulse.Syntax.Base.nm -> Pulse.Syntax.Base.term | {
"end_col": 29,
"end_line": 36,
"start_col": 2,
"start_line": 35
} |
Prims.Tot | val is_eq2 (t: term) : option (term & term) | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let is_eq2 (t:term) : option (term & term) =
match is_pure_app t with
| Some (head, None, a2) ->
(match is_pure_app head with
| Some (head, None, a1) ->
(match is_pure_app head with
| Some (head, Some Implicit, _) ->
(match is_fvar head with
| Some (l, _) ->
if l = ["Pulse"; "Steel"; "Wrapper"; "eq2_prop"] ||
l = ["Prims"; "eq2"]
then Some (a1, a2)
else None
| _ -> None)
| _ -> None)
| _ -> None)
| _ -> None | val is_eq2 (t: term) : option (term & term)
let is_eq2 (t: term) : option (term & term) = | false | null | false | match is_pure_app t with
| Some (head, None, a2) ->
(match is_pure_app head with
| Some (head, None, a1) ->
(match is_pure_app head with
| Some (head, Some Implicit, _) ->
(match is_fvar head with
| Some (l, _) ->
if l = ["Pulse"; "Steel"; "Wrapper"; "eq2_prop"] || l = ["Prims"; "eq2"]
then Some (a1, a2)
else None
| _ -> None)
| _ -> None)
| _ -> None)
| _ -> None | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"Pulse.Syntax.Base.term",
"Pulse.Syntax.Pure.is_pure_app",
"Pulse.Syntax.Pure.is_fvar",
"FStar.Reflection.Types.name",
"Prims.list",
"Pulse.Syntax.Base.universe",
"Prims.op_BarBar",
"Prims.op_Equality",
"Prims.string",
"Prims.Cons",
"Prims.Nil",
"FStar.Pervasives.Native.Some",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.Mktuple2",
"Prims.bool",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.option",
"FStar.Pervasives.Native.tuple3",
"Pulse.Syntax.Base.qualifier"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util
let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x
let u0 : universe = R.pack_universe R.Uv_Zero
let u1 : universe = R.pack_universe (R.Uv_Succ u0)
let u2 : universe = R.pack_universe (R.Uv_Succ u1)
let u_zero = u0
let u_succ (u:universe) : universe =
R.pack_universe (R.Uv_Succ u)
let u_var (s:string) : universe =
R.pack_universe (R.Uv_Name (R.pack_ident (s, FStar.Range.range_0)))
let u_max (u0 u1:universe) : universe =
R.pack_universe (R.Uv_Max [u0; u1])
let u_unknown : universe = R.pack_universe R.Uv_Unk
let tm_bvar (bv:bv) : term =
tm_fstar (R.pack_ln (R.Tv_BVar (R.pack_bv (RT.make_bv_with_name bv.bv_ppname.name bv.bv_index))))
bv.bv_ppname.range
let tm_var (nm:nm) : term =
tm_fstar (R.pack_ln (R.Tv_Var (R.pack_namedv (RT.make_namedv_with_name nm.nm_ppname.name nm.nm_index))))
nm.nm_ppname.range
let tm_fvar (l:fv) : term =
tm_fstar (R.pack_ln (R.Tv_FVar (R.pack_fv l.fv_name)))
l.fv_range
let tm_uinst (l:fv) (us:list universe) : term =
tm_fstar (R.pack_ln (R.Tv_UInst (R.pack_fv l.fv_name) us))
l.fv_range
let tm_constant (c:constant) : term =
tm_fstar (R.pack_ln (R.Tv_Const c)) FStar.Range.range_0
let tm_refine (b:binder) (t:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder b.binder_ppname.name (elab_term b.binder_ty) in
tm_fstar (R.pack_ln (R.Tv_Refine rb (elab_term t)))
FStar.Range.range_0
let tm_let (t e1 e2:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder RT.pp_name_default (elab_term t) in
tm_fstar (R.pack_ln (R.Tv_Let false
[]
rb
(elab_term e1)
(elab_term e2)))
FStar.Range.range_0
let tm_pureapp (head:term) (q:option qualifier) (arg:term) : term =
tm_fstar (R.mk_app (elab_term head) [(elab_term arg, elab_qual q)])
FStar.Range.range_0
let tm_arrow (b:binder) (q:option qualifier) (c:comp) : term =
tm_fstar (mk_arrow_with_name b.binder_ppname.name (elab_term b.binder_ty, elab_qual q)
(elab_comp c))
FStar.Range.range_0
let tm_type (u:universe) : term =
tm_fstar (R.pack_ln (R.Tv_Type u)) FStar.Range.range_0
let mk_bvar (s:string) (r:Range.range) (i:index) : term =
tm_bvar {bv_index=i;bv_ppname=mk_ppname (RT.seal_pp_name s) r}
let null_var (v:var) : term =
tm_var {nm_index=v;nm_ppname=ppname_default}
let null_bvar (i:index) : term =
tm_bvar {bv_index=i;bv_ppname=ppname_default}
let term_of_nvar (x:nvar) : term =
tm_var { nm_index=snd x; nm_ppname=fst x}
let term_of_no_name_var (x:var) : term =
term_of_nvar (v_as_nv x)
let is_var (t:term) : option nm =
let open R in
match t.t with
| Tm_FStar host_term ->
begin match R.inspect_ln host_term with
| R.Tv_Var nv ->
let nv_view = R.inspect_namedv nv in
Some {nm_index=nv_view.uniq;
nm_ppname=mk_ppname (nv_view.ppname) t.range}
| _ -> None
end
| _ -> None
let is_fvar (t:term) : option (R.name & list universe) =
let open R in
match t.t with
| Tm_FStar host_term ->
begin match inspect_ln host_term with
| Tv_FVar fv -> Some (inspect_fv fv, [])
| Tv_UInst fv us -> Some (inspect_fv fv, us)
| _ -> None
end
| _ -> None
let is_pure_app (t:term) : option (term & option qualifier & term) =
match t.t with
| Tm_FStar host_term ->
begin match R.inspect_ln host_term with
| R.Tv_App hd (arg, q) ->
let? hd =
match readback_ty hd with
| Some hd -> Some hd <: option term
| _ -> None in
let q = readback_qual q in
let? arg =
match readback_ty arg with
| Some arg -> Some arg <: option term
| _ -> None in
Some (hd, q, arg)
| _ -> None
end
| _ -> None
let leftmost_head (t:term) : option term =
match t.t with
| Tm_FStar host_term ->
let hd, _ = R.collect_app_ln host_term in
(match readback_ty hd with
| Some t -> Some t
| None -> None)
| _ -> None
let is_fvar_app (t:term) : option (R.name &
list universe &
option qualifier &
option term) =
match is_fvar t with
| Some (l, us) -> Some (l, us, None, None)
| None ->
match is_pure_app t with
| Some (head, q, arg) ->
(match is_fvar head with
| Some (l, us) -> Some (l, us, q, Some arg)
| None -> None)
| _ -> None
// | Tm_PureApp head q arg ->
// begin match is_fvar head with
// | Some (l, us) -> Some (l, us, q, Some arg)
// | None -> None
// end
// | _ -> None
let is_arrow (t:term) : option (binder & option qualifier & comp) =
match t.t with
| Tm_FStar host_term ->
begin match R.inspect_ln host_term with
| R.Tv_Arrow b c ->
let {ppname;qual;sort} = R.inspect_binder b in
begin match qual with
| R.Q_Meta _ -> None
| _ ->
let q = readback_qual qual in
let c_view = R.inspect_comp c in
begin match c_view with
| R.C_Total c_t ->
let? binder_ty = readback_ty sort in
let? c =
match readback_comp c_t with
| Some c -> Some c <: option Pulse.Syntax.Base.comp
| None -> None in
Some ({binder_ty;
binder_ppname=mk_ppname ppname (T.range_of_term host_term)},
q,
c)
| _ -> None
end
end
| _ -> None
end
| _ -> None
// TODO: write it better, with pattern matching on reflection syntax | false | true | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val is_eq2 (t: term) : option (term & term) | [] | Pulse.Syntax.Pure.is_eq2 | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | t: Pulse.Syntax.Base.term
-> FStar.Pervasives.Native.option (Pulse.Syntax.Base.term * Pulse.Syntax.Base.term) | {
"end_col": 13,
"end_line": 210,
"start_col": 2,
"start_line": 195
} |
Prims.Tot | val is_arrow (t: term) : option (binder & option qualifier & comp) | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let is_arrow (t:term) : option (binder & option qualifier & comp) =
match t.t with
| Tm_FStar host_term ->
begin match R.inspect_ln host_term with
| R.Tv_Arrow b c ->
let {ppname;qual;sort} = R.inspect_binder b in
begin match qual with
| R.Q_Meta _ -> None
| _ ->
let q = readback_qual qual in
let c_view = R.inspect_comp c in
begin match c_view with
| R.C_Total c_t ->
let? binder_ty = readback_ty sort in
let? c =
match readback_comp c_t with
| Some c -> Some c <: option Pulse.Syntax.Base.comp
| None -> None in
Some ({binder_ty;
binder_ppname=mk_ppname ppname (T.range_of_term host_term)},
q,
c)
| _ -> None
end
end
| _ -> None
end
| _ -> None | val is_arrow (t: term) : option (binder & option qualifier & comp)
let is_arrow (t: term) : option (binder & option qualifier & comp) = | false | null | false | match t.t with
| Tm_FStar host_term ->
(match R.inspect_ln host_term with
| R.Tv_Arrow b c ->
let { ppname = ppname ; qual = qual ; sort = sort } = R.inspect_binder b in
(match qual with
| R.Q_Meta _ -> None
| _ ->
let q = readback_qual qual in
let c_view = R.inspect_comp c in
match c_view with
| R.C_Total c_t ->
let? binder_ty = readback_ty sort in
let? c =
match readback_comp c_t with
| Some c -> Some c <: option Pulse.Syntax.Base.comp
| None -> None
in
Some
({ binder_ty = binder_ty; binder_ppname = mk_ppname ppname (T.range_of_term host_term) },
q,
c)
| _ -> None)
| _ -> None)
| _ -> None | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"Pulse.Syntax.Base.term",
"Pulse.Syntax.Base.__proj__Mkterm__item__t",
"Pulse.Syntax.Base.host_term",
"FStar.Reflection.V2.Builtins.inspect_ln",
"FStar.Reflection.Types.binder",
"FStar.Reflection.Types.comp",
"FStar.Reflection.Types.typ",
"FStar.Reflection.V2.Data.aqualv",
"Prims.list",
"FStar.Reflection.Types.term",
"FStar.Reflection.V2.Data.ppname_t",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.tuple3",
"Pulse.Syntax.Base.binder",
"FStar.Pervasives.Native.option",
"Pulse.Syntax.Base.qualifier",
"Pulse.Syntax.Base.comp",
"Pulse.Syntax.Pure.op_let_Question",
"Prims.eq2",
"Pulse.Elaborate.Pure.elab_term",
"Pulse.Readback.readback_ty",
"Pulse.Readback.readback_comp",
"Pulse.Elaborate.Pure.elab_comp",
"FStar.Pervasives.Native.Some",
"FStar.Pervasives.Native.Mktuple3",
"Pulse.Syntax.Base.Mkbinder",
"Pulse.Syntax.Base.mk_ppname",
"FStar.Reflection.V2.Builtins.range_of_term",
"FStar.Reflection.V2.Data.comp_view",
"Prims.precedes",
"FStar.Reflection.V2.Builtins.inspect_comp",
"Pulse.Readback.readback_qual",
"FStar.Reflection.V2.Data.binder_view",
"FStar.Reflection.V2.Builtins.inspect_binder",
"FStar.Reflection.V2.Data.term_view",
"Pulse.Syntax.Base.term'"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util
let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x
let u0 : universe = R.pack_universe R.Uv_Zero
let u1 : universe = R.pack_universe (R.Uv_Succ u0)
let u2 : universe = R.pack_universe (R.Uv_Succ u1)
let u_zero = u0
let u_succ (u:universe) : universe =
R.pack_universe (R.Uv_Succ u)
let u_var (s:string) : universe =
R.pack_universe (R.Uv_Name (R.pack_ident (s, FStar.Range.range_0)))
let u_max (u0 u1:universe) : universe =
R.pack_universe (R.Uv_Max [u0; u1])
let u_unknown : universe = R.pack_universe R.Uv_Unk
let tm_bvar (bv:bv) : term =
tm_fstar (R.pack_ln (R.Tv_BVar (R.pack_bv (RT.make_bv_with_name bv.bv_ppname.name bv.bv_index))))
bv.bv_ppname.range
let tm_var (nm:nm) : term =
tm_fstar (R.pack_ln (R.Tv_Var (R.pack_namedv (RT.make_namedv_with_name nm.nm_ppname.name nm.nm_index))))
nm.nm_ppname.range
let tm_fvar (l:fv) : term =
tm_fstar (R.pack_ln (R.Tv_FVar (R.pack_fv l.fv_name)))
l.fv_range
let tm_uinst (l:fv) (us:list universe) : term =
tm_fstar (R.pack_ln (R.Tv_UInst (R.pack_fv l.fv_name) us))
l.fv_range
let tm_constant (c:constant) : term =
tm_fstar (R.pack_ln (R.Tv_Const c)) FStar.Range.range_0
let tm_refine (b:binder) (t:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder b.binder_ppname.name (elab_term b.binder_ty) in
tm_fstar (R.pack_ln (R.Tv_Refine rb (elab_term t)))
FStar.Range.range_0
let tm_let (t e1 e2:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder RT.pp_name_default (elab_term t) in
tm_fstar (R.pack_ln (R.Tv_Let false
[]
rb
(elab_term e1)
(elab_term e2)))
FStar.Range.range_0
let tm_pureapp (head:term) (q:option qualifier) (arg:term) : term =
tm_fstar (R.mk_app (elab_term head) [(elab_term arg, elab_qual q)])
FStar.Range.range_0
let tm_arrow (b:binder) (q:option qualifier) (c:comp) : term =
tm_fstar (mk_arrow_with_name b.binder_ppname.name (elab_term b.binder_ty, elab_qual q)
(elab_comp c))
FStar.Range.range_0
let tm_type (u:universe) : term =
tm_fstar (R.pack_ln (R.Tv_Type u)) FStar.Range.range_0
let mk_bvar (s:string) (r:Range.range) (i:index) : term =
tm_bvar {bv_index=i;bv_ppname=mk_ppname (RT.seal_pp_name s) r}
let null_var (v:var) : term =
tm_var {nm_index=v;nm_ppname=ppname_default}
let null_bvar (i:index) : term =
tm_bvar {bv_index=i;bv_ppname=ppname_default}
let term_of_nvar (x:nvar) : term =
tm_var { nm_index=snd x; nm_ppname=fst x}
let term_of_no_name_var (x:var) : term =
term_of_nvar (v_as_nv x)
let is_var (t:term) : option nm =
let open R in
match t.t with
| Tm_FStar host_term ->
begin match R.inspect_ln host_term with
| R.Tv_Var nv ->
let nv_view = R.inspect_namedv nv in
Some {nm_index=nv_view.uniq;
nm_ppname=mk_ppname (nv_view.ppname) t.range}
| _ -> None
end
| _ -> None
let is_fvar (t:term) : option (R.name & list universe) =
let open R in
match t.t with
| Tm_FStar host_term ->
begin match inspect_ln host_term with
| Tv_FVar fv -> Some (inspect_fv fv, [])
| Tv_UInst fv us -> Some (inspect_fv fv, us)
| _ -> None
end
| _ -> None
let is_pure_app (t:term) : option (term & option qualifier & term) =
match t.t with
| Tm_FStar host_term ->
begin match R.inspect_ln host_term with
| R.Tv_App hd (arg, q) ->
let? hd =
match readback_ty hd with
| Some hd -> Some hd <: option term
| _ -> None in
let q = readback_qual q in
let? arg =
match readback_ty arg with
| Some arg -> Some arg <: option term
| _ -> None in
Some (hd, q, arg)
| _ -> None
end
| _ -> None
let leftmost_head (t:term) : option term =
match t.t with
| Tm_FStar host_term ->
let hd, _ = R.collect_app_ln host_term in
(match readback_ty hd with
| Some t -> Some t
| None -> None)
| _ -> None
let is_fvar_app (t:term) : option (R.name &
list universe &
option qualifier &
option term) =
match is_fvar t with
| Some (l, us) -> Some (l, us, None, None)
| None ->
match is_pure_app t with
| Some (head, q, arg) ->
(match is_fvar head with
| Some (l, us) -> Some (l, us, q, Some arg)
| None -> None)
| _ -> None
// | Tm_PureApp head q arg ->
// begin match is_fvar head with
// | Some (l, us) -> Some (l, us, q, Some arg)
// | None -> None
// end
// | _ -> None | false | true | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val is_arrow (t: term) : option (binder & option qualifier & comp) | [] | Pulse.Syntax.Pure.is_arrow | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | t: Pulse.Syntax.Base.term
-> FStar.Pervasives.Native.option ((Pulse.Syntax.Base.binder *
FStar.Pervasives.Native.option Pulse.Syntax.Base.qualifier) *
Pulse.Syntax.Base.comp) | {
"end_col": 13,
"end_line": 191,
"start_col": 2,
"start_line": 164
} |
Prims.Tot | val tm_bvar (bv: bv) : term | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let tm_bvar (bv:bv) : term =
tm_fstar (R.pack_ln (R.Tv_BVar (R.pack_bv (RT.make_bv_with_name bv.bv_ppname.name bv.bv_index))))
bv.bv_ppname.range | val tm_bvar (bv: bv) : term
let tm_bvar (bv: bv) : term = | false | null | false | tm_fstar (R.pack_ln (R.Tv_BVar (R.pack_bv (RT.make_bv_with_name bv.bv_ppname.name bv.bv_index))))
bv.bv_ppname.range | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"Pulse.Syntax.Base.bv",
"Pulse.Syntax.Base.tm_fstar",
"FStar.Reflection.V2.Builtins.pack_ln",
"FStar.Reflection.V2.Data.Tv_BVar",
"FStar.Reflection.V2.Builtins.pack_bv",
"FStar.Reflection.Typing.make_bv_with_name",
"Pulse.Syntax.Base.__proj__Mkppname__item__name",
"Pulse.Syntax.Base.__proj__Mkbv__item__bv_ppname",
"Pulse.Syntax.Base.__proj__Mkbv__item__bv_index",
"Pulse.Syntax.Base.__proj__Mkppname__item__range",
"Pulse.Syntax.Base.term"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util
let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x
let u0 : universe = R.pack_universe R.Uv_Zero
let u1 : universe = R.pack_universe (R.Uv_Succ u0)
let u2 : universe = R.pack_universe (R.Uv_Succ u1)
let u_zero = u0
let u_succ (u:universe) : universe =
R.pack_universe (R.Uv_Succ u)
let u_var (s:string) : universe =
R.pack_universe (R.Uv_Name (R.pack_ident (s, FStar.Range.range_0)))
let u_max (u0 u1:universe) : universe =
R.pack_universe (R.Uv_Max [u0; u1])
let u_unknown : universe = R.pack_universe R.Uv_Unk | false | true | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val tm_bvar (bv: bv) : term | [] | Pulse.Syntax.Pure.tm_bvar | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | bv: Pulse.Syntax.Base.bv -> Pulse.Syntax.Base.term | {
"end_col": 30,
"end_line": 32,
"start_col": 2,
"start_line": 31
} |
Prims.Tot | val tm_arrow (b: binder) (q: option qualifier) (c: comp) : term | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Readback",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let tm_arrow (b:binder) (q:option qualifier) (c:comp) : term =
tm_fstar (mk_arrow_with_name b.binder_ppname.name (elab_term b.binder_ty, elab_qual q)
(elab_comp c))
FStar.Range.range_0 | val tm_arrow (b: binder) (q: option qualifier) (c: comp) : term
let tm_arrow (b: binder) (q: option qualifier) (c: comp) : term = | false | null | false | tm_fstar (mk_arrow_with_name b.binder_ppname.name (elab_term b.binder_ty, elab_qual q) (elab_comp c)
)
FStar.Range.range_0 | {
"checked_file": "Pulse.Syntax.Pure.fst.checked",
"dependencies": [
"Pulse.Syntax.Base.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Readback.fsti.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Syntax.Pure.fst"
} | [
"total"
] | [
"Pulse.Syntax.Base.binder",
"FStar.Pervasives.Native.option",
"Pulse.Syntax.Base.qualifier",
"Pulse.Syntax.Base.comp",
"Pulse.Syntax.Base.tm_fstar",
"Pulse.Reflection.Util.mk_arrow_with_name",
"Pulse.Syntax.Base.__proj__Mkppname__item__name",
"Pulse.Syntax.Base.__proj__Mkbinder__item__binder_ppname",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Reflection.Types.term",
"FStar.Reflection.V2.Data.aqualv",
"Pulse.Elaborate.Pure.elab_term",
"Pulse.Syntax.Base.__proj__Mkbinder__item__binder_ty",
"Pulse.Elaborate.Pure.elab_qual",
"Pulse.Elaborate.Pure.elab_comp",
"FStar.Range.range_0",
"Pulse.Syntax.Base.term"
] | [] | module Pulse.Syntax.Pure
module R = FStar.Reflection.V2
module T = FStar.Tactics.V2
module RT = FStar.Reflection.Typing
open Pulse.Syntax.Base
open Pulse.Elaborate.Pure
open Pulse.Readback
open Pulse.Reflection.Util
let (let?) (f:option 'a) (g:'a -> option 'b) : option 'b =
match f with
| None -> None
| Some x -> g x
let u0 : universe = R.pack_universe R.Uv_Zero
let u1 : universe = R.pack_universe (R.Uv_Succ u0)
let u2 : universe = R.pack_universe (R.Uv_Succ u1)
let u_zero = u0
let u_succ (u:universe) : universe =
R.pack_universe (R.Uv_Succ u)
let u_var (s:string) : universe =
R.pack_universe (R.Uv_Name (R.pack_ident (s, FStar.Range.range_0)))
let u_max (u0 u1:universe) : universe =
R.pack_universe (R.Uv_Max [u0; u1])
let u_unknown : universe = R.pack_universe R.Uv_Unk
let tm_bvar (bv:bv) : term =
tm_fstar (R.pack_ln (R.Tv_BVar (R.pack_bv (RT.make_bv_with_name bv.bv_ppname.name bv.bv_index))))
bv.bv_ppname.range
let tm_var (nm:nm) : term =
tm_fstar (R.pack_ln (R.Tv_Var (R.pack_namedv (RT.make_namedv_with_name nm.nm_ppname.name nm.nm_index))))
nm.nm_ppname.range
let tm_fvar (l:fv) : term =
tm_fstar (R.pack_ln (R.Tv_FVar (R.pack_fv l.fv_name)))
l.fv_range
let tm_uinst (l:fv) (us:list universe) : term =
tm_fstar (R.pack_ln (R.Tv_UInst (R.pack_fv l.fv_name) us))
l.fv_range
let tm_constant (c:constant) : term =
tm_fstar (R.pack_ln (R.Tv_Const c)) FStar.Range.range_0
let tm_refine (b:binder) (t:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder b.binder_ppname.name (elab_term b.binder_ty) in
tm_fstar (R.pack_ln (R.Tv_Refine rb (elab_term t)))
FStar.Range.range_0
let tm_let (t e1 e2:term) : term =
let rb : R.simple_binder = RT.mk_simple_binder RT.pp_name_default (elab_term t) in
tm_fstar (R.pack_ln (R.Tv_Let false
[]
rb
(elab_term e1)
(elab_term e2)))
FStar.Range.range_0
let tm_pureapp (head:term) (q:option qualifier) (arg:term) : term =
tm_fstar (R.mk_app (elab_term head) [(elab_term arg, elab_qual q)])
FStar.Range.range_0 | false | true | Pulse.Syntax.Pure.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val tm_arrow (b: binder) (q: option qualifier) (c: comp) : term | [] | Pulse.Syntax.Pure.tm_arrow | {
"file_name": "lib/steel/pulse/Pulse.Syntax.Pure.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} |
b: Pulse.Syntax.Base.binder ->
q: FStar.Pervasives.Native.option Pulse.Syntax.Base.qualifier ->
c: Pulse.Syntax.Base.comp
-> Pulse.Syntax.Base.term | {
"end_col": 30,
"end_line": 70,
"start_col": 2,
"start_line": 68
} |
Prims.Tot | val parse_bounded_integer_kind (i: integer_size) : Tot parser_kind | [
{
"abbrev": true,
"full_module": "FStar.Endianness",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Int",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let parse_bounded_integer_kind
(i: integer_size)
: Tot parser_kind
= total_constant_size_parser_kind i | val parse_bounded_integer_kind (i: integer_size) : Tot parser_kind
let parse_bounded_integer_kind (i: integer_size) : Tot parser_kind = | false | null | false | total_constant_size_parser_kind i | {
"checked_file": "LowParse.Spec.BoundedInt.fsti.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Int.fsti.checked",
"LowParse.Spec.Base.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Endianness.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Spec.BoundedInt.fsti"
} | [
"total"
] | [
"LowParse.Spec.BoundedInt.integer_size",
"LowParse.Spec.Base.total_constant_size_parser_kind",
"LowParse.Spec.Base.parser_kind"
] | [] | module LowParse.Spec.BoundedInt
include LowParse.Spec.Base
include LowParse.Spec.Int // for parse_u16_kind
open FStar.Mul
module Seq = FStar.Seq
module U8 = FStar.UInt8
module U16 = FStar.UInt16
module U32 = FStar.UInt32
module E = FStar.Endianness
(* bounded integers *)
let integer_size : Type = (sz: nat { 1 <= sz /\ sz <= 4 } )
val integer_size_values (i: integer_size) : Lemma
(i == 1 \/ i == 2 \/ i == 3 \/ i == 4)
let bounded_integer_prop
(i: integer_size)
(u: U32.t)
: GTot Type0
= U32.v u < (match i with 1 -> 256 | 2 -> 65536 | 3 -> 16777216 | 4 -> 4294967296)
val bounded_integer_prop_equiv
(i: integer_size)
(u: U32.t)
: Lemma
(bounded_integer_prop i u <==> U32.v u < pow2 (8 * i))
inline_for_extraction
let bounded_integer
(i: integer_size)
: Tot Type
= (u: U32.t { bounded_integer_prop i u } )
inline_for_extraction
let parse_bounded_integer_kind
(i: integer_size) | false | true | LowParse.Spec.BoundedInt.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val parse_bounded_integer_kind (i: integer_size) : Tot parser_kind | [] | LowParse.Spec.BoundedInt.parse_bounded_integer_kind | {
"file_name": "src/lowparse/LowParse.Spec.BoundedInt.fsti",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | i: LowParse.Spec.BoundedInt.integer_size -> LowParse.Spec.Base.parser_kind | {
"end_col": 35,
"end_line": 42,
"start_col": 2,
"start_line": 42
} |
Prims.GTot | val in_bounds (min max: nat) (x: U32.t) : GTot bool | [
{
"abbrev": true,
"full_module": "FStar.Endianness",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Int",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let in_bounds
(min: nat)
(max: nat)
(x: U32.t)
: GTot bool
= not (U32.v x < min || max < U32.v x) | val in_bounds (min max: nat) (x: U32.t) : GTot bool
let in_bounds (min max: nat) (x: U32.t) : GTot bool = | false | null | false | not (U32.v x < min || max < U32.v x) | {
"checked_file": "LowParse.Spec.BoundedInt.fsti.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Int.fsti.checked",
"LowParse.Spec.Base.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Endianness.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Spec.BoundedInt.fsti"
} | [
"sometrivial"
] | [
"Prims.nat",
"FStar.UInt32.t",
"Prims.op_Negation",
"Prims.op_BarBar",
"Prims.op_LessThan",
"FStar.UInt32.v",
"Prims.bool"
] | [] | module LowParse.Spec.BoundedInt
include LowParse.Spec.Base
include LowParse.Spec.Int // for parse_u16_kind
open FStar.Mul
module Seq = FStar.Seq
module U8 = FStar.UInt8
module U16 = FStar.UInt16
module U32 = FStar.UInt32
module E = FStar.Endianness
(* bounded integers *)
let integer_size : Type = (sz: nat { 1 <= sz /\ sz <= 4 } )
val integer_size_values (i: integer_size) : Lemma
(i == 1 \/ i == 2 \/ i == 3 \/ i == 4)
let bounded_integer_prop
(i: integer_size)
(u: U32.t)
: GTot Type0
= U32.v u < (match i with 1 -> 256 | 2 -> 65536 | 3 -> 16777216 | 4 -> 4294967296)
val bounded_integer_prop_equiv
(i: integer_size)
(u: U32.t)
: Lemma
(bounded_integer_prop i u <==> U32.v u < pow2 (8 * i))
inline_for_extraction
let bounded_integer
(i: integer_size)
: Tot Type
= (u: U32.t { bounded_integer_prop i u } )
inline_for_extraction
let parse_bounded_integer_kind
(i: integer_size)
: Tot parser_kind
= total_constant_size_parser_kind i
val parse_bounded_integer
(i: integer_size)
: Tot (parser (parse_bounded_integer_kind i) (bounded_integer i))
val parse_bounded_integer_spec
(i: integer_size)
(input: bytes)
: Lemma
(let res = parse (parse_bounded_integer i) input in
if Seq.length input < i
then res == None
else
match res with
| None -> False
| Some (y, consumed) ->
U32.v y == E.be_to_n (Seq.slice input 0 i) /\ consumed == i
)
val serialize_bounded_integer
(sz: integer_size)
: Tot (serializer (parse_bounded_integer sz))
#push-options "--initial_fuel 8 --max_fuel 8 --initial_ifuel 0 --max_ifuel 0 --z3rlimit 20"
val serialize_bounded_integer_spec
(sz: integer_size)
(x: bounded_integer sz)
: Lemma
(let (bx : nat {bx < pow2 (8 `FStar.Mul.op_Star` sz)}) = U32.v x in
serialize (serialize_bounded_integer sz) x == E.n_to_be sz bx)
val parse_bounded_integer_le
(i: integer_size)
: Tot (parser (parse_bounded_integer_kind i) (bounded_integer i))
val parse_u16_le : parser parse_u16_kind U16.t
val parse_u32_le : parser parse_u32_kind U32.t
val serialize_bounded_integer_le
(sz: integer_size)
: Tot (serializer (parse_bounded_integer_le sz))
val serialize_u16_le : serializer parse_u16_le
val serialize_u32_le : serializer parse_u32_le
inline_for_extraction
let log256'
(n: nat)
: Pure integer_size
(requires (n > 0 /\ n < 4294967296))
(ensures (fun l ->
pow2 (FStar.Mul.op_Star 8 (l - 1)) <= n /\
n < pow2 (FStar.Mul.op_Star 8 l)
))
= [@inline_let]
let _ = assert_norm (pow2 32 == 4294967296) in
[@inline_let]
let _ = assert (n < pow2 32) in
[@inline_let]
let z0 = 1 in
[@inline_let]
let z1 = 256 in
[@inline_let]
let _ = assert_norm (z1 == Prims.op_Multiply 256 z0) in
[@inline_let]
let l = 1 in
[@inline_let]
let _ = assert_norm (pow2 (Prims.op_Multiply 8 l) == z1) in
[@inline_let]
let _ = assert_norm (pow2 (Prims.op_Multiply 8 (l - 1)) == z0) in
if n < z1
then begin
[@inline_let]
let _ = assert (pow2 (Prims.op_Multiply 8 (l - 1)) <= n) in
[@inline_let]
let _ = assert (n < pow2 (Prims.op_Multiply 8 l)) in
l
end else begin
[@inline_let]
let z2 = 65536 in
[@inline_let]
let _ = assert_norm (z2 == Prims.op_Multiply 256 z1) in
[@inline_let]
let l = 2 in
[@inline_let]
let _ = assert_norm (pow2 (Prims.op_Multiply 8 l) == z2) in
if n < z2
then begin
[@inline_let]
let _ = assert (pow2 (Prims.op_Multiply 8 (l - 1)) <= n) in
[@inline_let]
let _ = assert (n < pow2 (Prims.op_Multiply 8 l)) in
l
end else begin
[@inline_let]
let z3 = 16777216 in
[@inline_let]
let _ = assert_norm (z3 == Prims.op_Multiply 256 z2) in
[@inline_let]
let l = 3 in
[@inline_let]
let _ = assert_norm (pow2 (Prims.op_Multiply 8 l) == z3) in
if n < z3
then begin
[@inline_let]
let _ = assert (pow2 (Prims.op_Multiply 8 (l - 1)) <= n) in
[@inline_let]
let _ = assert (n < pow2 (Prims.op_Multiply 8 l)) in
l
end else begin
[@inline_let]
let l = 4 in
[@inline_let]
let _ = assert_norm (pow2 (Prims.op_Multiply 8 l) == Prims.op_Multiply 256 z3) in
[@inline_let]
let _ = assert (pow2 (Prims.op_Multiply 8 (l - 1)) <= n) in
[@inline_let]
let _ = assert (n < pow2 (Prims.op_Multiply 8 l)) in
l
end
end
end
let in_bounds
(min: nat)
(max: nat)
(x: U32.t) | false | false | LowParse.Spec.BoundedInt.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 8,
"initial_ifuel": 0,
"max_fuel": 8,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 20,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val in_bounds (min max: nat) (x: U32.t) : GTot bool | [] | LowParse.Spec.BoundedInt.in_bounds | {
"file_name": "src/lowparse/LowParse.Spec.BoundedInt.fsti",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | min: Prims.nat -> max: Prims.nat -> x: FStar.UInt32.t -> Prims.GTot Prims.bool | {
"end_col": 38,
"end_line": 173,
"start_col": 2,
"start_line": 173
} |
Prims.GTot | val bounded_integer_prop (i: integer_size) (u: U32.t) : GTot Type0 | [
{
"abbrev": true,
"full_module": "FStar.Endianness",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Int",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let bounded_integer_prop
(i: integer_size)
(u: U32.t)
: GTot Type0
= U32.v u < (match i with 1 -> 256 | 2 -> 65536 | 3 -> 16777216 | 4 -> 4294967296) | val bounded_integer_prop (i: integer_size) (u: U32.t) : GTot Type0
let bounded_integer_prop (i: integer_size) (u: U32.t) : GTot Type0 = | false | null | false | U32.v u <
(match i with
| 1 -> 256
| 2 -> 65536
| 3 -> 16777216
| 4 -> 4294967296) | {
"checked_file": "LowParse.Spec.BoundedInt.fsti.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Int.fsti.checked",
"LowParse.Spec.Base.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Endianness.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Spec.BoundedInt.fsti"
} | [
"sometrivial"
] | [
"LowParse.Spec.BoundedInt.integer_size",
"FStar.UInt32.t",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.UInt32.v",
"Prims.int"
] | [] | module LowParse.Spec.BoundedInt
include LowParse.Spec.Base
include LowParse.Spec.Int // for parse_u16_kind
open FStar.Mul
module Seq = FStar.Seq
module U8 = FStar.UInt8
module U16 = FStar.UInt16
module U32 = FStar.UInt32
module E = FStar.Endianness
(* bounded integers *)
let integer_size : Type = (sz: nat { 1 <= sz /\ sz <= 4 } )
val integer_size_values (i: integer_size) : Lemma
(i == 1 \/ i == 2 \/ i == 3 \/ i == 4)
let bounded_integer_prop
(i: integer_size)
(u: U32.t) | false | false | LowParse.Spec.BoundedInt.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val bounded_integer_prop (i: integer_size) (u: U32.t) : GTot Type0 | [] | LowParse.Spec.BoundedInt.bounded_integer_prop | {
"file_name": "src/lowparse/LowParse.Spec.BoundedInt.fsti",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | i: LowParse.Spec.BoundedInt.integer_size -> u3: FStar.UInt32.t -> Prims.GTot Type0 | {
"end_col": 82,
"end_line": 24,
"start_col": 2,
"start_line": 24
} |
Prims.Tot | val parse_bounded_int32_fixed_size_kind:parser_kind | [
{
"abbrev": true,
"full_module": "FStar.Endianness",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Int",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let parse_bounded_int32_fixed_size_kind
: parser_kind =
{
parser_kind_low = 4;
parser_kind_high = Some 4;
parser_kind_metadata = None;
parser_kind_subkind = Some ParserStrong;
} | val parse_bounded_int32_fixed_size_kind:parser_kind
let parse_bounded_int32_fixed_size_kind:parser_kind = | false | null | false | {
parser_kind_low = 4;
parser_kind_high = Some 4;
parser_kind_metadata = None;
parser_kind_subkind = Some ParserStrong
} | {
"checked_file": "LowParse.Spec.BoundedInt.fsti.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Int.fsti.checked",
"LowParse.Spec.Base.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Endianness.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Spec.BoundedInt.fsti"
} | [
"total"
] | [
"LowParse.Spec.Base.Mkparser_kind'",
"FStar.Pervasives.Native.Some",
"Prims.nat",
"LowParse.Spec.Base.parser_subkind",
"LowParse.Spec.Base.ParserStrong",
"FStar.Pervasives.Native.None",
"LowParse.Spec.Base.parser_kind_metadata_some"
] | [] | module LowParse.Spec.BoundedInt
include LowParse.Spec.Base
include LowParse.Spec.Int // for parse_u16_kind
open FStar.Mul
module Seq = FStar.Seq
module U8 = FStar.UInt8
module U16 = FStar.UInt16
module U32 = FStar.UInt32
module E = FStar.Endianness
(* bounded integers *)
let integer_size : Type = (sz: nat { 1 <= sz /\ sz <= 4 } )
val integer_size_values (i: integer_size) : Lemma
(i == 1 \/ i == 2 \/ i == 3 \/ i == 4)
let bounded_integer_prop
(i: integer_size)
(u: U32.t)
: GTot Type0
= U32.v u < (match i with 1 -> 256 | 2 -> 65536 | 3 -> 16777216 | 4 -> 4294967296)
val bounded_integer_prop_equiv
(i: integer_size)
(u: U32.t)
: Lemma
(bounded_integer_prop i u <==> U32.v u < pow2 (8 * i))
inline_for_extraction
let bounded_integer
(i: integer_size)
: Tot Type
= (u: U32.t { bounded_integer_prop i u } )
inline_for_extraction
let parse_bounded_integer_kind
(i: integer_size)
: Tot parser_kind
= total_constant_size_parser_kind i
val parse_bounded_integer
(i: integer_size)
: Tot (parser (parse_bounded_integer_kind i) (bounded_integer i))
val parse_bounded_integer_spec
(i: integer_size)
(input: bytes)
: Lemma
(let res = parse (parse_bounded_integer i) input in
if Seq.length input < i
then res == None
else
match res with
| None -> False
| Some (y, consumed) ->
U32.v y == E.be_to_n (Seq.slice input 0 i) /\ consumed == i
)
val serialize_bounded_integer
(sz: integer_size)
: Tot (serializer (parse_bounded_integer sz))
#push-options "--initial_fuel 8 --max_fuel 8 --initial_ifuel 0 --max_ifuel 0 --z3rlimit 20"
val serialize_bounded_integer_spec
(sz: integer_size)
(x: bounded_integer sz)
: Lemma
(let (bx : nat {bx < pow2 (8 `FStar.Mul.op_Star` sz)}) = U32.v x in
serialize (serialize_bounded_integer sz) x == E.n_to_be sz bx)
val parse_bounded_integer_le
(i: integer_size)
: Tot (parser (parse_bounded_integer_kind i) (bounded_integer i))
val parse_u16_le : parser parse_u16_kind U16.t
val parse_u32_le : parser parse_u32_kind U32.t
val serialize_bounded_integer_le
(sz: integer_size)
: Tot (serializer (parse_bounded_integer_le sz))
val serialize_u16_le : serializer parse_u16_le
val serialize_u32_le : serializer parse_u32_le
inline_for_extraction
let log256'
(n: nat)
: Pure integer_size
(requires (n > 0 /\ n < 4294967296))
(ensures (fun l ->
pow2 (FStar.Mul.op_Star 8 (l - 1)) <= n /\
n < pow2 (FStar.Mul.op_Star 8 l)
))
= [@inline_let]
let _ = assert_norm (pow2 32 == 4294967296) in
[@inline_let]
let _ = assert (n < pow2 32) in
[@inline_let]
let z0 = 1 in
[@inline_let]
let z1 = 256 in
[@inline_let]
let _ = assert_norm (z1 == Prims.op_Multiply 256 z0) in
[@inline_let]
let l = 1 in
[@inline_let]
let _ = assert_norm (pow2 (Prims.op_Multiply 8 l) == z1) in
[@inline_let]
let _ = assert_norm (pow2 (Prims.op_Multiply 8 (l - 1)) == z0) in
if n < z1
then begin
[@inline_let]
let _ = assert (pow2 (Prims.op_Multiply 8 (l - 1)) <= n) in
[@inline_let]
let _ = assert (n < pow2 (Prims.op_Multiply 8 l)) in
l
end else begin
[@inline_let]
let z2 = 65536 in
[@inline_let]
let _ = assert_norm (z2 == Prims.op_Multiply 256 z1) in
[@inline_let]
let l = 2 in
[@inline_let]
let _ = assert_norm (pow2 (Prims.op_Multiply 8 l) == z2) in
if n < z2
then begin
[@inline_let]
let _ = assert (pow2 (Prims.op_Multiply 8 (l - 1)) <= n) in
[@inline_let]
let _ = assert (n < pow2 (Prims.op_Multiply 8 l)) in
l
end else begin
[@inline_let]
let z3 = 16777216 in
[@inline_let]
let _ = assert_norm (z3 == Prims.op_Multiply 256 z2) in
[@inline_let]
let l = 3 in
[@inline_let]
let _ = assert_norm (pow2 (Prims.op_Multiply 8 l) == z3) in
if n < z3
then begin
[@inline_let]
let _ = assert (pow2 (Prims.op_Multiply 8 (l - 1)) <= n) in
[@inline_let]
let _ = assert (n < pow2 (Prims.op_Multiply 8 l)) in
l
end else begin
[@inline_let]
let l = 4 in
[@inline_let]
let _ = assert_norm (pow2 (Prims.op_Multiply 8 l) == Prims.op_Multiply 256 z3) in
[@inline_let]
let _ = assert (pow2 (Prims.op_Multiply 8 (l - 1)) <= n) in
[@inline_let]
let _ = assert (n < pow2 (Prims.op_Multiply 8 l)) in
l
end
end
end
let in_bounds
(min: nat)
(max: nat)
(x: U32.t)
: GTot bool
= not (U32.v x < min || max < U32.v x)
inline_for_extraction
let bounded_int32
(min: nat)
(max: nat { min <= max })
: Tot Type
= (x: U32.t { in_bounds min max x } )
// unfold
inline_for_extraction
let parse_bounded_int32_kind
(max: nat { 0 < max /\ max < 4294967296 })
: Tot parser_kind =
[@inline_let]
let sz = log256' max in
{
parser_kind_low = sz;
parser_kind_high = Some sz;
parser_kind_metadata = None;
parser_kind_subkind = Some ParserStrong;
}
val parse_bounded_int32
(min: nat)
(max: nat { 0 < max /\ min <= max /\ max < 4294967296 })
: Tot (parser (parse_bounded_int32_kind max) (bounded_int32 min max))
val serialize_bounded_int32
(min: nat)
(max: nat { 0 < max /\ min <= max /\ max < 4294967296 })
: Tot (serializer (parse_bounded_int32 min max))
val parse_bounded_int32_le
(min: nat)
(max: nat { 0 < max /\ min <= max /\ max < 4294967296 })
: Tot (parser (parse_bounded_int32_kind max) (bounded_int32 min max))
val serialize_bounded_int32_le
(min: nat)
(max: nat { 0 < max /\ min <= max /\ max < 4294967296 })
: Tot (serializer (parse_bounded_int32_le min max))
// unfold
inline_for_extraction
let parse_bounded_int32_fixed_size_kind
: parser_kind = | false | true | LowParse.Spec.BoundedInt.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 8,
"initial_ifuel": 0,
"max_fuel": 8,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 20,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val parse_bounded_int32_fixed_size_kind:parser_kind | [] | LowParse.Spec.BoundedInt.parse_bounded_int32_fixed_size_kind | {
"file_name": "src/lowparse/LowParse.Spec.BoundedInt.fsti",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | LowParse.Spec.Base.parser_kind | {
"end_col": 44,
"end_line": 224,
"start_col": 4,
"start_line": 221
} |
Prims.Tot | val parse_bounded_int32_kind (max: nat{0 < max /\ max < 4294967296}) : Tot parser_kind | [
{
"abbrev": true,
"full_module": "FStar.Endianness",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Int",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let parse_bounded_int32_kind
(max: nat { 0 < max /\ max < 4294967296 })
: Tot parser_kind =
[@inline_let]
let sz = log256' max in
{
parser_kind_low = sz;
parser_kind_high = Some sz;
parser_kind_metadata = None;
parser_kind_subkind = Some ParserStrong;
} | val parse_bounded_int32_kind (max: nat{0 < max /\ max < 4294967296}) : Tot parser_kind
let parse_bounded_int32_kind (max: nat{0 < max /\ max < 4294967296}) : Tot parser_kind = | false | null | false | [@@ inline_let ]let sz = log256' max in
{
parser_kind_low = sz;
parser_kind_high = Some sz;
parser_kind_metadata = None;
parser_kind_subkind = Some ParserStrong
} | {
"checked_file": "LowParse.Spec.BoundedInt.fsti.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Int.fsti.checked",
"LowParse.Spec.Base.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Endianness.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Spec.BoundedInt.fsti"
} | [
"total"
] | [
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"LowParse.Spec.Base.Mkparser_kind'",
"FStar.Pervasives.Native.Some",
"LowParse.Spec.Base.parser_subkind",
"LowParse.Spec.Base.ParserStrong",
"FStar.Pervasives.Native.None",
"LowParse.Spec.Base.parser_kind_metadata_some",
"LowParse.Spec.BoundedInt.integer_size",
"LowParse.Spec.BoundedInt.log256'",
"LowParse.Spec.Base.parser_kind"
] | [] | module LowParse.Spec.BoundedInt
include LowParse.Spec.Base
include LowParse.Spec.Int // for parse_u16_kind
open FStar.Mul
module Seq = FStar.Seq
module U8 = FStar.UInt8
module U16 = FStar.UInt16
module U32 = FStar.UInt32
module E = FStar.Endianness
(* bounded integers *)
let integer_size : Type = (sz: nat { 1 <= sz /\ sz <= 4 } )
val integer_size_values (i: integer_size) : Lemma
(i == 1 \/ i == 2 \/ i == 3 \/ i == 4)
let bounded_integer_prop
(i: integer_size)
(u: U32.t)
: GTot Type0
= U32.v u < (match i with 1 -> 256 | 2 -> 65536 | 3 -> 16777216 | 4 -> 4294967296)
val bounded_integer_prop_equiv
(i: integer_size)
(u: U32.t)
: Lemma
(bounded_integer_prop i u <==> U32.v u < pow2 (8 * i))
inline_for_extraction
let bounded_integer
(i: integer_size)
: Tot Type
= (u: U32.t { bounded_integer_prop i u } )
inline_for_extraction
let parse_bounded_integer_kind
(i: integer_size)
: Tot parser_kind
= total_constant_size_parser_kind i
val parse_bounded_integer
(i: integer_size)
: Tot (parser (parse_bounded_integer_kind i) (bounded_integer i))
val parse_bounded_integer_spec
(i: integer_size)
(input: bytes)
: Lemma
(let res = parse (parse_bounded_integer i) input in
if Seq.length input < i
then res == None
else
match res with
| None -> False
| Some (y, consumed) ->
U32.v y == E.be_to_n (Seq.slice input 0 i) /\ consumed == i
)
val serialize_bounded_integer
(sz: integer_size)
: Tot (serializer (parse_bounded_integer sz))
#push-options "--initial_fuel 8 --max_fuel 8 --initial_ifuel 0 --max_ifuel 0 --z3rlimit 20"
val serialize_bounded_integer_spec
(sz: integer_size)
(x: bounded_integer sz)
: Lemma
(let (bx : nat {bx < pow2 (8 `FStar.Mul.op_Star` sz)}) = U32.v x in
serialize (serialize_bounded_integer sz) x == E.n_to_be sz bx)
val parse_bounded_integer_le
(i: integer_size)
: Tot (parser (parse_bounded_integer_kind i) (bounded_integer i))
val parse_u16_le : parser parse_u16_kind U16.t
val parse_u32_le : parser parse_u32_kind U32.t
val serialize_bounded_integer_le
(sz: integer_size)
: Tot (serializer (parse_bounded_integer_le sz))
val serialize_u16_le : serializer parse_u16_le
val serialize_u32_le : serializer parse_u32_le
inline_for_extraction
let log256'
(n: nat)
: Pure integer_size
(requires (n > 0 /\ n < 4294967296))
(ensures (fun l ->
pow2 (FStar.Mul.op_Star 8 (l - 1)) <= n /\
n < pow2 (FStar.Mul.op_Star 8 l)
))
= [@inline_let]
let _ = assert_norm (pow2 32 == 4294967296) in
[@inline_let]
let _ = assert (n < pow2 32) in
[@inline_let]
let z0 = 1 in
[@inline_let]
let z1 = 256 in
[@inline_let]
let _ = assert_norm (z1 == Prims.op_Multiply 256 z0) in
[@inline_let]
let l = 1 in
[@inline_let]
let _ = assert_norm (pow2 (Prims.op_Multiply 8 l) == z1) in
[@inline_let]
let _ = assert_norm (pow2 (Prims.op_Multiply 8 (l - 1)) == z0) in
if n < z1
then begin
[@inline_let]
let _ = assert (pow2 (Prims.op_Multiply 8 (l - 1)) <= n) in
[@inline_let]
let _ = assert (n < pow2 (Prims.op_Multiply 8 l)) in
l
end else begin
[@inline_let]
let z2 = 65536 in
[@inline_let]
let _ = assert_norm (z2 == Prims.op_Multiply 256 z1) in
[@inline_let]
let l = 2 in
[@inline_let]
let _ = assert_norm (pow2 (Prims.op_Multiply 8 l) == z2) in
if n < z2
then begin
[@inline_let]
let _ = assert (pow2 (Prims.op_Multiply 8 (l - 1)) <= n) in
[@inline_let]
let _ = assert (n < pow2 (Prims.op_Multiply 8 l)) in
l
end else begin
[@inline_let]
let z3 = 16777216 in
[@inline_let]
let _ = assert_norm (z3 == Prims.op_Multiply 256 z2) in
[@inline_let]
let l = 3 in
[@inline_let]
let _ = assert_norm (pow2 (Prims.op_Multiply 8 l) == z3) in
if n < z3
then begin
[@inline_let]
let _ = assert (pow2 (Prims.op_Multiply 8 (l - 1)) <= n) in
[@inline_let]
let _ = assert (n < pow2 (Prims.op_Multiply 8 l)) in
l
end else begin
[@inline_let]
let l = 4 in
[@inline_let]
let _ = assert_norm (pow2 (Prims.op_Multiply 8 l) == Prims.op_Multiply 256 z3) in
[@inline_let]
let _ = assert (pow2 (Prims.op_Multiply 8 (l - 1)) <= n) in
[@inline_let]
let _ = assert (n < pow2 (Prims.op_Multiply 8 l)) in
l
end
end
end
let in_bounds
(min: nat)
(max: nat)
(x: U32.t)
: GTot bool
= not (U32.v x < min || max < U32.v x)
inline_for_extraction
let bounded_int32
(min: nat)
(max: nat { min <= max })
: Tot Type
= (x: U32.t { in_bounds min max x } )
// unfold
inline_for_extraction
let parse_bounded_int32_kind
(max: nat { 0 < max /\ max < 4294967296 }) | false | false | LowParse.Spec.BoundedInt.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 8,
"initial_ifuel": 0,
"max_fuel": 8,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 20,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val parse_bounded_int32_kind (max: nat{0 < max /\ max < 4294967296}) : Tot parser_kind | [] | LowParse.Spec.BoundedInt.parse_bounded_int32_kind | {
"file_name": "src/lowparse/LowParse.Spec.BoundedInt.fsti",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | max: Prims.nat{0 < max /\ max < 4294967296} -> LowParse.Spec.Base.parser_kind | {
"end_col": 3,
"end_line": 194,
"start_col": 2,
"start_line": 187
} |
Prims.Pure | val log256' (n: nat)
: Pure integer_size
(requires (n > 0 /\ n < 4294967296))
(ensures
(fun l -> pow2 (FStar.Mul.op_Star 8 (l - 1)) <= n /\ n < pow2 (FStar.Mul.op_Star 8 l))) | [
{
"abbrev": true,
"full_module": "FStar.Endianness",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Int",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let log256'
(n: nat)
: Pure integer_size
(requires (n > 0 /\ n < 4294967296))
(ensures (fun l ->
pow2 (FStar.Mul.op_Star 8 (l - 1)) <= n /\
n < pow2 (FStar.Mul.op_Star 8 l)
))
= [@inline_let]
let _ = assert_norm (pow2 32 == 4294967296) in
[@inline_let]
let _ = assert (n < pow2 32) in
[@inline_let]
let z0 = 1 in
[@inline_let]
let z1 = 256 in
[@inline_let]
let _ = assert_norm (z1 == Prims.op_Multiply 256 z0) in
[@inline_let]
let l = 1 in
[@inline_let]
let _ = assert_norm (pow2 (Prims.op_Multiply 8 l) == z1) in
[@inline_let]
let _ = assert_norm (pow2 (Prims.op_Multiply 8 (l - 1)) == z0) in
if n < z1
then begin
[@inline_let]
let _ = assert (pow2 (Prims.op_Multiply 8 (l - 1)) <= n) in
[@inline_let]
let _ = assert (n < pow2 (Prims.op_Multiply 8 l)) in
l
end else begin
[@inline_let]
let z2 = 65536 in
[@inline_let]
let _ = assert_norm (z2 == Prims.op_Multiply 256 z1) in
[@inline_let]
let l = 2 in
[@inline_let]
let _ = assert_norm (pow2 (Prims.op_Multiply 8 l) == z2) in
if n < z2
then begin
[@inline_let]
let _ = assert (pow2 (Prims.op_Multiply 8 (l - 1)) <= n) in
[@inline_let]
let _ = assert (n < pow2 (Prims.op_Multiply 8 l)) in
l
end else begin
[@inline_let]
let z3 = 16777216 in
[@inline_let]
let _ = assert_norm (z3 == Prims.op_Multiply 256 z2) in
[@inline_let]
let l = 3 in
[@inline_let]
let _ = assert_norm (pow2 (Prims.op_Multiply 8 l) == z3) in
if n < z3
then begin
[@inline_let]
let _ = assert (pow2 (Prims.op_Multiply 8 (l - 1)) <= n) in
[@inline_let]
let _ = assert (n < pow2 (Prims.op_Multiply 8 l)) in
l
end else begin
[@inline_let]
let l = 4 in
[@inline_let]
let _ = assert_norm (pow2 (Prims.op_Multiply 8 l) == Prims.op_Multiply 256 z3) in
[@inline_let]
let _ = assert (pow2 (Prims.op_Multiply 8 (l - 1)) <= n) in
[@inline_let]
let _ = assert (n < pow2 (Prims.op_Multiply 8 l)) in
l
end
end
end | val log256' (n: nat)
: Pure integer_size
(requires (n > 0 /\ n < 4294967296))
(ensures
(fun l -> pow2 (FStar.Mul.op_Star 8 (l - 1)) <= n /\ n < pow2 (FStar.Mul.op_Star 8 l)))
let log256' (n: nat)
: Pure integer_size
(requires (n > 0 /\ n < 4294967296))
(ensures
(fun l -> pow2 (FStar.Mul.op_Star 8 (l - 1)) <= n /\ n < pow2 (FStar.Mul.op_Star 8 l))) = | false | null | false | [@@ inline_let ]let _ = assert_norm (pow2 32 == 4294967296) in
[@@ inline_let ]let _ = assert (n < pow2 32) in
[@@ inline_let ]let z0 = 1 in
[@@ inline_let ]let z1 = 256 in
[@@ inline_let ]let _ = assert_norm (z1 == Prims.op_Multiply 256 z0) in
[@@ inline_let ]let l = 1 in
[@@ inline_let ]let _ = assert_norm (pow2 (Prims.op_Multiply 8 l) == z1) in
[@@ inline_let ]let _ = assert_norm (pow2 (Prims.op_Multiply 8 (l - 1)) == z0) in
if n < z1
then
[@@ inline_let ]let _ = assert (pow2 (Prims.op_Multiply 8 (l - 1)) <= n) in
[@@ inline_let ]let _ = assert (n < pow2 (Prims.op_Multiply 8 l)) in
l
else
[@@ inline_let ]let z2 = 65536 in
[@@ inline_let ]let _ = assert_norm (z2 == Prims.op_Multiply 256 z1) in
[@@ inline_let ]let l = 2 in
[@@ inline_let ]let _ = assert_norm (pow2 (Prims.op_Multiply 8 l) == z2) in
if n < z2
then
[@@ inline_let ]let _ = assert (pow2 (Prims.op_Multiply 8 (l - 1)) <= n) in
[@@ inline_let ]let _ = assert (n < pow2 (Prims.op_Multiply 8 l)) in
l
else
[@@ inline_let ]let z3 = 16777216 in
[@@ inline_let ]let _ = assert_norm (z3 == Prims.op_Multiply 256 z2) in
[@@ inline_let ]let l = 3 in
[@@ inline_let ]let _ = assert_norm (pow2 (Prims.op_Multiply 8 l) == z3) in
if n < z3
then
[@@ inline_let ]let _ = assert (pow2 (Prims.op_Multiply 8 (l - 1)) <= n) in
[@@ inline_let ]let _ = assert (n < pow2 (Prims.op_Multiply 8 l)) in
l
else
[@@ inline_let ]let l = 4 in
[@@ inline_let ]let _ =
assert_norm (pow2 (Prims.op_Multiply 8 l) == Prims.op_Multiply 256 z3)
in
[@@ inline_let ]let _ = assert (pow2 (Prims.op_Multiply 8 (l - 1)) <= n) in
[@@ inline_let ]let _ = assert (n < pow2 (Prims.op_Multiply 8 l)) in
l | {
"checked_file": "LowParse.Spec.BoundedInt.fsti.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Int.fsti.checked",
"LowParse.Spec.Base.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Endianness.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Spec.BoundedInt.fsti"
} | [] | [
"Prims.nat",
"Prims.op_LessThan",
"Prims.unit",
"Prims._assert",
"Prims.b2t",
"Prims.pow2",
"Prims.op_Multiply",
"Prims.op_LessThanOrEqual",
"Prims.op_Subtraction",
"Prims.bool",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"Prims.int",
"LowParse.Spec.BoundedInt.integer_size",
"Prims.l_and",
"Prims.op_GreaterThan",
"FStar.Mul.op_Star"
] | [] | module LowParse.Spec.BoundedInt
include LowParse.Spec.Base
include LowParse.Spec.Int // for parse_u16_kind
open FStar.Mul
module Seq = FStar.Seq
module U8 = FStar.UInt8
module U16 = FStar.UInt16
module U32 = FStar.UInt32
module E = FStar.Endianness
(* bounded integers *)
let integer_size : Type = (sz: nat { 1 <= sz /\ sz <= 4 } )
val integer_size_values (i: integer_size) : Lemma
(i == 1 \/ i == 2 \/ i == 3 \/ i == 4)
let bounded_integer_prop
(i: integer_size)
(u: U32.t)
: GTot Type0
= U32.v u < (match i with 1 -> 256 | 2 -> 65536 | 3 -> 16777216 | 4 -> 4294967296)
val bounded_integer_prop_equiv
(i: integer_size)
(u: U32.t)
: Lemma
(bounded_integer_prop i u <==> U32.v u < pow2 (8 * i))
inline_for_extraction
let bounded_integer
(i: integer_size)
: Tot Type
= (u: U32.t { bounded_integer_prop i u } )
inline_for_extraction
let parse_bounded_integer_kind
(i: integer_size)
: Tot parser_kind
= total_constant_size_parser_kind i
val parse_bounded_integer
(i: integer_size)
: Tot (parser (parse_bounded_integer_kind i) (bounded_integer i))
val parse_bounded_integer_spec
(i: integer_size)
(input: bytes)
: Lemma
(let res = parse (parse_bounded_integer i) input in
if Seq.length input < i
then res == None
else
match res with
| None -> False
| Some (y, consumed) ->
U32.v y == E.be_to_n (Seq.slice input 0 i) /\ consumed == i
)
val serialize_bounded_integer
(sz: integer_size)
: Tot (serializer (parse_bounded_integer sz))
#push-options "--initial_fuel 8 --max_fuel 8 --initial_ifuel 0 --max_ifuel 0 --z3rlimit 20"
val serialize_bounded_integer_spec
(sz: integer_size)
(x: bounded_integer sz)
: Lemma
(let (bx : nat {bx < pow2 (8 `FStar.Mul.op_Star` sz)}) = U32.v x in
serialize (serialize_bounded_integer sz) x == E.n_to_be sz bx)
val parse_bounded_integer_le
(i: integer_size)
: Tot (parser (parse_bounded_integer_kind i) (bounded_integer i))
val parse_u16_le : parser parse_u16_kind U16.t
val parse_u32_le : parser parse_u32_kind U32.t
val serialize_bounded_integer_le
(sz: integer_size)
: Tot (serializer (parse_bounded_integer_le sz))
val serialize_u16_le : serializer parse_u16_le
val serialize_u32_le : serializer parse_u32_le
inline_for_extraction
let log256'
(n: nat)
: Pure integer_size
(requires (n > 0 /\ n < 4294967296))
(ensures (fun l ->
pow2 (FStar.Mul.op_Star 8 (l - 1)) <= n /\
n < pow2 (FStar.Mul.op_Star 8 l) | false | false | LowParse.Spec.BoundedInt.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 8,
"initial_ifuel": 0,
"max_fuel": 8,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 20,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val log256' (n: nat)
: Pure integer_size
(requires (n > 0 /\ n < 4294967296))
(ensures
(fun l -> pow2 (FStar.Mul.op_Star 8 (l - 1)) <= n /\ n < pow2 (FStar.Mul.op_Star 8 l))) | [] | LowParse.Spec.BoundedInt.log256' | {
"file_name": "src/lowparse/LowParse.Spec.BoundedInt.fsti",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | n: Prims.nat -> Prims.Pure LowParse.Spec.BoundedInt.integer_size | {
"end_col": 5,
"end_line": 166,
"start_col": 2,
"start_line": 99
} |
Prims.Pure | val mk_ins (i: S.ins)
: Pure S.code
(requires True)
(ensures
fun c ->
c == Ins i /\ i == normal i /\ S.machine_eval_ins_st i == normal (S.machine_eval_ins_st i)
) | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Vale.X64.Instruction_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let mk_ins (i:S.ins) : Pure S.code
(requires True)
(ensures fun c ->
c == Ins i /\
i == normal i /\
S.machine_eval_ins_st i == normal (S.machine_eval_ins_st i)
)
=
normal_term_spec (S.machine_eval_ins_st i);
Ins i | val mk_ins (i: S.ins)
: Pure S.code
(requires True)
(ensures
fun c ->
c == Ins i /\ i == normal i /\ S.machine_eval_ins_st i == normal (S.machine_eval_ins_st i)
)
let mk_ins (i: S.ins)
: Pure S.code
(requires True)
(ensures
fun c ->
c == Ins i /\ i == normal i /\ S.machine_eval_ins_st i == normal (S.machine_eval_ins_st i)
) = | false | null | false | normal_term_spec (S.machine_eval_ins_st i);
Ins i | {
"checked_file": "Vale.X64.Taint_Semantics.fst.checked",
"dependencies": [
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Decls.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.Taint_Semantics.fst"
} | [] | [
"Vale.X64.Machine_Semantics_s.ins",
"Vale.X64.Machine_s.Ins",
"Vale.X64.Bytes_Code_s.instruction_t",
"Vale.X64.Machine_Semantics_s.instr_annotation",
"Vale.X64.Bytes_Code_s.ocmp",
"Prims.unit",
"Vale.X64.Taint_Semantics.normal_term_spec",
"Vale.X64.Machine_Semantics_s.st",
"Vale.X64.Machine_Semantics_s.machine_eval_ins_st",
"Vale.X64.Machine_Semantics_s.code",
"Prims.l_True",
"Prims.l_and",
"Prims.eq2",
"Vale.X64.Machine_s.precode",
"Vale.X64.Instruction_s.normal"
] | [] | module Vale.X64.Taint_Semantics
open FStar.Mul
open Vale.X64.Decls
open Vale.X64.Machine_s
open Vale.X64.Instruction_s
module S = Vale.X64.Machine_Semantics_s
module L = FStar.List.Tot
let normal_term_spec (#a:Type) (x:a) : Lemma (normal x == x) =
()
let mk_ins (i:S.ins) : Pure S.code
(requires True)
(ensures fun c ->
c == Ins i /\
i == normal i /\
S.machine_eval_ins_st i == normal (S.machine_eval_ins_st i)
) | false | false | Vale.X64.Taint_Semantics.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val mk_ins (i: S.ins)
: Pure S.code
(requires True)
(ensures
fun c ->
c == Ins i /\ i == normal i /\ S.machine_eval_ins_st i == normal (S.machine_eval_ins_st i)
) | [] | Vale.X64.Taint_Semantics.mk_ins | {
"file_name": "vale/code/arch/x64/Vale.X64.Taint_Semantics.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | i: Vale.X64.Machine_Semantics_s.ins -> Prims.Pure Vale.X64.Machine_Semantics_s.code | {
"end_col": 7,
"end_line": 22,
"start_col": 2,
"start_line": 21
} |
Prims.Tot | val frodo_gen_matrix_shake:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "Spec.Matrix",
"short_module": "Matrix"
},
{
"abbrev": false,
"full_module": "Spec.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.SHA3",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Matrix",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let frodo_gen_matrix_shake n seed =
let res = Matrix.create n n in
Loops.repeati n (frodo_gen_matrix_shake1 n seed) res | val frodo_gen_matrix_shake:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_shake n seed = | false | null | false | let res = Matrix.create n n in
Loops.repeati n (frodo_gen_matrix_shake1 n seed) res | {
"checked_file": "Spec.Frodo.Gen.fst.checked",
"dependencies": [
"Spec.SHA3.fst.checked",
"Spec.Matrix.fst.checked",
"Spec.AES.fst.checked",
"prims.fst.checked",
"Lib.Sequence.Lemmas.fsti.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.Frodo.Gen.fst"
} | [
"total"
] | [
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.max_size_t",
"Lib.IntTypes.maxint",
"Lib.IntTypes.U16",
"Lib.ByteSequence.lbytes",
"Lib.LoopCombinators.repeati",
"Spec.Matrix.matrix",
"Spec.Frodo.Gen.frodo_gen_matrix_shake1",
"Lib.Sequence.lseq",
"Lib.IntTypes.int_t",
"Lib.IntTypes.SEC",
"Prims.op_Multiply",
"Spec.Matrix.create"
] | [] | module Spec.Frodo.Gen
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Matrix
open Spec.SHA3
open Spec.AES
module Matrix = Spec.Matrix
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val frodo_gen_matrix_shake_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> lbytes (2 * n)
let frodo_gen_matrix_shake_get_r n seed i =
let tmp = uint_to_bytes_le (u16 i) in
let b = concat tmp seed in
shake128 18 b (2 * n)
val frodo_gen_matrix_shake0:
n:size_nat{n * n <= max_size_t}
-> i:size_nat{i < n}
-> res_i:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake0 n i res_i j res0 =
res0.(i, j) <- uint_from_bytes_le (LSeq.sub res_i (j * 2) 2)
val frodo_gen_matrix_shake1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> matrix n n
let frodo_gen_matrix_shake1 n seed i res =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res
val frodo_gen_matrix_shake:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n | false | false | Spec.Frodo.Gen.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val frodo_gen_matrix_shake:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n | [] | Spec.Frodo.Gen.frodo_gen_matrix_shake | {
"file_name": "specs/frodo/Spec.Frodo.Gen.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
n:
Lib.IntTypes.size_nat
{n * n <= Lib.IntTypes.max_size_t /\ n <= Lib.IntTypes.maxint Lib.IntTypes.U16} ->
seed: Lib.ByteSequence.lbytes 16
-> Spec.Matrix.matrix n n | {
"end_col": 54,
"end_line": 62,
"start_col": 35,
"start_line": 60
} |
Prims.Tot | val frodo_gen_matrix_shake0:
n:size_nat{n * n <= max_size_t}
-> i:size_nat{i < n}
-> res_i:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "Spec.Matrix",
"short_module": "Matrix"
},
{
"abbrev": false,
"full_module": "Spec.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.SHA3",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Matrix",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let frodo_gen_matrix_shake0 n i res_i j res0 =
res0.(i, j) <- uint_from_bytes_le (LSeq.sub res_i (j * 2) 2) | val frodo_gen_matrix_shake0:
n:size_nat{n * n <= max_size_t}
-> i:size_nat{i < n}
-> res_i:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake0 n i res_i j res0 = | false | null | false | res0.(i, j) <- uint_from_bytes_le (LSeq.sub res_i (j * 2) 2) | {
"checked_file": "Spec.Frodo.Gen.fst.checked",
"dependencies": [
"Spec.SHA3.fst.checked",
"Spec.Matrix.fst.checked",
"Spec.AES.fst.checked",
"prims.fst.checked",
"Lib.Sequence.Lemmas.fsti.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.Frodo.Gen.fst"
} | [
"total"
] | [
"Lib.IntTypes.size_nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.max_size_t",
"Prims.op_LessThan",
"Lib.ByteSequence.lbytes",
"Spec.Matrix.matrix",
"Spec.Matrix.op_Array_Assignment",
"FStar.Pervasives.Native.Mktuple2",
"Lib.ByteSequence.uint_from_bytes_le",
"Lib.IntTypes.U16",
"Lib.IntTypes.SEC",
"Lib.Sequence.sub",
"Lib.IntTypes.uint_t",
"Lib.IntTypes.U8"
] | [] | module Spec.Frodo.Gen
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Matrix
open Spec.SHA3
open Spec.AES
module Matrix = Spec.Matrix
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val frodo_gen_matrix_shake_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> lbytes (2 * n)
let frodo_gen_matrix_shake_get_r n seed i =
let tmp = uint_to_bytes_le (u16 i) in
let b = concat tmp seed in
shake128 18 b (2 * n)
val frodo_gen_matrix_shake0:
n:size_nat{n * n <= max_size_t}
-> i:size_nat{i < n}
-> res_i:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n | false | false | Spec.Frodo.Gen.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val frodo_gen_matrix_shake0:
n:size_nat{n * n <= max_size_t}
-> i:size_nat{i < n}
-> res_i:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n | [] | Spec.Frodo.Gen.frodo_gen_matrix_shake0 | {
"file_name": "specs/frodo/Spec.Frodo.Gen.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
n: Lib.IntTypes.size_nat{n * n <= Lib.IntTypes.max_size_t} ->
i: Lib.IntTypes.size_nat{i < n} ->
res_i: Lib.ByteSequence.lbytes (2 * n) ->
j: Lib.IntTypes.size_nat{j < n} ->
res0: Spec.Matrix.matrix n n
-> Spec.Matrix.matrix n n | {
"end_col": 62,
"end_line": 40,
"start_col": 2,
"start_line": 40
} |
Prims.Tot | val frodo_gen_matrix_shake1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> matrix n n | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "Spec.Matrix",
"short_module": "Matrix"
},
{
"abbrev": false,
"full_module": "Spec.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.SHA3",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Matrix",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let frodo_gen_matrix_shake1 n seed i res =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res | val frodo_gen_matrix_shake1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> matrix n n
let frodo_gen_matrix_shake1 n seed i res = | false | null | false | let res_i = frodo_gen_matrix_shake_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res | {
"checked_file": "Spec.Frodo.Gen.fst.checked",
"dependencies": [
"Spec.SHA3.fst.checked",
"Spec.Matrix.fst.checked",
"Spec.AES.fst.checked",
"prims.fst.checked",
"Lib.Sequence.Lemmas.fsti.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.Frodo.Gen.fst"
} | [
"total"
] | [
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.max_size_t",
"Lib.IntTypes.maxint",
"Lib.IntTypes.U16",
"Lib.ByteSequence.lbytes",
"Prims.op_LessThan",
"Spec.Matrix.matrix",
"Lib.LoopCombinators.repeati",
"Spec.Frodo.Gen.frodo_gen_matrix_shake0",
"Lib.Sequence.lseq",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Prims.op_Multiply",
"Spec.Frodo.Gen.frodo_gen_matrix_shake_get_r"
] | [] | module Spec.Frodo.Gen
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Matrix
open Spec.SHA3
open Spec.AES
module Matrix = Spec.Matrix
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val frodo_gen_matrix_shake_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> lbytes (2 * n)
let frodo_gen_matrix_shake_get_r n seed i =
let tmp = uint_to_bytes_le (u16 i) in
let b = concat tmp seed in
shake128 18 b (2 * n)
val frodo_gen_matrix_shake0:
n:size_nat{n * n <= max_size_t}
-> i:size_nat{i < n}
-> res_i:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake0 n i res_i j res0 =
res0.(i, j) <- uint_from_bytes_le (LSeq.sub res_i (j * 2) 2)
val frodo_gen_matrix_shake1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> matrix n n | false | false | Spec.Frodo.Gen.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val frodo_gen_matrix_shake1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> matrix n n | [] | Spec.Frodo.Gen.frodo_gen_matrix_shake1 | {
"file_name": "specs/frodo/Spec.Frodo.Gen.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
n:
Lib.IntTypes.size_nat
{n * n <= Lib.IntTypes.max_size_t /\ n <= Lib.IntTypes.maxint Lib.IntTypes.U16} ->
seed: Lib.ByteSequence.lbytes 16 ->
i: Lib.IntTypes.size_nat{i < n} ->
res: Spec.Matrix.matrix n n
-> Spec.Matrix.matrix n n | {
"end_col": 57,
"end_line": 52,
"start_col": 42,
"start_line": 50
} |
Prims.Tot | val frodo_gen_matrix_shake_4x:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16
-> matrix n n | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "Spec.Matrix",
"short_module": "Matrix"
},
{
"abbrev": false,
"full_module": "Spec.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.SHA3",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Matrix",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let frodo_gen_matrix_shake_4x n seed =
let res = Matrix.create n n in
let n4 = n / 4 in
Loops.repeati n4 (frodo_gen_matrix_shake_4x1 n seed) res | val frodo_gen_matrix_shake_4x:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_shake_4x n seed = | false | null | false | let res = Matrix.create n n in
let n4 = n / 4 in
Loops.repeati n4 (frodo_gen_matrix_shake_4x1 n seed) res | {
"checked_file": "Spec.Frodo.Gen.fst.checked",
"dependencies": [
"Spec.SHA3.fst.checked",
"Spec.Matrix.fst.checked",
"Spec.AES.fst.checked",
"prims.fst.checked",
"Lib.Sequence.Lemmas.fsti.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.Frodo.Gen.fst"
} | [
"total"
] | [
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.max_size_t",
"Lib.IntTypes.maxint",
"Lib.IntTypes.U16",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Lib.ByteSequence.lbytes",
"Lib.LoopCombinators.repeati",
"Spec.Matrix.matrix",
"Spec.Frodo.Gen.frodo_gen_matrix_shake_4x1",
"Prims.op_Division",
"Lib.Sequence.lseq",
"Lib.IntTypes.int_t",
"Lib.IntTypes.SEC",
"Prims.op_Multiply",
"Spec.Matrix.create"
] | [] | module Spec.Frodo.Gen
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Matrix
open Spec.SHA3
open Spec.AES
module Matrix = Spec.Matrix
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val frodo_gen_matrix_shake_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> lbytes (2 * n)
let frodo_gen_matrix_shake_get_r n seed i =
let tmp = uint_to_bytes_le (u16 i) in
let b = concat tmp seed in
shake128 18 b (2 * n)
val frodo_gen_matrix_shake0:
n:size_nat{n * n <= max_size_t}
-> i:size_nat{i < n}
-> res_i:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake0 n i res_i j res0 =
res0.(i, j) <- uint_from_bytes_le (LSeq.sub res_i (j * 2) 2)
val frodo_gen_matrix_shake1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> matrix n n
let frodo_gen_matrix_shake1 n seed i res =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res
val frodo_gen_matrix_shake:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_shake n seed =
let res = Matrix.create n n in
Loops.repeati n (frodo_gen_matrix_shake1 n seed) res
val frodo_gen_matrix_shake_4x0:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> i:size_nat{i < n / 4}
-> r0:lbytes (2 * n)
-> r1:lbytes (2 * n)
-> r2:lbytes (2 * n)
-> r3:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3 j res0 =
let res0 = res0.(4 * i + 0, j) <- uint_from_bytes_le (LSeq.sub r0 (j * 2) 2) in
let res0 = res0.(4 * i + 1, j) <- uint_from_bytes_le (LSeq.sub r1 (j * 2) 2) in
let res0 = res0.(4 * i + 2, j) <- uint_from_bytes_le (LSeq.sub r2 (j * 2) 2) in
let res0 = res0.(4 * i + 3, j) <- uint_from_bytes_le (LSeq.sub r3 (j * 2) 2) in
res0
val frodo_gen_matrix_shake_4x1_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n)
let frodo_gen_matrix_shake_4x1_get_r n seed i =
let t0 = uint_to_bytes_le (u16 (4 * i + 0)) in
let t1 = uint_to_bytes_le (u16 (4 * i + 1)) in
let t2 = uint_to_bytes_le (u16 (4 * i + 2)) in
let t3 = uint_to_bytes_le (u16 (4 * i + 3)) in
let b0 = concat t0 seed in
let b1 = concat t1 seed in
let b2 = concat t2 seed in
let b3 = concat t3 seed in
let r0 = shake128 18 b0 (2 * n) in
let r1 = shake128 18 b1 (2 * n) in
let r2 = shake128 18 b2 (2 * n) in
let r3 = shake128 18 b3 (2 * n) in
r0, r1, r2, r3
val frodo_gen_matrix_shake_4x1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> res:matrix n n
-> matrix n n
let frodo_gen_matrix_shake_4x1 n seed i res =
let r0, r1, r2, r3 = frodo_gen_matrix_shake_4x1_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res
val frodo_gen_matrix_shake_4x:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16
-> matrix n n | false | false | Spec.Frodo.Gen.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val frodo_gen_matrix_shake_4x:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16
-> matrix n n | [] | Spec.Frodo.Gen.frodo_gen_matrix_shake_4x | {
"file_name": "specs/frodo/Spec.Frodo.Gen.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
n:
Lib.IntTypes.size_nat
{n * n <= Lib.IntTypes.max_size_t /\ n <= Lib.IntTypes.maxint Lib.IntTypes.U16 /\ n % 4 = 0} ->
seed: Lib.ByteSequence.lbytes 16
-> Spec.Matrix.matrix n n | {
"end_col": 58,
"end_line": 128,
"start_col": 38,
"start_line": 125
} |
Prims.GTot | val frodo_gen_matrix_shake_fc:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> j:size_nat{j < n}
-> GTot uint16 | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "Spec.Matrix",
"short_module": "Matrix"
},
{
"abbrev": false,
"full_module": "Spec.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.SHA3",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Matrix",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let frodo_gen_matrix_shake_fc n seed i j =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
uint_from_bytes_le (LSeq.sub res_i (j * 2) 2) | val frodo_gen_matrix_shake_fc:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> j:size_nat{j < n}
-> GTot uint16
let frodo_gen_matrix_shake_fc n seed i j = | false | null | false | let res_i = frodo_gen_matrix_shake_get_r n seed i in
uint_from_bytes_le (LSeq.sub res_i (j * 2) 2) | {
"checked_file": "Spec.Frodo.Gen.fst.checked",
"dependencies": [
"Spec.SHA3.fst.checked",
"Spec.Matrix.fst.checked",
"Spec.AES.fst.checked",
"prims.fst.checked",
"Lib.Sequence.Lemmas.fsti.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.Frodo.Gen.fst"
} | [
"sometrivial"
] | [
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.max_size_t",
"Lib.IntTypes.maxint",
"Lib.IntTypes.U16",
"Lib.ByteSequence.lbytes",
"Prims.op_LessThan",
"Lib.ByteSequence.uint_from_bytes_le",
"Lib.IntTypes.SEC",
"Lib.Sequence.sub",
"Lib.IntTypes.uint_t",
"Lib.IntTypes.U8",
"Lib.Sequence.lseq",
"Lib.IntTypes.int_t",
"Prims.op_Multiply",
"Spec.Frodo.Gen.frodo_gen_matrix_shake_get_r",
"Lib.IntTypes.uint16"
] | [] | module Spec.Frodo.Gen
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Matrix
open Spec.SHA3
open Spec.AES
module Matrix = Spec.Matrix
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val frodo_gen_matrix_shake_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> lbytes (2 * n)
let frodo_gen_matrix_shake_get_r n seed i =
let tmp = uint_to_bytes_le (u16 i) in
let b = concat tmp seed in
shake128 18 b (2 * n)
val frodo_gen_matrix_shake0:
n:size_nat{n * n <= max_size_t}
-> i:size_nat{i < n}
-> res_i:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake0 n i res_i j res0 =
res0.(i, j) <- uint_from_bytes_le (LSeq.sub res_i (j * 2) 2)
val frodo_gen_matrix_shake1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> matrix n n
let frodo_gen_matrix_shake1 n seed i res =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res
val frodo_gen_matrix_shake:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_shake n seed =
let res = Matrix.create n n in
Loops.repeati n (frodo_gen_matrix_shake1 n seed) res
val frodo_gen_matrix_shake_4x0:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> i:size_nat{i < n / 4}
-> r0:lbytes (2 * n)
-> r1:lbytes (2 * n)
-> r2:lbytes (2 * n)
-> r3:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3 j res0 =
let res0 = res0.(4 * i + 0, j) <- uint_from_bytes_le (LSeq.sub r0 (j * 2) 2) in
let res0 = res0.(4 * i + 1, j) <- uint_from_bytes_le (LSeq.sub r1 (j * 2) 2) in
let res0 = res0.(4 * i + 2, j) <- uint_from_bytes_le (LSeq.sub r2 (j * 2) 2) in
let res0 = res0.(4 * i + 3, j) <- uint_from_bytes_le (LSeq.sub r3 (j * 2) 2) in
res0
val frodo_gen_matrix_shake_4x1_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n)
let frodo_gen_matrix_shake_4x1_get_r n seed i =
let t0 = uint_to_bytes_le (u16 (4 * i + 0)) in
let t1 = uint_to_bytes_le (u16 (4 * i + 1)) in
let t2 = uint_to_bytes_le (u16 (4 * i + 2)) in
let t3 = uint_to_bytes_le (u16 (4 * i + 3)) in
let b0 = concat t0 seed in
let b1 = concat t1 seed in
let b2 = concat t2 seed in
let b3 = concat t3 seed in
let r0 = shake128 18 b0 (2 * n) in
let r1 = shake128 18 b1 (2 * n) in
let r2 = shake128 18 b2 (2 * n) in
let r3 = shake128 18 b3 (2 * n) in
r0, r1, r2, r3
val frodo_gen_matrix_shake_4x1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> res:matrix n n
-> matrix n n
let frodo_gen_matrix_shake_4x1 n seed i res =
let r0, r1, r2, r3 = frodo_gen_matrix_shake_4x1_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res
val frodo_gen_matrix_shake_4x:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_shake_4x n seed =
let res = Matrix.create n n in
let n4 = n / 4 in
Loops.repeati n4 (frodo_gen_matrix_shake_4x1 n seed) res
val frodo_gen_matrix_aes:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_aes n seed =
let res = Matrix.create n n in
let key = aes128_key_expansion seed in
let tmp = LSeq.create 8 (u16 0) in
let n1 = n / 8 in
Loops.repeati n
(fun i res ->
Loops.repeati n1
(fun j res ->
let j = j * 8 in
let tmp = tmp.[0] <- u16 i in
let tmp = tmp.[1] <- u16 j in
let res_i = aes_encrypt_block AES128 key (uints_to_bytes_le tmp) in
Loops.repeati 8
(fun k res ->
res.(i, j + k) <- uint_from_bytes_le (LSeq.sub res_i (k * 2) 2)
) res
) res
) res
(** Lemma (frodo_gen_matrix_shake == frodo_gen_matrix_shake_4x) *)
val frodo_gen_matrix_shake_fc:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> j:size_nat{j < n}
-> GTot uint16 | false | false | Spec.Frodo.Gen.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val frodo_gen_matrix_shake_fc:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> j:size_nat{j < n}
-> GTot uint16 | [] | Spec.Frodo.Gen.frodo_gen_matrix_shake_fc | {
"file_name": "specs/frodo/Spec.Frodo.Gen.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
n:
Lib.IntTypes.size_nat
{n * n <= Lib.IntTypes.max_size_t /\ n <= Lib.IntTypes.maxint Lib.IntTypes.U16} ->
seed: Lib.ByteSequence.lbytes 16 ->
i: Lib.IntTypes.size_nat{i < n} ->
j: Lib.IntTypes.size_nat{j < n}
-> Prims.GTot Lib.IntTypes.uint16 | {
"end_col": 47,
"end_line": 168,
"start_col": 42,
"start_line": 166
} |
Prims.Tot | val frodo_gen_matrix_shake_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> lbytes (2 * n) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "Spec.Matrix",
"short_module": "Matrix"
},
{
"abbrev": false,
"full_module": "Spec.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.SHA3",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Matrix",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let frodo_gen_matrix_shake_get_r n seed i =
let tmp = uint_to_bytes_le (u16 i) in
let b = concat tmp seed in
shake128 18 b (2 * n) | val frodo_gen_matrix_shake_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> lbytes (2 * n)
let frodo_gen_matrix_shake_get_r n seed i = | false | null | false | let tmp = uint_to_bytes_le (u16 i) in
let b = concat tmp seed in
shake128 18 b (2 * n) | {
"checked_file": "Spec.Frodo.Gen.fst.checked",
"dependencies": [
"Spec.SHA3.fst.checked",
"Spec.Matrix.fst.checked",
"Spec.AES.fst.checked",
"prims.fst.checked",
"Lib.Sequence.Lemmas.fsti.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.Frodo.Gen.fst"
} | [
"total"
] | [
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.max_size_t",
"Lib.IntTypes.maxint",
"Lib.IntTypes.U16",
"Lib.ByteSequence.lbytes",
"Prims.op_LessThan",
"Spec.SHA3.shake128",
"Lib.Sequence.lseq",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Prims.op_Addition",
"Prims.eq2",
"FStar.Seq.Base.seq",
"Lib.Sequence.to_seq",
"FStar.Seq.Base.append",
"Lib.Sequence.concat",
"Lib.IntTypes.uint_t",
"Lib.IntTypes.numbytes",
"Lib.ByteSequence.uint_to_bytes_le",
"Lib.IntTypes.u16"
] | [] | module Spec.Frodo.Gen
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Matrix
open Spec.SHA3
open Spec.AES
module Matrix = Spec.Matrix
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val frodo_gen_matrix_shake_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> lbytes (2 * n) | false | false | Spec.Frodo.Gen.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val frodo_gen_matrix_shake_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> lbytes (2 * n) | [] | Spec.Frodo.Gen.frodo_gen_matrix_shake_get_r | {
"file_name": "specs/frodo/Spec.Frodo.Gen.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
n:
Lib.IntTypes.size_nat
{n * n <= Lib.IntTypes.max_size_t /\ n <= Lib.IntTypes.maxint Lib.IntTypes.U16} ->
seed: Lib.ByteSequence.lbytes 16 ->
i: Lib.IntTypes.size_nat{i < n}
-> Lib.ByteSequence.lbytes (2 * n) | {
"end_col": 23,
"end_line": 28,
"start_col": 43,
"start_line": 25
} |
Prims.Tot | val frodo_gen_matrix_shake_4x1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> res:matrix n n
-> matrix n n | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "Spec.Matrix",
"short_module": "Matrix"
},
{
"abbrev": false,
"full_module": "Spec.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.SHA3",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Matrix",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let frodo_gen_matrix_shake_4x1 n seed i res =
let r0, r1, r2, r3 = frodo_gen_matrix_shake_4x1_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res | val frodo_gen_matrix_shake_4x1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> res:matrix n n
-> matrix n n
let frodo_gen_matrix_shake_4x1 n seed i res = | false | null | false | let r0, r1, r2, r3 = frodo_gen_matrix_shake_4x1_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res | {
"checked_file": "Spec.Frodo.Gen.fst.checked",
"dependencies": [
"Spec.SHA3.fst.checked",
"Spec.Matrix.fst.checked",
"Spec.AES.fst.checked",
"prims.fst.checked",
"Lib.Sequence.Lemmas.fsti.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.Frodo.Gen.fst"
} | [
"total"
] | [
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.max_size_t",
"Lib.IntTypes.maxint",
"Lib.IntTypes.U16",
"Lib.ByteSequence.lbytes",
"Prims.op_LessThan",
"Prims.op_Division",
"Spec.Matrix.matrix",
"Lib.LoopCombinators.repeati",
"Spec.Frodo.Gen.frodo_gen_matrix_shake_4x0",
"FStar.Pervasives.Native.tuple4",
"Lib.Sequence.lseq",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Prims.op_Multiply",
"Spec.Frodo.Gen.frodo_gen_matrix_shake_4x1_get_r"
] | [] | module Spec.Frodo.Gen
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Matrix
open Spec.SHA3
open Spec.AES
module Matrix = Spec.Matrix
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val frodo_gen_matrix_shake_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> lbytes (2 * n)
let frodo_gen_matrix_shake_get_r n seed i =
let tmp = uint_to_bytes_le (u16 i) in
let b = concat tmp seed in
shake128 18 b (2 * n)
val frodo_gen_matrix_shake0:
n:size_nat{n * n <= max_size_t}
-> i:size_nat{i < n}
-> res_i:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake0 n i res_i j res0 =
res0.(i, j) <- uint_from_bytes_le (LSeq.sub res_i (j * 2) 2)
val frodo_gen_matrix_shake1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> matrix n n
let frodo_gen_matrix_shake1 n seed i res =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res
val frodo_gen_matrix_shake:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_shake n seed =
let res = Matrix.create n n in
Loops.repeati n (frodo_gen_matrix_shake1 n seed) res
val frodo_gen_matrix_shake_4x0:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> i:size_nat{i < n / 4}
-> r0:lbytes (2 * n)
-> r1:lbytes (2 * n)
-> r2:lbytes (2 * n)
-> r3:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3 j res0 =
let res0 = res0.(4 * i + 0, j) <- uint_from_bytes_le (LSeq.sub r0 (j * 2) 2) in
let res0 = res0.(4 * i + 1, j) <- uint_from_bytes_le (LSeq.sub r1 (j * 2) 2) in
let res0 = res0.(4 * i + 2, j) <- uint_from_bytes_le (LSeq.sub r2 (j * 2) 2) in
let res0 = res0.(4 * i + 3, j) <- uint_from_bytes_le (LSeq.sub r3 (j * 2) 2) in
res0
val frodo_gen_matrix_shake_4x1_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n)
let frodo_gen_matrix_shake_4x1_get_r n seed i =
let t0 = uint_to_bytes_le (u16 (4 * i + 0)) in
let t1 = uint_to_bytes_le (u16 (4 * i + 1)) in
let t2 = uint_to_bytes_le (u16 (4 * i + 2)) in
let t3 = uint_to_bytes_le (u16 (4 * i + 3)) in
let b0 = concat t0 seed in
let b1 = concat t1 seed in
let b2 = concat t2 seed in
let b3 = concat t3 seed in
let r0 = shake128 18 b0 (2 * n) in
let r1 = shake128 18 b1 (2 * n) in
let r2 = shake128 18 b2 (2 * n) in
let r3 = shake128 18 b3 (2 * n) in
r0, r1, r2, r3
val frodo_gen_matrix_shake_4x1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> res:matrix n n
-> matrix n n | false | false | Spec.Frodo.Gen.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val frodo_gen_matrix_shake_4x1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> res:matrix n n
-> matrix n n | [] | Spec.Frodo.Gen.frodo_gen_matrix_shake_4x1 | {
"file_name": "specs/frodo/Spec.Frodo.Gen.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
n:
Lib.IntTypes.size_nat
{n * n <= Lib.IntTypes.max_size_t /\ n <= Lib.IntTypes.maxint Lib.IntTypes.U16} ->
seed: Lib.ByteSequence.lbytes 16 ->
i: Lib.IntTypes.size_nat{i < n / 4} ->
res: Spec.Matrix.matrix n n
-> Spec.Matrix.matrix n n | {
"end_col": 66,
"end_line": 117,
"start_col": 45,
"start_line": 115
} |
Prims.Tot | val frodo_gen_matrix_shake_4x0:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> i:size_nat{i < n / 4}
-> r0:lbytes (2 * n)
-> r1:lbytes (2 * n)
-> r2:lbytes (2 * n)
-> r3:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "Spec.Matrix",
"short_module": "Matrix"
},
{
"abbrev": false,
"full_module": "Spec.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.SHA3",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Matrix",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3 j res0 =
let res0 = res0.(4 * i + 0, j) <- uint_from_bytes_le (LSeq.sub r0 (j * 2) 2) in
let res0 = res0.(4 * i + 1, j) <- uint_from_bytes_le (LSeq.sub r1 (j * 2) 2) in
let res0 = res0.(4 * i + 2, j) <- uint_from_bytes_le (LSeq.sub r2 (j * 2) 2) in
let res0 = res0.(4 * i + 3, j) <- uint_from_bytes_le (LSeq.sub r3 (j * 2) 2) in
res0 | val frodo_gen_matrix_shake_4x0:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> i:size_nat{i < n / 4}
-> r0:lbytes (2 * n)
-> r1:lbytes (2 * n)
-> r2:lbytes (2 * n)
-> r3:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3 j res0 = | false | null | false | let res0 = res0.(4 * i + 0, j) <- uint_from_bytes_le (LSeq.sub r0 (j * 2) 2) in
let res0 = res0.(4 * i + 1, j) <- uint_from_bytes_le (LSeq.sub r1 (j * 2) 2) in
let res0 = res0.(4 * i + 2, j) <- uint_from_bytes_le (LSeq.sub r2 (j * 2) 2) in
let res0 = res0.(4 * i + 3, j) <- uint_from_bytes_le (LSeq.sub r3 (j * 2) 2) in
res0 | {
"checked_file": "Spec.Frodo.Gen.fst.checked",
"dependencies": [
"Spec.SHA3.fst.checked",
"Spec.Matrix.fst.checked",
"Spec.AES.fst.checked",
"prims.fst.checked",
"Lib.Sequence.Lemmas.fsti.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.Frodo.Gen.fst"
} | [
"total"
] | [
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.max_size_t",
"Lib.IntTypes.maxint",
"Lib.IntTypes.U16",
"Prims.op_LessThan",
"Prims.op_Division",
"Lib.ByteSequence.lbytes",
"Spec.Matrix.matrix",
"Lib.Sequence.lseq",
"Lib.IntTypes.int_t",
"Lib.IntTypes.SEC",
"Prims.op_Multiply",
"Spec.Matrix.op_Array_Assignment",
"FStar.Pervasives.Native.Mktuple2",
"Prims.op_Addition",
"Lib.ByteSequence.uint_from_bytes_le",
"Lib.Sequence.sub",
"Lib.IntTypes.uint_t",
"Lib.IntTypes.U8"
] | [] | module Spec.Frodo.Gen
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Matrix
open Spec.SHA3
open Spec.AES
module Matrix = Spec.Matrix
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val frodo_gen_matrix_shake_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> lbytes (2 * n)
let frodo_gen_matrix_shake_get_r n seed i =
let tmp = uint_to_bytes_le (u16 i) in
let b = concat tmp seed in
shake128 18 b (2 * n)
val frodo_gen_matrix_shake0:
n:size_nat{n * n <= max_size_t}
-> i:size_nat{i < n}
-> res_i:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake0 n i res_i j res0 =
res0.(i, j) <- uint_from_bytes_le (LSeq.sub res_i (j * 2) 2)
val frodo_gen_matrix_shake1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> matrix n n
let frodo_gen_matrix_shake1 n seed i res =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res
val frodo_gen_matrix_shake:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_shake n seed =
let res = Matrix.create n n in
Loops.repeati n (frodo_gen_matrix_shake1 n seed) res
val frodo_gen_matrix_shake_4x0:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> i:size_nat{i < n / 4}
-> r0:lbytes (2 * n)
-> r1:lbytes (2 * n)
-> r2:lbytes (2 * n)
-> r3:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n | false | false | Spec.Frodo.Gen.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val frodo_gen_matrix_shake_4x0:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> i:size_nat{i < n / 4}
-> r0:lbytes (2 * n)
-> r1:lbytes (2 * n)
-> r2:lbytes (2 * n)
-> r3:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n | [] | Spec.Frodo.Gen.frodo_gen_matrix_shake_4x0 | {
"file_name": "specs/frodo/Spec.Frodo.Gen.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
n:
Lib.IntTypes.size_nat
{n * n <= Lib.IntTypes.max_size_t /\ n <= Lib.IntTypes.maxint Lib.IntTypes.U16} ->
i: Lib.IntTypes.size_nat{i < n / 4} ->
r0: Lib.ByteSequence.lbytes (2 * n) ->
r1: Lib.ByteSequence.lbytes (2 * n) ->
r2: Lib.ByteSequence.lbytes (2 * n) ->
r3: Lib.ByteSequence.lbytes (2 * n) ->
j: Lib.IntTypes.size_nat{j < n} ->
res0: Spec.Matrix.matrix n n
-> Spec.Matrix.matrix n n | {
"end_col": 6,
"end_line": 81,
"start_col": 55,
"start_line": 76
} |
Prims.Tot | val frodo_gen_matrix_shake_4x1_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "Spec.Matrix",
"short_module": "Matrix"
},
{
"abbrev": false,
"full_module": "Spec.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.SHA3",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Matrix",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let frodo_gen_matrix_shake_4x1_get_r n seed i =
let t0 = uint_to_bytes_le (u16 (4 * i + 0)) in
let t1 = uint_to_bytes_le (u16 (4 * i + 1)) in
let t2 = uint_to_bytes_le (u16 (4 * i + 2)) in
let t3 = uint_to_bytes_le (u16 (4 * i + 3)) in
let b0 = concat t0 seed in
let b1 = concat t1 seed in
let b2 = concat t2 seed in
let b3 = concat t3 seed in
let r0 = shake128 18 b0 (2 * n) in
let r1 = shake128 18 b1 (2 * n) in
let r2 = shake128 18 b2 (2 * n) in
let r3 = shake128 18 b3 (2 * n) in
r0, r1, r2, r3 | val frodo_gen_matrix_shake_4x1_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n)
let frodo_gen_matrix_shake_4x1_get_r n seed i = | false | null | false | let t0 = uint_to_bytes_le (u16 (4 * i + 0)) in
let t1 = uint_to_bytes_le (u16 (4 * i + 1)) in
let t2 = uint_to_bytes_le (u16 (4 * i + 2)) in
let t3 = uint_to_bytes_le (u16 (4 * i + 3)) in
let b0 = concat t0 seed in
let b1 = concat t1 seed in
let b2 = concat t2 seed in
let b3 = concat t3 seed in
let r0 = shake128 18 b0 (2 * n) in
let r1 = shake128 18 b1 (2 * n) in
let r2 = shake128 18 b2 (2 * n) in
let r3 = shake128 18 b3 (2 * n) in
r0, r1, r2, r3 | {
"checked_file": "Spec.Frodo.Gen.fst.checked",
"dependencies": [
"Spec.SHA3.fst.checked",
"Spec.Matrix.fst.checked",
"Spec.AES.fst.checked",
"prims.fst.checked",
"Lib.Sequence.Lemmas.fsti.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.Frodo.Gen.fst"
} | [
"total"
] | [
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.max_size_t",
"Lib.IntTypes.maxint",
"Lib.IntTypes.U16",
"Lib.ByteSequence.lbytes",
"Prims.op_LessThan",
"Prims.op_Division",
"FStar.Pervasives.Native.Mktuple4",
"Lib.Sequence.lseq",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Prims.op_Multiply",
"Spec.SHA3.shake128",
"Prims.op_Addition",
"Prims.eq2",
"FStar.Seq.Base.seq",
"Lib.Sequence.to_seq",
"FStar.Seq.Base.append",
"Lib.Sequence.concat",
"Lib.IntTypes.uint_t",
"Lib.IntTypes.numbytes",
"Lib.ByteSequence.uint_to_bytes_le",
"Lib.IntTypes.u16",
"FStar.Pervasives.Native.tuple4"
] | [] | module Spec.Frodo.Gen
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Matrix
open Spec.SHA3
open Spec.AES
module Matrix = Spec.Matrix
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val frodo_gen_matrix_shake_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> lbytes (2 * n)
let frodo_gen_matrix_shake_get_r n seed i =
let tmp = uint_to_bytes_le (u16 i) in
let b = concat tmp seed in
shake128 18 b (2 * n)
val frodo_gen_matrix_shake0:
n:size_nat{n * n <= max_size_t}
-> i:size_nat{i < n}
-> res_i:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake0 n i res_i j res0 =
res0.(i, j) <- uint_from_bytes_le (LSeq.sub res_i (j * 2) 2)
val frodo_gen_matrix_shake1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> matrix n n
let frodo_gen_matrix_shake1 n seed i res =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res
val frodo_gen_matrix_shake:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_shake n seed =
let res = Matrix.create n n in
Loops.repeati n (frodo_gen_matrix_shake1 n seed) res
val frodo_gen_matrix_shake_4x0:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> i:size_nat{i < n / 4}
-> r0:lbytes (2 * n)
-> r1:lbytes (2 * n)
-> r2:lbytes (2 * n)
-> r3:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3 j res0 =
let res0 = res0.(4 * i + 0, j) <- uint_from_bytes_le (LSeq.sub r0 (j * 2) 2) in
let res0 = res0.(4 * i + 1, j) <- uint_from_bytes_le (LSeq.sub r1 (j * 2) 2) in
let res0 = res0.(4 * i + 2, j) <- uint_from_bytes_le (LSeq.sub r2 (j * 2) 2) in
let res0 = res0.(4 * i + 3, j) <- uint_from_bytes_le (LSeq.sub r3 (j * 2) 2) in
res0
val frodo_gen_matrix_shake_4x1_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n) | false | false | Spec.Frodo.Gen.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val frodo_gen_matrix_shake_4x1_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n) | [] | Spec.Frodo.Gen.frodo_gen_matrix_shake_4x1_get_r | {
"file_name": "specs/frodo/Spec.Frodo.Gen.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
n:
Lib.IntTypes.size_nat
{n * n <= Lib.IntTypes.max_size_t /\ n <= Lib.IntTypes.maxint Lib.IntTypes.U16} ->
seed: Lib.ByteSequence.lbytes 16 ->
i: Lib.IntTypes.size_nat{i < n / 4}
-> ((Lib.ByteSequence.lbytes (2 * n) * Lib.ByteSequence.lbytes (2 * n)) *
Lib.ByteSequence.lbytes (2 * n)) *
Lib.ByteSequence.lbytes (2 * n) | {
"end_col": 16,
"end_line": 105,
"start_col": 47,
"start_line": 90
} |
Prims.Pure | val frodo_gen_matrix_shake1_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> Pure (matrix n n)
(requires True)
(ensures fun res1 ->
let res_i = frodo_gen_matrix_shake_get_r n seed i in
res1 == Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "Spec.Matrix",
"short_module": "Matrix"
},
{
"abbrev": false,
"full_module": "Spec.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.SHA3",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Matrix",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let frodo_gen_matrix_shake1_ind n seed i res =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
//Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res
Loops.repeati_inductive' #(matrix n n) n
(fun j res0 ->
(forall (i0:size_nat{i0 < i}) (j:size_nat{j < n}). res0.(i0, j) == res.(i0, j)) /\
(forall (j0:size_nat{j0 < j}). res0.(i, j0) == frodo_gen_matrix_shake_fc n seed i j0))
(frodo_gen_matrix_shake0 n i res_i) res | val frodo_gen_matrix_shake1_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> Pure (matrix n n)
(requires True)
(ensures fun res1 ->
let res_i = frodo_gen_matrix_shake_get_r n seed i in
res1 == Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res)
let frodo_gen_matrix_shake1_ind n seed i res = | false | null | false | let res_i = frodo_gen_matrix_shake_get_r n seed i in
Loops.repeati_inductive' #(matrix n n)
n
(fun j res0 ->
(forall (i0: size_nat{i0 < i}) (j: size_nat{j < n}). res0.(i0, j) == res.(i0, j)) /\
(forall (j0: size_nat{j0 < j}). res0.(i, j0) == frodo_gen_matrix_shake_fc n seed i j0))
(frodo_gen_matrix_shake0 n i res_i)
res | {
"checked_file": "Spec.Frodo.Gen.fst.checked",
"dependencies": [
"Spec.SHA3.fst.checked",
"Spec.Matrix.fst.checked",
"Spec.AES.fst.checked",
"prims.fst.checked",
"Lib.Sequence.Lemmas.fsti.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.Frodo.Gen.fst"
} | [] | [
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.max_size_t",
"Lib.IntTypes.maxint",
"Lib.IntTypes.U16",
"Lib.ByteSequence.lbytes",
"Prims.op_LessThan",
"Spec.Matrix.matrix",
"Lib.LoopCombinators.repeati_inductive'",
"Prims.nat",
"Prims.l_Forall",
"Prims.eq2",
"Spec.Matrix.elem",
"Spec.Matrix.op_Array_Access",
"FStar.Pervasives.Native.Mktuple2",
"Lib.IntTypes.uint16",
"Spec.Frodo.Gen.frodo_gen_matrix_shake_fc",
"Spec.Frodo.Gen.frodo_gen_matrix_shake0",
"Lib.Sequence.lseq",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Prims.op_Multiply",
"Spec.Frodo.Gen.frodo_gen_matrix_shake_get_r"
] | [] | module Spec.Frodo.Gen
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Matrix
open Spec.SHA3
open Spec.AES
module Matrix = Spec.Matrix
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val frodo_gen_matrix_shake_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> lbytes (2 * n)
let frodo_gen_matrix_shake_get_r n seed i =
let tmp = uint_to_bytes_le (u16 i) in
let b = concat tmp seed in
shake128 18 b (2 * n)
val frodo_gen_matrix_shake0:
n:size_nat{n * n <= max_size_t}
-> i:size_nat{i < n}
-> res_i:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake0 n i res_i j res0 =
res0.(i, j) <- uint_from_bytes_le (LSeq.sub res_i (j * 2) 2)
val frodo_gen_matrix_shake1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> matrix n n
let frodo_gen_matrix_shake1 n seed i res =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res
val frodo_gen_matrix_shake:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_shake n seed =
let res = Matrix.create n n in
Loops.repeati n (frodo_gen_matrix_shake1 n seed) res
val frodo_gen_matrix_shake_4x0:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> i:size_nat{i < n / 4}
-> r0:lbytes (2 * n)
-> r1:lbytes (2 * n)
-> r2:lbytes (2 * n)
-> r3:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3 j res0 =
let res0 = res0.(4 * i + 0, j) <- uint_from_bytes_le (LSeq.sub r0 (j * 2) 2) in
let res0 = res0.(4 * i + 1, j) <- uint_from_bytes_le (LSeq.sub r1 (j * 2) 2) in
let res0 = res0.(4 * i + 2, j) <- uint_from_bytes_le (LSeq.sub r2 (j * 2) 2) in
let res0 = res0.(4 * i + 3, j) <- uint_from_bytes_le (LSeq.sub r3 (j * 2) 2) in
res0
val frodo_gen_matrix_shake_4x1_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n)
let frodo_gen_matrix_shake_4x1_get_r n seed i =
let t0 = uint_to_bytes_le (u16 (4 * i + 0)) in
let t1 = uint_to_bytes_le (u16 (4 * i + 1)) in
let t2 = uint_to_bytes_le (u16 (4 * i + 2)) in
let t3 = uint_to_bytes_le (u16 (4 * i + 3)) in
let b0 = concat t0 seed in
let b1 = concat t1 seed in
let b2 = concat t2 seed in
let b3 = concat t3 seed in
let r0 = shake128 18 b0 (2 * n) in
let r1 = shake128 18 b1 (2 * n) in
let r2 = shake128 18 b2 (2 * n) in
let r3 = shake128 18 b3 (2 * n) in
r0, r1, r2, r3
val frodo_gen_matrix_shake_4x1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> res:matrix n n
-> matrix n n
let frodo_gen_matrix_shake_4x1 n seed i res =
let r0, r1, r2, r3 = frodo_gen_matrix_shake_4x1_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res
val frodo_gen_matrix_shake_4x:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_shake_4x n seed =
let res = Matrix.create n n in
let n4 = n / 4 in
Loops.repeati n4 (frodo_gen_matrix_shake_4x1 n seed) res
val frodo_gen_matrix_aes:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_aes n seed =
let res = Matrix.create n n in
let key = aes128_key_expansion seed in
let tmp = LSeq.create 8 (u16 0) in
let n1 = n / 8 in
Loops.repeati n
(fun i res ->
Loops.repeati n1
(fun j res ->
let j = j * 8 in
let tmp = tmp.[0] <- u16 i in
let tmp = tmp.[1] <- u16 j in
let res_i = aes_encrypt_block AES128 key (uints_to_bytes_le tmp) in
Loops.repeati 8
(fun k res ->
res.(i, j + k) <- uint_from_bytes_le (LSeq.sub res_i (k * 2) 2)
) res
) res
) res
(** Lemma (frodo_gen_matrix_shake == frodo_gen_matrix_shake_4x) *)
val frodo_gen_matrix_shake_fc:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> j:size_nat{j < n}
-> GTot uint16
let frodo_gen_matrix_shake_fc n seed i j =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
uint_from_bytes_le (LSeq.sub res_i (j * 2) 2)
val frodo_gen_matrix_shake1_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> Pure (matrix n n)
(requires True)
(ensures fun res1 ->
let res_i = frodo_gen_matrix_shake_get_r n seed i in
res1 == Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res) | false | false | Spec.Frodo.Gen.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val frodo_gen_matrix_shake1_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> Pure (matrix n n)
(requires True)
(ensures fun res1 ->
let res_i = frodo_gen_matrix_shake_get_r n seed i in
res1 == Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res) | [] | Spec.Frodo.Gen.frodo_gen_matrix_shake1_ind | {
"file_name": "specs/frodo/Spec.Frodo.Gen.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
n:
Lib.IntTypes.size_nat
{n * n <= Lib.IntTypes.max_size_t /\ n <= Lib.IntTypes.maxint Lib.IntTypes.U16} ->
seed: Lib.ByteSequence.lbytes 16 ->
i: Lib.IntTypes.size_nat{i < n} ->
res: Spec.Matrix.matrix n n
-> Prims.Pure (Spec.Matrix.matrix n n) | {
"end_col": 41,
"end_line": 190,
"start_col": 46,
"start_line": 182
} |
FStar.Pervasives.Lemma | val lemma_gen_matrix_4x:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16
-> res:matrix n n
-> Lemma
(requires (forall (i0:size_nat{i0 < n / 4}) (j:size_nat{j < n}) (k:size_nat{k < 4}).
res.(4 * i0 + k, j) == frodo_gen_matrix_shake_fc n seed (4 * i0 + k) j))
(ensures (forall (i:size_nat{i < n}) (j:size_nat{j < n}).
res.(i, j) == frodo_gen_matrix_shake_fc n seed i j)) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "Spec.Matrix",
"short_module": "Matrix"
},
{
"abbrev": false,
"full_module": "Spec.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.SHA3",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Matrix",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let lemma_gen_matrix_4x n seed res =
assert (forall (i0:size_nat{i0 < n / 4}) (j:size_nat{j < n}) (k:size_nat{k < 4}).
frodo_gen_matrix_shake_fc n seed (4 * i0 + k) j == frodo_gen_matrix_shake_fc n seed (i0 * 4 + k) j);
assert (forall (i:size_nat{i < n}) (j:size_nat{j < n}). i == i / 4 * 4 + i % 4 /\ i / 4 < n / 4 /\ i % 4 < 4);
assert (forall (i:size_nat{i < n}) (j:size_nat{j < n}). res.(i, j) == frodo_gen_matrix_shake_fc n seed (i / 4 * 4 + i % 4) j) | val lemma_gen_matrix_4x:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16
-> res:matrix n n
-> Lemma
(requires (forall (i0:size_nat{i0 < n / 4}) (j:size_nat{j < n}) (k:size_nat{k < 4}).
res.(4 * i0 + k, j) == frodo_gen_matrix_shake_fc n seed (4 * i0 + k) j))
(ensures (forall (i:size_nat{i < n}) (j:size_nat{j < n}).
res.(i, j) == frodo_gen_matrix_shake_fc n seed i j))
let lemma_gen_matrix_4x n seed res = | false | null | true | assert (forall (i0: size_nat{i0 < n / 4}) (j: size_nat{j < n}) (k: size_nat{k < 4}).
frodo_gen_matrix_shake_fc n seed (4 * i0 + k) j ==
frodo_gen_matrix_shake_fc n seed (i0 * 4 + k) j);
assert (forall (i: size_nat{i < n}) (j: size_nat{j < n}).
i == (i / 4) * 4 + i % 4 /\ i / 4 < n / 4 /\ i % 4 < 4);
assert (forall (i: size_nat{i < n}) (j: size_nat{j < n}).
res.(i, j) == frodo_gen_matrix_shake_fc n seed ((i / 4) * 4 + i % 4) j) | {
"checked_file": "Spec.Frodo.Gen.fst.checked",
"dependencies": [
"Spec.SHA3.fst.checked",
"Spec.Matrix.fst.checked",
"Spec.AES.fst.checked",
"prims.fst.checked",
"Lib.Sequence.Lemmas.fsti.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.Frodo.Gen.fst"
} | [
"lemma"
] | [
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.max_size_t",
"Lib.IntTypes.maxint",
"Lib.IntTypes.U16",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Lib.ByteSequence.lbytes",
"Spec.Matrix.matrix",
"Prims._assert",
"Prims.l_Forall",
"Prims.op_LessThan",
"Prims.eq2",
"Lib.IntTypes.uint16",
"Spec.Matrix.op_Array_Access",
"FStar.Pervasives.Native.Mktuple2",
"Spec.Frodo.Gen.frodo_gen_matrix_shake_fc",
"Prims.op_Addition",
"Prims.op_Division",
"Prims.unit"
] | [] | module Spec.Frodo.Gen
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Matrix
open Spec.SHA3
open Spec.AES
module Matrix = Spec.Matrix
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val frodo_gen_matrix_shake_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> lbytes (2 * n)
let frodo_gen_matrix_shake_get_r n seed i =
let tmp = uint_to_bytes_le (u16 i) in
let b = concat tmp seed in
shake128 18 b (2 * n)
val frodo_gen_matrix_shake0:
n:size_nat{n * n <= max_size_t}
-> i:size_nat{i < n}
-> res_i:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake0 n i res_i j res0 =
res0.(i, j) <- uint_from_bytes_le (LSeq.sub res_i (j * 2) 2)
val frodo_gen_matrix_shake1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> matrix n n
let frodo_gen_matrix_shake1 n seed i res =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res
val frodo_gen_matrix_shake:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_shake n seed =
let res = Matrix.create n n in
Loops.repeati n (frodo_gen_matrix_shake1 n seed) res
val frodo_gen_matrix_shake_4x0:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> i:size_nat{i < n / 4}
-> r0:lbytes (2 * n)
-> r1:lbytes (2 * n)
-> r2:lbytes (2 * n)
-> r3:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3 j res0 =
let res0 = res0.(4 * i + 0, j) <- uint_from_bytes_le (LSeq.sub r0 (j * 2) 2) in
let res0 = res0.(4 * i + 1, j) <- uint_from_bytes_le (LSeq.sub r1 (j * 2) 2) in
let res0 = res0.(4 * i + 2, j) <- uint_from_bytes_le (LSeq.sub r2 (j * 2) 2) in
let res0 = res0.(4 * i + 3, j) <- uint_from_bytes_le (LSeq.sub r3 (j * 2) 2) in
res0
val frodo_gen_matrix_shake_4x1_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n)
let frodo_gen_matrix_shake_4x1_get_r n seed i =
let t0 = uint_to_bytes_le (u16 (4 * i + 0)) in
let t1 = uint_to_bytes_le (u16 (4 * i + 1)) in
let t2 = uint_to_bytes_le (u16 (4 * i + 2)) in
let t3 = uint_to_bytes_le (u16 (4 * i + 3)) in
let b0 = concat t0 seed in
let b1 = concat t1 seed in
let b2 = concat t2 seed in
let b3 = concat t3 seed in
let r0 = shake128 18 b0 (2 * n) in
let r1 = shake128 18 b1 (2 * n) in
let r2 = shake128 18 b2 (2 * n) in
let r3 = shake128 18 b3 (2 * n) in
r0, r1, r2, r3
val frodo_gen_matrix_shake_4x1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> res:matrix n n
-> matrix n n
let frodo_gen_matrix_shake_4x1 n seed i res =
let r0, r1, r2, r3 = frodo_gen_matrix_shake_4x1_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res
val frodo_gen_matrix_shake_4x:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_shake_4x n seed =
let res = Matrix.create n n in
let n4 = n / 4 in
Loops.repeati n4 (frodo_gen_matrix_shake_4x1 n seed) res
val frodo_gen_matrix_aes:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_aes n seed =
let res = Matrix.create n n in
let key = aes128_key_expansion seed in
let tmp = LSeq.create 8 (u16 0) in
let n1 = n / 8 in
Loops.repeati n
(fun i res ->
Loops.repeati n1
(fun j res ->
let j = j * 8 in
let tmp = tmp.[0] <- u16 i in
let tmp = tmp.[1] <- u16 j in
let res_i = aes_encrypt_block AES128 key (uints_to_bytes_le tmp) in
Loops.repeati 8
(fun k res ->
res.(i, j + k) <- uint_from_bytes_le (LSeq.sub res_i (k * 2) 2)
) res
) res
) res
(** Lemma (frodo_gen_matrix_shake == frodo_gen_matrix_shake_4x) *)
val frodo_gen_matrix_shake_fc:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> j:size_nat{j < n}
-> GTot uint16
let frodo_gen_matrix_shake_fc n seed i j =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
uint_from_bytes_le (LSeq.sub res_i (j * 2) 2)
val frodo_gen_matrix_shake1_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> Pure (matrix n n)
(requires True)
(ensures fun res1 ->
let res_i = frodo_gen_matrix_shake_get_r n seed i in
res1 == Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res)
let frodo_gen_matrix_shake1_ind n seed i res =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
//Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res
Loops.repeati_inductive' #(matrix n n) n
(fun j res0 ->
(forall (i0:size_nat{i0 < i}) (j:size_nat{j < n}). res0.(i0, j) == res.(i0, j)) /\
(forall (j0:size_nat{j0 < j}). res0.(i, j0) == frodo_gen_matrix_shake_fc n seed i j0))
(frodo_gen_matrix_shake0 n i res_i) res
val frodo_gen_matrix_shake_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> Pure (matrix n n)
(requires True)
(ensures fun res ->
res == Loops.repeati n (frodo_gen_matrix_shake1_ind n seed) (Matrix.create n n) /\
(forall (i:size_nat{i < n}) (j:size_nat{j < n}).
res.(i, j) == frodo_gen_matrix_shake_fc n seed i j))
let frodo_gen_matrix_shake_ind n seed =
let res = Matrix.create n n in
//Loops.repeati n (frodo_gen_matrix_shake1 n seed) res
Loops.repeati_inductive' #(matrix n n) n
(fun i res ->
forall (i0:size_nat{i0 < i}) (j:size_nat{j < n}).
res.(i0, j) == frodo_gen_matrix_shake_fc n seed i0 j)
(frodo_gen_matrix_shake1_ind n seed) res
val frodo_gen_matrix_shake_4x1_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> res:matrix n n
-> Pure (matrix n n)
(requires True)
(ensures fun res1 ->
let r0, r1, r2, r3 = frodo_gen_matrix_shake_4x1_get_r n seed i in
res1 == Loops.repeati n (frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res)
let frodo_gen_matrix_shake_4x1_ind n seed i res =
let r0, r1, r2, r3 = frodo_gen_matrix_shake_4x1_get_r n seed i in
//Loops.repeati n (frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res
Loops.repeati_inductive' #(matrix n n) n
(fun j res0 ->
(forall (i0:size_nat{i0 < i}) (j:size_nat{j < n}) (k:size_nat{k < 4}).
res0.(4 * i0 + k, j) == res.(4 * i0 + k, j)) /\
(forall (j0:size_nat{j0 < j}) (k:size_nat{k < 4}).
res0.(4 * i + k, j0) == frodo_gen_matrix_shake_fc n seed (4 * i + k) j0))
(frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res
val lemma_gen_matrix_4x:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16
-> res:matrix n n
-> Lemma
(requires (forall (i0:size_nat{i0 < n / 4}) (j:size_nat{j < n}) (k:size_nat{k < 4}).
res.(4 * i0 + k, j) == frodo_gen_matrix_shake_fc n seed (4 * i0 + k) j))
(ensures (forall (i:size_nat{i < n}) (j:size_nat{j < n}).
res.(i, j) == frodo_gen_matrix_shake_fc n seed i j)) | false | false | Spec.Frodo.Gen.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val lemma_gen_matrix_4x:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16
-> res:matrix n n
-> Lemma
(requires (forall (i0:size_nat{i0 < n / 4}) (j:size_nat{j < n}) (k:size_nat{k < 4}).
res.(4 * i0 + k, j) == frodo_gen_matrix_shake_fc n seed (4 * i0 + k) j))
(ensures (forall (i:size_nat{i < n}) (j:size_nat{j < n}).
res.(i, j) == frodo_gen_matrix_shake_fc n seed i j)) | [] | Spec.Frodo.Gen.lemma_gen_matrix_4x | {
"file_name": "specs/frodo/Spec.Frodo.Gen.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
n:
Lib.IntTypes.size_nat
{n * n <= Lib.IntTypes.max_size_t /\ n <= Lib.IntTypes.maxint Lib.IntTypes.U16 /\ n % 4 = 0} ->
seed: Lib.ByteSequence.lbytes 16 ->
res: Spec.Matrix.matrix n n
-> FStar.Pervasives.Lemma
(requires
forall (i0: Lib.IntTypes.size_nat{i0 < n / 4})
(j: Lib.IntTypes.size_nat{j < n})
(k: Lib.IntTypes.size_nat{k < 4}).
res.(4 * i0 + k, j) == Spec.Frodo.Gen.frodo_gen_matrix_shake_fc n seed (4 * i0 + k) j)
(ensures
forall (i: Lib.IntTypes.size_nat{i < n}) (j: Lib.IntTypes.size_nat{j < n}).
res.(i, j) == Spec.Frodo.Gen.frodo_gen_matrix_shake_fc n seed i j) | {
"end_col": 127,
"end_line": 251,
"start_col": 2,
"start_line": 248
} |
Prims.Tot | val frodo_gen_matrix_aes:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "Spec.Matrix",
"short_module": "Matrix"
},
{
"abbrev": false,
"full_module": "Spec.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.SHA3",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Matrix",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let frodo_gen_matrix_aes n seed =
let res = Matrix.create n n in
let key = aes128_key_expansion seed in
let tmp = LSeq.create 8 (u16 0) in
let n1 = n / 8 in
Loops.repeati n
(fun i res ->
Loops.repeati n1
(fun j res ->
let j = j * 8 in
let tmp = tmp.[0] <- u16 i in
let tmp = tmp.[1] <- u16 j in
let res_i = aes_encrypt_block AES128 key (uints_to_bytes_le tmp) in
Loops.repeati 8
(fun k res ->
res.(i, j + k) <- uint_from_bytes_le (LSeq.sub res_i (k * 2) 2)
) res
) res
) res | val frodo_gen_matrix_aes:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_aes n seed = | false | null | false | let res = Matrix.create n n in
let key = aes128_key_expansion seed in
let tmp = LSeq.create 8 (u16 0) in
let n1 = n / 8 in
Loops.repeati n
(fun i res ->
Loops.repeati n1
(fun j res ->
let j = j * 8 in
let tmp = tmp.[ 0 ] <- u16 i in
let tmp = tmp.[ 1 ] <- u16 j in
let res_i = aes_encrypt_block AES128 key (uints_to_bytes_le tmp) in
Loops.repeati 8
(fun k res -> res.(i, j + k) <- uint_from_bytes_le (LSeq.sub res_i (k * 2) 2))
res)
res)
res | {
"checked_file": "Spec.Frodo.Gen.fst.checked",
"dependencies": [
"Spec.SHA3.fst.checked",
"Spec.Matrix.fst.checked",
"Spec.AES.fst.checked",
"prims.fst.checked",
"Lib.Sequence.Lemmas.fsti.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.Frodo.Gen.fst"
} | [
"total"
] | [
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.max_size_t",
"Lib.IntTypes.maxint",
"Lib.IntTypes.U16",
"Lib.ByteSequence.lbytes",
"Lib.LoopCombinators.repeati",
"Spec.Matrix.matrix",
"Prims.nat",
"Prims.op_LessThan",
"Spec.Matrix.op_Array_Assignment",
"FStar.Pervasives.Native.Mktuple2",
"Prims.op_Addition",
"Lib.ByteSequence.uint_from_bytes_le",
"Lib.IntTypes.SEC",
"Lib.Sequence.sub",
"Spec.AES.elem",
"Spec.AES.block",
"Spec.AES.aes_encrypt_block",
"Spec.AES.AES128",
"Lib.ByteSequence.uints_to_bytes_le",
"Lib.Sequence.lseq",
"Lib.IntTypes.int_t",
"Prims.eq2",
"FStar.Seq.Base.seq",
"Lib.Sequence.to_seq",
"FStar.Seq.Base.upd",
"Lib.IntTypes.mk_int",
"Lib.Sequence.index",
"Prims.l_Forall",
"Prims.op_Subtraction",
"Prims.pow2",
"Prims.l_imp",
"Prims.op_disEquality",
"Prims.l_or",
"FStar.Seq.Base.index",
"Lib.Sequence.op_String_Assignment",
"Lib.IntTypes.uint_t",
"Lib.IntTypes.u16",
"Prims.int",
"Prims.op_Division",
"FStar.Seq.Base.create",
"Lib.Sequence.create",
"Prims.op_Multiply",
"Spec.AES.aes128_key_expansion",
"Spec.Matrix.create"
] | [] | module Spec.Frodo.Gen
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Matrix
open Spec.SHA3
open Spec.AES
module Matrix = Spec.Matrix
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val frodo_gen_matrix_shake_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> lbytes (2 * n)
let frodo_gen_matrix_shake_get_r n seed i =
let tmp = uint_to_bytes_le (u16 i) in
let b = concat tmp seed in
shake128 18 b (2 * n)
val frodo_gen_matrix_shake0:
n:size_nat{n * n <= max_size_t}
-> i:size_nat{i < n}
-> res_i:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake0 n i res_i j res0 =
res0.(i, j) <- uint_from_bytes_le (LSeq.sub res_i (j * 2) 2)
val frodo_gen_matrix_shake1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> matrix n n
let frodo_gen_matrix_shake1 n seed i res =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res
val frodo_gen_matrix_shake:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_shake n seed =
let res = Matrix.create n n in
Loops.repeati n (frodo_gen_matrix_shake1 n seed) res
val frodo_gen_matrix_shake_4x0:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> i:size_nat{i < n / 4}
-> r0:lbytes (2 * n)
-> r1:lbytes (2 * n)
-> r2:lbytes (2 * n)
-> r3:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3 j res0 =
let res0 = res0.(4 * i + 0, j) <- uint_from_bytes_le (LSeq.sub r0 (j * 2) 2) in
let res0 = res0.(4 * i + 1, j) <- uint_from_bytes_le (LSeq.sub r1 (j * 2) 2) in
let res0 = res0.(4 * i + 2, j) <- uint_from_bytes_le (LSeq.sub r2 (j * 2) 2) in
let res0 = res0.(4 * i + 3, j) <- uint_from_bytes_le (LSeq.sub r3 (j * 2) 2) in
res0
val frodo_gen_matrix_shake_4x1_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n)
let frodo_gen_matrix_shake_4x1_get_r n seed i =
let t0 = uint_to_bytes_le (u16 (4 * i + 0)) in
let t1 = uint_to_bytes_le (u16 (4 * i + 1)) in
let t2 = uint_to_bytes_le (u16 (4 * i + 2)) in
let t3 = uint_to_bytes_le (u16 (4 * i + 3)) in
let b0 = concat t0 seed in
let b1 = concat t1 seed in
let b2 = concat t2 seed in
let b3 = concat t3 seed in
let r0 = shake128 18 b0 (2 * n) in
let r1 = shake128 18 b1 (2 * n) in
let r2 = shake128 18 b2 (2 * n) in
let r3 = shake128 18 b3 (2 * n) in
r0, r1, r2, r3
val frodo_gen_matrix_shake_4x1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> res:matrix n n
-> matrix n n
let frodo_gen_matrix_shake_4x1 n seed i res =
let r0, r1, r2, r3 = frodo_gen_matrix_shake_4x1_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res
val frodo_gen_matrix_shake_4x:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_shake_4x n seed =
let res = Matrix.create n n in
let n4 = n / 4 in
Loops.repeati n4 (frodo_gen_matrix_shake_4x1 n seed) res
val frodo_gen_matrix_aes:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n | false | false | Spec.Frodo.Gen.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val frodo_gen_matrix_aes:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n | [] | Spec.Frodo.Gen.frodo_gen_matrix_aes | {
"file_name": "specs/frodo/Spec.Frodo.Gen.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
n:
Lib.IntTypes.size_nat
{n * n <= Lib.IntTypes.max_size_t /\ n <= Lib.IntTypes.maxint Lib.IntTypes.U16} ->
seed: Lib.ByteSequence.lbytes 16
-> Spec.Matrix.matrix n n | {
"end_col": 7,
"end_line": 154,
"start_col": 33,
"start_line": 136
} |
FStar.Pervasives.Lemma | val frodo_gen_matrix_shake_4x_lemma:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16 -> Lemma
(frodo_gen_matrix_shake_4x n seed == frodo_gen_matrix_shake n seed) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "Spec.Matrix",
"short_module": "Matrix"
},
{
"abbrev": false,
"full_module": "Spec.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.SHA3",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Matrix",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let frodo_gen_matrix_shake_4x_lemma n seed =
let res = Matrix.create n n in
let r_4x = frodo_gen_matrix_shake_4x n seed in
let r = frodo_gen_matrix_shake n seed in
let r_ind_4x = frodo_gen_matrix_shake_4x_ind n seed in
let r_ind = frodo_gen_matrix_shake_ind n seed in
assert (r_ind_4x == r_ind);
assert (r_ind == Loops.repeati n (frodo_gen_matrix_shake1_ind n seed) res);
assert (r_ind_4x == Loops.repeati (n / 4) (frodo_gen_matrix_shake_4x1_ind n seed) res);
let aux_r (i:nat{i < n}) (acc:matrix n n) :
Lemma (frodo_gen_matrix_shake1_ind n seed i acc == frodo_gen_matrix_shake1 n seed i acc) = () in
Classical.forall_intro_2 aux_r;
Lib.Sequence.Lemmas.repeati_extensionality n
(frodo_gen_matrix_shake1_ind n seed) (frodo_gen_matrix_shake1 n seed) res;
assert (r_ind == frodo_gen_matrix_shake n seed);
let aux_r_4x (i:nat{i < n / 4}) (acc:matrix n n) :
Lemma (frodo_gen_matrix_shake_4x1_ind n seed i acc == frodo_gen_matrix_shake_4x1 n seed i acc) = () in
Classical.forall_intro_2 aux_r_4x;
Lib.Sequence.Lemmas.repeati_extensionality (n / 4)
(frodo_gen_matrix_shake_4x1_ind n seed) (frodo_gen_matrix_shake_4x1 n seed) res;
assert (r_ind_4x == frodo_gen_matrix_shake_4x n seed);
assert (r_4x == r) | val frodo_gen_matrix_shake_4x_lemma:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16 -> Lemma
(frodo_gen_matrix_shake_4x n seed == frodo_gen_matrix_shake n seed)
let frodo_gen_matrix_shake_4x_lemma n seed = | false | null | true | let res = Matrix.create n n in
let r_4x = frodo_gen_matrix_shake_4x n seed in
let r = frodo_gen_matrix_shake n seed in
let r_ind_4x = frodo_gen_matrix_shake_4x_ind n seed in
let r_ind = frodo_gen_matrix_shake_ind n seed in
assert (r_ind_4x == r_ind);
assert (r_ind == Loops.repeati n (frodo_gen_matrix_shake1_ind n seed) res);
assert (r_ind_4x == Loops.repeati (n / 4) (frodo_gen_matrix_shake_4x1_ind n seed) res);
let aux_r (i: nat{i < n}) (acc: matrix n n)
: Lemma (frodo_gen_matrix_shake1_ind n seed i acc == frodo_gen_matrix_shake1 n seed i acc) =
()
in
Classical.forall_intro_2 aux_r;
Lib.Sequence.Lemmas.repeati_extensionality n
(frodo_gen_matrix_shake1_ind n seed)
(frodo_gen_matrix_shake1 n seed)
res;
assert (r_ind == frodo_gen_matrix_shake n seed);
let aux_r_4x (i: nat{i < n / 4}) (acc: matrix n n)
: Lemma (frodo_gen_matrix_shake_4x1_ind n seed i acc == frodo_gen_matrix_shake_4x1 n seed i acc)
=
()
in
Classical.forall_intro_2 aux_r_4x;
Lib.Sequence.Lemmas.repeati_extensionality (n / 4)
(frodo_gen_matrix_shake_4x1_ind n seed)
(frodo_gen_matrix_shake_4x1 n seed)
res;
assert (r_ind_4x == frodo_gen_matrix_shake_4x n seed);
assert (r_4x == r) | {
"checked_file": "Spec.Frodo.Gen.fst.checked",
"dependencies": [
"Spec.SHA3.fst.checked",
"Spec.Matrix.fst.checked",
"Spec.AES.fst.checked",
"prims.fst.checked",
"Lib.Sequence.Lemmas.fsti.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.Frodo.Gen.fst"
} | [
"lemma"
] | [
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.max_size_t",
"Lib.IntTypes.maxint",
"Lib.IntTypes.U16",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Lib.ByteSequence.lbytes",
"Prims._assert",
"Prims.eq2",
"Spec.Matrix.matrix",
"Prims.unit",
"Spec.Frodo.Gen.frodo_gen_matrix_shake_4x",
"Lib.Sequence.Lemmas.repeati_extensionality",
"Prims.op_Division",
"Spec.Frodo.Gen.frodo_gen_matrix_shake_4x1_ind",
"Spec.Frodo.Gen.frodo_gen_matrix_shake_4x1",
"FStar.Classical.forall_intro_2",
"Prims.nat",
"Prims.op_LessThan",
"Lib.Sequence.lseq",
"Lib.IntTypes.int_t",
"Lib.IntTypes.SEC",
"Prims.op_Multiply",
"Prims.l_True",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasives.pattern",
"Spec.Frodo.Gen.frodo_gen_matrix_shake",
"Spec.Frodo.Gen.frodo_gen_matrix_shake1_ind",
"Spec.Frodo.Gen.frodo_gen_matrix_shake1",
"Lib.LoopCombinators.repeati",
"Spec.Frodo.Gen.frodo_gen_matrix_shake_ind",
"Spec.Frodo.Gen.frodo_gen_matrix_shake_4x_ind",
"Spec.Matrix.create"
] | [] | module Spec.Frodo.Gen
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Matrix
open Spec.SHA3
open Spec.AES
module Matrix = Spec.Matrix
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val frodo_gen_matrix_shake_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> lbytes (2 * n)
let frodo_gen_matrix_shake_get_r n seed i =
let tmp = uint_to_bytes_le (u16 i) in
let b = concat tmp seed in
shake128 18 b (2 * n)
val frodo_gen_matrix_shake0:
n:size_nat{n * n <= max_size_t}
-> i:size_nat{i < n}
-> res_i:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake0 n i res_i j res0 =
res0.(i, j) <- uint_from_bytes_le (LSeq.sub res_i (j * 2) 2)
val frodo_gen_matrix_shake1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> matrix n n
let frodo_gen_matrix_shake1 n seed i res =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res
val frodo_gen_matrix_shake:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_shake n seed =
let res = Matrix.create n n in
Loops.repeati n (frodo_gen_matrix_shake1 n seed) res
val frodo_gen_matrix_shake_4x0:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> i:size_nat{i < n / 4}
-> r0:lbytes (2 * n)
-> r1:lbytes (2 * n)
-> r2:lbytes (2 * n)
-> r3:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3 j res0 =
let res0 = res0.(4 * i + 0, j) <- uint_from_bytes_le (LSeq.sub r0 (j * 2) 2) in
let res0 = res0.(4 * i + 1, j) <- uint_from_bytes_le (LSeq.sub r1 (j * 2) 2) in
let res0 = res0.(4 * i + 2, j) <- uint_from_bytes_le (LSeq.sub r2 (j * 2) 2) in
let res0 = res0.(4 * i + 3, j) <- uint_from_bytes_le (LSeq.sub r3 (j * 2) 2) in
res0
val frodo_gen_matrix_shake_4x1_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n)
let frodo_gen_matrix_shake_4x1_get_r n seed i =
let t0 = uint_to_bytes_le (u16 (4 * i + 0)) in
let t1 = uint_to_bytes_le (u16 (4 * i + 1)) in
let t2 = uint_to_bytes_le (u16 (4 * i + 2)) in
let t3 = uint_to_bytes_le (u16 (4 * i + 3)) in
let b0 = concat t0 seed in
let b1 = concat t1 seed in
let b2 = concat t2 seed in
let b3 = concat t3 seed in
let r0 = shake128 18 b0 (2 * n) in
let r1 = shake128 18 b1 (2 * n) in
let r2 = shake128 18 b2 (2 * n) in
let r3 = shake128 18 b3 (2 * n) in
r0, r1, r2, r3
val frodo_gen_matrix_shake_4x1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> res:matrix n n
-> matrix n n
let frodo_gen_matrix_shake_4x1 n seed i res =
let r0, r1, r2, r3 = frodo_gen_matrix_shake_4x1_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res
val frodo_gen_matrix_shake_4x:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_shake_4x n seed =
let res = Matrix.create n n in
let n4 = n / 4 in
Loops.repeati n4 (frodo_gen_matrix_shake_4x1 n seed) res
val frodo_gen_matrix_aes:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_aes n seed =
let res = Matrix.create n n in
let key = aes128_key_expansion seed in
let tmp = LSeq.create 8 (u16 0) in
let n1 = n / 8 in
Loops.repeati n
(fun i res ->
Loops.repeati n1
(fun j res ->
let j = j * 8 in
let tmp = tmp.[0] <- u16 i in
let tmp = tmp.[1] <- u16 j in
let res_i = aes_encrypt_block AES128 key (uints_to_bytes_le tmp) in
Loops.repeati 8
(fun k res ->
res.(i, j + k) <- uint_from_bytes_le (LSeq.sub res_i (k * 2) 2)
) res
) res
) res
(** Lemma (frodo_gen_matrix_shake == frodo_gen_matrix_shake_4x) *)
val frodo_gen_matrix_shake_fc:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> j:size_nat{j < n}
-> GTot uint16
let frodo_gen_matrix_shake_fc n seed i j =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
uint_from_bytes_le (LSeq.sub res_i (j * 2) 2)
val frodo_gen_matrix_shake1_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> Pure (matrix n n)
(requires True)
(ensures fun res1 ->
let res_i = frodo_gen_matrix_shake_get_r n seed i in
res1 == Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res)
let frodo_gen_matrix_shake1_ind n seed i res =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
//Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res
Loops.repeati_inductive' #(matrix n n) n
(fun j res0 ->
(forall (i0:size_nat{i0 < i}) (j:size_nat{j < n}). res0.(i0, j) == res.(i0, j)) /\
(forall (j0:size_nat{j0 < j}). res0.(i, j0) == frodo_gen_matrix_shake_fc n seed i j0))
(frodo_gen_matrix_shake0 n i res_i) res
val frodo_gen_matrix_shake_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> Pure (matrix n n)
(requires True)
(ensures fun res ->
res == Loops.repeati n (frodo_gen_matrix_shake1_ind n seed) (Matrix.create n n) /\
(forall (i:size_nat{i < n}) (j:size_nat{j < n}).
res.(i, j) == frodo_gen_matrix_shake_fc n seed i j))
let frodo_gen_matrix_shake_ind n seed =
let res = Matrix.create n n in
//Loops.repeati n (frodo_gen_matrix_shake1 n seed) res
Loops.repeati_inductive' #(matrix n n) n
(fun i res ->
forall (i0:size_nat{i0 < i}) (j:size_nat{j < n}).
res.(i0, j) == frodo_gen_matrix_shake_fc n seed i0 j)
(frodo_gen_matrix_shake1_ind n seed) res
val frodo_gen_matrix_shake_4x1_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> res:matrix n n
-> Pure (matrix n n)
(requires True)
(ensures fun res1 ->
let r0, r1, r2, r3 = frodo_gen_matrix_shake_4x1_get_r n seed i in
res1 == Loops.repeati n (frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res)
let frodo_gen_matrix_shake_4x1_ind n seed i res =
let r0, r1, r2, r3 = frodo_gen_matrix_shake_4x1_get_r n seed i in
//Loops.repeati n (frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res
Loops.repeati_inductive' #(matrix n n) n
(fun j res0 ->
(forall (i0:size_nat{i0 < i}) (j:size_nat{j < n}) (k:size_nat{k < 4}).
res0.(4 * i0 + k, j) == res.(4 * i0 + k, j)) /\
(forall (j0:size_nat{j0 < j}) (k:size_nat{k < 4}).
res0.(4 * i + k, j0) == frodo_gen_matrix_shake_fc n seed (4 * i + k) j0))
(frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res
val lemma_gen_matrix_4x:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16
-> res:matrix n n
-> Lemma
(requires (forall (i0:size_nat{i0 < n / 4}) (j:size_nat{j < n}) (k:size_nat{k < 4}).
res.(4 * i0 + k, j) == frodo_gen_matrix_shake_fc n seed (4 * i0 + k) j))
(ensures (forall (i:size_nat{i < n}) (j:size_nat{j < n}).
res.(i, j) == frodo_gen_matrix_shake_fc n seed i j))
let lemma_gen_matrix_4x n seed res =
assert (forall (i0:size_nat{i0 < n / 4}) (j:size_nat{j < n}) (k:size_nat{k < 4}).
frodo_gen_matrix_shake_fc n seed (4 * i0 + k) j == frodo_gen_matrix_shake_fc n seed (i0 * 4 + k) j);
assert (forall (i:size_nat{i < n}) (j:size_nat{j < n}). i == i / 4 * 4 + i % 4 /\ i / 4 < n / 4 /\ i % 4 < 4);
assert (forall (i:size_nat{i < n}) (j:size_nat{j < n}). res.(i, j) == frodo_gen_matrix_shake_fc n seed (i / 4 * 4 + i % 4) j)
val frodo_gen_matrix_shake_4x_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16
-> Pure (matrix n n)
(requires True)
(ensures fun res ->
res == Loops.repeati (n / 4) (frodo_gen_matrix_shake_4x1_ind n seed) (Matrix.create n n) /\
res == frodo_gen_matrix_shake_ind n seed)
let frodo_gen_matrix_shake_4x_ind n seed =
let res = Matrix.create n n in
let n4 = n / 4 in
//Loops.repeati n4 (frodo_gen_matrix_shake_4x1 n seed) res
let res =
Loops.repeati_inductive' n4
(fun i res ->
forall (i0:size_nat{i0 < i}) (j:size_nat{j < n}) (k:size_nat{k < 4}).
res.(4 * i0 + k, j) == frodo_gen_matrix_shake_fc n seed (4 * i0 + k) j)
(frodo_gen_matrix_shake_4x1_ind n seed) res in
//assert (forall (i0:size_nat{i0 < n / 4}) (j:size_nat{j < n}) (k:size_nat{k < 4}).
//res.(4 * i0 + k, j) == frodo_gen_matrix_shake_fc n seed (4 * i0 + k) j);
lemma_gen_matrix_4x n seed res;
Spec.Matrix.extensionality res (frodo_gen_matrix_shake_ind n seed);
res
val frodo_gen_matrix_shake_4x_lemma:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16 -> Lemma
(frodo_gen_matrix_shake_4x n seed == frodo_gen_matrix_shake n seed) | false | false | Spec.Frodo.Gen.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val frodo_gen_matrix_shake_4x_lemma:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16 -> Lemma
(frodo_gen_matrix_shake_4x n seed == frodo_gen_matrix_shake n seed) | [] | Spec.Frodo.Gen.frodo_gen_matrix_shake_4x_lemma | {
"file_name": "specs/frodo/Spec.Frodo.Gen.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
n:
Lib.IntTypes.size_nat
{n * n <= Lib.IntTypes.max_size_t /\ n <= Lib.IntTypes.maxint Lib.IntTypes.U16 /\ n % 4 = 0} ->
seed: Lib.ByteSequence.lbytes 16
-> FStar.Pervasives.Lemma
(ensures
Spec.Frodo.Gen.frodo_gen_matrix_shake_4x n seed ==
Spec.Frodo.Gen.frodo_gen_matrix_shake n seed) | {
"end_col": 20,
"end_line": 312,
"start_col": 44,
"start_line": 286
} |
Prims.Pure | val frodo_gen_matrix_shake_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> Pure (matrix n n)
(requires True)
(ensures fun res ->
res == Loops.repeati n (frodo_gen_matrix_shake1_ind n seed) (Matrix.create n n) /\
(forall (i:size_nat{i < n}) (j:size_nat{j < n}).
res.(i, j) == frodo_gen_matrix_shake_fc n seed i j)) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "Spec.Matrix",
"short_module": "Matrix"
},
{
"abbrev": false,
"full_module": "Spec.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.SHA3",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Matrix",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let frodo_gen_matrix_shake_ind n seed =
let res = Matrix.create n n in
//Loops.repeati n (frodo_gen_matrix_shake1 n seed) res
Loops.repeati_inductive' #(matrix n n) n
(fun i res ->
forall (i0:size_nat{i0 < i}) (j:size_nat{j < n}).
res.(i0, j) == frodo_gen_matrix_shake_fc n seed i0 j)
(frodo_gen_matrix_shake1_ind n seed) res | val frodo_gen_matrix_shake_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> Pure (matrix n n)
(requires True)
(ensures fun res ->
res == Loops.repeati n (frodo_gen_matrix_shake1_ind n seed) (Matrix.create n n) /\
(forall (i:size_nat{i < n}) (j:size_nat{j < n}).
res.(i, j) == frodo_gen_matrix_shake_fc n seed i j))
let frodo_gen_matrix_shake_ind n seed = | false | null | false | let res = Matrix.create n n in
Loops.repeati_inductive' #(matrix n n)
n
(fun i res ->
forall (i0: size_nat{i0 < i}) (j: size_nat{j < n}).
res.(i0, j) == frodo_gen_matrix_shake_fc n seed i0 j)
(frodo_gen_matrix_shake1_ind n seed)
res | {
"checked_file": "Spec.Frodo.Gen.fst.checked",
"dependencies": [
"Spec.SHA3.fst.checked",
"Spec.Matrix.fst.checked",
"Spec.AES.fst.checked",
"prims.fst.checked",
"Lib.Sequence.Lemmas.fsti.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.Frodo.Gen.fst"
} | [] | [
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.max_size_t",
"Lib.IntTypes.maxint",
"Lib.IntTypes.U16",
"Lib.ByteSequence.lbytes",
"Lib.LoopCombinators.repeati_inductive'",
"Spec.Matrix.matrix",
"Prims.nat",
"Prims.l_Forall",
"Prims.op_LessThan",
"Prims.eq2",
"Lib.IntTypes.uint16",
"Spec.Matrix.op_Array_Access",
"FStar.Pervasives.Native.Mktuple2",
"Spec.Frodo.Gen.frodo_gen_matrix_shake_fc",
"Spec.Frodo.Gen.frodo_gen_matrix_shake1_ind",
"Lib.Sequence.lseq",
"Lib.IntTypes.int_t",
"Lib.IntTypes.SEC",
"Prims.op_Multiply",
"Spec.Matrix.create"
] | [] | module Spec.Frodo.Gen
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Matrix
open Spec.SHA3
open Spec.AES
module Matrix = Spec.Matrix
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val frodo_gen_matrix_shake_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> lbytes (2 * n)
let frodo_gen_matrix_shake_get_r n seed i =
let tmp = uint_to_bytes_le (u16 i) in
let b = concat tmp seed in
shake128 18 b (2 * n)
val frodo_gen_matrix_shake0:
n:size_nat{n * n <= max_size_t}
-> i:size_nat{i < n}
-> res_i:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake0 n i res_i j res0 =
res0.(i, j) <- uint_from_bytes_le (LSeq.sub res_i (j * 2) 2)
val frodo_gen_matrix_shake1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> matrix n n
let frodo_gen_matrix_shake1 n seed i res =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res
val frodo_gen_matrix_shake:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_shake n seed =
let res = Matrix.create n n in
Loops.repeati n (frodo_gen_matrix_shake1 n seed) res
val frodo_gen_matrix_shake_4x0:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> i:size_nat{i < n / 4}
-> r0:lbytes (2 * n)
-> r1:lbytes (2 * n)
-> r2:lbytes (2 * n)
-> r3:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3 j res0 =
let res0 = res0.(4 * i + 0, j) <- uint_from_bytes_le (LSeq.sub r0 (j * 2) 2) in
let res0 = res0.(4 * i + 1, j) <- uint_from_bytes_le (LSeq.sub r1 (j * 2) 2) in
let res0 = res0.(4 * i + 2, j) <- uint_from_bytes_le (LSeq.sub r2 (j * 2) 2) in
let res0 = res0.(4 * i + 3, j) <- uint_from_bytes_le (LSeq.sub r3 (j * 2) 2) in
res0
val frodo_gen_matrix_shake_4x1_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n)
let frodo_gen_matrix_shake_4x1_get_r n seed i =
let t0 = uint_to_bytes_le (u16 (4 * i + 0)) in
let t1 = uint_to_bytes_le (u16 (4 * i + 1)) in
let t2 = uint_to_bytes_le (u16 (4 * i + 2)) in
let t3 = uint_to_bytes_le (u16 (4 * i + 3)) in
let b0 = concat t0 seed in
let b1 = concat t1 seed in
let b2 = concat t2 seed in
let b3 = concat t3 seed in
let r0 = shake128 18 b0 (2 * n) in
let r1 = shake128 18 b1 (2 * n) in
let r2 = shake128 18 b2 (2 * n) in
let r3 = shake128 18 b3 (2 * n) in
r0, r1, r2, r3
val frodo_gen_matrix_shake_4x1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> res:matrix n n
-> matrix n n
let frodo_gen_matrix_shake_4x1 n seed i res =
let r0, r1, r2, r3 = frodo_gen_matrix_shake_4x1_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res
val frodo_gen_matrix_shake_4x:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_shake_4x n seed =
let res = Matrix.create n n in
let n4 = n / 4 in
Loops.repeati n4 (frodo_gen_matrix_shake_4x1 n seed) res
val frodo_gen_matrix_aes:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_aes n seed =
let res = Matrix.create n n in
let key = aes128_key_expansion seed in
let tmp = LSeq.create 8 (u16 0) in
let n1 = n / 8 in
Loops.repeati n
(fun i res ->
Loops.repeati n1
(fun j res ->
let j = j * 8 in
let tmp = tmp.[0] <- u16 i in
let tmp = tmp.[1] <- u16 j in
let res_i = aes_encrypt_block AES128 key (uints_to_bytes_le tmp) in
Loops.repeati 8
(fun k res ->
res.(i, j + k) <- uint_from_bytes_le (LSeq.sub res_i (k * 2) 2)
) res
) res
) res
(** Lemma (frodo_gen_matrix_shake == frodo_gen_matrix_shake_4x) *)
val frodo_gen_matrix_shake_fc:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> j:size_nat{j < n}
-> GTot uint16
let frodo_gen_matrix_shake_fc n seed i j =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
uint_from_bytes_le (LSeq.sub res_i (j * 2) 2)
val frodo_gen_matrix_shake1_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> Pure (matrix n n)
(requires True)
(ensures fun res1 ->
let res_i = frodo_gen_matrix_shake_get_r n seed i in
res1 == Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res)
let frodo_gen_matrix_shake1_ind n seed i res =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
//Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res
Loops.repeati_inductive' #(matrix n n) n
(fun j res0 ->
(forall (i0:size_nat{i0 < i}) (j:size_nat{j < n}). res0.(i0, j) == res.(i0, j)) /\
(forall (j0:size_nat{j0 < j}). res0.(i, j0) == frodo_gen_matrix_shake_fc n seed i j0))
(frodo_gen_matrix_shake0 n i res_i) res
val frodo_gen_matrix_shake_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> Pure (matrix n n)
(requires True)
(ensures fun res ->
res == Loops.repeati n (frodo_gen_matrix_shake1_ind n seed) (Matrix.create n n) /\
(forall (i:size_nat{i < n}) (j:size_nat{j < n}).
res.(i, j) == frodo_gen_matrix_shake_fc n seed i j)) | false | false | Spec.Frodo.Gen.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val frodo_gen_matrix_shake_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> Pure (matrix n n)
(requires True)
(ensures fun res ->
res == Loops.repeati n (frodo_gen_matrix_shake1_ind n seed) (Matrix.create n n) /\
(forall (i:size_nat{i < n}) (j:size_nat{j < n}).
res.(i, j) == frodo_gen_matrix_shake_fc n seed i j)) | [] | Spec.Frodo.Gen.frodo_gen_matrix_shake_ind | {
"file_name": "specs/frodo/Spec.Frodo.Gen.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
n:
Lib.IntTypes.size_nat
{n * n <= Lib.IntTypes.max_size_t /\ n <= Lib.IntTypes.maxint Lib.IntTypes.U16} ->
seed: Lib.ByteSequence.lbytes 16
-> Prims.Pure (Spec.Matrix.matrix n n) | {
"end_col": 42,
"end_line": 211,
"start_col": 39,
"start_line": 203
} |
Prims.Pure | val frodo_gen_matrix_shake_4x1_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> res:matrix n n
-> Pure (matrix n n)
(requires True)
(ensures fun res1 ->
let r0, r1, r2, r3 = frodo_gen_matrix_shake_4x1_get_r n seed i in
res1 == Loops.repeati n (frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "Spec.Matrix",
"short_module": "Matrix"
},
{
"abbrev": false,
"full_module": "Spec.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.SHA3",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Matrix",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let frodo_gen_matrix_shake_4x1_ind n seed i res =
let r0, r1, r2, r3 = frodo_gen_matrix_shake_4x1_get_r n seed i in
//Loops.repeati n (frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res
Loops.repeati_inductive' #(matrix n n) n
(fun j res0 ->
(forall (i0:size_nat{i0 < i}) (j:size_nat{j < n}) (k:size_nat{k < 4}).
res0.(4 * i0 + k, j) == res.(4 * i0 + k, j)) /\
(forall (j0:size_nat{j0 < j}) (k:size_nat{k < 4}).
res0.(4 * i + k, j0) == frodo_gen_matrix_shake_fc n seed (4 * i + k) j0))
(frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res | val frodo_gen_matrix_shake_4x1_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> res:matrix n n
-> Pure (matrix n n)
(requires True)
(ensures fun res1 ->
let r0, r1, r2, r3 = frodo_gen_matrix_shake_4x1_get_r n seed i in
res1 == Loops.repeati n (frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res)
let frodo_gen_matrix_shake_4x1_ind n seed i res = | false | null | false | let r0, r1, r2, r3 = frodo_gen_matrix_shake_4x1_get_r n seed i in
Loops.repeati_inductive' #(matrix n n)
n
(fun j res0 ->
(forall (i0: size_nat{i0 < i}) (j: size_nat{j < n}) (k: size_nat{k < 4}).
res0.(4 * i0 + k, j) == res.(4 * i0 + k, j)) /\
(forall (j0: size_nat{j0 < j}) (k: size_nat{k < 4}).
res0.(4 * i + k, j0) == frodo_gen_matrix_shake_fc n seed (4 * i + k) j0))
(frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3)
res | {
"checked_file": "Spec.Frodo.Gen.fst.checked",
"dependencies": [
"Spec.SHA3.fst.checked",
"Spec.Matrix.fst.checked",
"Spec.AES.fst.checked",
"prims.fst.checked",
"Lib.Sequence.Lemmas.fsti.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.Frodo.Gen.fst"
} | [] | [
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.max_size_t",
"Lib.IntTypes.maxint",
"Lib.IntTypes.U16",
"Lib.ByteSequence.lbytes",
"Prims.op_LessThan",
"Prims.op_Division",
"Spec.Matrix.matrix",
"Lib.LoopCombinators.repeati_inductive'",
"Prims.nat",
"Prims.l_Forall",
"Prims.eq2",
"Spec.Matrix.elem",
"Spec.Matrix.op_Array_Access",
"FStar.Pervasives.Native.Mktuple2",
"Prims.op_Addition",
"Lib.IntTypes.uint16",
"Spec.Frodo.Gen.frodo_gen_matrix_shake_fc",
"Spec.Frodo.Gen.frodo_gen_matrix_shake_4x0",
"FStar.Pervasives.Native.tuple4",
"Lib.Sequence.lseq",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Prims.op_Multiply",
"Spec.Frodo.Gen.frodo_gen_matrix_shake_4x1_get_r"
] | [] | module Spec.Frodo.Gen
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Matrix
open Spec.SHA3
open Spec.AES
module Matrix = Spec.Matrix
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val frodo_gen_matrix_shake_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> lbytes (2 * n)
let frodo_gen_matrix_shake_get_r n seed i =
let tmp = uint_to_bytes_le (u16 i) in
let b = concat tmp seed in
shake128 18 b (2 * n)
val frodo_gen_matrix_shake0:
n:size_nat{n * n <= max_size_t}
-> i:size_nat{i < n}
-> res_i:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake0 n i res_i j res0 =
res0.(i, j) <- uint_from_bytes_le (LSeq.sub res_i (j * 2) 2)
val frodo_gen_matrix_shake1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> matrix n n
let frodo_gen_matrix_shake1 n seed i res =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res
val frodo_gen_matrix_shake:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_shake n seed =
let res = Matrix.create n n in
Loops.repeati n (frodo_gen_matrix_shake1 n seed) res
val frodo_gen_matrix_shake_4x0:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> i:size_nat{i < n / 4}
-> r0:lbytes (2 * n)
-> r1:lbytes (2 * n)
-> r2:lbytes (2 * n)
-> r3:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3 j res0 =
let res0 = res0.(4 * i + 0, j) <- uint_from_bytes_le (LSeq.sub r0 (j * 2) 2) in
let res0 = res0.(4 * i + 1, j) <- uint_from_bytes_le (LSeq.sub r1 (j * 2) 2) in
let res0 = res0.(4 * i + 2, j) <- uint_from_bytes_le (LSeq.sub r2 (j * 2) 2) in
let res0 = res0.(4 * i + 3, j) <- uint_from_bytes_le (LSeq.sub r3 (j * 2) 2) in
res0
val frodo_gen_matrix_shake_4x1_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n)
let frodo_gen_matrix_shake_4x1_get_r n seed i =
let t0 = uint_to_bytes_le (u16 (4 * i + 0)) in
let t1 = uint_to_bytes_le (u16 (4 * i + 1)) in
let t2 = uint_to_bytes_le (u16 (4 * i + 2)) in
let t3 = uint_to_bytes_le (u16 (4 * i + 3)) in
let b0 = concat t0 seed in
let b1 = concat t1 seed in
let b2 = concat t2 seed in
let b3 = concat t3 seed in
let r0 = shake128 18 b0 (2 * n) in
let r1 = shake128 18 b1 (2 * n) in
let r2 = shake128 18 b2 (2 * n) in
let r3 = shake128 18 b3 (2 * n) in
r0, r1, r2, r3
val frodo_gen_matrix_shake_4x1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> res:matrix n n
-> matrix n n
let frodo_gen_matrix_shake_4x1 n seed i res =
let r0, r1, r2, r3 = frodo_gen_matrix_shake_4x1_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res
val frodo_gen_matrix_shake_4x:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_shake_4x n seed =
let res = Matrix.create n n in
let n4 = n / 4 in
Loops.repeati n4 (frodo_gen_matrix_shake_4x1 n seed) res
val frodo_gen_matrix_aes:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_aes n seed =
let res = Matrix.create n n in
let key = aes128_key_expansion seed in
let tmp = LSeq.create 8 (u16 0) in
let n1 = n / 8 in
Loops.repeati n
(fun i res ->
Loops.repeati n1
(fun j res ->
let j = j * 8 in
let tmp = tmp.[0] <- u16 i in
let tmp = tmp.[1] <- u16 j in
let res_i = aes_encrypt_block AES128 key (uints_to_bytes_le tmp) in
Loops.repeati 8
(fun k res ->
res.(i, j + k) <- uint_from_bytes_le (LSeq.sub res_i (k * 2) 2)
) res
) res
) res
(** Lemma (frodo_gen_matrix_shake == frodo_gen_matrix_shake_4x) *)
val frodo_gen_matrix_shake_fc:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> j:size_nat{j < n}
-> GTot uint16
let frodo_gen_matrix_shake_fc n seed i j =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
uint_from_bytes_le (LSeq.sub res_i (j * 2) 2)
val frodo_gen_matrix_shake1_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> Pure (matrix n n)
(requires True)
(ensures fun res1 ->
let res_i = frodo_gen_matrix_shake_get_r n seed i in
res1 == Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res)
let frodo_gen_matrix_shake1_ind n seed i res =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
//Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res
Loops.repeati_inductive' #(matrix n n) n
(fun j res0 ->
(forall (i0:size_nat{i0 < i}) (j:size_nat{j < n}). res0.(i0, j) == res.(i0, j)) /\
(forall (j0:size_nat{j0 < j}). res0.(i, j0) == frodo_gen_matrix_shake_fc n seed i j0))
(frodo_gen_matrix_shake0 n i res_i) res
val frodo_gen_matrix_shake_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> Pure (matrix n n)
(requires True)
(ensures fun res ->
res == Loops.repeati n (frodo_gen_matrix_shake1_ind n seed) (Matrix.create n n) /\
(forall (i:size_nat{i < n}) (j:size_nat{j < n}).
res.(i, j) == frodo_gen_matrix_shake_fc n seed i j))
let frodo_gen_matrix_shake_ind n seed =
let res = Matrix.create n n in
//Loops.repeati n (frodo_gen_matrix_shake1 n seed) res
Loops.repeati_inductive' #(matrix n n) n
(fun i res ->
forall (i0:size_nat{i0 < i}) (j:size_nat{j < n}).
res.(i0, j) == frodo_gen_matrix_shake_fc n seed i0 j)
(frodo_gen_matrix_shake1_ind n seed) res
val frodo_gen_matrix_shake_4x1_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> res:matrix n n
-> Pure (matrix n n)
(requires True)
(ensures fun res1 ->
let r0, r1, r2, r3 = frodo_gen_matrix_shake_4x1_get_r n seed i in
res1 == Loops.repeati n (frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res) | false | false | Spec.Frodo.Gen.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val frodo_gen_matrix_shake_4x1_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> res:matrix n n
-> Pure (matrix n n)
(requires True)
(ensures fun res1 ->
let r0, r1, r2, r3 = frodo_gen_matrix_shake_4x1_get_r n seed i in
res1 == Loops.repeati n (frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res) | [] | Spec.Frodo.Gen.frodo_gen_matrix_shake_4x1_ind | {
"file_name": "specs/frodo/Spec.Frodo.Gen.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
n:
Lib.IntTypes.size_nat
{n * n <= Lib.IntTypes.max_size_t /\ n <= Lib.IntTypes.maxint Lib.IntTypes.U16} ->
seed: Lib.ByteSequence.lbytes 16 ->
i: Lib.IntTypes.size_nat{i < n / 4} ->
res: Spec.Matrix.matrix n n
-> Prims.Pure (Spec.Matrix.matrix n n) | {
"end_col": 50,
"end_line": 234,
"start_col": 49,
"start_line": 225
} |
Prims.Pure | val frodo_gen_matrix_shake_4x_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16
-> Pure (matrix n n)
(requires True)
(ensures fun res ->
res == Loops.repeati (n / 4) (frodo_gen_matrix_shake_4x1_ind n seed) (Matrix.create n n) /\
res == frodo_gen_matrix_shake_ind n seed) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "Spec.Matrix",
"short_module": "Matrix"
},
{
"abbrev": false,
"full_module": "Spec.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.SHA3",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Matrix",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Frodo",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let frodo_gen_matrix_shake_4x_ind n seed =
let res = Matrix.create n n in
let n4 = n / 4 in
//Loops.repeati n4 (frodo_gen_matrix_shake_4x1 n seed) res
let res =
Loops.repeati_inductive' n4
(fun i res ->
forall (i0:size_nat{i0 < i}) (j:size_nat{j < n}) (k:size_nat{k < 4}).
res.(4 * i0 + k, j) == frodo_gen_matrix_shake_fc n seed (4 * i0 + k) j)
(frodo_gen_matrix_shake_4x1_ind n seed) res in
//assert (forall (i0:size_nat{i0 < n / 4}) (j:size_nat{j < n}) (k:size_nat{k < 4}).
//res.(4 * i0 + k, j) == frodo_gen_matrix_shake_fc n seed (4 * i0 + k) j);
lemma_gen_matrix_4x n seed res;
Spec.Matrix.extensionality res (frodo_gen_matrix_shake_ind n seed);
res | val frodo_gen_matrix_shake_4x_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16
-> Pure (matrix n n)
(requires True)
(ensures fun res ->
res == Loops.repeati (n / 4) (frodo_gen_matrix_shake_4x1_ind n seed) (Matrix.create n n) /\
res == frodo_gen_matrix_shake_ind n seed)
let frodo_gen_matrix_shake_4x_ind n seed = | false | null | false | let res = Matrix.create n n in
let n4 = n / 4 in
let res =
Loops.repeati_inductive' n4
(fun i res ->
forall (i0: size_nat{i0 < i}) (j: size_nat{j < n}) (k: size_nat{k < 4}).
res.(4 * i0 + k, j) == frodo_gen_matrix_shake_fc n seed (4 * i0 + k) j)
(frodo_gen_matrix_shake_4x1_ind n seed)
res
in
lemma_gen_matrix_4x n seed res;
Spec.Matrix.extensionality res (frodo_gen_matrix_shake_ind n seed);
res | {
"checked_file": "Spec.Frodo.Gen.fst.checked",
"dependencies": [
"Spec.SHA3.fst.checked",
"Spec.Matrix.fst.checked",
"Spec.AES.fst.checked",
"prims.fst.checked",
"Lib.Sequence.Lemmas.fsti.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.Frodo.Gen.fst"
} | [] | [
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.max_size_t",
"Lib.IntTypes.maxint",
"Lib.IntTypes.U16",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Lib.ByteSequence.lbytes",
"Prims.unit",
"Spec.Matrix.extensionality",
"Spec.Frodo.Gen.frodo_gen_matrix_shake_ind",
"Spec.Frodo.Gen.lemma_gen_matrix_4x",
"Lib.Sequence.lseq",
"Lib.IntTypes.int_t",
"Lib.IntTypes.SEC",
"Prims.op_Multiply",
"Lib.LoopCombinators.repeati_inductive'",
"Spec.Matrix.matrix",
"Prims.nat",
"Prims.l_Forall",
"Prims.op_LessThan",
"Prims.eq2",
"Lib.IntTypes.uint16",
"Spec.Matrix.op_Array_Access",
"FStar.Pervasives.Native.Mktuple2",
"Prims.op_Addition",
"Spec.Frodo.Gen.frodo_gen_matrix_shake_fc",
"Spec.Frodo.Gen.frodo_gen_matrix_shake_4x1_ind",
"Prims.op_Division",
"Spec.Matrix.create"
] | [] | module Spec.Frodo.Gen
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Matrix
open Spec.SHA3
open Spec.AES
module Matrix = Spec.Matrix
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val frodo_gen_matrix_shake_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> lbytes (2 * n)
let frodo_gen_matrix_shake_get_r n seed i =
let tmp = uint_to_bytes_le (u16 i) in
let b = concat tmp seed in
shake128 18 b (2 * n)
val frodo_gen_matrix_shake0:
n:size_nat{n * n <= max_size_t}
-> i:size_nat{i < n}
-> res_i:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake0 n i res_i j res0 =
res0.(i, j) <- uint_from_bytes_le (LSeq.sub res_i (j * 2) 2)
val frodo_gen_matrix_shake1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> matrix n n
let frodo_gen_matrix_shake1 n seed i res =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res
val frodo_gen_matrix_shake:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_shake n seed =
let res = Matrix.create n n in
Loops.repeati n (frodo_gen_matrix_shake1 n seed) res
val frodo_gen_matrix_shake_4x0:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> i:size_nat{i < n / 4}
-> r0:lbytes (2 * n)
-> r1:lbytes (2 * n)
-> r2:lbytes (2 * n)
-> r3:lbytes (2 * n)
-> j:size_nat{j < n}
-> res0:matrix n n
-> matrix n n
let frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3 j res0 =
let res0 = res0.(4 * i + 0, j) <- uint_from_bytes_le (LSeq.sub r0 (j * 2) 2) in
let res0 = res0.(4 * i + 1, j) <- uint_from_bytes_le (LSeq.sub r1 (j * 2) 2) in
let res0 = res0.(4 * i + 2, j) <- uint_from_bytes_le (LSeq.sub r2 (j * 2) 2) in
let res0 = res0.(4 * i + 3, j) <- uint_from_bytes_le (LSeq.sub r3 (j * 2) 2) in
res0
val frodo_gen_matrix_shake_4x1_get_r:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n) & lbytes (2 * n)
let frodo_gen_matrix_shake_4x1_get_r n seed i =
let t0 = uint_to_bytes_le (u16 (4 * i + 0)) in
let t1 = uint_to_bytes_le (u16 (4 * i + 1)) in
let t2 = uint_to_bytes_le (u16 (4 * i + 2)) in
let t3 = uint_to_bytes_le (u16 (4 * i + 3)) in
let b0 = concat t0 seed in
let b1 = concat t1 seed in
let b2 = concat t2 seed in
let b3 = concat t3 seed in
let r0 = shake128 18 b0 (2 * n) in
let r1 = shake128 18 b1 (2 * n) in
let r2 = shake128 18 b2 (2 * n) in
let r3 = shake128 18 b3 (2 * n) in
r0, r1, r2, r3
val frodo_gen_matrix_shake_4x1:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> res:matrix n n
-> matrix n n
let frodo_gen_matrix_shake_4x1 n seed i res =
let r0, r1, r2, r3 = frodo_gen_matrix_shake_4x1_get_r n seed i in
Loops.repeati n (frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res
val frodo_gen_matrix_shake_4x:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_shake_4x n seed =
let res = Matrix.create n n in
let n4 = n / 4 in
Loops.repeati n4 (frodo_gen_matrix_shake_4x1 n seed) res
val frodo_gen_matrix_aes:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> matrix n n
let frodo_gen_matrix_aes n seed =
let res = Matrix.create n n in
let key = aes128_key_expansion seed in
let tmp = LSeq.create 8 (u16 0) in
let n1 = n / 8 in
Loops.repeati n
(fun i res ->
Loops.repeati n1
(fun j res ->
let j = j * 8 in
let tmp = tmp.[0] <- u16 i in
let tmp = tmp.[1] <- u16 j in
let res_i = aes_encrypt_block AES128 key (uints_to_bytes_le tmp) in
Loops.repeati 8
(fun k res ->
res.(i, j + k) <- uint_from_bytes_le (LSeq.sub res_i (k * 2) 2)
) res
) res
) res
(** Lemma (frodo_gen_matrix_shake == frodo_gen_matrix_shake_4x) *)
val frodo_gen_matrix_shake_fc:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> j:size_nat{j < n}
-> GTot uint16
let frodo_gen_matrix_shake_fc n seed i j =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
uint_from_bytes_le (LSeq.sub res_i (j * 2) 2)
val frodo_gen_matrix_shake1_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n}
-> res:matrix n n
-> Pure (matrix n n)
(requires True)
(ensures fun res1 ->
let res_i = frodo_gen_matrix_shake_get_r n seed i in
res1 == Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res)
let frodo_gen_matrix_shake1_ind n seed i res =
let res_i = frodo_gen_matrix_shake_get_r n seed i in
//Loops.repeati n (frodo_gen_matrix_shake0 n i res_i) res
Loops.repeati_inductive' #(matrix n n) n
(fun j res0 ->
(forall (i0:size_nat{i0 < i}) (j:size_nat{j < n}). res0.(i0, j) == res.(i0, j)) /\
(forall (j0:size_nat{j0 < j}). res0.(i, j0) == frodo_gen_matrix_shake_fc n seed i j0))
(frodo_gen_matrix_shake0 n i res_i) res
val frodo_gen_matrix_shake_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> Pure (matrix n n)
(requires True)
(ensures fun res ->
res == Loops.repeati n (frodo_gen_matrix_shake1_ind n seed) (Matrix.create n n) /\
(forall (i:size_nat{i < n}) (j:size_nat{j < n}).
res.(i, j) == frodo_gen_matrix_shake_fc n seed i j))
let frodo_gen_matrix_shake_ind n seed =
let res = Matrix.create n n in
//Loops.repeati n (frodo_gen_matrix_shake1 n seed) res
Loops.repeati_inductive' #(matrix n n) n
(fun i res ->
forall (i0:size_nat{i0 < i}) (j:size_nat{j < n}).
res.(i0, j) == frodo_gen_matrix_shake_fc n seed i0 j)
(frodo_gen_matrix_shake1_ind n seed) res
val frodo_gen_matrix_shake_4x1_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16}
-> seed:lbytes 16
-> i:size_nat{i < n / 4}
-> res:matrix n n
-> Pure (matrix n n)
(requires True)
(ensures fun res1 ->
let r0, r1, r2, r3 = frodo_gen_matrix_shake_4x1_get_r n seed i in
res1 == Loops.repeati n (frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res)
let frodo_gen_matrix_shake_4x1_ind n seed i res =
let r0, r1, r2, r3 = frodo_gen_matrix_shake_4x1_get_r n seed i in
//Loops.repeati n (frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res
Loops.repeati_inductive' #(matrix n n) n
(fun j res0 ->
(forall (i0:size_nat{i0 < i}) (j:size_nat{j < n}) (k:size_nat{k < 4}).
res0.(4 * i0 + k, j) == res.(4 * i0 + k, j)) /\
(forall (j0:size_nat{j0 < j}) (k:size_nat{k < 4}).
res0.(4 * i + k, j0) == frodo_gen_matrix_shake_fc n seed (4 * i + k) j0))
(frodo_gen_matrix_shake_4x0 n i r0 r1 r2 r3) res
val lemma_gen_matrix_4x:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16
-> res:matrix n n
-> Lemma
(requires (forall (i0:size_nat{i0 < n / 4}) (j:size_nat{j < n}) (k:size_nat{k < 4}).
res.(4 * i0 + k, j) == frodo_gen_matrix_shake_fc n seed (4 * i0 + k) j))
(ensures (forall (i:size_nat{i < n}) (j:size_nat{j < n}).
res.(i, j) == frodo_gen_matrix_shake_fc n seed i j))
let lemma_gen_matrix_4x n seed res =
assert (forall (i0:size_nat{i0 < n / 4}) (j:size_nat{j < n}) (k:size_nat{k < 4}).
frodo_gen_matrix_shake_fc n seed (4 * i0 + k) j == frodo_gen_matrix_shake_fc n seed (i0 * 4 + k) j);
assert (forall (i:size_nat{i < n}) (j:size_nat{j < n}). i == i / 4 * 4 + i % 4 /\ i / 4 < n / 4 /\ i % 4 < 4);
assert (forall (i:size_nat{i < n}) (j:size_nat{j < n}). res.(i, j) == frodo_gen_matrix_shake_fc n seed (i / 4 * 4 + i % 4) j)
val frodo_gen_matrix_shake_4x_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16
-> Pure (matrix n n)
(requires True)
(ensures fun res ->
res == Loops.repeati (n / 4) (frodo_gen_matrix_shake_4x1_ind n seed) (Matrix.create n n) /\
res == frodo_gen_matrix_shake_ind n seed) | false | false | Spec.Frodo.Gen.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val frodo_gen_matrix_shake_4x_ind:
n:size_nat{n * n <= max_size_t /\ n <= maxint U16 /\ n % 4 = 0}
-> seed:lbytes 16
-> Pure (matrix n n)
(requires True)
(ensures fun res ->
res == Loops.repeati (n / 4) (frodo_gen_matrix_shake_4x1_ind n seed) (Matrix.create n n) /\
res == frodo_gen_matrix_shake_ind n seed) | [] | Spec.Frodo.Gen.frodo_gen_matrix_shake_4x_ind | {
"file_name": "specs/frodo/Spec.Frodo.Gen.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
n:
Lib.IntTypes.size_nat
{n * n <= Lib.IntTypes.max_size_t /\ n <= Lib.IntTypes.maxint Lib.IntTypes.U16 /\ n % 4 = 0} ->
seed: Lib.ByteSequence.lbytes 16
-> Prims.Pure (Spec.Matrix.matrix n n) | {
"end_col": 5,
"end_line": 278,
"start_col": 42,
"start_line": 263
} |
Prims.Tot | [
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let lbytes (len:size_nat) = lbytes_l SEC len | let lbytes (len: size_nat) = | false | null | false | lbytes_l SEC len | {
"checked_file": "Lib.ByteSequence.fsti.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Lib.ByteSequence.fsti"
} | [
"total"
] | [
"Lib.IntTypes.size_nat",
"Lib.ByteSequence.lbytes_l",
"Lib.IntTypes.SEC"
] | [] | module Lib.ByteSequence
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0"
/// Definition of byte-based sequences
unfold inline_for_extraction
type bytes_l (l:secrecy_level) = seq (uint_t U8 l)
unfold inline_for_extraction
type lbytes_l (l:secrecy_level) (len:size_nat) = lseq (uint_t U8 l) len | false | true | Lib.ByteSequence.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 30,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val lbytes : len: Lib.IntTypes.size_nat -> Type0 | [] | Lib.ByteSequence.lbytes | {
"file_name": "lib/Lib.ByteSequence.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | len: Lib.IntTypes.size_nat -> Type0 | {
"end_col": 73,
"end_line": 19,
"start_col": 57,
"start_line": 19
} |
|
Prims.Tot | [
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let bytes = bytes_l SEC | let bytes = | false | null | false | bytes_l SEC | {
"checked_file": "Lib.ByteSequence.fsti.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Lib.ByteSequence.fsti"
} | [
"total"
] | [
"Lib.ByteSequence.bytes_l",
"Lib.IntTypes.SEC"
] | [] | module Lib.ByteSequence
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0"
/// Definition of byte-based sequences
unfold inline_for_extraction
type bytes_l (l:secrecy_level) = seq (uint_t U8 l)
unfold inline_for_extraction
type lbytes_l (l:secrecy_level) (len:size_nat) = lseq (uint_t U8 l) len | false | true | Lib.ByteSequence.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 30,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val bytes : Type0 | [] | Lib.ByteSequence.bytes | {
"file_name": "lib/Lib.ByteSequence.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Type0 | {
"end_col": 52,
"end_line": 18,
"start_col": 41,
"start_line": 18
} |
|
Prims.Tot | [
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let pub_bytes_t = pub_bytes | let pub_bytes_t = | false | null | false | pub_bytes | {
"checked_file": "Lib.ByteSequence.fsti.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Lib.ByteSequence.fsti"
} | [
"total"
] | [
"Lib.ByteSequence.pub_bytes"
] | [] | module Lib.ByteSequence
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0"
/// Definition of byte-based sequences
unfold inline_for_extraction
type bytes_l (l:secrecy_level) = seq (uint_t U8 l)
unfold inline_for_extraction
type lbytes_l (l:secrecy_level) (len:size_nat) = lseq (uint_t U8 l) len
unfold inline_for_extraction let bytes = bytes_l SEC
unfold inline_for_extraction let lbytes (len:size_nat) = lbytes_l SEC len
unfold inline_for_extraction let pub_bytes = bytes_l PUB
unfold inline_for_extraction let pub_lbytes (len:size_nat) = lbytes_l PUB len
(* Alias *) | false | true | Lib.ByteSequence.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 30,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val pub_bytes_t : Type0 | [] | Lib.ByteSequence.pub_bytes_t | {
"file_name": "lib/Lib.ByteSequence.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Type0 | {
"end_col": 56,
"end_line": 25,
"start_col": 47,
"start_line": 25
} |
|
Prims.Tot | [
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let pub_lbytes (len:size_nat) = lbytes_l PUB len | let pub_lbytes (len: size_nat) = | false | null | false | lbytes_l PUB len | {
"checked_file": "Lib.ByteSequence.fsti.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Lib.ByteSequence.fsti"
} | [
"total"
] | [
"Lib.IntTypes.size_nat",
"Lib.ByteSequence.lbytes_l",
"Lib.IntTypes.PUB"
] | [] | module Lib.ByteSequence
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0"
/// Definition of byte-based sequences
unfold inline_for_extraction
type bytes_l (l:secrecy_level) = seq (uint_t U8 l)
unfold inline_for_extraction
type lbytes_l (l:secrecy_level) (len:size_nat) = lseq (uint_t U8 l) len
unfold inline_for_extraction let bytes = bytes_l SEC
unfold inline_for_extraction let lbytes (len:size_nat) = lbytes_l SEC len | false | true | Lib.ByteSequence.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 30,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val pub_lbytes : len: Lib.IntTypes.size_nat -> Type0 | [] | Lib.ByteSequence.pub_lbytes | {
"file_name": "lib/Lib.ByteSequence.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | len: Lib.IntTypes.size_nat -> Type0 | {
"end_col": 77,
"end_line": 21,
"start_col": 61,
"start_line": 21
} |
|
Prims.Tot | val bytes_empty:bytes | [
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let bytes_empty: bytes = Seq.Base.empty | val bytes_empty:bytes
let bytes_empty:bytes = | false | null | false | Seq.Base.empty | {
"checked_file": "Lib.ByteSequence.fsti.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Lib.ByteSequence.fsti"
} | [
"total"
] | [
"FStar.Seq.Base.empty",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC"
] | [] | module Lib.ByteSequence
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0"
/// Definition of byte-based sequences
unfold inline_for_extraction
type bytes_l (l:secrecy_level) = seq (uint_t U8 l)
unfold inline_for_extraction
type lbytes_l (l:secrecy_level) (len:size_nat) = lseq (uint_t U8 l) len
unfold inline_for_extraction let bytes = bytes_l SEC
unfold inline_for_extraction let lbytes (len:size_nat) = lbytes_l SEC len
unfold inline_for_extraction let pub_bytes = bytes_l PUB
unfold inline_for_extraction let pub_lbytes (len:size_nat) = lbytes_l PUB len
(* Alias *)
unfold inline_for_extraction let bytes_t = bytes
unfold inline_for_extraction let pub_bytes_t = pub_bytes
(** Construct the equality mask for a pair of secret integer sequences *)
val seq_eq_mask: #t:inttype{~(S128? t)} -> #len1:size_nat -> #len2:size_nat
-> b1:lseq (int_t t SEC) len1
-> b2:lseq (int_t t SEC) len2
-> len:size_nat{len <= len1 /\ len <= len2}
-> res:int_t t SEC{
(sub b1 0 len == sub b2 0 len ==> v res == v (ones t SEC)) /\
(sub b1 0 len =!= sub b2 0 len ==> v res == v (zeros t SEC))}
(** Compares two byte sequences and declassifies the result *)
inline_for_extraction
val lbytes_eq: #len:size_nat -> b1:lbytes len -> b2:lbytes len -> b:bool{b <==> b1 == b2}
inline_for_extraction
val mask_select: #t:inttype{~(S128? t)} -> mask:int_t t SEC -> a:int_t t SEC -> b:int_t t SEC -> int_t t SEC
val mask_select_lemma: #t:inttype{~(S128? t)} -> mask:int_t t SEC -> a:int_t t SEC -> b:int_t t SEC -> Lemma
(requires v mask = 0 \/ v mask = v (ones t SEC))
(ensures mask_select mask a b == (if v mask = 0 then b else a))
val seq_mask_select: #t:inttype{~(S128? t)} -> #len:size_nat
-> a:lseq (int_t t SEC) len
-> b:lseq (int_t t SEC) len
-> mask:int_t t SEC
-> Pure (lseq (int_t t SEC) len)
(requires v mask = 0 \/ v mask = v (ones t SEC))
(ensures fun res -> res == (if v mask = 0 then b else a))
/// Constant for empty lbytes | false | true | Lib.ByteSequence.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 30,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val bytes_empty:bytes | [] | Lib.ByteSequence.bytes_empty | {
"file_name": "lib/Lib.ByteSequence.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Lib.Sequence.seq (Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.SEC) | {
"end_col": 39,
"end_line": 59,
"start_col": 25,
"start_line": 59
} |
Prims.Tot | [
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let bytes_t = bytes | let bytes_t = | false | null | false | bytes | {
"checked_file": "Lib.ByteSequence.fsti.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Lib.ByteSequence.fsti"
} | [
"total"
] | [
"Lib.ByteSequence.bytes"
] | [] | module Lib.ByteSequence
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0"
/// Definition of byte-based sequences
unfold inline_for_extraction
type bytes_l (l:secrecy_level) = seq (uint_t U8 l)
unfold inline_for_extraction
type lbytes_l (l:secrecy_level) (len:size_nat) = lseq (uint_t U8 l) len
unfold inline_for_extraction let bytes = bytes_l SEC
unfold inline_for_extraction let lbytes (len:size_nat) = lbytes_l SEC len
unfold inline_for_extraction let pub_bytes = bytes_l PUB
unfold inline_for_extraction let pub_lbytes (len:size_nat) = lbytes_l PUB len | false | true | Lib.ByteSequence.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 30,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val bytes_t : Type0 | [] | Lib.ByteSequence.bytes_t | {
"file_name": "lib/Lib.ByteSequence.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Type0 | {
"end_col": 48,
"end_line": 24,
"start_col": 43,
"start_line": 24
} |
|
Prims.Tot | val pub_bytes_empty:pub_bytes | [
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let pub_bytes_empty: pub_bytes = Seq.Base.empty | val pub_bytes_empty:pub_bytes
let pub_bytes_empty:pub_bytes = | false | null | false | Seq.Base.empty | {
"checked_file": "Lib.ByteSequence.fsti.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Lib.ByteSequence.fsti"
} | [
"total"
] | [
"FStar.Seq.Base.empty",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.PUB"
] | [] | module Lib.ByteSequence
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0"
/// Definition of byte-based sequences
unfold inline_for_extraction
type bytes_l (l:secrecy_level) = seq (uint_t U8 l)
unfold inline_for_extraction
type lbytes_l (l:secrecy_level) (len:size_nat) = lseq (uint_t U8 l) len
unfold inline_for_extraction let bytes = bytes_l SEC
unfold inline_for_extraction let lbytes (len:size_nat) = lbytes_l SEC len
unfold inline_for_extraction let pub_bytes = bytes_l PUB
unfold inline_for_extraction let pub_lbytes (len:size_nat) = lbytes_l PUB len
(* Alias *)
unfold inline_for_extraction let bytes_t = bytes
unfold inline_for_extraction let pub_bytes_t = pub_bytes
(** Construct the equality mask for a pair of secret integer sequences *)
val seq_eq_mask: #t:inttype{~(S128? t)} -> #len1:size_nat -> #len2:size_nat
-> b1:lseq (int_t t SEC) len1
-> b2:lseq (int_t t SEC) len2
-> len:size_nat{len <= len1 /\ len <= len2}
-> res:int_t t SEC{
(sub b1 0 len == sub b2 0 len ==> v res == v (ones t SEC)) /\
(sub b1 0 len =!= sub b2 0 len ==> v res == v (zeros t SEC))}
(** Compares two byte sequences and declassifies the result *)
inline_for_extraction
val lbytes_eq: #len:size_nat -> b1:lbytes len -> b2:lbytes len -> b:bool{b <==> b1 == b2}
inline_for_extraction
val mask_select: #t:inttype{~(S128? t)} -> mask:int_t t SEC -> a:int_t t SEC -> b:int_t t SEC -> int_t t SEC
val mask_select_lemma: #t:inttype{~(S128? t)} -> mask:int_t t SEC -> a:int_t t SEC -> b:int_t t SEC -> Lemma
(requires v mask = 0 \/ v mask = v (ones t SEC))
(ensures mask_select mask a b == (if v mask = 0 then b else a))
val seq_mask_select: #t:inttype{~(S128? t)} -> #len:size_nat
-> a:lseq (int_t t SEC) len
-> b:lseq (int_t t SEC) len
-> mask:int_t t SEC
-> Pure (lseq (int_t t SEC) len)
(requires v mask = 0 \/ v mask = v (ones t SEC))
(ensures fun res -> res == (if v mask = 0 then b else a))
/// Constant for empty lbytes | false | true | Lib.ByteSequence.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 30,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val pub_bytes_empty:pub_bytes | [] | Lib.ByteSequence.pub_bytes_empty | {
"file_name": "lib/Lib.ByteSequence.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Lib.Sequence.seq (Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.PUB) | {
"end_col": 47,
"end_line": 60,
"start_col": 33,
"start_line": 60
} |
Prims.Tot | [
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let pub_bytes = bytes_l PUB | let pub_bytes = | false | null | false | bytes_l PUB | {
"checked_file": "Lib.ByteSequence.fsti.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Lib.ByteSequence.fsti"
} | [
"total"
] | [
"Lib.ByteSequence.bytes_l",
"Lib.IntTypes.PUB"
] | [] | module Lib.ByteSequence
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0"
/// Definition of byte-based sequences
unfold inline_for_extraction
type bytes_l (l:secrecy_level) = seq (uint_t U8 l)
unfold inline_for_extraction
type lbytes_l (l:secrecy_level) (len:size_nat) = lseq (uint_t U8 l) len
unfold inline_for_extraction let bytes = bytes_l SEC | false | true | Lib.ByteSequence.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 30,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val pub_bytes : Type0 | [] | Lib.ByteSequence.pub_bytes | {
"file_name": "lib/Lib.ByteSequence.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Type0 | {
"end_col": 56,
"end_line": 20,
"start_col": 45,
"start_line": 20
} |
|
Prims.Tot | val nat_from_bytes_be (#l: secrecy_level) (b: bytes_l l) : n: nat{n < pow2 (length b * 8)} | [
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let nat_from_bytes_be (#l:secrecy_level) (b:bytes_l l) : n:nat{n < pow2 (length b * 8)} =
nat_from_intseq_be #U8 #l b | val nat_from_bytes_be (#l: secrecy_level) (b: bytes_l l) : n: nat{n < pow2 (length b * 8)}
let nat_from_bytes_be (#l: secrecy_level) (b: bytes_l l) : n: nat{n < pow2 (length b * 8)} = | false | null | false | nat_from_intseq_be #U8 #l b | {
"checked_file": "Lib.ByteSequence.fsti.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Lib.ByteSequence.fsti"
} | [
"total"
] | [
"Lib.IntTypes.secrecy_level",
"Lib.ByteSequence.bytes_l",
"Lib.ByteSequence.nat_from_intseq_be",
"Lib.IntTypes.U8",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"FStar.Mul.op_Star",
"Lib.Sequence.length",
"Lib.IntTypes.uint_t"
] | [] | module Lib.ByteSequence
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0"
/// Definition of byte-based sequences
unfold inline_for_extraction
type bytes_l (l:secrecy_level) = seq (uint_t U8 l)
unfold inline_for_extraction
type lbytes_l (l:secrecy_level) (len:size_nat) = lseq (uint_t U8 l) len
unfold inline_for_extraction let bytes = bytes_l SEC
unfold inline_for_extraction let lbytes (len:size_nat) = lbytes_l SEC len
unfold inline_for_extraction let pub_bytes = bytes_l PUB
unfold inline_for_extraction let pub_lbytes (len:size_nat) = lbytes_l PUB len
(* Alias *)
unfold inline_for_extraction let bytes_t = bytes
unfold inline_for_extraction let pub_bytes_t = pub_bytes
(** Construct the equality mask for a pair of secret integer sequences *)
val seq_eq_mask: #t:inttype{~(S128? t)} -> #len1:size_nat -> #len2:size_nat
-> b1:lseq (int_t t SEC) len1
-> b2:lseq (int_t t SEC) len2
-> len:size_nat{len <= len1 /\ len <= len2}
-> res:int_t t SEC{
(sub b1 0 len == sub b2 0 len ==> v res == v (ones t SEC)) /\
(sub b1 0 len =!= sub b2 0 len ==> v res == v (zeros t SEC))}
(** Compares two byte sequences and declassifies the result *)
inline_for_extraction
val lbytes_eq: #len:size_nat -> b1:lbytes len -> b2:lbytes len -> b:bool{b <==> b1 == b2}
inline_for_extraction
val mask_select: #t:inttype{~(S128? t)} -> mask:int_t t SEC -> a:int_t t SEC -> b:int_t t SEC -> int_t t SEC
val mask_select_lemma: #t:inttype{~(S128? t)} -> mask:int_t t SEC -> a:int_t t SEC -> b:int_t t SEC -> Lemma
(requires v mask = 0 \/ v mask = v (ones t SEC))
(ensures mask_select mask a b == (if v mask = 0 then b else a))
val seq_mask_select: #t:inttype{~(S128? t)} -> #len:size_nat
-> a:lseq (int_t t SEC) len
-> b:lseq (int_t t SEC) len
-> mask:int_t t SEC
-> Pure (lseq (int_t t SEC) len)
(requires v mask = 0 \/ v mask = v (ones t SEC))
(ensures fun res -> res == (if v mask = 0 then b else a))
/// Constant for empty lbytes
let bytes_empty: bytes = Seq.Base.empty
let pub_bytes_empty: pub_bytes = Seq.Base.empty
let lbytes_empty: lbytes 0 = create 0 (u8 0)
/// Conversions between natural numbers and sequences
inline_for_extraction
val nat_from_intseq_be: #t:inttype{unsigned t} -> #l:secrecy_level -> b:seq (uint_t t l)
-> n:nat{n < pow2 (length b * bits t)}
inline_for_extraction
val nat_from_intseq_le: #t:inttype{unsigned t} -> #l:secrecy_level
-> b:seq (uint_t t l) -> n:nat{n < pow2 (length b * bits t)}
inline_for_extraction | false | false | Lib.ByteSequence.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 30,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val nat_from_bytes_be (#l: secrecy_level) (b: bytes_l l) : n: nat{n < pow2 (length b * 8)} | [] | Lib.ByteSequence.nat_from_bytes_be | {
"file_name": "lib/Lib.ByteSequence.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | b: Lib.ByteSequence.bytes_l l -> n: Prims.nat{n < Prims.pow2 (Lib.Sequence.length b * 8)} | {
"end_col": 29,
"end_line": 77,
"start_col": 2,
"start_line": 77
} |
Prims.Tot | val nat_from_bytes_le (#l: secrecy_level) (b: bytes_l l) : n: nat{n < pow2 (length b * 8)} | [
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let nat_from_bytes_le (#l:secrecy_level) (b:bytes_l l) : n:nat{n < pow2 (length b * 8)} =
nat_from_intseq_le #U8 #l b | val nat_from_bytes_le (#l: secrecy_level) (b: bytes_l l) : n: nat{n < pow2 (length b * 8)}
let nat_from_bytes_le (#l: secrecy_level) (b: bytes_l l) : n: nat{n < pow2 (length b * 8)} = | false | null | false | nat_from_intseq_le #U8 #l b | {
"checked_file": "Lib.ByteSequence.fsti.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Lib.ByteSequence.fsti"
} | [
"total"
] | [
"Lib.IntTypes.secrecy_level",
"Lib.ByteSequence.bytes_l",
"Lib.ByteSequence.nat_from_intseq_le",
"Lib.IntTypes.U8",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"FStar.Mul.op_Star",
"Lib.Sequence.length",
"Lib.IntTypes.uint_t"
] | [] | module Lib.ByteSequence
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0"
/// Definition of byte-based sequences
unfold inline_for_extraction
type bytes_l (l:secrecy_level) = seq (uint_t U8 l)
unfold inline_for_extraction
type lbytes_l (l:secrecy_level) (len:size_nat) = lseq (uint_t U8 l) len
unfold inline_for_extraction let bytes = bytes_l SEC
unfold inline_for_extraction let lbytes (len:size_nat) = lbytes_l SEC len
unfold inline_for_extraction let pub_bytes = bytes_l PUB
unfold inline_for_extraction let pub_lbytes (len:size_nat) = lbytes_l PUB len
(* Alias *)
unfold inline_for_extraction let bytes_t = bytes
unfold inline_for_extraction let pub_bytes_t = pub_bytes
(** Construct the equality mask for a pair of secret integer sequences *)
val seq_eq_mask: #t:inttype{~(S128? t)} -> #len1:size_nat -> #len2:size_nat
-> b1:lseq (int_t t SEC) len1
-> b2:lseq (int_t t SEC) len2
-> len:size_nat{len <= len1 /\ len <= len2}
-> res:int_t t SEC{
(sub b1 0 len == sub b2 0 len ==> v res == v (ones t SEC)) /\
(sub b1 0 len =!= sub b2 0 len ==> v res == v (zeros t SEC))}
(** Compares two byte sequences and declassifies the result *)
inline_for_extraction
val lbytes_eq: #len:size_nat -> b1:lbytes len -> b2:lbytes len -> b:bool{b <==> b1 == b2}
inline_for_extraction
val mask_select: #t:inttype{~(S128? t)} -> mask:int_t t SEC -> a:int_t t SEC -> b:int_t t SEC -> int_t t SEC
val mask_select_lemma: #t:inttype{~(S128? t)} -> mask:int_t t SEC -> a:int_t t SEC -> b:int_t t SEC -> Lemma
(requires v mask = 0 \/ v mask = v (ones t SEC))
(ensures mask_select mask a b == (if v mask = 0 then b else a))
val seq_mask_select: #t:inttype{~(S128? t)} -> #len:size_nat
-> a:lseq (int_t t SEC) len
-> b:lseq (int_t t SEC) len
-> mask:int_t t SEC
-> Pure (lseq (int_t t SEC) len)
(requires v mask = 0 \/ v mask = v (ones t SEC))
(ensures fun res -> res == (if v mask = 0 then b else a))
/// Constant for empty lbytes
let bytes_empty: bytes = Seq.Base.empty
let pub_bytes_empty: pub_bytes = Seq.Base.empty
let lbytes_empty: lbytes 0 = create 0 (u8 0)
/// Conversions between natural numbers and sequences
inline_for_extraction
val nat_from_intseq_be: #t:inttype{unsigned t} -> #l:secrecy_level -> b:seq (uint_t t l)
-> n:nat{n < pow2 (length b * bits t)}
inline_for_extraction
val nat_from_intseq_le: #t:inttype{unsigned t} -> #l:secrecy_level
-> b:seq (uint_t t l) -> n:nat{n < pow2 (length b * bits t)}
inline_for_extraction
let nat_from_bytes_be (#l:secrecy_level) (b:bytes_l l) : n:nat{n < pow2 (length b * 8)} =
nat_from_intseq_be #U8 #l b
inline_for_extraction | false | false | Lib.ByteSequence.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 30,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val nat_from_bytes_le (#l: secrecy_level) (b: bytes_l l) : n: nat{n < pow2 (length b * 8)} | [] | Lib.ByteSequence.nat_from_bytes_le | {
"file_name": "lib/Lib.ByteSequence.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | b: Lib.ByteSequence.bytes_l l -> n: Prims.nat{n < Prims.pow2 (Lib.Sequence.length b * 8)} | {
"end_col": 29,
"end_line": 81,
"start_col": 2,
"start_line": 81
} |
Prims.Tot | val lbytes_empty:lbytes 0 | [
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let lbytes_empty: lbytes 0 = create 0 (u8 0) | val lbytes_empty:lbytes 0
let lbytes_empty:lbytes 0 = | false | null | false | create 0 (u8 0) | {
"checked_file": "Lib.ByteSequence.fsti.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Lib.ByteSequence.fsti"
} | [
"total"
] | [
"Lib.Sequence.create",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Lib.IntTypes.u8"
] | [] | module Lib.ByteSequence
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0"
/// Definition of byte-based sequences
unfold inline_for_extraction
type bytes_l (l:secrecy_level) = seq (uint_t U8 l)
unfold inline_for_extraction
type lbytes_l (l:secrecy_level) (len:size_nat) = lseq (uint_t U8 l) len
unfold inline_for_extraction let bytes = bytes_l SEC
unfold inline_for_extraction let lbytes (len:size_nat) = lbytes_l SEC len
unfold inline_for_extraction let pub_bytes = bytes_l PUB
unfold inline_for_extraction let pub_lbytes (len:size_nat) = lbytes_l PUB len
(* Alias *)
unfold inline_for_extraction let bytes_t = bytes
unfold inline_for_extraction let pub_bytes_t = pub_bytes
(** Construct the equality mask for a pair of secret integer sequences *)
val seq_eq_mask: #t:inttype{~(S128? t)} -> #len1:size_nat -> #len2:size_nat
-> b1:lseq (int_t t SEC) len1
-> b2:lseq (int_t t SEC) len2
-> len:size_nat{len <= len1 /\ len <= len2}
-> res:int_t t SEC{
(sub b1 0 len == sub b2 0 len ==> v res == v (ones t SEC)) /\
(sub b1 0 len =!= sub b2 0 len ==> v res == v (zeros t SEC))}
(** Compares two byte sequences and declassifies the result *)
inline_for_extraction
val lbytes_eq: #len:size_nat -> b1:lbytes len -> b2:lbytes len -> b:bool{b <==> b1 == b2}
inline_for_extraction
val mask_select: #t:inttype{~(S128? t)} -> mask:int_t t SEC -> a:int_t t SEC -> b:int_t t SEC -> int_t t SEC
val mask_select_lemma: #t:inttype{~(S128? t)} -> mask:int_t t SEC -> a:int_t t SEC -> b:int_t t SEC -> Lemma
(requires v mask = 0 \/ v mask = v (ones t SEC))
(ensures mask_select mask a b == (if v mask = 0 then b else a))
val seq_mask_select: #t:inttype{~(S128? t)} -> #len:size_nat
-> a:lseq (int_t t SEC) len
-> b:lseq (int_t t SEC) len
-> mask:int_t t SEC
-> Pure (lseq (int_t t SEC) len)
(requires v mask = 0 \/ v mask = v (ones t SEC))
(ensures fun res -> res == (if v mask = 0 then b else a))
/// Constant for empty lbytes
let bytes_empty: bytes = Seq.Base.empty
let pub_bytes_empty: pub_bytes = Seq.Base.empty | false | false | Lib.ByteSequence.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 30,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val lbytes_empty:lbytes 0 | [] | Lib.ByteSequence.lbytes_empty | {
"file_name": "lib/Lib.ByteSequence.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Lib.Sequence.lseq (Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.SEC) 0 | {
"end_col": 44,
"end_line": 63,
"start_col": 29,
"start_line": 63
} |
Prims.Tot | val nat_to_bytes_le (#l: secrecy_level) (len: nat) (n: nat{n < pow2 (8 * len)})
: b: bytes_l l {length b == len /\ n == nat_from_intseq_le #U8 b} | [
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let nat_to_bytes_le (#l:secrecy_level) (len:nat) (n:nat{n < pow2 (8 * len)}) : b:bytes_l l{length b == len /\ n == nat_from_intseq_le #U8 b} =
nat_to_intseq_le #U8 #l len n | val nat_to_bytes_le (#l: secrecy_level) (len: nat) (n: nat{n < pow2 (8 * len)})
: b: bytes_l l {length b == len /\ n == nat_from_intseq_le #U8 b}
let nat_to_bytes_le (#l: secrecy_level) (len: nat) (n: nat{n < pow2 (8 * len)})
: b: bytes_l l {length b == len /\ n == nat_from_intseq_le #U8 b} = | false | null | false | nat_to_intseq_le #U8 #l len n | {
"checked_file": "Lib.ByteSequence.fsti.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Lib.ByteSequence.fsti"
} | [
"total"
] | [
"Lib.IntTypes.secrecy_level",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"FStar.Mul.op_Star",
"Lib.ByteSequence.nat_to_intseq_le",
"Lib.IntTypes.U8",
"Lib.ByteSequence.bytes_l",
"Prims.l_and",
"Prims.eq2",
"Lib.Sequence.length",
"Lib.IntTypes.uint_t",
"Prims.l_or",
"Lib.IntTypes.bits",
"Lib.ByteSequence.nat_from_intseq_le"
] | [] | module Lib.ByteSequence
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0"
/// Definition of byte-based sequences
unfold inline_for_extraction
type bytes_l (l:secrecy_level) = seq (uint_t U8 l)
unfold inline_for_extraction
type lbytes_l (l:secrecy_level) (len:size_nat) = lseq (uint_t U8 l) len
unfold inline_for_extraction let bytes = bytes_l SEC
unfold inline_for_extraction let lbytes (len:size_nat) = lbytes_l SEC len
unfold inline_for_extraction let pub_bytes = bytes_l PUB
unfold inline_for_extraction let pub_lbytes (len:size_nat) = lbytes_l PUB len
(* Alias *)
unfold inline_for_extraction let bytes_t = bytes
unfold inline_for_extraction let pub_bytes_t = pub_bytes
(** Construct the equality mask for a pair of secret integer sequences *)
val seq_eq_mask: #t:inttype{~(S128? t)} -> #len1:size_nat -> #len2:size_nat
-> b1:lseq (int_t t SEC) len1
-> b2:lseq (int_t t SEC) len2
-> len:size_nat{len <= len1 /\ len <= len2}
-> res:int_t t SEC{
(sub b1 0 len == sub b2 0 len ==> v res == v (ones t SEC)) /\
(sub b1 0 len =!= sub b2 0 len ==> v res == v (zeros t SEC))}
(** Compares two byte sequences and declassifies the result *)
inline_for_extraction
val lbytes_eq: #len:size_nat -> b1:lbytes len -> b2:lbytes len -> b:bool{b <==> b1 == b2}
inline_for_extraction
val mask_select: #t:inttype{~(S128? t)} -> mask:int_t t SEC -> a:int_t t SEC -> b:int_t t SEC -> int_t t SEC
val mask_select_lemma: #t:inttype{~(S128? t)} -> mask:int_t t SEC -> a:int_t t SEC -> b:int_t t SEC -> Lemma
(requires v mask = 0 \/ v mask = v (ones t SEC))
(ensures mask_select mask a b == (if v mask = 0 then b else a))
val seq_mask_select: #t:inttype{~(S128? t)} -> #len:size_nat
-> a:lseq (int_t t SEC) len
-> b:lseq (int_t t SEC) len
-> mask:int_t t SEC
-> Pure (lseq (int_t t SEC) len)
(requires v mask = 0 \/ v mask = v (ones t SEC))
(ensures fun res -> res == (if v mask = 0 then b else a))
/// Constant for empty lbytes
let bytes_empty: bytes = Seq.Base.empty
let pub_bytes_empty: pub_bytes = Seq.Base.empty
let lbytes_empty: lbytes 0 = create 0 (u8 0)
/// Conversions between natural numbers and sequences
inline_for_extraction
val nat_from_intseq_be: #t:inttype{unsigned t} -> #l:secrecy_level -> b:seq (uint_t t l)
-> n:nat{n < pow2 (length b * bits t)}
inline_for_extraction
val nat_from_intseq_le: #t:inttype{unsigned t} -> #l:secrecy_level
-> b:seq (uint_t t l) -> n:nat{n < pow2 (length b * bits t)}
inline_for_extraction
let nat_from_bytes_be (#l:secrecy_level) (b:bytes_l l) : n:nat{n < pow2 (length b * 8)} =
nat_from_intseq_be #U8 #l b
inline_for_extraction
let nat_from_bytes_le (#l:secrecy_level) (b:bytes_l l) : n:nat{n < pow2 (length b * 8)} =
nat_from_intseq_le #U8 #l b
inline_for_extraction
val nat_to_intseq_be: #t:inttype{unsigned t} -> #l:secrecy_level -> len:nat -> n:nat{n < pow2 (bits t * len)} ->
b:seq (uint_t t l){length b == len /\ n == nat_from_intseq_be b}
inline_for_extraction
val nat_to_intseq_le: #t:inttype{unsigned t} -> #l:secrecy_level -> len:nat -> n:nat{n < pow2 (bits t * len)} ->
b:seq (uint_t t l){length b == len /\ n == nat_from_intseq_le b}
val index_nat_to_intseq_le:
#t:inttype{unsigned t}
-> #l:secrecy_level
-> len:size_nat
-> n:nat{n < pow2 (bits t * len)}
-> i:nat{i < len}
-> Lemma (Seq.index (nat_to_intseq_le #t #l len n) i ==
uint #t #l (n / pow2 (bits t * i) % pow2 (bits t)))
val index_nat_to_intseq_be:
#t:inttype{unsigned t}
-> #l:secrecy_level
-> len:size_nat
-> n:nat{n < pow2 (bits t * len)}
-> i:nat{i < len}
-> Lemma (Seq.index (nat_to_intseq_be #t #l len n) (len - i - 1) ==
uint #t #l (n / pow2 (bits t * i) % pow2 (bits t)))
inline_for_extraction
let nat_to_bytes_be (#l:secrecy_level) (len:nat) (n:nat{n < pow2 (8 * len)}) : b:bytes_l l{length b == len /\ n == nat_from_intseq_be #U8 b} =
nat_to_intseq_be #U8 #l len n
inline_for_extraction | false | false | Lib.ByteSequence.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 30,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val nat_to_bytes_le (#l: secrecy_level) (len: nat) (n: nat{n < pow2 (8 * len)})
: b: bytes_l l {length b == len /\ n == nat_from_intseq_le #U8 b} | [] | Lib.ByteSequence.nat_to_bytes_le | {
"file_name": "lib/Lib.ByteSequence.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | len: Prims.nat -> n: Prims.nat{n < Prims.pow2 (8 * len)}
-> b:
Lib.ByteSequence.bytes_l l
{Lib.Sequence.length b == len /\ n == Lib.ByteSequence.nat_from_intseq_le b} | {
"end_col": 31,
"end_line": 115,
"start_col": 2,
"start_line": 115
} |
Prims.Tot | val nat_to_bytes_be (#l: secrecy_level) (len: nat) (n: nat{n < pow2 (8 * len)})
: b: bytes_l l {length b == len /\ n == nat_from_intseq_be #U8 b} | [
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let nat_to_bytes_be (#l:secrecy_level) (len:nat) (n:nat{n < pow2 (8 * len)}) : b:bytes_l l{length b == len /\ n == nat_from_intseq_be #U8 b} =
nat_to_intseq_be #U8 #l len n | val nat_to_bytes_be (#l: secrecy_level) (len: nat) (n: nat{n < pow2 (8 * len)})
: b: bytes_l l {length b == len /\ n == nat_from_intseq_be #U8 b}
let nat_to_bytes_be (#l: secrecy_level) (len: nat) (n: nat{n < pow2 (8 * len)})
: b: bytes_l l {length b == len /\ n == nat_from_intseq_be #U8 b} = | false | null | false | nat_to_intseq_be #U8 #l len n | {
"checked_file": "Lib.ByteSequence.fsti.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Lib.ByteSequence.fsti"
} | [
"total"
] | [
"Lib.IntTypes.secrecy_level",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"FStar.Mul.op_Star",
"Lib.ByteSequence.nat_to_intseq_be",
"Lib.IntTypes.U8",
"Lib.ByteSequence.bytes_l",
"Prims.l_and",
"Prims.eq2",
"Lib.Sequence.length",
"Lib.IntTypes.uint_t",
"Prims.l_or",
"Lib.IntTypes.bits",
"Lib.ByteSequence.nat_from_intseq_be"
] | [] | module Lib.ByteSequence
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 30 --max_fuel 0 --max_ifuel 0"
/// Definition of byte-based sequences
unfold inline_for_extraction
type bytes_l (l:secrecy_level) = seq (uint_t U8 l)
unfold inline_for_extraction
type lbytes_l (l:secrecy_level) (len:size_nat) = lseq (uint_t U8 l) len
unfold inline_for_extraction let bytes = bytes_l SEC
unfold inline_for_extraction let lbytes (len:size_nat) = lbytes_l SEC len
unfold inline_for_extraction let pub_bytes = bytes_l PUB
unfold inline_for_extraction let pub_lbytes (len:size_nat) = lbytes_l PUB len
(* Alias *)
unfold inline_for_extraction let bytes_t = bytes
unfold inline_for_extraction let pub_bytes_t = pub_bytes
(** Construct the equality mask for a pair of secret integer sequences *)
val seq_eq_mask: #t:inttype{~(S128? t)} -> #len1:size_nat -> #len2:size_nat
-> b1:lseq (int_t t SEC) len1
-> b2:lseq (int_t t SEC) len2
-> len:size_nat{len <= len1 /\ len <= len2}
-> res:int_t t SEC{
(sub b1 0 len == sub b2 0 len ==> v res == v (ones t SEC)) /\
(sub b1 0 len =!= sub b2 0 len ==> v res == v (zeros t SEC))}
(** Compares two byte sequences and declassifies the result *)
inline_for_extraction
val lbytes_eq: #len:size_nat -> b1:lbytes len -> b2:lbytes len -> b:bool{b <==> b1 == b2}
inline_for_extraction
val mask_select: #t:inttype{~(S128? t)} -> mask:int_t t SEC -> a:int_t t SEC -> b:int_t t SEC -> int_t t SEC
val mask_select_lemma: #t:inttype{~(S128? t)} -> mask:int_t t SEC -> a:int_t t SEC -> b:int_t t SEC -> Lemma
(requires v mask = 0 \/ v mask = v (ones t SEC))
(ensures mask_select mask a b == (if v mask = 0 then b else a))
val seq_mask_select: #t:inttype{~(S128? t)} -> #len:size_nat
-> a:lseq (int_t t SEC) len
-> b:lseq (int_t t SEC) len
-> mask:int_t t SEC
-> Pure (lseq (int_t t SEC) len)
(requires v mask = 0 \/ v mask = v (ones t SEC))
(ensures fun res -> res == (if v mask = 0 then b else a))
/// Constant for empty lbytes
let bytes_empty: bytes = Seq.Base.empty
let pub_bytes_empty: pub_bytes = Seq.Base.empty
let lbytes_empty: lbytes 0 = create 0 (u8 0)
/// Conversions between natural numbers and sequences
inline_for_extraction
val nat_from_intseq_be: #t:inttype{unsigned t} -> #l:secrecy_level -> b:seq (uint_t t l)
-> n:nat{n < pow2 (length b * bits t)}
inline_for_extraction
val nat_from_intseq_le: #t:inttype{unsigned t} -> #l:secrecy_level
-> b:seq (uint_t t l) -> n:nat{n < pow2 (length b * bits t)}
inline_for_extraction
let nat_from_bytes_be (#l:secrecy_level) (b:bytes_l l) : n:nat{n < pow2 (length b * 8)} =
nat_from_intseq_be #U8 #l b
inline_for_extraction
let nat_from_bytes_le (#l:secrecy_level) (b:bytes_l l) : n:nat{n < pow2 (length b * 8)} =
nat_from_intseq_le #U8 #l b
inline_for_extraction
val nat_to_intseq_be: #t:inttype{unsigned t} -> #l:secrecy_level -> len:nat -> n:nat{n < pow2 (bits t * len)} ->
b:seq (uint_t t l){length b == len /\ n == nat_from_intseq_be b}
inline_for_extraction
val nat_to_intseq_le: #t:inttype{unsigned t} -> #l:secrecy_level -> len:nat -> n:nat{n < pow2 (bits t * len)} ->
b:seq (uint_t t l){length b == len /\ n == nat_from_intseq_le b}
val index_nat_to_intseq_le:
#t:inttype{unsigned t}
-> #l:secrecy_level
-> len:size_nat
-> n:nat{n < pow2 (bits t * len)}
-> i:nat{i < len}
-> Lemma (Seq.index (nat_to_intseq_le #t #l len n) i ==
uint #t #l (n / pow2 (bits t * i) % pow2 (bits t)))
val index_nat_to_intseq_be:
#t:inttype{unsigned t}
-> #l:secrecy_level
-> len:size_nat
-> n:nat{n < pow2 (bits t * len)}
-> i:nat{i < len}
-> Lemma (Seq.index (nat_to_intseq_be #t #l len n) (len - i - 1) ==
uint #t #l (n / pow2 (bits t * i) % pow2 (bits t)))
inline_for_extraction | false | false | Lib.ByteSequence.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 30,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val nat_to_bytes_be (#l: secrecy_level) (len: nat) (n: nat{n < pow2 (8 * len)})
: b: bytes_l l {length b == len /\ n == nat_from_intseq_be #U8 b} | [] | Lib.ByteSequence.nat_to_bytes_be | {
"file_name": "lib/Lib.ByteSequence.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | len: Prims.nat -> n: Prims.nat{n < Prims.pow2 (8 * len)}
-> b:
Lib.ByteSequence.bytes_l l
{Lib.Sequence.length b == len /\ n == Lib.ByteSequence.nat_from_intseq_be b} | {
"end_col": 31,
"end_line": 111,
"start_col": 2,
"start_line": 111
} |
Prims.Tot | val be_quad32_to_seq (q: quad32) : seq nat32 | [
{
"abbrev": false,
"full_module": "Vale.Def.Words.Seq_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_BE_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let be_quad32_to_seq (q:quad32) : seq nat32 = four_to_seq_BE q | val be_quad32_to_seq (q: quad32) : seq nat32
let be_quad32_to_seq (q: quad32) : seq nat32 = | false | null | false | four_to_seq_BE q | {
"checked_file": "Vale.AES.AES256_helpers_BE.fsti.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.AES_BE_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.AES.AES256_helpers_BE.fsti"
} | [
"total"
] | [
"Vale.Def.Types_s.quad32",
"Vale.Def.Words.Seq_s.four_to_seq_BE",
"Vale.Def.Types_s.nat32",
"FStar.Seq.Base.seq"
] | [] | module Vale.AES.AES256_helpers_BE
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.Types
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_BE_s
open Vale.Def.Words.Seq_s
// syntax for seq accesses, s.[index] and s.[index] <- value
unfold let (.[]) (#a:Type) (s:seq a) (i:nat{ i < length s}) : Tot a = index s i
unfold let (.[]<-) = Seq.upd
unfold let ( *^ ) = nat32_xor
unfold let ( *^^ ) = quad32_xor | false | true | Vale.AES.AES256_helpers_BE.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val be_quad32_to_seq (q: quad32) : seq nat32 | [] | Vale.AES.AES256_helpers_BE.be_quad32_to_seq | {
"file_name": "vale/code/crypto/aes/Vale.AES.AES256_helpers_BE.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | q: Vale.Def.Types_s.quad32 -> FStar.Seq.Base.seq Vale.Def.Types_s.nat32 | {
"end_col": 69,
"end_line": 19,
"start_col": 53,
"start_line": 19
} |
Prims.Tot | val op_String_Access (#a: Type) (s: seq a) (i: nat{i < length s}) : Tot a | [
{
"abbrev": false,
"full_module": "Vale.Def.Words.Seq_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_BE_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let (.[]) (#a:Type) (s:seq a) (i:nat{ i < length s}) : Tot a = index s i | val op_String_Access (#a: Type) (s: seq a) (i: nat{i < length s}) : Tot a
let op_String_Access (#a: Type) (s: seq a) (i: nat{i < length s}) : Tot a = | false | null | false | index s i | {
"checked_file": "Vale.AES.AES256_helpers_BE.fsti.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.AES_BE_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.AES.AES256_helpers_BE.fsti"
} | [
"total"
] | [
"FStar.Seq.Base.seq",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Seq.Base.length",
"FStar.Seq.Base.index"
] | [] | module Vale.AES.AES256_helpers_BE
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.Types
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_BE_s
open Vale.Def.Words.Seq_s | false | false | Vale.AES.AES256_helpers_BE.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val op_String_Access (#a: Type) (s: seq a) (i: nat{i < length s}) : Tot a | [] | Vale.AES.AES256_helpers_BE.op_String_Access | {
"file_name": "vale/code/crypto/aes/Vale.AES.AES256_helpers_BE.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | s: FStar.Seq.Base.seq a -> i: Prims.nat{i < FStar.Seq.Base.length s} -> a | {
"end_col": 79,
"end_line": 13,
"start_col": 70,
"start_line": 13
} |
Prims.Tot | val quad32_shr32 (q: quad32) : quad32 | [
{
"abbrev": false,
"full_module": "Vale.Def.Words.Seq_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_BE_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let quad32_shr32 (q:quad32) : quad32 =
let Mkfour v0 v1 v2 v3 = q in
Mkfour v1 v2 v3 0 | val quad32_shr32 (q: quad32) : quad32
let quad32_shr32 (q: quad32) : quad32 = | false | null | false | let Mkfour v0 v1 v2 v3 = q in
Mkfour v1 v2 v3 0 | {
"checked_file": "Vale.AES.AES256_helpers_BE.fsti.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.AES_BE_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.AES.AES256_helpers_BE.fsti"
} | [
"total"
] | [
"Vale.Def.Types_s.quad32",
"Vale.Def.Types_s.nat32",
"Vale.Def.Words_s.Mkfour"
] | [] | module Vale.AES.AES256_helpers_BE
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.Types
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_BE_s
open Vale.Def.Words.Seq_s
// syntax for seq accesses, s.[index] and s.[index] <- value
unfold let (.[]) (#a:Type) (s:seq a) (i:nat{ i < length s}) : Tot a = index s i
unfold let (.[]<-) = Seq.upd
unfold let ( *^ ) = nat32_xor
unfold let ( *^^ ) = quad32_xor
unfold let be_quad32_to_seq (q:quad32) : seq nat32 = four_to_seq_BE q | false | true | Vale.AES.AES256_helpers_BE.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val quad32_shr32 (q: quad32) : quad32 | [] | Vale.AES.AES256_helpers_BE.quad32_shr32 | {
"file_name": "vale/code/crypto/aes/Vale.AES.AES256_helpers_BE.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | q: Vale.Def.Types_s.quad32 -> Vale.Def.Types_s.quad32 | {
"end_col": 19,
"end_line": 23,
"start_col": 38,
"start_line": 21
} |
Prims.Tot | val round_key_256_rcon (prev0 prev1: quad32) (rcon: nat32) (round: int) : quad32 | [
{
"abbrev": false,
"full_module": "Vale.Def.Words.Seq_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_BE_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let round_key_256_rcon (prev0 prev1:quad32) (rcon:nat32) (round:int) : quad32 =
let Mkfour v0 v1 v2 v3 = prev0 in
let Mkfour v7 _ _ _ = prev1 in
let c1 = if round % 2 = 0 then sub_word (rot_word v7) *^ rcon else sub_word v7 in
let w3 = v3 *^ c1 in
let w2 = v2 *^ w3 in
let w1 = v1 *^ w2 in
let w0 = v0 *^ w1 in
Mkfour w0 w1 w2 w3 | val round_key_256_rcon (prev0 prev1: quad32) (rcon: nat32) (round: int) : quad32
let round_key_256_rcon (prev0 prev1: quad32) (rcon: nat32) (round: int) : quad32 = | false | null | false | let Mkfour v0 v1 v2 v3 = prev0 in
let Mkfour v7 _ _ _ = prev1 in
let c1 = if round % 2 = 0 then sub_word (rot_word v7) *^ rcon else sub_word v7 in
let w3 = v3 *^ c1 in
let w2 = v2 *^ w3 in
let w1 = v1 *^ w2 in
let w0 = v0 *^ w1 in
Mkfour w0 w1 w2 w3 | {
"checked_file": "Vale.AES.AES256_helpers_BE.fsti.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.AES_BE_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.AES.AES256_helpers_BE.fsti"
} | [
"total"
] | [
"Vale.Def.Types_s.quad32",
"Vale.Def.Types_s.nat32",
"Prims.int",
"Vale.Def.Words_s.Mkfour",
"Vale.Def.Words_s.nat32",
"Vale.AES.AES256_helpers_BE.op_Star_Hat",
"Prims.op_Equality",
"Prims.op_Modulus",
"Vale.AES.AES_common_s.sub_word",
"Vale.AES.AES_BE_s.rot_word",
"Prims.bool"
] | [] | module Vale.AES.AES256_helpers_BE
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.Types
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_BE_s
open Vale.Def.Words.Seq_s
// syntax for seq accesses, s.[index] and s.[index] <- value
unfold let (.[]) (#a:Type) (s:seq a) (i:nat{ i < length s}) : Tot a = index s i
unfold let (.[]<-) = Seq.upd
unfold let ( *^ ) = nat32_xor
unfold let ( *^^ ) = quad32_xor
unfold let be_quad32_to_seq (q:quad32) : seq nat32 = four_to_seq_BE q
let quad32_shr32 (q:quad32) : quad32 =
let Mkfour v0 v1 v2 v3 = q in
Mkfour v1 v2 v3 0
let make_AES256_key (k0 k1:quad32) : Pure (seq nat32)
(requires True)
(ensures fun key -> is_aes_key_word AES_256 key)
=
append (be_quad32_to_seq k0) (be_quad32_to_seq k1)
// Redefine key expansion in terms of quad32 values rather than nat32 values,
// then prove both definitions are equivalent. | false | true | Vale.AES.AES256_helpers_BE.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val round_key_256_rcon (prev0 prev1: quad32) (rcon: nat32) (round: int) : quad32 | [] | Vale.AES.AES256_helpers_BE.round_key_256_rcon | {
"file_name": "vale/code/crypto/aes/Vale.AES.AES256_helpers_BE.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
prev0: Vale.Def.Types_s.quad32 ->
prev1: Vale.Def.Types_s.quad32 ->
rcon: Vale.Def.Types_s.nat32 ->
round: Prims.int
-> Vale.Def.Types_s.quad32 | {
"end_col": 20,
"end_line": 42,
"start_col": 79,
"start_line": 34
} |
FStar.Pervasives.Lemma | [
{
"abbrev": false,
"full_module": "Vale.Def.Words.Seq_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_BE_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let expand_key_256_reveal = opaque_revealer (`%expand_key_256) expand_key_256 expand_key_256_def | let expand_key_256_reveal = | false | null | true | opaque_revealer (`%expand_key_256) expand_key_256 expand_key_256_def | {
"checked_file": "Vale.AES.AES256_helpers_BE.fsti.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.AES_BE_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.AES.AES256_helpers_BE.fsti"
} | [
"lemma"
] | [
"Vale.Def.Opaque_s.opaque_revealer",
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.nat32",
"Prims.nat",
"Vale.Def.Types_s.quad32",
"Vale.AES.AES_BE_s.is_aes_key_word",
"Vale.AES.AES_common_s.AES_256",
"Prims.l_True",
"Vale.AES.AES256_helpers_BE.expand_key_256",
"Vale.AES.AES256_helpers_BE.expand_key_256_def"
] | [] | module Vale.AES.AES256_helpers_BE
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.Types
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_BE_s
open Vale.Def.Words.Seq_s
// syntax for seq accesses, s.[index] and s.[index] <- value
unfold let (.[]) (#a:Type) (s:seq a) (i:nat{ i < length s}) : Tot a = index s i
unfold let (.[]<-) = Seq.upd
unfold let ( *^ ) = nat32_xor
unfold let ( *^^ ) = quad32_xor
unfold let be_quad32_to_seq (q:quad32) : seq nat32 = four_to_seq_BE q
let quad32_shr32 (q:quad32) : quad32 =
let Mkfour v0 v1 v2 v3 = q in
Mkfour v1 v2 v3 0
let make_AES256_key (k0 k1:quad32) : Pure (seq nat32)
(requires True)
(ensures fun key -> is_aes_key_word AES_256 key)
=
append (be_quad32_to_seq k0) (be_quad32_to_seq k1)
// Redefine key expansion in terms of quad32 values rather than nat32 values,
// then prove both definitions are equivalent.
let round_key_256_rcon (prev0 prev1:quad32) (rcon:nat32) (round:int) : quad32 =
let Mkfour v0 v1 v2 v3 = prev0 in
let Mkfour v7 _ _ _ = prev1 in
let c1 = if round % 2 = 0 then sub_word (rot_word v7) *^ rcon else sub_word v7 in
let w3 = v3 *^ c1 in
let w2 = v2 *^ w3 in
let w1 = v1 *^ w2 in
let w0 = v0 *^ w1 in
Mkfour w0 w1 w2 w3
let round_key_256 (prev0 prev1:quad32) (round:nat) : quad32 =
round_key_256_rcon prev0 prev1 (aes_rcon (round / 2 - 1)) round
let rec expand_key_256_def (key:seq nat32) (round:nat) : Pure quad32
(requires is_aes_key_word AES_256 key)
(ensures fun _ -> True)
=
if round = 0 then Mkfour key.[3] key.[2] key.[1] key.[0]
else if round = 1 then Mkfour key.[7] key.[6] key.[5] key.[4]
else round_key_256 (expand_key_256_def key (round - 2)) (expand_key_256_def key (round - 1)) round | false | false | Vale.AES.AES256_helpers_BE.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val expand_key_256_reveal : _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures
Vale.AES.AES256_helpers_BE.expand_key_256 == Vale.AES.AES256_helpers_BE.expand_key_256_def) | [] | Vale.AES.AES256_helpers_BE.expand_key_256_reveal | {
"file_name": "vale/code/crypto/aes/Vale.AES.AES256_helpers_BE.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures
Vale.AES.AES256_helpers_BE.expand_key_256 == Vale.AES.AES256_helpers_BE.expand_key_256_def) | {
"end_col": 108,
"end_line": 55,
"start_col": 40,
"start_line": 55
} |
|
Prims.Tot | val round_key_256 (prev0 prev1: quad32) (round: nat) : quad32 | [
{
"abbrev": false,
"full_module": "Vale.Def.Words.Seq_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_BE_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let round_key_256 (prev0 prev1:quad32) (round:nat) : quad32 =
round_key_256_rcon prev0 prev1 (aes_rcon (round / 2 - 1)) round | val round_key_256 (prev0 prev1: quad32) (round: nat) : quad32
let round_key_256 (prev0 prev1: quad32) (round: nat) : quad32 = | false | null | false | round_key_256_rcon prev0 prev1 (aes_rcon (round / 2 - 1)) round | {
"checked_file": "Vale.AES.AES256_helpers_BE.fsti.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.AES_BE_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.AES.AES256_helpers_BE.fsti"
} | [
"total"
] | [
"Vale.Def.Types_s.quad32",
"Prims.nat",
"Vale.AES.AES256_helpers_BE.round_key_256_rcon",
"Vale.AES.AES_common_s.aes_rcon",
"Prims.op_Subtraction",
"Prims.op_Division"
] | [] | module Vale.AES.AES256_helpers_BE
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.Types
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_BE_s
open Vale.Def.Words.Seq_s
// syntax for seq accesses, s.[index] and s.[index] <- value
unfold let (.[]) (#a:Type) (s:seq a) (i:nat{ i < length s}) : Tot a = index s i
unfold let (.[]<-) = Seq.upd
unfold let ( *^ ) = nat32_xor
unfold let ( *^^ ) = quad32_xor
unfold let be_quad32_to_seq (q:quad32) : seq nat32 = four_to_seq_BE q
let quad32_shr32 (q:quad32) : quad32 =
let Mkfour v0 v1 v2 v3 = q in
Mkfour v1 v2 v3 0
let make_AES256_key (k0 k1:quad32) : Pure (seq nat32)
(requires True)
(ensures fun key -> is_aes_key_word AES_256 key)
=
append (be_quad32_to_seq k0) (be_quad32_to_seq k1)
// Redefine key expansion in terms of quad32 values rather than nat32 values,
// then prove both definitions are equivalent.
let round_key_256_rcon (prev0 prev1:quad32) (rcon:nat32) (round:int) : quad32 =
let Mkfour v0 v1 v2 v3 = prev0 in
let Mkfour v7 _ _ _ = prev1 in
let c1 = if round % 2 = 0 then sub_word (rot_word v7) *^ rcon else sub_word v7 in
let w3 = v3 *^ c1 in
let w2 = v2 *^ w3 in
let w1 = v1 *^ w2 in
let w0 = v0 *^ w1 in
Mkfour w0 w1 w2 w3 | false | true | Vale.AES.AES256_helpers_BE.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val round_key_256 (prev0 prev1: quad32) (round: nat) : quad32 | [] | Vale.AES.AES256_helpers_BE.round_key_256 | {
"file_name": "vale/code/crypto/aes/Vale.AES.AES256_helpers_BE.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | prev0: Vale.Def.Types_s.quad32 -> prev1: Vale.Def.Types_s.quad32 -> round: Prims.nat
-> Vale.Def.Types_s.quad32 | {
"end_col": 65,
"end_line": 45,
"start_col": 2,
"start_line": 45
} |
Prims.Pure | [
{
"abbrev": false,
"full_module": "Vale.Def.Words.Seq_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_BE_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let expand_key_256 = opaque_make expand_key_256_def | let expand_key_256 = | false | null | false | opaque_make expand_key_256_def | {
"checked_file": "Vale.AES.AES256_helpers_BE.fsti.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.AES_BE_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.AES.AES256_helpers_BE.fsti"
} | [] | [
"Vale.Def.Opaque_s.opaque_make",
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.nat32",
"Prims.nat",
"Vale.Def.Types_s.quad32",
"Vale.AES.AES_BE_s.is_aes_key_word",
"Vale.AES.AES_common_s.AES_256",
"Prims.l_True",
"Vale.AES.AES256_helpers_BE.expand_key_256_def"
] | [] | module Vale.AES.AES256_helpers_BE
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.Types
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_BE_s
open Vale.Def.Words.Seq_s
// syntax for seq accesses, s.[index] and s.[index] <- value
unfold let (.[]) (#a:Type) (s:seq a) (i:nat{ i < length s}) : Tot a = index s i
unfold let (.[]<-) = Seq.upd
unfold let ( *^ ) = nat32_xor
unfold let ( *^^ ) = quad32_xor
unfold let be_quad32_to_seq (q:quad32) : seq nat32 = four_to_seq_BE q
let quad32_shr32 (q:quad32) : quad32 =
let Mkfour v0 v1 v2 v3 = q in
Mkfour v1 v2 v3 0
let make_AES256_key (k0 k1:quad32) : Pure (seq nat32)
(requires True)
(ensures fun key -> is_aes_key_word AES_256 key)
=
append (be_quad32_to_seq k0) (be_quad32_to_seq k1)
// Redefine key expansion in terms of quad32 values rather than nat32 values,
// then prove both definitions are equivalent.
let round_key_256_rcon (prev0 prev1:quad32) (rcon:nat32) (round:int) : quad32 =
let Mkfour v0 v1 v2 v3 = prev0 in
let Mkfour v7 _ _ _ = prev1 in
let c1 = if round % 2 = 0 then sub_word (rot_word v7) *^ rcon else sub_word v7 in
let w3 = v3 *^ c1 in
let w2 = v2 *^ w3 in
let w1 = v1 *^ w2 in
let w0 = v0 *^ w1 in
Mkfour w0 w1 w2 w3
let round_key_256 (prev0 prev1:quad32) (round:nat) : quad32 =
round_key_256_rcon prev0 prev1 (aes_rcon (round / 2 - 1)) round
let rec expand_key_256_def (key:seq nat32) (round:nat) : Pure quad32
(requires is_aes_key_word AES_256 key)
(ensures fun _ -> True)
=
if round = 0 then Mkfour key.[3] key.[2] key.[1] key.[0]
else if round = 1 then Mkfour key.[7] key.[6] key.[5] key.[4] | false | false | Vale.AES.AES256_helpers_BE.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val expand_key_256 : key: FStar.Seq.Base.seq Vale.Def.Types_s.nat32 -> round: Prims.nat
-> Prims.Pure Vale.Def.Types_s.quad32 | [] | Vale.AES.AES256_helpers_BE.expand_key_256 | {
"file_name": "vale/code/crypto/aes/Vale.AES.AES256_helpers_BE.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | key: FStar.Seq.Base.seq Vale.Def.Types_s.nat32 -> round: Prims.nat
-> Prims.Pure Vale.Def.Types_s.quad32 | {
"end_col": 70,
"end_line": 54,
"start_col": 40,
"start_line": 54
} |
|
Prims.Tot | val simd_round_key_256 (prev0 prev1: quad32) (rcon: nat32) (round: int) : quad32 | [
{
"abbrev": false,
"full_module": "Vale.Def.Words.Seq_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_BE_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let simd_round_key_256 (prev0 prev1:quad32) (rcon:nat32) (round:int) : quad32 =
let r = if round % 2 = 0 then rot_word (sub_word prev1.lo0 *^ ishl32 rcon 16) else sub_word prev1.lo0 in
let q = prev0 in
let q = q *^^ quad32_shr32 q in
let q = q *^^ quad32_shr32 q in
let q = q *^^ quad32_shr32 q in
q *^^ Mkfour r r r r | val simd_round_key_256 (prev0 prev1: quad32) (rcon: nat32) (round: int) : quad32
let simd_round_key_256 (prev0 prev1: quad32) (rcon: nat32) (round: int) : quad32 = | false | null | false | let r =
if round % 2 = 0 then rot_word (sub_word prev1.lo0 *^ ishl32 rcon 16) else sub_word prev1.lo0
in
let q = prev0 in
let q = q *^^ quad32_shr32 q in
let q = q *^^ quad32_shr32 q in
let q = q *^^ quad32_shr32 q in
q *^^ Mkfour r r r r | {
"checked_file": "Vale.AES.AES256_helpers_BE.fsti.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.AES_BE_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.AES.AES256_helpers_BE.fsti"
} | [
"total"
] | [
"Vale.Def.Types_s.quad32",
"Vale.Def.Types_s.nat32",
"Prims.int",
"Vale.AES.AES256_helpers_BE.op_Star_Hat_Hat",
"Vale.Def.Words_s.Mkfour",
"Vale.AES.AES256_helpers_BE.quad32_shr32",
"Vale.Def.Words_s.nat32",
"Prims.op_Equality",
"Prims.op_Modulus",
"Vale.AES.AES_BE_s.rot_word",
"Vale.AES.AES256_helpers_BE.op_Star_Hat",
"Vale.AES.AES_common_s.sub_word",
"Vale.Def.Words_s.__proj__Mkfour__item__lo0",
"Vale.Arch.Types.ishl32",
"Prims.bool"
] | [] | module Vale.AES.AES256_helpers_BE
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.Types
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_BE_s
open Vale.Def.Words.Seq_s
// syntax for seq accesses, s.[index] and s.[index] <- value
unfold let (.[]) (#a:Type) (s:seq a) (i:nat{ i < length s}) : Tot a = index s i
unfold let (.[]<-) = Seq.upd
unfold let ( *^ ) = nat32_xor
unfold let ( *^^ ) = quad32_xor
unfold let be_quad32_to_seq (q:quad32) : seq nat32 = four_to_seq_BE q
let quad32_shr32 (q:quad32) : quad32 =
let Mkfour v0 v1 v2 v3 = q in
Mkfour v1 v2 v3 0
let make_AES256_key (k0 k1:quad32) : Pure (seq nat32)
(requires True)
(ensures fun key -> is_aes_key_word AES_256 key)
=
append (be_quad32_to_seq k0) (be_quad32_to_seq k1)
// Redefine key expansion in terms of quad32 values rather than nat32 values,
// then prove both definitions are equivalent.
let round_key_256_rcon (prev0 prev1:quad32) (rcon:nat32) (round:int) : quad32 =
let Mkfour v0 v1 v2 v3 = prev0 in
let Mkfour v7 _ _ _ = prev1 in
let c1 = if round % 2 = 0 then sub_word (rot_word v7) *^ rcon else sub_word v7 in
let w3 = v3 *^ c1 in
let w2 = v2 *^ w3 in
let w1 = v1 *^ w2 in
let w0 = v0 *^ w1 in
Mkfour w0 w1 w2 w3
let round_key_256 (prev0 prev1:quad32) (round:nat) : quad32 =
round_key_256_rcon prev0 prev1 (aes_rcon (round / 2 - 1)) round
let rec expand_key_256_def (key:seq nat32) (round:nat) : Pure quad32
(requires is_aes_key_word AES_256 key)
(ensures fun _ -> True)
=
if round = 0 then Mkfour key.[3] key.[2] key.[1] key.[0]
else if round = 1 then Mkfour key.[7] key.[6] key.[5] key.[4]
else round_key_256 (expand_key_256_def key (round - 2)) (expand_key_256_def key (round - 1)) round
[@"opaque_to_smt"] let expand_key_256 = opaque_make expand_key_256_def
irreducible let expand_key_256_reveal = opaque_revealer (`%expand_key_256) expand_key_256 expand_key_256_def
// quad32 key expansion is equivalent to nat32 key expansion
val lemma_expand_key_256 (key:seq nat32) (size:nat) : Lemma
(requires size <= 15 /\ is_aes_key_word AES_256 key)
(ensures (
let s = key_schedule_to_round_keys size (expand_key AES_256 key 60) in
(forall (i:nat).{:pattern (expand_key_256 key i)} i < size ==> expand_key_256 key i == s.[i])
)) | false | true | Vale.AES.AES256_helpers_BE.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val simd_round_key_256 (prev0 prev1: quad32) (rcon: nat32) (round: int) : quad32 | [] | Vale.AES.AES256_helpers_BE.simd_round_key_256 | {
"file_name": "vale/code/crypto/aes/Vale.AES.AES256_helpers_BE.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
prev0: Vale.Def.Types_s.quad32 ->
prev1: Vale.Def.Types_s.quad32 ->
rcon: Vale.Def.Types_s.nat32 ->
round: Prims.int
-> Vale.Def.Types_s.quad32 | {
"end_col": 22,
"end_line": 72,
"start_col": 79,
"start_line": 66
} |
Prims.Pure | val make_AES256_key (k0 k1: quad32)
: Pure (seq nat32) (requires True) (ensures fun key -> is_aes_key_word AES_256 key) | [
{
"abbrev": false,
"full_module": "Vale.Def.Words.Seq_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_BE_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let make_AES256_key (k0 k1:quad32) : Pure (seq nat32)
(requires True)
(ensures fun key -> is_aes_key_word AES_256 key)
=
append (be_quad32_to_seq k0) (be_quad32_to_seq k1) | val make_AES256_key (k0 k1: quad32)
: Pure (seq nat32) (requires True) (ensures fun key -> is_aes_key_word AES_256 key)
let make_AES256_key (k0 k1: quad32)
: Pure (seq nat32) (requires True) (ensures fun key -> is_aes_key_word AES_256 key) = | false | null | false | append (be_quad32_to_seq k0) (be_quad32_to_seq k1) | {
"checked_file": "Vale.AES.AES256_helpers_BE.fsti.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.AES_BE_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.AES.AES256_helpers_BE.fsti"
} | [] | [
"Vale.Def.Types_s.quad32",
"FStar.Seq.Base.append",
"Vale.Def.Types_s.nat32",
"Vale.AES.AES256_helpers_BE.be_quad32_to_seq",
"FStar.Seq.Base.seq",
"Prims.l_True",
"Vale.AES.AES_BE_s.is_aes_key_word",
"Vale.AES.AES_common_s.AES_256"
] | [] | module Vale.AES.AES256_helpers_BE
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.Types
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_BE_s
open Vale.Def.Words.Seq_s
// syntax for seq accesses, s.[index] and s.[index] <- value
unfold let (.[]) (#a:Type) (s:seq a) (i:nat{ i < length s}) : Tot a = index s i
unfold let (.[]<-) = Seq.upd
unfold let ( *^ ) = nat32_xor
unfold let ( *^^ ) = quad32_xor
unfold let be_quad32_to_seq (q:quad32) : seq nat32 = four_to_seq_BE q
let quad32_shr32 (q:quad32) : quad32 =
let Mkfour v0 v1 v2 v3 = q in
Mkfour v1 v2 v3 0
let make_AES256_key (k0 k1:quad32) : Pure (seq nat32)
(requires True)
(ensures fun key -> is_aes_key_word AES_256 key) | false | false | Vale.AES.AES256_helpers_BE.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val make_AES256_key (k0 k1: quad32)
: Pure (seq nat32) (requires True) (ensures fun key -> is_aes_key_word AES_256 key) | [] | Vale.AES.AES256_helpers_BE.make_AES256_key | {
"file_name": "vale/code/crypto/aes/Vale.AES.AES256_helpers_BE.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | k0: Vale.Def.Types_s.quad32 -> k1: Vale.Def.Types_s.quad32
-> Prims.Pure (FStar.Seq.Base.seq Vale.Def.Types_s.nat32) | {
"end_col": 52,
"end_line": 29,
"start_col": 2,
"start_line": 29
} |
Prims.Pure | val expand_key_256_def (key: seq nat32) (round: nat)
: Pure quad32 (requires is_aes_key_word AES_256 key) (ensures fun _ -> True) | [
{
"abbrev": false,
"full_module": "Vale.Def.Words.Seq_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_BE_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let rec expand_key_256_def (key:seq nat32) (round:nat) : Pure quad32
(requires is_aes_key_word AES_256 key)
(ensures fun _ -> True)
=
if round = 0 then Mkfour key.[3] key.[2] key.[1] key.[0]
else if round = 1 then Mkfour key.[7] key.[6] key.[5] key.[4]
else round_key_256 (expand_key_256_def key (round - 2)) (expand_key_256_def key (round - 1)) round | val expand_key_256_def (key: seq nat32) (round: nat)
: Pure quad32 (requires is_aes_key_word AES_256 key) (ensures fun _ -> True)
let rec expand_key_256_def (key: seq nat32) (round: nat)
: Pure quad32 (requires is_aes_key_word AES_256 key) (ensures fun _ -> True) = | false | null | false | if round = 0
then Mkfour key.[ 3 ] key.[ 2 ] key.[ 1 ] key.[ 0 ]
else
if round = 1
then Mkfour key.[ 7 ] key.[ 6 ] key.[ 5 ] key.[ 4 ]
else round_key_256 (expand_key_256_def key (round - 2)) (expand_key_256_def key (round - 1)) round | {
"checked_file": "Vale.AES.AES256_helpers_BE.fsti.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.AES_BE_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.AES.AES256_helpers_BE.fsti"
} | [] | [
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.nat32",
"Prims.nat",
"Prims.op_Equality",
"Prims.int",
"Vale.Def.Words_s.Mkfour",
"Vale.AES.AES256_helpers_BE.op_String_Access",
"Prims.bool",
"Vale.AES.AES256_helpers_BE.round_key_256",
"Vale.AES.AES256_helpers_BE.expand_key_256_def",
"Prims.op_Subtraction",
"Vale.Def.Types_s.quad32",
"Vale.AES.AES_BE_s.is_aes_key_word",
"Vale.AES.AES_common_s.AES_256",
"Prims.l_True"
] | [] | module Vale.AES.AES256_helpers_BE
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.Types
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_BE_s
open Vale.Def.Words.Seq_s
// syntax for seq accesses, s.[index] and s.[index] <- value
unfold let (.[]) (#a:Type) (s:seq a) (i:nat{ i < length s}) : Tot a = index s i
unfold let (.[]<-) = Seq.upd
unfold let ( *^ ) = nat32_xor
unfold let ( *^^ ) = quad32_xor
unfold let be_quad32_to_seq (q:quad32) : seq nat32 = four_to_seq_BE q
let quad32_shr32 (q:quad32) : quad32 =
let Mkfour v0 v1 v2 v3 = q in
Mkfour v1 v2 v3 0
let make_AES256_key (k0 k1:quad32) : Pure (seq nat32)
(requires True)
(ensures fun key -> is_aes_key_word AES_256 key)
=
append (be_quad32_to_seq k0) (be_quad32_to_seq k1)
// Redefine key expansion in terms of quad32 values rather than nat32 values,
// then prove both definitions are equivalent.
let round_key_256_rcon (prev0 prev1:quad32) (rcon:nat32) (round:int) : quad32 =
let Mkfour v0 v1 v2 v3 = prev0 in
let Mkfour v7 _ _ _ = prev1 in
let c1 = if round % 2 = 0 then sub_word (rot_word v7) *^ rcon else sub_word v7 in
let w3 = v3 *^ c1 in
let w2 = v2 *^ w3 in
let w1 = v1 *^ w2 in
let w0 = v0 *^ w1 in
Mkfour w0 w1 w2 w3
let round_key_256 (prev0 prev1:quad32) (round:nat) : quad32 =
round_key_256_rcon prev0 prev1 (aes_rcon (round / 2 - 1)) round
let rec expand_key_256_def (key:seq nat32) (round:nat) : Pure quad32
(requires is_aes_key_word AES_256 key)
(ensures fun _ -> True) | false | false | Vale.AES.AES256_helpers_BE.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val expand_key_256_def (key: seq nat32) (round: nat)
: Pure quad32 (requires is_aes_key_word AES_256 key) (ensures fun _ -> True) | [
"recursion"
] | Vale.AES.AES256_helpers_BE.expand_key_256_def | {
"file_name": "vale/code/crypto/aes/Vale.AES.AES256_helpers_BE.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | key: FStar.Seq.Base.seq Vale.Def.Types_s.nat32 -> round: Prims.nat
-> Prims.Pure Vale.Def.Types_s.quad32 | {
"end_col": 100,
"end_line": 53,
"start_col": 2,
"start_line": 51
} |
Prims.GTot | val eval_stack (ptr: int) (s: vale_state) : GTot nat64 | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.X64.Regs",
"short_module": "Regs"
},
{
"abbrev": true,
"full_module": "Vale.X64.Flags",
"short_module": "Flags"
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let eval_stack (ptr:int) (s:vale_state) : GTot nat64 = load_stack64 ptr s.vs_stack | val eval_stack (ptr: int) (s: vale_state) : GTot nat64
let eval_stack (ptr: int) (s: vale_state) : GTot nat64 = | false | null | false | load_stack64 ptr s.vs_stack | {
"checked_file": "Vale.X64.State.fsti.checked",
"dependencies": [
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.State.fsti"
} | [
"sometrivial"
] | [
"Prims.int",
"Vale.X64.State.vale_state",
"Vale.X64.Stack_i.load_stack64",
"Vale.X64.State.__proj__Mkvale_state__item__vs_stack",
"Vale.X64.Memory.nat64"
] | [] | module Vale.X64.State
open FStar.Mul
// This interface should not refer to Machine_Semantics_s
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
module Flags = Vale.X64.Flags
module Regs = Vale.X64.Regs
module Map16 = Vale.Lib.Map16
noeq type vale_state = {
vs_ok: bool;
vs_regs: Regs.t;
vs_flags: Flags.t;
vs_heap: vale_full_heap;
vs_stack: vale_stack;
vs_stackTaint: memtaint;
}
unfold let vs_get_vale_heap (s:vale_state) : vale_heap = get_vale_heap s.vs_heap
[@va_qattr]
unfold let eval_reg (r:reg) (s:vale_state) : t_reg r = Regs.sel r s.vs_regs
[@va_qattr]
unfold let eval_reg_int (r:reg) (s:vale_state) : int = t_reg_to_int r.rf (eval_reg r s)
[@va_qattr]
unfold let eval_flag (f:flag) (s:vale_state) : Flags.flag_val_t = Flags.sel f s.vs_flags
[@va_qattr]
unfold let eval_mem (ptr:int) (s:vale_state) : GTot nat64 = load_mem64 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_mem128 (ptr:int) (s:vale_state) : GTot Vale.Def.Types_s.quad32 = load_mem128 ptr (get_vale_heap s.vs_heap) | false | false | Vale.X64.State.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val eval_stack (ptr: int) (s: vale_state) : GTot nat64 | [] | Vale.X64.State.eval_stack | {
"file_name": "vale/code/arch/x64/Vale.X64.State.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | ptr: Prims.int -> s: Vale.X64.State.vale_state -> Prims.GTot Vale.X64.Memory.nat64 | {
"end_col": 89,
"end_line": 36,
"start_col": 62,
"start_line": 36
} |
Prims.Tot | val eval_reg (r: reg) (s: vale_state) : t_reg r | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.X64.Regs",
"short_module": "Regs"
},
{
"abbrev": true,
"full_module": "Vale.X64.Flags",
"short_module": "Flags"
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let eval_reg (r:reg) (s:vale_state) : t_reg r = Regs.sel r s.vs_regs | val eval_reg (r: reg) (s: vale_state) : t_reg r
let eval_reg (r: reg) (s: vale_state) : t_reg r = | false | null | false | Regs.sel r s.vs_regs | {
"checked_file": "Vale.X64.State.fsti.checked",
"dependencies": [
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.State.fsti"
} | [
"total"
] | [
"Vale.X64.Machine_s.reg",
"Vale.X64.State.vale_state",
"Vale.X64.Regs.sel",
"Vale.X64.State.__proj__Mkvale_state__item__vs_regs",
"Vale.X64.Machine_s.t_reg"
] | [] | module Vale.X64.State
open FStar.Mul
// This interface should not refer to Machine_Semantics_s
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
module Flags = Vale.X64.Flags
module Regs = Vale.X64.Regs
module Map16 = Vale.Lib.Map16
noeq type vale_state = {
vs_ok: bool;
vs_regs: Regs.t;
vs_flags: Flags.t;
vs_heap: vale_full_heap;
vs_stack: vale_stack;
vs_stackTaint: memtaint;
}
unfold let vs_get_vale_heap (s:vale_state) : vale_heap = get_vale_heap s.vs_heap | false | false | Vale.X64.State.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val eval_reg (r: reg) (s: vale_state) : t_reg r | [] | Vale.X64.State.eval_reg | {
"file_name": "vale/code/arch/x64/Vale.X64.State.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | r: Vale.X64.Machine_s.reg -> s: Vale.X64.State.vale_state -> Vale.X64.Machine_s.t_reg r | {
"end_col": 75,
"end_line": 26,
"start_col": 55,
"start_line": 26
} |
Prims.GTot | val eval_mem128 (ptr: int) (s: vale_state) : GTot Vale.Def.Types_s.quad32 | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.X64.Regs",
"short_module": "Regs"
},
{
"abbrev": true,
"full_module": "Vale.X64.Flags",
"short_module": "Flags"
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let eval_mem128 (ptr:int) (s:vale_state) : GTot Vale.Def.Types_s.quad32 = load_mem128 ptr (get_vale_heap s.vs_heap) | val eval_mem128 (ptr: int) (s: vale_state) : GTot Vale.Def.Types_s.quad32
let eval_mem128 (ptr: int) (s: vale_state) : GTot Vale.Def.Types_s.quad32 = | false | null | false | load_mem128 ptr (get_vale_heap s.vs_heap) | {
"checked_file": "Vale.X64.State.fsti.checked",
"dependencies": [
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.State.fsti"
} | [
"sometrivial"
] | [
"Prims.int",
"Vale.X64.State.vale_state",
"Vale.X64.Memory.load_mem128",
"Vale.X64.Memory.get_vale_heap",
"Vale.X64.State.__proj__Mkvale_state__item__vs_heap",
"Vale.Def.Types_s.quad32"
] | [] | module Vale.X64.State
open FStar.Mul
// This interface should not refer to Machine_Semantics_s
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
module Flags = Vale.X64.Flags
module Regs = Vale.X64.Regs
module Map16 = Vale.Lib.Map16
noeq type vale_state = {
vs_ok: bool;
vs_regs: Regs.t;
vs_flags: Flags.t;
vs_heap: vale_full_heap;
vs_stack: vale_stack;
vs_stackTaint: memtaint;
}
unfold let vs_get_vale_heap (s:vale_state) : vale_heap = get_vale_heap s.vs_heap
[@va_qattr]
unfold let eval_reg (r:reg) (s:vale_state) : t_reg r = Regs.sel r s.vs_regs
[@va_qattr]
unfold let eval_reg_int (r:reg) (s:vale_state) : int = t_reg_to_int r.rf (eval_reg r s)
[@va_qattr]
unfold let eval_flag (f:flag) (s:vale_state) : Flags.flag_val_t = Flags.sel f s.vs_flags
[@va_qattr]
unfold let eval_mem (ptr:int) (s:vale_state) : GTot nat64 = load_mem64 ptr (get_vale_heap s.vs_heap) | false | false | Vale.X64.State.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val eval_mem128 (ptr: int) (s: vale_state) : GTot Vale.Def.Types_s.quad32 | [] | Vale.X64.State.eval_mem128 | {
"file_name": "vale/code/arch/x64/Vale.X64.State.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | ptr: Prims.int -> s: Vale.X64.State.vale_state -> Prims.GTot Vale.Def.Types_s.quad32 | {
"end_col": 122,
"end_line": 34,
"start_col": 81,
"start_line": 34
} |
Prims.Tot | val eval_reg_int (r: reg) (s: vale_state) : int | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.X64.Regs",
"short_module": "Regs"
},
{
"abbrev": true,
"full_module": "Vale.X64.Flags",
"short_module": "Flags"
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let eval_reg_int (r:reg) (s:vale_state) : int = t_reg_to_int r.rf (eval_reg r s) | val eval_reg_int (r: reg) (s: vale_state) : int
let eval_reg_int (r: reg) (s: vale_state) : int = | false | null | false | t_reg_to_int r.rf (eval_reg r s) | {
"checked_file": "Vale.X64.State.fsti.checked",
"dependencies": [
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.State.fsti"
} | [
"total"
] | [
"Vale.X64.Machine_s.reg",
"Vale.X64.State.vale_state",
"Vale.X64.Machine_s.t_reg_to_int",
"Vale.X64.Machine_s.__proj__Reg__item__rf",
"Vale.X64.State.eval_reg",
"Prims.int"
] | [] | module Vale.X64.State
open FStar.Mul
// This interface should not refer to Machine_Semantics_s
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
module Flags = Vale.X64.Flags
module Regs = Vale.X64.Regs
module Map16 = Vale.Lib.Map16
noeq type vale_state = {
vs_ok: bool;
vs_regs: Regs.t;
vs_flags: Flags.t;
vs_heap: vale_full_heap;
vs_stack: vale_stack;
vs_stackTaint: memtaint;
}
unfold let vs_get_vale_heap (s:vale_state) : vale_heap = get_vale_heap s.vs_heap
[@va_qattr]
unfold let eval_reg (r:reg) (s:vale_state) : t_reg r = Regs.sel r s.vs_regs | false | true | Vale.X64.State.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val eval_reg_int (r: reg) (s: vale_state) : int | [] | Vale.X64.State.eval_reg_int | {
"file_name": "vale/code/arch/x64/Vale.X64.State.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | r: Vale.X64.Machine_s.reg -> s: Vale.X64.State.vale_state -> Prims.int | {
"end_col": 87,
"end_line": 28,
"start_col": 55,
"start_line": 28
} |
Prims.GTot | val eval_mem (ptr: int) (s: vale_state) : GTot nat64 | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.X64.Regs",
"short_module": "Regs"
},
{
"abbrev": true,
"full_module": "Vale.X64.Flags",
"short_module": "Flags"
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let eval_mem (ptr:int) (s:vale_state) : GTot nat64 = load_mem64 ptr (get_vale_heap s.vs_heap) | val eval_mem (ptr: int) (s: vale_state) : GTot nat64
let eval_mem (ptr: int) (s: vale_state) : GTot nat64 = | false | null | false | load_mem64 ptr (get_vale_heap s.vs_heap) | {
"checked_file": "Vale.X64.State.fsti.checked",
"dependencies": [
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.State.fsti"
} | [
"sometrivial"
] | [
"Prims.int",
"Vale.X64.State.vale_state",
"Vale.X64.Memory.load_mem64",
"Vale.X64.Memory.get_vale_heap",
"Vale.X64.State.__proj__Mkvale_state__item__vs_heap",
"Vale.X64.Memory.nat64"
] | [] | module Vale.X64.State
open FStar.Mul
// This interface should not refer to Machine_Semantics_s
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
module Flags = Vale.X64.Flags
module Regs = Vale.X64.Regs
module Map16 = Vale.Lib.Map16
noeq type vale_state = {
vs_ok: bool;
vs_regs: Regs.t;
vs_flags: Flags.t;
vs_heap: vale_full_heap;
vs_stack: vale_stack;
vs_stackTaint: memtaint;
}
unfold let vs_get_vale_heap (s:vale_state) : vale_heap = get_vale_heap s.vs_heap
[@va_qattr]
unfold let eval_reg (r:reg) (s:vale_state) : t_reg r = Regs.sel r s.vs_regs
[@va_qattr]
unfold let eval_reg_int (r:reg) (s:vale_state) : int = t_reg_to_int r.rf (eval_reg r s)
[@va_qattr]
unfold let eval_flag (f:flag) (s:vale_state) : Flags.flag_val_t = Flags.sel f s.vs_flags | false | false | Vale.X64.State.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val eval_mem (ptr: int) (s: vale_state) : GTot nat64 | [] | Vale.X64.State.eval_mem | {
"file_name": "vale/code/arch/x64/Vale.X64.State.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | ptr: Prims.int -> s: Vale.X64.State.vale_state -> Prims.GTot Vale.X64.Memory.nat64 | {
"end_col": 100,
"end_line": 32,
"start_col": 60,
"start_line": 32
} |
Prims.Tot | val vs_get_vale_heap (s: vale_state) : vale_heap | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.X64.Regs",
"short_module": "Regs"
},
{
"abbrev": true,
"full_module": "Vale.X64.Flags",
"short_module": "Flags"
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let vs_get_vale_heap (s:vale_state) : vale_heap = get_vale_heap s.vs_heap | val vs_get_vale_heap (s: vale_state) : vale_heap
let vs_get_vale_heap (s: vale_state) : vale_heap = | false | null | false | get_vale_heap s.vs_heap | {
"checked_file": "Vale.X64.State.fsti.checked",
"dependencies": [
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.State.fsti"
} | [
"total"
] | [
"Vale.X64.State.vale_state",
"Vale.X64.Memory.get_vale_heap",
"Vale.X64.State.__proj__Mkvale_state__item__vs_heap",
"Vale.X64.Memory.vale_heap"
] | [] | module Vale.X64.State
open FStar.Mul
// This interface should not refer to Machine_Semantics_s
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
module Flags = Vale.X64.Flags
module Regs = Vale.X64.Regs
module Map16 = Vale.Lib.Map16
noeq type vale_state = {
vs_ok: bool;
vs_regs: Regs.t;
vs_flags: Flags.t;
vs_heap: vale_full_heap;
vs_stack: vale_stack;
vs_stackTaint: memtaint;
} | false | true | Vale.X64.State.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val vs_get_vale_heap (s: vale_state) : vale_heap | [] | Vale.X64.State.vs_get_vale_heap | {
"file_name": "vale/code/arch/x64/Vale.X64.State.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | s: Vale.X64.State.vale_state -> Vale.X64.Memory.vale_heap | {
"end_col": 80,
"end_line": 23,
"start_col": 57,
"start_line": 23
} |
Prims.Tot | val eval_flag (f: flag) (s: vale_state) : Flags.flag_val_t | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.X64.Regs",
"short_module": "Regs"
},
{
"abbrev": true,
"full_module": "Vale.X64.Flags",
"short_module": "Flags"
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let eval_flag (f:flag) (s:vale_state) : Flags.flag_val_t = Flags.sel f s.vs_flags | val eval_flag (f: flag) (s: vale_state) : Flags.flag_val_t
let eval_flag (f: flag) (s: vale_state) : Flags.flag_val_t = | false | null | false | Flags.sel f s.vs_flags | {
"checked_file": "Vale.X64.State.fsti.checked",
"dependencies": [
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.State.fsti"
} | [
"total"
] | [
"Vale.X64.Machine_s.flag",
"Vale.X64.State.vale_state",
"Vale.X64.Flags.sel",
"Vale.X64.State.__proj__Mkvale_state__item__vs_flags",
"Vale.X64.Flags.flag_val_t"
] | [] | module Vale.X64.State
open FStar.Mul
// This interface should not refer to Machine_Semantics_s
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
module Flags = Vale.X64.Flags
module Regs = Vale.X64.Regs
module Map16 = Vale.Lib.Map16
noeq type vale_state = {
vs_ok: bool;
vs_regs: Regs.t;
vs_flags: Flags.t;
vs_heap: vale_full_heap;
vs_stack: vale_stack;
vs_stackTaint: memtaint;
}
unfold let vs_get_vale_heap (s:vale_state) : vale_heap = get_vale_heap s.vs_heap
[@va_qattr]
unfold let eval_reg (r:reg) (s:vale_state) : t_reg r = Regs.sel r s.vs_regs
[@va_qattr]
unfold let eval_reg_int (r:reg) (s:vale_state) : int = t_reg_to_int r.rf (eval_reg r s) | false | true | Vale.X64.State.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val eval_flag (f: flag) (s: vale_state) : Flags.flag_val_t | [] | Vale.X64.State.eval_flag | {
"file_name": "vale/code/arch/x64/Vale.X64.State.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | f: Vale.X64.Machine_s.flag -> s: Vale.X64.State.vale_state -> Vale.X64.Flags.flag_val_t | {
"end_col": 88,
"end_line": 30,
"start_col": 66,
"start_line": 30
} |
Prims.GTot | val update_stack64 (ptr: int) (v: nat64) (s: vale_state) : GTot vale_state | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.X64.Regs",
"short_module": "Regs"
},
{
"abbrev": true,
"full_module": "Vale.X64.Flags",
"short_module": "Flags"
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let update_stack64 (ptr:int) (v:nat64) (s:vale_state) : GTot vale_state =
{s with vs_stack = store_stack64 ptr v s.vs_stack} | val update_stack64 (ptr: int) (v: nat64) (s: vale_state) : GTot vale_state
let update_stack64 (ptr: int) (v: nat64) (s: vale_state) : GTot vale_state = | false | null | false | { s with vs_stack = store_stack64 ptr v s.vs_stack } | {
"checked_file": "Vale.X64.State.fsti.checked",
"dependencies": [
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.State.fsti"
} | [
"sometrivial"
] | [
"Prims.int",
"Vale.X64.Memory.nat64",
"Vale.X64.State.vale_state",
"Vale.X64.State.Mkvale_state",
"Vale.X64.State.__proj__Mkvale_state__item__vs_ok",
"Vale.X64.State.__proj__Mkvale_state__item__vs_regs",
"Vale.X64.State.__proj__Mkvale_state__item__vs_flags",
"Vale.X64.State.__proj__Mkvale_state__item__vs_heap",
"Vale.X64.Stack_i.store_stack64",
"Vale.X64.State.__proj__Mkvale_state__item__vs_stack",
"Vale.X64.State.__proj__Mkvale_state__item__vs_stackTaint"
] | [] | module Vale.X64.State
open FStar.Mul
// This interface should not refer to Machine_Semantics_s
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
module Flags = Vale.X64.Flags
module Regs = Vale.X64.Regs
module Map16 = Vale.Lib.Map16
noeq type vale_state = {
vs_ok: bool;
vs_regs: Regs.t;
vs_flags: Flags.t;
vs_heap: vale_full_heap;
vs_stack: vale_stack;
vs_stackTaint: memtaint;
}
unfold let vs_get_vale_heap (s:vale_state) : vale_heap = get_vale_heap s.vs_heap
[@va_qattr]
unfold let eval_reg (r:reg) (s:vale_state) : t_reg r = Regs.sel r s.vs_regs
[@va_qattr]
unfold let eval_reg_int (r:reg) (s:vale_state) : int = t_reg_to_int r.rf (eval_reg r s)
[@va_qattr]
unfold let eval_flag (f:flag) (s:vale_state) : Flags.flag_val_t = Flags.sel f s.vs_flags
[@va_qattr]
unfold let eval_mem (ptr:int) (s:vale_state) : GTot nat64 = load_mem64 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_mem128 (ptr:int) (s:vale_state) : GTot Vale.Def.Types_s.quad32 = load_mem128 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_stack (ptr:int) (s:vale_state) : GTot nat64 = load_stack64 ptr s.vs_stack
[@va_qattr]
unfold let eval_stack128 (ptr:int) (s:vale_state) : GTot quad32 = load_stack128 ptr s.vs_stack
[@va_qattr]
unfold let eval_reg_64 (r:reg_64) (s:vale_state) : nat64 = eval_reg (Reg 0 r) s
[@va_qattr]
unfold let eval_reg_xmm (r:reg_xmm) (s:vale_state) : quad32 = eval_reg (Reg 1 r) s
[@va_qattr]
let eval_maddr (m:maddr) (s:vale_state) : int =
match m with
| MConst n -> n
| MReg r offset -> eval_reg_int r s + offset
| MIndex base scale index offset -> eval_reg_int base s + scale * (eval_reg_int index s) + offset
[@va_qattr]
let eval_operand (o:operand64) (s:vale_state) : GTot nat64 =
match o with
| OConst n -> n
| OReg r -> eval_reg_64 r s
| OMem (m, _) -> eval_mem (eval_maddr m s) s
| OStack (m, _) -> eval_stack (eval_maddr m s) s
[@va_qattr]
let eval_operand128 (o:operand128) (s:vale_state) : GTot Vale.Def.Types_s.quad32 =
match o with
| OConst c -> c
| OReg r -> eval_reg_xmm r s
| OMem (m, _) -> eval_mem128 (eval_maddr m s) s
| OStack (m, _) -> eval_stack128 (eval_maddr m s) s
[@va_qattr]
let update_reg (r:reg) (v:t_reg r) (s:vale_state) : vale_state =
{s with vs_regs = Regs.upd r v s.vs_regs}
[@va_qattr]
let update_reg_64 (r:reg_64) (v:nat64) (s:vale_state) : vale_state =
update_reg (Reg 0 r) v s
[@va_qattr]
let update_flag (f:flag) (v:Flags.flag_val_t) (s:vale_state) : vale_state =
{s with vs_flags = Flags.upd f v s.vs_flags}
[@va_qattr]
let update_reg_xmm (r:reg_xmm) (v:quad32) (s:vale_state) : vale_state =
update_reg (Reg 1 r) v s
//[@va_qattr]
//let update_mem (ptr:int) (v:nat64) (s:vale_state) : GTot vale_state =
// {s with vs_heap = set_vale_heap s.vs_heap (store_mem64 ptr v (get_vale_heap s.vs_heap))}
[@va_qattr] | false | false | Vale.X64.State.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val update_stack64 (ptr: int) (v: nat64) (s: vale_state) : GTot vale_state | [] | Vale.X64.State.update_stack64 | {
"file_name": "vale/code/arch/x64/Vale.X64.State.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | ptr: Prims.int -> v: Vale.X64.Memory.nat64 -> s: Vale.X64.State.vale_state
-> Prims.GTot Vale.X64.State.vale_state | {
"end_col": 51,
"end_line": 91,
"start_col": 3,
"start_line": 91
} |
Prims.Tot | val update_reg (r: reg) (v: t_reg r) (s: vale_state) : vale_state | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.X64.Regs",
"short_module": "Regs"
},
{
"abbrev": true,
"full_module": "Vale.X64.Flags",
"short_module": "Flags"
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let update_reg (r:reg) (v:t_reg r) (s:vale_state) : vale_state =
{s with vs_regs = Regs.upd r v s.vs_regs} | val update_reg (r: reg) (v: t_reg r) (s: vale_state) : vale_state
let update_reg (r: reg) (v: t_reg r) (s: vale_state) : vale_state = | false | null | false | { s with vs_regs = Regs.upd r v s.vs_regs } | {
"checked_file": "Vale.X64.State.fsti.checked",
"dependencies": [
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.State.fsti"
} | [
"total"
] | [
"Vale.X64.Machine_s.reg",
"Vale.X64.Machine_s.t_reg",
"Vale.X64.State.vale_state",
"Vale.X64.State.Mkvale_state",
"Vale.X64.State.__proj__Mkvale_state__item__vs_ok",
"Vale.X64.Regs.upd",
"Vale.X64.State.__proj__Mkvale_state__item__vs_regs",
"Vale.X64.State.__proj__Mkvale_state__item__vs_flags",
"Vale.X64.State.__proj__Mkvale_state__item__vs_heap",
"Vale.X64.State.__proj__Mkvale_state__item__vs_stack",
"Vale.X64.State.__proj__Mkvale_state__item__vs_stackTaint"
] | [] | module Vale.X64.State
open FStar.Mul
// This interface should not refer to Machine_Semantics_s
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
module Flags = Vale.X64.Flags
module Regs = Vale.X64.Regs
module Map16 = Vale.Lib.Map16
noeq type vale_state = {
vs_ok: bool;
vs_regs: Regs.t;
vs_flags: Flags.t;
vs_heap: vale_full_heap;
vs_stack: vale_stack;
vs_stackTaint: memtaint;
}
unfold let vs_get_vale_heap (s:vale_state) : vale_heap = get_vale_heap s.vs_heap
[@va_qattr]
unfold let eval_reg (r:reg) (s:vale_state) : t_reg r = Regs.sel r s.vs_regs
[@va_qattr]
unfold let eval_reg_int (r:reg) (s:vale_state) : int = t_reg_to_int r.rf (eval_reg r s)
[@va_qattr]
unfold let eval_flag (f:flag) (s:vale_state) : Flags.flag_val_t = Flags.sel f s.vs_flags
[@va_qattr]
unfold let eval_mem (ptr:int) (s:vale_state) : GTot nat64 = load_mem64 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_mem128 (ptr:int) (s:vale_state) : GTot Vale.Def.Types_s.quad32 = load_mem128 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_stack (ptr:int) (s:vale_state) : GTot nat64 = load_stack64 ptr s.vs_stack
[@va_qattr]
unfold let eval_stack128 (ptr:int) (s:vale_state) : GTot quad32 = load_stack128 ptr s.vs_stack
[@va_qattr]
unfold let eval_reg_64 (r:reg_64) (s:vale_state) : nat64 = eval_reg (Reg 0 r) s
[@va_qattr]
unfold let eval_reg_xmm (r:reg_xmm) (s:vale_state) : quad32 = eval_reg (Reg 1 r) s
[@va_qattr]
let eval_maddr (m:maddr) (s:vale_state) : int =
match m with
| MConst n -> n
| MReg r offset -> eval_reg_int r s + offset
| MIndex base scale index offset -> eval_reg_int base s + scale * (eval_reg_int index s) + offset
[@va_qattr]
let eval_operand (o:operand64) (s:vale_state) : GTot nat64 =
match o with
| OConst n -> n
| OReg r -> eval_reg_64 r s
| OMem (m, _) -> eval_mem (eval_maddr m s) s
| OStack (m, _) -> eval_stack (eval_maddr m s) s
[@va_qattr]
let eval_operand128 (o:operand128) (s:vale_state) : GTot Vale.Def.Types_s.quad32 =
match o with
| OConst c -> c
| OReg r -> eval_reg_xmm r s
| OMem (m, _) -> eval_mem128 (eval_maddr m s) s
| OStack (m, _) -> eval_stack128 (eval_maddr m s) s
[@va_qattr] | false | false | Vale.X64.State.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val update_reg (r: reg) (v: t_reg r) (s: vale_state) : vale_state | [] | Vale.X64.State.update_reg | {
"file_name": "vale/code/arch/x64/Vale.X64.State.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | r: Vale.X64.Machine_s.reg -> v: Vale.X64.Machine_s.t_reg r -> s: Vale.X64.State.vale_state
-> Vale.X64.State.vale_state | {
"end_col": 42,
"end_line": 71,
"start_col": 3,
"start_line": 71
} |
Prims.Tot | val valid_maddr (m: maddr) (s: vale_state) : prop0 | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.X64.Regs",
"short_module": "Regs"
},
{
"abbrev": true,
"full_module": "Vale.X64.Flags",
"short_module": "Flags"
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let valid_maddr (m:maddr) (s:vale_state) : prop0 =
valid_mem64 (eval_maddr m s) (get_vale_heap s.vs_heap) | val valid_maddr (m: maddr) (s: vale_state) : prop0
let valid_maddr (m: maddr) (s: vale_state) : prop0 = | false | null | false | valid_mem64 (eval_maddr m s) (get_vale_heap s.vs_heap) | {
"checked_file": "Vale.X64.State.fsti.checked",
"dependencies": [
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.State.fsti"
} | [
"total"
] | [
"Vale.X64.Machine_s.maddr",
"Vale.X64.State.vale_state",
"Prims.b2t",
"Vale.X64.Memory.valid_mem64",
"Vale.X64.State.eval_maddr",
"Vale.X64.Memory.get_vale_heap",
"Vale.X64.State.__proj__Mkvale_state__item__vs_heap",
"Vale.Def.Prop_s.prop0"
] | [] | module Vale.X64.State
open FStar.Mul
// This interface should not refer to Machine_Semantics_s
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
module Flags = Vale.X64.Flags
module Regs = Vale.X64.Regs
module Map16 = Vale.Lib.Map16
noeq type vale_state = {
vs_ok: bool;
vs_regs: Regs.t;
vs_flags: Flags.t;
vs_heap: vale_full_heap;
vs_stack: vale_stack;
vs_stackTaint: memtaint;
}
unfold let vs_get_vale_heap (s:vale_state) : vale_heap = get_vale_heap s.vs_heap
[@va_qattr]
unfold let eval_reg (r:reg) (s:vale_state) : t_reg r = Regs.sel r s.vs_regs
[@va_qattr]
unfold let eval_reg_int (r:reg) (s:vale_state) : int = t_reg_to_int r.rf (eval_reg r s)
[@va_qattr]
unfold let eval_flag (f:flag) (s:vale_state) : Flags.flag_val_t = Flags.sel f s.vs_flags
[@va_qattr]
unfold let eval_mem (ptr:int) (s:vale_state) : GTot nat64 = load_mem64 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_mem128 (ptr:int) (s:vale_state) : GTot Vale.Def.Types_s.quad32 = load_mem128 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_stack (ptr:int) (s:vale_state) : GTot nat64 = load_stack64 ptr s.vs_stack
[@va_qattr]
unfold let eval_stack128 (ptr:int) (s:vale_state) : GTot quad32 = load_stack128 ptr s.vs_stack
[@va_qattr]
unfold let eval_reg_64 (r:reg_64) (s:vale_state) : nat64 = eval_reg (Reg 0 r) s
[@va_qattr]
unfold let eval_reg_xmm (r:reg_xmm) (s:vale_state) : quad32 = eval_reg (Reg 1 r) s
[@va_qattr]
let eval_maddr (m:maddr) (s:vale_state) : int =
match m with
| MConst n -> n
| MReg r offset -> eval_reg_int r s + offset
| MIndex base scale index offset -> eval_reg_int base s + scale * (eval_reg_int index s) + offset
[@va_qattr]
let eval_operand (o:operand64) (s:vale_state) : GTot nat64 =
match o with
| OConst n -> n
| OReg r -> eval_reg_64 r s
| OMem (m, _) -> eval_mem (eval_maddr m s) s
| OStack (m, _) -> eval_stack (eval_maddr m s) s
[@va_qattr]
let eval_operand128 (o:operand128) (s:vale_state) : GTot Vale.Def.Types_s.quad32 =
match o with
| OConst c -> c
| OReg r -> eval_reg_xmm r s
| OMem (m, _) -> eval_mem128 (eval_maddr m s) s
| OStack (m, _) -> eval_stack128 (eval_maddr m s) s
[@va_qattr]
let update_reg (r:reg) (v:t_reg r) (s:vale_state) : vale_state =
{s with vs_regs = Regs.upd r v s.vs_regs}
[@va_qattr]
let update_reg_64 (r:reg_64) (v:nat64) (s:vale_state) : vale_state =
update_reg (Reg 0 r) v s
[@va_qattr]
let update_flag (f:flag) (v:Flags.flag_val_t) (s:vale_state) : vale_state =
{s with vs_flags = Flags.upd f v s.vs_flags}
[@va_qattr]
let update_reg_xmm (r:reg_xmm) (v:quad32) (s:vale_state) : vale_state =
update_reg (Reg 1 r) v s
//[@va_qattr]
//let update_mem (ptr:int) (v:nat64) (s:vale_state) : GTot vale_state =
// {s with vs_heap = set_vale_heap s.vs_heap (store_mem64 ptr v (get_vale_heap s.vs_heap))}
[@va_qattr]
let update_stack64 (ptr:int) (v:nat64) (s:vale_state) : GTot vale_state =
{s with vs_stack = store_stack64 ptr v s.vs_stack}
//[@va_qattr]
//let update_operand64 (o:operand64) (v:nat64) (sM:vale_state) : GTot vale_state =
// match o with
// | OConst n -> sM
// | OReg r -> update_reg (Reg 0 r) v sM
// | OMem (m, _) -> update_mem (eval_maddr m sM) v sM
// | OStack (m, _) -> update_stack64 (eval_maddr m sM) v sM
[@va_qattr] | false | true | Vale.X64.State.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val valid_maddr (m: maddr) (s: vale_state) : prop0 | [] | Vale.X64.State.valid_maddr | {
"file_name": "vale/code/arch/x64/Vale.X64.State.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | m: Vale.X64.Machine_s.maddr -> s: Vale.X64.State.vale_state -> Vale.Def.Prop_s.prop0 | {
"end_col": 56,
"end_line": 103,
"start_col": 2,
"start_line": 103
} |
Prims.Tot | val update_flag (f: flag) (v: Flags.flag_val_t) (s: vale_state) : vale_state | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.X64.Regs",
"short_module": "Regs"
},
{
"abbrev": true,
"full_module": "Vale.X64.Flags",
"short_module": "Flags"
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let update_flag (f:flag) (v:Flags.flag_val_t) (s:vale_state) : vale_state =
{s with vs_flags = Flags.upd f v s.vs_flags} | val update_flag (f: flag) (v: Flags.flag_val_t) (s: vale_state) : vale_state
let update_flag (f: flag) (v: Flags.flag_val_t) (s: vale_state) : vale_state = | false | null | false | { s with vs_flags = Flags.upd f v s.vs_flags } | {
"checked_file": "Vale.X64.State.fsti.checked",
"dependencies": [
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.State.fsti"
} | [
"total"
] | [
"Vale.X64.Machine_s.flag",
"Vale.X64.Flags.flag_val_t",
"Vale.X64.State.vale_state",
"Vale.X64.State.Mkvale_state",
"Vale.X64.State.__proj__Mkvale_state__item__vs_ok",
"Vale.X64.State.__proj__Mkvale_state__item__vs_regs",
"Vale.X64.Flags.upd",
"Vale.X64.State.__proj__Mkvale_state__item__vs_flags",
"Vale.X64.State.__proj__Mkvale_state__item__vs_heap",
"Vale.X64.State.__proj__Mkvale_state__item__vs_stack",
"Vale.X64.State.__proj__Mkvale_state__item__vs_stackTaint"
] | [] | module Vale.X64.State
open FStar.Mul
// This interface should not refer to Machine_Semantics_s
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
module Flags = Vale.X64.Flags
module Regs = Vale.X64.Regs
module Map16 = Vale.Lib.Map16
noeq type vale_state = {
vs_ok: bool;
vs_regs: Regs.t;
vs_flags: Flags.t;
vs_heap: vale_full_heap;
vs_stack: vale_stack;
vs_stackTaint: memtaint;
}
unfold let vs_get_vale_heap (s:vale_state) : vale_heap = get_vale_heap s.vs_heap
[@va_qattr]
unfold let eval_reg (r:reg) (s:vale_state) : t_reg r = Regs.sel r s.vs_regs
[@va_qattr]
unfold let eval_reg_int (r:reg) (s:vale_state) : int = t_reg_to_int r.rf (eval_reg r s)
[@va_qattr]
unfold let eval_flag (f:flag) (s:vale_state) : Flags.flag_val_t = Flags.sel f s.vs_flags
[@va_qattr]
unfold let eval_mem (ptr:int) (s:vale_state) : GTot nat64 = load_mem64 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_mem128 (ptr:int) (s:vale_state) : GTot Vale.Def.Types_s.quad32 = load_mem128 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_stack (ptr:int) (s:vale_state) : GTot nat64 = load_stack64 ptr s.vs_stack
[@va_qattr]
unfold let eval_stack128 (ptr:int) (s:vale_state) : GTot quad32 = load_stack128 ptr s.vs_stack
[@va_qattr]
unfold let eval_reg_64 (r:reg_64) (s:vale_state) : nat64 = eval_reg (Reg 0 r) s
[@va_qattr]
unfold let eval_reg_xmm (r:reg_xmm) (s:vale_state) : quad32 = eval_reg (Reg 1 r) s
[@va_qattr]
let eval_maddr (m:maddr) (s:vale_state) : int =
match m with
| MConst n -> n
| MReg r offset -> eval_reg_int r s + offset
| MIndex base scale index offset -> eval_reg_int base s + scale * (eval_reg_int index s) + offset
[@va_qattr]
let eval_operand (o:operand64) (s:vale_state) : GTot nat64 =
match o with
| OConst n -> n
| OReg r -> eval_reg_64 r s
| OMem (m, _) -> eval_mem (eval_maddr m s) s
| OStack (m, _) -> eval_stack (eval_maddr m s) s
[@va_qattr]
let eval_operand128 (o:operand128) (s:vale_state) : GTot Vale.Def.Types_s.quad32 =
match o with
| OConst c -> c
| OReg r -> eval_reg_xmm r s
| OMem (m, _) -> eval_mem128 (eval_maddr m s) s
| OStack (m, _) -> eval_stack128 (eval_maddr m s) s
[@va_qattr]
let update_reg (r:reg) (v:t_reg r) (s:vale_state) : vale_state =
{s with vs_regs = Regs.upd r v s.vs_regs}
[@va_qattr]
let update_reg_64 (r:reg_64) (v:nat64) (s:vale_state) : vale_state =
update_reg (Reg 0 r) v s
[@va_qattr] | false | true | Vale.X64.State.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val update_flag (f: flag) (v: Flags.flag_val_t) (s: vale_state) : vale_state | [] | Vale.X64.State.update_flag | {
"file_name": "vale/code/arch/x64/Vale.X64.State.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | f: Vale.X64.Machine_s.flag -> v: Vale.X64.Flags.flag_val_t -> s: Vale.X64.State.vale_state
-> Vale.X64.State.vale_state | {
"end_col": 45,
"end_line": 79,
"start_col": 3,
"start_line": 79
} |
Prims.Tot | val valid_maddr128 (m: maddr) (s: vale_state) : prop0 | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.X64.Regs",
"short_module": "Regs"
},
{
"abbrev": true,
"full_module": "Vale.X64.Flags",
"short_module": "Flags"
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let valid_maddr128 (m:maddr) (s:vale_state) : prop0 =
valid_mem128 (eval_maddr m s) (get_vale_heap s.vs_heap) | val valid_maddr128 (m: maddr) (s: vale_state) : prop0
let valid_maddr128 (m: maddr) (s: vale_state) : prop0 = | false | null | false | valid_mem128 (eval_maddr m s) (get_vale_heap s.vs_heap) | {
"checked_file": "Vale.X64.State.fsti.checked",
"dependencies": [
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.State.fsti"
} | [
"total"
] | [
"Vale.X64.Machine_s.maddr",
"Vale.X64.State.vale_state",
"Prims.b2t",
"Vale.X64.Memory.valid_mem128",
"Vale.X64.State.eval_maddr",
"Vale.X64.Memory.get_vale_heap",
"Vale.X64.State.__proj__Mkvale_state__item__vs_heap",
"Vale.Def.Prop_s.prop0"
] | [] | module Vale.X64.State
open FStar.Mul
// This interface should not refer to Machine_Semantics_s
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
module Flags = Vale.X64.Flags
module Regs = Vale.X64.Regs
module Map16 = Vale.Lib.Map16
noeq type vale_state = {
vs_ok: bool;
vs_regs: Regs.t;
vs_flags: Flags.t;
vs_heap: vale_full_heap;
vs_stack: vale_stack;
vs_stackTaint: memtaint;
}
unfold let vs_get_vale_heap (s:vale_state) : vale_heap = get_vale_heap s.vs_heap
[@va_qattr]
unfold let eval_reg (r:reg) (s:vale_state) : t_reg r = Regs.sel r s.vs_regs
[@va_qattr]
unfold let eval_reg_int (r:reg) (s:vale_state) : int = t_reg_to_int r.rf (eval_reg r s)
[@va_qattr]
unfold let eval_flag (f:flag) (s:vale_state) : Flags.flag_val_t = Flags.sel f s.vs_flags
[@va_qattr]
unfold let eval_mem (ptr:int) (s:vale_state) : GTot nat64 = load_mem64 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_mem128 (ptr:int) (s:vale_state) : GTot Vale.Def.Types_s.quad32 = load_mem128 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_stack (ptr:int) (s:vale_state) : GTot nat64 = load_stack64 ptr s.vs_stack
[@va_qattr]
unfold let eval_stack128 (ptr:int) (s:vale_state) : GTot quad32 = load_stack128 ptr s.vs_stack
[@va_qattr]
unfold let eval_reg_64 (r:reg_64) (s:vale_state) : nat64 = eval_reg (Reg 0 r) s
[@va_qattr]
unfold let eval_reg_xmm (r:reg_xmm) (s:vale_state) : quad32 = eval_reg (Reg 1 r) s
[@va_qattr]
let eval_maddr (m:maddr) (s:vale_state) : int =
match m with
| MConst n -> n
| MReg r offset -> eval_reg_int r s + offset
| MIndex base scale index offset -> eval_reg_int base s + scale * (eval_reg_int index s) + offset
[@va_qattr]
let eval_operand (o:operand64) (s:vale_state) : GTot nat64 =
match o with
| OConst n -> n
| OReg r -> eval_reg_64 r s
| OMem (m, _) -> eval_mem (eval_maddr m s) s
| OStack (m, _) -> eval_stack (eval_maddr m s) s
[@va_qattr]
let eval_operand128 (o:operand128) (s:vale_state) : GTot Vale.Def.Types_s.quad32 =
match o with
| OConst c -> c
| OReg r -> eval_reg_xmm r s
| OMem (m, _) -> eval_mem128 (eval_maddr m s) s
| OStack (m, _) -> eval_stack128 (eval_maddr m s) s
[@va_qattr]
let update_reg (r:reg) (v:t_reg r) (s:vale_state) : vale_state =
{s with vs_regs = Regs.upd r v s.vs_regs}
[@va_qattr]
let update_reg_64 (r:reg_64) (v:nat64) (s:vale_state) : vale_state =
update_reg (Reg 0 r) v s
[@va_qattr]
let update_flag (f:flag) (v:Flags.flag_val_t) (s:vale_state) : vale_state =
{s with vs_flags = Flags.upd f v s.vs_flags}
[@va_qattr]
let update_reg_xmm (r:reg_xmm) (v:quad32) (s:vale_state) : vale_state =
update_reg (Reg 1 r) v s
//[@va_qattr]
//let update_mem (ptr:int) (v:nat64) (s:vale_state) : GTot vale_state =
// {s with vs_heap = set_vale_heap s.vs_heap (store_mem64 ptr v (get_vale_heap s.vs_heap))}
[@va_qattr]
let update_stack64 (ptr:int) (v:nat64) (s:vale_state) : GTot vale_state =
{s with vs_stack = store_stack64 ptr v s.vs_stack}
//[@va_qattr]
//let update_operand64 (o:operand64) (v:nat64) (sM:vale_state) : GTot vale_state =
// match o with
// | OConst n -> sM
// | OReg r -> update_reg (Reg 0 r) v sM
// | OMem (m, _) -> update_mem (eval_maddr m sM) v sM
// | OStack (m, _) -> update_stack64 (eval_maddr m sM) v sM
[@va_qattr]
let valid_maddr (m:maddr) (s:vale_state) : prop0 =
valid_mem64 (eval_maddr m s) (get_vale_heap s.vs_heap)
[@va_qattr] | false | true | Vale.X64.State.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val valid_maddr128 (m: maddr) (s: vale_state) : prop0 | [] | Vale.X64.State.valid_maddr128 | {
"file_name": "vale/code/arch/x64/Vale.X64.State.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | m: Vale.X64.Machine_s.maddr -> s: Vale.X64.State.vale_state -> Vale.Def.Prop_s.prop0 | {
"end_col": 57,
"end_line": 107,
"start_col": 2,
"start_line": 107
} |
Prims.Tot | val state_eta (s: vale_state) : vale_state | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.X64.Regs",
"short_module": "Regs"
},
{
"abbrev": true,
"full_module": "Vale.X64.Flags",
"short_module": "Flags"
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let state_eta (s:vale_state) : vale_state =
{s with
vs_regs = Regs.eta s.vs_regs;
vs_heap = {s.vs_heap with vf_heaplets = Map16.eta s.vs_heap.vf_heaplets};
} | val state_eta (s: vale_state) : vale_state
let state_eta (s: vale_state) : vale_state = | false | null | false | {
s with
vs_regs = Regs.eta s.vs_regs;
vs_heap = { s.vs_heap with vf_heaplets = Map16.eta s.vs_heap.vf_heaplets }
} | {
"checked_file": "Vale.X64.State.fsti.checked",
"dependencies": [
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.State.fsti"
} | [
"total"
] | [
"Vale.X64.State.vale_state",
"Vale.X64.State.Mkvale_state",
"Vale.X64.State.__proj__Mkvale_state__item__vs_ok",
"Vale.X64.Regs.eta",
"Vale.X64.State.__proj__Mkvale_state__item__vs_regs",
"Vale.X64.State.__proj__Mkvale_state__item__vs_flags",
"Vale.Arch.HeapImpl.Mkvale_full_heap",
"Vale.Arch.HeapImpl.__proj__Mkvale_full_heap__item__vf_layout",
"Vale.Arch.HeapImpl.__proj__Mkvale_full_heap__item__vf_heap",
"Vale.Lib.Map16.eta",
"Vale.Arch.HeapImpl.vale_heap",
"Vale.Arch.HeapImpl.__proj__Mkvale_full_heap__item__vf_heaplets",
"Vale.X64.State.__proj__Mkvale_state__item__vs_heap",
"Vale.Arch.HeapImpl.vale_full_heap",
"Vale.X64.State.__proj__Mkvale_state__item__vs_stack",
"Vale.X64.State.__proj__Mkvale_state__item__vs_stackTaint"
] | [] | module Vale.X64.State
open FStar.Mul
// This interface should not refer to Machine_Semantics_s
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
module Flags = Vale.X64.Flags
module Regs = Vale.X64.Regs
module Map16 = Vale.Lib.Map16
noeq type vale_state = {
vs_ok: bool;
vs_regs: Regs.t;
vs_flags: Flags.t;
vs_heap: vale_full_heap;
vs_stack: vale_stack;
vs_stackTaint: memtaint;
}
unfold let vs_get_vale_heap (s:vale_state) : vale_heap = get_vale_heap s.vs_heap
[@va_qattr]
unfold let eval_reg (r:reg) (s:vale_state) : t_reg r = Regs.sel r s.vs_regs
[@va_qattr]
unfold let eval_reg_int (r:reg) (s:vale_state) : int = t_reg_to_int r.rf (eval_reg r s)
[@va_qattr]
unfold let eval_flag (f:flag) (s:vale_state) : Flags.flag_val_t = Flags.sel f s.vs_flags
[@va_qattr]
unfold let eval_mem (ptr:int) (s:vale_state) : GTot nat64 = load_mem64 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_mem128 (ptr:int) (s:vale_state) : GTot Vale.Def.Types_s.quad32 = load_mem128 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_stack (ptr:int) (s:vale_state) : GTot nat64 = load_stack64 ptr s.vs_stack
[@va_qattr]
unfold let eval_stack128 (ptr:int) (s:vale_state) : GTot quad32 = load_stack128 ptr s.vs_stack
[@va_qattr]
unfold let eval_reg_64 (r:reg_64) (s:vale_state) : nat64 = eval_reg (Reg 0 r) s
[@va_qattr]
unfold let eval_reg_xmm (r:reg_xmm) (s:vale_state) : quad32 = eval_reg (Reg 1 r) s
[@va_qattr]
let eval_maddr (m:maddr) (s:vale_state) : int =
match m with
| MConst n -> n
| MReg r offset -> eval_reg_int r s + offset
| MIndex base scale index offset -> eval_reg_int base s + scale * (eval_reg_int index s) + offset
[@va_qattr]
let eval_operand (o:operand64) (s:vale_state) : GTot nat64 =
match o with
| OConst n -> n
| OReg r -> eval_reg_64 r s
| OMem (m, _) -> eval_mem (eval_maddr m s) s
| OStack (m, _) -> eval_stack (eval_maddr m s) s
[@va_qattr]
let eval_operand128 (o:operand128) (s:vale_state) : GTot Vale.Def.Types_s.quad32 =
match o with
| OConst c -> c
| OReg r -> eval_reg_xmm r s
| OMem (m, _) -> eval_mem128 (eval_maddr m s) s
| OStack (m, _) -> eval_stack128 (eval_maddr m s) s
[@va_qattr]
let update_reg (r:reg) (v:t_reg r) (s:vale_state) : vale_state =
{s with vs_regs = Regs.upd r v s.vs_regs}
[@va_qattr]
let update_reg_64 (r:reg_64) (v:nat64) (s:vale_state) : vale_state =
update_reg (Reg 0 r) v s
[@va_qattr]
let update_flag (f:flag) (v:Flags.flag_val_t) (s:vale_state) : vale_state =
{s with vs_flags = Flags.upd f v s.vs_flags}
[@va_qattr]
let update_reg_xmm (r:reg_xmm) (v:quad32) (s:vale_state) : vale_state =
update_reg (Reg 1 r) v s
//[@va_qattr]
//let update_mem (ptr:int) (v:nat64) (s:vale_state) : GTot vale_state =
// {s with vs_heap = set_vale_heap s.vs_heap (store_mem64 ptr v (get_vale_heap s.vs_heap))}
[@va_qattr]
let update_stack64 (ptr:int) (v:nat64) (s:vale_state) : GTot vale_state =
{s with vs_stack = store_stack64 ptr v s.vs_stack}
//[@va_qattr]
//let update_operand64 (o:operand64) (v:nat64) (sM:vale_state) : GTot vale_state =
// match o with
// | OConst n -> sM
// | OReg r -> update_reg (Reg 0 r) v sM
// | OMem (m, _) -> update_mem (eval_maddr m sM) v sM
// | OStack (m, _) -> update_stack64 (eval_maddr m sM) v sM
[@va_qattr]
let valid_maddr (m:maddr) (s:vale_state) : prop0 =
valid_mem64 (eval_maddr m s) (get_vale_heap s.vs_heap)
[@va_qattr]
let valid_maddr128 (m:maddr) (s:vale_state) : prop0 =
valid_mem128 (eval_maddr m s) (get_vale_heap s.vs_heap)
[@va_qattr]
let valid_src_operand (o:operand64) (s:vale_state) : prop0 =
match o with
| OConst c -> True
| OReg r -> True
| OMem (m, _) -> valid_maddr m s
| OStack (m, _) -> valid_src_stack64 (eval_maddr m s) s.vs_stack
[@va_qattr]
let valid_src_operand128 (o:operand128) (s:vale_state) : prop0 =
match o with
| OConst _ -> False
| OReg _ -> True
| OMem (m, _) -> valid_maddr128 m s
| OStack (m, _) -> valid_src_stack128 (eval_maddr m s) s.vs_stack
[@va_qattr] | false | true | Vale.X64.State.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val state_eta (s: vale_state) : vale_state | [] | Vale.X64.State.state_eta | {
"file_name": "vale/code/arch/x64/Vale.X64.State.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | s: Vale.X64.State.vale_state -> Vale.X64.State.vale_state | {
"end_col": 77,
"end_line": 129,
"start_col": 3,
"start_line": 127
} |
Prims.GTot | val eval_stack128 (ptr: int) (s: vale_state) : GTot quad32 | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.X64.Regs",
"short_module": "Regs"
},
{
"abbrev": true,
"full_module": "Vale.X64.Flags",
"short_module": "Flags"
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let eval_stack128 (ptr:int) (s:vale_state) : GTot quad32 = load_stack128 ptr s.vs_stack | val eval_stack128 (ptr: int) (s: vale_state) : GTot quad32
let eval_stack128 (ptr: int) (s: vale_state) : GTot quad32 = | false | null | false | load_stack128 ptr s.vs_stack | {
"checked_file": "Vale.X64.State.fsti.checked",
"dependencies": [
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.State.fsti"
} | [
"sometrivial"
] | [
"Prims.int",
"Vale.X64.State.vale_state",
"Vale.X64.Stack_i.load_stack128",
"Vale.X64.State.__proj__Mkvale_state__item__vs_stack",
"Vale.X64.Memory.quad32"
] | [] | module Vale.X64.State
open FStar.Mul
// This interface should not refer to Machine_Semantics_s
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
module Flags = Vale.X64.Flags
module Regs = Vale.X64.Regs
module Map16 = Vale.Lib.Map16
noeq type vale_state = {
vs_ok: bool;
vs_regs: Regs.t;
vs_flags: Flags.t;
vs_heap: vale_full_heap;
vs_stack: vale_stack;
vs_stackTaint: memtaint;
}
unfold let vs_get_vale_heap (s:vale_state) : vale_heap = get_vale_heap s.vs_heap
[@va_qattr]
unfold let eval_reg (r:reg) (s:vale_state) : t_reg r = Regs.sel r s.vs_regs
[@va_qattr]
unfold let eval_reg_int (r:reg) (s:vale_state) : int = t_reg_to_int r.rf (eval_reg r s)
[@va_qattr]
unfold let eval_flag (f:flag) (s:vale_state) : Flags.flag_val_t = Flags.sel f s.vs_flags
[@va_qattr]
unfold let eval_mem (ptr:int) (s:vale_state) : GTot nat64 = load_mem64 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_mem128 (ptr:int) (s:vale_state) : GTot Vale.Def.Types_s.quad32 = load_mem128 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_stack (ptr:int) (s:vale_state) : GTot nat64 = load_stack64 ptr s.vs_stack | false | false | Vale.X64.State.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val eval_stack128 (ptr: int) (s: vale_state) : GTot quad32 | [] | Vale.X64.State.eval_stack128 | {
"file_name": "vale/code/arch/x64/Vale.X64.State.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | ptr: Prims.int -> s: Vale.X64.State.vale_state -> Prims.GTot Vale.X64.Memory.quad32 | {
"end_col": 94,
"end_line": 38,
"start_col": 66,
"start_line": 38
} |
Prims.Tot | val state_eq (s0 s1: vale_state) : prop0 | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.X64.Regs",
"short_module": "Regs"
},
{
"abbrev": true,
"full_module": "Vale.X64.Flags",
"short_module": "Flags"
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let state_eq (s0:vale_state) (s1:vale_state) : prop0 =
s0.vs_ok == s1.vs_ok /\
Regs.equal s0.vs_regs s1.vs_regs /\
Flags.equal s0.vs_flags s1.vs_flags /\
vale_full_heap_equal s0.vs_heap s1.vs_heap /\
s0.vs_stack == s1.vs_stack /\
s0.vs_stackTaint == s1.vs_stackTaint | val state_eq (s0 s1: vale_state) : prop0
let state_eq (s0 s1: vale_state) : prop0 = | false | null | false | s0.vs_ok == s1.vs_ok /\ Regs.equal s0.vs_regs s1.vs_regs /\ Flags.equal s0.vs_flags s1.vs_flags /\
vale_full_heap_equal s0.vs_heap s1.vs_heap /\ s0.vs_stack == s1.vs_stack /\
s0.vs_stackTaint == s1.vs_stackTaint | {
"checked_file": "Vale.X64.State.fsti.checked",
"dependencies": [
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.State.fsti"
} | [
"total"
] | [
"Vale.X64.State.vale_state",
"Prims.l_and",
"Prims.eq2",
"Prims.bool",
"Vale.X64.State.__proj__Mkvale_state__item__vs_ok",
"Vale.X64.Regs.equal",
"Vale.X64.State.__proj__Mkvale_state__item__vs_regs",
"Vale.X64.Flags.equal",
"Vale.X64.State.__proj__Mkvale_state__item__vs_flags",
"Vale.X64.Memory.vale_full_heap_equal",
"Vale.X64.State.__proj__Mkvale_state__item__vs_heap",
"Vale.X64.Stack_i.vale_stack",
"Vale.X64.State.__proj__Mkvale_state__item__vs_stack",
"Vale.X64.Memory.memtaint",
"Vale.X64.State.__proj__Mkvale_state__item__vs_stackTaint",
"Vale.Def.Prop_s.prop0"
] | [] | module Vale.X64.State
open FStar.Mul
// This interface should not refer to Machine_Semantics_s
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
module Flags = Vale.X64.Flags
module Regs = Vale.X64.Regs
module Map16 = Vale.Lib.Map16
noeq type vale_state = {
vs_ok: bool;
vs_regs: Regs.t;
vs_flags: Flags.t;
vs_heap: vale_full_heap;
vs_stack: vale_stack;
vs_stackTaint: memtaint;
}
unfold let vs_get_vale_heap (s:vale_state) : vale_heap = get_vale_heap s.vs_heap
[@va_qattr]
unfold let eval_reg (r:reg) (s:vale_state) : t_reg r = Regs.sel r s.vs_regs
[@va_qattr]
unfold let eval_reg_int (r:reg) (s:vale_state) : int = t_reg_to_int r.rf (eval_reg r s)
[@va_qattr]
unfold let eval_flag (f:flag) (s:vale_state) : Flags.flag_val_t = Flags.sel f s.vs_flags
[@va_qattr]
unfold let eval_mem (ptr:int) (s:vale_state) : GTot nat64 = load_mem64 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_mem128 (ptr:int) (s:vale_state) : GTot Vale.Def.Types_s.quad32 = load_mem128 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_stack (ptr:int) (s:vale_state) : GTot nat64 = load_stack64 ptr s.vs_stack
[@va_qattr]
unfold let eval_stack128 (ptr:int) (s:vale_state) : GTot quad32 = load_stack128 ptr s.vs_stack
[@va_qattr]
unfold let eval_reg_64 (r:reg_64) (s:vale_state) : nat64 = eval_reg (Reg 0 r) s
[@va_qattr]
unfold let eval_reg_xmm (r:reg_xmm) (s:vale_state) : quad32 = eval_reg (Reg 1 r) s
[@va_qattr]
let eval_maddr (m:maddr) (s:vale_state) : int =
match m with
| MConst n -> n
| MReg r offset -> eval_reg_int r s + offset
| MIndex base scale index offset -> eval_reg_int base s + scale * (eval_reg_int index s) + offset
[@va_qattr]
let eval_operand (o:operand64) (s:vale_state) : GTot nat64 =
match o with
| OConst n -> n
| OReg r -> eval_reg_64 r s
| OMem (m, _) -> eval_mem (eval_maddr m s) s
| OStack (m, _) -> eval_stack (eval_maddr m s) s
[@va_qattr]
let eval_operand128 (o:operand128) (s:vale_state) : GTot Vale.Def.Types_s.quad32 =
match o with
| OConst c -> c
| OReg r -> eval_reg_xmm r s
| OMem (m, _) -> eval_mem128 (eval_maddr m s) s
| OStack (m, _) -> eval_stack128 (eval_maddr m s) s
[@va_qattr]
let update_reg (r:reg) (v:t_reg r) (s:vale_state) : vale_state =
{s with vs_regs = Regs.upd r v s.vs_regs}
[@va_qattr]
let update_reg_64 (r:reg_64) (v:nat64) (s:vale_state) : vale_state =
update_reg (Reg 0 r) v s
[@va_qattr]
let update_flag (f:flag) (v:Flags.flag_val_t) (s:vale_state) : vale_state =
{s with vs_flags = Flags.upd f v s.vs_flags}
[@va_qattr]
let update_reg_xmm (r:reg_xmm) (v:quad32) (s:vale_state) : vale_state =
update_reg (Reg 1 r) v s
//[@va_qattr]
//let update_mem (ptr:int) (v:nat64) (s:vale_state) : GTot vale_state =
// {s with vs_heap = set_vale_heap s.vs_heap (store_mem64 ptr v (get_vale_heap s.vs_heap))}
[@va_qattr]
let update_stack64 (ptr:int) (v:nat64) (s:vale_state) : GTot vale_state =
{s with vs_stack = store_stack64 ptr v s.vs_stack}
//[@va_qattr]
//let update_operand64 (o:operand64) (v:nat64) (sM:vale_state) : GTot vale_state =
// match o with
// | OConst n -> sM
// | OReg r -> update_reg (Reg 0 r) v sM
// | OMem (m, _) -> update_mem (eval_maddr m sM) v sM
// | OStack (m, _) -> update_stack64 (eval_maddr m sM) v sM
[@va_qattr]
let valid_maddr (m:maddr) (s:vale_state) : prop0 =
valid_mem64 (eval_maddr m s) (get_vale_heap s.vs_heap)
[@va_qattr]
let valid_maddr128 (m:maddr) (s:vale_state) : prop0 =
valid_mem128 (eval_maddr m s) (get_vale_heap s.vs_heap)
[@va_qattr]
let valid_src_operand (o:operand64) (s:vale_state) : prop0 =
match o with
| OConst c -> True
| OReg r -> True
| OMem (m, _) -> valid_maddr m s
| OStack (m, _) -> valid_src_stack64 (eval_maddr m s) s.vs_stack
[@va_qattr]
let valid_src_operand128 (o:operand128) (s:vale_state) : prop0 =
match o with
| OConst _ -> False
| OReg _ -> True
| OMem (m, _) -> valid_maddr128 m s
| OStack (m, _) -> valid_src_stack128 (eval_maddr m s) s.vs_stack
[@va_qattr]
let state_eta (s:vale_state) : vale_state =
{s with
vs_regs = Regs.eta s.vs_regs;
vs_heap = {s.vs_heap with vf_heaplets = Map16.eta s.vs_heap.vf_heaplets};
}
[@va_qattr] | false | true | Vale.X64.State.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val state_eq (s0 s1: vale_state) : prop0 | [] | Vale.X64.State.state_eq | {
"file_name": "vale/code/arch/x64/Vale.X64.State.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | s0: Vale.X64.State.vale_state -> s1: Vale.X64.State.vale_state -> Vale.Def.Prop_s.prop0 | {
"end_col": 38,
"end_line": 139,
"start_col": 2,
"start_line": 134
} |
Prims.Tot | val eval_reg_64 (r: reg_64) (s: vale_state) : nat64 | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.X64.Regs",
"short_module": "Regs"
},
{
"abbrev": true,
"full_module": "Vale.X64.Flags",
"short_module": "Flags"
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let eval_reg_64 (r:reg_64) (s:vale_state) : nat64 = eval_reg (Reg 0 r) s | val eval_reg_64 (r: reg_64) (s: vale_state) : nat64
let eval_reg_64 (r: reg_64) (s: vale_state) : nat64 = | false | null | false | eval_reg (Reg 0 r) s | {
"checked_file": "Vale.X64.State.fsti.checked",
"dependencies": [
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.State.fsti"
} | [
"total"
] | [
"Vale.X64.Machine_s.reg_64",
"Vale.X64.State.vale_state",
"Vale.X64.State.eval_reg",
"Vale.X64.Machine_s.Reg",
"Vale.X64.Memory.nat64"
] | [] | module Vale.X64.State
open FStar.Mul
// This interface should not refer to Machine_Semantics_s
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
module Flags = Vale.X64.Flags
module Regs = Vale.X64.Regs
module Map16 = Vale.Lib.Map16
noeq type vale_state = {
vs_ok: bool;
vs_regs: Regs.t;
vs_flags: Flags.t;
vs_heap: vale_full_heap;
vs_stack: vale_stack;
vs_stackTaint: memtaint;
}
unfold let vs_get_vale_heap (s:vale_state) : vale_heap = get_vale_heap s.vs_heap
[@va_qattr]
unfold let eval_reg (r:reg) (s:vale_state) : t_reg r = Regs.sel r s.vs_regs
[@va_qattr]
unfold let eval_reg_int (r:reg) (s:vale_state) : int = t_reg_to_int r.rf (eval_reg r s)
[@va_qattr]
unfold let eval_flag (f:flag) (s:vale_state) : Flags.flag_val_t = Flags.sel f s.vs_flags
[@va_qattr]
unfold let eval_mem (ptr:int) (s:vale_state) : GTot nat64 = load_mem64 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_mem128 (ptr:int) (s:vale_state) : GTot Vale.Def.Types_s.quad32 = load_mem128 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_stack (ptr:int) (s:vale_state) : GTot nat64 = load_stack64 ptr s.vs_stack
[@va_qattr]
unfold let eval_stack128 (ptr:int) (s:vale_state) : GTot quad32 = load_stack128 ptr s.vs_stack | false | true | Vale.X64.State.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val eval_reg_64 (r: reg_64) (s: vale_state) : nat64 | [] | Vale.X64.State.eval_reg_64 | {
"file_name": "vale/code/arch/x64/Vale.X64.State.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | r: Vale.X64.Machine_s.reg_64 -> s: Vale.X64.State.vale_state -> Vale.X64.Memory.nat64 | {
"end_col": 79,
"end_line": 41,
"start_col": 59,
"start_line": 41
} |
Prims.Tot | val update_reg_64 (r: reg_64) (v: nat64) (s: vale_state) : vale_state | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.X64.Regs",
"short_module": "Regs"
},
{
"abbrev": true,
"full_module": "Vale.X64.Flags",
"short_module": "Flags"
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let update_reg_64 (r:reg_64) (v:nat64) (s:vale_state) : vale_state =
update_reg (Reg 0 r) v s | val update_reg_64 (r: reg_64) (v: nat64) (s: vale_state) : vale_state
let update_reg_64 (r: reg_64) (v: nat64) (s: vale_state) : vale_state = | false | null | false | update_reg (Reg 0 r) v s | {
"checked_file": "Vale.X64.State.fsti.checked",
"dependencies": [
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.State.fsti"
} | [
"total"
] | [
"Vale.X64.Machine_s.reg_64",
"Vale.X64.Memory.nat64",
"Vale.X64.State.vale_state",
"Vale.X64.State.update_reg",
"Vale.X64.Machine_s.Reg"
] | [] | module Vale.X64.State
open FStar.Mul
// This interface should not refer to Machine_Semantics_s
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
module Flags = Vale.X64.Flags
module Regs = Vale.X64.Regs
module Map16 = Vale.Lib.Map16
noeq type vale_state = {
vs_ok: bool;
vs_regs: Regs.t;
vs_flags: Flags.t;
vs_heap: vale_full_heap;
vs_stack: vale_stack;
vs_stackTaint: memtaint;
}
unfold let vs_get_vale_heap (s:vale_state) : vale_heap = get_vale_heap s.vs_heap
[@va_qattr]
unfold let eval_reg (r:reg) (s:vale_state) : t_reg r = Regs.sel r s.vs_regs
[@va_qattr]
unfold let eval_reg_int (r:reg) (s:vale_state) : int = t_reg_to_int r.rf (eval_reg r s)
[@va_qattr]
unfold let eval_flag (f:flag) (s:vale_state) : Flags.flag_val_t = Flags.sel f s.vs_flags
[@va_qattr]
unfold let eval_mem (ptr:int) (s:vale_state) : GTot nat64 = load_mem64 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_mem128 (ptr:int) (s:vale_state) : GTot Vale.Def.Types_s.quad32 = load_mem128 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_stack (ptr:int) (s:vale_state) : GTot nat64 = load_stack64 ptr s.vs_stack
[@va_qattr]
unfold let eval_stack128 (ptr:int) (s:vale_state) : GTot quad32 = load_stack128 ptr s.vs_stack
[@va_qattr]
unfold let eval_reg_64 (r:reg_64) (s:vale_state) : nat64 = eval_reg (Reg 0 r) s
[@va_qattr]
unfold let eval_reg_xmm (r:reg_xmm) (s:vale_state) : quad32 = eval_reg (Reg 1 r) s
[@va_qattr]
let eval_maddr (m:maddr) (s:vale_state) : int =
match m with
| MConst n -> n
| MReg r offset -> eval_reg_int r s + offset
| MIndex base scale index offset -> eval_reg_int base s + scale * (eval_reg_int index s) + offset
[@va_qattr]
let eval_operand (o:operand64) (s:vale_state) : GTot nat64 =
match o with
| OConst n -> n
| OReg r -> eval_reg_64 r s
| OMem (m, _) -> eval_mem (eval_maddr m s) s
| OStack (m, _) -> eval_stack (eval_maddr m s) s
[@va_qattr]
let eval_operand128 (o:operand128) (s:vale_state) : GTot Vale.Def.Types_s.quad32 =
match o with
| OConst c -> c
| OReg r -> eval_reg_xmm r s
| OMem (m, _) -> eval_mem128 (eval_maddr m s) s
| OStack (m, _) -> eval_stack128 (eval_maddr m s) s
[@va_qattr]
let update_reg (r:reg) (v:t_reg r) (s:vale_state) : vale_state =
{s with vs_regs = Regs.upd r v s.vs_regs}
[@va_qattr] | false | true | Vale.X64.State.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val update_reg_64 (r: reg_64) (v: nat64) (s: vale_state) : vale_state | [] | Vale.X64.State.update_reg_64 | {
"file_name": "vale/code/arch/x64/Vale.X64.State.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | r: Vale.X64.Machine_s.reg_64 -> v: Vale.X64.Memory.nat64 -> s: Vale.X64.State.vale_state
-> Vale.X64.State.vale_state | {
"end_col": 26,
"end_line": 75,
"start_col": 2,
"start_line": 75
} |
Prims.Tot | val update_reg_xmm (r: reg_xmm) (v: quad32) (s: vale_state) : vale_state | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.X64.Regs",
"short_module": "Regs"
},
{
"abbrev": true,
"full_module": "Vale.X64.Flags",
"short_module": "Flags"
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let update_reg_xmm (r:reg_xmm) (v:quad32) (s:vale_state) : vale_state =
update_reg (Reg 1 r) v s | val update_reg_xmm (r: reg_xmm) (v: quad32) (s: vale_state) : vale_state
let update_reg_xmm (r: reg_xmm) (v: quad32) (s: vale_state) : vale_state = | false | null | false | update_reg (Reg 1 r) v s | {
"checked_file": "Vale.X64.State.fsti.checked",
"dependencies": [
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.State.fsti"
} | [
"total"
] | [
"Vale.X64.Machine_s.reg_xmm",
"Vale.X64.Memory.quad32",
"Vale.X64.State.vale_state",
"Vale.X64.State.update_reg",
"Vale.X64.Machine_s.Reg"
] | [] | module Vale.X64.State
open FStar.Mul
// This interface should not refer to Machine_Semantics_s
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
module Flags = Vale.X64.Flags
module Regs = Vale.X64.Regs
module Map16 = Vale.Lib.Map16
noeq type vale_state = {
vs_ok: bool;
vs_regs: Regs.t;
vs_flags: Flags.t;
vs_heap: vale_full_heap;
vs_stack: vale_stack;
vs_stackTaint: memtaint;
}
unfold let vs_get_vale_heap (s:vale_state) : vale_heap = get_vale_heap s.vs_heap
[@va_qattr]
unfold let eval_reg (r:reg) (s:vale_state) : t_reg r = Regs.sel r s.vs_regs
[@va_qattr]
unfold let eval_reg_int (r:reg) (s:vale_state) : int = t_reg_to_int r.rf (eval_reg r s)
[@va_qattr]
unfold let eval_flag (f:flag) (s:vale_state) : Flags.flag_val_t = Flags.sel f s.vs_flags
[@va_qattr]
unfold let eval_mem (ptr:int) (s:vale_state) : GTot nat64 = load_mem64 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_mem128 (ptr:int) (s:vale_state) : GTot Vale.Def.Types_s.quad32 = load_mem128 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_stack (ptr:int) (s:vale_state) : GTot nat64 = load_stack64 ptr s.vs_stack
[@va_qattr]
unfold let eval_stack128 (ptr:int) (s:vale_state) : GTot quad32 = load_stack128 ptr s.vs_stack
[@va_qattr]
unfold let eval_reg_64 (r:reg_64) (s:vale_state) : nat64 = eval_reg (Reg 0 r) s
[@va_qattr]
unfold let eval_reg_xmm (r:reg_xmm) (s:vale_state) : quad32 = eval_reg (Reg 1 r) s
[@va_qattr]
let eval_maddr (m:maddr) (s:vale_state) : int =
match m with
| MConst n -> n
| MReg r offset -> eval_reg_int r s + offset
| MIndex base scale index offset -> eval_reg_int base s + scale * (eval_reg_int index s) + offset
[@va_qattr]
let eval_operand (o:operand64) (s:vale_state) : GTot nat64 =
match o with
| OConst n -> n
| OReg r -> eval_reg_64 r s
| OMem (m, _) -> eval_mem (eval_maddr m s) s
| OStack (m, _) -> eval_stack (eval_maddr m s) s
[@va_qattr]
let eval_operand128 (o:operand128) (s:vale_state) : GTot Vale.Def.Types_s.quad32 =
match o with
| OConst c -> c
| OReg r -> eval_reg_xmm r s
| OMem (m, _) -> eval_mem128 (eval_maddr m s) s
| OStack (m, _) -> eval_stack128 (eval_maddr m s) s
[@va_qattr]
let update_reg (r:reg) (v:t_reg r) (s:vale_state) : vale_state =
{s with vs_regs = Regs.upd r v s.vs_regs}
[@va_qattr]
let update_reg_64 (r:reg_64) (v:nat64) (s:vale_state) : vale_state =
update_reg (Reg 0 r) v s
[@va_qattr]
let update_flag (f:flag) (v:Flags.flag_val_t) (s:vale_state) : vale_state =
{s with vs_flags = Flags.upd f v s.vs_flags}
[@va_qattr] | false | true | Vale.X64.State.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val update_reg_xmm (r: reg_xmm) (v: quad32) (s: vale_state) : vale_state | [] | Vale.X64.State.update_reg_xmm | {
"file_name": "vale/code/arch/x64/Vale.X64.State.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | r: Vale.X64.Machine_s.reg_xmm -> v: Vale.X64.Memory.quad32 -> s: Vale.X64.State.vale_state
-> Vale.X64.State.vale_state | {
"end_col": 26,
"end_line": 83,
"start_col": 2,
"start_line": 83
} |
Prims.Tot | val eval_reg_xmm (r: reg_xmm) (s: vale_state) : quad32 | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.X64.Regs",
"short_module": "Regs"
},
{
"abbrev": true,
"full_module": "Vale.X64.Flags",
"short_module": "Flags"
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let eval_reg_xmm (r:reg_xmm) (s:vale_state) : quad32 = eval_reg (Reg 1 r) s | val eval_reg_xmm (r: reg_xmm) (s: vale_state) : quad32
let eval_reg_xmm (r: reg_xmm) (s: vale_state) : quad32 = | false | null | false | eval_reg (Reg 1 r) s | {
"checked_file": "Vale.X64.State.fsti.checked",
"dependencies": [
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.State.fsti"
} | [
"total"
] | [
"Vale.X64.Machine_s.reg_xmm",
"Vale.X64.State.vale_state",
"Vale.X64.State.eval_reg",
"Vale.X64.Machine_s.Reg",
"Vale.X64.Memory.quad32"
] | [] | module Vale.X64.State
open FStar.Mul
// This interface should not refer to Machine_Semantics_s
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
module Flags = Vale.X64.Flags
module Regs = Vale.X64.Regs
module Map16 = Vale.Lib.Map16
noeq type vale_state = {
vs_ok: bool;
vs_regs: Regs.t;
vs_flags: Flags.t;
vs_heap: vale_full_heap;
vs_stack: vale_stack;
vs_stackTaint: memtaint;
}
unfold let vs_get_vale_heap (s:vale_state) : vale_heap = get_vale_heap s.vs_heap
[@va_qattr]
unfold let eval_reg (r:reg) (s:vale_state) : t_reg r = Regs.sel r s.vs_regs
[@va_qattr]
unfold let eval_reg_int (r:reg) (s:vale_state) : int = t_reg_to_int r.rf (eval_reg r s)
[@va_qattr]
unfold let eval_flag (f:flag) (s:vale_state) : Flags.flag_val_t = Flags.sel f s.vs_flags
[@va_qattr]
unfold let eval_mem (ptr:int) (s:vale_state) : GTot nat64 = load_mem64 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_mem128 (ptr:int) (s:vale_state) : GTot Vale.Def.Types_s.quad32 = load_mem128 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_stack (ptr:int) (s:vale_state) : GTot nat64 = load_stack64 ptr s.vs_stack
[@va_qattr]
unfold let eval_stack128 (ptr:int) (s:vale_state) : GTot quad32 = load_stack128 ptr s.vs_stack
[@va_qattr]
unfold let eval_reg_64 (r:reg_64) (s:vale_state) : nat64 = eval_reg (Reg 0 r) s | false | true | Vale.X64.State.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val eval_reg_xmm (r: reg_xmm) (s: vale_state) : quad32 | [] | Vale.X64.State.eval_reg_xmm | {
"file_name": "vale/code/arch/x64/Vale.X64.State.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | r: Vale.X64.Machine_s.reg_xmm -> s: Vale.X64.State.vale_state -> Vale.X64.Memory.quad32 | {
"end_col": 82,
"end_line": 44,
"start_col": 62,
"start_line": 44
} |
Prims.GTot | val eval_operand (o: operand64) (s: vale_state) : GTot nat64 | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.X64.Regs",
"short_module": "Regs"
},
{
"abbrev": true,
"full_module": "Vale.X64.Flags",
"short_module": "Flags"
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let eval_operand (o:operand64) (s:vale_state) : GTot nat64 =
match o with
| OConst n -> n
| OReg r -> eval_reg_64 r s
| OMem (m, _) -> eval_mem (eval_maddr m s) s
| OStack (m, _) -> eval_stack (eval_maddr m s) s | val eval_operand (o: operand64) (s: vale_state) : GTot nat64
let eval_operand (o: operand64) (s: vale_state) : GTot nat64 = | false | null | false | match o with
| OConst n -> n
| OReg r -> eval_reg_64 r s
| OMem (m, _) -> eval_mem (eval_maddr m s) s
| OStack (m, _) -> eval_stack (eval_maddr m s) s | {
"checked_file": "Vale.X64.State.fsti.checked",
"dependencies": [
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.State.fsti"
} | [
"sometrivial"
] | [
"Vale.X64.Machine_s.operand64",
"Vale.X64.State.vale_state",
"Vale.X64.Machine_s.nat64",
"Vale.X64.Machine_s.reg_64",
"Vale.X64.State.eval_reg_64",
"Vale.X64.Machine_s.maddr",
"Vale.Arch.HeapTypes_s.taint",
"Vale.X64.State.eval_mem",
"Vale.X64.State.eval_maddr",
"Vale.X64.State.eval_stack",
"Vale.X64.Memory.nat64"
] | [] | module Vale.X64.State
open FStar.Mul
// This interface should not refer to Machine_Semantics_s
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
module Flags = Vale.X64.Flags
module Regs = Vale.X64.Regs
module Map16 = Vale.Lib.Map16
noeq type vale_state = {
vs_ok: bool;
vs_regs: Regs.t;
vs_flags: Flags.t;
vs_heap: vale_full_heap;
vs_stack: vale_stack;
vs_stackTaint: memtaint;
}
unfold let vs_get_vale_heap (s:vale_state) : vale_heap = get_vale_heap s.vs_heap
[@va_qattr]
unfold let eval_reg (r:reg) (s:vale_state) : t_reg r = Regs.sel r s.vs_regs
[@va_qattr]
unfold let eval_reg_int (r:reg) (s:vale_state) : int = t_reg_to_int r.rf (eval_reg r s)
[@va_qattr]
unfold let eval_flag (f:flag) (s:vale_state) : Flags.flag_val_t = Flags.sel f s.vs_flags
[@va_qattr]
unfold let eval_mem (ptr:int) (s:vale_state) : GTot nat64 = load_mem64 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_mem128 (ptr:int) (s:vale_state) : GTot Vale.Def.Types_s.quad32 = load_mem128 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_stack (ptr:int) (s:vale_state) : GTot nat64 = load_stack64 ptr s.vs_stack
[@va_qattr]
unfold let eval_stack128 (ptr:int) (s:vale_state) : GTot quad32 = load_stack128 ptr s.vs_stack
[@va_qattr]
unfold let eval_reg_64 (r:reg_64) (s:vale_state) : nat64 = eval_reg (Reg 0 r) s
[@va_qattr]
unfold let eval_reg_xmm (r:reg_xmm) (s:vale_state) : quad32 = eval_reg (Reg 1 r) s
[@va_qattr]
let eval_maddr (m:maddr) (s:vale_state) : int =
match m with
| MConst n -> n
| MReg r offset -> eval_reg_int r s + offset
| MIndex base scale index offset -> eval_reg_int base s + scale * (eval_reg_int index s) + offset
[@va_qattr] | false | false | Vale.X64.State.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val eval_operand (o: operand64) (s: vale_state) : GTot nat64 | [] | Vale.X64.State.eval_operand | {
"file_name": "vale/code/arch/x64/Vale.X64.State.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | o: Vale.X64.Machine_s.operand64 -> s: Vale.X64.State.vale_state -> Prims.GTot Vale.X64.Memory.nat64 | {
"end_col": 50,
"end_line": 59,
"start_col": 2,
"start_line": 55
} |
Prims.GTot | val eval_operand128 (o: operand128) (s: vale_state) : GTot Vale.Def.Types_s.quad32 | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.X64.Regs",
"short_module": "Regs"
},
{
"abbrev": true,
"full_module": "Vale.X64.Flags",
"short_module": "Flags"
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let eval_operand128 (o:operand128) (s:vale_state) : GTot Vale.Def.Types_s.quad32 =
match o with
| OConst c -> c
| OReg r -> eval_reg_xmm r s
| OMem (m, _) -> eval_mem128 (eval_maddr m s) s
| OStack (m, _) -> eval_stack128 (eval_maddr m s) s | val eval_operand128 (o: operand128) (s: vale_state) : GTot Vale.Def.Types_s.quad32
let eval_operand128 (o: operand128) (s: vale_state) : GTot Vale.Def.Types_s.quad32 = | false | null | false | match o with
| OConst c -> c
| OReg r -> eval_reg_xmm r s
| OMem (m, _) -> eval_mem128 (eval_maddr m s) s
| OStack (m, _) -> eval_stack128 (eval_maddr m s) s | {
"checked_file": "Vale.X64.State.fsti.checked",
"dependencies": [
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.State.fsti"
} | [
"sometrivial"
] | [
"Vale.X64.Machine_s.operand128",
"Vale.X64.State.vale_state",
"Vale.X64.Machine_s.quad32",
"Vale.X64.Machine_s.reg_xmm",
"Vale.X64.State.eval_reg_xmm",
"Vale.X64.Machine_s.maddr",
"Vale.Arch.HeapTypes_s.taint",
"Vale.X64.State.eval_mem128",
"Vale.X64.State.eval_maddr",
"Vale.X64.State.eval_stack128",
"Vale.Def.Types_s.quad32"
] | [] | module Vale.X64.State
open FStar.Mul
// This interface should not refer to Machine_Semantics_s
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
module Flags = Vale.X64.Flags
module Regs = Vale.X64.Regs
module Map16 = Vale.Lib.Map16
noeq type vale_state = {
vs_ok: bool;
vs_regs: Regs.t;
vs_flags: Flags.t;
vs_heap: vale_full_heap;
vs_stack: vale_stack;
vs_stackTaint: memtaint;
}
unfold let vs_get_vale_heap (s:vale_state) : vale_heap = get_vale_heap s.vs_heap
[@va_qattr]
unfold let eval_reg (r:reg) (s:vale_state) : t_reg r = Regs.sel r s.vs_regs
[@va_qattr]
unfold let eval_reg_int (r:reg) (s:vale_state) : int = t_reg_to_int r.rf (eval_reg r s)
[@va_qattr]
unfold let eval_flag (f:flag) (s:vale_state) : Flags.flag_val_t = Flags.sel f s.vs_flags
[@va_qattr]
unfold let eval_mem (ptr:int) (s:vale_state) : GTot nat64 = load_mem64 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_mem128 (ptr:int) (s:vale_state) : GTot Vale.Def.Types_s.quad32 = load_mem128 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_stack (ptr:int) (s:vale_state) : GTot nat64 = load_stack64 ptr s.vs_stack
[@va_qattr]
unfold let eval_stack128 (ptr:int) (s:vale_state) : GTot quad32 = load_stack128 ptr s.vs_stack
[@va_qattr]
unfold let eval_reg_64 (r:reg_64) (s:vale_state) : nat64 = eval_reg (Reg 0 r) s
[@va_qattr]
unfold let eval_reg_xmm (r:reg_xmm) (s:vale_state) : quad32 = eval_reg (Reg 1 r) s
[@va_qattr]
let eval_maddr (m:maddr) (s:vale_state) : int =
match m with
| MConst n -> n
| MReg r offset -> eval_reg_int r s + offset
| MIndex base scale index offset -> eval_reg_int base s + scale * (eval_reg_int index s) + offset
[@va_qattr]
let eval_operand (o:operand64) (s:vale_state) : GTot nat64 =
match o with
| OConst n -> n
| OReg r -> eval_reg_64 r s
| OMem (m, _) -> eval_mem (eval_maddr m s) s
| OStack (m, _) -> eval_stack (eval_maddr m s) s
[@va_qattr] | false | false | Vale.X64.State.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val eval_operand128 (o: operand128) (s: vale_state) : GTot Vale.Def.Types_s.quad32 | [] | Vale.X64.State.eval_operand128 | {
"file_name": "vale/code/arch/x64/Vale.X64.State.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | o: Vale.X64.Machine_s.operand128 -> s: Vale.X64.State.vale_state
-> Prims.GTot Vale.Def.Types_s.quad32 | {
"end_col": 53,
"end_line": 67,
"start_col": 2,
"start_line": 63
} |
Prims.Tot | val eval_maddr (m: maddr) (s: vale_state) : int | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.X64.Regs",
"short_module": "Regs"
},
{
"abbrev": true,
"full_module": "Vale.X64.Flags",
"short_module": "Flags"
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let eval_maddr (m:maddr) (s:vale_state) : int =
match m with
| MConst n -> n
| MReg r offset -> eval_reg_int r s + offset
| MIndex base scale index offset -> eval_reg_int base s + scale * (eval_reg_int index s) + offset | val eval_maddr (m: maddr) (s: vale_state) : int
let eval_maddr (m: maddr) (s: vale_state) : int = | false | null | false | match m with
| MConst n -> n
| MReg r offset -> eval_reg_int r s + offset
| MIndex base scale index offset -> eval_reg_int base s + scale * (eval_reg_int index s) + offset | {
"checked_file": "Vale.X64.State.fsti.checked",
"dependencies": [
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.State.fsti"
} | [
"total"
] | [
"Vale.X64.Machine_s.maddr",
"Vale.X64.State.vale_state",
"Prims.int",
"Vale.X64.Machine_s.reg",
"Prims.op_Addition",
"Vale.X64.State.eval_reg_int",
"FStar.Mul.op_Star"
] | [] | module Vale.X64.State
open FStar.Mul
// This interface should not refer to Machine_Semantics_s
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
module Flags = Vale.X64.Flags
module Regs = Vale.X64.Regs
module Map16 = Vale.Lib.Map16
noeq type vale_state = {
vs_ok: bool;
vs_regs: Regs.t;
vs_flags: Flags.t;
vs_heap: vale_full_heap;
vs_stack: vale_stack;
vs_stackTaint: memtaint;
}
unfold let vs_get_vale_heap (s:vale_state) : vale_heap = get_vale_heap s.vs_heap
[@va_qattr]
unfold let eval_reg (r:reg) (s:vale_state) : t_reg r = Regs.sel r s.vs_regs
[@va_qattr]
unfold let eval_reg_int (r:reg) (s:vale_state) : int = t_reg_to_int r.rf (eval_reg r s)
[@va_qattr]
unfold let eval_flag (f:flag) (s:vale_state) : Flags.flag_val_t = Flags.sel f s.vs_flags
[@va_qattr]
unfold let eval_mem (ptr:int) (s:vale_state) : GTot nat64 = load_mem64 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_mem128 (ptr:int) (s:vale_state) : GTot Vale.Def.Types_s.quad32 = load_mem128 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_stack (ptr:int) (s:vale_state) : GTot nat64 = load_stack64 ptr s.vs_stack
[@va_qattr]
unfold let eval_stack128 (ptr:int) (s:vale_state) : GTot quad32 = load_stack128 ptr s.vs_stack
[@va_qattr]
unfold let eval_reg_64 (r:reg_64) (s:vale_state) : nat64 = eval_reg (Reg 0 r) s
[@va_qattr]
unfold let eval_reg_xmm (r:reg_xmm) (s:vale_state) : quad32 = eval_reg (Reg 1 r) s
[@va_qattr] | false | true | Vale.X64.State.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val eval_maddr (m: maddr) (s: vale_state) : int | [] | Vale.X64.State.eval_maddr | {
"file_name": "vale/code/arch/x64/Vale.X64.State.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | m: Vale.X64.Machine_s.maddr -> s: Vale.X64.State.vale_state -> Prims.int | {
"end_col": 99,
"end_line": 51,
"start_col": 2,
"start_line": 48
} |
Prims.Tot | val valid_src_operand (o: operand64) (s: vale_state) : prop0 | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.X64.Regs",
"short_module": "Regs"
},
{
"abbrev": true,
"full_module": "Vale.X64.Flags",
"short_module": "Flags"
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let valid_src_operand (o:operand64) (s:vale_state) : prop0 =
match o with
| OConst c -> True
| OReg r -> True
| OMem (m, _) -> valid_maddr m s
| OStack (m, _) -> valid_src_stack64 (eval_maddr m s) s.vs_stack | val valid_src_operand (o: operand64) (s: vale_state) : prop0
let valid_src_operand (o: operand64) (s: vale_state) : prop0 = | false | null | false | match o with
| OConst c -> True
| OReg r -> True
| OMem (m, _) -> valid_maddr m s
| OStack (m, _) -> valid_src_stack64 (eval_maddr m s) s.vs_stack | {
"checked_file": "Vale.X64.State.fsti.checked",
"dependencies": [
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.State.fsti"
} | [
"total"
] | [
"Vale.X64.Machine_s.operand64",
"Vale.X64.State.vale_state",
"Vale.X64.Machine_s.nat64",
"Prims.l_True",
"Vale.X64.Machine_s.reg_64",
"Vale.X64.Machine_s.maddr",
"Vale.Arch.HeapTypes_s.taint",
"Vale.X64.State.valid_maddr",
"Prims.b2t",
"Vale.X64.Stack_i.valid_src_stack64",
"Vale.X64.State.eval_maddr",
"Vale.X64.State.__proj__Mkvale_state__item__vs_stack",
"Vale.Def.Prop_s.prop0"
] | [] | module Vale.X64.State
open FStar.Mul
// This interface should not refer to Machine_Semantics_s
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
module Flags = Vale.X64.Flags
module Regs = Vale.X64.Regs
module Map16 = Vale.Lib.Map16
noeq type vale_state = {
vs_ok: bool;
vs_regs: Regs.t;
vs_flags: Flags.t;
vs_heap: vale_full_heap;
vs_stack: vale_stack;
vs_stackTaint: memtaint;
}
unfold let vs_get_vale_heap (s:vale_state) : vale_heap = get_vale_heap s.vs_heap
[@va_qattr]
unfold let eval_reg (r:reg) (s:vale_state) : t_reg r = Regs.sel r s.vs_regs
[@va_qattr]
unfold let eval_reg_int (r:reg) (s:vale_state) : int = t_reg_to_int r.rf (eval_reg r s)
[@va_qattr]
unfold let eval_flag (f:flag) (s:vale_state) : Flags.flag_val_t = Flags.sel f s.vs_flags
[@va_qattr]
unfold let eval_mem (ptr:int) (s:vale_state) : GTot nat64 = load_mem64 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_mem128 (ptr:int) (s:vale_state) : GTot Vale.Def.Types_s.quad32 = load_mem128 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_stack (ptr:int) (s:vale_state) : GTot nat64 = load_stack64 ptr s.vs_stack
[@va_qattr]
unfold let eval_stack128 (ptr:int) (s:vale_state) : GTot quad32 = load_stack128 ptr s.vs_stack
[@va_qattr]
unfold let eval_reg_64 (r:reg_64) (s:vale_state) : nat64 = eval_reg (Reg 0 r) s
[@va_qattr]
unfold let eval_reg_xmm (r:reg_xmm) (s:vale_state) : quad32 = eval_reg (Reg 1 r) s
[@va_qattr]
let eval_maddr (m:maddr) (s:vale_state) : int =
match m with
| MConst n -> n
| MReg r offset -> eval_reg_int r s + offset
| MIndex base scale index offset -> eval_reg_int base s + scale * (eval_reg_int index s) + offset
[@va_qattr]
let eval_operand (o:operand64) (s:vale_state) : GTot nat64 =
match o with
| OConst n -> n
| OReg r -> eval_reg_64 r s
| OMem (m, _) -> eval_mem (eval_maddr m s) s
| OStack (m, _) -> eval_stack (eval_maddr m s) s
[@va_qattr]
let eval_operand128 (o:operand128) (s:vale_state) : GTot Vale.Def.Types_s.quad32 =
match o with
| OConst c -> c
| OReg r -> eval_reg_xmm r s
| OMem (m, _) -> eval_mem128 (eval_maddr m s) s
| OStack (m, _) -> eval_stack128 (eval_maddr m s) s
[@va_qattr]
let update_reg (r:reg) (v:t_reg r) (s:vale_state) : vale_state =
{s with vs_regs = Regs.upd r v s.vs_regs}
[@va_qattr]
let update_reg_64 (r:reg_64) (v:nat64) (s:vale_state) : vale_state =
update_reg (Reg 0 r) v s
[@va_qattr]
let update_flag (f:flag) (v:Flags.flag_val_t) (s:vale_state) : vale_state =
{s with vs_flags = Flags.upd f v s.vs_flags}
[@va_qattr]
let update_reg_xmm (r:reg_xmm) (v:quad32) (s:vale_state) : vale_state =
update_reg (Reg 1 r) v s
//[@va_qattr]
//let update_mem (ptr:int) (v:nat64) (s:vale_state) : GTot vale_state =
// {s with vs_heap = set_vale_heap s.vs_heap (store_mem64 ptr v (get_vale_heap s.vs_heap))}
[@va_qattr]
let update_stack64 (ptr:int) (v:nat64) (s:vale_state) : GTot vale_state =
{s with vs_stack = store_stack64 ptr v s.vs_stack}
//[@va_qattr]
//let update_operand64 (o:operand64) (v:nat64) (sM:vale_state) : GTot vale_state =
// match o with
// | OConst n -> sM
// | OReg r -> update_reg (Reg 0 r) v sM
// | OMem (m, _) -> update_mem (eval_maddr m sM) v sM
// | OStack (m, _) -> update_stack64 (eval_maddr m sM) v sM
[@va_qattr]
let valid_maddr (m:maddr) (s:vale_state) : prop0 =
valid_mem64 (eval_maddr m s) (get_vale_heap s.vs_heap)
[@va_qattr]
let valid_maddr128 (m:maddr) (s:vale_state) : prop0 =
valid_mem128 (eval_maddr m s) (get_vale_heap s.vs_heap)
[@va_qattr] | false | true | Vale.X64.State.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val valid_src_operand (o: operand64) (s: vale_state) : prop0 | [] | Vale.X64.State.valid_src_operand | {
"file_name": "vale/code/arch/x64/Vale.X64.State.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | o: Vale.X64.Machine_s.operand64 -> s: Vale.X64.State.vale_state -> Vale.Def.Prop_s.prop0 | {
"end_col": 66,
"end_line": 115,
"start_col": 2,
"start_line": 111
} |
Prims.Tot | val valid_src_operand128 (o: operand128) (s: vale_state) : prop0 | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.X64.Regs",
"short_module": "Regs"
},
{
"abbrev": true,
"full_module": "Vale.X64.Flags",
"short_module": "Flags"
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let valid_src_operand128 (o:operand128) (s:vale_state) : prop0 =
match o with
| OConst _ -> False
| OReg _ -> True
| OMem (m, _) -> valid_maddr128 m s
| OStack (m, _) -> valid_src_stack128 (eval_maddr m s) s.vs_stack | val valid_src_operand128 (o: operand128) (s: vale_state) : prop0
let valid_src_operand128 (o: operand128) (s: vale_state) : prop0 = | false | null | false | match o with
| OConst _ -> False
| OReg _ -> True
| OMem (m, _) -> valid_maddr128 m s
| OStack (m, _) -> valid_src_stack128 (eval_maddr m s) s.vs_stack | {
"checked_file": "Vale.X64.State.fsti.checked",
"dependencies": [
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Regs.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.X64.State.fsti"
} | [
"total"
] | [
"Vale.X64.Machine_s.operand128",
"Vale.X64.State.vale_state",
"Vale.X64.Machine_s.quad32",
"Prims.l_False",
"Vale.X64.Machine_s.reg_xmm",
"Prims.l_True",
"Vale.X64.Machine_s.maddr",
"Vale.Arch.HeapTypes_s.taint",
"Vale.X64.State.valid_maddr128",
"Prims.b2t",
"Vale.X64.Stack_i.valid_src_stack128",
"Vale.X64.State.eval_maddr",
"Vale.X64.State.__proj__Mkvale_state__item__vs_stack",
"Vale.Def.Prop_s.prop0"
] | [] | module Vale.X64.State
open FStar.Mul
// This interface should not refer to Machine_Semantics_s
open Vale.Def.Prop_s
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
module Flags = Vale.X64.Flags
module Regs = Vale.X64.Regs
module Map16 = Vale.Lib.Map16
noeq type vale_state = {
vs_ok: bool;
vs_regs: Regs.t;
vs_flags: Flags.t;
vs_heap: vale_full_heap;
vs_stack: vale_stack;
vs_stackTaint: memtaint;
}
unfold let vs_get_vale_heap (s:vale_state) : vale_heap = get_vale_heap s.vs_heap
[@va_qattr]
unfold let eval_reg (r:reg) (s:vale_state) : t_reg r = Regs.sel r s.vs_regs
[@va_qattr]
unfold let eval_reg_int (r:reg) (s:vale_state) : int = t_reg_to_int r.rf (eval_reg r s)
[@va_qattr]
unfold let eval_flag (f:flag) (s:vale_state) : Flags.flag_val_t = Flags.sel f s.vs_flags
[@va_qattr]
unfold let eval_mem (ptr:int) (s:vale_state) : GTot nat64 = load_mem64 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_mem128 (ptr:int) (s:vale_state) : GTot Vale.Def.Types_s.quad32 = load_mem128 ptr (get_vale_heap s.vs_heap)
[@va_qattr]
unfold let eval_stack (ptr:int) (s:vale_state) : GTot nat64 = load_stack64 ptr s.vs_stack
[@va_qattr]
unfold let eval_stack128 (ptr:int) (s:vale_state) : GTot quad32 = load_stack128 ptr s.vs_stack
[@va_qattr]
unfold let eval_reg_64 (r:reg_64) (s:vale_state) : nat64 = eval_reg (Reg 0 r) s
[@va_qattr]
unfold let eval_reg_xmm (r:reg_xmm) (s:vale_state) : quad32 = eval_reg (Reg 1 r) s
[@va_qattr]
let eval_maddr (m:maddr) (s:vale_state) : int =
match m with
| MConst n -> n
| MReg r offset -> eval_reg_int r s + offset
| MIndex base scale index offset -> eval_reg_int base s + scale * (eval_reg_int index s) + offset
[@va_qattr]
let eval_operand (o:operand64) (s:vale_state) : GTot nat64 =
match o with
| OConst n -> n
| OReg r -> eval_reg_64 r s
| OMem (m, _) -> eval_mem (eval_maddr m s) s
| OStack (m, _) -> eval_stack (eval_maddr m s) s
[@va_qattr]
let eval_operand128 (o:operand128) (s:vale_state) : GTot Vale.Def.Types_s.quad32 =
match o with
| OConst c -> c
| OReg r -> eval_reg_xmm r s
| OMem (m, _) -> eval_mem128 (eval_maddr m s) s
| OStack (m, _) -> eval_stack128 (eval_maddr m s) s
[@va_qattr]
let update_reg (r:reg) (v:t_reg r) (s:vale_state) : vale_state =
{s with vs_regs = Regs.upd r v s.vs_regs}
[@va_qattr]
let update_reg_64 (r:reg_64) (v:nat64) (s:vale_state) : vale_state =
update_reg (Reg 0 r) v s
[@va_qattr]
let update_flag (f:flag) (v:Flags.flag_val_t) (s:vale_state) : vale_state =
{s with vs_flags = Flags.upd f v s.vs_flags}
[@va_qattr]
let update_reg_xmm (r:reg_xmm) (v:quad32) (s:vale_state) : vale_state =
update_reg (Reg 1 r) v s
//[@va_qattr]
//let update_mem (ptr:int) (v:nat64) (s:vale_state) : GTot vale_state =
// {s with vs_heap = set_vale_heap s.vs_heap (store_mem64 ptr v (get_vale_heap s.vs_heap))}
[@va_qattr]
let update_stack64 (ptr:int) (v:nat64) (s:vale_state) : GTot vale_state =
{s with vs_stack = store_stack64 ptr v s.vs_stack}
//[@va_qattr]
//let update_operand64 (o:operand64) (v:nat64) (sM:vale_state) : GTot vale_state =
// match o with
// | OConst n -> sM
// | OReg r -> update_reg (Reg 0 r) v sM
// | OMem (m, _) -> update_mem (eval_maddr m sM) v sM
// | OStack (m, _) -> update_stack64 (eval_maddr m sM) v sM
[@va_qattr]
let valid_maddr (m:maddr) (s:vale_state) : prop0 =
valid_mem64 (eval_maddr m s) (get_vale_heap s.vs_heap)
[@va_qattr]
let valid_maddr128 (m:maddr) (s:vale_state) : prop0 =
valid_mem128 (eval_maddr m s) (get_vale_heap s.vs_heap)
[@va_qattr]
let valid_src_operand (o:operand64) (s:vale_state) : prop0 =
match o with
| OConst c -> True
| OReg r -> True
| OMem (m, _) -> valid_maddr m s
| OStack (m, _) -> valid_src_stack64 (eval_maddr m s) s.vs_stack
[@va_qattr] | false | true | Vale.X64.State.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val valid_src_operand128 (o: operand128) (s: vale_state) : prop0 | [] | Vale.X64.State.valid_src_operand128 | {
"file_name": "vale/code/arch/x64/Vale.X64.State.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | o: Vale.X64.Machine_s.operand128 -> s: Vale.X64.State.vale_state -> Vale.Def.Prop_s.prop0 | {
"end_col": 67,
"end_line": 123,
"start_col": 2,
"start_line": 119
} |
Prims.Tot | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let mask_values (#t:limb_t) (x:limb t) =
v x = v (zeros t SEC) \/ v x = v (ones t SEC) | let mask_values (#t: limb_t) (x: limb t) = | false | null | false | v x = v (zeros t SEC) \/ v x = v (ones t SEC) | {
"checked_file": "Hacl.Spec.Bignum.Base.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Spec.Bignum.Base.fst"
} | [
"total"
] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.Definitions.limb",
"Prims.l_or",
"Prims.b2t",
"Prims.op_Equality",
"Lib.IntTypes.range_t",
"Lib.IntTypes.v",
"Lib.IntTypes.SEC",
"Lib.IntTypes.zeros",
"Lib.IntTypes.ones",
"Prims.logical"
] | [] | module Hacl.Spec.Bignum.Base
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Spec.Bignum.Definitions
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
inline_for_extraction noextract
let carry (t:limb_t) = x:limb t{uint_v x == 0 \/ uint_v x == 1}
(**
This is non-stateful version of code/fallback functions
*)
inline_for_extraction noextract
val addcarry: #t:limb_t -> c:carry t -> a:limb t -> b:limb t ->
Pure (carry t & limb t)
(requires True)
(ensures fun (c', r) ->
uint_v r + uint_v c' * pow2 (bits t) == uint_v a + uint_v b + uint_v c)
let addcarry #t cin x y =
let res = x +. cin +. y in
let c = logand (logor (lt_mask res x) (logand (eq_mask res x) cin)) (uint #t 1) in
logand_lemma (eq_mask res x) cin;
logor_lemma (lt_mask res x) (logand (eq_mask res x) cin);
logand_mask (logor (lt_mask res x) (logand (eq_mask res x) cin)) (uint #t 1) 1;
c, res
inline_for_extraction noextract
val subborrow: #t:limb_t -> c:carry t -> a:limb t -> b:limb t ->
Pure (carry t & limb t)
(requires True)
(ensures fun (c', r) ->
uint_v r - uint_v c' * pow2 (bits t) == uint_v a - uint_v b - uint_v c)
let subborrow #t cin x y =
let res = x -. y -. cin in
let c = logand (logor (gt_mask res x) (logand (eq_mask res x) cin)) (uint #t 1) in
logand_lemma (eq_mask res x) cin;
logor_lemma (gt_mask res x) (logand (eq_mask res x) cin);
logand_mask (logor (gt_mask res x) (logand (eq_mask res x) cin)) (uint #t 1) 1;
c, res
inline_for_extraction noextract
val mul_wide: #t:limb_t -> a:limb t -> b:limb t ->
Pure (tuple2 (limb t) (limb t))
(requires True)
(ensures fun (hi, lo) ->
v lo + v hi * pow2 (bits t) == v a * v b)
let mul_wide #t a b =
Math.Lemmas.lemma_mult_lt_sqr (v a) (v b) (pow2 (bits t));
match t with
| U32 ->
let res = to_u64 a *! to_u64 b in
to_u32 (res >>. 32ul), to_u32 res
| U64 ->
let res = mul64_wide a b in
to_u64 (res >>. 64ul), to_u64 res
val lemma_mul_wide_add: #t:limb_t -> a:limb t -> b:limb t -> c:limb t -> d:limb t ->
Lemma (v a * v b + v c + v d < pow2 (2 * bits t))
let lemma_mul_wide_add #t a b c d =
let n = pow2 (bits t) in
//assert (v a <= n - 1 /\ v b <= n - 1 /\ v c <= n - 1 /\ v d <= n - 1);
Math.Lemmas.lemma_mult_le_left (v a) (v b) (n - 1);
Math.Lemmas.lemma_mult_le_right (n - 1) (v a) (n - 1);
assert (v a * v b + v c + v d <= (n - 1) * (n - 1) + (n - 1) + (n - 1));
assert ((n - 1) * (n - 1) + (n - 1) + (n - 1) == n * n - 1)
val mul_wide_add: #t:limb_t -> a:limb t -> b:limb t -> c:limb t ->
Pure (tuple2 (limb t) (limb t))
(requires True)
(ensures fun (hi, lo) -> v lo + v hi * pow2 (bits t) == v a * v b + v c)
let mul_wide_add #t a b c =
lemma_mul_wide_add a b c (uint #t 0);
Math.Lemmas.small_mod (v a * v b + v c) (pow2 (2 * bits t));
match t with
| U32 ->
let res = to_u64 a *! to_u64 b +! to_u64 c in
assert (v res == v a * v b + v c);
let hi = to_u32 (res >>. 32ul) in
assert (v hi == v res / pow2 32);
let lo = to_u32 res in
assert (v lo == v res % pow2 32);
Math.Lemmas.euclidean_division_definition (v res) (pow2 32);
hi, lo
| U64 ->
let res = mul64_wide a b +! to_u128 c in
assert (v res == v a * v b + v c);
let hi = to_u64 (res >>. 64ul) in
assert (v hi == v res / pow2 64);
let lo = to_u64 res in
assert (v lo == v res % pow2 64);
Math.Lemmas.euclidean_division_definition (v res) (pow2 64);
hi, lo
val mul_wide_add2: #t:limb_t -> a:limb t -> b:limb t -> c:limb t -> d:limb t ->
Pure (tuple2 (limb t) (limb t))
(requires True)
(ensures fun (hi, lo) -> v lo + v hi * pow2 (bits t) == v a * v b + v c + v d)
let mul_wide_add2 #t a b c d =
lemma_mul_wide_add a b c d;
Math.Lemmas.small_mod (v a * v b + v c + v d) (pow2 (2 * bits t));
match t with
| U32 ->
let res = to_u64 a *! to_u64 b +! to_u64 c +! to_u64 d in
assert (v res == v a * v b + v c + v d);
let hi = to_u32 (res >>. 32ul) in
assert (v hi == v res / pow2 32);
let lo = to_u32 res in
assert (v lo == v res % pow2 32);
Math.Lemmas.euclidean_division_definition (v res) (pow2 32);
hi, lo
| U64 ->
let res = mul64_wide a b +! to_u128 c +! to_u128 d in
assert (v res == v a * v b + v c + v d);
let hi = to_u64 (res >>. 64ul) in
assert (v hi == v res / pow2 64);
let lo = to_u64 res in
assert (v lo == v res % pow2 64);
Math.Lemmas.euclidean_division_definition (v res) (pow2 64);
hi, lo
inline_for_extraction noextract | false | false | Hacl.Spec.Bignum.Base.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val mask_values : x: Hacl.Spec.Bignum.Definitions.limb t -> Prims.logical | [] | Hacl.Spec.Bignum.Base.mask_values | {
"file_name": "code/bignum/Hacl.Spec.Bignum.Base.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | x: Hacl.Spec.Bignum.Definitions.limb t -> Prims.logical | {
"end_col": 47,
"end_line": 138,
"start_col": 2,
"start_line": 138
} |
|
Prims.Tot | val mask_select: #t:limb_t -> mask:limb t -> a:limb t -> b:limb t -> limb t | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let mask_select #t mask a b =
(mask &. a) |. ((lognot mask) &. b) | val mask_select: #t:limb_t -> mask:limb t -> a:limb t -> b:limb t -> limb t
let mask_select #t mask a b = | false | null | false | (mask &. a) |. ((lognot mask) &. b) | {
"checked_file": "Hacl.Spec.Bignum.Base.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Spec.Bignum.Base.fst"
} | [
"total"
] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.Definitions.limb",
"Lib.IntTypes.op_Bar_Dot",
"Lib.IntTypes.SEC",
"Lib.IntTypes.op_Amp_Dot",
"Lib.IntTypes.lognot"
] | [] | module Hacl.Spec.Bignum.Base
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Spec.Bignum.Definitions
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
inline_for_extraction noextract
let carry (t:limb_t) = x:limb t{uint_v x == 0 \/ uint_v x == 1}
(**
This is non-stateful version of code/fallback functions
*)
inline_for_extraction noextract
val addcarry: #t:limb_t -> c:carry t -> a:limb t -> b:limb t ->
Pure (carry t & limb t)
(requires True)
(ensures fun (c', r) ->
uint_v r + uint_v c' * pow2 (bits t) == uint_v a + uint_v b + uint_v c)
let addcarry #t cin x y =
let res = x +. cin +. y in
let c = logand (logor (lt_mask res x) (logand (eq_mask res x) cin)) (uint #t 1) in
logand_lemma (eq_mask res x) cin;
logor_lemma (lt_mask res x) (logand (eq_mask res x) cin);
logand_mask (logor (lt_mask res x) (logand (eq_mask res x) cin)) (uint #t 1) 1;
c, res
inline_for_extraction noextract
val subborrow: #t:limb_t -> c:carry t -> a:limb t -> b:limb t ->
Pure (carry t & limb t)
(requires True)
(ensures fun (c', r) ->
uint_v r - uint_v c' * pow2 (bits t) == uint_v a - uint_v b - uint_v c)
let subborrow #t cin x y =
let res = x -. y -. cin in
let c = logand (logor (gt_mask res x) (logand (eq_mask res x) cin)) (uint #t 1) in
logand_lemma (eq_mask res x) cin;
logor_lemma (gt_mask res x) (logand (eq_mask res x) cin);
logand_mask (logor (gt_mask res x) (logand (eq_mask res x) cin)) (uint #t 1) 1;
c, res
inline_for_extraction noextract
val mul_wide: #t:limb_t -> a:limb t -> b:limb t ->
Pure (tuple2 (limb t) (limb t))
(requires True)
(ensures fun (hi, lo) ->
v lo + v hi * pow2 (bits t) == v a * v b)
let mul_wide #t a b =
Math.Lemmas.lemma_mult_lt_sqr (v a) (v b) (pow2 (bits t));
match t with
| U32 ->
let res = to_u64 a *! to_u64 b in
to_u32 (res >>. 32ul), to_u32 res
| U64 ->
let res = mul64_wide a b in
to_u64 (res >>. 64ul), to_u64 res
val lemma_mul_wide_add: #t:limb_t -> a:limb t -> b:limb t -> c:limb t -> d:limb t ->
Lemma (v a * v b + v c + v d < pow2 (2 * bits t))
let lemma_mul_wide_add #t a b c d =
let n = pow2 (bits t) in
//assert (v a <= n - 1 /\ v b <= n - 1 /\ v c <= n - 1 /\ v d <= n - 1);
Math.Lemmas.lemma_mult_le_left (v a) (v b) (n - 1);
Math.Lemmas.lemma_mult_le_right (n - 1) (v a) (n - 1);
assert (v a * v b + v c + v d <= (n - 1) * (n - 1) + (n - 1) + (n - 1));
assert ((n - 1) * (n - 1) + (n - 1) + (n - 1) == n * n - 1)
val mul_wide_add: #t:limb_t -> a:limb t -> b:limb t -> c:limb t ->
Pure (tuple2 (limb t) (limb t))
(requires True)
(ensures fun (hi, lo) -> v lo + v hi * pow2 (bits t) == v a * v b + v c)
let mul_wide_add #t a b c =
lemma_mul_wide_add a b c (uint #t 0);
Math.Lemmas.small_mod (v a * v b + v c) (pow2 (2 * bits t));
match t with
| U32 ->
let res = to_u64 a *! to_u64 b +! to_u64 c in
assert (v res == v a * v b + v c);
let hi = to_u32 (res >>. 32ul) in
assert (v hi == v res / pow2 32);
let lo = to_u32 res in
assert (v lo == v res % pow2 32);
Math.Lemmas.euclidean_division_definition (v res) (pow2 32);
hi, lo
| U64 ->
let res = mul64_wide a b +! to_u128 c in
assert (v res == v a * v b + v c);
let hi = to_u64 (res >>. 64ul) in
assert (v hi == v res / pow2 64);
let lo = to_u64 res in
assert (v lo == v res % pow2 64);
Math.Lemmas.euclidean_division_definition (v res) (pow2 64);
hi, lo
val mul_wide_add2: #t:limb_t -> a:limb t -> b:limb t -> c:limb t -> d:limb t ->
Pure (tuple2 (limb t) (limb t))
(requires True)
(ensures fun (hi, lo) -> v lo + v hi * pow2 (bits t) == v a * v b + v c + v d)
let mul_wide_add2 #t a b c d =
lemma_mul_wide_add a b c d;
Math.Lemmas.small_mod (v a * v b + v c + v d) (pow2 (2 * bits t));
match t with
| U32 ->
let res = to_u64 a *! to_u64 b +! to_u64 c +! to_u64 d in
assert (v res == v a * v b + v c + v d);
let hi = to_u32 (res >>. 32ul) in
assert (v hi == v res / pow2 32);
let lo = to_u32 res in
assert (v lo == v res % pow2 32);
Math.Lemmas.euclidean_division_definition (v res) (pow2 32);
hi, lo
| U64 ->
let res = mul64_wide a b +! to_u128 c +! to_u128 d in
assert (v res == v a * v b + v c + v d);
let hi = to_u64 (res >>. 64ul) in
assert (v hi == v res / pow2 64);
let lo = to_u64 res in
assert (v lo == v res % pow2 64);
Math.Lemmas.euclidean_division_definition (v res) (pow2 64);
hi, lo
inline_for_extraction noextract
let mask_values (#t:limb_t) (x:limb t) =
v x = v (zeros t SEC) \/ v x = v (ones t SEC)
inline_for_extraction noextract
let unsafe_bool_of_limb0 (#t:limb_t) (m:limb t) : b:bool{b <==> v m = 0} =
let open Lib.RawIntTypes in
match t with
| U32 -> FStar.UInt32.(u32_to_UInt32 m =^ 0ul)
| U64 -> FStar.UInt64.(u64_to_UInt64 m =^ 0uL)
inline_for_extraction noextract
let unsafe_bool_of_limb (#t:limb_t) (m:limb t) : b:bool{b <==> v m = v (ones t SEC)} =
let open Lib.RawIntTypes in
match t with
| U32 -> FStar.UInt32.(u32_to_UInt32 m =^ u32_to_UInt32 (ones U32 SEC))
| U64 -> FStar.UInt64.(u64_to_UInt64 m =^ u64_to_UInt64 (ones U64 SEC))
inline_for_extraction noextract
let size_to_limb (#t:limb_t) (x:size_t) : limb t =
match t with
| U32 -> size_to_uint32 x
| U64 -> size_to_uint64 x
inline_for_extraction noextract
let unsafe_size_from_limb (#t:limb_t) (x:limb t{v x <= max_size_t}) : size_t =
let open Lib.RawIntTypes in
match t with
| U32 -> u32_to_UInt32 x
| U64 -> u32_to_UInt32 (to_u32 x)
inline_for_extraction noextract
val mask_select: #t:limb_t -> mask:limb t -> a:limb t -> b:limb t -> limb t | false | false | Hacl.Spec.Bignum.Base.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val mask_select: #t:limb_t -> mask:limb t -> a:limb t -> b:limb t -> limb t | [] | Hacl.Spec.Bignum.Base.mask_select | {
"file_name": "code/bignum/Hacl.Spec.Bignum.Base.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
mask: Hacl.Spec.Bignum.Definitions.limb t ->
a: Hacl.Spec.Bignum.Definitions.limb t ->
b: Hacl.Spec.Bignum.Definitions.limb t
-> Hacl.Spec.Bignum.Definitions.limb t | {
"end_col": 37,
"end_line": 175,
"start_col": 2,
"start_line": 175
} |
Prims.Tot | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let carry (t:limb_t) = x:limb t{uint_v x == 0 \/ uint_v x == 1} | let carry (t: limb_t) = | false | null | false | x: limb t {uint_v x == 0 \/ uint_v x == 1} | {
"checked_file": "Hacl.Spec.Bignum.Base.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Spec.Bignum.Base.fst"
} | [
"total"
] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.Definitions.limb",
"Prims.l_or",
"Prims.eq2",
"Prims.int",
"Lib.IntTypes.uint_v",
"Lib.IntTypes.SEC"
] | [] | module Hacl.Spec.Bignum.Base
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Spec.Bignum.Definitions
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0" | false | true | Hacl.Spec.Bignum.Base.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val carry : t: Hacl.Spec.Bignum.Definitions.limb_t -> Type0 | [] | Hacl.Spec.Bignum.Base.carry | {
"file_name": "code/bignum/Hacl.Spec.Bignum.Base.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | t: Hacl.Spec.Bignum.Definitions.limb_t -> Type0 | {
"end_col": 63,
"end_line": 12,
"start_col": 23,
"start_line": 12
} |
|
Prims.Tot | val size_to_limb (#t: limb_t) (x: size_t) : limb t | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let size_to_limb (#t:limb_t) (x:size_t) : limb t =
match t with
| U32 -> size_to_uint32 x
| U64 -> size_to_uint64 x | val size_to_limb (#t: limb_t) (x: size_t) : limb t
let size_to_limb (#t: limb_t) (x: size_t) : limb t = | false | null | false | match t with
| U32 -> size_to_uint32 x
| U64 -> size_to_uint64 x | {
"checked_file": "Hacl.Spec.Bignum.Base.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Spec.Bignum.Base.fst"
} | [
"total"
] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Lib.IntTypes.size_to_uint32",
"Lib.IntTypes.size_to_uint64",
"Hacl.Spec.Bignum.Definitions.limb"
] | [] | module Hacl.Spec.Bignum.Base
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Spec.Bignum.Definitions
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
inline_for_extraction noextract
let carry (t:limb_t) = x:limb t{uint_v x == 0 \/ uint_v x == 1}
(**
This is non-stateful version of code/fallback functions
*)
inline_for_extraction noextract
val addcarry: #t:limb_t -> c:carry t -> a:limb t -> b:limb t ->
Pure (carry t & limb t)
(requires True)
(ensures fun (c', r) ->
uint_v r + uint_v c' * pow2 (bits t) == uint_v a + uint_v b + uint_v c)
let addcarry #t cin x y =
let res = x +. cin +. y in
let c = logand (logor (lt_mask res x) (logand (eq_mask res x) cin)) (uint #t 1) in
logand_lemma (eq_mask res x) cin;
logor_lemma (lt_mask res x) (logand (eq_mask res x) cin);
logand_mask (logor (lt_mask res x) (logand (eq_mask res x) cin)) (uint #t 1) 1;
c, res
inline_for_extraction noextract
val subborrow: #t:limb_t -> c:carry t -> a:limb t -> b:limb t ->
Pure (carry t & limb t)
(requires True)
(ensures fun (c', r) ->
uint_v r - uint_v c' * pow2 (bits t) == uint_v a - uint_v b - uint_v c)
let subborrow #t cin x y =
let res = x -. y -. cin in
let c = logand (logor (gt_mask res x) (logand (eq_mask res x) cin)) (uint #t 1) in
logand_lemma (eq_mask res x) cin;
logor_lemma (gt_mask res x) (logand (eq_mask res x) cin);
logand_mask (logor (gt_mask res x) (logand (eq_mask res x) cin)) (uint #t 1) 1;
c, res
inline_for_extraction noextract
val mul_wide: #t:limb_t -> a:limb t -> b:limb t ->
Pure (tuple2 (limb t) (limb t))
(requires True)
(ensures fun (hi, lo) ->
v lo + v hi * pow2 (bits t) == v a * v b)
let mul_wide #t a b =
Math.Lemmas.lemma_mult_lt_sqr (v a) (v b) (pow2 (bits t));
match t with
| U32 ->
let res = to_u64 a *! to_u64 b in
to_u32 (res >>. 32ul), to_u32 res
| U64 ->
let res = mul64_wide a b in
to_u64 (res >>. 64ul), to_u64 res
val lemma_mul_wide_add: #t:limb_t -> a:limb t -> b:limb t -> c:limb t -> d:limb t ->
Lemma (v a * v b + v c + v d < pow2 (2 * bits t))
let lemma_mul_wide_add #t a b c d =
let n = pow2 (bits t) in
//assert (v a <= n - 1 /\ v b <= n - 1 /\ v c <= n - 1 /\ v d <= n - 1);
Math.Lemmas.lemma_mult_le_left (v a) (v b) (n - 1);
Math.Lemmas.lemma_mult_le_right (n - 1) (v a) (n - 1);
assert (v a * v b + v c + v d <= (n - 1) * (n - 1) + (n - 1) + (n - 1));
assert ((n - 1) * (n - 1) + (n - 1) + (n - 1) == n * n - 1)
val mul_wide_add: #t:limb_t -> a:limb t -> b:limb t -> c:limb t ->
Pure (tuple2 (limb t) (limb t))
(requires True)
(ensures fun (hi, lo) -> v lo + v hi * pow2 (bits t) == v a * v b + v c)
let mul_wide_add #t a b c =
lemma_mul_wide_add a b c (uint #t 0);
Math.Lemmas.small_mod (v a * v b + v c) (pow2 (2 * bits t));
match t with
| U32 ->
let res = to_u64 a *! to_u64 b +! to_u64 c in
assert (v res == v a * v b + v c);
let hi = to_u32 (res >>. 32ul) in
assert (v hi == v res / pow2 32);
let lo = to_u32 res in
assert (v lo == v res % pow2 32);
Math.Lemmas.euclidean_division_definition (v res) (pow2 32);
hi, lo
| U64 ->
let res = mul64_wide a b +! to_u128 c in
assert (v res == v a * v b + v c);
let hi = to_u64 (res >>. 64ul) in
assert (v hi == v res / pow2 64);
let lo = to_u64 res in
assert (v lo == v res % pow2 64);
Math.Lemmas.euclidean_division_definition (v res) (pow2 64);
hi, lo
val mul_wide_add2: #t:limb_t -> a:limb t -> b:limb t -> c:limb t -> d:limb t ->
Pure (tuple2 (limb t) (limb t))
(requires True)
(ensures fun (hi, lo) -> v lo + v hi * pow2 (bits t) == v a * v b + v c + v d)
let mul_wide_add2 #t a b c d =
lemma_mul_wide_add a b c d;
Math.Lemmas.small_mod (v a * v b + v c + v d) (pow2 (2 * bits t));
match t with
| U32 ->
let res = to_u64 a *! to_u64 b +! to_u64 c +! to_u64 d in
assert (v res == v a * v b + v c + v d);
let hi = to_u32 (res >>. 32ul) in
assert (v hi == v res / pow2 32);
let lo = to_u32 res in
assert (v lo == v res % pow2 32);
Math.Lemmas.euclidean_division_definition (v res) (pow2 32);
hi, lo
| U64 ->
let res = mul64_wide a b +! to_u128 c +! to_u128 d in
assert (v res == v a * v b + v c + v d);
let hi = to_u64 (res >>. 64ul) in
assert (v hi == v res / pow2 64);
let lo = to_u64 res in
assert (v lo == v res % pow2 64);
Math.Lemmas.euclidean_division_definition (v res) (pow2 64);
hi, lo
inline_for_extraction noextract
let mask_values (#t:limb_t) (x:limb t) =
v x = v (zeros t SEC) \/ v x = v (ones t SEC)
inline_for_extraction noextract
let unsafe_bool_of_limb0 (#t:limb_t) (m:limb t) : b:bool{b <==> v m = 0} =
let open Lib.RawIntTypes in
match t with
| U32 -> FStar.UInt32.(u32_to_UInt32 m =^ 0ul)
| U64 -> FStar.UInt64.(u64_to_UInt64 m =^ 0uL)
inline_for_extraction noextract
let unsafe_bool_of_limb (#t:limb_t) (m:limb t) : b:bool{b <==> v m = v (ones t SEC)} =
let open Lib.RawIntTypes in
match t with
| U32 -> FStar.UInt32.(u32_to_UInt32 m =^ u32_to_UInt32 (ones U32 SEC))
| U64 -> FStar.UInt64.(u64_to_UInt64 m =^ u64_to_UInt64 (ones U64 SEC))
inline_for_extraction noextract | false | false | Hacl.Spec.Bignum.Base.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val size_to_limb (#t: limb_t) (x: size_t) : limb t | [] | Hacl.Spec.Bignum.Base.size_to_limb | {
"file_name": "code/bignum/Hacl.Spec.Bignum.Base.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | x: Lib.IntTypes.size_t -> Hacl.Spec.Bignum.Definitions.limb t | {
"end_col": 27,
"end_line": 161,
"start_col": 2,
"start_line": 159
} |
Prims.Tot | val unsafe_bool_of_limb0 (#t: limb_t) (m: limb t) : b: bool{b <==> v m = 0} | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | false | let unsafe_bool_of_limb0 (#t:limb_t) (m:limb t) : b:bool{b <==> v m = 0} =
let open Lib.RawIntTypes in
match t with
| U32 -> FStar.UInt32.(u32_to_UInt32 m =^ 0ul)
| U64 -> FStar.UInt64.(u64_to_UInt64 m =^ 0uL) | val unsafe_bool_of_limb0 (#t: limb_t) (m: limb t) : b: bool{b <==> v m = 0}
let unsafe_bool_of_limb0 (#t: limb_t) (m: limb t) : b: bool{b <==> v m = 0} = | false | null | false | let open Lib.RawIntTypes in
match t with
| U32 -> let open FStar.UInt32 in u32_to_UInt32 m =^ 0ul
| U64 -> let open FStar.UInt64 in u64_to_UInt64 m =^ 0uL | {
"checked_file": "Hacl.Spec.Bignum.Base.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Spec.Bignum.Base.fst"
} | [
"total"
] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.Definitions.limb",
"FStar.UInt32.op_Equals_Hat",
"Lib.RawIntTypes.u32_to_UInt32",
"FStar.UInt32.__uint_to_t",
"FStar.UInt64.op_Equals_Hat",
"Lib.RawIntTypes.u64_to_UInt64",
"FStar.UInt64.__uint_to_t",
"Prims.bool",
"Prims.l_iff",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"Lib.IntTypes.v",
"Lib.IntTypes.SEC"
] | [] | module Hacl.Spec.Bignum.Base
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Spec.Bignum.Definitions
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
inline_for_extraction noextract
let carry (t:limb_t) = x:limb t{uint_v x == 0 \/ uint_v x == 1}
(**
This is non-stateful version of code/fallback functions
*)
inline_for_extraction noextract
val addcarry: #t:limb_t -> c:carry t -> a:limb t -> b:limb t ->
Pure (carry t & limb t)
(requires True)
(ensures fun (c', r) ->
uint_v r + uint_v c' * pow2 (bits t) == uint_v a + uint_v b + uint_v c)
let addcarry #t cin x y =
let res = x +. cin +. y in
let c = logand (logor (lt_mask res x) (logand (eq_mask res x) cin)) (uint #t 1) in
logand_lemma (eq_mask res x) cin;
logor_lemma (lt_mask res x) (logand (eq_mask res x) cin);
logand_mask (logor (lt_mask res x) (logand (eq_mask res x) cin)) (uint #t 1) 1;
c, res
inline_for_extraction noextract
val subborrow: #t:limb_t -> c:carry t -> a:limb t -> b:limb t ->
Pure (carry t & limb t)
(requires True)
(ensures fun (c', r) ->
uint_v r - uint_v c' * pow2 (bits t) == uint_v a - uint_v b - uint_v c)
let subborrow #t cin x y =
let res = x -. y -. cin in
let c = logand (logor (gt_mask res x) (logand (eq_mask res x) cin)) (uint #t 1) in
logand_lemma (eq_mask res x) cin;
logor_lemma (gt_mask res x) (logand (eq_mask res x) cin);
logand_mask (logor (gt_mask res x) (logand (eq_mask res x) cin)) (uint #t 1) 1;
c, res
inline_for_extraction noextract
val mul_wide: #t:limb_t -> a:limb t -> b:limb t ->
Pure (tuple2 (limb t) (limb t))
(requires True)
(ensures fun (hi, lo) ->
v lo + v hi * pow2 (bits t) == v a * v b)
let mul_wide #t a b =
Math.Lemmas.lemma_mult_lt_sqr (v a) (v b) (pow2 (bits t));
match t with
| U32 ->
let res = to_u64 a *! to_u64 b in
to_u32 (res >>. 32ul), to_u32 res
| U64 ->
let res = mul64_wide a b in
to_u64 (res >>. 64ul), to_u64 res
val lemma_mul_wide_add: #t:limb_t -> a:limb t -> b:limb t -> c:limb t -> d:limb t ->
Lemma (v a * v b + v c + v d < pow2 (2 * bits t))
let lemma_mul_wide_add #t a b c d =
let n = pow2 (bits t) in
//assert (v a <= n - 1 /\ v b <= n - 1 /\ v c <= n - 1 /\ v d <= n - 1);
Math.Lemmas.lemma_mult_le_left (v a) (v b) (n - 1);
Math.Lemmas.lemma_mult_le_right (n - 1) (v a) (n - 1);
assert (v a * v b + v c + v d <= (n - 1) * (n - 1) + (n - 1) + (n - 1));
assert ((n - 1) * (n - 1) + (n - 1) + (n - 1) == n * n - 1)
val mul_wide_add: #t:limb_t -> a:limb t -> b:limb t -> c:limb t ->
Pure (tuple2 (limb t) (limb t))
(requires True)
(ensures fun (hi, lo) -> v lo + v hi * pow2 (bits t) == v a * v b + v c)
let mul_wide_add #t a b c =
lemma_mul_wide_add a b c (uint #t 0);
Math.Lemmas.small_mod (v a * v b + v c) (pow2 (2 * bits t));
match t with
| U32 ->
let res = to_u64 a *! to_u64 b +! to_u64 c in
assert (v res == v a * v b + v c);
let hi = to_u32 (res >>. 32ul) in
assert (v hi == v res / pow2 32);
let lo = to_u32 res in
assert (v lo == v res % pow2 32);
Math.Lemmas.euclidean_division_definition (v res) (pow2 32);
hi, lo
| U64 ->
let res = mul64_wide a b +! to_u128 c in
assert (v res == v a * v b + v c);
let hi = to_u64 (res >>. 64ul) in
assert (v hi == v res / pow2 64);
let lo = to_u64 res in
assert (v lo == v res % pow2 64);
Math.Lemmas.euclidean_division_definition (v res) (pow2 64);
hi, lo
val mul_wide_add2: #t:limb_t -> a:limb t -> b:limb t -> c:limb t -> d:limb t ->
Pure (tuple2 (limb t) (limb t))
(requires True)
(ensures fun (hi, lo) -> v lo + v hi * pow2 (bits t) == v a * v b + v c + v d)
let mul_wide_add2 #t a b c d =
lemma_mul_wide_add a b c d;
Math.Lemmas.small_mod (v a * v b + v c + v d) (pow2 (2 * bits t));
match t with
| U32 ->
let res = to_u64 a *! to_u64 b +! to_u64 c +! to_u64 d in
assert (v res == v a * v b + v c + v d);
let hi = to_u32 (res >>. 32ul) in
assert (v hi == v res / pow2 32);
let lo = to_u32 res in
assert (v lo == v res % pow2 32);
Math.Lemmas.euclidean_division_definition (v res) (pow2 32);
hi, lo
| U64 ->
let res = mul64_wide a b +! to_u128 c +! to_u128 d in
assert (v res == v a * v b + v c + v d);
let hi = to_u64 (res >>. 64ul) in
assert (v hi == v res / pow2 64);
let lo = to_u64 res in
assert (v lo == v res % pow2 64);
Math.Lemmas.euclidean_division_definition (v res) (pow2 64);
hi, lo
inline_for_extraction noextract
let mask_values (#t:limb_t) (x:limb t) =
v x = v (zeros t SEC) \/ v x = v (ones t SEC)
inline_for_extraction noextract | false | false | Hacl.Spec.Bignum.Base.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | null | val unsafe_bool_of_limb0 (#t: limb_t) (m: limb t) : b: bool{b <==> v m = 0} | [] | Hacl.Spec.Bignum.Base.unsafe_bool_of_limb0 | {
"file_name": "code/bignum/Hacl.Spec.Bignum.Base.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | m: Hacl.Spec.Bignum.Definitions.limb t -> b: Prims.bool{b <==> Lib.IntTypes.v m = 0} | {
"end_col": 48,
"end_line": 146,
"start_col": 2,
"start_line": 143
} |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.