file_name stringlengths 5 52 | name stringlengths 4 95 | original_source_type stringlengths 0 23k | source_type stringlengths 9 23k | source_definition stringlengths 9 57.9k | source dict | source_range dict | file_context stringlengths 0 721k | dependencies dict | opens_and_abbrevs listlengths 2 94 | vconfig dict | interleaved bool 1
class | verbose_type stringlengths 1 7.42k | effect stringclasses 118
values | effect_flags listlengths 0 2 | mutual_with listlengths 0 11 | ideal_premises listlengths 0 236 | proof_features listlengths 0 1 | is_simple_lemma bool 2
classes | is_div bool 2
classes | is_proof bool 2
classes | is_simply_typed bool 2
classes | is_type bool 2
classes | partial_definition stringlengths 5 3.99k | completed_definiton stringlengths 1 1.63M | isa_cross_project_example bool 1
class |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
BinaryTrees.fst | BinaryTrees.find_some | val find_some : p:(int -> Tot bool) -> t:tree ->
Lemma (None? (find p t) \/ p (Some?.v (find p t))) | val find_some : p:(int -> Tot bool) -> t:tree ->
Lemma (None? (find p t) \/ p (Some?.v (find p t))) | let rec find_some p t =
match t with
| Leaf -> ()
| Node n t1 t2 -> find_some p t1; find_some p t2 | {
"file_name": "examples/data_structures/BinaryTrees.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 50,
"end_line": 53,
"start_col": 0,
"start_line": 50
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinaryTrees.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: (_: Prims.int -> Prims.bool) -> t: BinaryTrees.tree
-> FStar.Pervasives.Lemma
(ensures None? (BinaryTrees.find p t) \/ p (Some?.v (BinaryTrees.find p t))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.bool",
"BinaryTrees.tree",
"BinaryTrees.find_some",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec find_some p t =
| match t with
| Leaf -> ()
| Node n t1 t2 ->
find_some p t1;
find_some p t2 | false |
BinaryTrees.fst | BinaryTrees.map_option | val map_option : f: (_: _ -> _) -> o: FStar.Pervasives.Native.option _ -> FStar.Pervasives.Native.option _ | let map_option f o = match o with
| Some n -> Some (f n)
| None -> None | {
"file_name": "examples/data_structures/BinaryTrees.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 36,
"end_line": 57,
"start_col": 0,
"start_line": 55
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinaryTrees.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f: (_: _ -> _) -> o: FStar.Pervasives.Native.option _ -> FStar.Pervasives.Native.option _ | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.Native.option",
"FStar.Pervasives.Native.Some",
"FStar.Pervasives.Native.None"
] | [] | false | false | false | true | false | let map_option f o =
| match o with
| Some n -> Some (f n)
| None -> None | false | |
BinaryTrees.fst | BinaryTrees.map_find | val map_find : p:(int -> Tot bool) -> f:(int -> Tot int) -> t:tree ->
Lemma (find p (map f t) = map_option f (find (compose p f) t)) | val map_find : p:(int -> Tot bool) -> f:(int -> Tot int) -> t:tree ->
Lemma (find p (map f t) = map_option f (find (compose p f) t)) | let rec map_find p f t =
match t with
| Leaf -> ()
| Node n t1 t2 -> map_find p f t1; map_find p f t2 | {
"file_name": "examples/data_structures/BinaryTrees.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 52,
"end_line": 66,
"start_col": 0,
"start_line": 63
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinaryTrees.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: (_: Prims.int -> Prims.bool) -> f: (_: Prims.int -> Prims.int) -> t: BinaryTrees.tree
-> FStar.Pervasives.Lemma
(ensures
BinaryTrees.find p (BinaryTrees.map f t) =
BinaryTrees.map_option f (BinaryTrees.find (BinaryTrees.compose p f) t)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.bool",
"BinaryTrees.tree",
"BinaryTrees.map_find",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec map_find p f t =
| match t with
| Leaf -> ()
| Node n t1 t2 ->
map_find p f t1;
map_find p f t2 | false |
BinaryTrees.fst | BinaryTrees.fold_map | val fold_map : fm:(int -> int) -> ff:(int -> int -> int -> int) -> a:int -> t:tree ->
Lemma (fold ff a (map fm t) = fold (compose ff fm) a t) | val fold_map : fm:(int -> int) -> ff:(int -> int -> int -> int) -> a:int -> t:tree ->
Lemma (fold ff a (map fm t) = fold (compose ff fm) a t) | let rec fold_map fm ff a t =
match t with
| Leaf -> ()
| Node n t1 t2 -> fold_map fm ff a t1; fold_map fm ff a t2 | {
"file_name": "examples/data_structures/BinaryTrees.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 60,
"end_line": 85,
"start_col": 0,
"start_line": 82
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinaryTrees.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
fm: (_: Prims.int -> Prims.int) ->
ff: (_: Prims.int -> _: Prims.int -> _: Prims.int -> Prims.int) ->
a: Prims.int ->
t: BinaryTrees.tree
-> FStar.Pervasives.Lemma
(ensures
BinaryTrees.fold ff a (BinaryTrees.map fm t) =
BinaryTrees.fold (BinaryTrees.compose ff fm) a t) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"BinaryTrees.tree",
"BinaryTrees.fold_map",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec fold_map fm ff a t =
| match t with
| Leaf -> ()
| Node n t1 t2 ->
fold_map fm ff a t1;
fold_map fm ff a t2 | false |
BinaryTrees.fst | BinaryTrees.in_tree | val in_tree : int -> tree -> Tot bool | val in_tree : int -> tree -> Tot bool | let rec in_tree x t =
match t with
| Leaf -> false
| Node n t1 t2 -> x = n || in_tree x t1 || in_tree x t2 | {
"file_name": "examples/data_structures/BinaryTrees.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 57,
"end_line": 72,
"start_col": 0,
"start_line": 69
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinaryTrees.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Prims.int -> t: BinaryTrees.tree -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"BinaryTrees.tree",
"Prims.op_BarBar",
"Prims.op_Equality",
"BinaryTrees.in_tree",
"Prims.bool"
] | [
"recursion"
] | false | false | false | true | false | let rec in_tree x t =
| match t with
| Leaf -> false
| Node n t1 t2 -> x = n || in_tree x t1 || in_tree x t2 | false |
BinaryTrees.fst | BinaryTrees.fold | val fold : (int -> 'a -> 'a -> 'a) -> 'a -> tree -> 'a | val fold : (int -> 'a -> 'a -> 'a) -> 'a -> tree -> 'a | let rec fold f a t =
match t with
| Leaf -> a
| Node n t1 t2 -> f n (fold f a t1) (fold f a t2) | {
"file_name": "examples/data_structures/BinaryTrees.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 51,
"end_line": 78,
"start_col": 0,
"start_line": 75
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinaryTrees.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f: (_: Prims.int -> _: 'a -> _: 'a -> 'a) -> a: 'a -> t: BinaryTrees.tree -> 'a | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"BinaryTrees.tree",
"BinaryTrees.fold"
] | [
"recursion"
] | false | false | false | true | false | let rec fold f a t =
| match t with
| Leaf -> a
| Node n t1 t2 -> f n (fold f a t1) (fold f a t2) | false |
BinaryTrees.fst | BinaryTrees.find | val find : p:(int -> Tot bool) -> tree -> Tot (option int) | val find : p:(int -> Tot bool) -> tree -> Tot (option int) | let rec find p t =
match t with
| Leaf -> None
| Node n t1 t2 -> if p n then Some n else
if Some? (find p t1) then find p t1
else find p t2 | {
"file_name": "examples/data_structures/BinaryTrees.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 55,
"end_line": 46,
"start_col": 0,
"start_line": 41
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinaryTrees.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: (_: Prims.int -> Prims.bool) -> t: BinaryTrees.tree -> FStar.Pervasives.Native.option Prims.int | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"Prims.bool",
"BinaryTrees.tree",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.Some",
"FStar.Pervasives.Native.uu___is_Some",
"BinaryTrees.find",
"FStar.Pervasives.Native.option"
] | [
"recursion"
] | false | false | false | true | false | let rec find p t =
| match t with
| Leaf -> None
| Node n t1 t2 -> if p n then Some n else if Some? (find p t1) then find p t1 else find p t2 | false |
BinaryTrees.fst | BinaryTrees.in_tree_fold | val in_tree_fold : x:int -> t:tree ->
Lemma (in_tree x t = fold (fun n b1 b2 -> x = n || b1 || b2) false t) | val in_tree_fold : x:int -> t:tree ->
Lemma (in_tree x t = fold (fun n b1 b2 -> x = n || b1 || b2) false t) | let rec in_tree_fold x t =
match t with
| Leaf -> ()
| Node n t1 t2 -> in_tree_fold x t1; in_tree_fold x t2 | {
"file_name": "examples/data_structures/BinaryTrees.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 56,
"end_line": 99,
"start_col": 0,
"start_line": 96
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinaryTrees.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Prims.int -> t: BinaryTrees.tree
-> FStar.Pervasives.Lemma
(ensures BinaryTrees.in_tree x t = BinaryTrees.fold (fun n b1 b2 -> x = n || b1 || b2) false t) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"BinaryTrees.tree",
"BinaryTrees.in_tree_fold",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec in_tree_fold x t =
| match t with
| Leaf -> ()
| Node n t1 t2 ->
in_tree_fold x t1;
in_tree_fold x t2 | false |
BinaryTrees.fst | BinaryTrees.size_fold | val size_fold : t:tree ->
Lemma (size t = fold #nat (fun _ s1 s2 -> 1 + s1 + s2) 0 t) | val size_fold : t:tree ->
Lemma (size t = fold #nat (fun _ s1 s2 -> 1 + s1 + s2) 0 t) | let rec size_fold t =
match t with
| Leaf -> ()
| Node n t1 t2 -> size_fold t1; size_fold t2 | {
"file_name": "examples/data_structures/BinaryTrees.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 46,
"end_line": 92,
"start_col": 0,
"start_line": 89
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinaryTrees.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | t: BinaryTrees.tree
-> FStar.Pervasives.Lemma
(ensures BinaryTrees.size t = BinaryTrees.fold (fun _ s1 s2 -> 1 + s1 + s2) 0 t) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"BinaryTrees.tree",
"Prims.int",
"BinaryTrees.size_fold",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec size_fold t =
| match t with
| Leaf -> ()
| Node n t1 t2 ->
size_fold t1;
size_fold t2 | false |
BinaryTrees.fst | BinaryTrees.find_fold | val find_fold : f:(int -> Tot bool) -> tree -> Tot (option (x:int{f x})) | val find_fold : f:(int -> Tot bool) -> tree -> Tot (option (x:int{f x})) | let find_fold f = fold #(option (x:int{f x}))
(fun n o1 o2 -> if f n then Some n else
if Some? o1 then o1 else o2) None | {
"file_name": "examples/data_structures/BinaryTrees.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 73,
"end_line": 104,
"start_col": 0,
"start_line": 102
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinaryTrees.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f: (_: Prims.int -> Prims.bool) -> _: BinaryTrees.tree
-> FStar.Pervasives.Native.option (x: Prims.int{f x}) | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"Prims.bool",
"BinaryTrees.fold",
"FStar.Pervasives.Native.option",
"Prims.b2t",
"FStar.Pervasives.Native.Some",
"FStar.Pervasives.Native.uu___is_Some",
"FStar.Pervasives.Native.None",
"BinaryTrees.tree"
] | [] | false | false | false | false | false | let find_fold f =
| fold #(option (x: int{f x}))
(fun n o1 o2 -> if f n then Some n else if Some? o1 then o1 else o2)
None | false |
GMST.fst | GMST.gmst_post | val gmst_post : s: Type -> a: Type -> s0: s -> Type | let gmst_post (s:Type) (a:Type) (s0:s) = rel:relation s -> a -> s1:s{rel s0 s1} -> GTot Type0 | {
"file_name": "examples/indexed_effects/GMST.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 93,
"end_line": 29,
"start_col": 0,
"start_line": 29
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "GMST.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: Type -> a: Type -> s0: s -> Type | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.relation"
] | [] | false | false | false | true | true | let gmst_post (s a: Type) (s0: s) =
| rel: relation s -> a -> s1: s{rel s0 s1} -> GTot Type0 | false | |
BinaryTrees.fst | BinaryTrees.revert_fold | val revert_fold : t:tree ->
Lemma (revert t = fold (fun n t1 t2 -> Node n t2 t1) Leaf t) | val revert_fold : t:tree ->
Lemma (revert t = fold (fun n t1 t2 -> Node n t2 t1) Leaf t) | let rec revert_fold t =
match t with
| Leaf -> ()
| Node n t1 t2 -> revert_fold t1; revert_fold t2 | {
"file_name": "examples/data_structures/BinaryTrees.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 50,
"end_line": 133,
"start_col": 0,
"start_line": 130
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinaryTrees.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | t: BinaryTrees.tree
-> FStar.Pervasives.Lemma
(ensures
BinaryTrees.revert t =
BinaryTrees.fold (fun n t1 t2 -> BinaryTrees.Node n t2 t1) BinaryTrees.Leaf t) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"BinaryTrees.tree",
"Prims.int",
"BinaryTrees.revert_fold",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec revert_fold t =
| match t with
| Leaf -> ()
| Node n t1 t2 ->
revert_fold t1;
revert_fold t2 | false |
GMST.fst | GMST.gmst_wp | val gmst_wp : s: Type -> a: Type -> Type | let gmst_wp (s:Type) (a:Type) = s0:s -> gmst_post s a s0 -> GTot Type0 | {
"file_name": "examples/indexed_effects/GMST.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 79,
"end_line": 30,
"start_col": 0,
"start_line": 30
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "GMST.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: Type -> a: Type -> Type | Prims.Tot | [
"total"
] | [] | [
"GMST.gmst_post"
] | [] | false | false | false | true | true | let gmst_wp (s a: Type) =
| s0: s -> gmst_post s a s0 -> GTot Type0 | false | |
GMST.fst | GMST.gmst_return | val gmst_return : s: Type -> a: Type -> x: a -> s0: s -> p: GMST.gmst_post s a s0 -> Prims.logical | let gmst_return (s:Type) (a:Type) (x:a) (s0:s) (p:gmst_post s a s0)
= forall v. v == x ==> p (fun s0 s1 -> s0 == s1) v s0 | {
"file_name": "examples/indexed_effects/GMST.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 55,
"end_line": 37,
"start_col": 0,
"start_line": 36
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "GMST.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: Type -> a: Type -> x: a -> s0: s -> p: GMST.gmst_post s a s0 -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"GMST.gmst_post",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.eq2",
"Prims.logical"
] | [] | false | false | false | false | true | let gmst_return (s a: Type) (x: a) (s0: s) (p: gmst_post s a s0) =
| forall v. v == x ==> p (fun s0 s1 -> s0 == s1) v s0 | false | |
GMST.fst | GMST.gmst_if_then_else | val gmst_if_then_else : s: Type ->
a: Type ->
p: Type0 ->
wp_then: GMST.gmst_wp s a ->
wp_else: GMST.gmst_wp s a ->
s0: s ->
post: GMST.gmst_post s a s0
-> Prims.logical | let gmst_if_then_else (s:Type) (a:Type) (p:Type)
(wp_then:gmst_wp s a) (wp_else:gmst_wp s a) (s0:s) (post:gmst_post s a s0)
= l_ITE p (wp_then s0 post) (wp_else s0 post) | {
"file_name": "examples/indexed_effects/GMST.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 47,
"end_line": 48,
"start_col": 0,
"start_line": 46
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "GMST.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
s: Type ->
a: Type ->
p: Type0 ->
wp_then: GMST.gmst_wp s a ->
wp_else: GMST.gmst_wp s a ->
s0: s ->
post: GMST.gmst_post s a s0
-> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"GMST.gmst_wp",
"GMST.gmst_post",
"Prims.l_ITE",
"Prims.logical"
] | [] | false | false | false | false | true | let gmst_if_then_else (s a p: Type) (wp_then wp_else: gmst_wp s a) (s0: s) (post: gmst_post s a s0) =
| l_ITE p (wp_then s0 post) (wp_else s0 post) | false | |
GMST.fst | GMST.gmst_ite | val gmst_ite : s: Type -> a: Type -> wp: GMST.gmst_wp s a -> s0: s -> post: GMST.gmst_post s a s0 -> Type0 | let gmst_ite (s:Type) (a:Type) (wp:gmst_wp s a) (s0:s) (post:gmst_post s a s0) =
wp s0 post | {
"file_name": "examples/indexed_effects/GMST.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 12,
"end_line": 52,
"start_col": 0,
"start_line": 51
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "GMST.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: Type -> a: Type -> wp: GMST.gmst_wp s a -> s0: s -> post: GMST.gmst_post s a s0 -> Type0 | Prims.Tot | [
"total"
] | [] | [
"GMST.gmst_wp",
"GMST.gmst_post"
] | [] | false | false | false | false | true | let gmst_ite (s a: Type) (wp: gmst_wp s a) (s0: s) (post: gmst_post s a s0) =
| wp s0 post | false | |
Hacl.Spec.Curve25519.Field51.fst | Hacl.Spec.Curve25519.Field51.fadd_zero | val fadd_zero:
f1:felem5{felem_fits5 f1 (1, 2, 1, 1, 1)}
-> out:felem5{felem_fits5 out (9, 10, 9, 9, 9) /\
feval out == feval f1} | val fadd_zero:
f1:felem5{felem_fits5 f1 (1, 2, 1, 1, 1)}
-> out:felem5{felem_fits5 out (9, 10, 9, 9, 9) /\
feval out == feval f1} | let fadd_zero (f10, f11, f12, f13, f14) =
let o0 = f10 +! u64 0x3fffffffffff68 in
let o1 = f11 +! u64 0x3ffffffffffff8 in
let o2 = f12 +! u64 0x3ffffffffffff8 in
let o3 = f13 +! u64 0x3ffffffffffff8 in
let o4 = f14 +! u64 0x3ffffffffffff8 in
lemma_add_zero (f10, f11, f12, f13, f14);
(o0, o1, o2, o3, o4) | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 44,
"start_col": 0,
"start_line": 37
} | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
f1:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 f1 (1, 2, 1, 1, 1)}
-> out:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{ Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 out (9, 10, 9, 9, 9) /\
Hacl.Spec.Curve25519.Fie... | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.felem5",
"Hacl.Spec.Curve25519.Field51.Definition.felem_fits5",
"FStar.Pervasives.Native.Mktuple5",
"Prims.nat",
"Lib.IntTypes.uint64",
"Prims.unit",
"Hacl.Spec.Curve25519.Field51.Lemmas.lemma_add_zero",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U64",
"Lib.IntTyp... | [] | false | false | false | false | false | let fadd_zero (f10, f11, f12, f13, f14) =
| let o0 = f10 +! u64 0x3fffffffffff68 in
let o1 = f11 +! u64 0x3ffffffffffff8 in
let o2 = f12 +! u64 0x3ffffffffffff8 in
let o3 = f13 +! u64 0x3ffffffffffff8 in
let o4 = f14 +! u64 0x3ffffffffffff8 in
lemma_add_zero (f10, f11, f12, f13, f14);
(o0, o1, o2, o3, o4) | false |
GMST.fst | GMST.gmst_stronger | val gmst_stronger : s: Type -> a: Type -> wp1: GMST.gmst_wp s a -> wp2: GMST.gmst_wp s a -> Prims.logical | let gmst_stronger (s:Type) (a:Type) (wp1:gmst_wp s a) (wp2:gmst_wp s a) =
forall s0 p. wp1 s0 p ==> wp2 s0 p | {
"file_name": "examples/indexed_effects/GMST.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 36,
"end_line": 56,
"start_col": 0,
"start_line": 55
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "GMST.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: Type -> a: Type -> wp1: GMST.gmst_wp s a -> wp2: GMST.gmst_wp s a -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"GMST.gmst_wp",
"Prims.l_Forall",
"GMST.gmst_post",
"Prims.l_imp",
"Prims.logical"
] | [] | false | false | false | true | true | let gmst_stronger (s a: Type) (wp1 wp2: gmst_wp s a) =
| forall s0 p. wp1 s0 p ==> wp2 s0 p | false | |
BinaryTrees.fst | BinaryTrees.revert_involutive | val revert_involutive : t:tree -> Lemma (revert (revert t) = t) | val revert_involutive : t:tree -> Lemma (revert (revert t) = t) | let rec revert_involutive t =
match t with
| Leaf -> ()
| Node n t1 t2 -> revert_involutive t1; revert_involutive t2 | {
"file_name": "examples/data_structures/BinaryTrees.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 117,
"start_col": 0,
"start_line": 114
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinaryTrees.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | t: BinaryTrees.tree
-> FStar.Pervasives.Lemma (ensures BinaryTrees.revert (BinaryTrees.revert t) = t) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"BinaryTrees.tree",
"Prims.int",
"BinaryTrees.revert_involutive",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec revert_involutive t =
| match t with
| Leaf -> ()
| Node n t1 t2 ->
revert_involutive t1;
revert_involutive t2 | false |
BinaryTrees.fst | BinaryTrees.remove_root | val remove_root : t:tree{Node? t} -> Tot tree | val remove_root : t:tree{Node? t} -> Tot tree | let rec remove_root t =
match t with
| Node n t1 t2 -> if Leaf? t1 then t2
else Node (Node?.root t1) (remove_root t1) t2 | {
"file_name": "examples/data_structures/BinaryTrees.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 65,
"end_line": 144,
"start_col": 0,
"start_line": 141
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinaryTrees.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | t: BinaryTrees.tree{Node? t} -> BinaryTrees.tree | Prims.Tot | [
"total"
] | [] | [
"BinaryTrees.tree",
"Prims.b2t",
"BinaryTrees.uu___is_Node",
"Prims.int",
"BinaryTrees.uu___is_Leaf",
"Prims.bool",
"BinaryTrees.Node",
"BinaryTrees.__proj__Node__item__root",
"BinaryTrees.remove_root"
] | [
"recursion"
] | false | false | false | false | false | let rec remove_root t =
| match t with | Node n t1 t2 -> if Leaf? t1 then t2 else Node (Node?.root t1) (remove_root t1) t2 | false |
BinaryTrees.fst | BinaryTrees.remove_add_root | val remove_add_root : x:int -> t:tree ->
Lemma (requires True) (ensures (remove_root (add_root x t) = t))
(decreases t) | val remove_add_root : x:int -> t:tree ->
Lemma (requires True) (ensures (remove_root (add_root x t) = t))
(decreases t) | let rec remove_add_root x t =
match t with
| Leaf -> ()
| Node n t1 t2 -> remove_add_root x t1 | {
"file_name": "examples/data_structures/BinaryTrees.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 40,
"end_line": 160,
"start_col": 0,
"start_line": 157
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinaryTrees.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Prims.int -> t: BinaryTrees.tree
-> FStar.Pervasives.Lemma (ensures BinaryTrees.remove_root (BinaryTrees.add_root x t) = t)
(decreases t) | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.int",
"BinaryTrees.tree",
"BinaryTrees.remove_add_root",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec remove_add_root x t =
| match t with
| Leaf -> ()
| Node n t1 t2 -> remove_add_root x t1 | false |
BinaryTrees.fst | BinaryTrees.revert_injective | val revert_injective : t1:tree -> t2:tree ->
Lemma (requires (revert t1 = revert t2)) (ensures (t1 = t2)) | val revert_injective : t1:tree -> t2:tree ->
Lemma (requires (revert t1 = revert t2)) (ensures (t1 = t2)) | let rec revert_injective t1 t2 =
match t1, t2 with
| Leaf, Leaf -> ()
| Node n1 t11 t12, Node n2 t21 t22 -> revert_injective t11 t21;
revert_injective t12 t22 | {
"file_name": "examples/data_structures/BinaryTrees.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 126,
"start_col": 0,
"start_line": 122
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinaryTrees.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | t1: BinaryTrees.tree -> t2: BinaryTrees.tree
-> FStar.Pervasives.Lemma (requires BinaryTrees.revert t1 = BinaryTrees.revert t2)
(ensures t1 = t2) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"BinaryTrees.tree",
"FStar.Pervasives.Native.Mktuple2",
"Prims.int",
"BinaryTrees.revert_injective",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec revert_injective t1 t2 =
| match t1, t2 with
| Leaf, Leaf -> ()
| Node n1 t11 t12, Node n2 t21 t22 ->
revert_injective t11 t21;
revert_injective t12 t22 | false |
BinaryTrees.fst | BinaryTrees.revert | val revert : tree -> Tot tree | val revert : tree -> Tot tree | let rec revert t =
match t with
| Leaf -> Leaf
| Node n t1 t2 -> Node n (revert t2) (revert t1) | {
"file_name": "examples/data_structures/BinaryTrees.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 50,
"end_line": 110,
"start_col": 0,
"start_line": 107
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinaryTrees.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | t: BinaryTrees.tree -> BinaryTrees.tree | Prims.Tot | [
"total"
] | [] | [
"BinaryTrees.tree",
"BinaryTrees.Leaf",
"Prims.int",
"BinaryTrees.Node",
"BinaryTrees.revert"
] | [
"recursion"
] | false | false | false | true | false | let rec revert t =
| match t with
| Leaf -> Leaf
| Node n t1 t2 -> Node n (revert t2) (revert t1) | false |
GMST.fst | GMST.gmst_close | val gmst_close : s: Type ->
a: Type ->
b: Type ->
wp: (_: b -> Prims.GTot (GMST.gmst_wp s a)) ->
s0: s ->
p: GMST.gmst_post s a s0
-> Prims.logical | let gmst_close (s:Type) (a:Type) (b:Type)
(wp:(b -> GTot (gmst_wp s a))) (s0:s) (p:gmst_post s a s0) =
forall x. wp x s0 p | {
"file_name": "examples/indexed_effects/GMST.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 21,
"end_line": 61,
"start_col": 0,
"start_line": 59
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "GMST.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
s: Type ->
a: Type ->
b: Type ->
wp: (_: b -> Prims.GTot (GMST.gmst_wp s a)) ->
s0: s ->
p: GMST.gmst_post s a s0
-> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"GMST.gmst_wp",
"GMST.gmst_post",
"Prims.l_Forall",
"Prims.logical"
] | [] | false | false | false | false | true | let gmst_close (s a b: Type) (wp: (b -> GTot (gmst_wp s a))) (s0: s) (p: gmst_post s a s0) =
| forall x. wp x s0 p | false | |
BinaryTrees.fst | BinaryTrees.remove | val remove (x: int) (t: tree{count x t > 0}) : Tot tree (decreases t) | val remove (x: int) (t: tree{count x t > 0}) : Tot tree (decreases t) | let rec remove (x:int) (t:tree{count x t > 0}) : Tot tree (decreases t) =
match t with
| Node n t1 t2 -> if x = n then remove_root t else
if count x t1 > 0 then Node n (remove x t1) t2
else Node n t1 (remove x t2) | {
"file_name": "examples/data_structures/BinaryTrees.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 66,
"end_line": 171,
"start_col": 0,
"start_line": 167
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinaryTrees.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Prims.int -> t: BinaryTrees.tree{BinaryTrees.count x t > 0} -> Prims.Tot BinaryTrees.tree | Prims.Tot | [
"total",
""
] | [] | [
"Prims.int",
"BinaryTrees.tree",
"Prims.b2t",
"Prims.op_GreaterThan",
"BinaryTrees.count",
"Prims.op_Equality",
"BinaryTrees.remove_root",
"Prims.bool",
"BinaryTrees.Node",
"BinaryTrees.remove"
] | [
"recursion"
] | false | false | false | false | false | let rec remove (x: int) (t: tree{count x t > 0}) : Tot tree (decreases t) =
| match t with
| Node n t1 t2 ->
if x = n
then remove_root t
else if count x t1 > 0 then Node n (remove x t1) t2 else Node n t1 (remove x t2) | false |
BinaryTrees.fst | BinaryTrees.add_root | val add_root : x:int -> t:tree -> Tot (t':tree{Node? t'}) (decreases t) | val add_root : x:int -> t:tree -> Tot (t':tree{Node? t'}) (decreases t) | let rec add_root x t =
match t with
| Leaf -> Node x Leaf Leaf
| Node n t1 t2 -> Node x (add_root n t1) t2 | {
"file_name": "examples/data_structures/BinaryTrees.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 45,
"end_line": 151,
"start_col": 0,
"start_line": 148
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinaryTrees.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Prims.int -> t: BinaryTrees.tree -> Prims.Tot (t': BinaryTrees.tree{Node? t'}) | Prims.Tot | [
"total",
""
] | [] | [
"Prims.int",
"BinaryTrees.tree",
"BinaryTrees.Node",
"BinaryTrees.Leaf",
"BinaryTrees.add_root",
"Prims.b2t",
"BinaryTrees.uu___is_Node"
] | [
"recursion"
] | false | false | false | false | false | let rec add_root x t =
| match t with
| Leaf -> Node x Leaf Leaf
| Node n t1 t2 -> Node x (add_root n t1) t2 | false |
GMST.fst | GMST.gmst_trivial | val gmst_trivial : s: Type -> a: Type -> wp: GMST.gmst_wp s a -> Prims.logical | let gmst_trivial (s:Type) (a:Type) (wp:gmst_wp s a) =
forall s0. wp s0 (fun _ _ _ -> True) | {
"file_name": "examples/indexed_effects/GMST.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 38,
"end_line": 65,
"start_col": 0,
"start_line": 64
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "GMST.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: Type -> a: Type -> wp: GMST.gmst_wp s a -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"GMST.gmst_wp",
"Prims.l_Forall",
"FStar.Preorder.relation",
"Prims.l_True",
"Prims.logical"
] | [] | false | false | false | true | true | let gmst_trivial (s a: Type) (wp: gmst_wp s a) =
| forall s0. wp s0 (fun _ _ _ -> True) | false | |
Hacl.Spec.Curve25519.Field51.fst | Hacl.Spec.Curve25519.Field51.fsqr5 | val fsqr5:
f:felem5{felem_fits5 f (9, 10, 9, 9, 9)}
-> out:felem5{mul_inv_t out /\ feval out == fmul (feval f) (feval f)} | val fsqr5:
f:felem5{felem_fits5 f (9, 10, 9, 9, 9)}
-> out:felem5{mul_inv_t out /\ feval out == fmul (feval f) (feval f)} | let fsqr5 (f0, f1, f2, f3, f4) =
let (o0, o1, o2, o3, o4) = fsqr_felem5 (f0, f1, f2, f3, f4) in
carry_wide5 (o0, o1, o2, o3, o4) | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 34,
"end_line": 416,
"start_col": 0,
"start_line": 414
} | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
f:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 f (9, 10, 9, 9, 9)}
-> out:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{ Hacl.Spec.Curve25519.Field51.mul_inv_t out /\
Hacl.Spec.Curve25519.Field51.Definition.feval out ==
... | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.felem5",
"Hacl.Spec.Curve25519.Field51.Definition.felem_fits5",
"FStar.Pervasives.Native.Mktuple5",
"Prims.nat",
"Lib.IntTypes.uint64",
"Lib.IntTypes.uint128",
"Hacl.Spec.Curve25519.Field51.carry_wide5",
"Prims.l_and",
"Hacl.Spec.Curve25519.Field51.mul_inv_t"... | [] | false | false | false | false | false | let fsqr5 (f0, f1, f2, f3, f4) =
| let o0, o1, o2, o3, o4 = fsqr_felem5 (f0, f1, f2, f3, f4) in
carry_wide5 (o0, o1, o2, o3, o4) | false |
BinaryTrees.fst | BinaryTrees.count_remove_root | val count_remove_root (t: tree{Node? t})
: Lemma
(ensures
(let r = Node?.root t in
(count r (remove_root t) = count r t - 1) /\
(forall y. {:pattern (count y (remove_root t))}
y <> r ==> count y (remove_root t) = count y t))) | val count_remove_root (t: tree{Node? t})
: Lemma
(ensures
(let r = Node?.root t in
(count r (remove_root t) = count r t - 1) /\
(forall y. {:pattern (count y (remove_root t))}
y <> r ==> count y (remove_root t) = count y t))) | let rec count_remove_root (t:tree{Node? t}) :
Lemma (ensures (let r = Node?.root t in
(count r (remove_root t) = count r t - 1) /\
(forall y.{:pattern (count y (remove_root t))} y <> r ==> count y (remove_root t) = count y t))) =
let Node n t1 t2 = t in
if Leaf? t1 then () ... | {
"file_name": "examples/data_structures/BinaryTrees.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 184,
"start_col": 0,
"start_line": 178
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinaryTrees.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | t: BinaryTrees.tree{Node? t}
-> FStar.Pervasives.Lemma
(ensures
(let r = Node?.root t in
BinaryTrees.count r (BinaryTrees.remove_root t) = BinaryTrees.count r t - 1 /\
(forall (y: Prims.int). {:pattern BinaryTrees.count y (BinaryTrees.remove_root t)}
y <> r ==> BinaryTrees.count ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"BinaryTrees.tree",
"Prims.b2t",
"BinaryTrees.uu___is_Node",
"Prims.int",
"BinaryTrees.uu___is_Leaf",
"Prims.bool",
"BinaryTrees.count_remove_root",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_and",
"Prims.op_Equality",
"BinaryTrees.count",
"BinaryTrees.remove_root",
"Prims.op... | [
"recursion"
] | false | false | true | false | false | let rec count_remove_root (t: tree{Node? t})
: Lemma
(ensures
(let r = Node?.root t in
(count r (remove_root t) = count r t - 1) /\
(forall y. {:pattern (count y (remove_root t))}
y <> r ==> count y (remove_root t) = count y t))) =
| let Node n t1 t2 = t in
if Leaf? t1 then () else count_remove_root t1 | false |
Hacl.Curve25519_51.fst | Hacl.Curve25519_51.montgomery_ladder | val montgomery_ladder : Hacl.Meta.Curve25519.generic_montgomery_ladder_higher_t Prims.l_True | let montgomery_ladder =
generic_montgomery_ladder_higher #M51 True point_double C.cswap2 point_add_and_double | {
"file_name": "code/curve25519/Hacl.Curve25519_51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 87,
"end_line": 18,
"start_col": 0,
"start_line": 17
} | module Hacl.Curve25519_51
friend Hacl.Meta.Curve25519
open Hacl.Meta.Curve25519
// The Hacl core.
module C = Hacl.Impl.Curve25519.Field51
let g25519: g25519_t =
Lib.Buffer.createL_global Spec.Curve25519.basepoint_list
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
let point_add_and_double =
addanddoub... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Meta.Curve25519.fst.checked",
"Hacl.Impl.Curve25519.Field51.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Hacl.Curve2... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Curve25519.Field51",
"short_module": "C"
},
{
"abbrev": false,
"full_module": "Hacl.Meta.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Curve25519.Fields",
"short_module": null
},
{
"ab... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Meta.Curve25519.generic_montgomery_ladder_higher_t Prims.l_True | Prims.Tot | [
"total"
] | [] | [
"Hacl.Meta.Curve25519.generic_montgomery_ladder_higher",
"Hacl.Impl.Curve25519.Fields.Core.M51",
"Prims.l_True",
"Hacl.Curve25519_51.point_double",
"Hacl.Impl.Curve25519.Field51.cswap2",
"Hacl.Curve25519_51.point_add_and_double"
] | [] | false | false | false | true | false | let montgomery_ladder =
| generic_montgomery_ladder_higher #M51 True point_double C.cswap2 point_add_and_double | false | |
Pulse.Soundness.Bind.fst | Pulse.Soundness.Bind.bind_fn_typing | val bind_fn_typing
(#g:stt_env)
(#t:st_term)
(#c:comp)
(d:st_typing g t c{T_BindFn? d})
(soundness:soundness_t d)
: GTot (RT.tot_typing (elab_env g)
(elab_st_typing d)
(elab_comp c)) | val bind_fn_typing
(#g:stt_env)
(#t:st_term)
(#c:comp)
(d:st_typing g t c{T_BindFn? d})
(soundness:soundness_t d)
: GTot (RT.tot_typing (elab_env g)
(elab_st_typing d)
(elab_comp c)) | let bind_fn_typing #g #t #c d soundness =
let T_BindFn _ e1 e2 c1 c2 b x e1_typing u t1_typing e2_typing c2_typing = d in
let t1 = comp_res c1 in
let g_x = push_binding g x ppname_default t1 in
let re1 = elab_st_typing e1_typing in
let rt1 = elab_term t1 in
let re2 = elab_st_typing e2_typing in
let re1_... | {
"file_name": "lib/steel/pulse/Pulse.Soundness.Bind.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 5,
"end_line": 231,
"start_col": 0,
"start_line": 197
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Pulse.Typing.LN.fsti.checked",
"Pulse.Typing.fst.checked",
"Pulse.Syntax.fst.checked",
"Pulse.Soundness.Common.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Elaborate.fsti.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked... | [
{
"abbrev": false,
"full_module": "Pulse.Soundness.Common",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Elaborate",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Typing",
"short_module": null
},
{
"abbrev": false,
"full_... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | d: Pulse.Typing.st_typing g t c {T_BindFn? d} -> soundness: Pulse.Soundness.Common.soundness_t d
-> Prims.GTot
(FStar.Reflection.Typing.tot_typing (Pulse.Typing.elab_env g)
(Pulse.Elaborate.Core.elab_st_typing d)
(Pulse.Elaborate.Pure.elab_comp c)) | Prims.GTot | [
"sometrivial"
] | [] | [
"Pulse.Soundness.Common.stt_env",
"Pulse.Syntax.Base.st_term",
"Pulse.Syntax.Base.comp",
"Pulse.Typing.st_typing",
"Prims.b2t",
"Pulse.Typing.uu___is_T_BindFn",
"Pulse.Soundness.Common.soundness_t",
"Pulse.Typing.Env.env",
"Pulse.Syntax.Base.uu___is_C_Tot",
"Pulse.Syntax.Base.comp_st",
"Pulse.Sy... | [] | false | false | false | false | false | let bind_fn_typing #g #t #c d soundness =
| let T_BindFn _ e1 e2 c1 c2 b x e1_typing u t1_typing e2_typing c2_typing = d in
let t1 = comp_res c1 in
let g_x = push_binding g x ppname_default t1 in
let re1 = elab_st_typing e1_typing in
let rt1 = elab_term t1 in
let re2 = elab_st_typing e2_typing in
let re1_typing:RT.tot_typing (elab_env g) re1 rt1 = soundness g e1... | false |
GMST.fst | GMST.lift_div_gmst | val lift_div_gmst : a: Type -> wp: Prims.pure_wp a -> s0: GMST.state -> p: GMST.gmst_post GMST.state a s0
-> Prims.pure_pre | let lift_div_gmst (a:Type) (wp:pure_wp a) (s0:state) (p:gmst_post state a s0) = wp (fun x -> p (fun s0 s1 -> s0 == s1) x s0) | {
"file_name": "examples/indexed_effects/GMST.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 124,
"end_line": 95,
"start_col": 0,
"start_line": 95
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "GMST.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Type -> wp: Prims.pure_wp a -> s0: GMST.state -> p: GMST.gmst_post GMST.state a s0
-> Prims.pure_pre | Prims.Tot | [
"total"
] | [] | [
"Prims.pure_wp",
"GMST.state",
"GMST.gmst_post",
"Prims.l_True",
"Prims.eq2",
"Prims.pure_pre"
] | [] | false | false | false | false | false | let lift_div_gmst (a: Type) (wp: pure_wp a) (s0: state) (p: gmst_post state a s0) =
| wp (fun x -> p (fun s0 s1 -> s0 == s1) x s0) | false | |
GMST.fst | GMST.state | val state : Prims.eqtype | let state = int | {
"file_name": "examples/indexed_effects/GMST.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 15,
"end_line": 91,
"start_col": 0,
"start_line": 91
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "GMST.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Prims.eqtype | Prims.Tot | [
"total"
] | [] | [
"Prims.int"
] | [] | false | false | false | true | false | let state =
| int | false | |
GMST.fst | GMST.gmst_bind | val gmst_bind : s: Type ->
a: Type ->
b: Type ->
wp1: GMST.gmst_wp s a ->
wp2: (_: a -> Prims.GTot (GMST.gmst_wp s b)) ->
s0: s ->
p: GMST.gmst_post s b s0
-> Type0 | let gmst_bind (s:Type) (a:Type) (b:Type)
(wp1:gmst_wp s a) (wp2: (a -> GTot (gmst_wp s b)))
(s0:s) (p:gmst_post s b s0)
= wp1 s0 (fun rel1 x s1 -> wp2 x s1 (fun rel2 -> p (rel2 @ rel1))) | {
"file_name": "examples/indexed_effects/GMST.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 68,
"end_line": 43,
"start_col": 0,
"start_line": 40
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "GMST.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
s: Type ->
a: Type ->
b: Type ->
wp1: GMST.gmst_wp s a ->
wp2: (_: a -> Prims.GTot (GMST.gmst_wp s b)) ->
s0: s ->
p: GMST.gmst_post s b s0
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"GMST.gmst_wp",
"GMST.gmst_post",
"FStar.Preorder.relation",
"GMST.op_At"
] | [] | false | false | false | false | true | let gmst_bind
(s a b: Type)
(wp1: gmst_wp s a)
(wp2: (a -> GTot (gmst_wp s b)))
(s0: s)
(p: gmst_post s b s0)
=
| wp1 s0 (fun rel1 x s1 -> wp2 x s1 (fun rel2 -> p (rel2 @ rel1))) | false | |
Hacl.Curve25519_51.fst | Hacl.Curve25519_51.secret_to_public | val secret_to_public: secret_to_public_st M51 True | val secret_to_public: secret_to_public_st M51 True | let secret_to_public = generic_secret_to_public_higher #M51 True scalarmult g25519 | {
"file_name": "code/curve25519/Hacl.Curve25519_51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 82,
"end_line": 23,
"start_col": 0,
"start_line": 23
} | module Hacl.Curve25519_51
friend Hacl.Meta.Curve25519
open Hacl.Meta.Curve25519
// The Hacl core.
module C = Hacl.Impl.Curve25519.Field51
let g25519: g25519_t =
Lib.Buffer.createL_global Spec.Curve25519.basepoint_list
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
let point_add_and_double =
addanddoub... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Meta.Curve25519.fst.checked",
"Hacl.Impl.Curve25519.Field51.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Hacl.Curve2... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Curve25519.Field51",
"short_module": "C"
},
{
"abbrev": false,
"full_module": "Hacl.Meta.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Curve25519.Fields",
"short_module": null
},
{
"ab... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Impl.Curve25519.Generic.secret_to_public_st Hacl.Impl.Curve25519.Fields.Core.M51 Prims.l_True | Prims.Tot | [
"total"
] | [] | [
"Hacl.Meta.Curve25519.generic_secret_to_public_higher",
"Hacl.Impl.Curve25519.Fields.Core.M51",
"Prims.l_True",
"Hacl.Curve25519_51.scalarmult",
"Hacl.Curve25519_51.g25519"
] | [] | false | false | false | true | false | let secret_to_public =
| generic_secret_to_public_higher #M51 True scalarmult g25519 | false |
Hacl.Curve25519_51.fst | Hacl.Curve25519_51.point_double | val point_double : Hacl.Meta.Curve25519.addanddouble_point_double_higher_t Prims.l_True | let point_double =
addanddouble_point_double_higher #M51 True C.fmul2 C.fmul1 C.fsqr2 C.fsub C.fadd | {
"file_name": "code/curve25519/Hacl.Curve25519_51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 82,
"end_line": 16,
"start_col": 0,
"start_line": 15
} | module Hacl.Curve25519_51
friend Hacl.Meta.Curve25519
open Hacl.Meta.Curve25519
// The Hacl core.
module C = Hacl.Impl.Curve25519.Field51
let g25519: g25519_t =
Lib.Buffer.createL_global Spec.Curve25519.basepoint_list
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
let point_add_and_double = | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Meta.Curve25519.fst.checked",
"Hacl.Impl.Curve25519.Field51.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Hacl.Curve2... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Curve25519.Field51",
"short_module": "C"
},
{
"abbrev": false,
"full_module": "Hacl.Meta.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Curve25519.Fields",
"short_module": null
},
{
"ab... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Meta.Curve25519.addanddouble_point_double_higher_t Prims.l_True | Prims.Tot | [
"total"
] | [] | [
"Hacl.Meta.Curve25519.addanddouble_point_double_higher",
"Hacl.Impl.Curve25519.Fields.Core.M51",
"Prims.l_True",
"Hacl.Impl.Curve25519.Field51.fmul2",
"Hacl.Impl.Curve25519.Field51.fmul1",
"Hacl.Impl.Curve25519.Field51.fsqr2",
"Hacl.Impl.Curve25519.Field51.fsub",
"Hacl.Impl.Curve25519.Field51.fadd"
] | [] | false | false | false | true | false | let point_double =
| addanddouble_point_double_higher #M51 True C.fmul2 C.fmul1 C.fsqr2 C.fsub C.fadd | false | |
BinaryTrees.fst | BinaryTrees.count_remove | val count_remove (x: int) (t: tree{count x t > 0})
: Lemma (requires True) (ensures (count x (remove x t) = count x t - 1)) (decreases t) | val count_remove (x: int) (t: tree{count x t > 0})
: Lemma (requires True) (ensures (count x (remove x t) = count x t - 1)) (decreases t) | let rec count_remove (x:int) (t:tree{count x t > 0}) :
Lemma (requires True)
(ensures (count x (remove x t) = count x t - 1)) (decreases t) =
match t with
| Node n t1 t2 -> if x = n then count_remove_root t else
if count x t1 > 0 then count_remove x t1
... | {
"file_name": "examples/data_structures/BinaryTrees.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 60,
"end_line": 193,
"start_col": 0,
"start_line": 187
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinaryTrees.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Prims.int -> t: BinaryTrees.tree{BinaryTrees.count x t > 0}
-> FStar.Pervasives.Lemma
(ensures BinaryTrees.count x (BinaryTrees.remove x t) = BinaryTrees.count x t - 1)
(decreases t) | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.int",
"BinaryTrees.tree",
"Prims.b2t",
"Prims.op_GreaterThan",
"BinaryTrees.count",
"Prims.op_Equality",
"BinaryTrees.count_remove_root",
"Prims.bool",
"BinaryTrees.count_remove",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"BinaryTrees.remove",
"Prims.op_Subtraction",
"Prims.Ni... | [
"recursion"
] | false | false | true | false | false | let rec count_remove (x: int) (t: tree{count x t > 0})
: Lemma (requires True) (ensures (count x (remove x t) = count x t - 1)) (decreases t) =
| match t with
| Node n t1 t2 ->
if x = n
then count_remove_root t
else if count x t1 > 0 then count_remove x t1 else count_remove x t2 | false |
GMST.fst | GMST.mst_wp | val mst_wp : s: Type -> a: Type -> rel: FStar.Preorder.relation s -> Type | let mst_wp (s:Type) (a:Type) (rel:relation s) = s0:s -> (a -> s1:s{rel s0 s1} -> Type0) -> Type0 | {
"file_name": "examples/indexed_effects/GMST.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 99,
"end_line": 101,
"start_col": 0,
"start_line": 101
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "GMST.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: Type -> a: Type -> rel: FStar.Preorder.relation s -> Type | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.relation"
] | [] | false | false | false | true | true | let mst_wp (s a: Type) (rel: relation s) =
| s0: s -> (a -> s1: s{rel s0 s1} -> Type0) -> Type0 | false | |
GMST.fst | GMST.stable | val stable : p: FStar.Preorder.predicate a -> rel: FStar.Preorder.preorder a -> Prims.logical | let stable (#a:Type) (p:predicate a) (rel:preorder a)
= forall x y . p x /\ rel x y ==> p y | {
"file_name": "examples/indexed_effects/GMST.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 39,
"end_line": 116,
"start_col": 0,
"start_line": 115
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "GMST.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: FStar.Preorder.predicate a -> rel: FStar.Preorder.preorder a -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"FStar.Preorder.predicate",
"FStar.Preorder.preorder",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.l_and",
"Prims.logical"
] | [] | false | false | false | true | true | let stable (#a: Type) (p: predicate a) (rel: preorder a) =
| forall x y. p x /\ rel x y ==> p y | false | |
Hacl.Curve25519_51.fst | Hacl.Curve25519_51.fsquare_times | val fsquare_times : Hacl.Meta.Curve25519.finv_fsquare_times_higher_t Prims.l_True | let fsquare_times = finv_fsquare_times_higher #M51 True C.fsqr | {
"file_name": "code/curve25519/Hacl.Curve25519_51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 62,
"end_line": 19,
"start_col": 0,
"start_line": 19
} | module Hacl.Curve25519_51
friend Hacl.Meta.Curve25519
open Hacl.Meta.Curve25519
// The Hacl core.
module C = Hacl.Impl.Curve25519.Field51
let g25519: g25519_t =
Lib.Buffer.createL_global Spec.Curve25519.basepoint_list
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
let point_add_and_double =
addanddoub... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Meta.Curve25519.fst.checked",
"Hacl.Impl.Curve25519.Field51.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Hacl.Curve2... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Curve25519.Field51",
"short_module": "C"
},
{
"abbrev": false,
"full_module": "Hacl.Meta.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Curve25519.Fields",
"short_module": null
},
{
"ab... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Meta.Curve25519.finv_fsquare_times_higher_t Prims.l_True | Prims.Tot | [
"total"
] | [] | [
"Hacl.Meta.Curve25519.finv_fsquare_times_higher",
"Hacl.Impl.Curve25519.Fields.Core.M51",
"Prims.l_True",
"Hacl.Impl.Curve25519.Field51.fsqr"
] | [] | false | false | false | true | false | let fsquare_times =
| finv_fsquare_times_higher #M51 True C.fsqr | false | |
BinaryTrees.fst | BinaryTrees.count | val count (x: int) (t: tree) : Tot nat | val count (x: int) (t: tree) : Tot nat | let rec count (x:int) (t:tree) : Tot nat =
match t with
| Leaf -> 0
| Node n t1 t2 -> (if n = x then 1 else 0) + count x t1 + count x t2 | {
"file_name": "examples/data_structures/BinaryTrees.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 70,
"end_line": 165,
"start_col": 0,
"start_line": 162
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinaryTrees.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Prims.int -> t: BinaryTrees.tree -> Prims.nat | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"BinaryTrees.tree",
"Prims.op_Addition",
"Prims.op_Equality",
"Prims.bool",
"BinaryTrees.count",
"Prims.nat"
] | [
"recursion"
] | false | false | false | true | false | let rec count (x: int) (t: tree) : Tot nat =
| match t with
| Leaf -> 0
| Node n t1 t2 -> (if n = x then 1 else 0) + count x t1 + count x t2 | false |
Hacl.Spec.Curve25519.Field51.fst | Hacl.Spec.Curve25519.Field51.fsub5 | val fsub5:
f1:felem5{felem_fits5 f1 (1, 2, 1, 1, 1)}
-> f2:felem5{felem_fits5 f2 (1, 2, 1, 1, 1)}
-> out:felem5{felem_fits5 out (9, 10, 9, 9, 9) /\
feval out == fsub (feval f1) (feval f2)} | val fsub5:
f1:felem5{felem_fits5 f1 (1, 2, 1, 1, 1)}
-> f2:felem5{felem_fits5 f2 (1, 2, 1, 1, 1)}
-> out:felem5{felem_fits5 out (9, 10, 9, 9, 9) /\
feval out == fsub (feval f1) (feval f2)} | let fsub5 (f10, f11, f12, f13, f14) (f20, f21, f22, f23, f24) =
//assert_norm (0x3fffffffffff68 == pow2 54 - 152);
//assert_norm (0x3ffffffffffff8 == pow2 54 - 8);
let (t0, t1, t2, t3, t4) = fadd_zero (f10, f11, f12, f13, f14) in
let o0 = t0 -! f20 in
let o1 = t1 -! f21 in
let o2 = t2 -! f22 in
let o3 = t... | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 5,
"end_line": 65,
"start_col": 0,
"start_line": 52
} | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
f1:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 f1 (1, 2, 1, 1, 1)} ->
f2:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 f2 (1, 2, 1, 1, 1)}
-> out:
Hacl.Spec.Curve255... | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.felem5",
"Hacl.Spec.Curve25519.Field51.Definition.felem_fits5",
"FStar.Pervasives.Native.Mktuple5",
"Prims.nat",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.tuple5",
"Lib.IntTypes.uint64",
"Prims.unit",
"Hacl.Spec.Curve25519.Field51.Lemmas.le... | [] | false | false | false | false | false | let fsub5 (f10, f11, f12, f13, f14) (f20, f21, f22, f23, f24) =
| let t0, t1, t2, t3, t4 = fadd_zero (f10, f11, f12, f13, f14) in
let o0 = t0 -! f20 in
let o1 = t1 -! f21 in
let o2 = t2 -! f22 in
let o3 = t3 -! f23 in
let o4 = t4 -! f24 in
let out = (o0, o1, o2, o3, o4) in
FStar.Math.Lemmas.lemma_mod_plus_distr_l (as_nat5 (t0, t1, t2, t3, t4))
(- as_nat5 (f20, f21, f22, f23, f24))
... | false |
Hacl.Spec.Curve25519.Field51.fst | Hacl.Spec.Curve25519.Field51.fadd5 | val fadd5:
f1:felem5{felem_fits5 f1 (1, 2, 1, 1, 1)}
-> f2:felem5{felem_fits5 f2 (1, 2, 1, 1, 1)}
-> out:felem5{felem_fits5 out (2, 4, 2, 2, 2) /\
feval out == fadd (feval f1) (feval f2)} | val fadd5:
f1:felem5{felem_fits5 f1 (1, 2, 1, 1, 1)}
-> f2:felem5{felem_fits5 f2 (1, 2, 1, 1, 1)}
-> out:felem5{felem_fits5 out (2, 4, 2, 2, 2) /\
feval out == fadd (feval f1) (feval f2)} | let fadd5 (f10, f11, f12, f13, f14) (f20, f21, f22, f23, f24) =
let o0 = f10 +! f20 in
let o1 = f11 +! f21 in
let o2 = f12 +! f22 in
let o3 = f13 +! f23 in
let o4 = f14 +! f24 in
let out = (o0, o1, o2, o3, o4) in
FStar.Math.Lemmas.lemma_mod_plus_distr_l
(as_nat5 (f10, f11, f12, f13, f14)) (as_nat5 (f2... | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 5,
"end_line": 30,
"start_col": 0,
"start_line": 19
} | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
f1:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 f1 (1, 2, 1, 1, 1)} ->
f2:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 f2 (1, 2, 1, 1, 1)}
-> out:
Hacl.Spec.Curve255... | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.felem5",
"Hacl.Spec.Curve25519.Field51.Definition.felem_fits5",
"FStar.Pervasives.Native.Mktuple5",
"Prims.nat",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.tuple5",
"Lib.IntTypes.uint64",
"Prims.unit",
"FStar.Math.Lemmas.lemma_mod_plus_distr... | [] | false | false | false | false | false | let fadd5 (f10, f11, f12, f13, f14) (f20, f21, f22, f23, f24) =
| let o0 = f10 +! f20 in
let o1 = f11 +! f21 in
let o2 = f12 +! f22 in
let o3 = f13 +! f23 in
let o4 = f14 +! f24 in
let out = (o0, o1, o2, o3, o4) in
FStar.Math.Lemmas.lemma_mod_plus_distr_l (as_nat5 (f10, f11, f12, f13, f14))
(as_nat5 (f20, f21, f22, f23, f24))
prime;
FStar.Math.Lemmas.lemma_mod_plus_distr_r ((as_n... | false |
Hacl.Spec.Curve25519.Field51.fst | Hacl.Spec.Curve25519.Field51.fmul5 | val fmul5:
f1:felem5{felem_fits5 f1 (9, 10, 9, 9, 9)}
-> f2:felem5{felem_fits5 f2 (9, 10, 9, 9, 9)}
-> out:felem5{mul_inv_t out /\
feval out == fmul (feval f1) (feval f2)} | val fmul5:
f1:felem5{felem_fits5 f1 (9, 10, 9, 9, 9)}
-> f2:felem5{felem_fits5 f2 (9, 10, 9, 9, 9)}
-> out:felem5{mul_inv_t out /\
feval out == fmul (feval f1) (feval f2)} | let fmul5 (f10, f11, f12, f13, f14) (f20, f21, f22, f23, f24) =
let (tmp0, tmp1, tmp2, tmp3, tmp4) = precomp_r19 (f20, f21, f22, f23, f24) in
let (tmp_w0, tmp_w1, tmp_w2, tmp_w3, tmp_w4) =
mul_felem5 (f10, f11, f12, f13, f14) (f20, f21, f22, f23, f24) (tmp0, tmp1, tmp2, tmp3, tmp4) in
carry_wide5 (tmp_w0, tmp... | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 54,
"end_line": 295,
"start_col": 0,
"start_line": 291
} | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
f1:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 f1 (9, 10, 9, 9, 9)} ->
f2:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 f2 (9, 10, 9, 9, 9)}
-> out:
Hacl.Spec.Curve2... | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.felem5",
"Hacl.Spec.Curve25519.Field51.Definition.felem_fits5",
"FStar.Pervasives.Native.Mktuple5",
"Prims.nat",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.tuple5",
"Lib.IntTypes.uint64",
"Lib.IntTypes.uint128",
"Hacl.Spec.Curve25519.Field51... | [] | false | false | false | false | false | let fmul5 (f10, f11, f12, f13, f14) (f20, f21, f22, f23, f24) =
| let tmp0, tmp1, tmp2, tmp3, tmp4 = precomp_r19 (f20, f21, f22, f23, f24) in
let tmp_w0, tmp_w1, tmp_w2, tmp_w3, tmp_w4 =
mul_felem5 (f10, f11, f12, f13, f14) (f20, f21, f22, f23, f24) (tmp0, tmp1, tmp2, tmp3, tmp4)
in
carry_wide5 (tmp_w0, tmp_w1, tmp_w2, tmp_w3, tmp_w4) | false |
Hacl.Curve25519_51.fst | Hacl.Curve25519_51.point_add_and_double | val point_add_and_double : Hacl.Meta.Curve25519.addanddouble_point_add_and_double_higher_t Prims.l_True | let point_add_and_double =
addanddouble_point_add_and_double_higher #M51 True C.fmul C.fsqr2 C.fmul1 C.fmul2 C.fsub C.fadd | {
"file_name": "code/curve25519/Hacl.Curve25519_51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 97,
"end_line": 14,
"start_col": 0,
"start_line": 13
} | module Hacl.Curve25519_51
friend Hacl.Meta.Curve25519
open Hacl.Meta.Curve25519
// The Hacl core.
module C = Hacl.Impl.Curve25519.Field51
let g25519: g25519_t =
Lib.Buffer.createL_global Spec.Curve25519.basepoint_list | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Meta.Curve25519.fst.checked",
"Hacl.Impl.Curve25519.Field51.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Hacl.Curve2... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Curve25519.Field51",
"short_module": "C"
},
{
"abbrev": false,
"full_module": "Hacl.Meta.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Curve25519.Fields",
"short_module": null
},
{
"ab... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Meta.Curve25519.addanddouble_point_add_and_double_higher_t Prims.l_True | Prims.Tot | [
"total"
] | [] | [
"Hacl.Meta.Curve25519.addanddouble_point_add_and_double_higher",
"Hacl.Impl.Curve25519.Fields.Core.M51",
"Prims.l_True",
"Hacl.Impl.Curve25519.Field51.fmul",
"Hacl.Impl.Curve25519.Field51.fsqr2",
"Hacl.Impl.Curve25519.Field51.fmul1",
"Hacl.Impl.Curve25519.Field51.fmul2",
"Hacl.Impl.Curve25519.Field51.... | [] | false | false | false | true | false | let point_add_and_double =
| addanddouble_point_add_and_double_higher #M51 True C.fmul C.fsqr2 C.fmul1 C.fmul2 C.fsub C.fadd | false | |
Hacl.Spec.Curve25519.Field51.fst | Hacl.Spec.Curve25519.Field51.smul_felem5 | val smul_felem5:
#m1:scale64
-> #m2:scale64_5
-> u1:uint64{felem_fits1 u1 m1}
-> f2:felem5{felem_fits5 f2 m2 /\ m1 *^ m2 <=* s128x5 67108864}
-> out:felem_wide5{felem_wide_fits5 out (m1 *^ m2) /\
wide_as_nat5 out == uint_v u1 * as_nat5 f2} | val smul_felem5:
#m1:scale64
-> #m2:scale64_5
-> u1:uint64{felem_fits1 u1 m1}
-> f2:felem5{felem_fits5 f2 m2 /\ m1 *^ m2 <=* s128x5 67108864}
-> out:felem_wide5{felem_wide_fits5 out (m1 *^ m2) /\
wide_as_nat5 out == uint_v u1 * as_nat5 f2} | let smul_felem5 #m1 #m2 u1 (f20, f21, f22, f23, f24) =
let (m20, m21, m22, m23, m24) = m2 in
[@inline_let]
let o0 = mul_wide64 #m1 #m20 u1 f20 in
[@inline_let]
let o1 = mul_wide64 #m1 #m21 u1 f21 in
[@inline_let]
let o2 = mul_wide64 #m1 #m22 u1 f22 in
[@inline_let]
let o3 = mul_wide64 #m1 #m23 u1 f23 ... | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 5,
"end_line": 126,
"start_col": 0,
"start_line": 111
} | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
u1: Lib.IntTypes.uint64{Hacl.Spec.Curve25519.Field51.Definition.felem_fits1 u1 m1} ->
f2:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{ Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 f2 m2 /\
m1 *^ m2 <=* Hacl.Spec.Curve25519.Field51.Definition.s128x5 67108864 }
-> out:
Ha... | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.scale64",
"Hacl.Spec.Curve25519.Field51.Definition.scale64_5",
"Lib.IntTypes.uint64",
"Prims.b2t",
"Hacl.Spec.Curve25519.Field51.Definition.felem_fits1",
"Hacl.Spec.Curve25519.Field51.Definition.felem5",
"Prims.l_and",
"Hacl.Spec.Curve25519.Field51.Definition.f... | [] | false | false | false | false | false | let smul_felem5 #m1 #m2 u1 (f20, f21, f22, f23, f24) =
| let m20, m21, m22, m23, m24 = m2 in
[@@ inline_let ]let o0 = mul_wide64 #m1 #m20 u1 f20 in
[@@ inline_let ]let o1 = mul_wide64 #m1 #m21 u1 f21 in
[@@ inline_let ]let o2 = mul_wide64 #m1 #m22 u1 f22 in
[@@ inline_let ]let o3 = mul_wide64 #m1 #m23 u1 f23 in
[@@ inline_let ]let o4 = mul_wide64 #m1 #m24 u1 f24 in
[@@ inlin... | false |
Hacl.Curve25519_51.fst | Hacl.Curve25519_51.scalarmult | val scalarmult: scalarmult_st M51 True | val scalarmult: scalarmult_st M51 True | let scalarmult = generic_scalarmult_higher #M51 True encode_point montgomery_ladder decode_point | {
"file_name": "code/curve25519/Hacl.Curve25519_51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 96,
"end_line": 22,
"start_col": 0,
"start_line": 22
} | module Hacl.Curve25519_51
friend Hacl.Meta.Curve25519
open Hacl.Meta.Curve25519
// The Hacl core.
module C = Hacl.Impl.Curve25519.Field51
let g25519: g25519_t =
Lib.Buffer.createL_global Spec.Curve25519.basepoint_list
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
let point_add_and_double =
addanddoub... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Meta.Curve25519.fst.checked",
"Hacl.Impl.Curve25519.Field51.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Hacl.Curve2... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Curve25519.Field51",
"short_module": "C"
},
{
"abbrev": false,
"full_module": "Hacl.Meta.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Curve25519.Fields",
"short_module": null
},
{
"ab... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Impl.Curve25519.Generic.scalarmult_st Hacl.Impl.Curve25519.Fields.Core.M51 Prims.l_True | Prims.Tot | [
"total"
] | [] | [
"Hacl.Meta.Curve25519.generic_scalarmult_higher",
"Hacl.Impl.Curve25519.Fields.Core.M51",
"Prims.l_True",
"Hacl.Curve25519_51.encode_point",
"Hacl.Curve25519_51.montgomery_ladder",
"Hacl.Impl.Curve25519.Generic.decode_point"
] | [] | false | false | false | true | false | let scalarmult =
| generic_scalarmult_higher #M51 True encode_point montgomery_ladder decode_point | false |
GMST.fst | GMST.preorder_app' | val preorder_app'
(#a #b: Type)
(#rel: preorder state)
(#wp1: mst_wp state a rel)
(#wp2: (a -> mst_wp state b rel))
(f: (unit -> GMST a (rel >< wp1)))
(g: (x: a -> GMST b (rel >< wp2 x)))
: GMST b (rel @ rel >< (fun s0 p -> wp1 s0 (fun x s1 -> wp2 x s1 p))) | val preorder_app'
(#a #b: Type)
(#rel: preorder state)
(#wp1: mst_wp state a rel)
(#wp2: (a -> mst_wp state b rel))
(f: (unit -> GMST a (rel >< wp1)))
(g: (x: a -> GMST b (rel >< wp2 x)))
: GMST b (rel @ rel >< (fun s0 p -> wp1 s0 (fun x s1 -> wp2 x s1 p))) | let preorder_app' (#a:Type) (#b:Type)
(#rel:preorder state)
(#wp1:mst_wp state a rel)
(#wp2:a -> mst_wp state b rel)
(f:unit -> GMST a (rel >< wp1))
(g:(x:a -> GMST b (rel >< wp2 x)))
: GMST b (rel @ rel >< (fun s0 p -> wp1 s0 ... | {
"file_name": "examples/indexed_effects/GMST.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 12,
"end_line": 170,
"start_col": 0,
"start_line": 163
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "GMST.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f: (_: Prims.unit -> GMST.GMST a) -> g: (x: a -> GMST.GMST b) -> GMST.GMST b | GMST.GMST | [] | [] | [
"FStar.Preorder.preorder",
"GMST.state",
"GMST.mst_wp",
"Prims.unit",
"GMST.op_Greater_Less",
"GMST.op_At"
] | [] | false | true | false | false | false | let preorder_app'
(#a #b: Type)
(#rel: preorder state)
(#wp1: mst_wp state a rel)
(#wp2: (a -> mst_wp state b rel))
(f: (unit -> GMST a (rel >< wp1)))
(g: (x: a -> GMST b (rel >< wp2 x)))
: GMST b (rel @ rel >< (fun s0 p -> wp1 s0 (fun x s1 -> wp2 x s1 p))) =
| g (f ()) | false |
Hacl.Spec.Curve25519.Field51.fst | Hacl.Spec.Curve25519.Field51.mul_wide64 | val mul_wide64:
#m1:scale64
-> #m2:scale64
-> x:uint64{felem_fits1 x m1}
-> y:uint64{felem_fits1 y m2 /\ m1 * m2 <= 67108864}
-> z:uint128{uint_v z == uint_v x * uint_v y /\ felem_wide_fits1 z (m1 * m2)} | val mul_wide64:
#m1:scale64
-> #m2:scale64
-> x:uint64{felem_fits1 x m1}
-> y:uint64{felem_fits1 y m2 /\ m1 * m2 <= 67108864}
-> z:uint128{uint_v z == uint_v x * uint_v y /\ felem_wide_fits1 z (m1 * m2)} | let mul_wide64 #m1 #m2 x y =
let open FStar.Math.Lemmas in
lemma_mult_le_left (v x) (v y) (m2 * max51); //v x * v y <= v x * (m2 * max51)
lemma_mult_le_right (m2 * max51) (v x) (m1 * max51); // v x * (m2 * max51) <= (m1 * max51) * (m2 * max51)
paren_mul_right (m1 * max51) m2 max51; //(m1 * max51) * (m2 * max5... | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 100,
"start_col": 0,
"start_line": 89
} | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
x: Lib.IntTypes.uint64{Hacl.Spec.Curve25519.Field51.Definition.felem_fits1 x m1} ->
y:
Lib.IntTypes.uint64
{Hacl.Spec.Curve25519.Field51.Definition.felem_fits1 y m2 /\ m1 * m2 <= 67108864}
-> z:
Lib.IntTypes.uint128
{ Lib.IntTypes.uint_v z == Lib.IntTypes.uint_v x * Lib.IntTypes.uint_... | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.scale64",
"Lib.IntTypes.uint64",
"Prims.b2t",
"Hacl.Spec.Curve25519.Field51.Definition.felem_fits1",
"Prims.l_and",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.mul64_wide",
"Prims.unit",
"Prims._assert",
"Lib.IntTypes.v",
"Lib.IntType... | [] | false | false | false | false | false | let mul_wide64 #m1 #m2 x y =
| let open FStar.Math.Lemmas in
lemma_mult_le_left (v x) (v y) (m2 * max51);
lemma_mult_le_right (m2 * max51) (v x) (m1 * max51);
paren_mul_right (m1 * max51) m2 max51;
paren_mul_right m1 max51 m2;
swap_mul max51 m2;
paren_mul_right m1 m2 max51;
paren_mul_right (m1 * m2) max51 max51;
assert (v x * v y <= ((m1 * max51) * ... | false |
GMST.fst | GMST.transport_gmst_rel | val transport_gmst_rel
(#a: Type)
(#rel1: relation state)
(#rel2: relation state {rel1 == rel2})
(#wp: mst_wp state a rel1)
(f: (unit -> GMST a (rel1 >< wp)))
: GMST a (rel2 >< wp) | val transport_gmst_rel
(#a: Type)
(#rel1: relation state)
(#rel2: relation state {rel1 == rel2})
(#wp: mst_wp state a rel1)
(f: (unit -> GMST a (rel1 >< wp)))
: GMST a (rel2 >< wp) | let transport_gmst_rel (#a:Type) (#rel1:relation state) (#rel2:relation state{rel1 == rel2})
(#wp:mst_wp state a rel1)
(f:unit -> GMST a (rel1 >< wp)) : GMST a (rel2 >< wp)
= f () | {
"file_name": "examples/indexed_effects/GMST.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 8,
"end_line": 178,
"start_col": 0,
"start_line": 175
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "GMST.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f: (_: Prims.unit -> GMST.GMST a) -> GMST.GMST a | GMST.GMST | [] | [] | [
"FStar.Preorder.relation",
"GMST.state",
"Prims.eq2",
"GMST.mst_wp",
"Prims.unit",
"GMST.op_Greater_Less"
] | [] | false | true | false | false | false | let transport_gmst_rel
(#a: Type)
(#rel1: relation state)
(#rel2: relation state {rel1 == rel2})
(#wp: mst_wp state a rel1)
(f: (unit -> GMST a (rel1 >< wp)))
: GMST a (rel2 >< wp) =
| f () | false |
GMST.fst | GMST.app | val app
(#a #b: Type)
(#rel1 #rel2: relation state)
(#wp1: mst_wp state a rel1)
(#wp2: (a -> mst_wp state b rel2))
(f: (unit -> GMST a (rel1 >< wp1)))
(g: (x: a -> GMST b (rel2 >< wp2 x)))
: GMST b ((rel2 @ rel1) >< (fun s0 p -> wp1 s0 (fun x s1 -> wp2 x s1 p))) | val app
(#a #b: Type)
(#rel1 #rel2: relation state)
(#wp1: mst_wp state a rel1)
(#wp2: (a -> mst_wp state b rel2))
(f: (unit -> GMST a (rel1 >< wp1)))
(g: (x: a -> GMST b (rel2 >< wp2 x)))
: GMST b ((rel2 @ rel1) >< (fun s0 p -> wp1 s0 (fun x s1 -> wp2 x s1 p))) | let app (#a:Type) (#b:Type)
(#rel1:relation state)
(#rel2:relation state)
(#wp1:mst_wp state a rel1)
(#wp2:a -> mst_wp state b rel2)
(f:unit -> GMST a (rel1 >< wp1))
(g:(x:a -> GMST b (rel2 >< wp2 x)))
: GMST b ((rel2 @ rel1) >< (fun s0 p -> wp1 s0 (fun x s1 -> wp2 x s... | {
"file_name": "examples/indexed_effects/GMST.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 12,
"end_line": 132,
"start_col": 0,
"start_line": 124
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "GMST.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f: (_: Prims.unit -> GMST.GMST a) -> g: (x: a -> GMST.GMST b) -> GMST.GMST b | GMST.GMST | [] | [] | [
"FStar.Preorder.relation",
"GMST.state",
"GMST.mst_wp",
"Prims.unit",
"GMST.op_Greater_Less",
"GMST.op_At"
] | [] | false | true | false | false | false | let app
(#a #b: Type)
(#rel1 #rel2: relation state)
(#wp1: mst_wp state a rel1)
(#wp2: (a -> mst_wp state b rel2))
(f: (unit -> GMST a (rel1 >< wp1)))
(g: (x: a -> GMST b (rel2 >< wp2 x)))
: GMST b ((rel2 @ rel1) >< (fun s0 p -> wp1 s0 (fun x s1 -> wp2 x s1 p))) =
| g (f ()) | false |
Hacl.Spec.Curve25519.Field51.fst | Hacl.Spec.Curve25519.Field51.carry51 | val carry51:
l:uint64
-> cin:uint64
-> Pure (uint64 & uint64)
(requires felem_fits1 l 2 /\ felem_fits1 cin 8190)
(ensures fun (l0, l1) ->
v l + v cin == v l1 * pow2 51 + v l0 /\
felem_fits1 l0 1 /\ uint_v l1 < pow2 13) | val carry51:
l:uint64
-> cin:uint64
-> Pure (uint64 & uint64)
(requires felem_fits1 l 2 /\ felem_fits1 cin 8190)
(ensures fun (l0, l1) ->
v l + v cin == v l1 * pow2 51 + v l0 /\
felem_fits1 l0 1 /\ uint_v l1 < pow2 13) | let carry51 l cin =
let l' = l +! cin in
lemma_carry51 l cin;
(l' &. mask51, l' >>. 51ul) | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 29,
"end_line": 220,
"start_col": 0,
"start_line": 217
} | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | l: Lib.IntTypes.uint64 -> cin: Lib.IntTypes.uint64
-> Prims.Pure (Lib.IntTypes.uint64 * Lib.IntTypes.uint64) | Prims.Pure | [] | [] | [
"Lib.IntTypes.uint64",
"FStar.Pervasives.Native.Mktuple2",
"Lib.IntTypes.op_Amp_Dot",
"Lib.IntTypes.U64",
"Lib.IntTypes.SEC",
"Hacl.Spec.Curve25519.Field51.Definition.mask51",
"Lib.IntTypes.op_Greater_Greater_Dot",
"FStar.UInt32.__uint_to_t",
"Prims.unit",
"Hacl.Spec.Curve25519.Field51.Lemmas.lemm... | [] | false | false | false | false | false | let carry51 l cin =
| let l' = l +! cin in
lemma_carry51 l cin;
(l' &. mask51, l' >>. 51ul) | false |
FStar.BigOps.fsti | FStar.BigOps.normal | val normal (#a: Type) (x: a) : a | val normal (#a: Type) (x: a) : a | let normal (#a: Type) (x: a) : a =
FStar.Pervasives.norm [
iota;
zeta;
delta_only [`%L.fold_right_gtot; `%L.map_gtot];
delta_attr [`%__reduce__];
primops;
simplify
]
x | {
"file_name": "ulib/FStar.BigOps.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 57,
"start_col": 0,
"start_line": 48
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_file": "FStar.BigOps.fsti"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: a -> a | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.norm",
"Prims.Cons",
"FStar.Pervasives.norm_step",
"FStar.Pervasives.iota",
"FStar.Pervasives.zeta",
"FStar.Pervasives.delta_only",
"Prims.string",
"Prims.Nil",
"FStar.Pervasives.delta_attr",
"FStar.Pervasives.primops",
"FStar.Pervasives.simplify"
] | [] | false | false | false | true | false | let normal (#a: Type) (x: a) : a =
| FStar.Pervasives.norm [
iota;
zeta;
delta_only [`%L.fold_right_gtot; `%L.map_gtot];
delta_attr [`%__reduce__];
primops;
simplify
]
x | false |
Hacl.Curve25519_51.fst | Hacl.Curve25519_51.ecdh | val ecdh: ecdh_st M51 True | val ecdh: ecdh_st M51 True | let ecdh = generic_ecdh_higher #M51 True scalarmult | {
"file_name": "code/curve25519/Hacl.Curve25519_51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 51,
"end_line": 24,
"start_col": 0,
"start_line": 24
} | module Hacl.Curve25519_51
friend Hacl.Meta.Curve25519
open Hacl.Meta.Curve25519
// The Hacl core.
module C = Hacl.Impl.Curve25519.Field51
let g25519: g25519_t =
Lib.Buffer.createL_global Spec.Curve25519.basepoint_list
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
let point_add_and_double =
addanddoub... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Meta.Curve25519.fst.checked",
"Hacl.Impl.Curve25519.Field51.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Hacl.Curve2... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Curve25519.Field51",
"short_module": "C"
},
{
"abbrev": false,
"full_module": "Hacl.Meta.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Curve25519.Fields",
"short_module": null
},
{
"ab... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Impl.Curve25519.Generic.ecdh_st Hacl.Impl.Curve25519.Fields.Core.M51 Prims.l_True | Prims.Tot | [
"total"
] | [] | [
"Hacl.Meta.Curve25519.generic_ecdh_higher",
"Hacl.Impl.Curve25519.Fields.Core.M51",
"Prims.l_True",
"Hacl.Curve25519_51.scalarmult"
] | [] | false | false | false | true | false | let ecdh =
| generic_ecdh_higher #M51 True scalarmult | false |
Hacl.Spec.Curve25519.Field51.fst | Hacl.Spec.Curve25519.Field51.mul_add_wide128 | val mul_add_wide128:
#m1:scale64
-> #m2:scale64
-> #m3:scale128
-> x:uint64{felem_fits1 x m1}
-> y:uint64{felem_fits1 y m2}
-> z:uint128{felem_wide_fits1 z m3 /\ m3 + m1 * m2 <= 67108864}
-> r:uint128{uint_v r == uint_v z + uint_v x * uint_v y /\ felem_wide_fits1 r (m3 + m1 * m2)} | val mul_add_wide128:
#m1:scale64
-> #m2:scale64
-> #m3:scale128
-> x:uint64{felem_fits1 x m1}
-> y:uint64{felem_fits1 y m2}
-> z:uint128{felem_wide_fits1 z m3 /\ m3 + m1 * m2 <= 67108864}
-> r:uint128{uint_v r == uint_v z + uint_v x * uint_v y /\ felem_wide_fits1 r (m3 + m1 * m2)} | let mul_add_wide128 #m1 #m2 #m3 x y z =
z +! mul_wide64 #m1 #m2 x y | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 29,
"end_line": 138,
"start_col": 0,
"start_line": 137
} | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
x: Lib.IntTypes.uint64{Hacl.Spec.Curve25519.Field51.Definition.felem_fits1 x m1} ->
y: Lib.IntTypes.uint64{Hacl.Spec.Curve25519.Field51.Definition.felem_fits1 y m2} ->
z:
Lib.IntTypes.uint128
{Hacl.Spec.Curve25519.Field51.Definition.felem_wide_fits1 z m3 /\ m3 + m1 * m2 <= 67108864}
-> r:
... | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.scale64",
"Hacl.Spec.Curve25519.Field51.Definition.scale128",
"Lib.IntTypes.uint64",
"Prims.b2t",
"Hacl.Spec.Curve25519.Field51.Definition.felem_fits1",
"Lib.IntTypes.uint128",
"Prims.l_and",
"Hacl.Spec.Curve25519.Field51.Definition.felem_wide_fits1",
"Prims.... | [] | false | false | false | false | false | let mul_add_wide128 #m1 #m2 #m3 x y z =
| z +! mul_wide64 #m1 #m2 x y | false |
FStar.BigOps.fsti | FStar.BigOps.map_op' | val map_op' (#a #b #c: _) (op: (b -> c -> GTot c)) (f: (a -> GTot b)) (l: list a) (z: c) : GTot c | val map_op' (#a #b #c: _) (op: (b -> c -> GTot c)) (f: (a -> GTot b)) (l: list a) (z: c) : GTot c | let map_op' #a #b #c (op: (b -> c -> GTot c)) (f: (a -> GTot b)) (l: list a) (z: c) : GTot c =
L.fold_right_gtot #a #c l (fun x acc -> (f x) `op` acc) z | {
"file_name": "ulib/FStar.BigOps.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 59,
"end_line": 68,
"start_col": 0,
"start_line": 67
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_file": "FStar.BigOps.fsti"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | op: (_: b -> _: c -> Prims.GTot c) -> f: (_: a -> Prims.GTot b) -> l: Prims.list a -> z: c
-> Prims.GTot c | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.list",
"FStar.List.Tot.Base.fold_right_gtot"
] | [] | false | false | false | false | false | let map_op' #a #b #c (op: (b -> c -> GTot c)) (f: (a -> GTot b)) (l: list a) (z: c) : GTot c =
| L.fold_right_gtot #a #c l (fun x acc -> (f x) `op` acc) z | false |
Hacl.Spec.Curve25519.Field51.fst | Hacl.Spec.Curve25519.Field51.fsqr25 | val fsqr25:
f1:felem5{felem_fits5 f1 (9, 10, 9, 9, 9)}
-> f2:felem5{felem_fits5 f2 (9, 10, 9, 9, 9)}
-> Pure (felem5 & felem5)
(requires True)
(ensures fun (out1, out2) ->
mul_inv_t out1 /\
mul_inv_t out2 /\
feval out1 == fmul (feval f1) (feval f1) /\
feval out2 == fmul (feval f2... | val fsqr25:
f1:felem5{felem_fits5 f1 (9, 10, 9, 9, 9)}
-> f2:felem5{felem_fits5 f2 (9, 10, 9, 9, 9)}
-> Pure (felem5 & felem5)
(requires True)
(ensures fun (out1, out2) ->
mul_inv_t out1 /\
mul_inv_t out2 /\
feval out1 == fmul (feval f1) (feval f1) /\
feval out2 == fmul (feval f2... | let fsqr25 (f10, f11, f12, f13, f14) (f20, f21, f22, f23, f24) =
let (o10, o11, o12, o13, o14) = fsqr_felem5 (f10, f11, f12, f13, f14) in
let (o20, o21, o22, o23, o24) = fsqr_felem5 (f20, f21, f22, f23, f24) in
let (o10, o11, o12, o13, o14) = carry_wide5 (o10, o11, o12, o13, o14) in
let (o20, o21, o22, o23, o24... | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 56,
"end_line": 434,
"start_col": 0,
"start_line": 429
} | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
f1:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 f1 (9, 10, 9, 9, 9)} ->
f2:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 f2 (9, 10, 9, 9, 9)}
-> Prims.Pure
(Hacl.Spec... | Prims.Pure | [] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.felem5",
"Hacl.Spec.Curve25519.Field51.Definition.felem_fits5",
"FStar.Pervasives.Native.Mktuple5",
"Prims.nat",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.tuple5",
"Lib.IntTypes.uint64",
"Lib.IntTypes.uint128",
"FStar.Pervasives.Native.tupl... | [] | false | false | false | false | false | let fsqr25 (f10, f11, f12, f13, f14) (f20, f21, f22, f23, f24) =
| let o10, o11, o12, o13, o14 = fsqr_felem5 (f10, f11, f12, f13, f14) in
let o20, o21, o22, o23, o24 = fsqr_felem5 (f20, f21, f22, f23, f24) in
let o10, o11, o12, o13, o14 = carry_wide5 (o10, o11, o12, o13, o14) in
let o20, o21, o22, o23, o24 = carry_wide5 (o20, o21, o22, o23, o24) in
((o10, o11, o12, o13, o14), (o20, o2... | false |
FStar.BigOps.fsti | FStar.BigOps.symmetric | val symmetric : f: (_: a -> _: a -> Type0) -> Prims.logical | let symmetric (#a: Type) (f: (a -> a -> Type)) = forall x y. f x y <==> f y x | {
"file_name": "ulib/FStar.BigOps.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 77,
"end_line": 183,
"start_col": 0,
"start_line": 183
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_file": "FStar.BigOps.fsti"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f: (_: a -> _: a -> Type0) -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Prims.l_Forall",
"Prims.l_iff",
"Prims.logical"
] | [] | false | false | false | true | true | let symmetric (#a: Type) (f: (a -> a -> Type)) =
| forall x y. f x y <==> f y x | false | |
Hacl.Curve25519_51.fst | Hacl.Curve25519_51.finv | val finv : Hacl.Meta.Curve25519.finv_finv_higher_t Prims.l_True | let finv = finv_finv_higher #M51 True C.fmul fsquare_times | {
"file_name": "code/curve25519/Hacl.Curve25519_51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 58,
"end_line": 20,
"start_col": 0,
"start_line": 20
} | module Hacl.Curve25519_51
friend Hacl.Meta.Curve25519
open Hacl.Meta.Curve25519
// The Hacl core.
module C = Hacl.Impl.Curve25519.Field51
let g25519: g25519_t =
Lib.Buffer.createL_global Spec.Curve25519.basepoint_list
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
let point_add_and_double =
addanddoub... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Meta.Curve25519.fst.checked",
"Hacl.Impl.Curve25519.Field51.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Hacl.Curve2... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Curve25519.Field51",
"short_module": "C"
},
{
"abbrev": false,
"full_module": "Hacl.Meta.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Curve25519.Fields",
"short_module": null
},
{
"ab... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Meta.Curve25519.finv_finv_higher_t Prims.l_True | Prims.Tot | [
"total"
] | [] | [
"Hacl.Meta.Curve25519.finv_finv_higher",
"Hacl.Impl.Curve25519.Fields.Core.M51",
"Prims.l_True",
"Hacl.Impl.Curve25519.Field51.fmul",
"Hacl.Curve25519_51.fsquare_times"
] | [] | false | false | false | true | false | let finv =
| finv_finv_higher #M51 True C.fmul fsquare_times | false | |
FStar.BigOps.fsti | FStar.BigOps.anti_reflexive | val anti_reflexive : f: (_: a -> _: a -> Type0) -> Prims.logical | let anti_reflexive (#a: Type) (f: (a -> a -> Type)) = forall x. ~(f x x) | {
"file_name": "ulib/FStar.BigOps.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 72,
"end_line": 189,
"start_col": 0,
"start_line": 189
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_file": "FStar.BigOps.fsti"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f: (_: a -> _: a -> Type0) -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Prims.l_Forall",
"Prims.l_not",
"Prims.logical"
] | [] | false | false | false | true | true | let anti_reflexive (#a: Type) (f: (a -> a -> Type)) =
| forall x. ~(f x x) | false | |
FStar.BigOps.fsti | FStar.BigOps.reflexive | val reflexive : f: (_: a -> _: a -> Type0) -> Prims.logical | let reflexive (#a: Type) (f: (a -> a -> Type)) = forall x. f x x | {
"file_name": "ulib/FStar.BigOps.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 64,
"end_line": 186,
"start_col": 0,
"start_line": 186
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_file": "FStar.BigOps.fsti"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f: (_: a -> _: a -> Type0) -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Prims.l_Forall",
"Prims.logical"
] | [] | false | false | false | true | true | let reflexive (#a: Type) (f: (a -> a -> Type)) =
| forall x. f x x | false | |
Hacl.Spec.Curve25519.Field51.fst | Hacl.Spec.Curve25519.Field51.fmul15 | val fmul15:
f1:felem5{felem_fits5 f1 (9, 10, 9, 9, 9)}
-> f2:uint64{felem_fits1 f2 1}
-> Pure felem5
(requires True)
(ensures fun out ->
mul_inv_t out /\ feval out == (feval f1 * v f2) % prime) | val fmul15:
f1:felem5{felem_fits5 f1 (9, 10, 9, 9, 9)}
-> f2:uint64{felem_fits1 f2 1}
-> Pure felem5
(requires True)
(ensures fun out ->
mul_inv_t out /\ feval out == (feval f1 * v f2) % prime) | let fmul15 (f10, f11, f12, f13, f14) f2 =
let (tmp_w0, tmp_w1, tmp_w2, tmp_w3, tmp_w4) =
smul_felem5 #1 #(9, 10, 9, 9, 9) f2 (f10, f11, f12, f13, f14) in
let out = (tmp_w0, tmp_w1, tmp_w2, tmp_w3, tmp_w4) in
[@inline_let]
let res = carry_wide5 (tmp_w0, tmp_w1, tmp_w2, tmp_w3, tmp_w4) in
FStar.Math.Lemmas... | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 5,
"end_line": 342,
"start_col": 0,
"start_line": 328
} | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
f1:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 f1 (9, 10, 9, 9, 9)} ->
f2: Lib.IntTypes.uint64{Hacl.Spec.Curve25519.Field51.Definition.felem_fits1 f2 1}
-> Prims.Pure Hacl.Spec.Curve25519.Field51.Definition.felem5 | Prims.Pure | [] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.felem5",
"Hacl.Spec.Curve25519.Field51.Definition.felem_fits5",
"FStar.Pervasives.Native.Mktuple5",
"Prims.nat",
"Lib.IntTypes.uint64",
"Prims.b2t",
"Hacl.Spec.Curve25519.Field51.Definition.felem_fits1",
"Lib.IntTypes.uint128",
"Prims.unit",
"Prims._assert"... | [] | false | false | false | false | false | let fmul15 (f10, f11, f12, f13, f14) f2 =
| let tmp_w0, tmp_w1, tmp_w2, tmp_w3, tmp_w4 =
smul_felem5 #1 #(9, 10, 9, 9, 9) f2 (f10, f11, f12, f13, f14)
in
let out = (tmp_w0, tmp_w1, tmp_w2, tmp_w3, tmp_w4) in
[@@ inline_let ]let res = carry_wide5 (tmp_w0, tmp_w1, tmp_w2, tmp_w3, tmp_w4) in
FStar.Math.Lemmas.lemma_mod_mul_distr_l (as_nat5 (f10, f11, f12, f13, f1... | false |
Hacl.Spec.Curve25519.Field51.fst | Hacl.Spec.Curve25519.Field51.mul_inv_t | val mul_inv_t : f: Hacl.Spec.Curve25519.Field51.Definition.felem5 -> Prims.logical | let mul_inv_t (f:felem5) =
let (o0, o1, o2, o3, o4) = f in
if v o1 >= pow2 51 then
felem_fits5 f (1, 2, 1, 1, 1) /\ v o1 % pow2 51 < 8192
else felem_fits5 f (1, 1, 1, 1, 1) | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 36,
"end_line": 241,
"start_col": 0,
"start_line": 237
} | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f: Hacl.Spec.Curve25519.Field51.Definition.felem5 -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.felem5",
"Lib.IntTypes.uint64",
"Prims.op_GreaterThanOrEqual",
"Lib.IntTypes.v",
"Lib.IntTypes.U64",
"Lib.IntTypes.SEC",
"Prims.pow2",
"Prims.l_and",
"Hacl.Spec.Curve25519.Field51.Definition.felem_fits5",
"FStar.Pervasives.Native.Mktuple5",
"Prims.nat",
... | [] | false | false | false | true | true | let mul_inv_t (f: felem5) =
| let o0, o1, o2, o3, o4 = f in
if v o1 >= pow2 51
then felem_fits5 f (1, 2, 1, 1, 1) /\ v o1 % pow2 51 < 8192
else felem_fits5 f (1, 1, 1, 1, 1) | false | |
Hacl.Spec.Curve25519.Field51.fst | Hacl.Spec.Curve25519.Field51.precomp_r19 | val precomp_r19:
f2:felem5{felem_fits5 f2 (9, 10, 9, 9, 9)}
-> r19:felem5{felem_fits5 r19 (171, 190, 171, 171, 171)} | val precomp_r19:
f2:felem5{felem_fits5 f2 (9, 10, 9, 9, 9)}
-> r19:felem5{felem_fits5 r19 (171, 190, 171, 171, 171)} | let precomp_r19 (f20, f21, f22, f23, f24) =
[@inline_let]
let r190 = f20 *! u64 19 in
[@inline_let]
let r191 = f21 *! u64 19 in
[@inline_let]
let r192 = f22 *! u64 19 in
[@inline_let]
let r193 = f23 *! u64 19 in
[@inline_let]
let r194 = f24 *! u64 19 in
(r190, r191, r192, r193, r194) | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 32,
"end_line": 186,
"start_col": 0,
"start_line": 175
} | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
f2:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 f2 (9, 10, 9, 9, 9)}
-> r19:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 r19 (171, 190, 171, 171, 171)} | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.felem5",
"Hacl.Spec.Curve25519.Field51.Definition.felem_fits5",
"FStar.Pervasives.Native.Mktuple5",
"Prims.nat",
"Lib.IntTypes.uint64",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U64",
"Lib.IntTypes.SEC",
"Lib.IntTypes.op_Star_Bang",
"Lib.IntTypes.u64"
] | [] | false | false | false | false | false | let precomp_r19 (f20, f21, f22, f23, f24) =
| [@@ inline_let ]let r190 = f20 *! u64 19 in
[@@ inline_let ]let r191 = f21 *! u64 19 in
[@@ inline_let ]let r192 = f22 *! u64 19 in
[@@ inline_let ]let r193 = f23 *! u64 19 in
[@@ inline_let ]let r194 = f24 *! u64 19 in
(r190, r191, r192, r193, r194) | false |
Hacl.Spec.Curve25519.Field51.fst | Hacl.Spec.Curve25519.Field51.fmul25 | val fmul25:
f1:felem5{felem_fits5 f1 (9, 10, 9, 9, 9)}
-> f2:felem5{felem_fits5 f2 (9, 10, 9, 9, 9)}
-> f3:felem5{felem_fits5 f3 (9, 10, 9, 9, 9)}
-> f4:felem5{felem_fits5 f4 (9, 10, 9, 9, 9)}
-> Pure (felem5 & felem5)
(requires True)
(ensures fun (out1, out2) ->
mul_inv_t out1 /\ mul_inv_t ou... | val fmul25:
f1:felem5{felem_fits5 f1 (9, 10, 9, 9, 9)}
-> f2:felem5{felem_fits5 f2 (9, 10, 9, 9, 9)}
-> f3:felem5{felem_fits5 f3 (9, 10, 9, 9, 9)}
-> f4:felem5{felem_fits5 f4 (9, 10, 9, 9, 9)}
-> Pure (felem5 & felem5)
(requires True)
(ensures fun (out1, out2) ->
mul_inv_t out1 /\ mul_inv_t ou... | let fmul25 (f10, f11, f12, f13, f14) (f20, f21, f22, f23, f24) (f30, f31, f32, f33, f34) (f40, f41, f42, f43, f44) =
let (tmp10, tmp11, tmp12, tmp13, tmp14) = precomp_r19 (f20, f21, f22, f23, f24) in
let (tmp20, tmp21, tmp22, tmp23, tmp24) = precomp_r19 (f40, f41, f42, f43, f44) in
let (tmp_w10, tmp_w11, tmp_w12,... | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 48,
"end_line": 318,
"start_col": 0,
"start_line": 309
} | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
f1:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 f1 (9, 10, 9, 9, 9)} ->
f2:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 f2 (9, 10, 9, 9, 9)} ->
f3:
Hacl.Spec.Cur... | Prims.Pure | [] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.felem5",
"Hacl.Spec.Curve25519.Field51.Definition.felem_fits5",
"FStar.Pervasives.Native.Mktuple5",
"Prims.nat",
"FStar.Pervasives.Native.Mktuple4",
"FStar.Pervasives.Native.tuple5",
"Lib.IntTypes.uint64",
"Lib.IntTypes.uint128",
"FStar.Pervasives.Native.Mktu... | [] | false | false | false | false | false | let fmul25
(f10, f11, f12, f13, f14)
(f20, f21, f22, f23, f24)
(f30, f31, f32, f33, f34)
(f40, f41, f42, f43, f44)
=
| let tmp10, tmp11, tmp12, tmp13, tmp14 = precomp_r19 (f20, f21, f22, f23, f24) in
let tmp20, tmp21, tmp22, tmp23, tmp24 = precomp_r19 (f40, f41, f42, f43, f44) in
let tmp_w10, tmp_w11, tmp_w12, tmp_w13, tmp_w14 =
mul_felem5 (f10, f11, f12, f13, f14) (f20, f21, f22, f23, f24) (tmp10, tmp11, tmp12, tmp13, tmp14)
in
let ... | false |
Vale.AES.GF128.fsti | Vale.AES.GF128.gf128_mul_rev | val gf128_mul_rev (a b: poly) : poly | val gf128_mul_rev (a b: poly) : poly | let gf128_mul_rev (a b:poly) : poly =
reverse (gf128_mul (reverse a 127) (reverse b 127)) 127 | {
"file_name": "vale/code/crypto/aes/Vale.AES.GF128.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 57,
"end_line": 164,
"start_col": 0,
"start_line": 163
} | module Vale.AES.GF128
open FStar.Seq
open FStar.Mul
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GF128_s
open Vale.Math.Poly2_s
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Lemmas
let quad32_shift_left_1 (q:quad32) : quad32 =
let l... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.TypesNative",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Vale.Math.Poly2_s.poly -> b: Vale.Math.Poly2_s.poly -> Vale.Math.Poly2_s.poly | Prims.Tot | [
"total"
] | [] | [
"Vale.Math.Poly2_s.poly",
"Vale.Math.Poly2_s.reverse",
"Vale.AES.GF128_s.gf128_mul"
] | [] | false | false | false | true | false | let gf128_mul_rev (a b: poly) : poly =
| reverse (gf128_mul (reverse a 127) (reverse b 127)) 127 | false |
FStar.BigOps.fsti | FStar.BigOps.pairwise_op' | val pairwise_op' (#a #b: _) (op: (b -> b -> GTot b)) (f: (a -> a -> b)) (l: list a) (z: b) : GTot b | val pairwise_op' (#a #b: _) (op: (b -> b -> GTot b)) (f: (a -> a -> b)) (l: list a) (z: b) : GTot b | let rec pairwise_op' #a #b (op: (b -> b -> GTot b)) (f: (a -> a -> b)) (l: list a) (z: b) : GTot b =
match l with
| [] -> z
| hd :: tl -> (map_op' op (f hd) tl z) `op` (pairwise_op' op f tl z) | {
"file_name": "ulib/FStar.BigOps.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 70,
"end_line": 180,
"start_col": 0,
"start_line": 177
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_file": "FStar.BigOps.fsti"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | op: (_: b -> _: b -> Prims.GTot b) -> f: (_: a -> _: a -> b) -> l: Prims.list a -> z: b
-> Prims.GTot b | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.list",
"FStar.BigOps.map_op'",
"FStar.BigOps.pairwise_op'"
] | [
"recursion"
] | false | false | false | false | false | let rec pairwise_op' #a #b (op: (b -> b -> GTot b)) (f: (a -> a -> b)) (l: list a) (z: b) : GTot b =
| match l with
| [] -> z
| hd :: tl -> (map_op' op (f hd) tl z) `op` (pairwise_op' op f tl z) | false |
Vale.AES.GF128.fsti | Vale.AES.GF128.quad32_shift_2_left_1 | val quad32_shift_2_left_1 (qa qb: quad32) : quad32 & quad32 | val quad32_shift_2_left_1 (qa qb: quad32) : quad32 & quad32 | let quad32_shift_2_left_1 (qa qb:quad32) : quad32 & quad32 =
let la = four_map (fun (i:nat32) -> ishl i 1) qa in
let lb = four_map (fun (i:nat32) -> ishl i 1) qb in
let ra = four_map (fun (i:nat32) -> ishr i 31) qa in
let rb = four_map (fun (i:nat32) -> ishr i 31) qb in
let Mkfour ra0 ra1 ra2 ra3 = ra in
le... | {
"file_name": "vale/code/crypto/aes/Vale.AES.GF128.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 12,
"end_line": 29,
"start_col": 0,
"start_line": 20
} | module Vale.AES.GF128
open FStar.Seq
open FStar.Mul
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GF128_s
open Vale.Math.Poly2_s
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Lemmas
let quad32_shift_left_1 (q:quad32) : quad32 =
let l... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits_s",
"short_module": null
},
{
"abbrev": false,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | qa: Vale.Def.Types_s.quad32 -> qb: Vale.Def.Types_s.quad32
-> Vale.Def.Types_s.quad32 * Vale.Def.Types_s.quad32 | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Types_s.quad32",
"Vale.Def.Words_s.natN",
"Vale.Def.Words_s.pow2_32",
"FStar.Pervasives.Native.Mktuple2",
"Vale.Def.Types_s.quad32_xor",
"Vale.Def.Words_s.Mkfour",
"Vale.Def.Types_s.nat32",
"FStar.Pervasives.Native.tuple2",
"Vale.Def.Words_s.four",
"Vale.Def.Words.Four_s.four_map",
"Va... | [] | false | false | false | true | false | let quad32_shift_2_left_1 (qa qb: quad32) : quad32 & quad32 =
| let la = four_map (fun (i: nat32) -> ishl i 1) qa in
let lb = four_map (fun (i: nat32) -> ishl i 1) qb in
let ra = four_map (fun (i: nat32) -> ishr i 31) qa in
let rb = four_map (fun (i: nat32) -> ishr i 31) qb in
let Mkfour ra0 ra1 ra2 ra3 = ra in
let Mkfour rb0 rb1 rb2 rb3 = rb in
let qa' = quad32_xor la (Mkfour 0 ra... | false |
Vale.AES.GF128.fsti | Vale.AES.GF128.quad32_shift_left_1 | val quad32_shift_left_1 (q: quad32) : quad32 | val quad32_shift_left_1 (q: quad32) : quad32 | let quad32_shift_left_1 (q:quad32) : quad32 =
let l = four_map (fun (i:nat32) -> ishl i 1) q in
let r = four_map (fun (i:nat32) -> ishr i 31) q in
let Mkfour r0 r1 r2 r3 = r in
quad32_xor l (Mkfour 0 r0 r1 r2) | {
"file_name": "vale/code/crypto/aes/Vale.AES.GF128.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 34,
"end_line": 18,
"start_col": 0,
"start_line": 14
} | module Vale.AES.GF128
open FStar.Seq
open FStar.Mul
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GF128_s
open Vale.Math.Poly2_s
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Lemmas | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits_s",
"short_module": null
},
{
"abbrev": false,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | q: Vale.Def.Types_s.quad32 -> Vale.Def.Types_s.quad32 | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Types_s.quad32",
"Vale.Def.Words_s.natN",
"Vale.Def.Words_s.pow2_32",
"Vale.Def.Types_s.quad32_xor",
"Vale.Def.Words_s.Mkfour",
"Vale.Def.Types_s.nat32",
"Vale.Def.Words_s.four",
"Vale.Def.Words.Four_s.four_map",
"Vale.Def.Types_s.ishr",
"Vale.Def.Types_s.ishl"
] | [] | false | false | false | true | false | let quad32_shift_left_1 (q: quad32) : quad32 =
| let l = four_map (fun (i: nat32) -> ishl i 1) q in
let r = four_map (fun (i: nat32) -> ishr i 31) q in
let Mkfour r0 r1 r2 r3 = r in
quad32_xor l (Mkfour 0 r0 r1 r2) | false |
Vale.AES.GF128.fsti | Vale.AES.GF128.gf128_low_shift | val gf128_low_shift:poly | val gf128_low_shift:poly | let gf128_low_shift : poly = shift gf128_modulus_low_terms (-1) | {
"file_name": "vale/code/crypto/aes/Vale.AES.GF128.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 63,
"end_line": 149,
"start_col": 0,
"start_line": 149
} | module Vale.AES.GF128
open FStar.Seq
open FStar.Mul
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GF128_s
open Vale.Math.Poly2_s
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Lemmas
let quad32_shift_left_1 (q:quad32) : quad32 =
let l... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.TypesNative",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Vale.Math.Poly2_s.poly | Prims.Tot | [
"total"
] | [] | [
"Vale.Math.Poly2_s.shift",
"Vale.AES.GF128_s.gf128_modulus_low_terms",
"Prims.op_Minus"
] | [] | false | false | false | true | false | let gf128_low_shift:poly =
| shift gf128_modulus_low_terms (- 1) | false |
Hacl.Spec.Curve25519.Field51.fst | Hacl.Spec.Curve25519.Field51.mul64_wide_add3 | val mul64_wide_add3:
#m0:scale64 -> #m1:scale64 -> #m2:scale64
-> #m3:scale64 -> #m4:scale64 -> #m5:scale64
-> a0:uint64{felem_fits1 a0 m0}
-> a1:uint64{felem_fits1 a1 m1}
-> b0:uint64{felem_fits1 b0 m2}
-> b1:uint64{felem_fits1 b1 m3}
-> c0:uint64{felem_fits1 c0 m4}
-> c1:uint64{felem_fits1 c1 m5} ->... | val mul64_wide_add3:
#m0:scale64 -> #m1:scale64 -> #m2:scale64
-> #m3:scale64 -> #m4:scale64 -> #m5:scale64
-> a0:uint64{felem_fits1 a0 m0}
-> a1:uint64{felem_fits1 a1 m1}
-> b0:uint64{felem_fits1 b0 m2}
-> b1:uint64{felem_fits1 b1 m3}
-> c0:uint64{felem_fits1 c0 m4}
-> c1:uint64{felem_fits1 c1 m5} ->... | let mul64_wide_add3 #m0 #m1 #m2 #m3 #m4 #m5 a0 a1 b0 b1 c0 c1 =
assert_norm (pow2 13 = 8192);
mul64_wide_add3_lemma #m0 #m1 #m2 #m3 #m4 #m5 a0 a1 b0 b1 c0 c1;
mul64_wide a0 a1 +! mul64_wide b0 b1 +! mul64_wide c0 c1 | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 58,
"end_line": 380,
"start_col": 0,
"start_line": 377
} | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
a0: Lib.IntTypes.uint64{Hacl.Spec.Curve25519.Field51.Definition.felem_fits1 a0 m0} ->
a1: Lib.IntTypes.uint64{Hacl.Spec.Curve25519.Field51.Definition.felem_fits1 a1 m1} ->
b0: Lib.IntTypes.uint64{Hacl.Spec.Curve25519.Field51.Definition.felem_fits1 b0 m2} ->
b1: Lib.IntTypes.uint64{Hacl.Spec.Curve25519.... | Prims.Pure | [] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.scale64",
"Lib.IntTypes.uint64",
"Prims.b2t",
"Hacl.Spec.Curve25519.Field51.Definition.felem_fits1",
"Lib.IntTypes.op_Plus_Bang",
"Lib.IntTypes.U128",
"Lib.IntTypes.SEC",
"Lib.IntTypes.mul64_wide",
"Prims.unit",
"Hacl.Spec.Curve25519.Field51.Lemmas.mul64_wi... | [] | false | false | false | false | false | let mul64_wide_add3 #m0 #m1 #m2 #m3 #m4 #m5 a0 a1 b0 b1 c0 c1 =
| assert_norm (pow2 13 = 8192);
mul64_wide_add3_lemma #m0 #m1 #m2 #m3 #m4 #m5 a0 a1 b0 b1 c0 c1;
mul64_wide a0 a1 +! mul64_wide b0 b1 +! mul64_wide c0 c1 | false |
Vale.AES.GF128.fsti | Vale.AES.GF128.gf128_rev_shift | val gf128_rev_shift:poly | val gf128_rev_shift:poly | let gf128_rev_shift : poly = reverse gf128_low_shift 127 | {
"file_name": "vale/code/crypto/aes/Vale.AES.GF128.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 56,
"end_line": 152,
"start_col": 0,
"start_line": 152
} | module Vale.AES.GF128
open FStar.Seq
open FStar.Mul
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GF128_s
open Vale.Math.Poly2_s
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Lemmas
let quad32_shift_left_1 (q:quad32) : quad32 =
let l... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.TypesNative",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Vale.Math.Poly2_s.poly | Prims.Tot | [
"total"
] | [] | [
"Vale.Math.Poly2_s.reverse",
"Vale.AES.GF128.gf128_low_shift"
] | [] | false | false | false | true | false | let gf128_rev_shift:poly =
| reverse gf128_low_shift 127 | false |
Hacl.Spec.Curve25519.Field51.fst | Hacl.Spec.Curve25519.Field51.mul_felem5 | val mul_felem5:
f1:felem5{felem_fits5 f1 (9, 10, 9, 9, 9)}
-> r:felem5{felem_fits5 r (9, 10, 9, 9, 9)}
-> r19:felem5{felem_fits5 r19 (171, 190, 171, 171, 171) /\ r19 == precomp_r19 r}
-> out:felem_wide5{felem_wide_fits5 out (6579, 4797, 3340, 1881, 423) /\
feval_wide out == fmul (feval f1) (feval r)} | val mul_felem5:
f1:felem5{felem_fits5 f1 (9, 10, 9, 9, 9)}
-> r:felem5{felem_fits5 r (9, 10, 9, 9, 9)}
-> r19:felem5{felem_fits5 r19 (171, 190, 171, 171, 171) /\ r19 == precomp_r19 r}
-> out:felem_wide5{felem_wide_fits5 out (6579, 4797, 3340, 1881, 423) /\
feval_wide out == fmul (feval f1) (feval r)} | let mul_felem5 (f10, f11, f12, f13, f14) (r0, r1, r2, r3, r4) (r190, r191, r192, r193, r194) =
let (o0, o1, o2, o3, o4) = smul_felem5 #9 #(9, 10, 9, 9, 9) f10 (r0, r1, r2, r3, r4) in
let (o0, o1, o2, o3, o4) = smul_add_felem5 #10 #(171, 9, 10, 9, 9) #(81, 90, 81, 81, 81)
f11 (r194, r0, r1, r2, r3) (o0, o1, o2, ... | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 206,
"start_col": 0,
"start_line": 195
} | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
f1:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 f1 (9, 10, 9, 9, 9)} ->
r:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 r (9, 10, 9, 9, 9)} ->
r19:
Hacl.Spec.Curv... | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.felem5",
"Hacl.Spec.Curve25519.Field51.Definition.felem_fits5",
"FStar.Pervasives.Native.Mktuple5",
"Prims.nat",
"Prims.l_and",
"Prims.eq2",
"Hacl.Spec.Curve25519.Field51.precomp_r19",
"FStar.Pervasives.Native.Mktuple3",
"FStar.Pervasives.Native.tuple5",
"L... | [] | false | false | false | false | false | let mul_felem5 (f10, f11, f12, f13, f14) (r0, r1, r2, r3, r4) (r190, r191, r192, r193, r194) =
| let o0, o1, o2, o3, o4 = smul_felem5 #9 #(9, 10, 9, 9, 9) f10 (r0, r1, r2, r3, r4) in
let o0, o1, o2, o3, o4 =
smul_add_felem5 #10
#(171, 9, 10, 9, 9)
#(81, 90, 81, 81, 81)
f11
(r194, r0, r1, r2, r3)
(o0, o1, o2, o3, o4)
in
let o0, o1, o2, o3, o4 =
smul_add_felem5 #9
#(171, 171, 9, 10, 9)
... | false |
Hacl.Spec.Curve25519.Field51.fst | Hacl.Spec.Curve25519.Field51.subtract_p5 | val subtract_p5:
f:felem5{felem_fits5 f (1, 1, 1, 1, 1)}
-> Pure felem5
(requires True)
(ensures fun out ->
as_nat5 out == feval f /\
felem_fits5 out (1, 1, 1, 1, 1) /\
as_nat5 out < prime) | val subtract_p5:
f:felem5{felem_fits5 f (1, 1, 1, 1, 1)}
-> Pure felem5
(requires True)
(ensures fun out ->
as_nat5 out == feval f /\
felem_fits5 out (1, 1, 1, 1, 1) /\
as_nat5 out < prime) | let subtract_p5 (f0, f1, f2, f3, f4) =
let m0 = gte_mask f0 (u64 0x7ffffffffffed) in
let m1 = eq_mask f1 (u64 0x7ffffffffffff) in
let m2 = eq_mask f2 (u64 0x7ffffffffffff) in
let m3 = eq_mask f3 (u64 0x7ffffffffffff) in
let m4 = eq_mask f4 (u64 0x7ffffffffffff) in
let mask = m0 &. m1 &. m2 &. m3 &. m4 in
... | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 27,
"end_line": 481,
"start_col": 0,
"start_line": 466
} | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 2,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
f:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 f (1, 1, 1, 1, 1)}
-> Prims.Pure Hacl.Spec.Curve25519.Field51.Definition.felem5 | Prims.Pure | [] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.felem5",
"Hacl.Spec.Curve25519.Field51.Definition.felem_fits5",
"FStar.Pervasives.Native.Mktuple5",
"Prims.nat",
"Lib.IntTypes.uint64",
"Prims.unit",
"Hacl.Spec.Curve25519.Field51.Lemmas.lemma_subtract_p",
"Lib.IntTypes.logand_lemma",
"Lib.IntTypes.U64",
"L... | [] | false | false | false | false | false | let subtract_p5 (f0, f1, f2, f3, f4) =
| let m0 = gte_mask f0 (u64 0x7ffffffffffed) in
let m1 = eq_mask f1 (u64 0x7ffffffffffff) in
let m2 = eq_mask f2 (u64 0x7ffffffffffff) in
let m3 = eq_mask f3 (u64 0x7ffffffffffff) in
let m4 = eq_mask f4 (u64 0x7ffffffffffff) in
let mask = m0 &. m1 &. m2 &. m3 &. m4 in
let f0' = f0 -. (mask &. u64 0x7ffffffffffed) in
let ... | false |
Hacl.Spec.Curve25519.Field51.fst | Hacl.Spec.Curve25519.Field51.smul_add_felem5 | val smul_add_felem5:
#m1:scale64
-> #m2:scale64_5
-> #m3:scale128_5
-> u1:uint64{felem_fits1 u1 m1}
-> f2:felem5{felem_fits5 f2 m2}
-> acc1:felem_wide5{felem_wide_fits5 acc1 m3 /\ m3 +* m1 *^ m2 <=* s128x5 67108864}
-> acc2:felem_wide5{
wide_as_nat5 acc2 == wide_as_nat5 acc1 + uint_v u1 * as_nat5 ... | val smul_add_felem5:
#m1:scale64
-> #m2:scale64_5
-> #m3:scale128_5
-> u1:uint64{felem_fits1 u1 m1}
-> f2:felem5{felem_fits5 f2 m2}
-> acc1:felem_wide5{felem_wide_fits5 acc1 m3 /\ m3 +* m1 *^ m2 <=* s128x5 67108864}
-> acc2:felem_wide5{
wide_as_nat5 acc2 == wide_as_nat5 acc1 + uint_v u1 * as_nat5 ... | let smul_add_felem5 #m1 #m2 #m3 u1 (f20, f21, f22, f23, f24) (o0, o1, o2, o3, o4) =
let (m20, m21, m22, m23, m24) = m2 in
let (m30, m31, m32, m33, m34) = m3 in
[@inline_let]
let o0' = mul_add_wide128 #m1 #m20 #m30 u1 f20 o0 in
[@inline_let]
let o1' = mul_add_wide128 #m1 #m21 #m31 u1 f21 o1 in
[@inline_let... | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 5,
"end_line": 168,
"start_col": 0,
"start_line": 152
} | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
u1: Lib.IntTypes.uint64{Hacl.Spec.Curve25519.Field51.Definition.felem_fits1 u1 m1} ->
f2:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 f2 m2} ->
acc1:
Hacl.Spec.Curve25519.Field51.Definition.felem_wide5
{ Hacl.Spec.Curve2551... | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.scale64",
"Hacl.Spec.Curve25519.Field51.Definition.scale64_5",
"Hacl.Spec.Curve25519.Field51.Definition.scale128_5",
"Lib.IntTypes.uint64",
"Prims.b2t",
"Hacl.Spec.Curve25519.Field51.Definition.felem_fits1",
"Hacl.Spec.Curve25519.Field51.Definition.felem5",
"Ha... | [] | false | false | false | false | false | let smul_add_felem5 #m1 #m2 #m3 u1 (f20, f21, f22, f23, f24) (o0, o1, o2, o3, o4) =
| let m20, m21, m22, m23, m24 = m2 in
let m30, m31, m32, m33, m34 = m3 in
[@@ inline_let ]let o0' = mul_add_wide128 #m1 #m20 #m30 u1 f20 o0 in
[@@ inline_let ]let o1' = mul_add_wide128 #m1 #m21 #m31 u1 f21 o1 in
[@@ inline_let ]let o2' = mul_add_wide128 #m1 #m22 #m32 u1 f22 o2 in
[@@ inline_let ]let o3' = mul_add_wide128... | false |
Hacl.Spec.Curve25519.Field51.fst | Hacl.Spec.Curve25519.Field51.carry_wide5 | val carry_wide5:
inp:felem_wide5{felem_wide_fits5 inp (6579, 4797, 3340, 1881, 423)}
-> Pure felem5
(requires True)
(ensures fun out ->
mul_inv_t out /\ feval out == feval_wide inp) | val carry_wide5:
inp:felem_wide5{felem_wide_fits5 inp (6579, 4797, 3340, 1881, 423)}
-> Pure felem5
(requires True)
(ensures fun out ->
mul_inv_t out /\ feval out == feval_wide inp) | let carry_wide5 (i0, i1, i2, i3, i4) =
assert_norm (6579 < pow2 13);
assert_norm (pow2 13 < max51);
let tmp0, c0 = carry51_wide #6579 i0 (u64 0) in
let tmp1, c1 = carry51_wide #4797 i1 c0 in
let tmp2, c2 = carry51_wide #3340 i2 c1 in
let tmp3, c3 = carry51_wide #1881 i3 c2 in
let tmp4, c4 = carry51_wide #... | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 34,
"end_line": 282,
"start_col": 0,
"start_line": 268
} | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
inp:
Hacl.Spec.Curve25519.Field51.Definition.felem_wide5
{Hacl.Spec.Curve25519.Field51.Definition.felem_wide_fits5 inp (6579, 4797, 3340, 1881, 423)}
-> Prims.Pure Hacl.Spec.Curve25519.Field51.Definition.felem5 | Prims.Pure | [] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.felem_wide5",
"Hacl.Spec.Curve25519.Field51.Definition.felem_wide_fits5",
"FStar.Pervasives.Native.Mktuple5",
"Prims.nat",
"Lib.IntTypes.uint128",
"Lib.IntTypes.uint64",
"Prims.unit",
"Hacl.Spec.Curve25519.Field51.lemma_mul_inv",
"Lib.IntTypes.int_t",
"Lib.... | [] | false | false | false | false | false | let carry_wide5 (i0, i1, i2, i3, i4) =
| assert_norm (6579 < pow2 13);
assert_norm (pow2 13 < max51);
let tmp0, c0 = carry51_wide #6579 i0 (u64 0) in
let tmp1, c1 = carry51_wide #4797 i1 c0 in
let tmp2, c2 = carry51_wide #3340 i2 c1 in
let tmp3, c3 = carry51_wide #1881 i3 c2 in
let tmp4, c4 = carry51_wide #423 i4 c3 in
lemma_carry5_simplify c0 c1 c2 c3 c4 tmp... | false |
Hacl.Spec.Curve25519.Field51.fst | Hacl.Spec.Curve25519.Field51.lemma_mul_inv | val lemma_mul_inv:
f:felem5{felem_fits5 f (1, 1, 1, 1, 1)}
-> cin:uint64{v cin < pow2 51}
-> Lemma
(let (i0, i1, i2, i3, i4) = f in
assert_norm (pow51 = pow2 51);
let i1' = i1 +! cin in
let out = (i0, i1', i2, i3, i4) in
if (v i1 + v cin) / pow2 51 > 0 then
felem_fits5 out (1, 2, 1... | val lemma_mul_inv:
f:felem5{felem_fits5 f (1, 1, 1, 1, 1)}
-> cin:uint64{v cin < pow2 51}
-> Lemma
(let (i0, i1, i2, i3, i4) = f in
assert_norm (pow51 = pow2 51);
let i1' = i1 +! cin in
let out = (i0, i1', i2, i3, i4) in
if (v i1 + v cin) / pow2 51 > 0 then
felem_fits5 out (1, 2, 1... | let lemma_mul_inv f cin =
assert_norm (pow51 = pow2 51) | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 31,
"end_line": 257,
"start_col": 0,
"start_line": 256
} | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
f:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 f (1, 1, 1, 1, 1)} ->
cin: Lib.IntTypes.uint64{Lib.IntTypes.v cin < Prims.pow2 51}
-> FStar.Pervasives.Lemma
(ensures
(let _ = f in
(let FStar.Pervasives.Native.Mktuple5 #_ #... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.felem5",
"Hacl.Spec.Curve25519.Field51.Definition.felem_fits5",
"FStar.Pervasives.Native.Mktuple5",
"Prims.nat",
"Lib.IntTypes.uint64",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U64",
"Lib.IntTypes.SEC",
"Prims.pow2",
"FStar.Perv... | [] | true | false | true | false | false | let lemma_mul_inv f cin =
| assert_norm (pow51 = pow2 51) | false |
Hacl.Spec.Curve25519.Field51.fst | Hacl.Spec.Curve25519.Field51.carry51_wide | val carry51_wide:
#m:scale64{m < 8192}
-> l:uint128{felem_wide_fits1 l m}
-> cin:uint64
-> Pure (uint64 & uint64)
(requires True)
(ensures fun (l0, l1) ->
v l + v cin == v l1 * pow2 51 + v l0 /\
felem_fits1 l0 1 /\ felem_fits1 l1 (m + 1)) | val carry51_wide:
#m:scale64{m < 8192}
-> l:uint128{felem_wide_fits1 l m}
-> cin:uint64
-> Pure (uint64 & uint64)
(requires True)
(ensures fun (l0, l1) ->
v l + v cin == v l1 * pow2 51 + v l0 /\
felem_fits1 l0 1 /\ felem_fits1 l1 (m + 1)) | let carry51_wide #m l cin =
let l' = l +! to_u128 cin in
lemma_carry51_wide #m l cin;
((to_u64 l') &. mask51, to_u64 (l' >>. 51ul)) | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 47,
"end_line": 235,
"start_col": 0,
"start_line": 232
} | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
l: Lib.IntTypes.uint128{Hacl.Spec.Curve25519.Field51.Definition.felem_wide_fits1 l m} ->
cin: Lib.IntTypes.uint64
-> Prims.Pure (Lib.IntTypes.uint64 * Lib.IntTypes.uint64) | Prims.Pure | [] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.scale64",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.uint128",
"Hacl.Spec.Curve25519.Field51.Definition.felem_wide_fits1",
"Lib.IntTypes.uint64",
"FStar.Pervasives.Native.Mktuple2",
"Lib.IntTypes.op_Amp_Dot",
"Lib.IntTypes.U64",
"Lib.IntTypes.SEC",
"... | [] | false | false | false | false | false | let carry51_wide #m l cin =
| let l' = l +! to_u128 cin in
lemma_carry51_wide #m l cin;
((to_u64 l') &. mask51, to_u64 (l' >>. 51ul)) | false |
Hacl.Spec.Curve25519.Field51.fst | Hacl.Spec.Curve25519.Field51.carry_felem5_full | val carry_felem5_full:
inp:felem5{mul_inv_t inp}
-> out:felem5{feval out == feval inp /\ felem_fits5 out (1, 1, 1, 1, 1)} | val carry_felem5_full:
inp:felem5{mul_inv_t inp}
-> out:felem5{feval out == feval inp /\ felem_fits5 out (1, 1, 1, 1, 1)} | let carry_felem5_full (f0, f1, f2, f3, f4) =
assert_norm (pow51 = pow2 51);
let tmp0, c0 = carry51 f0 (u64 0) in
let tmp1, c1 = carry51 f1 c0 in
assert (if v f1 < pow2 51 then v tmp1 < pow2 51 else v tmp1 < 8192);
let tmp2, c2 = carry51 f2 c1 in
let tmp3, c3 = carry51 f3 c2 in
let tmp4, c4 = carry51 f4 c3... | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 34,
"end_line": 455,
"start_col": 0,
"start_line": 442
} | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 2,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | inp: Hacl.Spec.Curve25519.Field51.Definition.felem5{Hacl.Spec.Curve25519.Field51.mul_inv_t inp}
-> out:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{ Hacl.Spec.Curve25519.Field51.Definition.feval out ==
Hacl.Spec.Curve25519.Field51.Definition.feval inp /\
Hacl.Spec.Curve25519.Field51.Defi... | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.felem5",
"Hacl.Spec.Curve25519.Field51.mul_inv_t",
"Lib.IntTypes.uint64",
"FStar.Pervasives.Native.Mktuple5",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U64",
"Lib.IntTypes.SEC",
"Lib.IntTypes.op_Plus_Bang",
"Prims.l_and",
"Prims.eq2",
"Spec.Curve25519.elem",
... | [] | false | false | false | false | false | let carry_felem5_full (f0, f1, f2, f3, f4) =
| assert_norm (pow51 = pow2 51);
let tmp0, c0 = carry51 f0 (u64 0) in
let tmp1, c1 = carry51 f1 c0 in
assert (if v f1 < pow2 51 then v tmp1 < pow2 51 else v tmp1 < 8192);
let tmp2, c2 = carry51 f2 c1 in
let tmp3, c3 = carry51 f3 c2 in
let tmp4, c4 = carry51 f4 c3 in
lemma_carry5_simplify c0 c1 c2 c3 c4 tmp0 tmp1 tmp2 tmp... | false |
Hacl.Spec.Curve25519.Field51.fst | Hacl.Spec.Curve25519.Field51.fsqr_felem5 | val fsqr_felem5:
f:felem5{felem_fits5 f (9, 10, 9, 9, 9)}
-> Pure felem_wide5
(requires True)
(ensures fun out ->
felem_wide_fits5 out (6579, 4797, 3340, 1881, 423) /\
feval_wide out == fmul (feval f) (feval f)) | val fsqr_felem5:
f:felem5{felem_fits5 f (9, 10, 9, 9, 9)}
-> Pure felem_wide5
(requires True)
(ensures fun out ->
felem_wide_fits5 out (6579, 4797, 3340, 1881, 423) /\
feval_wide out == fmul (feval f) (feval f)) | let fsqr_felem5 (f0, f1, f2, f3, f4) =
assert_norm (pow2 13 = 8192);
let d0 = u64 2 *! f0 in
let d1 = u64 2 *! f1 in
let d2 = u64 38 *! f2 in
let d3 = u64 19 *! f3 in
let d419 = u64 19 *! f4 in
let d4 = u64 2 *! d419 in
let s0 = mul64_wide_add3 #9 #9 #342 #10 #342 #9 f0 f0 d4 f1 d2 f3 in
let s1 = mul... | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 407,
"start_col": 0,
"start_line": 391
} | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
f:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 f (9, 10, 9, 9, 9)}
-> Prims.Pure Hacl.Spec.Curve25519.Field51.Definition.felem_wide5 | Prims.Pure | [] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.felem5",
"Hacl.Spec.Curve25519.Field51.Definition.felem_fits5",
"FStar.Pervasives.Native.Mktuple5",
"Prims.nat",
"Lib.IntTypes.uint64",
"Lib.IntTypes.uint128",
"Prims.unit",
"Hacl.Spec.Curve25519.Field51.Lemmas.lemma_fmul_fsqr5",
"Lib.IntTypes.int_t",
"Lib.... | [] | false | false | false | false | false | let fsqr_felem5 (f0, f1, f2, f3, f4) =
| assert_norm (pow2 13 = 8192);
let d0 = u64 2 *! f0 in
let d1 = u64 2 *! f1 in
let d2 = u64 38 *! f2 in
let d3 = u64 19 *! f3 in
let d419 = u64 19 *! f4 in
let d4 = u64 2 *! d419 in
let s0 = mul64_wide_add3 #9 #9 #342 #10 #342 #9 f0 f0 d4 f1 d2 f3 in
let s1 = mul64_wide_add3 #18 #10 #342 #9 #171 #9 d0 f1 d4 f2 d3 f3 in
... | false |
Vale.AES.GF128.fsti | Vale.AES.GF128.mod_rev | val mod_rev (n: pos) (a b: poly) : poly | val mod_rev (n: pos) (a b: poly) : poly | let mod_rev (n:pos) (a b:poly) : poly =
reverse (reverse a (n + n - 1) %. b) (n - 1) | {
"file_name": "vale/code/crypto/aes/Vale.AES.GF128.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 46,
"end_line": 181,
"start_col": 0,
"start_line": 180
} | module Vale.AES.GF128
open FStar.Seq
open FStar.Mul
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GF128_s
open Vale.Math.Poly2_s
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Lemmas
let quad32_shift_left_1 (q:quad32) : quad32 =
let l... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.TypesNative",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | n: Prims.pos -> a: Vale.Math.Poly2_s.poly -> b: Vale.Math.Poly2_s.poly -> Vale.Math.Poly2_s.poly | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"Vale.Math.Poly2_s.poly",
"Vale.Math.Poly2_s.reverse",
"Vale.Math.Poly2.op_Percent_Dot",
"Prims.op_Subtraction",
"Prims.op_Addition"
] | [] | false | false | false | true | false | let mod_rev (n: pos) (a b: poly) : poly =
| reverse (reverse a (n + n - 1) %. b) (n - 1) | false |
Hacl.Spec.Curve25519.Field51.fst | Hacl.Spec.Curve25519.Field51.store_felem5 | val store_felem5:
f:felem5{mul_inv_t f}
-> Pure (uint64 & uint64 & uint64 & uint64)
(requires True)
(ensures fun (o0, o1, o2, o3) ->
feval f == v o0 + v o1 * pow2 64 +
v o2 * pow2 64 * pow2 64 + v o3 * pow2 64 * pow2 64 * pow2 64) | val store_felem5:
f:felem5{mul_inv_t f}
-> Pure (uint64 & uint64 & uint64 & uint64)
(requires True)
(ensures fun (o0, o1, o2, o3) ->
feval f == v o0 + v o1 * pow2 64 +
v o2 * pow2 64 * pow2 64 + v o3 * pow2 64 * pow2 64 * pow2 64) | let store_felem5 (f0, f1, f2, f3, f4) =
let (f0, f1, f2, f3, f4) = carry_felem5_full (f0, f1, f2, f3, f4) in
let (f0, f1, f2, f3, f4) = subtract_p5 (f0, f1, f2, f3, f4) in
let o0 = f0 |. (f1 <<. 51ul) in
let o1 = (f1 >>. 13ul) |. (f2 <<. 38ul) in
let o2 = (f2 >>. 26ul) |. (f3 <<. 25ul) in
let o3 = (f3 >>. ... | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 18,
"end_line": 500,
"start_col": 0,
"start_line": 491
} | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 2,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f: Hacl.Spec.Curve25519.Field51.Definition.felem5{Hacl.Spec.Curve25519.Field51.mul_inv_t f}
-> Prims.Pure
(((Lib.IntTypes.uint64 * Lib.IntTypes.uint64) * Lib.IntTypes.uint64) * Lib.IntTypes.uint64) | Prims.Pure | [] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.felem5",
"Hacl.Spec.Curve25519.Field51.mul_inv_t",
"Lib.IntTypes.uint64",
"FStar.Pervasives.Native.Mktuple4",
"Prims.unit",
"Hacl.Spec.Curve25519.Field51.Lemmas.lemma_store_felem",
"FStar.Pervasives.Native.Mktuple5",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U64",
... | [] | false | false | false | false | false | let store_felem5 (f0, f1, f2, f3, f4) =
| let f0, f1, f2, f3, f4 = carry_felem5_full (f0, f1, f2, f3, f4) in
let f0, f1, f2, f3, f4 = subtract_p5 (f0, f1, f2, f3, f4) in
let o0 = f0 |. (f1 <<. 51ul) in
let o1 = (f1 >>. 13ul) |. (f2 <<. 38ul) in
let o2 = (f2 >>. 26ul) |. (f3 <<. 25ul) in
let o3 = (f3 >>. 39ul) |. (f4 <<. 12ul) in
lemma_store_felem (f0, f1, f2, ... | false |
Vale.AES.GF128.fsti | Vale.AES.GF128.shift_key_1 | val shift_key_1 (n: pos) (f h: poly) : poly | val shift_key_1 (n: pos) (f h: poly) : poly | let shift_key_1 (n:pos) (f h:poly) : poly =
let g = monomial n +. f in
let h1 = shift h 1 in
let offset = reverse (shift g (-1)) (n - 1) in
mask h1 n +. (if h1.[n] then offset else zero) | {
"file_name": "vale/code/crypto/aes/Vale.AES.GF128.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 48,
"end_line": 191,
"start_col": 0,
"start_line": 187
} | module Vale.AES.GF128
open FStar.Seq
open FStar.Mul
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GF128_s
open Vale.Math.Poly2_s
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Lemmas
let quad32_shift_left_1 (q:quad32) : quad32 =
let l... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.TypesNative",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | n: Prims.pos -> f: Vale.Math.Poly2_s.poly -> h: Vale.Math.Poly2_s.poly -> Vale.Math.Poly2_s.poly | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"Vale.Math.Poly2_s.poly",
"Vale.Math.Poly2.op_Plus_Dot",
"Vale.Math.Poly2.mask",
"Vale.Math.Poly2_s.op_String_Access",
"Prims.bool",
"Vale.Math.Poly2_s.zero",
"Vale.Math.Poly2_s.reverse",
"Vale.Math.Poly2_s.shift",
"Prims.op_Minus",
"Prims.op_Subtraction",
"Vale.Math.Poly2_s.monom... | [] | false | false | false | true | false | let shift_key_1 (n: pos) (f h: poly) : poly =
| let g = monomial n +. f in
let h1 = shift h 1 in
let offset = reverse (shift g (- 1)) (n - 1) in
mask h1 n +. (if h1.[ n ] then offset else zero) | false |
Hacl.K256.PrecompTable.fst | Hacl.K256.PrecompTable.precomp_g_pow2_128_table_w4 | val precomp_g_pow2_128_table_w4:
x:glbuffer uint64 240ul{witnessed x precomp_g_pow2_128_table_lseq_w4 /\ recallable x} | val precomp_g_pow2_128_table_w4:
x:glbuffer uint64 240ul{witnessed x precomp_g_pow2_128_table_lseq_w4 /\ recallable x} | let precomp_g_pow2_128_table_w4:
x:glbuffer uint64 240ul{witnessed x precomp_g_pow2_128_table_lseq_w4 /\ recallable x} =
createL_global precomp_g_pow2_128_table_list_w4 | {
"file_name": "code/k256/Hacl.K256.PrecompTable.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 49,
"end_line": 255,
"start_col": 0,
"start_line": 253
} | module Hacl.K256.PrecompTable
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module SPT = Hacl.Spec.PrecompBaseTable
module SPT256 = Hacl.Spec.Pr... | {
"checked_file": "/",
"dependencies": [
"Spec.K256.Lemmas.fsti.checked",
"Spec.K256.fst.checked",
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hac... | [
{
"abbrev": true,
"full_module": "Spec.K256.Lemmas",
"short_module": "SL"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.K256.PrecompTable",
"short_module": "SPTK"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.PrecompBaseTable256",
"short_module": "SPT256"
},
{
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x:
Lib.Buffer.glbuffer Lib.IntTypes.uint64 240ul
{ Lib.Buffer.witnessed x Hacl.K256.PrecompTable.precomp_g_pow2_128_table_lseq_w4 /\
Lib.Buffer.recallable x } | Prims.Tot | [
"total"
] | [] | [
"Lib.Buffer.createL_global",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U64",
"Lib.IntTypes.SEC",
"Hacl.K256.PrecompTable.precomp_g_pow2_128_table_list_w4",
"Lib.Buffer.glbuffer",
"Lib.IntTypes.size",
"FStar.Pervasives.normalize_term",
"Lib.IntTypes.size_nat",
"FStar.List.Tot.Base.length",
"Lib.IntType... | [] | false | false | false | false | false | let precomp_g_pow2_128_table_w4:x:
glbuffer uint64 240ul {witnessed x precomp_g_pow2_128_table_lseq_w4 /\ recallable x} =
| createL_global precomp_g_pow2_128_table_list_w4 | false |
Hacl.Curve25519_51.fst | Hacl.Curve25519_51.encode_point | val encode_point : Hacl.Meta.Curve25519.generic_encode_point_higher_t Prims.l_True | let encode_point = generic_encode_point_higher #M51 True C.store_felem C.fmul finv | {
"file_name": "code/curve25519/Hacl.Curve25519_51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 82,
"end_line": 21,
"start_col": 0,
"start_line": 21
} | module Hacl.Curve25519_51
friend Hacl.Meta.Curve25519
open Hacl.Meta.Curve25519
// The Hacl core.
module C = Hacl.Impl.Curve25519.Field51
let g25519: g25519_t =
Lib.Buffer.createL_global Spec.Curve25519.basepoint_list
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
let point_add_and_double =
addanddoub... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Meta.Curve25519.fst.checked",
"Hacl.Impl.Curve25519.Field51.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Hacl.Curve2... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Curve25519.Field51",
"short_module": "C"
},
{
"abbrev": false,
"full_module": "Hacl.Meta.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Curve25519.Fields",
"short_module": null
},
{
"ab... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Meta.Curve25519.generic_encode_point_higher_t Prims.l_True | Prims.Tot | [
"total"
] | [] | [
"Hacl.Meta.Curve25519.generic_encode_point_higher",
"Hacl.Impl.Curve25519.Fields.Core.M51",
"Prims.l_True",
"Hacl.Impl.Curve25519.Field51.store_felem",
"Hacl.Impl.Curve25519.Field51.fmul",
"Hacl.Curve25519_51.finv"
] | [] | false | false | false | true | false | let encode_point =
| generic_encode_point_higher #M51 True C.store_felem C.fmul finv | false | |
Hacl.Impl.Frodo.KEM.Encaps.fst | Hacl.Impl.Frodo.KEM.Encaps.crypto_kem_enc_ct_pack_c1 | val crypto_kem_enc_ct_pack_c1:
a:FP.frodo_alg
-> gen_a:FP.frodo_gen_a{is_supported gen_a}
-> seed_a:lbytes bytes_seed_a
-> sp_matrix:matrix_t params_nbar (params_n a)
-> ep_matrix:matrix_t params_nbar (params_n a)
-> c1:lbytes (ct1bytes_len a)
-> Stack unit
(requires fun h ->
live h seed_a /\ ... | val crypto_kem_enc_ct_pack_c1:
a:FP.frodo_alg
-> gen_a:FP.frodo_gen_a{is_supported gen_a}
-> seed_a:lbytes bytes_seed_a
-> sp_matrix:matrix_t params_nbar (params_n a)
-> ep_matrix:matrix_t params_nbar (params_n a)
-> c1:lbytes (ct1bytes_len a)
-> Stack unit
(requires fun h ->
live h seed_a /\ ... | let crypto_kem_enc_ct_pack_c1 a gen_a seed_a sp_matrix ep_matrix c1 =
push_frame ();
let bp_matrix = matrix_create params_nbar (params_n a) in
frodo_mul_add_sa_plus_e a gen_a seed_a sp_matrix ep_matrix bp_matrix;
frodo_pack (params_logq a) bp_matrix c1;
pop_frame () | {
"file_name": "code/frodo/Hacl.Impl.Frodo.KEM.Encaps.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 14,
"end_line": 77,
"start_col": 0,
"start_line": 72
} | module Hacl.Impl.Frodo.KEM.Encaps
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open LowStar.Buffer
open Lib.IntTypes
open Lib.Buffer
open Hacl.Impl.Matrix
open Hacl.Impl.Frodo.Params
open Hacl.Impl.Frodo.KEM
open Hacl.Impl.Frodo.Encode
open Hacl.Impl.Frodo.Pack
open Hacl.Impl.Frodo.Sample
open Hacl... | {
"checked_file": "/",
"dependencies": [
"Spec.Matrix.fst.checked",
"Spec.Frodo.Params.fst.checked",
"Spec.Frodo.KEM.Encaps.fst.checked",
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Frodo.KEM.KeyGen",
"short_module": "KG"
},
{
"abbrev": true,
"full_module": "Spec.Matrix",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.KEM.Encaps",
"short_module": "S"
},
{
"abbrev": true,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
a: Spec.Frodo.Params.frodo_alg ->
gen_a: Spec.Frodo.Params.frodo_gen_a{Hacl.Impl.Frodo.Params.is_supported gen_a} ->
seed_a: Hacl.Impl.Matrix.lbytes Hacl.Impl.Frodo.Params.bytes_seed_a ->
sp_matrix:
Hacl.Impl.Matrix.matrix_t Hacl.Impl.Frodo.Params.params_nbar
(Hacl.Impl.Frodo.Params.param... | FStar.HyperStack.ST.Stack | [] | [] | [
"Spec.Frodo.Params.frodo_alg",
"Spec.Frodo.Params.frodo_gen_a",
"Prims.b2t",
"Hacl.Impl.Frodo.Params.is_supported",
"Hacl.Impl.Matrix.lbytes",
"Hacl.Impl.Frodo.Params.bytes_seed_a",
"Hacl.Impl.Matrix.matrix_t",
"Hacl.Impl.Frodo.Params.params_nbar",
"Hacl.Impl.Frodo.Params.params_n",
"Hacl.Impl.Fro... | [] | false | true | false | false | false | let crypto_kem_enc_ct_pack_c1 a gen_a seed_a sp_matrix ep_matrix c1 =
| push_frame ();
let bp_matrix = matrix_create params_nbar (params_n a) in
frodo_mul_add_sa_plus_e a gen_a seed_a sp_matrix ep_matrix bp_matrix;
frodo_pack (params_logq a) bp_matrix c1;
pop_frame () | false |
EverParse3d.InputStream.Extern.Type.fst | EverParse3d.InputStream.Extern.Type.make_input_buffer_with_length | val make_input_buffer_with_length
(base: t)
(position: B.pointer (Ghost.erased LPE.pos_t))
(length: LPE.pos_t)
: HST.Stack input_buffer
(requires
(fun h ->
B.loc_disjoint (footprint base) (B.loc_buffer position) /\ B.live h position /\
U64.v length <= U64.v (l... | val make_input_buffer_with_length
(base: t)
(position: B.pointer (Ghost.erased LPE.pos_t))
(length: LPE.pos_t)
: HST.Stack input_buffer
(requires
(fun h ->
B.loc_disjoint (footprint base) (B.loc_buffer position) /\ B.live h position /\
U64.v length <= U64.v (l... | let make_input_buffer_with_length
(base: t)
(position: B.pointer (Ghost.erased LPE.pos_t))
(length: LPE.pos_t)
: HST.Stack input_buffer
(requires (fun h ->
B.loc_disjoint (footprint base) (B.loc_buffer position) /\
B.live h position /\
U64.v length <= U64.v (len_all base)
))
(ensures (fun h _ h'... | {
"file_name": "src/3d/prelude/extern/EverParse3d.InputStream.Extern.Type.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 3,
"end_line": 66,
"start_col": 0,
"start_line": 46
} | module EverParse3d.InputStream.Extern.Type
include EverParse3d.InputStream.Extern.Base
module B = LowStar.Buffer
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module LPE = EverParse3d.ErrorCode
module U64 = FStar.UInt64
noeq
type input_buffer = {
bas... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.HyperStack.ST.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "EverParse3d.ErrorCode",
"short_module": "LPE"
},
{
"abbrev": true,
"full_... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
base: EverParse3d.InputStream.Extern.Base.t ->
position: LowStar.Buffer.pointer (FStar.Ghost.erased EverParse3d.ErrorCode.pos_t) ->
length: EverParse3d.ErrorCode.pos_t
-> FStar.HyperStack.ST.Stack EverParse3d.InputStream.Extern.Type.input_buffer | FStar.HyperStack.ST.Stack | [] | [] | [
"EverParse3d.InputStream.Extern.Base.t",
"LowStar.Buffer.pointer",
"FStar.Ghost.erased",
"EverParse3d.ErrorCode.pos_t",
"EverParse3d.InputStream.Extern.Type.Mkinput_buffer",
"EverParse3d.InputStream.Extern.Type.input_buffer",
"Prims.unit",
"LowStar.BufferOps.op_Star_Equals",
"LowStar.Buffer.trivial_... | [] | false | true | false | false | false | let make_input_buffer_with_length
(base: t)
(position: B.pointer (Ghost.erased LPE.pos_t))
(length: LPE.pos_t)
: HST.Stack input_buffer
(requires
(fun h ->
B.loc_disjoint (footprint base) (B.loc_buffer position) /\ B.live h position /\
U64.v length <= U64.v (l... | position *= 0uL;
{ base = base; has_length = true; length = length; position = position; prf = () } | false |
EverParse3d.InputStream.Extern.Type.fst | EverParse3d.InputStream.Extern.Type.default_error_handler | val default_error_handler
(typename_s fieldname reason: string)
(error_code: U64.t)
(context: B.pointer LPE.error_frame)
(input: input_buffer)
(start_pos: U64.t)
: HST.Stack unit
(requires (fun h -> B.live h context))
(ensures (fun h _ h' -> B.modifies (B.loc_buffer context... | val default_error_handler
(typename_s fieldname reason: string)
(error_code: U64.t)
(context: B.pointer LPE.error_frame)
(input: input_buffer)
(start_pos: U64.t)
: HST.Stack unit
(requires (fun h -> B.live h context))
(ensures (fun h _ h' -> B.modifies (B.loc_buffer context... | let default_error_handler
(typename_s: string)
(fieldname: string)
(reason: string)
(error_code: U64.t)
(context: B.pointer LPE.error_frame)
(input: input_buffer)
(start_pos: U64.t)
: HST.Stack unit
(requires (fun h -> B.live h context))
(ensures (fun h _ h' -> B.modifies (B.loc_buffer context) h h'))... | {
"file_name": "src/3d/prelude/extern/EverParse3d.InputStream.Extern.Type.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 5,
"end_line": 89,
"start_col": 0,
"start_line": 68
} | module EverParse3d.InputStream.Extern.Type
include EverParse3d.InputStream.Extern.Base
module B = LowStar.Buffer
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module LPE = EverParse3d.ErrorCode
module U64 = FStar.UInt64
noeq
type input_buffer = {
bas... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.HyperStack.ST.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "EverParse3d.ErrorCode",
"short_module": "LPE"
},
{
"abbrev": true,
"full_... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
typename_s: Prims.string ->
fieldname: Prims.string ->
reason: Prims.string ->
error_code: FStar.UInt64.t ->
context: LowStar.Buffer.pointer EverParse3d.ErrorCode.error_frame ->
input: EverParse3d.InputStream.Extern.Type.input_buffer ->
start_pos: FStar.UInt64.t
-> FStar.HyperStack.ST.Sta... | FStar.HyperStack.ST.Stack | [] | [] | [
"Prims.string",
"FStar.UInt64.t",
"LowStar.Buffer.pointer",
"EverParse3d.ErrorCode.error_frame",
"EverParse3d.InputStream.Extern.Type.input_buffer",
"LowStar.BufferOps.op_Star_Equals",
"LowStar.Buffer.trivial_preorder",
"EverParse3d.ErrorCode.Mkerror_frame",
"Prims.unit",
"Prims.bool",
"Prims.op... | [] | false | true | false | false | false | let default_error_handler
(typename_s fieldname reason: string)
(error_code: U64.t)
(context: B.pointer LPE.error_frame)
(input: input_buffer)
(start_pos: U64.t)
: HST.Stack unit
(requires (fun h -> B.live h context))
(ensures (fun h _ h' -> B.modifies (B.loc_buffer context... | if not (!*context).LPE.filled
then
context *=
{
LPE.filled = true;
LPE.start_pos = start_pos;
LPE.typename_s = typename_s;
LPE.fieldname = fieldname;
LPE.reason = reason;
LPE.error_code = error_code
} | false |
Hacl.Curve25519_51.fst | Hacl.Curve25519_51.g25519 | val g25519:g25519_t | val g25519:g25519_t | let g25519: g25519_t =
Lib.Buffer.createL_global Spec.Curve25519.basepoint_list | {
"file_name": "code/curve25519/Hacl.Curve25519_51.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 58,
"end_line": 10,
"start_col": 0,
"start_line": 9
} | module Hacl.Curve25519_51
friend Hacl.Meta.Curve25519
open Hacl.Meta.Curve25519
// The Hacl core.
module C = Hacl.Impl.Curve25519.Field51 | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Meta.Curve25519.fst.checked",
"Hacl.Impl.Curve25519.Field51.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Hacl.Curve2... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Curve25519.Field51",
"short_module": "C"
},
{
"abbrev": false,
"full_module": "Hacl.Meta.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Curve25519.Fields",
"short_module": null
},
{
"ab... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Impl.Curve25519.Generic.g25519_t | Prims.Tot | [
"total"
] | [] | [
"Lib.Buffer.createL_global",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.PUB",
"Spec.Curve25519.basepoint_list",
"Lib.Buffer.glbuffer",
"Lib.IntTypes.size",
"FStar.Pervasives.normalize_term",
"Lib.IntTypes.size_nat",
"FStar.List.Tot.Base.length"
] | [] | false | false | false | true | false | let g25519:g25519_t =
| Lib.Buffer.createL_global Spec.Curve25519.basepoint_list | false |
EverParse3d.InputStream.Extern.Type.fst | EverParse3d.InputStream.Extern.Type.make_input_buffer | val make_input_buffer (base: t) (position: B.pointer (Ghost.erased LPE.pos_t))
: HST.Stack input_buffer
(requires
(fun h -> B.loc_disjoint (footprint base) (B.loc_buffer position) /\ B.live h position))
(ensures (fun h _ h' -> B.modifies (B.loc_buffer position) h h')) | val make_input_buffer (base: t) (position: B.pointer (Ghost.erased LPE.pos_t))
: HST.Stack input_buffer
(requires
(fun h -> B.loc_disjoint (footprint base) (B.loc_buffer position) /\ B.live h position))
(ensures (fun h _ h' -> B.modifies (B.loc_buffer position) h h')) | let make_input_buffer
(base: t)
(position: B.pointer (Ghost.erased LPE.pos_t))
: HST.Stack input_buffer
(requires (fun h ->
B.loc_disjoint (footprint base) (B.loc_buffer position) /\
B.live h position
))
(ensures (fun h _ h' ->
B.modifies (B.loc_buffer position) h h'
))
= position *= 0uL;
{
... | {
"file_name": "src/3d/prelude/extern/EverParse3d.InputStream.Extern.Type.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 3,
"end_line": 44,
"start_col": 0,
"start_line": 26
} | module EverParse3d.InputStream.Extern.Type
include EverParse3d.InputStream.Extern.Base
module B = LowStar.Buffer
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module LPE = EverParse3d.ErrorCode
module U64 = FStar.UInt64
noeq
type input_buffer = {
bas... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.HyperStack.ST.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "EverParse3d.ErrorCode",
"short_module": "LPE"
},
{
"abbrev": true,
"full_... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
base: EverParse3d.InputStream.Extern.Base.t ->
position: LowStar.Buffer.pointer (FStar.Ghost.erased EverParse3d.ErrorCode.pos_t)
-> FStar.HyperStack.ST.Stack EverParse3d.InputStream.Extern.Type.input_buffer | FStar.HyperStack.ST.Stack | [] | [] | [
"EverParse3d.InputStream.Extern.Base.t",
"LowStar.Buffer.pointer",
"FStar.Ghost.erased",
"EverParse3d.ErrorCode.pos_t",
"EverParse3d.InputStream.Extern.Type.Mkinput_buffer",
"FStar.UInt64.__uint_to_t",
"EverParse3d.InputStream.Extern.Type.input_buffer",
"Prims.unit",
"LowStar.BufferOps.op_Star_Equal... | [] | false | true | false | false | false | let make_input_buffer (base: t) (position: B.pointer (Ghost.erased LPE.pos_t))
: HST.Stack input_buffer
(requires
(fun h -> B.loc_disjoint (footprint base) (B.loc_buffer position) /\ B.live h position))
(ensures (fun h _ h' -> B.modifies (B.loc_buffer position) h h')) =
| position *= 0uL;
{ base = base; has_length = false; length = 0uL; position = position; prf = () } | false |
Hacl.Impl.Frodo.KEM.Encaps.fst | Hacl.Impl.Frodo.KEM.Encaps.crypto_kem_enc_ct0 | val crypto_kem_enc_ct0:
a:FP.frodo_alg
-> gen_a:FP.frodo_gen_a{is_supported gen_a}
-> seed_a:lbytes bytes_seed_a
-> b:lbytes (publicmatrixbytes_len a)
-> mu:lbytes (bytes_mu a)
-> sp_matrix:matrix_t params_nbar (params_n a)
-> ep_matrix:matrix_t params_nbar (params_n a)
-> epp_matrix:matrix_t params_n... | val crypto_kem_enc_ct0:
a:FP.frodo_alg
-> gen_a:FP.frodo_gen_a{is_supported gen_a}
-> seed_a:lbytes bytes_seed_a
-> b:lbytes (publicmatrixbytes_len a)
-> mu:lbytes (bytes_mu a)
-> sp_matrix:matrix_t params_nbar (params_n a)
-> ep_matrix:matrix_t params_nbar (params_n a)
-> epp_matrix:matrix_t params_n... | let crypto_kem_enc_ct0 a gen_a seed_a b mu sp_matrix ep_matrix epp_matrix ct =
let c1 = sub ct 0ul (ct1bytes_len a) in
let c2 = sub ct (ct1bytes_len a) (ct2bytes_len a) in
let h0 = ST.get () in
crypto_kem_enc_ct_pack_c1 a gen_a seed_a sp_matrix ep_matrix c1;
let h1 = ST.get () in
crypto_kem_enc_ct_pack_c2 a... | {
"file_name": "code/frodo/Hacl.Impl.Frodo.KEM.Encaps.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 107,
"end_line": 225,
"start_col": 0,
"start_line": 212
} | module Hacl.Impl.Frodo.KEM.Encaps
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open LowStar.Buffer
open Lib.IntTypes
open Lib.Buffer
open Hacl.Impl.Matrix
open Hacl.Impl.Frodo.Params
open Hacl.Impl.Frodo.KEM
open Hacl.Impl.Frodo.Encode
open Hacl.Impl.Frodo.Pack
open Hacl.Impl.Frodo.Sample
open Hacl... | {
"checked_file": "/",
"dependencies": [
"Spec.Matrix.fst.checked",
"Spec.Frodo.Params.fst.checked",
"Spec.Frodo.KEM.Encaps.fst.checked",
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Frodo.KEM.KeyGen",
"short_module": "KG"
},
{
"abbrev": true,
"full_module": "Spec.Matrix",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.KEM.Encaps",
"short_module": "S"
},
{
"abbrev": true,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
a: Spec.Frodo.Params.frodo_alg ->
gen_a: Spec.Frodo.Params.frodo_gen_a{Hacl.Impl.Frodo.Params.is_supported gen_a} ->
seed_a: Hacl.Impl.Matrix.lbytes Hacl.Impl.Frodo.Params.bytes_seed_a ->
b: Hacl.Impl.Matrix.lbytes (Hacl.Impl.Frodo.Params.publicmatrixbytes_len a) ->
mu: Hacl.Impl.Matrix.lbytes (Hac... | FStar.HyperStack.ST.Stack | [] | [] | [
"Spec.Frodo.Params.frodo_alg",
"Spec.Frodo.Params.frodo_gen_a",
"Prims.b2t",
"Hacl.Impl.Frodo.Params.is_supported",
"Hacl.Impl.Matrix.lbytes",
"Hacl.Impl.Frodo.Params.bytes_seed_a",
"Hacl.Impl.Frodo.Params.publicmatrixbytes_len",
"Hacl.Impl.Frodo.Params.bytes_mu",
"Hacl.Impl.Matrix.matrix_t",
"Hac... | [] | false | true | false | false | false | let crypto_kem_enc_ct0 a gen_a seed_a b mu sp_matrix ep_matrix epp_matrix ct =
| let c1 = sub ct 0ul (ct1bytes_len a) in
let c2 = sub ct (ct1bytes_len a) (ct2bytes_len a) in
let h0 = ST.get () in
crypto_kem_enc_ct_pack_c1 a gen_a seed_a sp_matrix ep_matrix c1;
let h1 = ST.get () in
crypto_kem_enc_ct_pack_c2 a mu b sp_matrix epp_matrix c2;
let h2 = ST.get () in
LSeq.eq_intro (LSeq.sub (as_seq h2 ct)... | false |
Hacl.Impl.Frodo.KEM.Encaps.fst | Hacl.Impl.Frodo.KEM.Encaps.crypto_kem_enc_ct_pack_c2 | val crypto_kem_enc_ct_pack_c2:
a:FP.frodo_alg
-> mu:lbytes (bytes_mu a)
-> b:lbytes (publicmatrixbytes_len a)
-> sp_matrix:matrix_t params_nbar (params_n a)
-> epp_matrix:matrix_t params_nbar params_nbar
-> c2:lbytes (ct2bytes_len a)
-> Stack unit
(requires fun h ->
live h mu /\ live h b /\ li... | val crypto_kem_enc_ct_pack_c2:
a:FP.frodo_alg
-> mu:lbytes (bytes_mu a)
-> b:lbytes (publicmatrixbytes_len a)
-> sp_matrix:matrix_t params_nbar (params_n a)
-> epp_matrix:matrix_t params_nbar params_nbar
-> c2:lbytes (ct2bytes_len a)
-> Stack unit
(requires fun h ->
live h mu /\ live h b /\ li... | let crypto_kem_enc_ct_pack_c2 a mu b sp_matrix epp_matrix c2 =
push_frame ();
let v_matrix = matrix_create params_nbar params_nbar in
frodo_mul_add_sb_plus_e_plus_mu a mu b sp_matrix epp_matrix v_matrix;
frodo_pack (params_logq a) v_matrix c2;
clear_matrix v_matrix;
pop_frame () | {
"file_name": "code/frodo/Hacl.Impl.Frodo.KEM.Encaps.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 14,
"end_line": 157,
"start_col": 0,
"start_line": 151
} | module Hacl.Impl.Frodo.KEM.Encaps
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open LowStar.Buffer
open Lib.IntTypes
open Lib.Buffer
open Hacl.Impl.Matrix
open Hacl.Impl.Frodo.Params
open Hacl.Impl.Frodo.KEM
open Hacl.Impl.Frodo.Encode
open Hacl.Impl.Frodo.Pack
open Hacl.Impl.Frodo.Sample
open Hacl... | {
"checked_file": "/",
"dependencies": [
"Spec.Matrix.fst.checked",
"Spec.Frodo.Params.fst.checked",
"Spec.Frodo.KEM.Encaps.fst.checked",
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Frodo.KEM.KeyGen",
"short_module": "KG"
},
{
"abbrev": true,
"full_module": "Spec.Matrix",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.KEM.Encaps",
"short_module": "S"
},
{
"abbrev": true,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
a: Spec.Frodo.Params.frodo_alg ->
mu: Hacl.Impl.Matrix.lbytes (Hacl.Impl.Frodo.Params.bytes_mu a) ->
b: Hacl.Impl.Matrix.lbytes (Hacl.Impl.Frodo.Params.publicmatrixbytes_len a) ->
sp_matrix:
Hacl.Impl.Matrix.matrix_t Hacl.Impl.Frodo.Params.params_nbar
(Hacl.Impl.Frodo.Params.params_n a) -... | FStar.HyperStack.ST.Stack | [] | [] | [
"Spec.Frodo.Params.frodo_alg",
"Hacl.Impl.Matrix.lbytes",
"Hacl.Impl.Frodo.Params.bytes_mu",
"Hacl.Impl.Frodo.Params.publicmatrixbytes_len",
"Hacl.Impl.Matrix.matrix_t",
"Hacl.Impl.Frodo.Params.params_nbar",
"Hacl.Impl.Frodo.Params.params_n",
"Hacl.Impl.Frodo.Params.ct2bytes_len",
"FStar.HyperStack.... | [] | false | true | false | false | false | let crypto_kem_enc_ct_pack_c2 a mu b sp_matrix epp_matrix c2 =
| push_frame ();
let v_matrix = matrix_create params_nbar params_nbar in
frodo_mul_add_sb_plus_e_plus_mu a mu b sp_matrix epp_matrix v_matrix;
frodo_pack (params_logq a) v_matrix c2;
clear_matrix v_matrix;
pop_frame () | false |
Hacl.Impl.Ed25519.Ladder.fst | Hacl.Impl.Ed25519.Ladder.point_mul_g_double_vartime_noalloc | val point_mul_g_double_vartime_noalloc:
out:point
-> scalar1:lbuffer uint64 4ul -> q1:point
-> scalar2:lbuffer uint64 4ul -> q2:point
-> table2: lbuffer uint64 640ul ->
Stack unit
(requires fun h ->
live h out /\ live h scalar1 /\ live h q1 /\
live h scalar2 /\ live h q2 /\ live h table2 /\
e... | val point_mul_g_double_vartime_noalloc:
out:point
-> scalar1:lbuffer uint64 4ul -> q1:point
-> scalar2:lbuffer uint64 4ul -> q2:point
-> table2: lbuffer uint64 640ul ->
Stack unit
(requires fun h ->
live h out /\ live h scalar1 /\ live h q1 /\
live h scalar2 /\ live h q2 /\ live h table2 /\
e... | let point_mul_g_double_vartime_noalloc out scalar1 q1 scalar2 q2 table2 =
[@inline_let] let len = 20ul in
[@inline_let] let ctx_len = 0ul in
[@inline_let] let k = mk_ed25519_concrete_ops in
[@inline_let] let l = 5ul in
[@inline_let] let table_len = 32ul in
[@inline_let] let bLen = 4ul in
[@inline_let] let... | {
"file_name": "code/ed25519/Hacl.Impl.Ed25519.Ladder.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 63,
"end_line": 297,
"start_col": 0,
"start_line": 276
} | module Hacl.Impl.Ed25519.Ladder
module ST = FStar.HyperStack.ST
open FStar.HyperStack.All
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Hacl.Bignum25519
module F51 = Hacl.Impl.Ed25519.Field51
module BSeq = Lib.ByteSequence
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module BE = Hacl.Impl... | {
"checked_file": "/",
"dependencies": [
"Spec.Exponentiation.fsti.checked",
"Spec.Ed25519.Lemmas.fsti.checked",
"Spec.Ed25519.fst.checked",
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.ByteSequence.fsti.chec... | [
{
"abbrev": false,
"full_module": "Hacl.Ed25519.PrecompTable",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Ed25519.Group",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Ed25519.PointConstants",
"short_module": null
},
{
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
out: Hacl.Bignum25519.point ->
scalar1: Lib.Buffer.lbuffer Lib.IntTypes.uint64 4ul ->
q1: Hacl.Bignum25519.point ->
scalar2: Lib.Buffer.lbuffer Lib.IntTypes.uint64 4ul ->
q2: Hacl.Bignum25519.point ->
table2: Lib.Buffer.lbuffer Lib.IntTypes.uint64 640ul
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Bignum25519.point",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint64",
"FStar.UInt32.__uint_to_t",
"Hacl.Impl.MultiExponentiation.mk_lexp_double_fw_tables",
"Lib.IntTypes.U64",
"Hacl.Impl.Ed25519.Ladder.table_inv_w5",
"Hacl.Impl.Exponentiation.lprecomp_get_vartime",
"Lib.Buffer.null",
"Lib.Buffer.... | [] | false | true | false | false | false | let point_mul_g_double_vartime_noalloc out scalar1 q1 scalar2 q2 table2 =
| [@@ inline_let ]let len = 20ul in
[@@ inline_let ]let ctx_len = 0ul in
[@@ inline_let ]let k = mk_ed25519_concrete_ops in
[@@ inline_let ]let l = 5ul in
[@@ inline_let ]let table_len = 32ul in
[@@ inline_let ]let bLen = 4ul in
[@@ inline_let ]let bBits = 256ul in
assert_norm (pow2 (v l) == v table_len);
let h0 = ST.get... | false |
Hacl.Impl.Frodo.KEM.Encaps.fst | Hacl.Impl.Frodo.KEM.Encaps.crypto_kem_enc_ct | val crypto_kem_enc_ct:
a:FP.frodo_alg
-> gen_a:FP.frodo_gen_a{is_supported gen_a}
-> mu:lbytes (bytes_mu a)
-> pk:lbytes (crypto_publickeybytes a)
-> seed_se:lbytes (crypto_bytes a)
-> ct:lbytes (crypto_ciphertextbytes a)
-> Stack unit
(requires fun h ->
live h mu /\ live h pk /\ live h seed_s... | val crypto_kem_enc_ct:
a:FP.frodo_alg
-> gen_a:FP.frodo_gen_a{is_supported gen_a}
-> mu:lbytes (bytes_mu a)
-> pk:lbytes (crypto_publickeybytes a)
-> seed_se:lbytes (crypto_bytes a)
-> ct:lbytes (crypto_ciphertextbytes a)
-> Stack unit
(requires fun h ->
live h mu /\ live h pk /\ live h seed_s... | let crypto_kem_enc_ct a gen_a mu pk seed_se ct =
push_frame ();
let h0 = ST.get () in
FP.expand_crypto_publickeybytes a;
let seed_a = sub pk 0ul bytes_seed_a in
let b = sub pk bytes_seed_a (publicmatrixbytes_len a) in
let sp_matrix = matrix_create params_nbar (params_n a) in
let ep_matrix = matrix_create... | {
"file_name": "code/frodo/Hacl.Impl.Frodo.KEM.Encaps.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 14,
"end_line": 281,
"start_col": 0,
"start_line": 263
} | module Hacl.Impl.Frodo.KEM.Encaps
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open LowStar.Buffer
open Lib.IntTypes
open Lib.Buffer
open Hacl.Impl.Matrix
open Hacl.Impl.Frodo.Params
open Hacl.Impl.Frodo.KEM
open Hacl.Impl.Frodo.Encode
open Hacl.Impl.Frodo.Pack
open Hacl.Impl.Frodo.Sample
open Hacl... | {
"checked_file": "/",
"dependencies": [
"Spec.Matrix.fst.checked",
"Spec.Frodo.Params.fst.checked",
"Spec.Frodo.KEM.Encaps.fst.checked",
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Frodo.KEM.KeyGen",
"short_module": "KG"
},
{
"abbrev": true,
"full_module": "Spec.Matrix",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.KEM.Encaps",
"short_module": "S"
},
{
"abbrev": true,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
a: Spec.Frodo.Params.frodo_alg ->
gen_a: Spec.Frodo.Params.frodo_gen_a{Hacl.Impl.Frodo.Params.is_supported gen_a} ->
mu: Hacl.Impl.Matrix.lbytes (Hacl.Impl.Frodo.Params.bytes_mu a) ->
pk: Hacl.Impl.Matrix.lbytes (Hacl.Impl.Frodo.Params.crypto_publickeybytes a) ->
seed_se: Hacl.Impl.Matrix.lbytes (H... | FStar.HyperStack.ST.Stack | [] | [] | [
"Spec.Frodo.Params.frodo_alg",
"Spec.Frodo.Params.frodo_gen_a",
"Prims.b2t",
"Hacl.Impl.Frodo.Params.is_supported",
"Hacl.Impl.Matrix.lbytes",
"Hacl.Impl.Frodo.Params.bytes_mu",
"Hacl.Impl.Frodo.Params.crypto_publickeybytes",
"Hacl.Impl.Frodo.Params.crypto_bytes",
"Hacl.Impl.Frodo.Params.crypto_ciph... | [] | false | true | false | false | false | let crypto_kem_enc_ct a gen_a mu pk seed_se ct =
| push_frame ();
let h0 = ST.get () in
FP.expand_crypto_publickeybytes a;
let seed_a = sub pk 0ul bytes_seed_a in
let b = sub pk bytes_seed_a (publicmatrixbytes_len a) in
let sp_matrix = matrix_create params_nbar (params_n a) in
let ep_matrix = matrix_create params_nbar (params_n a) in
let epp_matrix = matrix_create para... | false |
Hacl.Spec.P256.Montgomery.fst | Hacl.Spec.P256.Montgomery.bn_qmont_reduction_lemma | val bn_qmont_reduction_lemma: x:LSeq.lseq uint64 8 -> n:LSeq.lseq uint64 4 -> Lemma
(requires BD.bn_v n = S.order /\ BD.bn_v x < S.order * S.order)
(ensures BD.bn_v (SBM.bn_mont_reduction n (u64 0xccd1c8aaee00bc4f) x) ==
BD.bn_v x * qmont_R_inv % S.order) | val bn_qmont_reduction_lemma: x:LSeq.lseq uint64 8 -> n:LSeq.lseq uint64 4 -> Lemma
(requires BD.bn_v n = S.order /\ BD.bn_v x < S.order * S.order)
(ensures BD.bn_v (SBM.bn_mont_reduction n (u64 0xccd1c8aaee00bc4f) x) ==
BD.bn_v x * qmont_R_inv % S.order) | let bn_qmont_reduction_lemma x n =
let k0 = 0xccd1c8aaee00bc4f in
lemma_order_mont ();
assert (SBM.bn_mont_pre n (u64 k0));
let d, _ = SBML.eea_pow2_odd 256 (BD.bn_v n) in
let res = SBM.bn_mont_reduction n (u64 k0) x in
assert_norm (S.order * S.order < S.order * pow2 256);
assert (BD.bn_v x < S.order * p... | {
"file_name": "code/ecdsap256/Hacl.Spec.P256.Montgomery.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 279,
"start_col": 0,
"start_line": 259
} | module Hacl.Spec.P256.Montgomery
open FStar.Mul
open Lib.IntTypes
module S = Spec.P256
module M = Lib.NatMod
module BD = Hacl.Spec.Bignum.Definitions
module SBM = Hacl.Spec.Bignum.Montgomery
module SBML = Hacl.Spec.Montgomery.Lemmas
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
/// Montgomery arithmetic for a b... | {
"checked_file": "/",
"dependencies": [
"Spec.P256.Lemmas.fsti.checked",
"Spec.P256.fst.checked",
"prims.fst.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Montgomery.fsti.checked",
"Hacl.Spec.Bignum.Def... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "SBML"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "SBM"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "BD"
},
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Lib.Sequence.lseq Lib.IntTypes.uint64 8 -> n: Lib.Sequence.lseq Lib.IntTypes.uint64 4
-> FStar.Pervasives.Lemma
(requires
Hacl.Spec.Bignum.Definitions.bn_v n = Spec.P256.PointOps.order /\
Hacl.Spec.Bignum.Definitions.bn_v x < Spec.P256.PointOps.order * Spec.P256.PointOps.order)
(ensures... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Lib.Sequence.lseq",
"Lib.IntTypes.uint64",
"Prims.int",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Prims.op_Modulus",
"FStar.Mul.op_Star",
"Hacl.Spec.Bignum.Definitions.bn_v",
"Lib.IntTypes.U64",
"Spec.P256.PointOps.order",
"Hacl.Spec.P256.Montgomery.qmont_R_inv",
"Prims.Cons",
"FStar.Preorder... | [] | false | false | true | false | false | let bn_qmont_reduction_lemma x n =
| let k0 = 0xccd1c8aaee00bc4f in
lemma_order_mont ();
assert (SBM.bn_mont_pre n (u64 k0));
let d, _ = SBML.eea_pow2_odd 256 (BD.bn_v n) in
let res = SBM.bn_mont_reduction n (u64 k0) x in
assert_norm (S.order * S.order < S.order * pow2 256);
assert (BD.bn_v x < S.order * pow2 256);
SBM.bn_mont_reduction_lemma n (u64 k0) x... | false |
Hacl.Spec.P256.Montgomery.fst | Hacl.Spec.P256.Montgomery.qmont_inv_mul_lemma | val qmont_inv_mul_lemma: s:S.qelem -> sinv:S.qelem -> b:S.qelem -> Lemma
(requires from_qmont sinv == S.qinv (from_qmont s)) // post-condition of qinv
(ensures S.qinv s * b % S.order == from_qmont (sinv * from_qmont b)) | val qmont_inv_mul_lemma: s:S.qelem -> sinv:S.qelem -> b:S.qelem -> Lemma
(requires from_qmont sinv == S.qinv (from_qmont s)) // post-condition of qinv
(ensures S.qinv s * b % S.order == from_qmont (sinv * from_qmont b)) | let qmont_inv_mul_lemma s sinv b =
let s_mont = from_qmont s in
let b_mont = from_qmont b in
calc (==) {
(sinv * b_mont * qmont_R_inv) % S.order;
(==) { lemma_from_to_qmont_id sinv }
(S.qinv s_mont * qmont_R % S.order * b_mont * qmont_R_inv) % S.order;
(==) { qmont_cancel_lemma1 (S.qinv s_mont) b_... | {
"file_name": "code/ecdsap256/Hacl.Spec.P256.Montgomery.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 351,
"start_col": 0,
"start_line": 338
} | module Hacl.Spec.P256.Montgomery
open FStar.Mul
open Lib.IntTypes
module S = Spec.P256
module M = Lib.NatMod
module BD = Hacl.Spec.Bignum.Definitions
module SBM = Hacl.Spec.Bignum.Montgomery
module SBML = Hacl.Spec.Montgomery.Lemmas
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
/// Montgomery arithmetic for a b... | {
"checked_file": "/",
"dependencies": [
"Spec.P256.Lemmas.fsti.checked",
"Spec.P256.fst.checked",
"prims.fst.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Montgomery.fsti.checked",
"Hacl.Spec.Bignum.Def... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "SBML"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "SBM"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "BD"
},
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: Spec.P256.PointOps.qelem -> sinv: Spec.P256.PointOps.qelem -> b: Spec.P256.PointOps.qelem
-> FStar.Pervasives.Lemma
(requires
Hacl.Spec.P256.Montgomery.from_qmont sinv ==
Spec.P256.PointOps.qinv (Hacl.Spec.P256.Montgomery.from_qmont s))
(ensures
Spec.P256.PointOps.qinv s * b % S... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Spec.P256.PointOps.qelem",
"FStar.Calc.calc_finish",
"Prims.int",
"Prims.eq2",
"Prims.op_Modulus",
"FStar.Mul.op_Star",
"Hacl.Spec.P256.Montgomery.qmont_R_inv",
"Spec.P256.PointOps.order",
"Spec.P256.PointOps.qinv",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FSta... | [] | false | false | true | false | false | let qmont_inv_mul_lemma s sinv b =
| let s_mont = from_qmont s in
let b_mont = from_qmont b in
calc ( == ) {
((sinv * b_mont) * qmont_R_inv) % S.order;
( == ) { lemma_from_to_qmont_id sinv }
(((S.qinv s_mont * qmont_R % S.order) * b_mont) * qmont_R_inv) % S.order;
( == ) { qmont_cancel_lemma1 (S.qinv s_mont) b_mont }
S.qinv s_mont * b_mont % S.o... | false |
LowParse.Spec.List.fst | LowParse.Spec.List.parse_list | val parse_list
(#k: parser_kind)
(#t: Type)
(p: parser k t)
: Tot (parser parse_list_kind (list t)) | val parse_list
(#k: parser_kind)
(#t: Type)
(p: parser k t)
: Tot (parser parse_list_kind (list t)) | let parse_list #k #t p =
parse_list_bare_injective p;
parse_list_bare_consumes_all p;
parser_kind_prop_equiv parse_list_kind (parse_list_bare p);
parse_list_bare p | {
"file_name": "src/lowparse/LowParse.Spec.List.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 19,
"end_line": 59,
"start_col": 0,
"start_line": 55
} | module LowParse.Spec.List
include LowParse.Spec.Combinators // for seq_slice_append_l
module Seq = FStar.Seq
module L = FStar.List.Tot
module U32 = FStar.UInt32
module Classical = FStar.Classical
(* Parse a list, until there is nothing left to read. This parser will mostly fail EXCEPT if the whole size is known and t... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.List.Tot.fst.c... | [
{
"abbrev": true,
"full_module": "FStar.Classical",
"short_module": "Classical"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: LowParse.Spec.Base.parser k t
-> LowParse.Spec.Base.parser LowParse.Spec.List.parse_list_kind (Prims.list t) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.List.parse_list_bare",
"Prims.unit",
"LowParse.Spec.Base.parser_kind_prop_equiv",
"Prims.list",
"LowParse.Spec.List.parse_list_kind",
"LowParse.Spec.List.parse_list_bare_consumes_all",
"LowParse.Spec.List.parse_list_bare_i... | [] | false | false | false | false | false | let parse_list #k #t p =
| parse_list_bare_injective p;
parse_list_bare_consumes_all p;
parser_kind_prop_equiv parse_list_kind (parse_list_bare p);
parse_list_bare p | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.wt | val wt (a: alg) : t: inttype{unsigned t} | val wt (a: alg) : t: inttype{unsigned t} | let wt (a:alg) : t:inttype{unsigned t} =
match a with
| Blake2S -> U32
| Blake2B -> U64 | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 18,
"end_line": 21,
"start_col": 0,
"start_line": 18
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = () | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.Blake2.Definitions.alg -> t: Lib.IntTypes.inttype{Lib.IntTypes.unsigned t} | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Lib.IntTypes.U32",
"Lib.IntTypes.U64",
"Lib.IntTypes.inttype",
"Prims.b2t",
"Lib.IntTypes.unsigned"
] | [] | false | false | false | false | false | let wt (a: alg) : t: inttype{unsigned t} =
| match a with
| Blake2S -> U32
| Blake2B -> U64 | false |
LowParse.Spec.List.fst | LowParse.Spec.List.tot_parse_list_aux | val tot_parse_list_aux (#k: parser_kind) (#t: Type) (p: tot_parser k t) (b: bytes)
: Pure (option (list t * (consumed_length b)))
(requires True)
(ensures (fun y -> y == parse_list_aux #k p b))
(decreases (Seq.length b)) | val tot_parse_list_aux (#k: parser_kind) (#t: Type) (p: tot_parser k t) (b: bytes)
: Pure (option (list t * (consumed_length b)))
(requires True)
(ensures (fun y -> y == parse_list_aux #k p b))
(decreases (Seq.length b)) | let rec tot_parse_list_aux
(#k: parser_kind)
(#t: Type)
(p: tot_parser k t)
(b: bytes)
: Pure (option (list t * (consumed_length b)))
(requires True)
(ensures (fun y -> y == parse_list_aux #k p b))
(decreases (Seq.length b))
= if Seq.length b = 0
then
Some ([], (0 <: consumed_length b))
els... | {
"file_name": "src/lowparse/LowParse.Spec.List.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 12,
"end_line": 127,
"start_col": 0,
"start_line": 106
} | module LowParse.Spec.List
include LowParse.Spec.Combinators // for seq_slice_append_l
module Seq = FStar.Seq
module L = FStar.List.Tot
module U32 = FStar.UInt32
module Classical = FStar.Classical
(* Parse a list, until there is nothing left to read. This parser will mostly fail EXCEPT if the whole size is known and t... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.List.Tot.fst.c... | [
{
"abbrev": true,
"full_module": "FStar.Classical",
"short_module": "Classical"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: LowParse.Spec.Base.tot_parser k t -> b: LowParse.Bytes.bytes
-> Prims.Pure
(FStar.Pervasives.Native.option (Prims.list t * LowParse.Spec.Base.consumed_length b)) | Prims.Pure | [
""
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.tot_parser",
"LowParse.Bytes.bytes",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"LowParse.Bytes.byte",
"FStar.Pervasives.Native.Some",
"FStar.Pervasives.Native.tuple2",
"Prims.list",
"LowParse.Spec.Base.consumed_length",
"FS... | [
"recursion"
] | false | false | false | false | false | let rec tot_parse_list_aux (#k: parser_kind) (#t: Type) (p: tot_parser k t) (b: bytes)
: Pure (option (list t * (consumed_length b)))
(requires True)
(ensures (fun y -> y == parse_list_aux #k p b))
(decreases (Seq.length b)) =
| if Seq.length b = 0
then Some ([], (0 <: consumed_length b))
else
match p b with
| None -> None
| Some (v, n) ->
if n = 0
then None
else
match tot_parse_list_aux p (Seq.slice b n (Seq.length b)) with
| Some (l, n') -> Some (v :: l, (n + n' <: consumed_length b))
| _ -> None | false |
LowParse.Spec.List.fst | LowParse.Spec.List.serialize_list | val serialize_list
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(s: serializer p)
: Pure (serializer (parse_list p))
(requires (
serialize_list_precond k
))
(ensures (fun _ -> True)) | val serialize_list
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(s: serializer p)
: Pure (serializer (parse_list p))
(requires (
serialize_list_precond k
))
(ensures (fun _ -> True)) | let serialize_list
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(s: serializer p)
: Pure (serializer (parse_list p))
(requires (
serialize_list_precond k
))
(ensures (fun _ -> True))
= bare_serialize_list_correct p s;
bare_serialize_list p s | {
"file_name": "src/lowparse/LowParse.Spec.List.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 25,
"end_line": 180,
"start_col": 0,
"start_line": 169
} | module LowParse.Spec.List
include LowParse.Spec.Combinators // for seq_slice_append_l
module Seq = FStar.Seq
module L = FStar.List.Tot
module U32 = FStar.UInt32
module Classical = FStar.Classical
(* Parse a list, until there is nothing left to read. This parser will mostly fail EXCEPT if the whole size is known and t... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.List.Tot.fst.c... | [
{
"abbrev": true,
"full_module": "FStar.Classical",
"short_module": "Classical"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: LowParse.Spec.Base.parser k t -> s: LowParse.Spec.Base.serializer p
-> Prims.Pure (LowParse.Spec.Base.serializer (LowParse.Spec.List.parse_list p)) | Prims.Pure | [] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"LowParse.Spec.List.bare_serialize_list",
"Prims.unit",
"LowParse.Spec.List.bare_serialize_list_correct",
"LowParse.Spec.List.parse_list_kind",
"Prims.list",
"LowParse.Spec.List.parse_list",
"Prims.b2t"... | [] | false | false | false | false | false | let serialize_list (#k: parser_kind) (#t: Type) (p: parser k t) (s: serializer p)
: Pure (serializer (parse_list p))
(requires (serialize_list_precond k))
(ensures (fun _ -> True)) =
| bare_serialize_list_correct p s;
bare_serialize_list p s | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.