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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Trees.fst | Trees.rotate_right | val rotate_right (#a: Type) (r: tree a) : option (tree a) | val rotate_right (#a: Type) (r: tree a) : option (tree a) | let rotate_right (#a: Type) (r: tree a) : option (tree a) =
match r with
| Node x (Node z t1 t2) t3 -> Some (Node z t1 (Node x t2 t3))
| _ -> None | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 13,
"end_line": 171,
"start_col": 0,
"start_line": 168
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: Trees.tree a -> FStar.Pervasives.Native.option (Trees.tree a) | Prims.Tot | [
"total"
] | [] | [
"Trees.tree",
"FStar.Pervasives.Native.Some",
"Trees.Node",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.option"
] | [] | false | false | false | true | false | let rotate_right (#a: Type) (r: tree a) : option (tree a) =
| match r with
| Node x (Node z t1 t2) t3 -> Some (Node z t1 (Node x t2 t3))
| _ -> None | false |
Trees.fst | Trees.bst_search | val bst_search (#a: Type) (cmp: cmp a) (x: bst a cmp) (key: a) : option a | val bst_search (#a: Type) (cmp: cmp a) (x: bst a cmp) (key: a) : option a | let rec bst_search (#a: Type) (cmp:cmp a) (x: bst a cmp) (key: a) : option a =
match x with
| Leaf -> None
| Node data left right ->
let delta = cmp data key in
if delta < 0 then bst_search cmp right key else
if delta > 0 then bst_search cmp left key else
Some data | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 13,
"end_line": 69,
"start_col": 0,
"start_line": 62
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"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 | cmp: Trees.cmp a -> x: Trees.bst a cmp -> key: a -> FStar.Pervasives.Native.option a | Prims.Tot | [
"total"
] | [] | [
"Trees.cmp",
"Trees.bst",
"FStar.Pervasives.Native.None",
"Trees.tree",
"Prims.op_LessThan",
"Trees.bst_search",
"Prims.bool",
"Prims.op_GreaterThan",
"FStar.Pervasives.Native.Some",
"FStar.Pervasives.Native.option",
"Prims.int"
] | [
"recursion"
] | false | false | false | false | false | let rec bst_search (#a: Type) (cmp: cmp a) (x: bst a cmp) (key: a) : option a =
| match x with
| Leaf -> None
| Node data left right ->
let delta = cmp data key in
if delta < 0
then bst_search cmp right key
else if delta > 0 then bst_search cmp left key else Some data | false |
Trees.fst | Trees.append_left | val append_left (#a: Type) (x: tree a) (v: a) : tree a | val append_left (#a: Type) (x: tree a) (v: a) : tree a | let rec append_left (#a: Type) (x: tree a) (v: a) : tree a =
match x with
| Leaf -> Node v Leaf Leaf
| Node x left right -> Node x (append_left left v) right | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 58,
"end_line": 85,
"start_col": 0,
"start_line": 82
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Trees.tree a -> v: a -> Trees.tree a | Prims.Tot | [
"total"
] | [] | [
"Trees.tree",
"Trees.Node",
"Trees.Leaf",
"Trees.append_left"
] | [
"recursion"
] | false | false | false | true | false | let rec append_left (#a: Type) (x: tree a) (v: a) : tree a =
| match x with
| Leaf -> Node v Leaf Leaf
| Node x left right -> Node x (append_left left v) right | false |
Trees.fst | Trees.rotate_left | val rotate_left (#a: Type) (r: tree a) : option (tree a) | val rotate_left (#a: Type) (r: tree a) : option (tree a) | let rotate_left (#a: Type) (r: tree a) : option (tree a) =
match r with
| Node x t1 (Node z t2 t3) -> Some (Node z (Node x t1 t2) t3)
| _ -> None | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 13,
"end_line": 166,
"start_col": 0,
"start_line": 163
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: Trees.tree a -> FStar.Pervasives.Native.option (Trees.tree a) | Prims.Tot | [
"total"
] | [] | [
"Trees.tree",
"FStar.Pervasives.Native.Some",
"Trees.Node",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.option"
] | [] | false | false | false | true | false | let rotate_left (#a: Type) (r: tree a) : option (tree a) =
| match r with
| Node x t1 (Node z t2 t3) -> Some (Node z (Node x t1 t2) t3)
| _ -> None | false |
TwoLockQueue.fst | TwoLockQueue.queue_invariant | val queue_invariant : head: TwoLockQueue.q_ptr a -> tail: TwoLockQueue.q_ptr a -> Steel.Effect.Common.vprop | let queue_invariant (#a:_) ([@@@smt_fallback]head:q_ptr a) ([@@@smt_fallback] tail:q_ptr a) =
h_exists (fun (h:Q.t a) ->
h_exists (fun (t:Q.t a) ->
ghost_pts_to head.ghost half h `star`
ghost_pts_to tail.ghost half t `star`
Q.queue h t)) | {
"file_name": "share/steel/examples/steel/TwoLockQueue.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 17,
"end_line": 113,
"start_col": 0,
"start_line": 108
} | module TwoLockQueue
open FStar.Ghost
open Steel.Memory
open Steel.Effect.Atomic
open Steel.Effect
open Steel.FractionalPermission
open Steel.Reference
open Steel.SpinLock
module L = FStar.List.Tot
module U = Steel.Utils
module Q = Queue
/// This module provides an implementation of Michael and Scott's two lock queue... | {
"checked_file": "/",
"dependencies": [
"Steel.Utils.fst.checked",
"Steel.SpinLock.fsti.checked",
"Steel.Reference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"Queue.fsti.check... | [
{
"abbrev": true,
"full_module": "Queue",
"short_module": "Q"
},
{
"abbrev": true,
"full_module": "Steel.Utils",
"short_module": "U"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Steel.SpinLock"... | {
"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 | head: TwoLockQueue.q_ptr a -> tail: TwoLockQueue.q_ptr a -> Steel.Effect.Common.vprop | Prims.Tot | [
"total"
] | [] | [
"TwoLockQueue.q_ptr",
"Steel.Effect.Atomic.h_exists",
"Queue.Def.t",
"Steel.Effect.Common.star",
"Steel.Reference.ghost_pts_to",
"TwoLockQueue.__proj__Mkq_ptr__item__ghost",
"TwoLockQueue.half",
"Queue.queue",
"Steel.Effect.Common.vprop"
] | [] | false | false | false | true | false | let queue_invariant (#a: _) ([@@@ smt_fallback]head [@@@ smt_fallback]tail: q_ptr a) =
| h_exists (fun (h: Q.t a) ->
h_exists (fun (t: Q.t a) ->
((ghost_pts_to head.ghost half h) `star` (ghost_pts_to tail.ghost half t))
`star`
(Q.queue h t))) | false | |
Trees.fst | Trees.insert_bst_preserves_forall_keys | val insert_bst_preserves_forall_keys
(#a: Type)
(cmp: cmp a)
(x: bst a cmp)
(key: a)
(cond: (a -> bool))
: Lemma (requires (forall_keys x cond /\ cond key))
(ensures (forall_keys (insert_bst cmp x key) cond)) | val insert_bst_preserves_forall_keys
(#a: Type)
(cmp: cmp a)
(x: bst a cmp)
(key: a)
(cond: (a -> bool))
: Lemma (requires (forall_keys x cond /\ cond key))
(ensures (forall_keys (insert_bst cmp x key) cond)) | let rec insert_bst_preserves_forall_keys
(#a: Type)
(cmp:cmp a)
(x: bst a cmp)
(key: a)
(cond: a -> bool)
: Lemma
(requires (forall_keys x cond /\ cond key))
(ensures (forall_keys (insert_bst cmp x key) cond))
=
match x with
| Leaf -> ()
| Node data left right ->
let delta = cmp da... | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 57,
"end_line": 127,
"start_col": 0,
"start_line": 110
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"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 | cmp: Trees.cmp a -> x: Trees.bst a cmp -> key: a -> cond: (_: a -> Prims.bool)
-> FStar.Pervasives.Lemma (requires Trees.forall_keys x cond /\ cond key)
(ensures Trees.forall_keys (Trees.insert_bst cmp x key) cond) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Trees.cmp",
"Trees.bst",
"Prims.bool",
"Trees.tree",
"Prims.op_GreaterThanOrEqual",
"Trees.insert_bst_preserves_forall_keys",
"Prims.unit",
"Prims.int",
"Prims.l_and",
"Prims.b2t",
"Trees.forall_keys",
"Prims.squash",
"Trees.insert_bst",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [
"recursion"
] | false | false | true | false | false | let rec insert_bst_preserves_forall_keys
(#a: Type)
(cmp: cmp a)
(x: bst a cmp)
(key: a)
(cond: (a -> bool))
: Lemma (requires (forall_keys x cond /\ cond key))
(ensures (forall_keys (insert_bst cmp x key) cond)) =
| match x with
| Leaf -> ()
| Node data left right ->
let delta = cmp data key in
if delta >= 0
then insert_bst_preserves_forall_keys cmp left key cond
else insert_bst_preserves_forall_keys cmp right key cond | false |
Trees.fst | Trees.height | val height (#a: Type) (x: tree a) : nat | val height (#a: Type) (x: tree a) : nat | let rec height (#a: Type) (x: tree a) : nat =
match x with
| Leaf -> 0
| Node data left right ->
if height left > height right then (height left) + 1
else (height right) + 1 | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 27,
"end_line": 78,
"start_col": 0,
"start_line": 73
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Trees.tree a -> Prims.nat | Prims.Tot | [
"total"
] | [] | [
"Trees.tree",
"Prims.op_GreaterThan",
"Trees.height",
"Prims.op_Addition",
"Prims.bool",
"Prims.nat"
] | [
"recursion"
] | false | false | false | true | false | let rec height (#a: Type) (x: tree a) : nat =
| match x with
| Leaf -> 0
| Node data left right ->
if height left > height right then (height left) + 1 else (height right) + 1 | false |
Trees.fst | Trees.insert_bst_preserves_bst | val insert_bst_preserves_bst (#a: Type) (cmp: cmp a) (x: bst a cmp) (key: a)
: Lemma (is_bst cmp (insert_bst cmp x key)) | val insert_bst_preserves_bst (#a: Type) (cmp: cmp a) (x: bst a cmp) (key: a)
: Lemma (is_bst cmp (insert_bst cmp x key)) | let rec insert_bst_preserves_bst
(#a: Type)
(cmp:cmp a)
(x: bst a cmp)
(key: a)
: Lemma(is_bst cmp (insert_bst cmp x key))
=
match x with
| Leaf -> ()
| Node data left right ->
let delta = cmp data key in
if delta >= 0 then begin
insert_bst_preserves_forall_keys cmp left key (key_left ... | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 7,
"end_line": 146,
"start_col": 0,
"start_line": 129
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"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 | cmp: Trees.cmp a -> x: Trees.bst a cmp -> key: a
-> FStar.Pervasives.Lemma (ensures Trees.is_bst cmp (Trees.insert_bst cmp x key)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Trees.cmp",
"Trees.bst",
"Trees.tree",
"Prims.op_GreaterThanOrEqual",
"Trees.insert_bst_preserves_bst",
"Prims.unit",
"Trees.insert_bst_preserves_forall_keys",
"Trees.key_left",
"Prims.bool",
"Trees.key_right",
"Prims.int",
"Prims.l_True",
"Prims.squash",
"Prims.b2t",
"Trees.is_bst",
... | [
"recursion"
] | false | false | true | false | false | let rec insert_bst_preserves_bst (#a: Type) (cmp: cmp a) (x: bst a cmp) (key: a)
: Lemma (is_bst cmp (insert_bst cmp x key)) =
| match x with
| Leaf -> ()
| Node data left right ->
let delta = cmp data key in
if delta >= 0
then
(insert_bst_preserves_forall_keys cmp left key (key_left cmp data);
insert_bst_preserves_bst cmp left key)
else
(insert_bst_preserves_forall_keys cmp right key (key_right cmp data);
insert_bst_... | false |
Trees.fst | Trees.rotate_right_left | val rotate_right_left (#a: Type) (r: tree a) : option (tree a) | val rotate_right_left (#a: Type) (r: tree a) : option (tree a) | let rotate_right_left (#a: Type) (r: tree a) : option (tree a) =
match r with
| Node x t1 (Node z (Node y t2 t3) t4) -> Some (Node y (Node x t1 t2) (Node z t3 t4))
| _ -> None | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 13,
"end_line": 176,
"start_col": 0,
"start_line": 173
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: Trees.tree a -> FStar.Pervasives.Native.option (Trees.tree a) | Prims.Tot | [
"total"
] | [] | [
"Trees.tree",
"FStar.Pervasives.Native.Some",
"Trees.Node",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.option"
] | [] | false | false | false | true | false | let rotate_right_left (#a: Type) (r: tree a) : option (tree a) =
| match r with
| Node x t1 (Node z (Node y t2 t3) t4) -> Some (Node y (Node x t1 t2) (Node z t3 t4))
| _ -> None | false |
Trees.fst | Trees.rotate_left_right | val rotate_left_right (#a: Type) (r: tree a) : option (tree a) | val rotate_left_right (#a: Type) (r: tree a) : option (tree a) | let rotate_left_right (#a: Type) (r: tree a) : option (tree a) =
match r with
| Node x (Node z t1 (Node y t2 t3)) t4 -> Some (Node y (Node z t1 t2) (Node x t3 t4))
| _ -> None | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 13,
"end_line": 181,
"start_col": 0,
"start_line": 178
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: Trees.tree a -> FStar.Pervasives.Native.option (Trees.tree a) | Prims.Tot | [
"total"
] | [] | [
"Trees.tree",
"FStar.Pervasives.Native.Some",
"Trees.Node",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.option"
] | [] | false | false | false | true | false | let rotate_left_right (#a: Type) (r: tree a) : option (tree a) =
| match r with
| Node x (Node z t1 (Node y t2 t3)) t4 -> Some (Node y (Node z t1 t2) (Node x t3 t4))
| _ -> None | false |
Trees.fst | Trees.append_right | val append_right (#a: Type) (x: tree a) (v: a) : tree a | val append_right (#a: Type) (x: tree a) (v: a) : tree a | let rec append_right (#a: Type) (x: tree a) (v: a) : tree a =
match x with
| Leaf -> Node v Leaf Leaf
| Node x left right -> Node x left (append_right right v) | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 59,
"end_line": 90,
"start_col": 0,
"start_line": 87
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Trees.tree a -> v: a -> Trees.tree a | Prims.Tot | [
"total"
] | [] | [
"Trees.tree",
"Trees.Node",
"Trees.Leaf",
"Trees.append_right"
] | [
"recursion"
] | false | false | false | true | false | let rec append_right (#a: Type) (x: tree a) (v: a) : tree a =
| match x with
| Leaf -> Node v Leaf Leaf
| Node x left right -> Node x left (append_right right v) | false |
Trees.fst | Trees.is_balanced | val is_balanced (#a: Type) (x: tree a) : bool | val is_balanced (#a: Type) (x: tree a) : bool | let rec is_balanced (#a: Type) (x: tree a) : bool =
match x with
| Leaf -> true
| Node data left right ->
M.abs(height right - height left) <= 1 &&
is_balanced(right) &&
is_balanced(left) | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 21,
"end_line": 156,
"start_col": 0,
"start_line": 150
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Trees.tree a -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Trees.tree",
"Prims.op_AmpAmp",
"Prims.op_LessThanOrEqual",
"FStar.Math.Lib.abs",
"Prims.op_Subtraction",
"Trees.height",
"Trees.is_balanced",
"Prims.bool"
] | [
"recursion"
] | false | false | false | true | false | let rec is_balanced (#a: Type) (x: tree a) : bool =
| match x with
| Leaf -> true
| Node data left right ->
M.abs (height right - height left) <= 1 && is_balanced (right) && is_balanced (left) | false |
Trees.fst | Trees.insert_bst | val insert_bst (#a: Type) (cmp: cmp a) (x: bst a cmp) (key: a) : tree a | val insert_bst (#a: Type) (cmp: cmp a) (x: bst a cmp) (key: a) : tree a | let rec insert_bst (#a: Type) (cmp:cmp a) (x: bst a cmp) (key: a) : tree a =
match x with
| Leaf -> Node key Leaf Leaf
| Node data left right ->
let delta = cmp data key in
if delta >= 0 then begin
let new_left = insert_bst cmp left key in
Node data new_left right
end else begin
let ... | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 7,
"end_line": 108,
"start_col": 0,
"start_line": 97
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"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 | cmp: Trees.cmp a -> x: Trees.bst a cmp -> key: a -> Trees.tree a | Prims.Tot | [
"total"
] | [] | [
"Trees.cmp",
"Trees.bst",
"Trees.Node",
"Trees.Leaf",
"Trees.tree",
"Prims.op_GreaterThanOrEqual",
"Trees.insert_bst",
"Prims.bool",
"Prims.int"
] | [
"recursion"
] | false | false | false | false | false | let rec insert_bst (#a: Type) (cmp: cmp a) (x: bst a cmp) (key: a) : tree a =
| match x with
| Leaf -> Node key Leaf Leaf
| Node data left right ->
let delta = cmp data key in
if delta >= 0
then
let new_left = insert_bst cmp left key in
Node data new_left right
else
let new_right = insert_bst cmp right key in
Node data left new_right | false |
Hacl.Impl.Chacha20.Vec.fst | Hacl.Impl.Chacha20.Vec.chacha20_constants | val chacha20_constants:
b:glbuffer size_t 4ul{recallable b /\ witnessed b Spec.Chacha20.chacha20_constants} | val chacha20_constants:
b:glbuffer size_t 4ul{recallable b /\ witnessed b Spec.Chacha20.chacha20_constants} | let chacha20_constants =
[@ inline_let]
let l = [Spec.c0;Spec.c1;Spec.c2;Spec.c3] in
assert_norm(List.Tot.length l == 4);
createL_global l | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Vec.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 18,
"end_line": 70,
"start_col": 0,
"start_line": 66
} | module Hacl.Impl.Chacha20.Vec
module ST = FStar.HyperStack.ST
open FStar.HyperStack
open FStar.HyperStack.All
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Lib.IntVector
open Hacl.Impl.Chacha20.Core32xN
module Spec = Hacl.Spec.Chacha20.Vec
module Chacha20Equiv = Hacl.Spec.Chacha20.Equiv
m... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"L... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loop"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Equiv",
"short_module": "Chacha20Equiv"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Vec",
"short_module": "Spec"
},
{
... | {
"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 | b:
Lib.Buffer.glbuffer Lib.IntTypes.size_t 4ul
{Lib.Buffer.recallable b /\ Lib.Buffer.witnessed b Spec.Chacha20.chacha20_constants} | Prims.Tot | [
"total"
] | [] | [
"Lib.Buffer.createL_global",
"Lib.IntTypes.size_t",
"Lib.Buffer.glbuffer",
"Lib.IntTypes.size",
"FStar.Pervasives.normalize_term",
"Lib.IntTypes.size_nat",
"FStar.List.Tot.Base.length",
"Prims.unit",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"Prims.int",
"FStar.UInt32.__uint_to_t",
"Prims... | [] | false | false | false | false | false | let chacha20_constants =
| [@@ inline_let ]let l = [Spec.c0; Spec.c1; Spec.c2; Spec.c3] in
assert_norm (List.Tot.length l == 4);
createL_global l | false |
Hacl.Spec.P256.Montgomery.fst | Hacl.Spec.P256.Montgomery.lemma_ecdsa_sign_s | val lemma_ecdsa_sign_s (k kinv r d_a m:S.qelem) : Lemma
(requires from_qmont kinv == to_qmont (S.qinv k))
(ensures (let s = (from_qmont m + from_qmont (r * d_a)) % S.order in
from_qmont (kinv * s) == S.qmul (S.qinv k) (S.qadd m (S.qmul r d_a)))) | val lemma_ecdsa_sign_s (k kinv r d_a m:S.qelem) : Lemma
(requires from_qmont kinv == to_qmont (S.qinv k))
(ensures (let s = (from_qmont m + from_qmont (r * d_a)) % S.order in
from_qmont (kinv * s) == S.qmul (S.qinv k) (S.qadd m (S.qmul r d_a)))) | let lemma_ecdsa_sign_s k kinv r d_a m =
let s = (from_qmont m + from_qmont (r * d_a)) % S.order in
calc (==) { // s =
(m * qmont_R_inv % S.order + (r * d_a * qmont_R_inv) % S.order) % S.order;
(==) { Math.Lemmas.lemma_mod_mul_distr_l (r * d_a) qmont_R_inv S.order }
(m * qmont_R_inv % S.order + (S.qmul r... | {
"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": 376,
"start_col": 0,
"start_line": 354
} | 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 |
k: Spec.P256.PointOps.qelem ->
kinv: Spec.P256.PointOps.qelem ->
r: Spec.P256.PointOps.qelem ->
d_a: Spec.P256.PointOps.qelem ->
m: Spec.P256.PointOps.qelem
-> FStar.Pervasives.Lemma
(requires
Hacl.Spec.P256.Montgomery.from_qmont kinv ==
Hacl.Spec.P256.Montgomery.to_qmont (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",
"Spec.P256.PointOps.qadd",
"Spec.P256.PointOps.qmul",
"Prims.Cons",
"FStar.... | [] | false | false | true | false | false | let lemma_ecdsa_sign_s k kinv r d_a m =
| let s = (from_qmont m + from_qmont (r * d_a)) % S.order in
calc ( == ) {
(m * qmont_R_inv % S.order + ((r * d_a) * qmont_R_inv) % S.order) % S.order;
( == ) { Math.Lemmas.lemma_mod_mul_distr_l (r * d_a) qmont_R_inv S.order }
(m * qmont_R_inv % S.order + (S.qmul r d_a * qmont_R_inv) % S.order) % S.order;
( == ) ... | false |
Spec.Hash.Lemmas.fst | Spec.Hash.Lemmas.update_multi_associative | val update_multi_associative (a: hash_alg{not (is_blake a)})
(h: words_state a)
(input1: bytes)
(input2: bytes):
Lemma
(requires
S.length input1 % block_length a == 0 /\
S.length input2 % block_length a == 0)
(ensures (
let input = S.append input1 input2 in
S.length input % block_length a ==... | val update_multi_associative (a: hash_alg{not (is_blake a)})
(h: words_state a)
(input1: bytes)
(input2: bytes):
Lemma
(requires
S.length input1 % block_length a == 0 /\
S.length input2 % block_length a == 0)
(ensures (
let input = S.append input1 input2 in
S.length input % block_length a ==... | let update_multi_associative (a: hash_alg{not (is_blake a)})
(h: words_state a)
(input1: bytes)
(input2: bytes):
Lemma
(requires
S.length input1 % block_length a == 0 /\
S.length input2 % block_length a == 0)
(ensures (
let input = S.append input1 input2 in
S.length input % block_length a ==... | {
"file_name": "specs/lemmas/Spec.Hash.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 94,
"end_line": 73,
"start_col": 0,
"start_line": 52
} | module Spec.Hash.Lemmas
module S = FStar.Seq
open Lib.IntTypes
open Spec.Agile.Hash
open Spec.Hash.Definitions
friend Spec.Agile.Hash
(** Lemmas about the behavior of update_multi / update_last *)
#push-options "--fuel 0 --ifuel 1 --z3rlimit 50"
let update_multi_zero a h =
match a with
| MD5 | SHA1 | SHA2_224... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA3.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.Blake2.fst.checked",
"Spec.Agile.Hash.fst.checked",
"Spec.Agile.Hash.fst.checked",
"prims.fst.checked",
"Lib.UpdateMulti.fst.checked",
"Lib.Sequence.Lemmas.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Agile.Hash",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": true,
"full_mo... | {
"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.Hash.Definitions.hash_alg{Prims.op_Negation (Spec.Hash.Definitions.is_blake a)} ->
h: Spec.Hash.Definitions.words_state a ->
input1: Spec.Hash.Definitions.bytes ->
input2: Spec.Hash.Definitions.bytes
-> FStar.Pervasives.Lemma
(requires
FStar.Seq.Base.length input1 % Spec.Hash.De... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Spec.Hash.Definitions.hash_alg",
"Prims.b2t",
"Prims.op_Negation",
"Spec.Hash.Definitions.is_blake",
"Spec.Hash.Definitions.words_state",
"Spec.Hash.Definitions.bytes",
"Lib.UpdateMulti.update_multi_associative",
"Spec.Hash.Definitions.block_length",
"Spec.Agile.Hash.update",
"Lib.Sequence.Lemmas... | [] | false | false | true | false | false | let update_multi_associative
(a: hash_alg{not (is_blake a)})
(h: words_state a)
(input1 input2: bytes)
: Lemma
(requires S.length input1 % block_length a == 0 /\ S.length input2 % block_length a == 0)
(ensures
(let input = S.append input1 input2 in
S.length input % bl... | match a with
| MD5
| SHA1
| SHA2_224
| SHA2_256
| SHA2_384
| SHA2_512 ->
Lib.UpdateMulti.update_multi_associative (block_length a)
(Spec.Agile.Hash.update a)
h
input1
input2
| SHA3_224
| SHA3_256
| SHA3_384
| SHA3_512
| Shake128
| Shake256 ->
let rateInBytes = rate a / 8 in
let f = Spec.SHA3.absor... | false |
Trees.fst | Trees.rotate_left_right_bst | val rotate_left_right_bst (#a: Type) (cmp: cmp a) (r: tree a)
: Lemma (requires is_bst cmp r /\ Some? (rotate_left_right r))
(ensures is_bst cmp (Some?.v (rotate_left_right r))) | val rotate_left_right_bst (#a: Type) (cmp: cmp a) (r: tree a)
: Lemma (requires is_bst cmp r /\ Some? (rotate_left_right r))
(ensures is_bst cmp (Some?.v (rotate_left_right r))) | let rotate_left_right_bst (#a:Type) (cmp:cmp a) (r:tree a)
: Lemma (requires is_bst cmp r /\ Some? (rotate_left_right r)) (ensures is_bst cmp (Some?.v (rotate_left_right r)))
= match r with
| Node x (Node z t1 (Node y t2 t3)) t4 ->
// Node y (Node z t1 t2) (Node x t3 t4)
assert (is_bst cmp (Node z t1 (Nod... | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 48,
"end_line": 250,
"start_col": 0,
"start_line": 230
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"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 | cmp: Trees.cmp a -> r: Trees.tree a
-> FStar.Pervasives.Lemma (requires Trees.is_bst cmp r /\ Some? (Trees.rotate_left_right r))
(ensures Trees.is_bst cmp (Some?.v (Trees.rotate_left_right r))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Trees.cmp",
"Trees.tree",
"Prims._assert",
"Prims.b2t",
"Trees.forall_keys",
"Trees.key_right",
"Prims.unit",
"Trees.forall_keys_trans",
"Trees.key_left",
"Trees.is_bst",
"Trees.Node",
"Prims.l_and",
"FStar.Pervasives.Native.uu___is_Some",
"Trees.rotate_left_right",
"Prims.squash",
"F... | [] | false | false | true | false | false | let rotate_left_right_bst (#a: Type) (cmp: cmp a) (r: tree a)
: Lemma (requires is_bst cmp r /\ Some? (rotate_left_right r))
(ensures is_bst cmp (Some?.v (rotate_left_right r))) =
| match r with
| Node x (Node z t1 (Node y t2 t3)) t4 ->
assert (is_bst cmp (Node z t1 (Node y t2 t3)));
assert (is_bst cmp (Node y t2 t3));
let left = Node z t1 t2 in
let right = Node x t3 t4 in
assert (is_bst cmp left);
assert (forall_keys (Node y t2 t3) (key_left cmp x));
assert (forall_keys t2 (key_left... | false |
Trees.fst | Trees.rotate_left_bst | val rotate_left_bst (#a: Type) (cmp: cmp a) (r: tree a)
: Lemma (requires is_bst cmp r /\ Some? (rotate_left r))
(ensures is_bst cmp (Some?.v (rotate_left r))) | val rotate_left_bst (#a: Type) (cmp: cmp a) (r: tree a)
: Lemma (requires is_bst cmp r /\ Some? (rotate_left r))
(ensures is_bst cmp (Some?.v (rotate_left r))) | let rotate_left_bst (#a:Type) (cmp:cmp a) (r:tree a)
: Lemma (requires is_bst cmp r /\ Some? (rotate_left r)) (ensures is_bst cmp (Some?.v (rotate_left r)))
= match r with
| Node x t1 (Node z t2 t3) ->
assert (is_bst cmp (Node z t2 t3));
assert (is_bst cmp (Node x t1 t2));
forall_keys_trans t1 (... | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 60,
"end_line": 198,
"start_col": 0,
"start_line": 192
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"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 | cmp: Trees.cmp a -> r: Trees.tree a
-> FStar.Pervasives.Lemma (requires Trees.is_bst cmp r /\ Some? (Trees.rotate_left r))
(ensures Trees.is_bst cmp (Some?.v (Trees.rotate_left r))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Trees.cmp",
"Trees.tree",
"Trees.forall_keys_trans",
"Trees.key_left",
"Prims.unit",
"Prims._assert",
"Prims.b2t",
"Trees.is_bst",
"Trees.Node",
"Prims.l_and",
"FStar.Pervasives.Native.uu___is_Some",
"Trees.rotate_left",
"Prims.squash",
"FStar.Pervasives.Native.__proj__Some__item__v",
"... | [] | false | false | true | false | false | let rotate_left_bst (#a: Type) (cmp: cmp a) (r: tree a)
: Lemma (requires is_bst cmp r /\ Some? (rotate_left r))
(ensures is_bst cmp (Some?.v (rotate_left r))) =
| match r with
| Node x t1 (Node z t2 t3) ->
assert (is_bst cmp (Node z t2 t3));
assert (is_bst cmp (Node x t1 t2));
forall_keys_trans t1 (key_left cmp x) (key_left cmp z) | false |
Trees.fst | Trees.rotate_right_left_bst | val rotate_right_left_bst (#a: Type) (cmp: cmp a) (r: tree a)
: Lemma (requires is_bst cmp r /\ Some? (rotate_right_left r))
(ensures is_bst cmp (Some?.v (rotate_right_left r))) | val rotate_right_left_bst (#a: Type) (cmp: cmp a) (r: tree a)
: Lemma (requires is_bst cmp r /\ Some? (rotate_right_left r))
(ensures is_bst cmp (Some?.v (rotate_right_left r))) | let rotate_right_left_bst (#a:Type) (cmp:cmp a) (r:tree a)
: Lemma (requires is_bst cmp r /\ Some? (rotate_right_left r)) (ensures is_bst cmp (Some?.v (rotate_right_left r)))
= match r with
| Node x t1 (Node z (Node y t2 t3) t4) ->
assert (is_bst cmp (Node z (Node y t2 t3) t4));
assert (is_bst cmp (Node y... | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 48,
"end_line": 227,
"start_col": 0,
"start_line": 208
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"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 | cmp: Trees.cmp a -> r: Trees.tree a
-> FStar.Pervasives.Lemma (requires Trees.is_bst cmp r /\ Some? (Trees.rotate_right_left r))
(ensures Trees.is_bst cmp (Some?.v (Trees.rotate_right_left r))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Trees.cmp",
"Trees.tree",
"Prims._assert",
"Prims.b2t",
"Trees.forall_keys",
"Trees.key_right",
"Prims.unit",
"Trees.forall_keys_trans",
"Trees.key_left",
"Trees.is_bst",
"Trees.Node",
"Prims.l_and",
"FStar.Pervasives.Native.uu___is_Some",
"Trees.rotate_right_left",
"Prims.squash",
"F... | [] | false | false | true | false | false | let rotate_right_left_bst (#a: Type) (cmp: cmp a) (r: tree a)
: Lemma (requires is_bst cmp r /\ Some? (rotate_right_left r))
(ensures is_bst cmp (Some?.v (rotate_right_left r))) =
| match r with
| Node x t1 (Node z (Node y t2 t3) t4) ->
assert (is_bst cmp (Node z (Node y t2 t3) t4));
assert (is_bst cmp (Node y t2 t3));
let left = Node x t1 t2 in
let right = Node z t3 t4 in
assert (forall_keys (Node y t2 t3) (key_right cmp x));
assert (forall_keys t2 (key_right cmp x));
assert (is_bst... | false |
Trees.fst | Trees.rotate_right_left_key_right | val rotate_right_left_key_right (#a: Type) (cmp: cmp a) (r: tree a) (root: a)
: Lemma (requires forall_keys r (key_right cmp root) /\ Some? (rotate_right_left r))
(ensures forall_keys (Some?.v (rotate_right_left r)) (key_right cmp root)) | val rotate_right_left_key_right (#a: Type) (cmp: cmp a) (r: tree a) (root: a)
: Lemma (requires forall_keys r (key_right cmp root) /\ Some? (rotate_right_left r))
(ensures forall_keys (Some?.v (rotate_right_left r)) (key_right cmp root)) | let rotate_right_left_key_right (#a:Type) (cmp:cmp a) (r:tree a) (root:a)
: Lemma (requires forall_keys r (key_right cmp root) /\ Some? (rotate_right_left r))
(ensures forall_keys (Some?.v (rotate_right_left r)) (key_right cmp root))
= match r with
| Node x t1 (Node z (Node y t2 t3) t4) ->
assert (... | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 51,
"end_line": 309,
"start_col": 0,
"start_line": 299
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"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 | cmp: Trees.cmp a -> r: Trees.tree a -> root: a
-> FStar.Pervasives.Lemma
(requires Trees.forall_keys r (Trees.key_right cmp root) /\ Some? (Trees.rotate_right_left r))
(ensures Trees.forall_keys (Some?.v (Trees.rotate_right_left r)) (Trees.key_right cmp root)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Trees.cmp",
"Trees.tree",
"Prims._assert",
"Prims.b2t",
"Trees.forall_keys",
"Trees.key_right",
"Prims.unit",
"Trees.Node",
"Prims.l_and",
"FStar.Pervasives.Native.uu___is_Some",
"Trees.rotate_right_left",
"Prims.squash",
"FStar.Pervasives.Native.__proj__Some__item__v",
"Prims.Nil",
"FS... | [] | false | false | true | false | false | let rotate_right_left_key_right (#a: Type) (cmp: cmp a) (r: tree a) (root: a)
: Lemma (requires forall_keys r (key_right cmp root) /\ Some? (rotate_right_left r))
(ensures forall_keys (Some?.v (rotate_right_left r)) (key_right cmp root)) =
| match r with
| Node x t1 (Node z (Node y t2 t3) t4) ->
assert (forall_keys (Node z (Node y t2 t3) t4) (key_right cmp root));
assert (forall_keys (Node y t2 t3) (key_right cmp root));
let left = Node x t1 t2 in
let right = Node z t3 t4 in
assert (forall_keys left (key_right cmp root));
assert (forall_keys ri... | false |
Trees.fst | Trees.rotate_left_key_left | val rotate_left_key_left (#a: Type) (cmp: cmp a) (r: tree a) (root: a)
: Lemma (requires forall_keys r (key_left cmp root) /\ Some? (rotate_left r))
(ensures forall_keys (Some?.v (rotate_left r)) (key_left cmp root)) | val rotate_left_key_left (#a: Type) (cmp: cmp a) (r: tree a) (root: a)
: Lemma (requires forall_keys r (key_left cmp root) /\ Some? (rotate_left r))
(ensures forall_keys (Some?.v (rotate_left r)) (key_left cmp root)) | let rotate_left_key_left (#a:Type) (cmp:cmp a) (r:tree a) (root:a)
: Lemma (requires forall_keys r (key_left cmp root) /\ Some? (rotate_left r))
(ensures forall_keys (Some?.v (rotate_left r)) (key_left cmp root))
= match r with
| Node x t1 (Node z t2 t3) ->
assert (forall_keys (Node z t2 t3) (key... | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 61,
"end_line": 260,
"start_col": 0,
"start_line": 254
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"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 | cmp: Trees.cmp a -> r: Trees.tree a -> root: a
-> FStar.Pervasives.Lemma
(requires Trees.forall_keys r (Trees.key_left cmp root) /\ Some? (Trees.rotate_left r))
(ensures Trees.forall_keys (Some?.v (Trees.rotate_left r)) (Trees.key_left cmp root)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Trees.cmp",
"Trees.tree",
"Prims._assert",
"Prims.b2t",
"Trees.forall_keys",
"Trees.Node",
"Trees.key_left",
"Prims.unit",
"Prims.l_and",
"FStar.Pervasives.Native.uu___is_Some",
"Trees.rotate_left",
"Prims.squash",
"FStar.Pervasives.Native.__proj__Some__item__v",
"Prims.Nil",
"FStar.Per... | [] | false | false | true | false | false | let rotate_left_key_left (#a: Type) (cmp: cmp a) (r: tree a) (root: a)
: Lemma (requires forall_keys r (key_left cmp root) /\ Some? (rotate_left r))
(ensures forall_keys (Some?.v (rotate_left r)) (key_left cmp root)) =
| match r with
| Node x t1 (Node z t2 t3) ->
assert (forall_keys (Node z t2 t3) (key_left cmp root));
assert (forall_keys (Node x t1 t2) (key_left cmp root)) | false |
Trees.fst | Trees.insert_avl | val insert_avl (#a: Type) (cmp: cmp a) (x: tree a) (key: a) : tree a | val insert_avl (#a: Type) (cmp: cmp a) (x: tree a) (key: a) : tree a | let rec insert_avl (#a: Type) (cmp:cmp a) (x: tree a) (key: a) : tree a =
match x with
| Leaf -> Node key Leaf Leaf
| Node data left right ->
let delta = cmp data key in
if delta >= 0 then (
let new_left = insert_avl cmp left key in
let tmp = Node data new_left right in
rebalance_avl tmp... | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 5,
"end_line": 504,
"start_col": 0,
"start_line": 491
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"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 | cmp: Trees.cmp a -> x: Trees.tree a -> key: a -> Trees.tree a | Prims.Tot | [
"total"
] | [] | [
"Trees.cmp",
"Trees.tree",
"Trees.Node",
"Trees.Leaf",
"Prims.op_GreaterThanOrEqual",
"Trees.rebalance_avl",
"Trees.insert_avl",
"Prims.bool",
"Prims.int"
] | [
"recursion"
] | false | false | false | true | false | let rec insert_avl (#a: Type) (cmp: cmp a) (x: tree a) (key: a) : tree a =
| match x with
| Leaf -> Node key Leaf Leaf
| Node data left right ->
let delta = cmp data key in
if delta >= 0
then
(let new_left = insert_avl cmp left key in
let tmp = Node data new_left right in
rebalance_avl tmp)
else
(let new_right = insert_avl cmp right key in
let tmp = Node data l... | false |
Trees.fst | Trees.insert_avl_proof | val insert_avl_proof (#a: Type) (cmp: cmp a) (x: avl a cmp) (key: a)
: Lemma (requires is_avl cmp x) (ensures is_avl cmp (insert_avl cmp x key)) | val insert_avl_proof (#a: Type) (cmp: cmp a) (x: avl a cmp) (key: a)
: Lemma (requires is_avl cmp x) (ensures is_avl cmp (insert_avl cmp x key)) | let insert_avl_proof (#a: Type) (cmp:cmp a) (x: avl a cmp) (key: a)
: Lemma (requires is_avl cmp x) (ensures is_avl cmp (insert_avl cmp x key))
= Classical.forall_intro (Classical.move_requires (insert_avl_proof_aux cmp x key)) | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 85,
"end_line": 549,
"start_col": 0,
"start_line": 547
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"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 | cmp: Trees.cmp a -> x: Trees.avl a cmp -> key: a
-> FStar.Pervasives.Lemma (requires Trees.is_avl cmp x)
(ensures Trees.is_avl cmp (Trees.insert_avl cmp x key)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Trees.cmp",
"Trees.avl",
"FStar.Classical.forall_intro",
"Prims.l_imp",
"Trees.is_avl",
"Prims.l_and",
"Trees.insert_avl",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Trees.height",
"Prims.op_Addition",
"Trees.forall_keys",
"Trees.key_left",
"Trees.key_right",
"FStar.Classical.move_requir... | [] | false | false | true | false | false | let insert_avl_proof (#a: Type) (cmp: cmp a) (x: avl a cmp) (key: a)
: Lemma (requires is_avl cmp x) (ensures is_avl cmp (insert_avl cmp x key)) =
| Classical.forall_intro (Classical.move_requires (insert_avl_proof_aux cmp x key)) | false |
Hacl.Impl.Chacha20.Vec.fst | Hacl.Impl.Chacha20.Vec.chacha20_encrypt_st | val chacha20_encrypt_st : w: Hacl.Impl.Chacha20.Core32xN.lanes -> Type0 | let chacha20_encrypt_st (w:lanes) =
len:size_t
-> out:lbuffer uint8 len
-> text:lbuffer uint8 len
-> key:lbuffer uint8 32ul
-> n:lbuffer uint8 12ul
-> ctr:size_t{v ctr + w <= max_size_t } ->
Stack unit
(requires fun h ->
live h key /\ live h n /\ live h text /\ live h out /\ eq_or_disjoint tex... | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Vec.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 115,
"end_line": 233,
"start_col": 0,
"start_line": 221
} | module Hacl.Impl.Chacha20.Vec
module ST = FStar.HyperStack.ST
open FStar.HyperStack
open FStar.HyperStack.All
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Lib.IntVector
open Hacl.Impl.Chacha20.Core32xN
module Spec = Hacl.Spec.Chacha20.Vec
module Chacha20Equiv = Hacl.Spec.Chacha20.Equiv
m... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"L... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loop"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Equiv",
"short_module": "Chacha20Equiv"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Vec",
"short_module": "Spec"
},
{
... | {
"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 | w: Hacl.Impl.Chacha20.Core32xN.lanes -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Chacha20.Core32xN.lanes",
"Lib.IntTypes.size_t",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"FStar.UInt32.__uint_to_t",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Lib.IntTypes.max_size_t",
"Prims.unit",... | [] | false | false | false | true | true | let chacha20_encrypt_st (w: lanes) =
|
len: size_t ->
out: lbuffer uint8 len ->
text: lbuffer uint8 len ->
key: lbuffer uint8 32ul ->
n: lbuffer uint8 12ul ->
ctr: size_t{v ctr + w <= max_size_t}
-> Stack unit
(requires
fun h -> live h key /\ live h n /\ live h text /\ live h out /\ eq_or_disjoint text out)
(en... | false | |
Trees.fst | Trees.rotate_right_key_right | val rotate_right_key_right (#a: Type) (cmp: cmp a) (r: tree a) (root: a)
: Lemma (requires forall_keys r (key_right cmp root) /\ Some? (rotate_right r))
(ensures forall_keys (Some?.v (rotate_right r)) (key_right cmp root)) | val rotate_right_key_right (#a: Type) (cmp: cmp a) (r: tree a) (root: a)
: Lemma (requires forall_keys r (key_right cmp root) /\ Some? (rotate_right r))
(ensures forall_keys (Some?.v (rotate_right r)) (key_right cmp root)) | let rotate_right_key_right (#a:Type) (cmp:cmp a) (r:tree a) (root:a)
: Lemma (requires forall_keys r (key_right cmp root) /\ Some? (rotate_right r))
(ensures forall_keys (Some?.v (rotate_right r)) (key_right cmp root))
= match r with
| Node x (Node z t1 t2) t3 ->
assert (forall_keys (Node z t1 t2... | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 62,
"end_line": 284,
"start_col": 0,
"start_line": 278
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"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 | cmp: Trees.cmp a -> r: Trees.tree a -> root: a
-> FStar.Pervasives.Lemma
(requires Trees.forall_keys r (Trees.key_right cmp root) /\ Some? (Trees.rotate_right r))
(ensures Trees.forall_keys (Some?.v (Trees.rotate_right r)) (Trees.key_right cmp root)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Trees.cmp",
"Trees.tree",
"Prims._assert",
"Prims.b2t",
"Trees.forall_keys",
"Trees.Node",
"Trees.key_right",
"Prims.unit",
"Prims.l_and",
"FStar.Pervasives.Native.uu___is_Some",
"Trees.rotate_right",
"Prims.squash",
"FStar.Pervasives.Native.__proj__Some__item__v",
"Prims.Nil",
"FStar.P... | [] | false | false | true | false | false | let rotate_right_key_right (#a: Type) (cmp: cmp a) (r: tree a) (root: a)
: Lemma (requires forall_keys r (key_right cmp root) /\ Some? (rotate_right r))
(ensures forall_keys (Some?.v (rotate_right r)) (key_right cmp root)) =
| match r with
| Node x (Node z t1 t2) t3 ->
assert (forall_keys (Node z t1 t2) (key_right cmp root));
assert (forall_keys (Node x t2 t3) (key_right cmp root)) | false |
Hacl.Impl.Chacha20.Vec.fst | Hacl.Impl.Chacha20.Vec.chacha20_decrypt | val chacha20_decrypt: #w:lanes -> chacha20_decrypt_st w | val chacha20_decrypt: #w:lanes -> chacha20_decrypt_st w | let chacha20_decrypt #w len out cipher key n ctr =
let h0 = ST.get () in
chacha20_decrypt_vec #w len out cipher key n ctr;
Chacha20Equiv.lemma_chacha20_vec_equiv #w (as_seq h0 key) (as_seq h0 n) (v ctr) (as_seq h0 cipher) | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Vec.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 100,
"end_line": 286,
"start_col": 0,
"start_line": 283
} | module Hacl.Impl.Chacha20.Vec
module ST = FStar.HyperStack.ST
open FStar.HyperStack
open FStar.HyperStack.All
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Lib.IntVector
open Hacl.Impl.Chacha20.Core32xN
module Spec = Hacl.Spec.Chacha20.Vec
module Chacha20Equiv = Hacl.Spec.Chacha20.Equiv
m... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"L... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loop"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Equiv",
"short_module": "Chacha20Equiv"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Vec",
"short_module": "Spec"
},
{
... | {
"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.Chacha20.Vec.chacha20_decrypt_st w | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Chacha20.Core32xN.lanes",
"Lib.IntTypes.size_t",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"FStar.UInt32.__uint_to_t",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Lib.IntTypes.max_size_t",
"Hacl.Spec.Ch... | [] | false | false | false | false | false | let chacha20_decrypt #w len out cipher key n ctr =
| let h0 = ST.get () in
chacha20_decrypt_vec #w len out cipher key n ctr;
Chacha20Equiv.lemma_chacha20_vec_equiv #w (as_seq h0 key) (as_seq h0 n) (v ctr) (as_seq h0 cipher) | false |
Trees.fst | Trees.forall_keys_trans | val forall_keys_trans (#a: Type) (t: tree a) (cond1 cond2: (a -> bool))
: Lemma (requires (forall x. cond1 x ==> cond2 x) /\ forall_keys t cond1)
(ensures forall_keys t cond2) | val forall_keys_trans (#a: Type) (t: tree a) (cond1 cond2: (a -> bool))
: Lemma (requires (forall x. cond1 x ==> cond2 x) /\ forall_keys t cond1)
(ensures forall_keys t cond2) | let rec forall_keys_trans (#a: Type) (t: tree a) (cond1 cond2: a -> bool)
: Lemma (requires (forall x. cond1 x ==> cond2 x) /\ forall_keys t cond1)
(ensures forall_keys t cond2)
= match t with
| Leaf -> ()
| Node data left right ->
forall_keys_trans left cond1 cond2; forall_keys_trans right cond1 ... | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 75,
"end_line": 190,
"start_col": 0,
"start_line": 184
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"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 | t: Trees.tree a -> cond1: (_: a -> Prims.bool) -> cond2: (_: a -> Prims.bool)
-> FStar.Pervasives.Lemma
(requires (forall (x: a). cond1 x ==> cond2 x) /\ Trees.forall_keys t cond1)
(ensures Trees.forall_keys t cond2) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Trees.tree",
"Prims.bool",
"Trees.forall_keys_trans",
"Prims.unit",
"Prims.l_and",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.b2t",
"Trees.forall_keys",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [
"recursion"
] | false | false | true | false | false | let rec forall_keys_trans (#a: Type) (t: tree a) (cond1 cond2: (a -> bool))
: Lemma (requires (forall x. cond1 x ==> cond2 x) /\ forall_keys t cond1)
(ensures forall_keys t cond2) =
| match t with
| Leaf -> ()
| Node data left right ->
forall_keys_trans left cond1 cond2;
forall_keys_trans right cond1 cond2 | false |
Trees.fst | Trees.rotate_right_key_left | val rotate_right_key_left (#a: Type) (cmp: cmp a) (r: tree a) (root: a)
: Lemma (requires forall_keys r (key_left cmp root) /\ Some? (rotate_right r))
(ensures forall_keys (Some?.v (rotate_right r)) (key_left cmp root)) | val rotate_right_key_left (#a: Type) (cmp: cmp a) (r: tree a) (root: a)
: Lemma (requires forall_keys r (key_left cmp root) /\ Some? (rotate_right r))
(ensures forall_keys (Some?.v (rotate_right r)) (key_left cmp root)) | let rotate_right_key_left (#a:Type) (cmp:cmp a) (r:tree a) (root:a)
: Lemma (requires forall_keys r (key_left cmp root) /\ Some? (rotate_right r))
(ensures forall_keys (Some?.v (rotate_right r)) (key_left cmp root))
= match r with
| Node x (Node z t1 t2) t3 ->
assert (forall_keys (Node z t1 t2) (... | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 61,
"end_line": 276,
"start_col": 0,
"start_line": 270
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"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 | cmp: Trees.cmp a -> r: Trees.tree a -> root: a
-> FStar.Pervasives.Lemma
(requires Trees.forall_keys r (Trees.key_left cmp root) /\ Some? (Trees.rotate_right r))
(ensures Trees.forall_keys (Some?.v (Trees.rotate_right r)) (Trees.key_left cmp root)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Trees.cmp",
"Trees.tree",
"Prims._assert",
"Prims.b2t",
"Trees.forall_keys",
"Trees.Node",
"Trees.key_left",
"Prims.unit",
"Prims.l_and",
"FStar.Pervasives.Native.uu___is_Some",
"Trees.rotate_right",
"Prims.squash",
"FStar.Pervasives.Native.__proj__Some__item__v",
"Prims.Nil",
"FStar.Pe... | [] | false | false | true | false | false | let rotate_right_key_left (#a: Type) (cmp: cmp a) (r: tree a) (root: a)
: Lemma (requires forall_keys r (key_left cmp root) /\ Some? (rotate_right r))
(ensures forall_keys (Some?.v (rotate_right r)) (key_left cmp root)) =
| match r with
| Node x (Node z t1 t2) t3 ->
assert (forall_keys (Node z t1 t2) (key_left cmp root));
assert (forall_keys (Node x t2 t3) (key_left cmp root)) | false |
Trees.fst | Trees.rotate_left_right_key_left | val rotate_left_right_key_left (#a: Type) (cmp: cmp a) (r: tree a) (root: a)
: Lemma (requires forall_keys r (key_left cmp root) /\ Some? (rotate_left_right r))
(ensures forall_keys (Some?.v (rotate_left_right r)) (key_left cmp root)) | val rotate_left_right_key_left (#a: Type) (cmp: cmp a) (r: tree a) (root: a)
: Lemma (requires forall_keys r (key_left cmp root) /\ Some? (rotate_left_right r))
(ensures forall_keys (Some?.v (rotate_left_right r)) (key_left cmp root)) | let rotate_left_right_key_left (#a:Type) (cmp:cmp a) (r:tree a) (root:a)
: Lemma (requires forall_keys r (key_left cmp root) /\ Some? (rotate_left_right r))
(ensures forall_keys (Some?.v (rotate_left_right r)) (key_left cmp root))
= match r with
| Node x (Node z t1 (Node y t2 t3)) t4 ->
// Node y (... | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 50,
"end_line": 323,
"start_col": 0,
"start_line": 311
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"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 | cmp: Trees.cmp a -> r: Trees.tree a -> root: a
-> FStar.Pervasives.Lemma
(requires Trees.forall_keys r (Trees.key_left cmp root) /\ Some? (Trees.rotate_left_right r))
(ensures Trees.forall_keys (Some?.v (Trees.rotate_left_right r)) (Trees.key_left cmp root)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Trees.cmp",
"Trees.tree",
"Prims._assert",
"Prims.b2t",
"Trees.forall_keys",
"Trees.key_left",
"Prims.unit",
"Trees.Node",
"Prims.l_and",
"FStar.Pervasives.Native.uu___is_Some",
"Trees.rotate_left_right",
"Prims.squash",
"FStar.Pervasives.Native.__proj__Some__item__v",
"Prims.Nil",
"FSt... | [] | false | false | true | false | false | let rotate_left_right_key_left (#a: Type) (cmp: cmp a) (r: tree a) (root: a)
: Lemma (requires forall_keys r (key_left cmp root) /\ Some? (rotate_left_right r))
(ensures forall_keys (Some?.v (rotate_left_right r)) (key_left cmp root)) =
| match r with
| Node x (Node z t1 (Node y t2 t3)) t4 ->
assert (forall_keys (Node z t1 (Node y t2 t3)) (key_left cmp root));
assert (forall_keys (Node y t2 t3) (key_left cmp root));
let left = Node z t1 t2 in
let right = Node x t3 t4 in
assert (forall_keys left (key_left cmp root));
assert (forall_keys right... | false |
Trees.fst | Trees.rotate_right_left_key_left | val rotate_right_left_key_left (#a: Type) (cmp: cmp a) (r: tree a) (root: a)
: Lemma (requires forall_keys r (key_left cmp root) /\ Some? (rotate_right_left r))
(ensures forall_keys (Some?.v (rotate_right_left r)) (key_left cmp root)) | val rotate_right_left_key_left (#a: Type) (cmp: cmp a) (r: tree a) (root: a)
: Lemma (requires forall_keys r (key_left cmp root) /\ Some? (rotate_right_left r))
(ensures forall_keys (Some?.v (rotate_right_left r)) (key_left cmp root)) | let rotate_right_left_key_left (#a:Type) (cmp:cmp a) (r:tree a) (root:a)
: Lemma (requires forall_keys r (key_left cmp root) /\ Some? (rotate_right_left r))
(ensures forall_keys (Some?.v (rotate_right_left r)) (key_left cmp root))
= match r with
| Node x t1 (Node z (Node y t2 t3) t4) ->
assert (for... | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 50,
"end_line": 296,
"start_col": 0,
"start_line": 286
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"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 | cmp: Trees.cmp a -> r: Trees.tree a -> root: a
-> FStar.Pervasives.Lemma
(requires Trees.forall_keys r (Trees.key_left cmp root) /\ Some? (Trees.rotate_right_left r))
(ensures Trees.forall_keys (Some?.v (Trees.rotate_right_left r)) (Trees.key_left cmp root)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Trees.cmp",
"Trees.tree",
"Prims._assert",
"Prims.b2t",
"Trees.forall_keys",
"Trees.key_left",
"Prims.unit",
"Trees.Node",
"Prims.l_and",
"FStar.Pervasives.Native.uu___is_Some",
"Trees.rotate_right_left",
"Prims.squash",
"FStar.Pervasives.Native.__proj__Some__item__v",
"Prims.Nil",
"FSt... | [] | false | false | true | false | false | let rotate_right_left_key_left (#a: Type) (cmp: cmp a) (r: tree a) (root: a)
: Lemma (requires forall_keys r (key_left cmp root) /\ Some? (rotate_right_left r))
(ensures forall_keys (Some?.v (rotate_right_left r)) (key_left cmp root)) =
| match r with
| Node x t1 (Node z (Node y t2 t3) t4) ->
assert (forall_keys (Node z (Node y t2 t3) t4) (key_left cmp root));
assert (forall_keys (Node y t2 t3) (key_left cmp root));
let left = Node x t1 t2 in
let right = Node z t3 t4 in
assert (forall_keys left (key_left cmp root));
assert (forall_keys right... | false |
Trees.fst | Trees.rotate_left_key_right | val rotate_left_key_right (#a: Type) (cmp: cmp a) (r: tree a) (root: a)
: Lemma (requires forall_keys r (key_right cmp root) /\ Some? (rotate_left r))
(ensures forall_keys (Some?.v (rotate_left r)) (key_right cmp root)) | val rotate_left_key_right (#a: Type) (cmp: cmp a) (r: tree a) (root: a)
: Lemma (requires forall_keys r (key_right cmp root) /\ Some? (rotate_left r))
(ensures forall_keys (Some?.v (rotate_left r)) (key_right cmp root)) | let rotate_left_key_right (#a:Type) (cmp:cmp a) (r:tree a) (root:a)
: Lemma (requires forall_keys r (key_right cmp root) /\ Some? (rotate_left r))
(ensures forall_keys (Some?.v (rotate_left r)) (key_right cmp root))
= match r with
| Node x t1 (Node z t2 t3) ->
assert (forall_keys (Node z t2 t3) (... | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 62,
"end_line": 268,
"start_col": 0,
"start_line": 262
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"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 | cmp: Trees.cmp a -> r: Trees.tree a -> root: a
-> FStar.Pervasives.Lemma
(requires Trees.forall_keys r (Trees.key_right cmp root) /\ Some? (Trees.rotate_left r))
(ensures Trees.forall_keys (Some?.v (Trees.rotate_left r)) (Trees.key_right cmp root)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Trees.cmp",
"Trees.tree",
"Prims._assert",
"Prims.b2t",
"Trees.forall_keys",
"Trees.Node",
"Trees.key_right",
"Prims.unit",
"Prims.l_and",
"FStar.Pervasives.Native.uu___is_Some",
"Trees.rotate_left",
"Prims.squash",
"FStar.Pervasives.Native.__proj__Some__item__v",
"Prims.Nil",
"FStar.Pe... | [] | false | false | true | false | false | let rotate_left_key_right (#a: Type) (cmp: cmp a) (r: tree a) (root: a)
: Lemma (requires forall_keys r (key_right cmp root) /\ Some? (rotate_left r))
(ensures forall_keys (Some?.v (rotate_left r)) (key_right cmp root)) =
| match r with
| Node x t1 (Node z t2 t3) ->
assert (forall_keys (Node z t2 t3) (key_right cmp root));
assert (forall_keys (Node x t1 t2) (key_right cmp root)) | false |
Trees.fst | Trees.rotate_left_right_key_right | val rotate_left_right_key_right (#a: Type) (cmp: cmp a) (r: tree a) (root: a)
: Lemma (requires forall_keys r (key_right cmp root) /\ Some? (rotate_left_right r))
(ensures forall_keys (Some?.v (rotate_left_right r)) (key_right cmp root)) | val rotate_left_right_key_right (#a: Type) (cmp: cmp a) (r: tree a) (root: a)
: Lemma (requires forall_keys r (key_right cmp root) /\ Some? (rotate_left_right r))
(ensures forall_keys (Some?.v (rotate_left_right r)) (key_right cmp root)) | let rotate_left_right_key_right (#a:Type) (cmp:cmp a) (r:tree a) (root:a)
: Lemma (requires forall_keys r (key_right cmp root) /\ Some? (rotate_left_right r))
(ensures forall_keys (Some?.v (rotate_left_right r)) (key_right cmp root))
= match r with
| Node x (Node z t1 (Node y t2 t3)) t4 ->
// Node ... | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 51,
"end_line": 337,
"start_col": 0,
"start_line": 325
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"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 | cmp: Trees.cmp a -> r: Trees.tree a -> root: a
-> FStar.Pervasives.Lemma
(requires Trees.forall_keys r (Trees.key_right cmp root) /\ Some? (Trees.rotate_left_right r))
(ensures Trees.forall_keys (Some?.v (Trees.rotate_left_right r)) (Trees.key_right cmp root)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Trees.cmp",
"Trees.tree",
"Prims._assert",
"Prims.b2t",
"Trees.forall_keys",
"Trees.key_right",
"Prims.unit",
"Trees.Node",
"Prims.l_and",
"FStar.Pervasives.Native.uu___is_Some",
"Trees.rotate_left_right",
"Prims.squash",
"FStar.Pervasives.Native.__proj__Some__item__v",
"Prims.Nil",
"FS... | [] | false | false | true | false | false | let rotate_left_right_key_right (#a: Type) (cmp: cmp a) (r: tree a) (root: a)
: Lemma (requires forall_keys r (key_right cmp root) /\ Some? (rotate_left_right r))
(ensures forall_keys (Some?.v (rotate_left_right r)) (key_right cmp root)) =
| match r with
| Node x (Node z t1 (Node y t2 t3)) t4 ->
assert (forall_keys (Node z t1 (Node y t2 t3)) (key_right cmp root));
assert (forall_keys (Node y t2 t3) (key_right cmp root));
let left = Node z t1 t2 in
let right = Node x t3 t4 in
assert (forall_keys left (key_right cmp root));
assert (forall_keys ri... | false |
Hacl.Impl.Chacha20.Vec.fst | Hacl.Impl.Chacha20.Vec.chacha20_encrypt | val chacha20_encrypt: #w:lanes -> chacha20_encrypt_st w | val chacha20_encrypt: #w:lanes -> chacha20_encrypt_st w | let chacha20_encrypt #w len out text key n ctr =
let h0 = ST.get () in
chacha20_encrypt_vec #w len out text key n ctr;
Chacha20Equiv.lemma_chacha20_vec_equiv #w (as_seq h0 key) (as_seq h0 n) (v ctr) (as_seq h0 text) | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Vec.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 98,
"end_line": 241,
"start_col": 0,
"start_line": 238
} | module Hacl.Impl.Chacha20.Vec
module ST = FStar.HyperStack.ST
open FStar.HyperStack
open FStar.HyperStack.All
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Lib.IntVector
open Hacl.Impl.Chacha20.Core32xN
module Spec = Hacl.Spec.Chacha20.Vec
module Chacha20Equiv = Hacl.Spec.Chacha20.Equiv
m... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"L... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loop"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Equiv",
"short_module": "Chacha20Equiv"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Vec",
"short_module": "Spec"
},
{
... | {
"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.Chacha20.Vec.chacha20_encrypt_st w | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Chacha20.Core32xN.lanes",
"Lib.IntTypes.size_t",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"FStar.UInt32.__uint_to_t",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Lib.IntTypes.max_size_t",
"Hacl.Spec.Ch... | [] | false | false | false | false | false | let chacha20_encrypt #w len out text key n ctr =
| let h0 = ST.get () in
chacha20_encrypt_vec #w len out text key n ctr;
Chacha20Equiv.lemma_chacha20_vec_equiv #w (as_seq h0 key) (as_seq h0 n) (v ctr) (as_seq h0 text) | false |
Trees.fst | Trees.rotate_right_bst | val rotate_right_bst (#a: Type) (cmp: cmp a) (r: tree a)
: Lemma (requires is_bst cmp r /\ Some? (rotate_right r))
(ensures is_bst cmp (Some?.v (rotate_right r))) | val rotate_right_bst (#a: Type) (cmp: cmp a) (r: tree a)
: Lemma (requires is_bst cmp r /\ Some? (rotate_right r))
(ensures is_bst cmp (Some?.v (rotate_right r))) | let rotate_right_bst (#a:Type) (cmp:cmp a) (r:tree a)
: Lemma (requires is_bst cmp r /\ Some? (rotate_right r)) (ensures is_bst cmp (Some?.v (rotate_right r)))
= match r with
| Node x (Node z t1 t2) t3 ->
assert (is_bst cmp (Node z t1 t2));
assert (is_bst cmp (Node x t2 t3));
forall_keys_trans t... | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 62,
"end_line": 206,
"start_col": 0,
"start_line": 200
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"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 | cmp: Trees.cmp a -> r: Trees.tree a
-> FStar.Pervasives.Lemma (requires Trees.is_bst cmp r /\ Some? (Trees.rotate_right r))
(ensures Trees.is_bst cmp (Some?.v (Trees.rotate_right r))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Trees.cmp",
"Trees.tree",
"Trees.forall_keys_trans",
"Trees.key_right",
"Prims.unit",
"Prims._assert",
"Prims.b2t",
"Trees.is_bst",
"Trees.Node",
"Prims.l_and",
"FStar.Pervasives.Native.uu___is_Some",
"Trees.rotate_right",
"Prims.squash",
"FStar.Pervasives.Native.__proj__Some__item__v",
... | [] | false | false | true | false | false | let rotate_right_bst (#a: Type) (cmp: cmp a) (r: tree a)
: Lemma (requires is_bst cmp r /\ Some? (rotate_right r))
(ensures is_bst cmp (Some?.v (rotate_right r))) =
| match r with
| Node x (Node z t1 t2) t3 ->
assert (is_bst cmp (Node z t1 t2));
assert (is_bst cmp (Node x t2 t3));
forall_keys_trans t3 (key_right cmp x) (key_right cmp z) | false |
Trees.fst | Trees.rebalance_avl | val rebalance_avl (#a: Type) (x: tree a) : tree a | val rebalance_avl (#a: Type) (x: tree a) : tree a | let rebalance_avl (#a: Type) (x: tree a) : tree a =
match x with
| Leaf -> x
| Node data left right ->
if is_balanced x then x
else (
if height left - height right > 1 then (
let Node ldata lleft lright = left in
if height lright > height lleft then (
ma... | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 7,
"end_line": 376,
"start_col": 0,
"start_line": 342
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Trees.tree a -> Trees.tree a | Prims.Tot | [
"total"
] | [] | [
"Trees.tree",
"Trees.is_balanced",
"Prims.bool",
"Prims.op_GreaterThan",
"Prims.op_Subtraction",
"Trees.height",
"Trees.rotate_left_right",
"FStar.Pervasives.Native.option",
"Trees.rotate_right",
"Prims.op_LessThan",
"Prims.op_Minus",
"Trees.rotate_right_left",
"Trees.rotate_left"
] | [] | false | false | false | true | false | let rebalance_avl (#a: Type) (x: tree a) : tree a =
| match x with
| Leaf -> x
| Node data left right ->
if is_balanced x
then x
else
(if height left - height right > 1
then
(let Node ldata lleft lright = left in
if height lright > height lleft
then
(match rotate_left_right x with
| Some y -> y
... | false |
Hacl.Impl.Chacha20.Vec.fst | Hacl.Impl.Chacha20.Vec.chacha20_decrypt_st | val chacha20_decrypt_st : w: Hacl.Impl.Chacha20.Core32xN.lanes -> Type0 | let chacha20_decrypt_st (w:lanes) =
len:size_t
-> out:lbuffer uint8 len
-> cipher:lbuffer uint8 len
-> key:lbuffer uint8 32ul
-> n:lbuffer uint8 12ul
-> ctr:size_t{v ctr + w <= max_size_t } ->
Stack unit
(requires fun h ->
live h key /\ live h n /\ live h cipher /\ live h out /\ eq_or_disjoint... | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Vec.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 117,
"end_line": 278,
"start_col": 0,
"start_line": 266
} | module Hacl.Impl.Chacha20.Vec
module ST = FStar.HyperStack.ST
open FStar.HyperStack
open FStar.HyperStack.All
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Lib.IntVector
open Hacl.Impl.Chacha20.Core32xN
module Spec = Hacl.Spec.Chacha20.Vec
module Chacha20Equiv = Hacl.Spec.Chacha20.Equiv
m... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"L... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loop"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Equiv",
"short_module": "Chacha20Equiv"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Vec",
"short_module": "Spec"
},
{
... | {
"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 | w: Hacl.Impl.Chacha20.Core32xN.lanes -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Chacha20.Core32xN.lanes",
"Lib.IntTypes.size_t",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"FStar.UInt32.__uint_to_t",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Lib.IntTypes.max_size_t",
"Prims.unit",... | [] | false | false | false | true | true | let chacha20_decrypt_st (w: lanes) =
|
len: size_t ->
out: lbuffer uint8 len ->
cipher: lbuffer uint8 len ->
key: lbuffer uint8 32ul ->
n: lbuffer uint8 12ul ->
ctr: size_t{v ctr + w <= max_size_t}
-> Stack unit
(requires
fun h -> live h key /\ live h n /\ live h cipher /\ live h out /\ eq_or_disjoint cipher out)
... | false | |
Hacl.Impl.Chacha20.Vec.fst | Hacl.Impl.Chacha20.Vec.chacha20_core | val chacha20_core:
#w:lanes
-> k:state w
-> ctx0:state w
-> ctr:size_t{w * v ctr <= max_size_t} ->
Stack unit
(requires (fun h -> live h ctx0 /\ live h k /\ disjoint ctx0 k))
(ensures (fun h0 _ h1 -> modifies (loc k) h0 h1 /\
as_seq h1 k == Spec.chacha20_core (v ctr) (as_seq h0 ctx0))) | val chacha20_core:
#w:lanes
-> k:state w
-> ctx0:state w
-> ctr:size_t{w * v ctr <= max_size_t} ->
Stack unit
(requires (fun h -> live h ctx0 /\ live h k /\ disjoint ctx0 k))
(ensures (fun h0 _ h1 -> modifies (loc k) h0 h1 /\
as_seq h1 k == Spec.chacha20_core (v ctr) (as_seq h0 ctx0))) | let chacha20_core #w k ctx ctr =
copy_state k ctx;
let ctr_u32 = u32 w *! size_to_uint32 ctr in
let cv = vec_load ctr_u32 w in
k.(12ul) <- k.(12ul) +| cv;
rounds k;
sum_state k ctx;
k.(12ul) <- k.(12ul) +| cv | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Vec.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 28,
"end_line": 61,
"start_col": 0,
"start_line": 54
} | module Hacl.Impl.Chacha20.Vec
module ST = FStar.HyperStack.ST
open FStar.HyperStack
open FStar.HyperStack.All
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Lib.IntVector
open Hacl.Impl.Chacha20.Core32xN
module Spec = Hacl.Spec.Chacha20.Vec
module Chacha20Equiv = Hacl.Spec.Chacha20.Equiv
m... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"L... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loop"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Equiv",
"short_module": "Chacha20Equiv"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Vec",
"short_module": "Spec"
},
{
... | {
"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 |
k: Hacl.Impl.Chacha20.Core32xN.state w ->
ctx0: Hacl.Impl.Chacha20.Core32xN.state w ->
ctr: Lib.IntTypes.size_t{w * Lib.IntTypes.v ctr <= Lib.IntTypes.max_size_t}
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Impl.Chacha20.Core32xN.lanes",
"Hacl.Impl.Chacha20.Core32xN.state",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Lib.IntTypes.max_size_t",
"Lib.Buffer.op_Array_Assignment",
"Hacl.Impl.Chach... | [] | false | true | false | false | false | let chacha20_core #w k ctx ctr =
| copy_state k ctx;
let ctr_u32 = u32 w *! size_to_uint32 ctr in
let cv = vec_load ctr_u32 w in
k.(12ul) <- k.(12ul) +| cv;
rounds k;
sum_state k ctx;
k.(12ul) <- k.(12ul) +| cv | false |
Retype.fst | Retype.assumption' | val assumption': Prims.unit -> Tac unit | val assumption': Prims.unit -> Tac unit | let assumption' () : Tac unit =
apply_raw (`FStar.Squash.return_squash);
assumption () | {
"file_name": "examples/native_tactics/Retype.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 31,
"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.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Order.fst.checked"
],
"interface_file": false,
"source_file": "Retype.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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.unit -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Tactics.V2.Derived.assumption",
"FStar.Tactics.V2.Derived.apply_raw"
] | [] | false | true | false | false | false | let assumption' () : Tac unit =
| apply_raw (`FStar.Squash.return_squash);
assumption () | false |
Hacl.Impl.Chacha20.Vec.fst | Hacl.Impl.Chacha20.Vec.setup1 | val setup1:
ctx:lbuffer uint32 16ul
-> k:lbuffer uint8 32ul
-> n:lbuffer uint8 12ul
-> ctr0:size_t ->
Stack unit
(requires (fun h ->
live h ctx /\ live h k /\ live h n /\
disjoint ctx k /\ disjoint ctx n /\
as_seq h ctx == Lib.Sequence.create 16 (u32 0)))
(ensures (fun h0 _ h1 -> m... | val setup1:
ctx:lbuffer uint32 16ul
-> k:lbuffer uint8 32ul
-> n:lbuffer uint8 12ul
-> ctr0:size_t ->
Stack unit
(requires (fun h ->
live h ctx /\ live h k /\ live h n /\
disjoint ctx k /\ disjoint ctx n /\
as_seq h ctx == Lib.Sequence.create 16 (u32 0)))
(ensures (fun h0 _ h1 -> m... | let setup1 ctx k n ctr =
let h0 = ST.get() in
recall_contents chacha20_constants Spec.chacha20_constants;
update_sub_f h0 ctx 0ul 4ul
(fun h -> Lib.Sequence.map secret Spec.chacha20_constants)
(fun _ -> mapT 4ul (sub ctx 0ul 4ul) secret chacha20_constants);
let h1 = ST.get() in
update_sub_f h1 ctx 4ul... | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Vec.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 55,
"end_line": 101,
"start_col": 0,
"start_line": 86
} | module Hacl.Impl.Chacha20.Vec
module ST = FStar.HyperStack.ST
open FStar.HyperStack
open FStar.HyperStack.All
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Lib.IntVector
open Hacl.Impl.Chacha20.Core32xN
module Spec = Hacl.Spec.Chacha20.Vec
module Chacha20Equiv = Hacl.Spec.Chacha20.Equiv
m... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"L... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loop"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Equiv",
"short_module": "Chacha20Equiv"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Vec",
"short_module": "Spec"
},
{
... | {
"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 |
ctx: Lib.Buffer.lbuffer Lib.IntTypes.uint32 16ul ->
k: Lib.Buffer.lbuffer Lib.IntTypes.uint8 32ul ->
n: Lib.Buffer.lbuffer Lib.IntTypes.uint8 12ul ->
ctr0: Lib.IntTypes.size_t
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint32",
"FStar.UInt32.__uint_to_t",
"Lib.IntTypes.uint8",
"Lib.IntTypes.size_t",
"Lib.Buffer.update_sub_f",
"FStar.Monotonic.HyperStack.mem",
"Lib.ByteSequence.uints_from_bytes_le",
"Lib.IntTypes.U32",
"Lib.IntTypes.SEC",
"Lib.IntTypes.v",
"Lib.IntTypes.PUB... | [] | false | true | false | false | false | let setup1 ctx k n ctr =
| let h0 = ST.get () in
recall_contents chacha20_constants Spec.chacha20_constants;
update_sub_f h0
ctx
0ul
4ul
(fun h -> Lib.Sequence.map secret Spec.chacha20_constants)
(fun _ -> mapT 4ul (sub ctx 0ul 4ul) secret chacha20_constants);
let h1 = ST.get () in
update_sub_f h1
ctx
4ul
8ul
(fun h -> Lib.Byte... | false |
TwoLockQueue.fst | TwoLockQueue.maybe_ghost_pts_to | val maybe_ghost_pts_to : x: Steel.Reference.ghost_ref (Queue.Def.t a) ->
hd: Queue.Def.t a ->
o: FStar.Pervasives.Native.option (Queue.Def.t a)
-> Steel.Effect.Common.vprop | let maybe_ghost_pts_to #a (x:ghost_ref (Q.t a)) ([@@@ smt_fallback] hd:Q.t a) (o:option (Q.t a)) =
match o with
| None -> ghost_pts_to x half hd
| Some next -> ghost_pts_to x half next `star` (h_exists (pts_to hd full_perm)) | {
"file_name": "share/steel/examples/steel/TwoLockQueue.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 81,
"end_line": 212,
"start_col": 0,
"start_line": 209
} | module TwoLockQueue
open FStar.Ghost
open Steel.Memory
open Steel.Effect.Atomic
open Steel.Effect
open Steel.FractionalPermission
open Steel.Reference
open Steel.SpinLock
module L = FStar.List.Tot
module U = Steel.Utils
module Q = Queue
/// This module provides an implementation of Michael and Scott's two lock queue... | {
"checked_file": "/",
"dependencies": [
"Steel.Utils.fst.checked",
"Steel.SpinLock.fsti.checked",
"Steel.Reference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"Queue.fsti.check... | [
{
"abbrev": true,
"full_module": "Queue",
"short_module": "Q"
},
{
"abbrev": true,
"full_module": "Steel.Utils",
"short_module": "U"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Steel.SpinLock"... | {
"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: Steel.Reference.ghost_ref (Queue.Def.t a) ->
hd: Queue.Def.t a ->
o: FStar.Pervasives.Native.option (Queue.Def.t a)
-> Steel.Effect.Common.vprop | Prims.Tot | [
"total"
] | [] | [
"Steel.Reference.ghost_ref",
"Queue.Def.t",
"FStar.Pervasives.Native.option",
"Steel.Reference.ghost_pts_to",
"TwoLockQueue.half",
"Steel.Effect.Common.star",
"Steel.Effect.Atomic.h_exists",
"Queue.Def.cell",
"Steel.Reference.pts_to",
"Steel.FractionalPermission.full_perm",
"Steel.Effect.Common.... | [] | false | false | false | true | false | let maybe_ghost_pts_to #a (x: ghost_ref (Q.t a)) ([@@@ smt_fallback]hd: Q.t a) (o: option (Q.t a)) =
| match o with
| None -> ghost_pts_to x half hd
| Some next -> (ghost_pts_to x half next) `star` (h_exists (pts_to hd full_perm)) | false | |
Retype.fst | Retype.tau | val tau: Prims.unit -> Tac unit | val tau: Prims.unit -> Tac unit | let tau () : Tac unit =
let _ = implies_intro () in
let _ = implies_intro () in
let _ = implies_intro () in
let b = implies_intro () in
var_retype b; // call retype, get a goal `p == ?u`
let pp = `p in
let rr = `r in
grewrite pp rr; // rewrite p to q, get `q == ?u`
trefl (); // unif... | {
"file_name": "examples/native_tactics/Retype.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 35,
"end_line": 61,
"start_col": 0,
"start_line": 34
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Order.fst.checked"
],
"interface_file": false,
"source_file": "Retype.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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.unit -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Stubs.Reflection.V2.Builtins.vars_of_env",
"FStar.Stubs.Reflection.V2.Data.binding",
"FStar.Tactics.V2.Derived.qed",
"Retype.assumption'",
"FStar.Tactics.V2.Derived.apply_lemma",
"FStar.Order.ne",
"FStar.Reflection.V2.Compare.compare_term",
"FStar.Tactics.V2.Derived.fail",
"Pr... | [] | false | true | false | false | false | let tau () : Tac unit =
| let _ = implies_intro () in
let _ = implies_intro () in
let _ = implies_intro () in
let b = implies_intro () in
var_retype b;
let pp = `p in
let rr = `r in
grewrite pp rr;
trefl ();
apply_lemma (`l);
let e = cur_env () in
match vars_of_env e with
| [_ ; _ ; _ ; b] ->
let t = type_of_binding b in
let t = norm_term [... | false |
Vale.Curve25519.Fast_lemmas_external.fst | Vale.Curve25519.Fast_lemmas_external.lemma_prod_bounds | val lemma_prod_bounds (dst_hi dst_lo x y:nat64) : Lemma
(requires pow2_64 * dst_hi + dst_lo == x * y)
(ensures dst_hi < pow2_64 - 1 /\
(dst_hi < pow2_64 - 2 \/ dst_lo <= 1)
) | val lemma_prod_bounds (dst_hi dst_lo x y:nat64) : Lemma
(requires pow2_64 * dst_hi + dst_lo == x * y)
(ensures dst_hi < pow2_64 - 1 /\
(dst_hi < pow2_64 - 2 \/ dst_lo <= 1)
) | let lemma_prod_bounds (dst_hi dst_lo x y:nat64) : Lemma
(requires pow2_64 * dst_hi + dst_lo == x * y)
(ensures dst_hi < pow2_64 - 1 /\
(dst_hi < pow2_64 - 2 \/ dst_lo <= 1)
)
=
let result = x * y in
FStar.Math.Lemmas.lemma_div_mod result pow2_64;
//assert (result = pow2_64 * (result / pow2_64... | {
"file_name": "vale/code/crypto/ecc/curve25519/Vale.Curve25519.Fast_lemmas_external.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 30,
"start_col": 0,
"start_line": 18
} | module Vale.Curve25519.Fast_lemmas_external
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Mul
open Vale.Curve25519.Fast_lemmas_internal
let lemma_overflow (dst_hi dst_lo addend:nat64) (old_overflow:bit) : Lemma
(requires dst_hi < pow2_64 - 1 /\
(dst_hi < pow2_64 - 2 \/ dst_lo <= 1) /\
... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Curve25519.Fast_lemmas_internal.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_... | [
{
"abbrev": false,
"full_module": "Vale.Curve25519.Fast_lemmas_internal",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519.Fast_defs",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbre... | {
"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 |
dst_hi: Vale.Def.Types_s.nat64 ->
dst_lo: Vale.Def.Types_s.nat64 ->
x: Vale.Def.Types_s.nat64 ->
y: Vale.Def.Types_s.nat64
-> FStar.Pervasives.Lemma (requires Vale.Def.Words_s.pow2_64 * dst_hi + dst_lo == x * y)
(ensures
dst_hi < Vale.Def.Words_s.pow2_64 - 1 /\
(dst_hi < Vale.De... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Def.Types_s.nat64",
"Prims.unit",
"Vale.Curve25519.Fast_lemmas_internal.lemma_mul_bound64",
"FStar.Math.Lemmas.lemma_div_mod",
"Vale.Def.Words_s.pow2_64",
"Prims.int",
"FStar.Mul.op_Star",
"Prims.eq2",
"Prims.op_Addition",
"Prims.squash",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan"... | [] | true | false | true | false | false | let lemma_prod_bounds (dst_hi dst_lo x y: nat64)
: Lemma (requires pow2_64 * dst_hi + dst_lo == x * y)
(ensures dst_hi < pow2_64 - 1 /\ (dst_hi < pow2_64 - 2 \/ dst_lo <= 1)) =
| let result = x * y in
FStar.Math.Lemmas.lemma_div_mod result pow2_64;
lemma_mul_bound64 x y;
() | false |
Trees.fst | Trees.rebalance_avl_proof | val rebalance_avl_proof (#a: Type) (cmp: cmp a) (x: tree a) (root: a)
: Lemma
(requires
is_bst cmp x /\
(match x with
| Leaf -> True
| Node data left right ->
is_balanced left /\ is_balanced right /\ height left - height right <= 2 /\
height right - ... | val rebalance_avl_proof (#a: Type) (cmp: cmp a) (x: tree a) (root: a)
: Lemma
(requires
is_bst cmp x /\
(match x with
| Leaf -> True
| Node data left right ->
is_balanced left /\ is_balanced right /\ height left - height right <= 2 /\
height right - ... | let rebalance_avl_proof (#a: Type) (cmp:cmp a) (x: tree a)
(root:a)
: Lemma
(requires is_bst cmp x /\ (
match x with
| Leaf -> True
| Node data left right ->
is_balanced left /\ is_balanced right /\
height left - height right <= 2 /\
height right - height left <= 2
)
)
(ensur... | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 7,
"end_line": 487,
"start_col": 0,
"start_line": 379
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"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 | cmp: Trees.cmp a -> x: Trees.tree a -> root: a
-> FStar.Pervasives.Lemma
(requires
Trees.is_bst cmp x /\
(match x with
| Trees.Leaf #_ -> Prims.l_True
| Trees.Node #_ _ left right ->
Trees.is_balanced left /\ Trees.is_balanced right /\
Trees.height lef... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Trees.cmp",
"Trees.tree",
"Trees.is_balanced",
"Prims.bool",
"Prims.op_GreaterThan",
"Prims.op_Subtraction",
"Trees.height",
"Prims._assert",
"Prims.b2t",
"Prims.unit",
"Prims.op_LessThanOrEqual",
"Trees.Node",
"Prims.eq2",
"FStar.Classical.move_requires",
"Prims.l_and",
"Trees.forall... | [] | false | false | true | false | false | let rebalance_avl_proof (#a: Type) (cmp: cmp a) (x: tree a) (root: a)
: Lemma
(requires
is_bst cmp x /\
(match x with
| Leaf -> True
| Node data left right ->
is_balanced left /\ is_balanced right /\ height left - height right <= 2 /\
height right - ... | match x with
| Leaf -> ()
| Node data left right ->
let x_f = rebalance_avl x in
let Node f_data f_left f_right = x_f in
if is_balanced x
then ()
else
(if height left - height right > 1
then
(assert (height left = height right + 2);
let Node ldata lleft lright = left in
i... | false |
Hacl.Impl.Chacha20.Vec.fst | Hacl.Impl.Chacha20.Vec.rounds | val rounds:
#w:lanes
-> st:state w ->
Stack unit
(requires (fun h -> live h st))
(ensures (fun h0 _ h1 -> modifies (loc st) h0 h1 /\
as_seq h1 st == Spec.rounds (as_seq h0 st))) | val rounds:
#w:lanes
-> st:state w ->
Stack unit
(requires (fun h -> live h st))
(ensures (fun h0 _ h1 -> modifies (loc st) h0 h1 /\
as_seq h1 st == Spec.rounds (as_seq h0 st))) | let rounds #w st =
double_round st;
double_round st;
double_round st;
double_round st;
double_round st;
double_round st;
double_round st;
double_round st;
double_round st;
double_round st | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Vec.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 17,
"end_line": 41,
"start_col": 0,
"start_line": 31
} | module Hacl.Impl.Chacha20.Vec
module ST = FStar.HyperStack.ST
open FStar.HyperStack
open FStar.HyperStack.All
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Lib.IntVector
open Hacl.Impl.Chacha20.Core32xN
module Spec = Hacl.Spec.Chacha20.Vec
module Chacha20Equiv = Hacl.Spec.Chacha20.Equiv
m... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"L... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loop"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Equiv",
"short_module": "Chacha20Equiv"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Vec",
"short_module": "Spec"
},
{
... | {
"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 | st: Hacl.Impl.Chacha20.Core32xN.state w -> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Impl.Chacha20.Core32xN.lanes",
"Hacl.Impl.Chacha20.Core32xN.state",
"Hacl.Impl.Chacha20.Core32xN.double_round",
"Prims.unit"
] | [] | false | true | false | false | false | let rounds #w st =
| double_round st;
double_round st;
double_round st;
double_round st;
double_round st;
double_round st;
double_round st;
double_round st;
double_round st;
double_round st | false |
Pulse.Typing.Metatheory.Base.fst | Pulse.Typing.Metatheory.Base.add_frame_well_typed | val add_frame_well_typed
(#g: env)
(#c: comp_st)
(ct: comp_typing_u g c)
(#f: term)
(ft: tot_typing g f tm_vprop)
: comp_typing_u g (add_frame c f) | val add_frame_well_typed
(#g: env)
(#c: comp_st)
(ct: comp_typing_u g c)
(#f: term)
(ft: tot_typing g f tm_vprop)
: comp_typing_u g (add_frame c f) | let add_frame_well_typed (#g:env) (#c:comp_st) (ct:comp_typing_u g c)
(#f:term) (ft:tot_typing g f tm_vprop)
: comp_typing_u g (add_frame c f)
= admit_comp_typing _ _ | {
"file_name": "lib/steel/pulse/Pulse.Typing.Metatheory.Base.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 25,
"end_line": 55,
"start_col": 0,
"start_line": 52
} | (*
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.fst.checked",
"Pulse.Syntax.Naming.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Reflection.Typing.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
... | {
"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 | ct: Pulse.Typing.comp_typing_u g c -> ft: Pulse.Typing.tot_typing g f Pulse.Syntax.Base.tm_vprop
-> Pulse.Typing.comp_typing_u g (Pulse.Typing.add_frame c f) | Prims.Tot | [
"total"
] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Syntax.Base.comp_st",
"Pulse.Typing.comp_typing_u",
"Pulse.Syntax.Base.term",
"Pulse.Typing.tot_typing",
"Pulse.Syntax.Base.tm_vprop",
"Pulse.Typing.Metatheory.Base.admit_comp_typing",
"Pulse.Typing.add_frame"
] | [] | false | false | false | false | false | let add_frame_well_typed
(#g: env)
(#c: comp_st)
(ct: comp_typing_u g c)
(#f: term)
(ft: tot_typing g f tm_vprop)
: comp_typing_u g (add_frame c f) =
| admit_comp_typing _ _ | false |
Pulse.Typing.Metatheory.Base.fst | Pulse.Typing.Metatheory.Base.st_typing_correctness | val st_typing_correctness (#g:env) (#t:st_term) (#c:comp_st)
(d:st_typing g t c)
: comp_typing_u g c | val st_typing_correctness (#g:env) (#t:st_term) (#c:comp_st)
(d:st_typing g t c)
: comp_typing_u g c | let st_typing_correctness (#g:env) (#t:st_term) (#c:comp_st)
(_:st_typing g t c)
: comp_typing_u g c
= admit_comp_typing g c | {
"file_name": "lib/steel/pulse/Pulse.Typing.Metatheory.Base.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 25,
"end_line": 50,
"start_col": 0,
"start_line": 47
} | (*
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.fst.checked",
"Pulse.Syntax.Naming.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Reflection.Typing.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
... | {
"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 -> Pulse.Typing.comp_typing_u g c | Prims.Tot | [
"total"
] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Syntax.Base.st_term",
"Pulse.Syntax.Base.comp_st",
"Pulse.Typing.st_typing",
"Pulse.Typing.Metatheory.Base.admit_comp_typing",
"Pulse.Typing.comp_typing_u"
] | [] | false | false | false | false | false | let st_typing_correctness (#g: env) (#t: st_term) (#c: comp_st) (_: st_typing g t c)
: comp_typing_u g c =
| admit_comp_typing g c | false |
Pulse.Typing.Metatheory.Base.fst | Pulse.Typing.Metatheory.Base.emp_inames_typing | val emp_inames_typing (g: env) : tot_typing g tm_emp_inames tm_inames | val emp_inames_typing (g: env) : tot_typing g tm_emp_inames tm_inames | let emp_inames_typing (g:env) : tot_typing g tm_emp_inames tm_inames = RU.magic() | {
"file_name": "lib/steel/pulse/Pulse.Typing.Metatheory.Base.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 81,
"end_line": 57,
"start_col": 0,
"start_line": 57
} | (*
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.fst.checked",
"Pulse.Syntax.Naming.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Reflection.Typing.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
... | {
"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 | g: Pulse.Typing.Env.env
-> Pulse.Typing.tot_typing g Pulse.Syntax.Base.tm_emp_inames Pulse.Syntax.Base.tm_inames | Prims.Tot | [
"total"
] | [] | [
"Pulse.Typing.Env.env",
"Pulse.RuntimeUtils.magic",
"Pulse.Typing.tot_typing",
"Pulse.Syntax.Base.tm_emp_inames",
"Pulse.Syntax.Base.tm_inames"
] | [] | false | false | false | false | false | let emp_inames_typing (g: env) : tot_typing g tm_emp_inames tm_inames =
| RU.magic () | false |
Pulse.Typing.Metatheory.Base.fst | Pulse.Typing.Metatheory.Base.st_typing_correctness_ctot | val st_typing_correctness_ctot (#g:env) (#t:st_term) (#c:comp{C_Tot? c})
(_:st_typing g t c)
: (u:Ghost.erased universe & universe_of g (comp_res c) u) | val st_typing_correctness_ctot (#g:env) (#t:st_term) (#c:comp{C_Tot? c})
(_:st_typing g t c)
: (u:Ghost.erased universe & universe_of g (comp_res c) u) | let st_typing_correctness_ctot (#g:env) (#t:st_term) (#c:comp{C_Tot? c})
(_:st_typing g t c)
: (u:Ghost.erased universe & universe_of g (comp_res c) u)
= let u : Ghost.erased universe = RU.magic () in
let ty : universe_of g (comp_res c) u = RU.magic() in
(| u, ty |) | {
"file_name": "lib/steel/pulse/Pulse.Typing.Metatheory.Base.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 13,
"end_line": 45,
"start_col": 0,
"start_line": 40
} | (*
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.fst.checked",
"Pulse.Syntax.Naming.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Reflection.Typing.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
... | {
"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 | _: Pulse.Typing.st_typing g t c
-> Prims.dtuple2 (FStar.Ghost.erased Pulse.Syntax.Base.universe)
(fun u40 -> Pulse.Typing.universe_of g (Pulse.Syntax.Base.comp_res c) (FStar.Ghost.reveal u40)
) | Prims.Tot | [
"total"
] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Syntax.Base.st_term",
"Pulse.Syntax.Base.comp",
"Prims.b2t",
"Pulse.Syntax.Base.uu___is_C_Tot",
"Pulse.Typing.st_typing",
"Prims.Mkdtuple2",
"FStar.Ghost.erased",
"Pulse.Syntax.Base.universe",
"Pulse.Typing.universe_of",
"Pulse.Syntax.Base.comp_res",
"FStar.Ghost... | [] | false | false | false | false | false | let st_typing_correctness_ctot (#g: env) (#t: st_term) (#c: comp{C_Tot? c}) (_: st_typing g t c)
: (u: Ghost.erased universe & universe_of g (comp_res c) u) =
| let u:Ghost.erased universe = RU.magic () in
let ty:universe_of g (comp_res c) u = RU.magic () in
(| u, ty |) | false |
Spec.Hash.Lemmas.fst | Spec.Hash.Lemmas.update_multi_associative_blake | val update_multi_associative_blake (a: blake_alg)
(h: words_state a)
(prevlen1: nat)
(prevlen2: nat)
(input1: bytes)
(input2: bytes):
Lemma
(requires (
prevlen1 % block_length a = 0 /\
S.length input1 % block_length a == 0 /\
S.length input2 % block_length a == 0 /\
prevlen2 = prevlen1 + S... | val update_multi_associative_blake (a: blake_alg)
(h: words_state a)
(prevlen1: nat)
(prevlen2: nat)
(input1: bytes)
(input2: bytes):
Lemma
(requires (
prevlen1 % block_length a = 0 /\
S.length input1 % block_length a == 0 /\
S.length input2 % block_length a == 0 /\
prevlen2 = prevlen1 + S... | let update_multi_associative_blake (a: blake_alg)
(h: words_state a)
(prevlen1: nat)
(prevlen2: nat)
(input1: bytes)
(input2: bytes):
Lemma
(requires (
prevlen1 % block_length a == 0 /\
S.length input1 % block_length a == 0 /\
S.length input2 % block_length a == 0 /\
prevlen2 = prevlen1 + ... | {
"file_name": "specs/lemmas/Spec.Hash.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 5,
"end_line": 204,
"start_col": 0,
"start_line": 153
} | module Spec.Hash.Lemmas
module S = FStar.Seq
open Lib.IntTypes
open Spec.Agile.Hash
open Spec.Hash.Definitions
friend Spec.Agile.Hash
(** Lemmas about the behavior of update_multi / update_last *)
#push-options "--fuel 0 --ifuel 1 --z3rlimit 50"
let update_multi_zero a h =
match a with
| MD5 | SHA1 | SHA2_224... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA3.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.Blake2.fst.checked",
"Spec.Agile.Hash.fst.checked",
"Spec.Agile.Hash.fst.checked",
"prims.fst.checked",
"Lib.UpdateMulti.fst.checked",
"Lib.Sequence.Lemmas.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Agile.Hash",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"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.Hash.Definitions.blake_alg ->
h: Spec.Hash.Definitions.words_state a ->
prevlen1: Prims.nat ->
prevlen2: Prims.nat ->
input1: Spec.Hash.Definitions.bytes ->
input2: Spec.Hash.Definitions.bytes
-> FStar.Pervasives.Lemma
(requires
prevlen1 % Spec.Hash.Definitions.block_len... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Spec.Hash.Definitions.blake_alg",
"Spec.Hash.Definitions.words_state",
"Prims.nat",
"Spec.Hash.Definitions.bytes",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Spec.Agile.Hash.update_multi",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"Lib.LoopComb... | [] | false | false | true | false | false | let update_multi_associative_blake
(a: blake_alg)
(h: words_state a)
(prevlen1 prevlen2: nat)
(input1 input2: bytes)
: Lemma
(requires
(prevlen1 % block_length a == 0 /\ S.length input1 % block_length a == 0 /\
S.length input2 % block_length a == 0 /\ prevlen2 = prevl... | let input = S.append input1 input2 in
let nb1 = S.length input1 / block_length a in
let nb2 = S.length input2 / block_length a in
let nb = S.length input / block_length a in
let a' = to_blake_alg a in
let f = Spec.Blake2.blake2_update1 a' prevlen1 input in
let f1 = Spec.Blake2.blake2_update1 a' prevlen1 input1 in
let f... | false |
Hacl.Impl.Chacha20.Vec.fst | Hacl.Impl.Chacha20.Vec.chacha20_init | val chacha20_init:
#w:lanes
-> ctx:state w
-> k:lbuffer uint8 32ul
-> n:lbuffer uint8 12ul
-> ctr0:size_t ->
Stack unit
(requires (fun h ->
live h ctx /\ live h k /\ live h n /\
disjoint ctx k /\ disjoint ctx n /\
as_seq h ctx == Lib.Sequence.create 16 (vec_zero U32 w)))
(ensures... | val chacha20_init:
#w:lanes
-> ctx:state w
-> k:lbuffer uint8 32ul
-> n:lbuffer uint8 12ul
-> ctr0:size_t ->
Stack unit
(requires (fun h ->
live h ctx /\ live h k /\ live h n /\
disjoint ctx k /\ disjoint ctx n /\
as_seq h ctx == Lib.Sequence.create 16 (vec_zero U32 w)))
(ensures... | let chacha20_init #w ctx k n ctr =
push_frame();
let ctx1 = create 16ul (u32 0) in
setup1 ctx1 k n ctr;
let h0 = ST.get() in
mapT 16ul ctx (Spec.vec_load_i w) ctx1;
let ctr = vec_counter U32 w in
let c12 = ctx.(12ul) in
ctx.(12ul) <- c12 +| ctr;
pop_frame() | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Vec.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 13,
"end_line": 128,
"start_col": 0,
"start_line": 119
} | module Hacl.Impl.Chacha20.Vec
module ST = FStar.HyperStack.ST
open FStar.HyperStack
open FStar.HyperStack.All
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Lib.IntVector
open Hacl.Impl.Chacha20.Core32xN
module Spec = Hacl.Spec.Chacha20.Vec
module Chacha20Equiv = Hacl.Spec.Chacha20.Equiv
m... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"L... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loop"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Equiv",
"short_module": "Chacha20Equiv"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Vec",
"short_module": "Spec"
},
{
... | {
"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 |
ctx: Hacl.Impl.Chacha20.Core32xN.state w ->
k: Lib.Buffer.lbuffer Lib.IntTypes.uint8 32ul ->
n: Lib.Buffer.lbuffer Lib.IntTypes.uint8 12ul ->
ctr0: Lib.IntTypes.size_t
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Impl.Chacha20.Core32xN.lanes",
"Hacl.Impl.Chacha20.Core32xN.state",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"FStar.UInt32.__uint_to_t",
"Lib.IntTypes.size_t",
"FStar.HyperStack.ST.pop_frame",
"Prims.unit",
"Lib.Buffer.op_Array_Assignment",
"Hacl.Impl.Chacha20.Core32xN.uint32xN",
"Lib.I... | [] | false | true | false | false | false | let chacha20_init #w ctx k n ctr =
| push_frame ();
let ctx1 = create 16ul (u32 0) in
setup1 ctx1 k n ctr;
let h0 = ST.get () in
mapT 16ul ctx (Spec.vec_load_i w) ctx1;
let ctr = vec_counter U32 w in
let c12 = ctx.(12ul) in
ctx.(12ul) <- c12 +| ctr;
pop_frame () | false |
MerkleTree.Low.fst | MerkleTree.Low.mt_get_root | val mt_get_root:
#hsz:Ghost.erased hash_size_t ->
mt:const_mt_p ->
rt:hash #hsz ->
HST.ST unit
(requires (fun h0 ->
let mt = CB.cast mt in
let dmt = B.get h0 mt 0 in
MT?.hash_size dmt = (Ghost.reveal hsz) /\
mt_get_root_pre_nst dmt rt /\
mt_safe h0 mt /\ Rgl?.r_inv (hreg hsz) h0 rt /... | val mt_get_root:
#hsz:Ghost.erased hash_size_t ->
mt:const_mt_p ->
rt:hash #hsz ->
HST.ST unit
(requires (fun h0 ->
let mt = CB.cast mt in
let dmt = B.get h0 mt 0 in
MT?.hash_size dmt = (Ghost.reveal hsz) /\
mt_get_root_pre_nst dmt rt /\
mt_safe h0 mt /\ Rgl?.r_inv (hreg hsz) h0 rt /... | let mt_get_root #hsz mt rt =
let mt = CB.cast mt in
let hh0 = HST.get () in
let mtv = !*mt in
let prefix = MT?.offset mtv in
let i = MT?.i mtv in
let j = MT?.j mtv in
let hs = MT?.hs mtv in
let rhs = MT?.rhs mtv in
let mroot = MT?.mroot mtv in
let hash_size = MT?.hash_size mtv in
let hash_spec = M... | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 5,
"end_line": 1682,
"start_col": 0,
"start_line": 1571
} | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"LowStar.Vector.fst.checked"... | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | mt: MerkleTree.Low.const_mt_p -> rt: MerkleTree.Low.Datastructures.hash
-> FStar.HyperStack.ST.ST Prims.unit | FStar.HyperStack.ST.ST | [] | [] | [
"FStar.Ghost.erased",
"MerkleTree.Low.Datastructures.hash_size_t",
"MerkleTree.Low.const_mt_p",
"MerkleTree.Low.Datastructures.hash",
"FStar.Ghost.reveal",
"MerkleTree.Low.__proj__MT__item__rhs_ok",
"Prims._assert",
"Prims.eq2",
"FStar.Pervasives.Native.tuple2",
"MerkleTree.New.High.merkle_tree",
... | [] | false | true | false | false | false | let mt_get_root #hsz mt rt =
| let mt = CB.cast mt in
let hh0 = HST.get () in
let mtv = !*mt in
let prefix = MT?.offset mtv in
let i = MT?.i mtv in
let j = MT?.j mtv in
let hs = MT?.hs mtv in
let rhs = MT?.rhs mtv in
let mroot = MT?.mroot mtv in
let hash_size = MT?.hash_size mtv in
let hash_spec = MT?.hash_spec mtv in
let hash_fun = MT?.hash_fun mtv... | false |
Steel.ST.PCMReference.fsti | Steel.ST.PCMReference.pts_to_not_null | val pts_to_not_null (#opened: _) (#t: Type) (#p: pcm t) (r: ref t p) (v: t)
: STGhost unit opened (pts_to r v) (fun _ -> pts_to r v) True (fun _ -> r =!= null) | val pts_to_not_null (#opened: _) (#t: Type) (#p: pcm t) (r: ref t p) (v: t)
: STGhost unit opened (pts_to r v) (fun _ -> pts_to r v) True (fun _ -> r =!= null) | let pts_to_not_null
(#opened: _)
(#t: Type)
(#p: pcm t)
(r: ref t p)
(v: t)
: STGhost unit opened
(pts_to r v)
(fun _ -> pts_to r v)
True
(fun _ -> r =!= null)
= extract_fact
(pts_to r v)
(r =!= null)
(fun m -> pts_to_not_null r v m) | {
"file_name": "lib/steel/Steel.ST.PCMReference.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 36,
"end_line": 49,
"start_col": 0,
"start_line": 35
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.Util.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Steel.ST.PCMReference.fsti"
} | [
{
"abbrev": false,
"full_module": "Steel.ST.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.... | {
"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 | r: Steel.Memory.ref t p -> v: t -> Steel.ST.Effect.Ghost.STGhost Prims.unit | Steel.ST.Effect.Ghost.STGhost | [] | [] | [
"Steel.Memory.inames",
"FStar.PCM.pcm",
"Steel.Memory.ref",
"Steel.ST.Effect.Ghost.extract_fact",
"Steel.ST.PCMReference.pts_to",
"Prims.l_not",
"Prims.eq2",
"Steel.Memory.null",
"Steel.Memory.mem",
"Steel.Memory.pts_to_not_null",
"Prims.unit",
"Steel.Effect.Common.vprop",
"Prims.l_True"
] | [] | false | true | false | false | false | let pts_to_not_null (#opened: _) (#t: Type) (#p: pcm t) (r: ref t p) (v: t)
: STGhost unit opened (pts_to r v) (fun _ -> pts_to r v) True (fun _ -> r =!= null) =
| extract_fact (pts_to r v) (r =!= null) (fun m -> pts_to_not_null r v m) | false |
Hacl.Impl.Chacha20.Vec.fst | Hacl.Impl.Chacha20.Vec.chacha20_encrypt_last | val chacha20_encrypt_last:
#w:lanes
-> ctx:state w
-> len:size_t{v len < w * 64}
-> out:lbuffer uint8 len
-> incr:size_t{w * v incr <= max_size_t}
-> text:lbuffer uint8 len ->
Stack unit
(requires (fun h -> live h ctx /\ live h text /\ live h out /\
disjoint out ctx /\ disjoint text ctx))
... | val chacha20_encrypt_last:
#w:lanes
-> ctx:state w
-> len:size_t{v len < w * 64}
-> out:lbuffer uint8 len
-> incr:size_t{w * v incr <= max_size_t}
-> text:lbuffer uint8 len ->
Stack unit
(requires (fun h -> live h ctx /\ live h text /\ live h out /\
disjoint out ctx /\ disjoint text ctx))
... | let chacha20_encrypt_last #w ctx len out incr text =
push_frame();
let plain = create (size w *! size 64) (u8 0) in
update_sub plain 0ul len text;
chacha20_encrypt_block ctx plain incr plain;
copy out (sub plain 0ul len);
pop_frame() | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Vec.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 13,
"end_line": 171,
"start_col": 0,
"start_line": 165
} | module Hacl.Impl.Chacha20.Vec
module ST = FStar.HyperStack.ST
open FStar.HyperStack
open FStar.HyperStack.All
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Lib.IntVector
open Hacl.Impl.Chacha20.Core32xN
module Spec = Hacl.Spec.Chacha20.Vec
module Chacha20Equiv = Hacl.Spec.Chacha20.Equiv
m... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"L... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loop"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Equiv",
"short_module": "Chacha20Equiv"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Vec",
"short_module": "Spec"
},
{
... | {
"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 |
ctx: Hacl.Impl.Chacha20.Core32xN.state w ->
len: Lib.IntTypes.size_t{Lib.IntTypes.v len < w * 64} ->
out: Lib.Buffer.lbuffer Lib.IntTypes.uint8 len ->
incr: Lib.IntTypes.size_t{w * Lib.IntTypes.v incr <= Lib.IntTypes.max_size_t} ->
text: Lib.Buffer.lbuffer Lib.IntTypes.uint8 len
-> FStar.HyperSta... | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Impl.Chacha20.Core32xN.lanes",
"Hacl.Impl.Chacha20.Core32xN.state",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"FStar.Mul.op_Star",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"Prims.op_LessThanOrEqual",
"Lib.IntTy... | [] | false | true | false | false | false | let chacha20_encrypt_last #w ctx len out incr text =
| push_frame ();
let plain = create (size w *! size 64) (u8 0) in
update_sub plain 0ul len text;
chacha20_encrypt_block ctx plain incr plain;
copy out (sub plain 0ul len);
pop_frame () | false |
Trees.fst | Trees.insert_avl_proof_aux | val insert_avl_proof_aux (#a: Type) (cmp: cmp a) (x: avl a cmp) (key root: a)
: Lemma (requires is_avl cmp x)
(ensures
(let res = insert_avl cmp x key in
is_avl cmp res /\ height x <= height res /\ height res <= height x + 1 /\
(forall_keys x (key_left cmp root) /\ key_left cmp roo... | val insert_avl_proof_aux (#a: Type) (cmp: cmp a) (x: avl a cmp) (key root: a)
: Lemma (requires is_avl cmp x)
(ensures
(let res = insert_avl cmp x key in
is_avl cmp res /\ height x <= height res /\ height res <= height x + 1 /\
(forall_keys x (key_left cmp root) /\ key_left cmp roo... | let rec insert_avl_proof_aux (#a: Type) (cmp:cmp a) (x: avl a cmp) (key: a)
(root:a)
: Lemma (requires is_avl cmp x)
(ensures (
let res = insert_avl cmp x key in
is_avl cmp res /\
height x <= height res /\
height res <= height x + 1 /\
(forall_keys x (key_left cmp root) /\ key_lef... | {
"file_name": "share/steel/examples/steel/Trees.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 5,
"end_line": 543,
"start_col": 0,
"start_line": 508
} | module Trees
module M = FStar.Math.Lib
#set-options "--fuel 1 --ifuel 1 --z3rlimit 20"
(*** Type definitions *)
(**** The tree structure *)
type tree (a: Type) =
| Leaf : tree a
| Node: data: a -> left: tree a -> right: tree a -> tree a
(**** Binary search trees *)
type node_data (a b: Type) = {
key: a;
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Trees.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Math.Lib",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"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 | cmp: Trees.cmp a -> x: Trees.avl a cmp -> key: a -> root: a
-> FStar.Pervasives.Lemma (requires Trees.is_avl cmp x)
(ensures
(let res = Trees.insert_avl cmp x key in
Trees.is_avl cmp res /\ Trees.height x <= Trees.height res /\
Trees.height res <= Trees.height x + 1 /\
(Tre... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Trees.cmp",
"Trees.avl",
"Trees.tree",
"Prims.op_GreaterThanOrEqual",
"Trees.rebalance_avl_proof",
"Prims.unit",
"Trees.insert_avl_proof_aux",
"Trees.Node",
"Trees.insert_avl",
"Prims.bool",
"Prims.int",
"Trees.is_avl",
"Prims.squash",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrE... | [
"recursion"
] | false | false | true | false | false | let rec insert_avl_proof_aux (#a: Type) (cmp: cmp a) (x: avl a cmp) (key root: a)
: Lemma (requires is_avl cmp x)
(ensures
(let res = insert_avl cmp x key in
is_avl cmp res /\ height x <= height res /\ height res <= height x + 1 /\
(forall_keys x (key_left cmp root) /\ key_left cmp... | match x with
| Leaf -> ()
| Node data left right ->
let delta = cmp data key in
if delta >= 0
then
(let new_left = insert_avl cmp left key in
let tmp = Node data new_left right in
insert_avl_proof_aux cmp left key data;
insert_avl_proof_aux cmp left key root;
rebalance_avl_proof cmp tm... | false |
MerkleTree.Low.fst | MerkleTree.Low.mt_flush | val mt_flush:
mt:mt_p ->
HST.ST unit
(requires (fun h0 -> mt_safe h0 mt /\ mt_flush_pre_nst (B.get h0 mt 0)))
(ensures (fun h0 _ h1 ->
let mtv0 = B.get h0 mt 0 in
let mtv1 = B.get h1 mt 0 in
// memory safety
modifies (mt_loc mt) h0 h1 /\
mt_safe h1 mt /\
// correctness
MT?.h... | val mt_flush:
mt:mt_p ->
HST.ST unit
(requires (fun h0 -> mt_safe h0 mt /\ mt_flush_pre_nst (B.get h0 mt 0)))
(ensures (fun h0 _ h1 ->
let mtv0 = B.get h0 mt 0 in
let mtv1 = B.get h1 mt 0 in
// memory safety
modifies (mt_loc mt) h0 h1 /\
mt_safe h1 mt /\
// correctness
MT?.h... | let mt_flush mt =
let mtv = !*mt in
let off = MT?.offset mtv in
let j = MT?.j mtv in
let j1 = j - 1ul in
assert (j1 < uint32_32_max);
assert (off < uint64_max);
assert (UInt.fits (U64.v off + U32.v j1) 64);
let jo = join_offset off j1 in
mt_flush_to mt jo | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 19,
"end_line": 2525,
"start_col": 0,
"start_line": 2516
} | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"LowStar.Vector.fst.checked"... | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | mt: MerkleTree.Low.mt_p -> FStar.HyperStack.ST.ST Prims.unit | FStar.HyperStack.ST.ST | [] | [] | [
"MerkleTree.Low.mt_p",
"MerkleTree.Low.mt_flush_to",
"Prims.unit",
"MerkleTree.Low.offset_t",
"Prims.b2t",
"MerkleTree.Low.offsets_connect",
"MerkleTree.Low.join_offset",
"Prims._assert",
"FStar.UInt.fits",
"FStar.Integers.op_Plus",
"FStar.Integers.Signed",
"FStar.Integers.Winfinite",
"FStar... | [] | false | true | false | false | false | let mt_flush mt =
| let mtv = !*mt in
let off = MT?.offset mtv in
let j = MT?.j mtv in
let j1 = j - 1ul in
assert (j1 < uint32_32_max);
assert (off < uint64_max);
assert (UInt.fits (U64.v off + U32.v j1) 64);
let jo = join_offset off j1 in
mt_flush_to mt jo | false |
TwoLockQueue.fst | TwoLockQueue.rewrite | val rewrite (#u: _) (p q: vprop)
: SteelGhost unit u p (fun _ -> q) (requires fun _ -> p `equiv` q) (ensures fun _ _ _ -> True) | val rewrite (#u: _) (p q: vprop)
: SteelGhost unit u p (fun _ -> q) (requires fun _ -> p `equiv` q) (ensures fun _ _ _ -> True) | let rewrite #u (p q:vprop)
: SteelGhost unit u p (fun _ -> q)
(requires fun _ -> p `equiv` q)
(ensures fun _ _ _ -> True)
= rewrite_slprop p q (fun _ -> reveal_equiv p q) | {
"file_name": "share/steel/examples/steel/TwoLockQueue.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 50,
"end_line": 58,
"start_col": 0,
"start_line": 54
} | module TwoLockQueue
open FStar.Ghost
open Steel.Memory
open Steel.Effect.Atomic
open Steel.Effect
open Steel.FractionalPermission
open Steel.Reference
open Steel.SpinLock
module L = FStar.List.Tot
module U = Steel.Utils
module Q = Queue
/// This module provides an implementation of Michael and Scott's two lock queue... | {
"checked_file": "/",
"dependencies": [
"Steel.Utils.fst.checked",
"Steel.SpinLock.fsti.checked",
"Steel.Reference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"Queue.fsti.check... | [
{
"abbrev": true,
"full_module": "Queue",
"short_module": "Q"
},
{
"abbrev": true,
"full_module": "Steel.Utils",
"short_module": "U"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Steel.SpinLock"... | {
"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: Steel.Effect.Common.vprop -> q: Steel.Effect.Common.vprop
-> Steel.Effect.Atomic.SteelGhost Prims.unit | Steel.Effect.Atomic.SteelGhost | [] | [] | [
"Steel.Memory.inames",
"Steel.Effect.Common.vprop",
"Steel.Effect.Atomic.rewrite_slprop",
"Steel.Memory.mem",
"Steel.Effect.Common.reveal_equiv",
"Prims.unit",
"Steel.Effect.Common.rmem",
"Steel.Effect.Common.equiv",
"Prims.l_True"
] | [] | false | true | false | false | false | let rewrite #u (p: vprop) (q: vprop)
: SteelGhost unit u p (fun _ -> q) (requires fun _ -> p `equiv` q) (ensures fun _ _ _ -> True) =
| rewrite_slprop p q (fun _ -> reveal_equiv p q) | false |
IfcTypechecker.fst | IfcTypechecker.tc_exp | val tc_exp : env:label_fun -> e:exp -> Pure label (requires True) (ensures ni_exp env e) | val tc_exp : env:label_fun -> e:exp -> Pure label (requires True) (ensures ni_exp env e) | let rec tc_exp env e =
match e with
| AInt i -> aint_exp env i ; Low
| AVar r -> avar_exp env r ; env r
| AOp o e1 e2 ->
let l1 = tc_exp env e1 in
let l2 = tc_exp env e2 in
let l = join l1 l2 in
sub_exp env e1 l1 l ; sub_exp env e2 l2 l ; binop_exp env o e1 e2 l ; l | {
"file_name": "examples/rel/IfcTypechecker.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 75,
"end_line": 32,
"start_col": 0,
"start_line": 24
} | (*
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": [
"WhileReify.fst.checked",
"prims.fst.checked",
"IfcRulesReify.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.fst.checked",
"FStar.DM4F.Exceptions.fst.checked"
],
"interface_file": false,
"source_file": "IfcTypechecker.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.DM4F.Exceptions",
"short_module": null
},
{
"abbrev": false,
"full_module": "IfcRulesReify",
"short_module": null
},
{
"abbrev": false,
"full_module": "WhileReify",
"short_module": null
},
{
"abbrev": false,
"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 | env: IfcRulesReify.label_fun -> e: WhileReify.exp -> Prims.Pure IfcRulesReify.label | Prims.Pure | [] | [] | [
"IfcRulesReify.label_fun",
"WhileReify.exp",
"Prims.int",
"IfcRulesReify.Low",
"Prims.unit",
"IfcRulesReify.aint_exp",
"FStar.DM4F.Heap.IntStoreFixed.id",
"IfcRulesReify.avar_exp",
"WhileReify.binop",
"IfcRulesReify.binop_exp",
"IfcRulesReify.sub_exp",
"IfcRulesReify.label",
"IfcRulesReify.j... | [
"recursion"
] | false | false | false | false | false | let rec tc_exp env e =
| match e with
| AInt i ->
aint_exp env i;
Low
| AVar r ->
avar_exp env r;
env r
| AOp o e1 e2 ->
let l1 = tc_exp env e1 in
let l2 = tc_exp env e2 in
let l = join l1 l2 in
sub_exp env e1 l1 l;
sub_exp env e2 l2 l;
binop_exp env o e1 e2 l;
l | false |
Pulse.Typing.Metatheory.Base.fst | Pulse.Typing.Metatheory.Base.st_comp_typing_inversion | val st_comp_typing_inversion (#g:env) (#st:_) (ct:st_comp_typing g st)
: (universe_of g st.res st.u &
tot_typing g st.pre tm_vprop &
x:var{fresh_wrt x g (freevars st.post)} &
tot_typing (push_binding g x ppname_default st.res) (open_term st.post x) tm_vprop) | val st_comp_typing_inversion (#g:env) (#st:_) (ct:st_comp_typing g st)
: (universe_of g st.res st.u &
tot_typing g st.pre tm_vprop &
x:var{fresh_wrt x g (freevars st.post)} &
tot_typing (push_binding g x ppname_default st.res) (open_term st.post x) tm_vprop) | let st_comp_typing_inversion (#g:env) (#st:_) (ct:st_comp_typing g st) =
let STC g st x ty pre post = ct in
(| ty, pre, x, post |) | {
"file_name": "lib/steel/pulse/Pulse.Typing.Metatheory.Base.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 24,
"end_line": 70,
"start_col": 0,
"start_line": 68
} | (*
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.fst.checked",
"Pulse.Syntax.Naming.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Reflection.Typing.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
... | {
"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 | ct: Pulse.Typing.st_comp_typing g st
-> FStar.Pervasives.dtuple4 (Pulse.Typing.universe_of g (Mkst_comp?.res st) (Mkst_comp?.u st))
(fun _ -> Pulse.Typing.tot_typing g (Mkst_comp?.pre st) Pulse.Syntax.Base.tm_vprop)
(fun _ _ ->
x:
Pulse.Syntax.Base.var
{Pulse.Typing.fresh_w... | Prims.Tot | [
"total"
] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Syntax.Base.st_comp",
"Pulse.Typing.st_comp_typing",
"Pulse.Syntax.Base.var",
"Prims.l_and",
"Prims.b2t",
"FStar.Pervasives.Native.uu___is_None",
"Pulse.Syntax.Base.typ",
"Pulse.Typing.Env.lookup",
"Prims.l_not",
"FStar.Set.mem",
"Pulse.Syntax.Naming.freevars",
... | [] | false | false | false | false | false | let st_comp_typing_inversion (#g: env) (#st: _) (ct: st_comp_typing g st) =
| let STC g st x ty pre post = ct in
(| ty, pre, x, post |) | false |
IfcTypechecker.fst | IfcTypechecker.tc_com | val tc_com : env:label_fun -> c:com -> Exn label (requires True)
(ensures fun ol -> Inl? ol ==> ni_com env c (Inl?.v ol))
(decreases c) | val tc_com : env:label_fun -> c:com -> Exn label (requires True)
(ensures fun ol -> Inl? ol ==> ni_com env c (Inl?.v ol))
(decreases c) | let rec tc_com env c =
match c with
| Skip -> skip_com env ; High
| Assign r e ->
let le = tc_exp env e in
let lr = env r in
if not (le <= lr) then raise Not_well_typed ;
sub_exp env e le lr ;
assign_com env e r ;
lr
| Seq c1 c2 ->
let l1 = tc_com env c1 in
let l2 = tc_com env... | {
"file_name": "examples/rel/IfcTypechecker.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 6,
"end_line": 85,
"start_col": 1,
"start_line": 44
} | (*
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": [
"WhileReify.fst.checked",
"prims.fst.checked",
"IfcRulesReify.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.fst.checked",
"FStar.DM4F.Exceptions.fst.checked"
],
"interface_file": false,
"source_file": "IfcTypechecker.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.DM4F.Exceptions",
"short_module": null
},
{
"abbrev": false,
"full_module": "IfcRulesReify",
"short_module": null
},
{
"abbrev": false,
"full_module": "WhileReify",
"short_module": null
},
{
"abbrev": false,
"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 | env: IfcRulesReify.label_fun -> c: WhileReify.com -> FStar.DM4F.Exceptions.Exn IfcRulesReify.label | FStar.DM4F.Exceptions.Exn | [
""
] | [] | [
"IfcRulesReify.label_fun",
"WhileReify.com",
"IfcRulesReify.High",
"Prims.unit",
"IfcRulesReify.skip_com",
"IfcRulesReify.label",
"FStar.DM4F.Heap.IntStoreFixed.id",
"WhileReify.exp",
"IfcRulesReify.assign_com",
"IfcRulesReify.sub_exp",
"Prims.op_Negation",
"IfcRulesReify.op_Less_Equals",
"F... | [
"recursion"
] | false | true | false | false | false | let rec tc_com env c =
| match c with
| Skip ->
skip_com env;
High
| Assign r e ->
let le = tc_exp env e in
let lr = env r in
if not (le <= lr) then raise Not_well_typed;
sub_exp env e le lr;
assign_com env e r;
lr
| Seq c1 c2 ->
let l1 = tc_com env c1 in
let l2 = tc_com env c2 in
let l = meet l1 l2 in
sub_com env c1 l1... | false |
Pulse.Typing.Metatheory.Base.fst | Pulse.Typing.Metatheory.Base.comp_typing_inversion | val comp_typing_inversion (#g:env) (#c:comp_st) (ct:comp_typing_u g c)
: st_comp_typing g (st_comp_of_comp c) & iname_typing g c | val comp_typing_inversion (#g:env) (#c:comp_st) (ct:comp_typing_u g c)
: st_comp_typing g (st_comp_of_comp c) & iname_typing g c | let comp_typing_inversion #g #c ct =
match ct with
| CT_ST _ _ st
| CT_STGhost _ _ st -> st, emp_inames_typing g
| CT_STAtomic _ _ _ _ it st -> st, it | {
"file_name": "lib/steel/pulse/Pulse.Typing.Metatheory.Base.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 39,
"end_line": 63,
"start_col": 0,
"start_line": 59
} | (*
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.fst.checked",
"Pulse.Syntax.Naming.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Reflection.Typing.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
... | {
"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 | ct: Pulse.Typing.comp_typing_u g c
-> Pulse.Typing.st_comp_typing g (Pulse.Syntax.Base.st_comp_of_comp c) *
Pulse.Typing.Metatheory.Base.iname_typing g c | Prims.Tot | [
"total"
] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Syntax.Base.comp_st",
"Pulse.Typing.comp_typing_u",
"Pulse.Syntax.Base.st_comp",
"Pulse.Typing.st_comp_typing",
"FStar.Pervasives.Native.Mktuple2",
"Pulse.Syntax.Base.st_comp_of_comp",
"Pulse.Typing.Metatheory.Base.iname_typing",
"Pulse.Typing.Metatheory.Base.emp_iname... | [] | false | false | false | false | false | let comp_typing_inversion #g #c ct =
| match ct with
| CT_ST _ _ st | CT_STGhost _ _ st -> st, emp_inames_typing g
| CT_STAtomic _ _ _ _ it st -> st, it | false |
IfcTypechecker.fst | IfcTypechecker.tc_com_hybrid | val tc_com_hybrid : env:label_fun -> c:com -> list (cl:(com*label){ni_com env (fst cl) (snd cl)}) ->
Exn label (requires True) (ensures fun ol -> Inl? ol ==> ni_com env c (Inl?.v ol))
(decreases c) | val tc_com_hybrid : env:label_fun -> c:com -> list (cl:(com*label){ni_com env (fst cl) (snd cl)}) ->
Exn label (requires True) (ensures fun ol -> Inl? ol ==> ni_com env c (Inl?.v ol))
(decreases c) | let rec tc_com_hybrid env c cls =
match find #(cl:(com*label){ni_com env (fst cl) (snd cl)})
(fun cl -> fst cl = c) cls with
| Some (_,l) -> l
| None ->
(* the rest is copied more or less verbatim from above *)
begin
match c with
| Skip -> skip_com env ; High
| Assign r e ->
let le = ... | {
"file_name": "examples/rel/IfcTypechecker.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 140,
"start_col": 1,
"start_line": 92
} | (*
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": [
"WhileReify.fst.checked",
"prims.fst.checked",
"IfcRulesReify.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.fst.checked",
"FStar.DM4F.Exceptions.fst.checked"
],
"interface_file": false,
"source_file": "IfcTypechecker.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Exceptions",
"short_module": null
},
{
"abbrev": false,
"full_module": "IfcRulesReify",
"short_module": null
},
{
"abbrev": false,
"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 |
env: IfcRulesReify.label_fun ->
c: WhileReify.com ->
cls:
Prims.list (cl:
(WhileReify.com * IfcRulesReify.label)
{ IfcRulesReify.ni_com env
(FStar.Pervasives.Native.fst cl)
(FStar.Pervasives.Native.snd cl) })
-> FStar.DM4F.Exceptions.Exn IfcRule... | FStar.DM4F.Exceptions.Exn | [
""
] | [] | [
"IfcRulesReify.label_fun",
"WhileReify.com",
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"IfcRulesReify.label",
"IfcRulesReify.ni_com",
"FStar.Pervasives.Native.fst",
"FStar.Pervasives.Native.snd",
"FStar.List.Tot.Base.find",
"Prims.op_Equality",
"Prims.bool",
"IfcRulesReify.High",
"Prim... | [
"recursion"
] | false | true | false | false | false | let rec tc_com_hybrid env c cls =
| match find #(cl: (com * label){ni_com env (fst cl) (snd cl)}) (fun cl -> fst cl = c) cls with
| Some (_, l) -> l
| None ->
match c with
| Skip ->
skip_com env;
High
| Assign r e ->
let le = tc_exp env e in
let lr = env r in
if not (le <= lr) then raise Not_well_typed;
sub_exp env e le lr;
... | false |
Pulse.Typing.Metatheory.Base.fst | Pulse.Typing.Metatheory.Base.non_informative_t_weakening | val non_informative_t_weakening
(g g': env)
(g1: env{pairwise_disjoint g g1 g'})
(u: universe)
(t: term)
(d: non_informative_t (push_env g g') u t)
: non_informative_t (push_env (push_env g g1) g') u t | val non_informative_t_weakening
(g g': env)
(g1: env{pairwise_disjoint g g1 g'})
(u: universe)
(t: term)
(d: non_informative_t (push_env g g') u t)
: non_informative_t (push_env (push_env g g1) g') u t | let non_informative_t_weakening (g g':env) (g1:env{ pairwise_disjoint g g1 g' })
(u:universe) (t:term)
(d:non_informative_t (push_env g g') u t)
: non_informative_t (push_env (push_env g g1) g') u t =
let (| w, _ |) = d in
(| w, RU.magic #(tot_typing _ _ _) () |) | {
"file_name": "lib/steel/pulse/Pulse.Typing.Metatheory.Base.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 42,
"end_line": 92,
"start_col": 0,
"start_line": 87
} | (*
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.fst.checked",
"Pulse.Syntax.Naming.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Reflection.Typing.fsti.checked... | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Stubs.TypeChecker.Core",
"short_module": "C"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": true,
"f... | {
"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 |
g: Pulse.Typing.Env.env ->
g': Pulse.Typing.Env.env ->
g1: Pulse.Typing.Env.env{Pulse.Typing.Env.pairwise_disjoint g g1 g'} ->
u203: Pulse.Syntax.Base.universe ->
t: Pulse.Syntax.Base.term ->
d: Pulse.Typing.non_informative_t (Pulse.Typing.Env.push_env g g') u203 t
-> Pulse.Typing.non_informa... | Prims.Tot | [
"total"
] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Typing.Env.pairwise_disjoint",
"Pulse.Syntax.Base.universe",
"Pulse.Syntax.Base.term",
"Pulse.Typing.non_informative_t",
"Pulse.Typing.Env.push_env",
"Pulse.Typing.tot_typing",
"Pulse.Typing.non_informative_witness_t",
"Prims.Mkdtuple2",
"Pulse.RuntimeUtils.magic"
] | [] | false | false | false | false | false | let non_informative_t_weakening
(g g': env)
(g1: env{pairwise_disjoint g g1 g'})
(u: universe)
(t: term)
(d: non_informative_t (push_env g g') u t)
: non_informative_t (push_env (push_env g g1) g') u t =
| let (| w , _ |) = d in
(| w, RU.magic #(tot_typing _ _ _) () |) | false |
Hacl.Impl.Chacha20.Vec.fst | Hacl.Impl.Chacha20.Vec.chacha20_encrypt_vec | val chacha20_encrypt_vec:
#w:lanes
-> len:size_t
-> out:lbuffer uint8 len
-> text:lbuffer uint8 len
-> key:lbuffer uint8 32ul
-> n:lbuffer uint8 12ul
-> ctr:size_t ->
Stack unit
(requires (fun h ->
live h key /\ live h n /\ live h text /\ live h out /\ eq_or_disjoint text out))
(ensures ... | val chacha20_encrypt_vec:
#w:lanes
-> len:size_t
-> out:lbuffer uint8 len
-> text:lbuffer uint8 len
-> key:lbuffer uint8 32ul
-> n:lbuffer uint8 12ul
-> ctr:size_t ->
Stack unit
(requires (fun h ->
live h key /\ live h n /\ live h text /\ live h out /\ eq_or_disjoint text out))
(ensures ... | let chacha20_encrypt_vec #w len out text key n ctr =
push_frame();
let ctx = create_state w in
chacha20_init #w ctx key n ctr;
chacha20_update #w ctx len out text;
pop_frame() | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Vec.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 13,
"end_line": 218,
"start_col": 0,
"start_line": 213
} | module Hacl.Impl.Chacha20.Vec
module ST = FStar.HyperStack.ST
open FStar.HyperStack
open FStar.HyperStack.All
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Lib.IntVector
open Hacl.Impl.Chacha20.Core32xN
module Spec = Hacl.Spec.Chacha20.Vec
module Chacha20Equiv = Hacl.Spec.Chacha20.Equiv
m... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"L... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loop"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Equiv",
"short_module": "Chacha20Equiv"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Vec",
"short_module": "Spec"
},
{
... | {
"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 |
len: Lib.IntTypes.size_t ->
out: Lib.Buffer.lbuffer Lib.IntTypes.uint8 len ->
text: Lib.Buffer.lbuffer Lib.IntTypes.uint8 len ->
key: Lib.Buffer.lbuffer Lib.IntTypes.uint8 32ul ->
n: Lib.Buffer.lbuffer Lib.IntTypes.uint8 12ul ->
ctr: Lib.IntTypes.size_t
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Impl.Chacha20.Core32xN.lanes",
"Lib.IntTypes.size_t",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"FStar.UInt32.__uint_to_t",
"FStar.HyperStack.ST.pop_frame",
"Prims.unit",
"Hacl.Impl.Chacha20.Vec.chacha20_update",
"Hacl.Impl.Chacha20.Vec.chacha20_init",
"Hacl.Impl.Chacha20.Core32xN.state",
... | [] | false | true | false | false | false | let chacha20_encrypt_vec #w len out text key n ctr =
| push_frame ();
let ctx = create_state w in
chacha20_init #w ctx key n ctr;
chacha20_update #w ctx len out text;
pop_frame () | false |
Hacl.Impl.FFDHE.fst | Hacl.Impl.FFDHE.size_pos | val size_pos : Type0 | let size_pos = x:size_t{v x > 0} | {
"file_name": "code/ffdhe/Hacl.Impl.FFDHE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 32,
"end_line": 32,
"start_col": 0,
"start_line": 32
} | module Hacl.Impl.FFDHE
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Hacl.Impl.FFDHE.Constants
open Hacl.Bignum.Definitions
module ST = FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module S = Spec.FFDHE
module LSeq = Lib.Sequence
m... | {
"checked_file": "/",
"dependencies": [
"Spec.FFDHE.fst.checked",
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Buffer.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Li... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "SD"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Exponentiation",
"short_module": "SE"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "SM"
},
... | {
"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 | Type0 | Prims.Tot | [
"total"
] | [] | [
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_GreaterThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB"
] | [] | false | false | false | true | true | let size_pos =
| x: size_t{v x > 0} | false | |
Hacl.Impl.Chacha20.Vec.fst | Hacl.Impl.Chacha20.Vec.chacha20_decrypt_vec | val chacha20_decrypt_vec:
#w:lanes
-> len:size_t
-> out:lbuffer uint8 len
-> cipher:lbuffer uint8 len
-> key:lbuffer uint8 32ul
-> n:lbuffer uint8 12ul
-> ctr:size_t ->
Stack unit
(requires (fun h ->
live h key /\ live h n /\ live h cipher /\ live h out /\ eq_or_disjoint cipher out))
(en... | val chacha20_decrypt_vec:
#w:lanes
-> len:size_t
-> out:lbuffer uint8 len
-> cipher:lbuffer uint8 len
-> key:lbuffer uint8 32ul
-> n:lbuffer uint8 12ul
-> ctr:size_t ->
Stack unit
(requires (fun h ->
live h key /\ live h n /\ live h cipher /\ live h out /\ eq_or_disjoint cipher out))
(en... | let chacha20_decrypt_vec #w len out cipher key n ctr =
push_frame();
let ctx = create_state w in
chacha20_init ctx key n ctr;
chacha20_update ctx len out cipher;
pop_frame() | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Vec.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 13,
"end_line": 263,
"start_col": 0,
"start_line": 258
} | module Hacl.Impl.Chacha20.Vec
module ST = FStar.HyperStack.ST
open FStar.HyperStack
open FStar.HyperStack.All
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Lib.IntVector
open Hacl.Impl.Chacha20.Core32xN
module Spec = Hacl.Spec.Chacha20.Vec
module Chacha20Equiv = Hacl.Spec.Chacha20.Equiv
m... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"L... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loop"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Equiv",
"short_module": "Chacha20Equiv"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Vec",
"short_module": "Spec"
},
{
... | {
"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 |
len: Lib.IntTypes.size_t ->
out: Lib.Buffer.lbuffer Lib.IntTypes.uint8 len ->
cipher: Lib.Buffer.lbuffer Lib.IntTypes.uint8 len ->
key: Lib.Buffer.lbuffer Lib.IntTypes.uint8 32ul ->
n: Lib.Buffer.lbuffer Lib.IntTypes.uint8 12ul ->
ctr: Lib.IntTypes.size_t
-> FStar.HyperStack.ST.Stack Prims.un... | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Impl.Chacha20.Core32xN.lanes",
"Lib.IntTypes.size_t",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"FStar.UInt32.__uint_to_t",
"FStar.HyperStack.ST.pop_frame",
"Prims.unit",
"Hacl.Impl.Chacha20.Vec.chacha20_update",
"Hacl.Impl.Chacha20.Vec.chacha20_init",
"Hacl.Impl.Chacha20.Core32xN.state",
... | [] | false | true | false | false | false | let chacha20_decrypt_vec #w len out cipher key n ctr =
| push_frame ();
let ctx = create_state w in
chacha20_init ctx key n ctr;
chacha20_update ctx len out cipher;
pop_frame () | false |
Pulse.Typing.Metatheory.Base.fst | Pulse.Typing.Metatheory.Base.non_informative_c_weakening | val non_informative_c_weakening
(g g': env)
(g1: env{pairwise_disjoint g g1 g'})
(c: comp_st)
(d: non_informative_c (push_env g g') c)
: non_informative_c (push_env (push_env g g1) g') c | val non_informative_c_weakening
(g g': env)
(g1: env{pairwise_disjoint g g1 g'})
(c: comp_st)
(d: non_informative_c (push_env g g') c)
: non_informative_c (push_env (push_env g g1) g') c | let non_informative_c_weakening (g g':env) (g1:env{ pairwise_disjoint g g1 g' })
(c:comp_st)
(d:non_informative_c (push_env g g') c)
: non_informative_c (push_env (push_env g g1) g') c =
non_informative_t_weakening g g' g1 _ _ d | {
"file_name": "lib/steel/pulse/Pulse.Typing.Metatheory.Base.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 43,
"end_line": 98,
"start_col": 0,
"start_line": 94
} | (*
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.fst.checked",
"Pulse.Syntax.Naming.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Reflection.Typing.fsti.checked... | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Stubs.TypeChecker.Core",
"short_module": "C"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": true,
"f... | {
"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 |
g: Pulse.Typing.Env.env ->
g': Pulse.Typing.Env.env ->
g1: Pulse.Typing.Env.env{Pulse.Typing.Env.pairwise_disjoint g g1 g'} ->
c: Pulse.Syntax.Base.comp_st ->
d: Pulse.Typing.non_informative_c (Pulse.Typing.Env.push_env g g') c
-> Pulse.Typing.non_informative_c (Pulse.Typing.Env.push_env (Pulse.T... | Prims.Tot | [
"total"
] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Typing.Env.pairwise_disjoint",
"Pulse.Syntax.Base.comp_st",
"Pulse.Typing.non_informative_c",
"Pulse.Typing.Env.push_env",
"Pulse.Typing.Metatheory.Base.non_informative_t_weakening",
"Pulse.Syntax.Base.comp_u",
"Pulse.Syntax.Base.comp_res"
] | [] | false | false | false | false | false | let non_informative_c_weakening
(g g': env)
(g1: env{pairwise_disjoint g g1 g'})
(c: comp_st)
(d: non_informative_c (push_env g g') c)
: non_informative_c (push_env (push_env g g1) g') c =
| non_informative_t_weakening g g' g1 _ _ d | false |
Pulse.Typing.Metatheory.Base.fst | Pulse.Typing.Metatheory.Base.st_sub_weakening | val st_sub_weakening
(g: env)
(g': env{disjoint g g'})
(#c1 #c2: comp)
(d: st_sub (push_env g g') c1 c2)
(g1: env{pairwise_disjoint g g1 g'})
: Tot (st_sub (push_env (push_env g g1) g') c1 c2) (decreases d) | val st_sub_weakening
(g: env)
(g': env{disjoint g g'})
(#c1 #c2: comp)
(d: st_sub (push_env g g') c1 c2)
(g1: env{pairwise_disjoint g g1 g'})
: Tot (st_sub (push_env (push_env g g1) g') c1 c2) (decreases d) | let rec st_sub_weakening (g:env) (g':env { disjoint g g' })
(#c1 #c2:comp) (d:st_sub (push_env g g') c1 c2)
(g1:env { pairwise_disjoint g g1 g' })
: Tot (st_sub (push_env (push_env g g1) g') c1 c2)
(decreases d)
=
let g'' = push_env (push_env g g1) g' in
match d with
| STS_Refl _ _ ->
STS_Refl _... | {
"file_name": "lib/steel/pulse/Pulse.Typing.Metatheory.Base.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 44,
"end_line": 161,
"start_col": 0,
"start_line": 147
} | (*
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.fst.checked",
"Pulse.Syntax.Naming.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Reflection.Typing.fsti.checked... | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Stubs.TypeChecker.Core",
"short_module": "C"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": true,
"f... | {
"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 |
g: Pulse.Typing.Env.env ->
g': Pulse.Typing.Env.env{Pulse.Typing.Env.disjoint g g'} ->
d: Pulse.Typing.st_sub (Pulse.Typing.Env.push_env g g') c1 c2 ->
g1: Pulse.Typing.Env.env{Pulse.Typing.Env.pairwise_disjoint g g1 g'}
-> Prims.Tot
(Pulse.Typing.st_sub (Pulse.Typing.Env.push_env (Pulse.Typing.E... | Prims.Tot | [
"total",
""
] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Typing.Env.disjoint",
"Pulse.Syntax.Base.comp",
"Pulse.Typing.st_sub",
"Pulse.Typing.Env.push_env",
"Pulse.Typing.Env.pairwise_disjoint",
"Pulse.Typing.STS_Refl",
"Pulse.Typing.STS_Trans",
"Pulse.Typing.Metatheory.Base.st_sub_weakening",
"Pulse.Syntax.Base.st_comp",
... | [
"recursion"
] | false | false | false | false | false | let rec st_sub_weakening
(g: env)
(g': env{disjoint g g'})
(#c1 #c2: comp)
(d: st_sub (push_env g g') c1 c2)
(g1: env{pairwise_disjoint g g1 g'})
: Tot (st_sub (push_env (push_env g g1) g') c1 c2) (decreases d) =
| let g'' = push_env (push_env g g1) g' in
match d with
| STS_Refl _ _ -> STS_Refl _ _
| STS_Trans _ _ _ _ dl dr ->
STS_Trans _ _ _ _ (st_sub_weakening g g' dl g1) (st_sub_weakening g g' dr g1)
| STS_AtomicInvs _ stc is1 is2 o1 o2 tok ->
let tok:prop_validity g'' (tm_inames_subset is1 is2) = prop_validity_token_weake... | false |
Pulse.Typing.Metatheory.Base.fst | Pulse.Typing.Metatheory.Base.lift_comp_weakening | val lift_comp_weakening
(g: env)
(g': env{disjoint g g'})
(#c1 #c2: comp)
(d: lift_comp (push_env g g') c1 c2)
(g1: env{pairwise_disjoint g g1 g'})
: Tot (lift_comp (push_env (push_env g g1) g') c1 c2) (decreases d) | val lift_comp_weakening
(g: env)
(g': env{disjoint g g'})
(#c1 #c2: comp)
(d: lift_comp (push_env g g') c1 c2)
(g1: env{pairwise_disjoint g g1 g'})
: Tot (lift_comp (push_env (push_env g g1) g') c1 c2) (decreases d) | let lift_comp_weakening (g:env) (g':env { disjoint g g'})
(#c1 #c2:comp) (d:lift_comp (push_env g g') c1 c2)
(g1:env { pairwise_disjoint g g1 g' })
: Tot (lift_comp (push_env (push_env g g1) g') c1 c2)
(decreases d) =
match d with
| Lift_STAtomic_ST _ c -> Lift_STAtomic_ST _ c
| Lift_Ghost_Neutra... | {
"file_name": "lib/steel/pulse/Pulse.Typing.Metatheory.Base.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 60,
"end_line": 124,
"start_col": 0,
"start_line": 113
} | (*
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.fst.checked",
"Pulse.Syntax.Naming.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Reflection.Typing.fsti.checked... | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Stubs.TypeChecker.Core",
"short_module": "C"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": true,
"f... | {
"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 |
g: Pulse.Typing.Env.env ->
g': Pulse.Typing.Env.env{Pulse.Typing.Env.disjoint g g'} ->
d: Pulse.Typing.lift_comp (Pulse.Typing.Env.push_env g g') c1 c2 ->
g1: Pulse.Typing.Env.env{Pulse.Typing.Env.pairwise_disjoint g g1 g'}
-> Prims.Tot
(Pulse.Typing.lift_comp (Pulse.Typing.Env.push_env (Pulse.Ty... | Prims.Tot | [
"total",
""
] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Typing.Env.disjoint",
"Pulse.Syntax.Base.comp",
"Pulse.Typing.lift_comp",
"Pulse.Typing.Env.push_env",
"Pulse.Typing.Env.pairwise_disjoint",
"Pulse.Syntax.Base.comp_st",
"Prims.b2t",
"Pulse.Syntax.Base.uu___is_C_STAtomic",
"Pulse.Typing.Lift_STAtomic_ST",
"Pulse.Sy... | [] | false | false | false | false | false | let lift_comp_weakening
(g: env)
(g': env{disjoint g g'})
(#c1 #c2: comp)
(d: lift_comp (push_env g g') c1 c2)
(g1: env{pairwise_disjoint g g1 g'})
: Tot (lift_comp (push_env (push_env g g1) g') c1 c2) (decreases d) =
| match d with
| Lift_STAtomic_ST _ c -> Lift_STAtomic_ST _ c
| Lift_Ghost_Neutral _ c non_informative_c ->
Lift_Ghost_Neutral _ c (non_informative_c_weakening g g' g1 _ non_informative_c)
| Lift_Neutral_Ghost _ c -> Lift_Neutral_Ghost _ c
| Lift_Observability _ obs c -> Lift_Observability _ obs c | false |
Pulse.Typing.Metatheory.Base.fst | Pulse.Typing.Metatheory.Base.coerce_eq | val coerce_eq: #a: Type -> #b: Type -> x: a -> squash (a == b) -> y: b{y == x} | val coerce_eq: #a: Type -> #b: Type -> x: a -> squash (a == b) -> y: b{y == x} | let coerce_eq (#a #b:Type) (x:a) (_:squash (a == b)) : y:b { y == x } = x | {
"file_name": "lib/steel/pulse/Pulse.Typing.Metatheory.Base.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 73,
"end_line": 561,
"start_col": 0,
"start_line": 561
} | (*
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.fst.checked",
"Pulse.Syntax.Naming.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Reflection.Typing.fsti.checked... | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Stubs.TypeChecker.Core",
"short_module": "C"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": true,
"f... | {
"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 -> _: Prims.squash (a == b) -> y: b{y == x} | Prims.Tot | [
"total"
] | [] | [
"Prims.squash",
"Prims.eq2"
] | [] | false | false | false | false | false | let coerce_eq (#a: Type) (#b: Type) (x: a) (_: squash (a == b)) : y: b{y == x} =
| x | false |
HyE.PlainPKE.fst | HyE.PlainPKE.repr | val repr: p:t{not conf} -> Tot r | val repr: p:t{not conf} -> Tot r | let repr t = HyE.AE.leak t | {
"file_name": "examples/crypto/HyE.PlainPKE.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 26,
"end_line": 26,
"start_col": 0,
"start_line": 26
} | (*
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",
"HyE.RSA.fst.checked",
"HyE.Ideal.fsti.checked",
"HyE.AE.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "HyE.PlainPKE.fst"
} | [
{
"abbrev": false,
"full_module": "HyE.Ideal",
"short_module": null
},
{
"abbrev": false,
"full_module": "HyE.RSA",
"short_module": null
},
{
"abbrev": false,
"full_module": "HyE",
"short_module": null
},
{
"abbrev": false,
"full_module": "HyE",
"short_mod... | {
"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: HyE.PlainPKE.t{Prims.op_Negation HyE.Ideal.conf} -> HyE.PlainPKE.r | Prims.Tot | [
"total"
] | [] | [
"HyE.PlainPKE.t",
"Prims.b2t",
"Prims.op_Negation",
"HyE.Ideal.conf",
"HyE.AE.leak",
"HyE.PlainPKE.r"
] | [] | false | false | false | false | false | let repr t =
| HyE.AE.leak t | false |
Pulse.Typing.Metatheory.Base.fst | Pulse.Typing.Metatheory.Base.comp_typing_weakening | val comp_typing_weakening
(g: env)
(g': env{disjoint g g'})
(#c: comp)
(#u: universe)
(d: comp_typing (push_env g g') c u)
(g1: env{pairwise_disjoint g g1 g'})
: comp_typing (push_env (push_env g g1) g') c u | val comp_typing_weakening
(g: env)
(g': env{disjoint g g'})
(#c: comp)
(#u: universe)
(d: comp_typing (push_env g g') c u)
(g1: env{pairwise_disjoint g g1 g'})
: comp_typing (push_env (push_env g g1) g') c u | let comp_typing_weakening (g:env) (g':env { disjoint g g' })
(#c:comp) (#u:universe) (d:comp_typing (push_env g g') c u)
(g1:env { pairwise_disjoint g g1 g' })
: comp_typing (push_env (push_env g g1) g') c u =
match d with
| CT_Tot _ t u _ -> CT_Tot _ t u (RU.magic ())
| CT_ST _ _ d -> CT_ST _ _ (st_comp_ty... | {
"file_name": "lib/steel/pulse/Pulse.Typing.Metatheory.Base.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 55,
"end_line": 183,
"start_col": 0,
"start_line": 173
} | (*
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.fst.checked",
"Pulse.Syntax.Naming.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Reflection.Typing.fsti.checked... | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Stubs.TypeChecker.Core",
"short_module": "C"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": true,
"f... | {
"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 |
g: Pulse.Typing.Env.env ->
g': Pulse.Typing.Env.env{Pulse.Typing.Env.disjoint g g'} ->
d: Pulse.Typing.comp_typing (Pulse.Typing.Env.push_env g g') c u295 ->
g1: Pulse.Typing.Env.env{Pulse.Typing.Env.pairwise_disjoint g g1 g'}
-> Pulse.Typing.comp_typing (Pulse.Typing.Env.push_env (Pulse.Typing.Env.p... | Prims.Tot | [
"total"
] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Typing.Env.disjoint",
"Pulse.Syntax.Base.comp",
"Pulse.Syntax.Base.universe",
"Pulse.Typing.comp_typing",
"Pulse.Typing.Env.push_env",
"Pulse.Typing.Env.pairwise_disjoint",
"Pulse.Syntax.Base.term",
"Pulse.Typing.universe_of",
"Pulse.Typing.CT_Tot",
"Pulse.RuntimeU... | [] | false | false | false | false | false | let comp_typing_weakening
(g: env)
(g': env{disjoint g g'})
(#c: comp)
(#u: universe)
(d: comp_typing (push_env g g') c u)
(g1: env{pairwise_disjoint g g1 g'})
: comp_typing (push_env (push_env g g1) g') c u =
| match d with
| CT_Tot _ t u _ -> CT_Tot _ t u (RU.magic ())
| CT_ST _ _ d -> CT_ST _ _ (st_comp_typing_weakening g g' d g1)
| CT_STAtomic _ inames obs _ _ d ->
CT_STAtomic _ inames obs _ (RU.magic ()) (st_comp_typing_weakening g g' d g1)
| CT_STGhost _ _ d -> CT_STGhost _ _ (st_comp_typing_weakening g g' d g1) | false |
Pulse.Typing.Metatheory.Base.fst | Pulse.Typing.Metatheory.Base.non_informative_t_subst | val non_informative_t_subst
(g: env)
(x: var)
(t: typ)
(g': env{pairwise_disjoint g (singleton_env (fstar_env g) x t) g'})
(#e: term)
(e_typing: tot_typing g e t)
(u: universe)
(t1: term)
(d: non_informative_t (push_env g (push_env (singleton_env (fstar_env g) x t) ... | val non_informative_t_subst
(g: env)
(x: var)
(t: typ)
(g': env{pairwise_disjoint g (singleton_env (fstar_env g) x t) g'})
(#e: term)
(e_typing: tot_typing g e t)
(u: universe)
(t1: term)
(d: non_informative_t (push_env g (push_env (singleton_env (fstar_env g) x t) ... | let non_informative_t_subst (g:env) (x:var) (t:typ) (g':env { pairwise_disjoint g (singleton_env (fstar_env g) x t) g' })
(#e:term)
(e_typing:tot_typing g e t)
(u:universe) (t1:term)
(d:non_informative_t (push_env g (push_env (singleton_env (fstar_env g) x t) g')) u t1)
: non_informative_t (push_env g (subst... | {
"file_name": "lib/steel/pulse/Pulse.Typing.Metatheory.Base.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 56,
"end_line": 450,
"start_col": 0,
"start_line": 439
} | (*
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.fst.checked",
"Pulse.Syntax.Naming.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Reflection.Typing.fsti.checked... | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Stubs.TypeChecker.Core",
"short_module": "C"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": true,
"f... | {
"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 |
g: Pulse.Typing.Env.env ->
x: Pulse.Syntax.Base.var ->
t: Pulse.Syntax.Base.typ ->
g':
Pulse.Typing.Env.env
{ Pulse.Typing.Env.pairwise_disjoint g
(Pulse.Typing.Env.singleton_env (Pulse.Typing.Env.fstar_env g) x t)
g' } ->
e_typing: Pulse.Typing.tot_typing g e ... | Prims.Tot | [
"total"
] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Syntax.Base.var",
"Pulse.Syntax.Base.typ",
"Pulse.Typing.Env.pairwise_disjoint",
"Pulse.Typing.Env.singleton_env",
"Pulse.Typing.Env.fstar_env",
"Pulse.Syntax.Base.term",
"Pulse.Typing.tot_typing",
"Pulse.Syntax.Base.universe",
"Pulse.Typing.non_informative_t",
"Pu... | [] | false | false | false | false | false | let non_informative_t_subst
(g: env)
(x: var)
(t: typ)
(g': env{pairwise_disjoint g (singleton_env (fstar_env g) x t) g'})
(#e: term)
(e_typing: tot_typing g e t)
(u: universe)
(t1: term)
(d: non_informative_t (push_env g (push_env (singleton_env (fstar_env g) x t) ... | let ss = nt x e in
let (| w , _ |) = d in
(| subst_term w ss, RU.magic #(tot_typing _ _ _) () |) | false |
Printers.fst | Printers.print_Prims_int | val print_Prims_int: int -> Tot string | val print_Prims_int: int -> Tot string | let print_Prims_int : int -> Tot string = string_of_int | {
"file_name": "examples/tactics/Printers.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 55,
"end_line": 26,
"start_col": 0,
"start_line": 26
} | (*
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.Tactics.V2.Derived.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Util",
"short_module": "TU"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2.Derived",
"short_module": "TD"
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
... | {
"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.int -> Prims.string | Prims.Tot | [
"total"
] | [] | [
"Prims.string_of_int"
] | [] | false | false | false | true | false | let print_Prims_int: int -> Tot string =
| string_of_int | false |
Printers.fst | Printers.print_Prims_string | val print_Prims_string: string -> Tot string | val print_Prims_string: string -> Tot string | let print_Prims_string : string -> Tot string = fun s -> "\"" ^ s ^ "\"" | {
"file_name": "examples/tactics/Printers.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 72,
"end_line": 25,
"start_col": 0,
"start_line": 25
} | (*
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.Tactics.V2.Derived.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Util",
"short_module": "TU"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2.Derived",
"short_module": "TD"
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
... | {
"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: Prims.string -> Prims.string | Prims.Tot | [
"total"
] | [] | [
"Prims.string",
"Prims.op_Hat"
] | [] | false | false | false | true | false | let print_Prims_string: string -> Tot string =
| fun s -> "\"" ^ s ^ "\"" | false |
Printers.fst | Printers.mk_concat | val mk_concat (sep: term) (ts: list term) : Tac term | val mk_concat (sep: term) (ts: list term) : Tac term | let mk_concat (sep : term) (ts : list term) : Tac term =
mk_e_app (pack (Tv_FVar (pack_fv ["FStar"; "String"; "concat"]))) [sep; mk_list ts] | {
"file_name": "examples/tactics/Printers.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 87,
"end_line": 29,
"start_col": 0,
"start_line": 28
} | (*
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.Tactics.V2.Derived.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Util",
"short_module": "TU"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2.Derived",
"short_module": "TD"
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
... | {
"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 | sep: FStar.Tactics.NamedView.term -> ts: Prims.list FStar.Tactics.NamedView.term
-> FStar.Tactics.Effect.Tac FStar.Tactics.NamedView.term | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.NamedView.term",
"Prims.list",
"FStar.Reflection.V2.Derived.mk_e_app",
"FStar.Tactics.NamedView.pack",
"FStar.Tactics.NamedView.Tv_FVar",
"FStar.Stubs.Reflection.V2.Builtins.pack_fv",
"Prims.Cons",
"Prims.string",
"Prims.Nil",
"FStar.Stubs.Reflection.Types.term",
"FStar.Reflection... | [] | false | true | false | false | false | let mk_concat (sep: term) (ts: list term) : Tac term =
| mk_e_app (pack (Tv_FVar (pack_fv ["FStar"; "String"; "concat"]))) [sep; mk_list ts] | false |
Printers.fst | Printers.mk_flatten | val mk_flatten : ts: Prims.list FStar.Tactics.NamedView.term -> FStar.Tactics.Effect.Tac FStar.Tactics.NamedView.term | let mk_flatten ts = mk_concat (`"") ts | {
"file_name": "examples/tactics/Printers.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 38,
"end_line": 31,
"start_col": 0,
"start_line": 31
} | (*
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.Tactics.V2.Derived.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Util",
"short_module": "TU"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2.Derived",
"short_module": "TD"
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
... | {
"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 | ts: Prims.list FStar.Tactics.NamedView.term -> FStar.Tactics.Effect.Tac FStar.Tactics.NamedView.term | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.list",
"FStar.Tactics.NamedView.term",
"Printers.mk_concat"
] | [] | false | true | false | false | false | let mk_flatten ts =
| mk_concat (`"") ts | false | |
Hacl.Impl.Chacha20.Vec.fst | Hacl.Impl.Chacha20.Vec.chacha20_encrypt_block | val chacha20_encrypt_block:
#w:lanes
-> ctx:state w
-> out:lbuffer uint8 (size w *! 64ul)
-> incr:size_t{w * v incr <= max_size_t}
-> text:lbuffer uint8 (size w *! 64ul) ->
Stack unit
(requires (fun h -> live h ctx /\ live h text /\ live h out /\
disjoint out ctx /\ disjoint text ctx /\ eq_or_di... | val chacha20_encrypt_block:
#w:lanes
-> ctx:state w
-> out:lbuffer uint8 (size w *! 64ul)
-> incr:size_t{w * v incr <= max_size_t}
-> text:lbuffer uint8 (size w *! 64ul) ->
Stack unit
(requires (fun h -> live h ctx /\ live h text /\ live h out /\
disjoint out ctx /\ disjoint text ctx /\ eq_or_di... | let chacha20_encrypt_block #w ctx out incr text =
push_frame();
let k = create 16ul (vec_zero U32 w) in
chacha20_core k ctx incr;
transpose k;
xor_block out k text;
pop_frame() | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Vec.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 13,
"end_line": 149,
"start_col": 0,
"start_line": 143
} | module Hacl.Impl.Chacha20.Vec
module ST = FStar.HyperStack.ST
open FStar.HyperStack
open FStar.HyperStack.All
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Lib.IntVector
open Hacl.Impl.Chacha20.Core32xN
module Spec = Hacl.Spec.Chacha20.Vec
module Chacha20Equiv = Hacl.Spec.Chacha20.Equiv
m... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"L... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loop"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Equiv",
"short_module": "Chacha20Equiv"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Chacha20.Vec",
"short_module": "Spec"
},
{
... | {
"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 |
ctx: Hacl.Impl.Chacha20.Core32xN.state w ->
out: Lib.Buffer.lbuffer Lib.IntTypes.uint8 (Lib.IntTypes.size w *! 64ul) ->
incr: Lib.IntTypes.size_t{w * Lib.IntTypes.v incr <= Lib.IntTypes.max_size_t} ->
text: Lib.Buffer.lbuffer Lib.IntTypes.uint8 (Lib.IntTypes.size w *! 64ul)
-> FStar.HyperStack.ST.Sta... | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Impl.Chacha20.Core32xN.lanes",
"Hacl.Impl.Chacha20.Core32xN.state",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"Lib.IntTypes.op_Star_Bang",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Lib.IntTypes.size",
"FStar.UInt32.__uint_to_t",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_LessThanOrEq... | [] | false | true | false | false | false | let chacha20_encrypt_block #w ctx out incr text =
| push_frame ();
let k = create 16ul (vec_zero U32 w) in
chacha20_core k ctx incr;
transpose k;
xor_block out k text;
pop_frame () | false |
Hacl.Impl.FFDHE.fst | Hacl.Impl.FFDHE.ffdhe_len | val ffdhe_len (a: S.ffdhe_alg) : x: size_pos{v x = S.ffdhe_len a} | val ffdhe_len (a: S.ffdhe_alg) : x: size_pos{v x = S.ffdhe_len a} | let ffdhe_len (a:S.ffdhe_alg) : x:size_pos{v x = S.ffdhe_len a} =
allow_inversion S.ffdhe_alg;
match a with
| S.FFDHE2048 -> 256ul
| S.FFDHE3072 -> 384ul
| S.FFDHE4096 -> 512ul
| S.FFDHE6144 -> 768ul
| S.FFDHE8192 -> 1024ul | {
"file_name": "code/ffdhe/Hacl.Impl.FFDHE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 25,
"end_line": 42,
"start_col": 0,
"start_line": 35
} | module Hacl.Impl.FFDHE
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Hacl.Impl.FFDHE.Constants
open Hacl.Bignum.Definitions
module ST = FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module S = Spec.FFDHE
module LSeq = Lib.Sequence
m... | {
"checked_file": "/",
"dependencies": [
"Spec.FFDHE.fst.checked",
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Buffer.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Li... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "SD"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Exponentiation",
"short_module": "SE"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "SM"
},
... | {
"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.FFDHE.ffdhe_alg -> x: Hacl.Impl.FFDHE.size_pos{Lib.IntTypes.v x = Spec.FFDHE.ffdhe_len a} | Prims.Tot | [
"total"
] | [] | [
"Spec.FFDHE.ffdhe_alg",
"FStar.UInt32.__uint_to_t",
"Hacl.Impl.FFDHE.size_pos",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"Prims.l_or",
"Lib.IntTypes.range",
"Lib.IntTypes.U32",
"Prims.l_and",
"Prims.op_GreaterThan",
"Prims.op_LessThanOrEqual",
"Lib.IntTypes.max_size_t",
"Lib.IntTypes... | [] | false | false | false | false | false | let ffdhe_len (a: S.ffdhe_alg) : x: size_pos{v x = S.ffdhe_len a} =
| allow_inversion S.ffdhe_alg;
match a with
| S.FFDHE2048 -> 256ul
| S.FFDHE3072 -> 384ul
| S.FFDHE4096 -> 512ul
| S.FFDHE6144 -> 768ul
| S.FFDHE8192 -> 1024ul | false |
TwoLockQueue.fst | TwoLockQueue.intro_lock_inv | val intro_lock_inv (#a #u: _) (ptr: ref (Q.t a)) (ghost: ghost_ref (Q.t a))
: SteelGhostT unit
u
(h_exists (fun (v: Q.t a) -> (pts_to ptr full v) `star` (ghost_pts_to ghost half v)))
(fun _ -> lock_inv ptr ghost) | val intro_lock_inv (#a #u: _) (ptr: ref (Q.t a)) (ghost: ghost_ref (Q.t a))
: SteelGhostT unit
u
(h_exists (fun (v: Q.t a) -> (pts_to ptr full v) `star` (ghost_pts_to ghost half v)))
(fun _ -> lock_inv ptr ghost) | let intro_lock_inv #a #u (ptr:ref (Q.t a)) (ghost:ghost_ref (Q.t a))
: SteelGhostT unit u
(h_exists (fun (v:Q.t a) -> pts_to ptr full v `star` ghost_pts_to ghost half v))
(fun _ -> lock_inv ptr ghost)
= assert_spinoff
(h_exists (fun (v:Q.t a) -> pts_to ptr full v `star` ghost_pts_to ghost half v) == loc... | {
"file_name": "share/steel/examples/steel/TwoLockQueue.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 19,
"end_line": 92,
"start_col": 0,
"start_line": 83
} | module TwoLockQueue
open FStar.Ghost
open Steel.Memory
open Steel.Effect.Atomic
open Steel.Effect
open Steel.FractionalPermission
open Steel.Reference
open Steel.SpinLock
module L = FStar.List.Tot
module U = Steel.Utils
module Q = Queue
/// This module provides an implementation of Michael and Scott's two lock queue... | {
"checked_file": "/",
"dependencies": [
"Steel.Utils.fst.checked",
"Steel.SpinLock.fsti.checked",
"Steel.Reference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"Queue.fsti.check... | [
{
"abbrev": true,
"full_module": "Queue",
"short_module": "Q"
},
{
"abbrev": true,
"full_module": "Steel.Utils",
"short_module": "U"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Steel.SpinLock"... | {
"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 | ptr: Steel.Reference.ref (Queue.Def.t a) -> ghost: Steel.Reference.ghost_ref (Queue.Def.t a)
-> Steel.Effect.Atomic.SteelGhostT Prims.unit | Steel.Effect.Atomic.SteelGhostT | [] | [] | [
"Steel.Memory.inames",
"Steel.Reference.ref",
"Queue.Def.t",
"Steel.Reference.ghost_ref",
"Steel.Effect.Atomic.rewrite_slprop",
"Steel.Effect.Atomic.h_exists",
"Steel.Effect.Common.star",
"Steel.Reference.pts_to",
"TwoLockQueue.full",
"Steel.Reference.ghost_pts_to",
"TwoLockQueue.half",
"Steel... | [] | false | true | false | false | false | let intro_lock_inv #a #u (ptr: ref (Q.t a)) (ghost: ghost_ref (Q.t a))
: SteelGhostT unit
u
(h_exists (fun (v: Q.t a) -> (pts_to ptr full v) `star` (ghost_pts_to ghost half v)))
(fun _ -> lock_inv ptr ghost) =
| assert_spinoff (h_exists (fun (v: Q.t a) -> (pts_to ptr full v) `star` (ghost_pts_to ghost half v)) ==
lock_inv ptr ghost);
rewrite_slprop (h_exists (fun (v: Q.t a) -> (pts_to ptr full v) `star` (ghost_pts_to ghost half v)))
(lock_inv _ _)
(fun _ -> ()) | false |
Printers.fst | Printers.paren | val paren (e: term) : Tac term | val paren (e: term) : Tac term | let paren (e : term) : Tac term =
mk_flatten [mk_stringlit "("; e; mk_stringlit ")"] | {
"file_name": "examples/tactics/Printers.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 54,
"end_line": 34,
"start_col": 0,
"start_line": 33
} | (*
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.Tactics.V2.Derived.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Util",
"short_module": "TU"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2.Derived",
"short_module": "TD"
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
... | {
"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 | e: FStar.Tactics.NamedView.term -> FStar.Tactics.Effect.Tac FStar.Tactics.NamedView.term | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.NamedView.term",
"Printers.mk_flatten",
"Prims.Cons",
"FStar.Reflection.V2.Derived.mk_stringlit",
"Prims.Nil"
] | [] | false | true | false | false | false | let paren (e: term) : Tac term =
| mk_flatten [mk_stringlit "("; e; mk_stringlit ")"] | false |
Printers.fst | Printers.mk_print_bv | val mk_print_bv (self: name) (f: term) (bvty: namedv & typ) : Tac term | val mk_print_bv (self: name) (f: term) (bvty: namedv & typ) : Tac term | let mk_print_bv (self : name) (f : term) (bvty : namedv & typ) : Tac term =
let bv, ty = bvty in
(* debug ("self = " ^ String.concat "." self ^ "\n>>>>>> f = : " ^ term_to_string f); *)
let mk n = pack (Tv_FVar (pack_fv n)) in
match inspect ty with
| Tv_FVar fv ->
if inspect_fv fv = self
... | {
"file_name": "examples/tactics/Printers.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 47,
"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.Tactics.V2.Derived.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Util",
"short_module": "TU"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2.Derived",
"short_module": "TD"
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
... | {
"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 |
self: FStar.Stubs.Reflection.Types.name ->
f: FStar.Tactics.NamedView.term ->
bvty: (FStar.Tactics.NamedView.namedv * FStar.Stubs.Reflection.Types.typ)
-> FStar.Tactics.Effect.Tac FStar.Tactics.NamedView.term | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Stubs.Reflection.Types.name",
"FStar.Tactics.NamedView.term",
"FStar.Pervasives.Native.tuple2",
"FStar.Tactics.NamedView.namedv",
"FStar.Stubs.Reflection.Types.typ",
"FStar.Stubs.Reflection.Types.fv",
"Prims.op_Equality",
"FStar.Stubs.Reflection.V2.Builtins.inspect_fv",
"FStar.Reflection.V2.D... | [] | false | true | false | false | false | let mk_print_bv (self: name) (f: term) (bvty: namedv & typ) : Tac term =
| let bv, ty = bvty in
let mk n = pack (Tv_FVar (pack_fv n)) in
match inspect ty with
| Tv_FVar fv ->
if inspect_fv fv = self
then mk_e_app f [pack (Tv_Var bv)]
else
let f = mk (cur_module () @ ["print_" ^ (String.concat "_" (inspect_fv fv))]) in
mk_e_app f [pack (Tv_Var bv)]
| _ -> mk_stringlit "?" | false |
MerkleTree.Low.fst | MerkleTree.Low.mt_get_path | val mt_get_path:
#hsz:Ghost.erased hash_size_t ->
mt:const_mt_p ->
idx:offset_t ->
p:path_p ->
root:hash #hsz ->
HST.ST index_t
(requires (fun h0 ->
let mt = CB.cast mt in
let dmt = B.get h0 mt 0 in
MT?.hash_size dmt = Ghost.reveal hsz /\
Path?.hash_size (B.get h0 p 0) = Ghost.reveal ... | val mt_get_path:
#hsz:Ghost.erased hash_size_t ->
mt:const_mt_p ->
idx:offset_t ->
p:path_p ->
root:hash #hsz ->
HST.ST index_t
(requires (fun h0 ->
let mt = CB.cast mt in
let dmt = B.get h0 mt 0 in
MT?.hash_size dmt = Ghost.reveal hsz /\
Path?.hash_size (B.get h0 p 0) = Ghost.reveal ... | let mt_get_path #hsz mt idx p root =
let ncmt = CB.cast mt in
let mtframe = B.frameOf ncmt in
let hh0 = HST.get () in
mt_get_root mt root;
let mtv = !*ncmt in
let hsz = MT?.hash_size mtv in
let hh1 = HST.get () in
path_safe_init_preserved mtframe p
(B.loc_union (mt_loc ncmt)
(B.loc_all_regi... | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 3,
"end_line": 2161,
"start_col": 0,
"start_line": 2075
} | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"LowStar.Vector.fst.checked"... | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
mt: MerkleTree.Low.const_mt_p ->
idx: MerkleTree.Low.offset_t ->
p: MerkleTree.Low.path_p ->
root: MerkleTree.Low.Datastructures.hash
-> FStar.HyperStack.ST.ST MerkleTree.Low.index_t | FStar.HyperStack.ST.ST | [] | [] | [
"FStar.Ghost.erased",
"MerkleTree.Low.Datastructures.hash_size_t",
"MerkleTree.Low.const_mt_p",
"MerkleTree.Low.offset_t",
"MerkleTree.Low.path_p",
"MerkleTree.Low.Datastructures.hash",
"FStar.Ghost.reveal",
"Prims.unit",
"Prims._assert",
"Prims.eq2",
"FStar.Pervasives.Native.tuple3",
"Prims.n... | [] | false | true | false | false | false | let mt_get_path #hsz mt idx p root =
| let ncmt = CB.cast mt in
let mtframe = B.frameOf ncmt in
let hh0 = HST.get () in
mt_get_root mt root;
let mtv = !*ncmt in
let hsz = MT?.hash_size mtv in
let hh1 = HST.get () in
path_safe_init_preserved mtframe
p
(B.loc_union (mt_loc ncmt) (B.loc_all_regions_from false (B.frameOf root)))
hh0
hh1;
assert (MTH.mt_... | false |
Hacl.Impl.FFDHE.fst | Hacl.Impl.FFDHE.ffdhe_precomp_p_st | val ffdhe_precomp_p_st : t: Hacl.Bignum.Definitions.limb_t ->
a: Spec.FFDHE.ffdhe_alg ->
len: Hacl.Impl.FFDHE.size_pos ->
ke: Hacl.Bignum.Exponentiation.exp t
-> Type0 | let ffdhe_precomp_p_st (t:limb_t) (a:S.ffdhe_alg) (len:size_pos) (ke:BE.exp t) =
let nLen = blocks len (size (numbytes t)) in
p_r2_n:lbignum t (nLen +! nLen) ->
Stack unit
(requires fun h ->
live h p_r2_n /\
v len = S.ffdhe_len a /\ ke.BE.bn.BN.len == nLen)
(ensures fun h0 _ h1 -> modifies (loc p_r2... | {
"file_name": "code/ffdhe/Hacl.Impl.FFDHE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 56,
"end_line": 133,
"start_col": 0,
"start_line": 124
} | module Hacl.Impl.FFDHE
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Hacl.Impl.FFDHE.Constants
open Hacl.Bignum.Definitions
module ST = FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module S = Spec.FFDHE
module LSeq = Lib.Sequence
m... | {
"checked_file": "/",
"dependencies": [
"Spec.FFDHE.fst.checked",
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Buffer.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Li... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "SD"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Exponentiation",
"short_module": "SE"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "SM"
},
... | {
"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 |
t: Hacl.Bignum.Definitions.limb_t ->
a: Spec.FFDHE.ffdhe_alg ->
len: Hacl.Impl.FFDHE.size_pos ->
ke: Hacl.Bignum.Exponentiation.exp t
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Spec.FFDHE.ffdhe_alg",
"Hacl.Impl.FFDHE.size_pos",
"Hacl.Bignum.Exponentiation.exp",
"Hacl.Bignum.Definitions.lbignum",
"Lib.IntTypes.op_Plus_Bang",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Prims.unit",
"FStar.Monotonic.HyperStack.mem",
"Prims.l_and",
"Lib.Bu... | [] | false | false | false | false | true | let ffdhe_precomp_p_st (t: limb_t) (a: S.ffdhe_alg) (len: size_pos) (ke: BE.exp t) =
| let nLen = blocks len (size (numbytes t)) in
p_r2_n: lbignum t (nLen +! nLen)
-> Stack unit
(requires fun h -> live h p_r2_n /\ v len = S.ffdhe_len a /\ ke.BE.bn.BN.len == nLen)
(ensures
fun h0 _ h1 ->
modifies (loc p_r2_n) h0 h1 /\ ffdhe_precomp_inv #t #(v nLen) a (as_seq h1 p_r2_n)) | false | |
Printers.fst | Printers.mk_printer_type | val mk_printer_type (t: term) : Tac term | val mk_printer_type (t: term) : Tac term | let mk_printer_type (t : term) : Tac term =
let b = fresh_binder_named "arg" t in
let str = pack (Tv_FVar (pack_fv string_lid)) in
let c = pack_comp (C_Total str) in
pack (Tv_Arrow b c) | {
"file_name": "examples/tactics/Printers.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 23,
"end_line": 53,
"start_col": 0,
"start_line": 49
} | (*
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.Tactics.V2.Derived.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Util",
"short_module": "TU"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2.Derived",
"short_module": "TD"
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
... | {
"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: FStar.Tactics.NamedView.term -> FStar.Tactics.Effect.Tac FStar.Tactics.NamedView.term | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.NamedView.term",
"FStar.Tactics.NamedView.pack",
"FStar.Tactics.NamedView.Tv_Arrow",
"FStar.Tactics.NamedView.comp",
"FStar.Tactics.NamedView.pack_comp",
"FStar.Stubs.Reflection.V2.Data.C_Total",
"FStar.Tactics.NamedView.Tv_FVar",
"FStar.Stubs.Reflection.V2.Builtins.pack_fv",
"FStar.R... | [] | false | true | false | false | false | let mk_printer_type (t: term) : Tac term =
| let b = fresh_binder_named "arg" t in
let str = pack (Tv_FVar (pack_fv string_lid)) in
let c = pack_comp (C_Total str) in
pack (Tv_Arrow b c) | false |
Pulse.Typing.Metatheory.Base.fst | Pulse.Typing.Metatheory.Base.lift_comp_subst | val lift_comp_subst
(g: env)
(x: var)
(t: typ)
(g': env{pairwise_disjoint g (singleton_env (fstar_env g) x t) g'})
(#e: term)
(e_typing: tot_typing g e t)
(#c1 #c2: comp)
(d: lift_comp (push_env g (push_env (singleton_env (fstar_env g) x t) g')) c1 c2)
: lift_comp (pu... | val lift_comp_subst
(g: env)
(x: var)
(t: typ)
(g': env{pairwise_disjoint g (singleton_env (fstar_env g) x t) g'})
(#e: term)
(e_typing: tot_typing g e t)
(#c1 #c2: comp)
(d: lift_comp (push_env g (push_env (singleton_env (fstar_env g) x t) g')) c1 c2)
: lift_comp (pu... | let lift_comp_subst
(g:env) (x:var) (t:typ) (g':env { pairwise_disjoint g (singleton_env (fstar_env g) x t) g' })
(#e:term)
(e_typing:tot_typing g e t)
(#c1 #c2:comp)
(d:lift_comp (push_env g (push_env (singleton_env (fstar_env g) x t) g')) c1 c2)
: lift_comp (push_env g (subst_env g' (nt x e)))
... | {
"file_name": "lib/steel/pulse/Pulse.Typing.Metatheory.Base.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 44,
"end_line": 487,
"start_col": 0,
"start_line": 462
} | (*
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.fst.checked",
"Pulse.Syntax.Naming.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Reflection.Typing.fsti.checked... | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Stubs.TypeChecker.Core",
"short_module": "C"
},
{
"abbrev": true,
"full_module": "FStar.Reflection.V2",
"short_module": "R"
},
{
"abbrev": true,
"f... | {
"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 |
g: Pulse.Typing.Env.env ->
x: Pulse.Syntax.Base.var ->
t: Pulse.Syntax.Base.typ ->
g':
Pulse.Typing.Env.env
{ Pulse.Typing.Env.pairwise_disjoint g
(Pulse.Typing.Env.singleton_env (Pulse.Typing.Env.fstar_env g) x t)
g' } ->
e_typing: Pulse.Typing.tot_typing g e ... | Prims.Tot | [
"total"
] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Syntax.Base.var",
"Pulse.Syntax.Base.typ",
"Pulse.Typing.Env.pairwise_disjoint",
"Pulse.Typing.Env.singleton_env",
"Pulse.Typing.Env.fstar_env",
"Pulse.Syntax.Base.term",
"Pulse.Typing.tot_typing",
"Pulse.Syntax.Base.comp",
"Pulse.Typing.lift_comp",
"Pulse.Typing.E... | [] | false | false | false | false | false | let lift_comp_subst
(g: env)
(x: var)
(t: typ)
(g': env{pairwise_disjoint g (singleton_env (fstar_env g) x t) g'})
(#e: term)
(e_typing: tot_typing g e t)
(#c1 #c2: comp)
(d: lift_comp (push_env g (push_env (singleton_env (fstar_env g) x t) g')) c1 c2)
: lift_comp (pu... | let ss = nt x e in
match d with
| Lift_STAtomic_ST _ c -> Lift_STAtomic_ST _ (subst_comp c ss)
| Lift_Ghost_Neutral _ c d_non_informative ->
Lift_Ghost_Neutral _
(subst_comp c ss)
(non_informative_c_subst g x t g' e_typing _ d_non_informative)
| Lift_Neutral_Ghost _ c -> Lift_Neutral_Ghost _ (subst_comp c ss)... | false |
Hacl.Impl.FFDHE.fst | Hacl.Impl.FFDHE.ffdhe_bn_from_g_st | val ffdhe_bn_from_g_st : t: Hacl.Bignum.Definitions.limb_t -> a: Spec.FFDHE.ffdhe_alg -> len: Hacl.Impl.FFDHE.size_pos
-> Type0 | let ffdhe_bn_from_g_st (t:limb_t) (a:S.ffdhe_alg) (len:size_pos) =
g_n:lbignum t (blocks len (size (numbytes t))) ->
Stack unit
(requires fun h ->
live h g_n /\
v len = S.ffdhe_len a /\
as_seq h g_n == LSeq.create (v (blocks len (size (numbytes t)))) (uint #t 0))
(ensures fun h0 _ h1 -> modifies (... | {
"file_name": "code/ffdhe/Hacl.Impl.FFDHE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 94,
"end_line": 86,
"start_col": 0,
"start_line": 77
} | module Hacl.Impl.FFDHE
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Hacl.Impl.FFDHE.Constants
open Hacl.Bignum.Definitions
module ST = FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module S = Spec.FFDHE
module LSeq = Lib.Sequence
m... | {
"checked_file": "/",
"dependencies": [
"Spec.FFDHE.fst.checked",
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Buffer.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Li... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "SD"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Exponentiation",
"short_module": "SE"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "SM"
},
... | {
"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 | t: Hacl.Bignum.Definitions.limb_t -> a: Spec.FFDHE.ffdhe_alg -> len: Hacl.Impl.FFDHE.size_pos
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Spec.FFDHE.ffdhe_alg",
"Hacl.Impl.FFDHE.size_pos",
"Hacl.Bignum.Definitions.lbignum",
"Hacl.Bignum.Definitions.blocks",
"Lib.IntTypes.size",
"Lib.IntTypes.numbytes",
"Prims.unit",
"FStar.Monotonic.HyperStack.mem",
"Prims.l_and",
"Lib.Buffer.live",
"Lib.Buffer... | [] | false | false | false | true | true | let ffdhe_bn_from_g_st (t: limb_t) (a: S.ffdhe_alg) (len: size_pos) =
| g_n: lbignum t (blocks len (size (numbytes t)))
-> Stack unit
(requires
fun h ->
live h g_n /\ v len = S.ffdhe_len a /\
as_seq h g_n == LSeq.create (v (blocks len (size (numbytes t)))) (uint #t 0))
(ensures
fun h0 _ h1 ->
modifies (loc g_n) h0 h1 /\
... | false | |
Hacl.Impl.FFDHE.fst | Hacl.Impl.FFDHE.ffdhe_p_to_ps | val ffdhe_p_to_ps:
a:S.ffdhe_alg
-> p_s:lbuffer uint8 (ffdhe_len a) ->
Stack unit
(requires fun h -> live h p_s)
(ensures fun h0 _ h1 -> modifies (loc p_s) h0 h1 /\
BSeq.nat_from_intseq_be (S.Mk_ffdhe_params?.ffdhe_p (S.get_ffdhe_params a)) ==
BSeq.nat_from_intseq_be (as_seq h1 p_s)) | val ffdhe_p_to_ps:
a:S.ffdhe_alg
-> p_s:lbuffer uint8 (ffdhe_len a) ->
Stack unit
(requires fun h -> live h p_s)
(ensures fun h0 _ h1 -> modifies (loc p_s) h0 h1 /\
BSeq.nat_from_intseq_be (S.Mk_ffdhe_params?.ffdhe_p (S.get_ffdhe_params a)) ==
BSeq.nat_from_intseq_be (as_seq h1 p_s)) | let ffdhe_p_to_ps a p_s =
let p = get_ffdhe_p a in
recall_contents p (S.Mk_ffdhe_params?.ffdhe_p (S.get_ffdhe_params a));
let len = ffdhe_len a in
mapT len p_s secret p;
BSeq.nat_from_intseq_be_public_to_secret (v len) (S.Mk_ffdhe_params?.ffdhe_p (S.get_ffdhe_params a)) | {
"file_name": "code/ffdhe/Hacl.Impl.FFDHE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 102,
"end_line": 73,
"start_col": 0,
"start_line": 68
} | module Hacl.Impl.FFDHE
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Hacl.Impl.FFDHE.Constants
open Hacl.Bignum.Definitions
module ST = FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module S = Spec.FFDHE
module LSeq = Lib.Sequence
m... | {
"checked_file": "/",
"dependencies": [
"Spec.FFDHE.fst.checked",
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Buffer.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Li... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "SD"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Exponentiation",
"short_module": "SE"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "SM"
},
... | {
"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.FFDHE.ffdhe_alg -> p_s: Lib.Buffer.lbuffer Lib.IntTypes.uint8 (Hacl.Impl.FFDHE.ffdhe_len a)
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Spec.FFDHE.ffdhe_alg",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"Hacl.Impl.FFDHE.ffdhe_len",
"Lib.ByteSequence.nat_from_intseq_be_public_to_secret",
"Lib.IntTypes.U8",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Spec.FFDHE.__proj__Mk_ffdhe_params__item__ffdhe_p",
"Spec.FFDHE.g... | [] | false | true | false | false | false | let ffdhe_p_to_ps a p_s =
| let p = get_ffdhe_p a in
recall_contents p (S.Mk_ffdhe_params?.ffdhe_p (S.get_ffdhe_params a));
let len = ffdhe_len a in
mapT len p_s secret p;
BSeq.nat_from_intseq_be_public_to_secret (v len) (S.Mk_ffdhe_params?.ffdhe_p (S.get_ffdhe_params a)) | false |
Hacl.Impl.FFDHE.fst | Hacl.Impl.FFDHE.ffdhe_precomp_inv | val ffdhe_precomp_inv : a: Spec.FFDHE.ffdhe_alg -> p_r2_n: Hacl.Spec.Bignum.Definitions.lbignum t (len + len)
-> Prims.logical | let ffdhe_precomp_inv (#t:limb_t) (#len:size_nat{0 < len /\ len + len <= max_size_t})
(a:S.ffdhe_alg) (p_r2_n:SD.lbignum t (len + len))
=
let p_n = LSeq.sub p_r2_n 0 len in
let r2_n = LSeq.sub p_r2_n len len in
SD.bn_v p_n == BSeq.nat_from_bytes_be (S.Mk_ffdhe_params?.ffdhe_p (S.get_ffdhe_params a)) /\
0 < S... | {
"file_name": "code/ffdhe/Hacl.Impl.FFDHE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 74,
"end_line": 120,
"start_col": 0,
"start_line": 114
} | module Hacl.Impl.FFDHE
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Hacl.Impl.FFDHE.Constants
open Hacl.Bignum.Definitions
module ST = FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module S = Spec.FFDHE
module LSeq = Lib.Sequence
m... | {
"checked_file": "/",
"dependencies": [
"Spec.FFDHE.fst.checked",
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Buffer.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Li... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "SD"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Exponentiation",
"short_module": "SE"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "SM"
},
... | {
"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.FFDHE.ffdhe_alg -> p_r2_n: Hacl.Spec.Bignum.Definitions.lbignum t (len + len)
-> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Lib.IntTypes.max_size_t",
"Spec.FFDHE.ffdhe_alg",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Prims.eq2",
"Prims.nat",
"Hacl.Spec.Bignum.... | [] | false | false | false | false | true | let ffdhe_precomp_inv
(#t: limb_t)
(#len: size_nat{0 < len /\ len + len <= max_size_t})
(a: S.ffdhe_alg)
(p_r2_n: SD.lbignum t (len + len))
=
| let p_n = LSeq.sub p_r2_n 0 len in
let r2_n = LSeq.sub p_r2_n len len in
SD.bn_v p_n == BSeq.nat_from_bytes_be (S.Mk_ffdhe_params?.ffdhe_p (S.get_ffdhe_params a)) /\
0 < SD.bn_v p_n /\ SD.bn_v r2_n == pow2 ((2 * bits t) * len) % SD.bn_v p_n | false | |
Hacl.Impl.FFDHE.fst | Hacl.Impl.FFDHE.get_ffdhe_p | val get_ffdhe_p (a: S.ffdhe_alg)
: x:
glbuffer pub_uint8 (ffdhe_len a)
{witnessed x (S.Mk_ffdhe_params?.ffdhe_p (S.get_ffdhe_params a)) /\ recallable x} | val get_ffdhe_p (a: S.ffdhe_alg)
: x:
glbuffer pub_uint8 (ffdhe_len a)
{witnessed x (S.Mk_ffdhe_params?.ffdhe_p (S.get_ffdhe_params a)) /\ recallable x} | let get_ffdhe_p (a:S.ffdhe_alg) :x:glbuffer pub_uint8 (ffdhe_len a)
{witnessed x (S.Mk_ffdhe_params?.ffdhe_p (S.get_ffdhe_params a)) /\ recallable x}
=
allow_inversion S.ffdhe_alg;
match a with
| S.FFDHE2048 -> ffdhe_p2048
| S.FFDHE3072 -> ffdhe_p3072
| S.FFDHE4096 -> ffdhe_p4096
| S.FFDHE6144 -> ffdhe_p... | {
"file_name": "code/ffdhe/Hacl.Impl.FFDHE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 30,
"end_line": 55,
"start_col": 0,
"start_line": 46
} | module Hacl.Impl.FFDHE
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Hacl.Impl.FFDHE.Constants
open Hacl.Bignum.Definitions
module ST = FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module S = Spec.FFDHE
module LSeq = Lib.Sequence
m... | {
"checked_file": "/",
"dependencies": [
"Spec.FFDHE.fst.checked",
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Buffer.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Li... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "SD"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Exponentiation",
"short_module": "SE"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "SM"
},
... | {
"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.FFDHE.ffdhe_alg
-> x:
Lib.Buffer.glbuffer Lib.IntTypes.pub_uint8 (Hacl.Impl.FFDHE.ffdhe_len a)
{ Lib.Buffer.witnessed x (Mk_ffdhe_params?.ffdhe_p (Spec.FFDHE.get_ffdhe_params a)) /\
Lib.Buffer.recallable x } | Prims.Tot | [
"total"
] | [] | [
"Spec.FFDHE.ffdhe_alg",
"Hacl.Impl.FFDHE.Constants.ffdhe_p2048",
"Hacl.Impl.FFDHE.Constants.ffdhe_p3072",
"Hacl.Impl.FFDHE.Constants.ffdhe_p4096",
"Hacl.Impl.FFDHE.Constants.ffdhe_p6144",
"Hacl.Impl.FFDHE.Constants.ffdhe_p8192",
"Lib.Buffer.glbuffer",
"Lib.IntTypes.pub_uint8",
"Hacl.Impl.FFDHE.ffdhe... | [] | false | false | false | false | false | let get_ffdhe_p (a: S.ffdhe_alg)
: x:
glbuffer pub_uint8 (ffdhe_len a)
{witnessed x (S.Mk_ffdhe_params?.ffdhe_p (S.get_ffdhe_params a)) /\ recallable x} =
| allow_inversion S.ffdhe_alg;
match a with
| S.FFDHE2048 -> ffdhe_p2048
| S.FFDHE3072 -> ffdhe_p3072
| S.FFDHE4096 -> ffdhe_p4096
| S.FFDHE6144 -> ffdhe_p6144
| S.FFDHE8192 -> ffdhe_p8192 | false |
Hacl.Impl.FFDHE.fst | Hacl.Impl.FFDHE.new_ffdhe_precomp_p_st | val new_ffdhe_precomp_p_st : t: Hacl.Bignum.Definitions.limb_t ->
a: Spec.FFDHE.ffdhe_alg ->
len: Hacl.Impl.FFDHE.size_pos ->
ke: Hacl.Bignum.Exponentiation.exp t
-> Type0 | let new_ffdhe_precomp_p_st (t:limb_t) (a:S.ffdhe_alg) (len:size_pos) (ke:BE.exp t) =
let nLen = blocks len (size (numbytes t)) in
r:HS.rid ->
ST (B.buffer (limb t))
(requires fun h ->
ST.is_eternal_region r /\
v len = S.ffdhe_len a /\ ke.BE.bn.BN.len == nLen)
(ensures fun h0 res h1 ->
B.(modifie... | {
"file_name": "code/ffdhe/Hacl.Impl.FFDHE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 86,
"end_line": 179,
"start_col": 0,
"start_line": 165
} | module Hacl.Impl.FFDHE
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Hacl.Impl.FFDHE.Constants
open Hacl.Bignum.Definitions
module ST = FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module S = Spec.FFDHE
module LSeq = Lib.Sequence
m... | {
"checked_file": "/",
"dependencies": [
"Spec.FFDHE.fst.checked",
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Buffer.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Li... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "SD"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Exponentiation",
"short_module": "SE"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "SM"
},
... | {
"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 |
t: Hacl.Bignum.Definitions.limb_t ->
a: Spec.FFDHE.ffdhe_alg ->
len: Hacl.Impl.FFDHE.size_pos ->
ke: Hacl.Bignum.Exponentiation.exp t
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Spec.FFDHE.ffdhe_alg",
"Hacl.Impl.FFDHE.size_pos",
"Hacl.Bignum.Exponentiation.exp",
"FStar.Monotonic.HyperHeap.rid",
"LowStar.Buffer.buffer",
"Hacl.Bignum.Definitions.limb",
"FStar.Monotonic.HyperStack.mem",
"Prims.l_and",
"FStar.HyperStack.ST.is_eternal_region"... | [] | false | false | false | false | true | let new_ffdhe_precomp_p_st (t: limb_t) (a: S.ffdhe_alg) (len: size_pos) (ke: BE.exp t) =
| let nLen = blocks len (size (numbytes t)) in
r: HS.rid
-> ST (B.buffer (limb t))
(requires fun h -> ST.is_eternal_region r /\ v len = S.ffdhe_len a /\ ke.BE.bn.BN.len == nLen)
(ensures
fun h0 res h1 ->
B.(modifies loc_none h0 h1) /\ not (B.g_is_null res) ==>
(B.len res == nLen ... | false | |
Printers.fst | Printers.maplast | val maplast (f: ('a -> 'a)) (l: list 'a) : list 'a | val maplast (f: ('a -> 'a)) (l: list 'a) : list 'a | let rec maplast (f : 'a -> 'a) (l : list 'a) : list 'a =
match l with
| [] -> []
| [x] -> [f x]
| x::xs -> x :: (maplast f xs) | {
"file_name": "examples/tactics/Printers.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 118,
"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.Tactics.V2.Derived.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Util",
"short_module": "TU"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2.Derived",
"short_module": "TD"
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
... | {
"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) -> l: Prims.list 'a -> Prims.list 'a | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"Prims.Nil",
"Prims.Cons",
"Printers.maplast"
] | [
"recursion"
] | false | false | false | true | false | let rec maplast (f: ('a -> 'a)) (l: list 'a) : list 'a =
| match l with
| [] -> []
| [x] -> [f x]
| x :: xs -> x :: (maplast f xs) | false |
Hacl.Impl.FFDHE.fst | Hacl.Impl.FFDHE.new_ffdhe_precomp_p | val new_ffdhe_precomp_p:
#t:limb_t
-> a:S.ffdhe_alg
-> len:size_pos
-> ke:BE.exp t
-> ffdhe_precomp_p:ffdhe_precomp_p_st t a len ke ->
new_ffdhe_precomp_p_st t a len ke | val new_ffdhe_precomp_p:
#t:limb_t
-> a:S.ffdhe_alg
-> len:size_pos
-> ke:BE.exp t
-> ffdhe_precomp_p:ffdhe_precomp_p_st t a len ke ->
new_ffdhe_precomp_p_st t a len ke | let new_ffdhe_precomp_p #t a len ke ffdhe_precomp_p r =
let h0 = ST.get () in
let nLen = blocks len (size (numbytes t)) in
assert (v (nLen +! nLen) > 0);
let res = LowStar.Monotonic.Buffer.mmalloc_partial r (uint #t #SEC 0) (nLen +! nLen) in
if B.is_null res then
res
else
let h1 = ST.get () in
B... | {
"file_name": "code/ffdhe/Hacl.Impl.FFDHE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 7,
"end_line": 208,
"start_col": 0,
"start_line": 191
} | module Hacl.Impl.FFDHE
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Hacl.Impl.FFDHE.Constants
open Hacl.Bignum.Definitions
module ST = FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module S = Spec.FFDHE
module LSeq = Lib.Sequence
m... | {
"checked_file": "/",
"dependencies": [
"Spec.FFDHE.fst.checked",
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Buffer.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Li... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "SD"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Exponentiation",
"short_module": "SE"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "SM"
},
... | {
"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.FFDHE.ffdhe_alg ->
len: Hacl.Impl.FFDHE.size_pos ->
ke: Hacl.Bignum.Exponentiation.exp t ->
ffdhe_precomp_p: Hacl.Impl.FFDHE.ffdhe_precomp_p_st t a len ke
-> Hacl.Impl.FFDHE.new_ffdhe_precomp_p_st t a len ke | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Spec.FFDHE.ffdhe_alg",
"Hacl.Impl.FFDHE.size_pos",
"Hacl.Bignum.Exponentiation.exp",
"Hacl.Impl.FFDHE.ffdhe_precomp_p_st",
"FStar.Monotonic.HyperHeap.rid",
"LowStar.Buffer.buffer",
"Hacl.Bignum.Definitions.limb",
"Prims.bool",
"Prims.unit",
"LowStar.Monotonic.B... | [] | false | false | false | false | false | let new_ffdhe_precomp_p #t a len ke ffdhe_precomp_p r =
| let h0 = ST.get () in
let nLen = blocks len (size (numbytes t)) in
assert (v (nLen +! nLen) > 0);
let res = LowStar.Monotonic.Buffer.mmalloc_partial r (uint #t #SEC 0) (nLen +! nLen) in
if B.is_null res
then res
else
let h1 = ST.get () in
(let open B in modifies_only_not_unused_in loc_none h0 h1);
assert (B.len r... | false |
TwoLockQueue.fst | TwoLockQueue.elim_pure | val elim_pure: #p: prop -> #u: _ -> Prims.unit
-> SteelGhost unit u (pure p) (fun _ -> emp) (requires fun _ -> True) (ensures fun _ _ _ -> p) | val elim_pure: #p: prop -> #u: _ -> Prims.unit
-> SteelGhost unit u (pure p) (fun _ -> emp) (requires fun _ -> True) (ensures fun _ _ _ -> p) | let elim_pure (#p:prop) #u ()
: SteelGhost unit u
(pure p) (fun _ -> emp)
(requires fun _ -> True)
(ensures fun _ _ _ -> p)
= let _ = Steel.Effect.Atomic.elim_pure p in () | {
"file_name": "share/steel/examples/steel/TwoLockQueue.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 49,
"end_line": 65,
"start_col": 0,
"start_line": 60
} | module TwoLockQueue
open FStar.Ghost
open Steel.Memory
open Steel.Effect.Atomic
open Steel.Effect
open Steel.FractionalPermission
open Steel.Reference
open Steel.SpinLock
module L = FStar.List.Tot
module U = Steel.Utils
module Q = Queue
/// This module provides an implementation of Michael and Scott's two lock queue... | {
"checked_file": "/",
"dependencies": [
"Steel.Utils.fst.checked",
"Steel.SpinLock.fsti.checked",
"Steel.Reference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"Queue.fsti.check... | [
{
"abbrev": true,
"full_module": "Queue",
"short_module": "Q"
},
{
"abbrev": true,
"full_module": "Steel.Utils",
"short_module": "U"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Steel.SpinLock"... | {
"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.unit -> Steel.Effect.Atomic.SteelGhost Prims.unit | Steel.Effect.Atomic.SteelGhost | [] | [] | [
"Prims.prop",
"Steel.Memory.inames",
"Prims.unit",
"Steel.Effect.Atomic.elim_pure",
"Steel.Effect.Common.pure",
"Steel.Effect.Common.emp",
"Steel.Effect.Common.vprop",
"Steel.Effect.Common.rmem",
"Prims.l_True"
] | [] | false | true | false | false | false | let elim_pure (#p: prop) #u ()
: SteelGhost unit u (pure p) (fun _ -> emp) (requires fun _ -> True) (ensures fun _ _ _ -> p) =
| let _ = Steel.Effect.Atomic.elim_pure p in
() | false |
Hacl.Impl.FFDHE.fst | Hacl.Impl.FFDHE.ffdhe_secret_to_public_precomp_st | val ffdhe_secret_to_public_precomp_st : t: Hacl.Bignum.Definitions.limb_t ->
a: Spec.FFDHE.ffdhe_alg ->
len: Hacl.Impl.FFDHE.size_pos ->
ke: Hacl.Bignum.Exponentiation.exp t
-> Type0 | let ffdhe_secret_to_public_precomp_st (t:limb_t) (a:S.ffdhe_alg) (len:size_pos) (ke:BE.exp t) =
let nLen = blocks len (size (numbytes t)) in
p_r2_n:lbignum t (nLen +! nLen)
-> sk:lbuffer uint8 len
-> pk:lbuffer uint8 len ->
Stack unit
(requires fun h ->
live h sk /\ live h pk /\ live h p_r2_n /\
d... | {
"file_name": "code/ffdhe/Hacl.Impl.FFDHE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 62,
"end_line": 283,
"start_col": 0,
"start_line": 269
} | module Hacl.Impl.FFDHE
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Hacl.Impl.FFDHE.Constants
open Hacl.Bignum.Definitions
module ST = FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module S = Spec.FFDHE
module LSeq = Lib.Sequence
m... | {
"checked_file": "/",
"dependencies": [
"Spec.FFDHE.fst.checked",
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Buffer.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Li... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "SD"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Exponentiation",
"short_module": "SE"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "SM"
},
... | {
"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 |
t: Hacl.Bignum.Definitions.limb_t ->
a: Spec.FFDHE.ffdhe_alg ->
len: Hacl.Impl.FFDHE.size_pos ->
ke: Hacl.Bignum.Exponentiation.exp t
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Spec.FFDHE.ffdhe_alg",
"Hacl.Impl.FFDHE.size_pos",
"Hacl.Bignum.Exponentiation.exp",
"Hacl.Bignum.Definitions.lbignum",
"Lib.IntTypes.op_Plus_Bang",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"Prims.unit",
"FStar.Monot... | [] | false | false | false | false | true | let ffdhe_secret_to_public_precomp_st (t: limb_t) (a: S.ffdhe_alg) (len: size_pos) (ke: BE.exp t) =
| let nLen = blocks len (size (numbytes t)) in
p_r2_n: lbignum t (nLen +! nLen) -> sk: lbuffer uint8 len -> pk: lbuffer uint8 len
-> Stack unit
(requires
fun h ->
live h sk /\ live h pk /\ live h p_r2_n /\ disjoint sk pk /\ disjoint sk p_r2_n /\
disjoint pk p_r2_n /\ v len == S.ffdhe_l... | false | |
Vale.AES.X64.AESopt.fsti | Vale.AES.X64.AESopt.six_of | val six_of : a: Type0 -> Type0 | let six_of (a:Type0) = a & a & a & a & a & a | {
"file_name": "obj/Vale.AES.X64.AESopt.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 44,
"end_line": 62,
"start_col": 0,
"start_line": 62
} | module Vale.AES.X64.AESopt
open FStar.Mul
open Vale.Def.Prop_s
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.AES.AES_s
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
op... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsVector.fsti.checked",
"Vale.X64.InsMem.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Transformers.Transform",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64.AESGCM_expected_code",
"short_module": null
},
{
"abbrev... | {
"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: Type0 -> Type0 | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.Native.tuple6"
] | [] | false | false | false | true | true | let six_of (a: Type0) =
| a & a & a & a & a & a | false | |
Vale.AES.X64.AESopt.fsti | Vale.AES.X64.AESopt.quad32_6 | val quad32_6 : Type0 | let quad32_6 = six_of quad32 | {
"file_name": "obj/Vale.AES.X64.AESopt.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 28,
"end_line": 63,
"start_col": 0,
"start_line": 63
} | module Vale.AES.X64.AESopt
open FStar.Mul
open Vale.Def.Prop_s
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.AES.AES_s
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
op... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsVector.fsti.checked",
"Vale.X64.InsMem.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Transformers.Transform",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64.AESGCM_expected_code",
"short_module": null
},
{
"abbrev... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"Vale.AES.X64.AESopt.six_of",
"Vale.X64.Decls.quad32"
] | [] | false | false | false | true | true | let quad32_6 =
| six_of quad32 | false | |
Hacl.Impl.FFDHE.fst | Hacl.Impl.FFDHE.ffdhe_shared_secret_st | val ffdhe_shared_secret_st : t: Hacl.Bignum.Definitions.limb_t ->
a: Spec.FFDHE.ffdhe_alg ->
len: Hacl.Impl.FFDHE.size_pos ->
ke: Hacl.Bignum.Exponentiation.exp t
-> Type0 | let ffdhe_shared_secret_st (t:limb_t) (a:S.ffdhe_alg) (len:size_pos) (ke:BE.exp t) =
sk:lbuffer uint8 len
-> pk:lbuffer uint8 len
-> ss:lbuffer uint8 len ->
Stack (limb t)
(requires fun h ->
live h sk /\ live h pk /\ live h ss /\
disjoint sk pk /\ disjoint sk ss /\ disjoint pk ss /\
v len = S.f... | {
"file_name": "code/ffdhe/Hacl.Impl.FFDHE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 93,
"end_line": 460,
"start_col": 0,
"start_line": 446
} | module Hacl.Impl.FFDHE
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Hacl.Impl.FFDHE.Constants
open Hacl.Bignum.Definitions
module ST = FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module S = Spec.FFDHE
module LSeq = Lib.Sequence
m... | {
"checked_file": "/",
"dependencies": [
"Spec.FFDHE.fst.checked",
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.Buffer.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Li... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "SD"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Exponentiation",
"short_module": "SE"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "SM"
},
... | {
"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 |
t: Hacl.Bignum.Definitions.limb_t ->
a: Spec.FFDHE.ffdhe_alg ->
len: Hacl.Impl.FFDHE.size_pos ->
ke: Hacl.Bignum.Exponentiation.exp t
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Spec.FFDHE.ffdhe_alg",
"Hacl.Impl.FFDHE.size_pos",
"Hacl.Bignum.Exponentiation.exp",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"Hacl.Bignum.Definitions.limb",
"FStar.Monotonic.HyperStack.mem",
"Prims.l_and",
"Lib.Buffer.live",
"Lib.Buffer.MUT",
"Lib.Buffer.... | [] | false | false | false | false | true | let ffdhe_shared_secret_st (t: limb_t) (a: S.ffdhe_alg) (len: size_pos) (ke: BE.exp t) =
| sk: lbuffer uint8 len -> pk: lbuffer uint8 len -> ss: lbuffer uint8 len
-> Stack (limb t)
(requires
fun h ->
live h sk /\ live h pk /\ live h ss /\ disjoint sk pk /\ disjoint sk ss /\ disjoint pk ss /\
v len = S.ffdhe_len a /\ ke.BE.bn.BN.len == blocks len (size (numbytes t)) /\
... | false | |
Vale.AES.X64.AESopt.fsti | Vale.AES.X64.AESopt.map_six_of | val map_six_of (#a #b: Type0) (x: six_of a) (f: (a -> GTot b)) : GTot (six_of b) | val map_six_of (#a #b: Type0) (x: six_of a) (f: (a -> GTot b)) : GTot (six_of b) | let map_six_of (#a #b:Type0) (x:six_of a) (f:a -> GTot b) : GTot (six_of b) =
let (x0, x1, x2, x3, x4, x5) = x in
(f x0, f x1, f x2, f x3, f x4, f x5) | {
"file_name": "obj/Vale.AES.X64.AESopt.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 38,
"end_line": 69,
"start_col": 7,
"start_line": 67
} | module Vale.AES.X64.AESopt
open FStar.Mul
open Vale.Def.Prop_s
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.AES.AES_s
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
op... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsVector.fsti.checked",
"Vale.X64.InsMem.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Transformers.Transform",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64.AESGCM_expected_code",
"short_module": null
},
{
"abbrev... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Vale.AES.X64.AESopt.six_of a -> f: (_: a -> Prims.GTot b)
-> Prims.GTot (Vale.AES.X64.AESopt.six_of b) | Prims.GTot | [
"sometrivial"
] | [] | [
"Vale.AES.X64.AESopt.six_of",
"FStar.Pervasives.Native.Mktuple6"
] | [] | false | false | false | false | false | let map_six_of (#a #b: Type0) (x: six_of a) (f: (a -> GTot b)) : GTot (six_of b) =
| let x0, x1, x2, x3, x4, x5 = x in
(f x0, f x1, f x2, f x3, f x4, f x5) | false |
Vale.AES.X64.AESopt.fsti | Vale.AES.X64.AESopt.make_six_of | val make_six_of (#a: Type0) (f: (n: nat{n < 6} -> GTot a)) : GTot (six_of a) | val make_six_of (#a: Type0) (f: (n: nat{n < 6} -> GTot a)) : GTot (six_of a) | let make_six_of (#a:Type0) (f:(n:nat{n < 6}) -> GTot a) : GTot (six_of a) =
(f 0, f 1, f 2, f 3, f 4, f 5) | {
"file_name": "obj/Vale.AES.X64.AESopt.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 32,
"end_line": 66,
"start_col": 7,
"start_line": 65
} | module Vale.AES.X64.AESopt
open FStar.Mul
open Vale.Def.Prop_s
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.AES.AES_s
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
op... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsVector.fsti.checked",
"Vale.X64.InsMem.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Transformers.Transform",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64.AESGCM_expected_code",
"short_module": null
},
{
"abbrev... | {
"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 | f: (n: Prims.nat{n < 6} -> Prims.GTot a) -> Prims.GTot (Vale.AES.X64.AESopt.six_of a) | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Pervasives.Native.Mktuple6",
"Vale.AES.X64.AESopt.six_of"
] | [] | false | false | false | false | false | let make_six_of (#a: Type0) (f: (n: nat{n < 6} -> GTot a)) : GTot (six_of a) =
| (f 0, f 1, f 2, f 3, f 4, f 5) | false |
Vale.AES.X64.AESopt.fsti | Vale.AES.X64.AESopt.rounds_opaque_6 | val rounds_opaque_6 (init: quad32_6) (round_keys: seq quad32) (rnd: nat{rnd < length round_keys})
: GTot quad32_6 | val rounds_opaque_6 (init: quad32_6) (round_keys: seq quad32) (rnd: nat{rnd < length round_keys})
: GTot quad32_6 | let rounds_opaque_6 (init:quad32_6) (round_keys:seq quad32) (rnd:nat{rnd < length round_keys}) : GTot quad32_6 =
map_six_of init (fun x -> eval_rounds x round_keys rnd) | {
"file_name": "obj/Vale.AES.X64.AESopt.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 57,
"end_line": 76,
"start_col": 0,
"start_line": 75
} | module Vale.AES.X64.AESopt
open FStar.Mul
open Vale.Def.Prop_s
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.AES.AES_s
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
op... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsVector.fsti.checked",
"Vale.X64.InsMem.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Transformers.Transform",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64.AESGCM_expected_code",
"short_module": null
},
{
"abbrev... | {
"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 |
init: Vale.AES.X64.AESopt.quad32_6 ->
round_keys: FStar.Seq.Base.seq Vale.X64.Decls.quad32 ->
rnd: Prims.nat{rnd < FStar.Seq.Base.length round_keys}
-> Prims.GTot Vale.AES.X64.AESopt.quad32_6 | Prims.GTot | [
"sometrivial"
] | [] | [
"Vale.AES.X64.AESopt.quad32_6",
"FStar.Seq.Base.seq",
"Vale.X64.Decls.quad32",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Seq.Base.length",
"Vale.AES.X64.AESopt.map_six_of",
"Vale.Def.Types_s.quad32",
"Vale.AES.AES_s.eval_rounds"
] | [] | false | false | false | false | false | let rounds_opaque_6 (init: quad32_6) (round_keys: seq quad32) (rnd: nat{rnd < length round_keys})
: GTot quad32_6 =
| map_six_of init (fun x -> eval_rounds x round_keys rnd) | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.