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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.rounds | val rounds : a: Spec.Blake2.Definitions.alg -> Prims.int | let rounds (a:alg) =
match a with
| Blake2S -> 10
| Blake2B -> 12 | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 17,
"end_line": 27,
"start_col": 0,
"start_line": 24
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.Blake2.Definitions.alg -> Prims.int | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Prims.int"
] | [] | false | false | false | true | false | let rounds (a: alg) =
| match a with
| Blake2S -> 10
| Blake2B -> 12 | false | |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.size_hash_w | val size_hash_w:size_nat | val size_hash_w:size_nat | let size_hash_w : size_nat = 8 | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 52,
"end_line": 30,
"start_col": 22,
"start_line": 30
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | n: Prims.nat{n <= Prims.pow2 32 - 1} | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | false | false | let size_hash_w:size_nat =
| 8 | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.size_block_w | val size_block_w:size_nat | val size_block_w:size_nat | let size_block_w : size_nat = 16 | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 54,
"end_line": 31,
"start_col": 22,
"start_line": 31
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | n: Prims.nat{n <= Prims.pow2 32 - 1} | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | false | false | let size_block_w:size_nat =
| 16 | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.size_word | val size_word (a: alg) : size_nat | val size_word (a: alg) : size_nat | let size_word (a:alg) : size_nat = numbytes (wt a) | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 72,
"end_line": 32,
"start_col": 22,
"start_line": 32
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.Blake2.Definitions.alg -> Lib.IntTypes.size_nat | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Lib.IntTypes.numbytes",
"Spec.Blake2.Definitions.wt",
"Lib.IntTypes.size_nat"
] | [] | false | false | false | true | false | let size_word (a: alg) : size_nat =
| numbytes (wt a) | false |
LowParse.Spec.List.fst | LowParse.Spec.List.tot_parse_list | val tot_parse_list
(#k: parser_kind)
(#t: Type)
(p: tot_parser k t)
: Pure (tot_parser parse_list_kind (list t))
(requires True)
(ensures (fun y ->
forall x . parse y x == parse (parse_list #k p) x
)) | val tot_parse_list
(#k: parser_kind)
(#t: Type)
(p: tot_parser k t)
: Pure (tot_parser parse_list_kind (list t))
(requires True)
(ensures (fun y ->
forall x . parse y x == parse (parse_list #k p) x
)) | let tot_parse_list #k #t p =
parser_kind_prop_ext parse_list_kind (parse_list #k p) (tot_parse_list_aux p);
tot_parse_list_aux p | {
"file_name": "src/lowparse/LowParse.Spec.List.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 22,
"end_line": 131,
"start_col": 0,
"start_line": 129
} | module LowParse.Spec.List
include LowParse.Spec.Combinators // for seq_slice_append_l
module Seq = FStar.Seq
module L = FStar.List.Tot
module U32 = FStar.UInt32
module Classical = FStar.Classical
(* Parse a list, until there is nothing left to read. This parser will mostly fail EXCEPT if the whole size is known and t... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.List.Tot.fst.c... | [
{
"abbrev": true,
"full_module": "FStar.Classical",
"short_module": "Classical"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: LowParse.Spec.Base.tot_parser k t
-> Prims.Pure (LowParse.Spec.Base.tot_parser LowParse.Spec.List.parse_list_kind (Prims.list t)) | Prims.Pure | [] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.tot_parser",
"LowParse.Spec.List.tot_parse_list_aux",
"Prims.unit",
"LowParse.Spec.Base.parser_kind_prop_ext",
"Prims.list",
"LowParse.Spec.List.parse_list_kind",
"LowParse.Spec.List.parse_list"
] | [] | false | false | false | false | false | let tot_parse_list #k #t p =
| parser_kind_prop_ext parse_list_kind (parse_list #k p) (tot_parse_list_aux p);
tot_parse_list_aux p | false |
LowParse.Spec.List.fst | LowParse.Spec.List.serialize_list_cons_upd_chain | val serialize_list_cons_upd_chain
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(x: t)
(l2: list t)
(y: t)
(i' : nat)
(s' : bytes)
: Lemma
(requires (
let sx = serialize s x in
serialize_list_precond k /\
i' + Seq.length s' <= Seq.length sx /\
serialize s y == seq_u... | val serialize_list_cons_upd_chain
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(x: t)
(l2: list t)
(y: t)
(i' : nat)
(s' : bytes)
: Lemma
(requires (
let sx = serialize s x in
serialize_list_precond k /\
i' + Seq.length s' <= Seq.length sx /\
serialize s y == seq_u... | let serialize_list_cons_upd_chain
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(x: t)
(l2: list t)
(y: t)
(i' : nat)
(s' : bytes)
: Lemma
(requires (
let sx = serialize s x in
serialize_list_precond k /\
i' + Seq.length s' <= Seq.length sx /\
serialize s y == seq_u... | {
"file_name": "src/lowparse/LowParse.Spec.List.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 44,
"end_line": 265,
"start_col": 0,
"start_line": 240
} | module LowParse.Spec.List
include LowParse.Spec.Combinators // for seq_slice_append_l
module Seq = FStar.Seq
module L = FStar.List.Tot
module U32 = FStar.UInt32
module Classical = FStar.Classical
(* Parse a list, until there is nothing left to read. This parser will mostly fail EXCEPT if the whole size is known and t... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.List.Tot.fst.c... | [
{
"abbrev": true,
"full_module": "FStar.Classical",
"short_module": "Classical"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
s: LowParse.Spec.Base.serializer p ->
x: t ->
l2: Prims.list t ->
y: t ->
i': Prims.nat ->
s': LowParse.Bytes.bytes
-> FStar.Pervasives.Lemma
(requires
(let sx = LowParse.Spec.Base.serialize s x in
LowParse.Spec.List.serialize_list_precond k /\
i' + FStar.Seq... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"Prims.list",
"Prims.nat",
"LowParse.Bytes.bytes",
"LowParse.Spec.List.serialize_list_upd_chain",
"Prims.Nil",
"Prims.unit",
"Prims.l_and",
"Prims.b2t",
"LowParse.Spec.List.serialize_list_precond",
... | [] | true | false | true | false | false | let serialize_list_cons_upd_chain
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(x: t)
(l2: list t)
(y: t)
(i': nat)
(s': bytes)
: Lemma
(requires
(let sx = serialize s x in
serialize_list_precond k /\ i' + Seq.length s'... | serialize_list_upd_chain s [] x l2 y i' s' | false |
LowParse.Spec.List.fst | LowParse.Spec.List.serialize_list_append | val serialize_list_append
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(s: serializer p)
(l1 l2: list t)
: Lemma
(requires (serialize_list_precond k))
(ensures (serialize (serialize_list p s) (L.append l1 l2) == Seq.append (serialize (serialize_list p s) l1) (serialize (serialize_list p s) l2))) | val serialize_list_append
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(s: serializer p)
(l1 l2: list t)
: Lemma
(requires (serialize_list_precond k))
(ensures (serialize (serialize_list p s) (L.append l1 l2) == Seq.append (serialize (serialize_list p s) l1) (serialize (serialize_list p s) l2))) | let rec serialize_list_append
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(s: serializer p)
(l1 l2: list t)
: Lemma
(requires (serialize_list_precond k))
(ensures (serialize (serialize_list p s) (L.append l1 l2) == Seq.append (serialize (serialize_list p s) l1) (serialize (serialize_list p s) l2)))
= mat... | {
"file_name": "src/lowparse/LowParse.Spec.List.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 58,
"end_line": 235,
"start_col": 0,
"start_line": 221
} | module LowParse.Spec.List
include LowParse.Spec.Combinators // for seq_slice_append_l
module Seq = FStar.Seq
module L = FStar.List.Tot
module U32 = FStar.UInt32
module Classical = FStar.Classical
(* Parse a list, until there is nothing left to read. This parser will mostly fail EXCEPT if the whole size is known and t... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.List.Tot.fst.c... | [
{
"abbrev": true,
"full_module": "FStar.Classical",
"short_module": "Classical"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
p: LowParse.Spec.Base.parser k t ->
s: LowParse.Spec.Base.serializer p ->
l1: Prims.list t ->
l2: Prims.list t
-> FStar.Pervasives.Lemma (requires LowParse.Spec.List.serialize_list_precond k)
(ensures
LowParse.Spec.Base.serialize (LowParse.Spec.List.serialize_list p s) (l1 @ l2) ==
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"Prims.list",
"FStar.Seq.Base.append_assoc",
"LowParse.Bytes.byte",
"LowParse.Spec.Base.serialize",
"LowParse.Spec.List.parse_list_kind",
"LowParse.Spec.List.parse_list",
"LowParse.Spec.List.serialize_l... | [
"recursion"
] | false | false | true | false | false | let rec serialize_list_append
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(s: serializer p)
(l1 l2: list t)
: Lemma (requires (serialize_list_precond k))
(ensures
(serialize (serialize_list p s) (L.append l1 l2) ==
Seq.append (serialize (serialize_list p s) l1)... | match l1 with
| a :: q ->
serialize_list_append p s q l2;
Seq.append_assoc (serialize s a)
(serialize (serialize_list p s) q)
(serialize (serialize_list p s) l2)
| [] -> Seq.append_empty_l (serialize (serialize_list p s) l2) | false |
LowParse.Spec.List.fst | LowParse.Spec.List.serialize_list_singleton | val serialize_list_singleton
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(s: serializer p)
(a: t)
: Lemma
(requires (serialize_list_precond k))
(ensures (serialize (serialize_list p s) [a] == serialize s a)) | val serialize_list_singleton
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(s: serializer p)
(a: t)
: Lemma
(requires (serialize_list_precond k))
(ensures (serialize (serialize_list p s) [a] == serialize s a)) | let serialize_list_singleton
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(s: serializer p)
(a: t)
: Lemma
(requires (serialize_list_precond k))
(ensures (serialize (serialize_list p s) [a] == serialize s a))
= Seq.append_empty_r (serialize s a) | {
"file_name": "src/lowparse/LowParse.Spec.List.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 36,
"end_line": 219,
"start_col": 0,
"start_line": 210
} | module LowParse.Spec.List
include LowParse.Spec.Combinators // for seq_slice_append_l
module Seq = FStar.Seq
module L = FStar.List.Tot
module U32 = FStar.UInt32
module Classical = FStar.Classical
(* Parse a list, until there is nothing left to read. This parser will mostly fail EXCEPT if the whole size is known and t... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.List.Tot.fst.c... | [
{
"abbrev": true,
"full_module": "FStar.Classical",
"short_module": "Classical"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: LowParse.Spec.Base.parser k t -> s: LowParse.Spec.Base.serializer p -> a: t
-> FStar.Pervasives.Lemma (requires LowParse.Spec.List.serialize_list_precond k)
(ensures
LowParse.Spec.Base.serialize (LowParse.Spec.List.serialize_list p s) [a] ==
LowParse.Spec.Base.serialize s a) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"FStar.Seq.Base.append_empty_r",
"LowParse.Bytes.byte",
"LowParse.Spec.Base.serialize",
"Prims.unit",
"Prims.b2t",
"LowParse.Spec.List.serialize_list_precond",
"Prims.squash",
"Prims.eq2",
"LowParse... | [] | true | false | true | false | false | let serialize_list_singleton (#k: parser_kind) (#t: Type) (p: parser k t) (s: serializer p) (a: t)
: Lemma (requires (serialize_list_precond k))
(ensures (serialize (serialize_list p s) [a] == serialize s a)) =
| Seq.append_empty_r (serialize s a) | false |
LowParse.Spec.List.fst | LowParse.Spec.List.serialize_list_snoc_upd_chain | val serialize_list_snoc_upd_chain
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(l1: list t)
(x: t)
(y: t)
(i' : nat)
(s' : bytes)
: Lemma
(requires (
let sx = serialize s x in
serialize_list_precond k /\
i' + Seq.length s' <= Seq.length sx /\
serialize s y == seq_u... | val serialize_list_snoc_upd_chain
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(l1: list t)
(x: t)
(y: t)
(i' : nat)
(s' : bytes)
: Lemma
(requires (
let sx = serialize s x in
serialize_list_precond k /\
i' + Seq.length s' <= Seq.length sx /\
serialize s y == seq_u... | let serialize_list_snoc_upd_chain
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(l1: list t)
(x: t)
(y: t)
(i' : nat)
(s' : bytes)
: Lemma
(requires (
let sx = serialize s x in
serialize_list_precond k /\
i' + Seq.length s' <= Seq.length sx /\
serialize s y == seq_u... | {
"file_name": "src/lowparse/LowParse.Spec.List.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 44,
"end_line": 292,
"start_col": 0,
"start_line": 267
} | module LowParse.Spec.List
include LowParse.Spec.Combinators // for seq_slice_append_l
module Seq = FStar.Seq
module L = FStar.List.Tot
module U32 = FStar.UInt32
module Classical = FStar.Classical
(* Parse a list, until there is nothing left to read. This parser will mostly fail EXCEPT if the whole size is known and t... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.List.Tot.fst.c... | [
{
"abbrev": true,
"full_module": "FStar.Classical",
"short_module": "Classical"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
s: LowParse.Spec.Base.serializer p ->
l1: Prims.list t ->
x: t ->
y: t ->
i': Prims.nat ->
s': LowParse.Bytes.bytes
-> FStar.Pervasives.Lemma
(requires
(let sx = LowParse.Spec.Base.serialize s x in
LowParse.Spec.List.serialize_list_precond k /\
i' + FStar.Seq... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"Prims.list",
"Prims.nat",
"LowParse.Bytes.bytes",
"LowParse.Spec.List.serialize_list_upd_chain",
"Prims.Nil",
"Prims.unit",
"Prims.l_and",
"Prims.b2t",
"LowParse.Spec.List.serialize_list_precond",
... | [] | true | false | true | false | false | let serialize_list_snoc_upd_chain
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(l1: list t)
(x y: t)
(i': nat)
(s': bytes)
: Lemma
(requires
(let sx = serialize s x in
serialize_list_precond k /\ i' + Seq.length s' <= Seq.len... | serialize_list_upd_chain s l1 x [] y i' s' | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.get_blake2s_salt | val get_blake2s_salt : p: Spec.Blake2.Definitions.blake2s_params
-> Lib.Sequence.lseq (Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.SEC)
(Spec.Blake2.Definitions.salt_length Spec.Blake2.Definitions.Blake2S) | let get_blake2s_salt (p:blake2s_params) = p.salt | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 48,
"end_line": 124,
"start_col": 0,
"start_line": 124
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: Spec.Blake2.Definitions.blake2s_params
-> Lib.Sequence.lseq (Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.SEC)
(Spec.Blake2.Definitions.salt_length Spec.Blake2.Definitions.Blake2S) | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.blake2s_params",
"Spec.Blake2.Definitions.__proj__Mkblake2s_params__item__salt",
"Lib.Sequence.lseq",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Spec.Blake2.Definitions.salt_length",
"Spec.Blake2.Definitions.Blake2S"
] | [] | false | false | false | true | false | let get_blake2s_salt (p: blake2s_params) =
| p.salt | false | |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.get_blake2s_personal | val get_blake2s_personal : p: Spec.Blake2.Definitions.blake2s_params
-> Lib.Sequence.lseq (Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.SEC)
(Spec.Blake2.Definitions.personal_length Spec.Blake2.Definitions.Blake2S) | let get_blake2s_personal (p:blake2s_params) = p.personal | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 56,
"end_line": 127,
"start_col": 0,
"start_line": 127
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: Spec.Blake2.Definitions.blake2s_params
-> Lib.Sequence.lseq (Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.SEC)
(Spec.Blake2.Definitions.personal_length Spec.Blake2.Definitions.Blake2S) | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.blake2s_params",
"Spec.Blake2.Definitions.__proj__Mkblake2s_params__item__personal",
"Lib.Sequence.lseq",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Spec.Blake2.Definitions.personal_length",
"Spec.Blake2.Definitions.Blake2S"
] | [] | false | false | false | true | false | let get_blake2s_personal (p: blake2s_params) =
| p.personal | false | |
LowParse.Spec.List.fst | LowParse.Spec.List.list_length_constant_size_parser_correct | val list_length_constant_size_parser_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(b: bytes)
: Lemma
(requires (
k.parser_kind_high == Some k.parser_kind_low /\
Some? (parse (parse_list p) b)
))
(ensures (
let pb = parse (parse_list p) b in
Some? pb /\ (
let (Some (l, _)) = pb ... | val list_length_constant_size_parser_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(b: bytes)
: Lemma
(requires (
k.parser_kind_high == Some k.parser_kind_low /\
Some? (parse (parse_list p) b)
))
(ensures (
let pb = parse (parse_list p) b in
Some? pb /\ (
let (Some (l, _)) = pb ... | let rec list_length_constant_size_parser_correct #k #t p b =
parser_kind_prop_equiv k p;
let n = k.parser_kind_low in
if Seq.length b = 0
then ()
else begin
let (Some (_, consumed)) = parse p b in
assert ((consumed <: nat) == n);
assert (n > 0);
let b' : bytes = Seq.slice b n (Seq.length b) in... | {
"file_name": "src/lowparse/LowParse.Spec.List.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 5,
"end_line": 309,
"start_col": 0,
"start_line": 296
} | module LowParse.Spec.List
include LowParse.Spec.Combinators // for seq_slice_append_l
module Seq = FStar.Seq
module L = FStar.List.Tot
module U32 = FStar.UInt32
module Classical = FStar.Classical
(* Parse a list, until there is nothing left to read. This parser will mostly fail EXCEPT if the whole size is known and t... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.List.Tot.fst.c... | [
{
"abbrev": true,
"full_module": "FStar.Classical",
"short_module": "Classical"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: LowParse.Spec.Base.parser k t -> b: LowParse.Bytes.bytes
-> FStar.Pervasives.Lemma
(requires
Mkparser_kind'?.parser_kind_high k ==
FStar.Pervasives.Native.Some (Mkparser_kind'?.parser_kind_low k) /\
Some? (LowParse.Spec.Base.parse (LowParse.Spec.List.parse_list p) b))
(ensures
... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Bytes.bytes",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"LowParse.Bytes.byte",
"Prims.bool",
"LowParse.Spec.Base.consumed_length",
"Prims.list",
"FStar.Math.Lemmas.distributivity_add_left",
"FStar.List.To... | [
"recursion"
] | false | false | true | false | false | let rec list_length_constant_size_parser_correct #k #t p b =
| parser_kind_prop_equiv k p;
let n = k.parser_kind_low in
if Seq.length b = 0
then ()
else
let Some (_, consumed) = parse p b in
assert ((consumed <: nat) == n);
assert (n > 0);
let b':bytes = Seq.slice b n (Seq.length b) in
list_length_constant_size_parser_correct p b';
let Some (l', _) = parse (parse_list ... | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.max_output | val max_output : a: Spec.Blake2.Definitions.alg -> Prims.int | let max_output (a:alg) =
match a with
| Blake2S -> 32
| Blake2B -> 64 | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 17,
"end_line": 44,
"start_col": 22,
"start_line": 41
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.Blake2.Definitions.alg -> Prims.int | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Prims.int"
] | [] | false | false | false | true | false | let max_output (a: alg) =
| match a with
| Blake2S -> 32
| Blake2B -> 64 | false | |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.size_ivTable | val size_ivTable:size_nat | val size_ivTable:size_nat | let size_ivTable : size_nat = 8 | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 53,
"end_line": 34,
"start_col": 22,
"start_line": 34
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | n: Prims.nat{n <= Prims.pow2 32 - 1} | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | false | false | let size_ivTable:size_nat =
| 8 | false |
LowParse.Spec.List.fst | LowParse.Spec.List.parse_list_bare_injective | val parse_list_bare_injective
(#k: parser_kind)
(#t: Type)
(p: parser k t)
: Lemma
(ensures (injective (parse_list_bare p))) | val parse_list_bare_injective
(#k: parser_kind)
(#t: Type)
(p: parser k t)
: Lemma
(ensures (injective (parse_list_bare p))) | let parse_list_bare_injective
(#k: parser_kind)
(#t: Type)
(p: parser k t)
: Lemma
(ensures (injective (parse_list_bare p)))
= parser_kind_prop_equiv k p;
let f () : Lemma
(injective p)
= ()
in
let rec aux
(b1: bytes)
(b2: bytes)
: Lemma
(requires (injective_precond (parse_list_bare p)... | {
"file_name": "src/lowparse/LowParse.Spec.List.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 69,
"end_line": 51,
"start_col": 0,
"start_line": 13
} | module LowParse.Spec.List
include LowParse.Spec.Combinators // for seq_slice_append_l
module Seq = FStar.Seq
module L = FStar.List.Tot
module U32 = FStar.UInt32
module Classical = FStar.Classical
(* Parse a list, until there is nothing left to read. This parser will mostly fail EXCEPT if the whole size is known and t... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.List.Tot.fst.c... | [
{
"abbrev": true,
"full_module": "FStar.Classical",
"short_module": "Classical"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: LowParse.Spec.Base.parser k t
-> FStar.Pervasives.Lemma
(ensures LowParse.Spec.Base.injective (LowParse.Spec.List.parse_list_bare p)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"FStar.Classical.forall_intro_2",
"LowParse.Bytes.bytes",
"Prims.l_imp",
"LowParse.Spec.Base.injective_precond",
"Prims.list",
"LowParse.Spec.List.parse_list_bare",
"LowParse.Spec.Base.injective_postcond",
"FStar.Classical.move_require... | [] | false | false | true | false | false | let parse_list_bare_injective (#k: parser_kind) (#t: Type) (p: parser k t)
: Lemma (ensures (injective (parse_list_bare p))) =
| parser_kind_prop_equiv k p;
let f () : Lemma (injective p) = () in
let rec aux (b1 b2: bytes)
: Lemma (requires (injective_precond (parse_list_bare p) b1 b2))
(ensures (injective_postcond (parse_list_bare p) b1 b2))
(decreases (Seq.length b1 + Seq.length b2)) =
if Seq.length b1 = 0
then ()
else
... | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.max_key | val max_key : a: Spec.Blake2.Definitions.alg -> Prims.int | let max_key (a:alg) =
match a with
| Blake2S -> 32
| Blake2B -> 64 | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 17,
"end_line": 40,
"start_col": 22,
"start_line": 37
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.Blake2.Definitions.alg -> Prims.int | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Prims.int"
] | [] | false | false | false | true | false | let max_key (a: alg) =
| match a with
| Blake2S -> 32
| Blake2B -> 64 | false | |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.size_block | val size_block (a: alg) : size_nat | val size_block (a: alg) : size_nat | let size_block (a:alg) : size_nat = size_block_w * (size_word a) | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 86,
"end_line": 33,
"start_col": 22,
"start_line": 33
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.Blake2.Definitions.alg -> Lib.IntTypes.size_nat | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"FStar.Mul.op_Star",
"Spec.Blake2.Definitions.size_block_w",
"Spec.Blake2.Definitions.size_word",
"Lib.IntTypes.size_nat"
] | [] | false | false | false | true | false | let size_block (a: alg) : size_nat =
| size_block_w * (size_word a) | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.size_sigmaTable | val size_sigmaTable:size_nat | val size_sigmaTable:size_nat | let size_sigmaTable : size_nat = 160 | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 58,
"end_line": 35,
"start_col": 22,
"start_line": 35
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | n: Prims.nat{n <= Prims.pow2 32 - 1} | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | false | false | let size_sigmaTable:size_nat =
| 160 | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.max_limb | val max_limb : a: Spec.Blake2.Definitions.alg -> Prims.int | let max_limb (a:alg) = maxint (limb_inttype a) | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 46,
"end_line": 223,
"start_col": 0,
"start_line": 223
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.Blake2.Definitions.alg -> Prims.int | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Lib.IntTypes.maxint",
"Spec.Blake2.Definitions.limb_inttype",
"Prims.int"
] | [] | false | false | false | true | false | let max_limb (a: alg) =
| maxint (limb_inttype a) | false | |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.row_idx | val row_idx : Type0 | let row_idx = n:nat {n < 4} | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 27,
"end_line": 261,
"start_col": 0,
"start_line": 261
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan"
] | [] | false | false | false | true | true | let row_idx =
| n: nat{n < 4} | false | |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.limb_inttype | val limb_inttype : a: Spec.Blake2.Definitions.alg -> Lib.IntTypes.inttype | let limb_inttype (a:alg) =
match (wt a) with
| U32 -> U64
| U64 -> U128 | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 15,
"end_line": 52,
"start_col": 7,
"start_line": 49
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.Blake2.Definitions.alg -> Lib.IntTypes.inttype | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Spec.Blake2.Definitions.wt",
"Lib.IntTypes.U64",
"Lib.IntTypes.U128",
"Lib.IntTypes.inttype"
] | [] | false | false | false | true | false | let limb_inttype (a: alg) =
| match (wt a) with
| U32 -> U64
| U64 -> U128 | false | |
LowParse.Spec.List.fst | LowParse.Spec.List.bare_serialize_list_correct | val bare_serialize_list_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(s: serializer p)
: Lemma
(requires (serialize_list_precond k))
(ensures (serializer_correct (parse_list p) (bare_serialize_list p s))) | val bare_serialize_list_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(s: serializer p)
: Lemma
(requires (serialize_list_precond k))
(ensures (serializer_correct (parse_list p) (bare_serialize_list p s))) | let bare_serialize_list_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(s: serializer p)
: Lemma
(requires (serialize_list_precond k))
(ensures (serializer_correct (parse_list p) (bare_serialize_list p s)))
= parser_kind_prop_equiv k p;
let f () : Lemma (serialize_list_precond k) = () in
let rec p... | {
"file_name": "src/lowparse/LowParse.Spec.List.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 28,
"end_line": 167,
"start_col": 0,
"start_line": 133
} | module LowParse.Spec.List
include LowParse.Spec.Combinators // for seq_slice_append_l
module Seq = FStar.Seq
module L = FStar.List.Tot
module U32 = FStar.UInt32
module Classical = FStar.Classical
(* Parse a list, until there is nothing left to read. This parser will mostly fail EXCEPT if the whole size is known and t... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.List.Tot.fst.c... | [
{
"abbrev": true,
"full_module": "FStar.Classical",
"short_module": "Classical"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: LowParse.Spec.Base.parser k t -> s: LowParse.Spec.Base.serializer p
-> FStar.Pervasives.Lemma (requires LowParse.Spec.List.serialize_list_precond k)
(ensures
LowParse.Spec.Base.serializer_correct (LowParse.Spec.List.parse_list p)
(LowParse.Spec.List.bare_serialize_list p s)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"FStar.Classical.forall_intro",
"Prims.list",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"FStar.Pervasives.Native.tuple2",
"LowParse.Spec.Base.consumed_length",
"LowParse.Spec.List.bare_serialize_li... | [] | false | false | true | false | false | let bare_serialize_list_correct (#k: parser_kind) (#t: Type) (p: parser k t) (s: serializer p)
: Lemma (requires (serialize_list_precond k))
(ensures (serializer_correct (parse_list p) (bare_serialize_list p s))) =
| parser_kind_prop_equiv k p;
let f () : Lemma (serialize_list_precond k) = () in
let rec prf (l: list t)
: Lemma
(parse (parse_list p) (bare_serialize_list p s l) ==
Some (l, Seq.length (bare_serialize_list p s l))) =
match l with
| [] -> ()
| a :: q ->
let pa = parse p (bare_serialize_list p s l... | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.personal_length | val personal_length (a: alg) : size_nat | val personal_length (a: alg) : size_nat | let personal_length (a:alg) : size_nat =
match a with
| Blake2S -> 8
| Blake2B -> 16 | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 17,
"end_line": 90,
"start_col": 0,
"start_line": 87
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.Blake2.Definitions.alg -> Lib.IntTypes.size_nat | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Lib.IntTypes.size_nat"
] | [] | false | false | false | true | false | let personal_length (a: alg) : size_nat =
| match a with
| Blake2S -> 8
| Blake2B -> 16 | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.state | val state : a: Spec.Blake2.Definitions.alg -> Type0 | let state (a:alg) = lseq (row a) 4 | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 41,
"end_line": 78,
"start_col": 7,
"start_line": 78
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.Blake2.Definitions.alg -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Lib.Sequence.lseq",
"Spec.Blake2.Definitions.row"
] | [] | false | false | false | true | true | let state (a: alg) =
| lseq (row a) 4 | false | |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.salt_length | val salt_length (a: alg) : size_nat | val salt_length (a: alg) : size_nat | let salt_length (a:alg) : size_nat =
match a with
| Blake2S -> 8
| Blake2B -> 16 | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 17,
"end_line": 84,
"start_col": 0,
"start_line": 81
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.Blake2.Definitions.alg -> Lib.IntTypes.size_nat | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Lib.IntTypes.size_nat"
] | [] | false | false | false | true | false | let salt_length (a: alg) : size_nat =
| match a with
| Blake2S -> 8
| Blake2B -> 16 | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.zero | val zero (a: alg) : word_t a | val zero (a: alg) : word_t a | let zero (a:alg) : word_t a=
match a with
| Blake2S -> u32 0
| Blake2B -> u64 0 | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 20,
"end_line": 61,
"start_col": 0,
"start_line": 58
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.Blake2.Definitions.alg -> Spec.Blake2.Definitions.word_t a | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Lib.IntTypes.u32",
"Lib.IntTypes.u64",
"Spec.Blake2.Definitions.word_t"
] | [] | false | false | false | false | false | let zero (a: alg) : word_t a =
| match a with
| Blake2S -> u32 0
| Blake2B -> u64 0 | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.zero_row | val zero_row (a: alg) : row a | val zero_row (a: alg) : row a | let zero_row (a:alg) : row a = create 4 (zero a) | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 48,
"end_line": 67,
"start_col": 0,
"start_line": 67
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.Blake2.Definitions.alg -> Spec.Blake2.Definitions.row a | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Lib.Sequence.create",
"Spec.Blake2.Definitions.word_t",
"Spec.Blake2.Definitions.zero",
"Spec.Blake2.Definitions.row"
] | [] | false | false | false | false | false | let zero_row (a: alg) : row a =
| create 4 (zero a) | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.set_blake2s_key_length | val set_blake2s_key_length (p: blake2s_params) (kk: size_nat{kk <= max_key Blake2S})
: blake2s_params | val set_blake2s_key_length (p: blake2s_params) (kk: size_nat{kk <= max_key Blake2S})
: blake2s_params | let set_blake2s_key_length
(p: blake2s_params)
(kk: size_nat{kk <= max_key Blake2S})
: blake2s_params =
{p with key_length = u8 kk} | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 29,
"end_line": 121,
"start_col": 0,
"start_line": 117
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
p: Spec.Blake2.Definitions.blake2s_params ->
kk: Lib.IntTypes.size_nat{kk <= Spec.Blake2.Definitions.max_key Spec.Blake2.Definitions.Blake2S}
-> Spec.Blake2.Definitions.blake2s_params | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.blake2s_params",
"Lib.IntTypes.size_nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Spec.Blake2.Definitions.max_key",
"Spec.Blake2.Definitions.Blake2S",
"Spec.Blake2.Definitions.Mkblake2s_params",
"Spec.Blake2.Definitions.__proj__Mkblake2s_params__item__digest_length",
"Lib.... | [] | false | false | false | false | false | let set_blake2s_key_length (p: blake2s_params) (kk: size_nat{kk <= max_key Blake2S})
: blake2s_params =
| { p with key_length = u8 kk } | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.get_salt | val get_salt (#a: alg) (p: blake2_params a) : lseq uint8 (salt_length a) | val get_salt (#a: alg) (p: blake2_params a) : lseq uint8 (salt_length a) | let get_salt (#a: alg) (p: blake2_params a) : lseq uint8 (salt_length a) =
match a with
| Blake2S -> get_blake2s_salt p
| Blake2B -> p.salt | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 21,
"end_line": 174,
"start_col": 0,
"start_line": 171
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: Spec.Blake2.Definitions.blake2_params a
-> Lib.Sequence.lseq Lib.IntTypes.uint8 (Spec.Blake2.Definitions.salt_length a) | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Spec.Blake2.Definitions.blake2_params",
"Spec.Blake2.Definitions.get_blake2s_salt",
"Spec.Blake2.Definitions.__proj__Mkblake2b_params__item__salt",
"Lib.Sequence.lseq",
"Lib.IntTypes.uint8",
"Spec.Blake2.Definitions.salt_length"
] | [] | false | false | false | false | false | let get_salt (#a: alg) (p: blake2_params a) : lseq uint8 (salt_length a) =
| match a with
| Blake2S -> get_blake2s_salt p
| Blake2B -> p.salt | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.get_personal | val get_personal (#a: alg) (p: blake2_params a) : lseq uint8 (personal_length a) | val get_personal (#a: alg) (p: blake2_params a) : lseq uint8 (personal_length a) | let get_personal (#a: alg) (p: blake2_params a) : lseq uint8 (personal_length a) =
match a with
| Blake2S -> get_blake2s_personal p
| Blake2B -> p.personal | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 25,
"end_line": 180,
"start_col": 0,
"start_line": 177
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: Spec.Blake2.Definitions.blake2_params a
-> Lib.Sequence.lseq Lib.IntTypes.uint8 (Spec.Blake2.Definitions.personal_length a) | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Spec.Blake2.Definitions.blake2_params",
"Spec.Blake2.Definitions.get_blake2s_personal",
"Spec.Blake2.Definitions.__proj__Mkblake2b_params__item__personal",
"Lib.Sequence.lseq",
"Lib.IntTypes.uint8",
"Spec.Blake2.Definitions.personal_length"
] | [] | false | false | false | false | false | let get_personal (#a: alg) (p: blake2_params a) : lseq uint8 (personal_length a) =
| match a with
| Blake2S -> get_blake2s_personal p
| Blake2B -> p.personal | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.set_blake2s_digest_length | val set_blake2s_digest_length
(p: blake2s_params)
(nn: size_nat{1 <= nn /\ nn <= max_output Blake2S})
: blake2s_params | val set_blake2s_digest_length
(p: blake2s_params)
(nn: size_nat{1 <= nn /\ nn <= max_output Blake2S})
: blake2s_params | let set_blake2s_digest_length
(p: blake2s_params)
(nn: size_nat{1 <= nn /\ nn <= max_output Blake2S})
: blake2s_params =
{p with digest_length = u8 nn} | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 32,
"end_line": 114,
"start_col": 0,
"start_line": 110
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
p: Spec.Blake2.Definitions.blake2s_params ->
nn:
Lib.IntTypes.size_nat
{1 <= nn /\ nn <= Spec.Blake2.Definitions.max_output Spec.Blake2.Definitions.Blake2S}
-> Spec.Blake2.Definitions.blake2s_params | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.blake2s_params",
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Spec.Blake2.Definitions.max_output",
"Spec.Blake2.Definitions.Blake2S",
"Spec.Blake2.Definitions.Mkblake2s_params",
"Lib.IntTypes.u8",
"Spec.Blake2.Definitions.__proj__Mkblak... | [] | false | false | false | false | false | let set_blake2s_digest_length
(p: blake2s_params)
(nn: size_nat{1 <= nn /\ nn <= max_output Blake2S})
: blake2s_params =
| { p with digest_length = u8 nn } | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.blake2_params | val blake2_params : a: Spec.Blake2.Definitions.alg -> Type0 | let blake2_params (a: alg) =
match a with
| Blake2S -> blake2s_params
| Blake2B -> blake2b_params | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 29,
"end_line": 150,
"start_col": 0,
"start_line": 147
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.Blake2.Definitions.alg -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Spec.Blake2.Definitions.blake2s_params",
"Spec.Blake2.Definitions.blake2b_params"
] | [] | false | false | false | true | true | let blake2_params (a: alg) =
| match a with
| Blake2S -> blake2s_params
| Blake2B -> blake2b_params | false | |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.row | val row : a: Spec.Blake2.Definitions.alg -> Type0 | let row (a:alg) = lseq (word_t a) 4 | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 42,
"end_line": 64,
"start_col": 7,
"start_line": 64
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.Blake2.Definitions.alg -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Lib.Sequence.lseq",
"Spec.Blake2.Definitions.word_t"
] | [] | false | false | false | true | true | let row (a: alg) =
| lseq (word_t a) 4 | false | |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.set_digest_length | val set_digest_length (#a: alg) (p: blake2_params a) (nn: size_nat{1 <= nn /\ nn <= max_output a})
: blake2_params a | val set_digest_length (#a: alg) (p: blake2_params a) (nn: size_nat{1 <= nn /\ nn <= max_output a})
: blake2_params a | let set_digest_length (#a: alg)
(p: blake2_params a)
(nn: size_nat{1 <= nn /\ nn <= max_output a})
: blake2_params a =
match a with
| Blake2S -> set_blake2s_digest_length p nn
| Blake2B -> {p with digest_length = u8 nn} | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 45,
"end_line": 159,
"start_col": 0,
"start_line": 153
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
p: Spec.Blake2.Definitions.blake2_params a ->
nn: Lib.IntTypes.size_nat{1 <= nn /\ nn <= Spec.Blake2.Definitions.max_output a}
-> Spec.Blake2.Definitions.blake2_params a | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Spec.Blake2.Definitions.blake2_params",
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Spec.Blake2.Definitions.max_output",
"Spec.Blake2.Definitions.set_blake2s_digest_length",
"Spec.Blake2.Definitions.Mkblake2b_params",
"Lib.IntTy... | [] | false | false | false | false | false | let set_digest_length (#a: alg) (p: blake2_params a) (nn: size_nat{1 <= nn /\ nn <= max_output a})
: blake2_params a =
| match a with
| Blake2S -> set_blake2s_digest_length p nn
| Blake2B -> { p with digest_length = u8 nn } | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.blake2_default_params | val blake2_default_params (a: alg) : blake2_params a | val blake2_default_params (a: alg) : blake2_params a | let blake2_default_params (a: alg) : blake2_params a =
match a with
| Blake2S -> blake2s_default_params
| Blake2B -> blake2b_default_params | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 37,
"end_line": 214,
"start_col": 0,
"start_line": 211
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.Blake2.Definitions.alg -> Spec.Blake2.Definitions.blake2_params a | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Spec.Blake2.Definitions.blake2s_default_params",
"Spec.Blake2.Definitions.blake2b_default_params",
"Spec.Blake2.Definitions.blake2_params"
] | [] | false | false | false | false | false | let blake2_default_params (a: alg) : blake2_params a =
| match a with
| Blake2S -> blake2s_default_params
| Blake2B -> blake2b_default_params | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.limb_to_word | val limb_to_word (a: alg) (x: limb_t a) : word_t a | val limb_to_word (a: alg) (x: limb_t a) : word_t a | let limb_to_word (a:alg) (x:limb_t a) : word_t a =
match (wt a) with
| U32 -> to_u32 x
| U64 -> to_u64 x | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 19,
"end_line": 249,
"start_col": 0,
"start_line": 246
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.Blake2.Definitions.alg -> x: Spec.Blake2.Definitions.limb_t a
-> Spec.Blake2.Definitions.word_t a | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Spec.Blake2.Definitions.limb_t",
"Spec.Blake2.Definitions.wt",
"Lib.IntTypes.to_u32",
"Spec.Blake2.Definitions.limb_inttype",
"Lib.IntTypes.SEC",
"Lib.IntTypes.to_u64",
"Spec.Blake2.Definitions.word_t"
] | [] | false | false | false | false | false | let limb_to_word (a: alg) (x: limb_t a) : word_t a =
| match (wt a) with
| U32 -> to_u32 x
| U64 -> to_u64 x | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.blake2b_default_params | val blake2b_default_params:blake2b_params | val blake2b_default_params:blake2b_params | let blake2b_default_params: blake2b_params =
{ digest_length = u8 64;
key_length = u8 0;
fanout = u8 1;
depth = u8 1;
leaf_length = u32 0;
node_offset = u32 0;
xof_length = u32 0;
node_depth = u8 0;
inner_length = u8 0;
salt = create 16 (u8 0);
personal = create 16 (u8 0);
} | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 208,
"start_col": 0,
"start_line": 196
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Spec.Blake2.Definitions.blake2b_params | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.Mkblake2b_params",
"Lib.IntTypes.u8",
"Lib.IntTypes.u32",
"Lib.Sequence.create",
"Lib.IntTypes.uint8"
] | [] | false | false | false | true | false | let blake2b_default_params:blake2b_params =
| {
digest_length = u8 64;
key_length = u8 0;
fanout = u8 1;
depth = u8 1;
leaf_length = u32 0;
node_offset = u32 0;
xof_length = u32 0;
node_depth = u8 0;
inner_length = u8 0;
salt = create 16 (u8 0);
personal = create 16 (u8 0)
} | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.set_key_length | val set_key_length (#a: alg) (p: blake2_params a) (kk: size_nat{kk <= max_key a}) : blake2_params a | val set_key_length (#a: alg) (p: blake2_params a) (kk: size_nat{kk <= max_key a}) : blake2_params a | let set_key_length (#a: alg)
(p: blake2_params a)
(kk: size_nat{kk <= max_key a})
: blake2_params a =
match a with
| Blake2S -> set_blake2s_key_length p kk
| Blake2B -> {p with key_length = u8 kk} | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 42,
"end_line": 168,
"start_col": 0,
"start_line": 162
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
p: Spec.Blake2.Definitions.blake2_params a ->
kk: Lib.IntTypes.size_nat{kk <= Spec.Blake2.Definitions.max_key a}
-> Spec.Blake2.Definitions.blake2_params a | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Spec.Blake2.Definitions.blake2_params",
"Lib.IntTypes.size_nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Spec.Blake2.Definitions.max_key",
"Spec.Blake2.Definitions.set_blake2s_key_length",
"Spec.Blake2.Definitions.Mkblake2b_params",
"Spec.Blake2.Definitions.__proj__... | [] | false | false | false | false | false | let set_key_length (#a: alg) (p: blake2_params a) (kk: size_nat{kk <= max_key a}) : blake2_params a =
| match a with
| Blake2S -> set_blake2s_key_length p kk
| Blake2B -> { p with key_length = u8 kk } | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.blake2s_default_params | val blake2s_default_params:blake2s_params | val blake2s_default_params:blake2s_params | let blake2s_default_params: blake2s_params =
{ digest_length = u8 32;
key_length = u8 0;
fanout = u8 1;
depth = u8 1;
leaf_length = u32 0;
node_offset = u32 0;
xof_length = u16 0;
node_depth = u8 0;
inner_length = u8 0;
salt = create 8 (u8 0);
personal = create 8 (u8 0);
} | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 194,
"start_col": 0,
"start_line": 182
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Spec.Blake2.Definitions.blake2s_params | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.Mkblake2s_params",
"Lib.IntTypes.u8",
"Lib.IntTypes.u32",
"Lib.IntTypes.u16",
"Lib.Sequence.create",
"Lib.IntTypes.uint8"
] | [] | false | false | false | true | false | let blake2s_default_params:blake2s_params =
| {
digest_length = u8 32;
key_length = u8 0;
fanout = u8 1;
depth = u8 1;
leaf_length = u32 0;
node_offset = u32 0;
xof_length = u16 0;
node_depth = u8 0;
inner_length = u8 0;
salt = create 8 (u8 0);
personal = create 8 (u8 0)
} | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.nat_to_word | val nat_to_word (a: alg) (x: size_nat) : word_t a | val nat_to_word (a: alg) (x: size_nat) : word_t a | let nat_to_word (a:alg) (x:size_nat) : word_t a =
match (wt a) with
| U32 -> u32 x
| U64 -> u64 x | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 229,
"start_col": 0,
"start_line": 226
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.Blake2.Definitions.alg -> x: Lib.IntTypes.size_nat -> Spec.Blake2.Definitions.word_t a | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Lib.IntTypes.size_nat",
"Spec.Blake2.Definitions.wt",
"Lib.IntTypes.u32",
"Lib.IntTypes.u64",
"Spec.Blake2.Definitions.word_t"
] | [] | false | false | false | false | false | let nat_to_word (a: alg) (x: size_nat) : word_t a =
| match (wt a) with
| U32 -> u32 x
| U64 -> u64 x | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.rtable_t | val rtable_t : a: Spec.Blake2.Definitions.alg -> Type0 | let rtable_t (a:alg) = lseq (rotval (wt a)) 4 | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 52,
"end_line": 251,
"start_col": 7,
"start_line": 251
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.Blake2.Definitions.alg -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Lib.Sequence.lseq",
"Lib.IntTypes.rotval",
"Spec.Blake2.Definitions.wt"
] | [] | false | false | false | true | true | let rtable_t (a: alg) =
| lseq (rotval (wt a)) 4 | false | |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.word_to_limb | val word_to_limb (a: alg) (x: word_t a {uint_v x <= max_limb a})
: xl: limb_t a {uint_v xl == uint_v x} | val word_to_limb (a: alg) (x: word_t a {uint_v x <= max_limb a})
: xl: limb_t a {uint_v xl == uint_v x} | let word_to_limb (a:alg) (x:word_t a{uint_v x <= max_limb a}) : xl:limb_t a{uint_v xl == uint_v x} =
match (wt a) with
| U32 -> to_u64 x
| U64 -> to_u128 x | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 20,
"end_line": 243,
"start_col": 0,
"start_line": 240
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
a: Spec.Blake2.Definitions.alg ->
x:
Spec.Blake2.Definitions.word_t a {Lib.IntTypes.uint_v x <= Spec.Blake2.Definitions.max_limb a}
-> xl: Spec.Blake2.Definitions.limb_t a {Lib.IntTypes.uint_v xl == Lib.IntTypes.uint_v x} | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Spec.Blake2.Definitions.word_t",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Lib.IntTypes.uint_v",
"Spec.Blake2.Definitions.wt",
"Lib.IntTypes.SEC",
"Spec.Blake2.Definitions.max_limb",
"Lib.IntTypes.to_u64",
"Lib.IntTypes.to_u128",
"Spec.Blake2.Definitions.limb_t",
... | [] | false | false | false | false | false | let word_to_limb (a: alg) (x: word_t a {uint_v x <= max_limb a})
: xl: limb_t a {uint_v xl == uint_v x} =
| match (wt a) with
| U32 -> to_u64 x
| U64 -> to_u128 x | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.rotr | val rotr (#a: alg) (r1: row a) (r: row_idx) : row a | val rotr (#a: alg) (r1: row a) (r: row_idx) : row a | let rotr (#a:alg) (r1:row a) (r:row_idx) : row a =
createi 4 (fun i -> r1.[(i+r)%4]) | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 35,
"end_line": 277,
"start_col": 0,
"start_line": 276
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r1: Spec.Blake2.Definitions.row a -> r: Spec.Blake2.Definitions.row_idx
-> Spec.Blake2.Definitions.row a | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Spec.Blake2.Definitions.row",
"Spec.Blake2.Definitions.row_idx",
"Lib.Sequence.createi",
"Spec.Blake2.Definitions.word_t",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.Sequence.op_String_Access",
"Prims.op_Modulus",
"Prims.op_Addition"
] | [] | false | false | false | false | false | let rotr (#a: alg) (r1: row a) (r: row_idx) : row a =
| createi 4 (fun i -> r1.[ (i + r) % 4 ]) | false |
Hacl.Impl.Frodo.KEM.Encaps.fst | Hacl.Impl.Frodo.KEM.Encaps.crypto_kem_enc0 | val crypto_kem_enc0:
a:FP.frodo_alg
-> gen_a:FP.frodo_gen_a{is_supported gen_a}
-> mu:lbytes (bytes_mu a)
-> ct:lbytes (crypto_ciphertextbytes a)
-> ss:lbytes (crypto_bytes a)
-> pk:lbytes (crypto_publickeybytes a)
-> seed_se_k:lbytes (2ul *! crypto_bytes a)
-> Stack unit
(requires fun h ->
... | val crypto_kem_enc0:
a:FP.frodo_alg
-> gen_a:FP.frodo_gen_a{is_supported gen_a}
-> mu:lbytes (bytes_mu a)
-> ct:lbytes (crypto_ciphertextbytes a)
-> ss:lbytes (crypto_bytes a)
-> pk:lbytes (crypto_publickeybytes a)
-> seed_se_k:lbytes (2ul *! crypto_bytes a)
-> Stack unit
(requires fun h ->
... | let crypto_kem_enc0 a gen_a mu ct ss pk seed_se_k =
crypto_kem_enc_seed_se_k a mu pk seed_se_k;
crypto_kem_enc_ct_ss a gen_a seed_se_k mu ct ss pk | {
"file_name": "code/frodo/Hacl.Impl.Frodo.KEM.Encaps.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 52,
"end_line": 388,
"start_col": 0,
"start_line": 386
} | module Hacl.Impl.Frodo.KEM.Encaps
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open LowStar.Buffer
open Lib.IntTypes
open Lib.Buffer
open Hacl.Impl.Matrix
open Hacl.Impl.Frodo.Params
open Hacl.Impl.Frodo.KEM
open Hacl.Impl.Frodo.Encode
open Hacl.Impl.Frodo.Pack
open Hacl.Impl.Frodo.Sample
open Hacl... | {
"checked_file": "/",
"dependencies": [
"Spec.Matrix.fst.checked",
"Spec.Frodo.Params.fst.checked",
"Spec.Frodo.KEM.Encaps.fst.checked",
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Frodo.KEM.KeyGen",
"short_module": "KG"
},
{
"abbrev": true,
"full_module": "Spec.Matrix",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.KEM.Encaps",
"short_module": "S"
},
{
"abbrev": true,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
a: Spec.Frodo.Params.frodo_alg ->
gen_a: Spec.Frodo.Params.frodo_gen_a{Hacl.Impl.Frodo.Params.is_supported gen_a} ->
mu: Hacl.Impl.Matrix.lbytes (Hacl.Impl.Frodo.Params.bytes_mu a) ->
ct: Hacl.Impl.Matrix.lbytes (Hacl.Impl.Frodo.Params.crypto_ciphertextbytes a) ->
ss: Hacl.Impl.Matrix.lbytes (Hacl.... | FStar.HyperStack.ST.Stack | [] | [] | [
"Spec.Frodo.Params.frodo_alg",
"Spec.Frodo.Params.frodo_gen_a",
"Prims.b2t",
"Hacl.Impl.Frodo.Params.is_supported",
"Hacl.Impl.Matrix.lbytes",
"Hacl.Impl.Frodo.Params.bytes_mu",
"Hacl.Impl.Frodo.Params.crypto_ciphertextbytes",
"Hacl.Impl.Frodo.Params.crypto_bytes",
"Hacl.Impl.Frodo.Params.crypto_pub... | [] | false | true | false | false | false | let crypto_kem_enc0 a gen_a mu ct ss pk seed_se_k =
| crypto_kem_enc_seed_se_k a mu pk seed_se_k;
crypto_kem_enc_ct_ss a gen_a seed_se_k mu ct ss pk | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.load_row | val load_row (#a: alg) (s: lseq (word_t a) 4) : row a | val load_row (#a: alg) (s: lseq (word_t a) 4) : row a | let load_row (#a:alg) (s:lseq (word_t a) 4) : row a =
createL [s.[0]; s.[1]; s.[2]; s.[3]] | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 38,
"end_line": 71,
"start_col": 0,
"start_line": 70
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: Lib.Sequence.lseq (Spec.Blake2.Definitions.word_t a) 4 -> Spec.Blake2.Definitions.row a | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Lib.Sequence.lseq",
"Spec.Blake2.Definitions.word_t",
"Lib.Sequence.createL",
"Prims.Cons",
"Lib.Sequence.op_String_Access",
"Prims.Nil",
"Spec.Blake2.Definitions.row"
] | [] | false | false | false | false | false | let load_row (#a: alg) (s: lseq (word_t a) 4) : row a =
| createL [s.[ 0 ]; s.[ 1 ]; s.[ 2 ]; s.[ 3 ]] | false |
Vale.PPC64LE.Memory_Sems.fsti | Vale.PPC64LE.Memory_Sems.is_full_read | val is_full_read : h1: Vale.PPC64LE.Memory.vale_heap ->
h2: Vale.PPC64LE.Memory.vale_heap ->
b: Vale.PPC64LE.Memory.buffer t ->
i: Prims.int
-> Prims.logical | let is_full_read (#t:base_typ) (h1 h2:vale_heap) (b:buffer t) (i:int) =
buffer_addr b h1 == buffer_addr b h2 /\
buffer_read b i h1 == buffer_read b i h2 /\
valid_buffer_read h1 b i | {
"file_name": "vale/code/arch/ppc64le/Vale.PPC64LE.Memory_Sems.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 26,
"end_line": 48,
"start_col": 0,
"start_line": 45
} | module Vale.PPC64LE.Memory_Sems
open FStar.Mul
open Vale.Def.Prop_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Arch.Heap
open Vale.Arch.MachineHeap_s
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.Memory
open Vale.Lib.Seqs
module S = Vale.PPC64LE.Semantics_s
module Map16 = Vale.Lib.Map... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.Semantics_s.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.Lib.Seqs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale... | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.PPC64LE.Semantics_s",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Vale.Lib.Seqs",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"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 |
h1: Vale.PPC64LE.Memory.vale_heap ->
h2: Vale.PPC64LE.Memory.vale_heap ->
b: Vale.PPC64LE.Memory.buffer t ->
i: Prims.int
-> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Vale.Arch.HeapTypes_s.base_typ",
"Vale.PPC64LE.Memory.vale_heap",
"Vale.PPC64LE.Memory.buffer",
"Prims.int",
"Prims.l_and",
"Prims.eq2",
"Vale.PPC64LE.Memory.buffer_addr",
"Vale.PPC64LE.Memory.base_typ_as_vale_type",
"Vale.PPC64LE.Memory.buffer_read",
"Vale.PPC64LE.Memory.valid_buffer_read",
"P... | [] | false | false | false | false | true | let is_full_read (#t: base_typ) (h1 h2: vale_heap) (b: buffer t) (i: int) =
| buffer_addr b h1 == buffer_addr b h2 /\ buffer_read b i h1 == buffer_read b i h2 /\
valid_buffer_read h1 b i | false | |
Vale.PPC64LE.Memory_Sems.fsti | Vale.PPC64LE.Memory_Sems.coerce | val coerce (#b #a: Type) (x: a{a == b}) : b | val coerce (#b #a: Type) (x: a{a == b}) : b | let coerce (#b #a:Type) (x:a{a == b}) : b = x | {
"file_name": "vale/code/arch/ppc64le/Vale.PPC64LE.Memory_Sems.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 52,
"end_line": 33,
"start_col": 7,
"start_line": 33
} | module Vale.PPC64LE.Memory_Sems
open FStar.Mul
open Vale.Def.Prop_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Arch.Heap
open Vale.Arch.MachineHeap_s
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.Memory
open Vale.Lib.Seqs
module S = Vale.PPC64LE.Semantics_s
module Map16 = Vale.Lib.Map... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.Semantics_s.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.Lib.Seqs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale... | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.PPC64LE.Semantics_s",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Vale.Lib.Seqs",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: a{a == b} -> b | Prims.Tot | [
"total"
] | [] | [
"Prims.eq2"
] | [] | false | false | false | false | false | let coerce (#b #a: Type) (x: a{a == b}) : b =
| x | false |
Vale.PPC64LE.Memory_Sems.fsti | Vale.PPC64LE.Memory_Sems.is_full_update | val is_full_update : vfh: Vale.PPC64LE.Memory.vale_full_heap ->
h': Vale.PPC64LE.Memory.vale_heap ->
hid: Vale.PPC64LE.Memory.heaplet_id ->
mh': Vale.Arch.MachineHeap_s.machine_heap ->
mt': Vale.PPC64LE.Memory.memtaint
-> Prims.logical | let is_full_update (vfh:vale_full_heap) (h':vale_heap) (hid:heaplet_id) (mh':machine_heap) (mt':memtaint) =
is_machine_heap_update (heap_get (coerce vfh)) mh' /\ (
let vfh' = coerce (heap_upd (coerce vfh) mh' mt') in
mem_inv vfh' /\
vfh'.vf_layout == vfh.vf_layout /\
vfh'.vf_heaplets == Map16.upd vfh.... | {
"file_name": "vale/code/arch/ppc64le/Vale.PPC64LE.Memory_Sems.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 56,
"start_col": 0,
"start_line": 50
} | module Vale.PPC64LE.Memory_Sems
open FStar.Mul
open Vale.Def.Prop_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Arch.Heap
open Vale.Arch.MachineHeap_s
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.Memory
open Vale.Lib.Seqs
module S = Vale.PPC64LE.Semantics_s
module Map16 = Vale.Lib.Map... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.Semantics_s.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.Lib.Seqs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale... | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.PPC64LE.Semantics_s",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Vale.Lib.Seqs",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"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 |
vfh: Vale.PPC64LE.Memory.vale_full_heap ->
h': Vale.PPC64LE.Memory.vale_heap ->
hid: Vale.PPC64LE.Memory.heaplet_id ->
mh': Vale.Arch.MachineHeap_s.machine_heap ->
mt': Vale.PPC64LE.Memory.memtaint
-> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.Memory.vale_full_heap",
"Vale.PPC64LE.Memory.vale_heap",
"Vale.PPC64LE.Memory.heaplet_id",
"Vale.Arch.MachineHeap_s.machine_heap",
"Vale.PPC64LE.Memory.memtaint",
"Prims.l_and",
"Vale.Arch.MachineHeap_s.is_machine_heap_update",
"Vale.Arch.Heap.heap_get",
"Vale.PPC64LE.Memory_Sems.coerc... | [] | false | false | false | true | true | let is_full_update
(vfh: vale_full_heap)
(h': vale_heap)
(hid: heaplet_id)
(mh': machine_heap)
(mt': memtaint)
=
| is_machine_heap_update (heap_get (coerce vfh)) mh' /\
(let vfh' = coerce (heap_upd (coerce vfh) mh' mt') in
mem_inv vfh' /\ vfh'.vf_layout == vfh.vf_layout /\
vfh'.vf_heaplets == Map16.upd vfh.vf_heaplets hid h') | false | |
Rewrite.Monoid.fst | Rewrite.Monoid.is_reifiable | val is_reifiable (m_mult m_unit me: term) : Tac bool | val is_reifiable (m_mult m_unit me: term) : Tac bool | let is_reifiable (m_mult:term) (m_unit:term) (me:term) : Tac bool =
let hd, tl = collect_app_ref me in
match inspect hd with
| Tv_FVar fv ->
// if unify (pack (Tv_FVar fv)) (quote (Monoid?.mult m)) then -- doesn't work
let t1 = norm_term [delta;zeta;iota] (pack (Tv_FVar fv)) in
term_eq t1 m_mult... | {
"file_name": "examples/tactics/Rewrite.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 52,
"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": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.CanonMonoid.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pe... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonMonoid",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.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 |
m_mult: FStar.Tactics.NamedView.term ->
m_unit: FStar.Tactics.NamedView.term ->
me: FStar.Tactics.NamedView.term
-> FStar.Tactics.Effect.Tac Prims.bool | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.NamedView.term",
"FStar.Stubs.Reflection.Types.term",
"Prims.l_or",
"Prims.eq2",
"Prims.precedes",
"Prims.list",
"FStar.Stubs.Reflection.V2.Data.argv",
"FStar.Pervasives.Native.fst",
"FStar.Stubs.Reflection.V2.Data.aqualv",
"FStar.Stubs.Reflection.Types.fv",
"FStar.Stubs.Reflectio... | [] | false | true | false | false | false | let is_reifiable (m_mult m_unit me: term) : Tac bool =
| let hd, tl = collect_app_ref me in
match inspect hd with
| Tv_FVar fv ->
let t1 = norm_term [delta; zeta; iota] (pack (Tv_FVar fv)) in
term_eq t1 m_mult
| _ -> term_eq (norm_term [delta; zeta; iota] me) m_unit | false |
Rewrite.Monoid.fst | Rewrite.Monoid.replace_point | val replace_point : m: FStar.Algebra.Monoid.monoid a -> rhs: FStar.Tactics.CanonMonoid.exp a
-> FStar.Tactics.Effect.Tac Prims.unit | let replace_point (#a:Type) (m:monoid a) (rhs:exp a) =
focus (fun () ->
let t =
mk_app (`monoid_reflect_rhs)
[(quote a, Q_Explicit);
(quote m, Q_Explicit);
(quote rhs, Q_Explicit)] in
(* dump "before replace point"; *)
apply_lemma t;
(* dump "a... | {
"file_name": "examples/tactics/Rewrite.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 14,
"end_line": 53,
"start_col": 0,
"start_line": 41
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.CanonMonoid.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pe... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonMonoid",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.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 | m: FStar.Algebra.Monoid.monoid a -> rhs: FStar.Tactics.CanonMonoid.exp a
-> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Algebra.Monoid.monoid",
"FStar.Tactics.CanonMonoid.exp",
"FStar.Tactics.V2.Derived.focus",
"Prims.unit",
"FStar.Tactics.V2.Derived.trefl",
"FStar.Stubs.Tactics.V2.Builtins.norm",
"Prims.Cons",
"FStar.Pervasives.norm_step",
"FStar.Pervasives.delta",
"FStar.Pervasives.primops",
"FStar.Perva... | [] | false | true | false | false | false | let replace_point (#a: Type) (m: monoid a) (rhs: exp a) =
| focus (fun () ->
let t =
mk_app (`monoid_reflect_rhs)
[((quote a), Q_Explicit); ((quote m), Q_Explicit); ((quote rhs), Q_Explicit)]
in
apply_lemma t;
norm [delta; primops; zeta; iota];
trefl ()) | false | |
Rewrite.Monoid.fst | Rewrite.Monoid.rewrite_int | val rewrite_int : everywhere: Prims.bool -> FStar.Tactics.Effect.Tac Prims.unit | let rewrite_int (everywhere:bool) =
topdown_rewrite
(should_rewrite int_plus_monoid everywhere)
(rewrite_monoid int_plus_monoid) | {
"file_name": "examples/tactics/Rewrite.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 42,
"end_line": 82,
"start_col": 0,
"start_line": 79
} | (*
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.Tactics.CanonMonoid.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pe... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonMonoid",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.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 | everywhere: Prims.bool -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.bool",
"FStar.Tactics.V2.Derived.topdown_rewrite",
"Rewrite.Monoid.should_rewrite",
"Prims.int",
"FStar.Algebra.Monoid.int_plus_monoid",
"Rewrite.Monoid.rewrite_monoid",
"Prims.unit"
] | [] | false | true | false | false | false | let rewrite_int (everywhere: bool) =
| topdown_rewrite (should_rewrite int_plus_monoid everywhere) (rewrite_monoid int_plus_monoid) | false | |
Rewrite.Monoid.fst | Rewrite.Monoid.should_rewrite | val should_rewrite (#a: Type) (m: monoid a) (everywhere: bool) (t: term) : Tac (bool * int) | val should_rewrite (#a: Type) (m: monoid a) (everywhere: bool) (t: term) : Tac (bool * int) | let should_rewrite (#a:Type) (m:monoid a) (everywhere:bool) (t:term) : Tac (bool * int) =
let m_mult = norm_term [delta;zeta;iota] (quote (Monoid?.mult m)) in
let m_unit = norm_term [delta;zeta;iota] (quote (Monoid?.unit m)) in
// debug "should_rewrite: ";
// debug (term_to_string t);
if is_reifiable m_mult m... | {
"file_name": "examples/tactics/Rewrite.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 15,
"end_line": 62,
"start_col": 0,
"start_line": 55
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.CanonMonoid.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pe... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonMonoid",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.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 | m: FStar.Algebra.Monoid.monoid a -> everywhere: Prims.bool -> t: FStar.Tactics.NamedView.term
-> FStar.Tactics.Effect.Tac (Prims.bool * Prims.int) | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Algebra.Monoid.monoid",
"Prims.bool",
"FStar.Tactics.NamedView.term",
"FStar.Pervasives.Native.Mktuple2",
"Prims.int",
"FStar.Pervasives.Native.tuple2",
"Rewrite.Monoid.is_reifiable",
"FStar.Tactics.V2.Derived.norm_term",
"Prims.Cons",
"FStar.Pervasives.norm_step",
"FStar.Pervasives.delta... | [] | false | true | false | false | false | let should_rewrite (#a: Type) (m: monoid a) (everywhere: bool) (t: term) : Tac (bool * int) =
| let m_mult = norm_term [delta; zeta; iota] (quote (Monoid?.mult m)) in
let m_unit = norm_term [delta; zeta; iota] (quote (Monoid?.unit m)) in
if is_reifiable m_mult m_unit t then true, (if everywhere then 1 else 2) else false, 0 | false |
FStar.Math.Euclid.fst | FStar.Math.Euclid.divides_plus | val divides_plus (a b d:int) : Lemma
(requires d `divides` a /\ d `divides` b)
(ensures d `divides` (a + b)) | val divides_plus (a b d:int) : Lemma
(requires d `divides` a /\ d `divides` b)
(ensures d `divides` (a + b)) | let divides_plus a b d =
Classical.exists_elim (d `divides` (a + b)) (Squash.get_proof (exists q1. a = q1 * d))
(fun q1 ->
Classical.exists_elim (d `divides` (a + b)) (Squash.get_proof (exists q2. b = q2 * d))
(fun q2 ->
assert (a + b = q1 * d + q2 * d);
distributivity_add_left q... | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 69,
"end_line": 81,
"start_col": 0,
"start_line": 74
} | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int -> d: Prims.int
-> FStar.Pervasives.Lemma
(requires FStar.Math.Euclid.divides d a /\ FStar.Math.Euclid.divides d b)
(ensures FStar.Math.Euclid.divides d (a + b)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"FStar.Classical.exists_elim",
"FStar.Math.Euclid.divides",
"Prims.op_Addition",
"Prims.b2t",
"Prims.op_Equality",
"FStar.Mul.op_Star",
"FStar.Squash.get_proof",
"Prims.l_Exists",
"FStar.Classical.exists_intro",
"Prims.unit",
"FStar.Math.Lemmas.distributivity_add_left",
"Prims._... | [] | false | false | true | false | false | let divides_plus a b d =
| Classical.exists_elim (d `divides` (a + b))
(Squash.get_proof (exists q1. a = q1 * d))
(fun q1 ->
Classical.exists_elim (d `divides` (a + b))
(Squash.get_proof (exists q2. b = q2 * d))
(fun q2 ->
assert (a + b = q1 * d + q2 * d);
distributivity_add_left q1 q2 d;
... | false |
FStar.Math.Euclid.fst | FStar.Math.Euclid.divides_0 | val divides_0 (a:int) : Lemma (a `divides` 0) | val divides_0 (a:int) : Lemma (a `divides` 0) | let divides_0 a =
Classical.exists_intro (fun q -> 0 = q * a) 0 | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 47,
"end_line": 60,
"start_col": 0,
"start_line": 59
} | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> FStar.Pervasives.Lemma (ensures FStar.Math.Euclid.divides a 0) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"FStar.Classical.exists_intro",
"Prims.b2t",
"Prims.op_Equality",
"FStar.Mul.op_Star",
"Prims.unit"
] | [] | false | false | true | false | false | let divides_0 a =
| Classical.exists_intro (fun q -> 0 = q * a) 0 | false |
FStar.Math.Euclid.fst | FStar.Math.Euclid.is_gcd_unique | val is_gcd_unique (a b c d:int) : Lemma
(requires is_gcd a b c /\ is_gcd a b d)
(ensures c = d \/ c = -d) | val is_gcd_unique (a b c d:int) : Lemma
(requires is_gcd a b c /\ is_gcd a b d)
(ensures c = d \/ c = -d) | let is_gcd_unique a b c d =
divide_antisym c d | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 20,
"end_line": 105,
"start_col": 0,
"start_line": 104
} | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int -> c: Prims.int -> d: Prims.int
-> FStar.Pervasives.Lemma
(requires FStar.Math.Euclid.is_gcd a b c /\ FStar.Math.Euclid.is_gcd a b d)
(ensures c = d \/ c = - d) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"FStar.Math.Euclid.divide_antisym",
"Prims.unit"
] | [] | true | false | true | false | false | let is_gcd_unique a b c d =
| divide_antisym c d | false |
Rewrite.Monoid.fst | Rewrite.Monoid.rewrite_monoid | val rewrite_monoid: #a: Type -> m: monoid a -> Prims.unit -> Tac unit | val rewrite_monoid: #a: Type -> m: monoid a -> Prims.unit -> Tac unit | let rewrite_monoid (#a:Type) (m:monoid a) () : Tac unit =
norm [zeta;iota];
let g = cur_goal () in
match term_as_formula g with
| Comp (Eq (Some t)) lhs _ ->
debug (term_to_string g);
if term_eq t (quote a) then
// let _ = dump "Trying canon ... " in
let lhs_exp : exp a = reification... | {
"file_name": "examples/tactics/Rewrite.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 38,
"end_line": 77,
"start_col": 0,
"start_line": 64
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.CanonMonoid.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pe... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonMonoid",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.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 | m: FStar.Algebra.Monoid.monoid a -> _: Prims.unit -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Algebra.Monoid.monoid",
"Prims.unit",
"FStar.Stubs.Reflection.Types.typ",
"FStar.Tactics.NamedView.term",
"Rewrite.Monoid.replace_point",
"FStar.Tactics.CanonMonoid.exp",
"FStar.Tactics.CanonMonoid.reification",
"Prims.bool",
"FStar.Tactics.V2.Derived.trefl",
"FStar.Stubs.Reflection.V2.Buil... | [] | false | true | false | false | false | let rewrite_monoid (#a: Type) (m: monoid a) () : Tac unit =
| norm [zeta; iota];
let g = cur_goal () in
match term_as_formula g with
| Comp (Eq (Some t)) lhs _ ->
debug (term_to_string g);
if term_eq t (quote a)
then
let lhs_exp:exp a = reification m lhs in
replace_point m lhs_exp
else trefl ()
| _ -> fail "Unexpected goal to rewriter" | false |
FStar.Math.Euclid.fst | FStar.Math.Euclid.divides_reflexive | val divides_reflexive (a:int) : Lemma (a `divides` a) [SMTPat (a `divides` a)] | val divides_reflexive (a:int) : Lemma (a `divides` a) [SMTPat (a `divides` a)] | let divides_reflexive a =
Classical.exists_intro (fun q -> a = q * a) 1 | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 47,
"end_line": 32,
"start_col": 0,
"start_line": 31
} | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int
-> FStar.Pervasives.Lemma (ensures FStar.Math.Euclid.divides a a)
[SMTPat (FStar.Math.Euclid.divides a a)] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"FStar.Classical.exists_intro",
"Prims.b2t",
"Prims.op_Equality",
"FStar.Mul.op_Star",
"Prims.unit"
] | [] | false | false | true | false | false | let divides_reflexive a =
| Classical.exists_intro (fun q -> a = q * a) 1 | false |
FStar.Math.Euclid.fst | FStar.Math.Euclid.divides_mod | val divides_mod (a:int) (b:nonzero) : Lemma (requires b `divides` a) (ensures a % b = 0) | val divides_mod (a:int) (b:nonzero) : Lemma (requires b `divides` a) (ensures a % b = 0) | let divides_mod a b =
Classical.exists_elim (a % b = 0) (Squash.get_proof (b `divides` a))
(fun q -> cancel_mul_div q b) | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 33,
"end_line": 102,
"start_col": 0,
"start_line": 100
} | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.nonzero
-> FStar.Pervasives.Lemma (requires FStar.Math.Euclid.divides b a) (ensures a % b = 0) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.nonzero",
"FStar.Classical.exists_elim",
"Prims.b2t",
"Prims.op_Equality",
"Prims.op_Modulus",
"FStar.Mul.op_Star",
"FStar.Squash.get_proof",
"FStar.Math.Euclid.divides",
"FStar.Math.Lemmas.cancel_mul_div",
"Prims.squash",
"Prims.unit"
] | [] | false | false | true | false | false | let divides_mod a b =
| Classical.exists_elim (a % b = 0) (Squash.get_proof (b `divides` a)) (fun q -> cancel_mul_div q b) | false |
FStar.Math.Euclid.fst | FStar.Math.Euclid.is_gcd_opp | val is_gcd_opp (a b d:int) : Lemma
(requires is_gcd a b d)
(ensures is_gcd b a (-d)) | val is_gcd_opp (a b d:int) : Lemma
(requires is_gcd a b d)
(ensures is_gcd b a (-d)) | let is_gcd_opp a b d =
Classical.forall_intro_2 (Classical.move_requires_2 divides_minus);
divides_opp d a;
divides_opp d b | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 122,
"start_col": 0,
"start_line": 119
} | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int -> d: Prims.int
-> FStar.Pervasives.Lemma (requires FStar.Math.Euclid.is_gcd a b d)
(ensures FStar.Math.Euclid.is_gcd b a (- d)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"FStar.Math.Euclid.divides_opp",
"Prims.unit",
"FStar.Classical.forall_intro_2",
"Prims.l_imp",
"FStar.Math.Euclid.divides",
"Prims.op_Minus",
"FStar.Classical.move_requires_2",
"FStar.Math.Euclid.divides_minus"
] | [] | false | false | true | false | false | let is_gcd_opp a b d =
| Classical.forall_intro_2 (Classical.move_requires_2 divides_minus);
divides_opp d a;
divides_opp d b | false |
FStar.Math.Euclid.fst | FStar.Math.Euclid.is_gcd_minus | val is_gcd_minus (a b d:int) : Lemma
(requires is_gcd a (-b) d)
(ensures is_gcd b a d) | val is_gcd_minus (a b d:int) : Lemma
(requires is_gcd a (-b) d)
(ensures is_gcd b a d) | let is_gcd_minus a b d =
Classical.forall_intro_2 (Classical.move_requires_2 divides_minus);
opp_idempotent b | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 18,
"end_line": 117,
"start_col": 0,
"start_line": 115
} | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int -> d: Prims.int
-> FStar.Pervasives.Lemma (requires FStar.Math.Euclid.is_gcd a (- b) d)
(ensures FStar.Math.Euclid.is_gcd b a d) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"FStar.Math.Euclid.opp_idempotent",
"Prims.unit",
"FStar.Classical.forall_intro_2",
"Prims.l_imp",
"FStar.Math.Euclid.divides",
"Prims.op_Minus",
"FStar.Classical.move_requires_2",
"FStar.Math.Euclid.divides_minus"
] | [] | false | false | true | false | false | let is_gcd_minus a b d =
| Classical.forall_intro_2 (Classical.move_requires_2 divides_minus);
opp_idempotent b | false |
FStar.Math.Euclid.fst | FStar.Math.Euclid.is_gcd_for_euclid | val is_gcd_for_euclid (a b q d:int) : Lemma
(requires is_gcd b (a - q * b) d)
(ensures is_gcd a b d) | val is_gcd_for_euclid (a b q d:int) : Lemma
(requires is_gcd b (a - q * b) d)
(ensures is_gcd a b d) | let is_gcd_for_euclid a b q d =
add_sub_l a (q * b);
is_gcd_plus b (a - q * b) q d | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 31,
"end_line": 139,
"start_col": 0,
"start_line": 137
} | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int -> q: Prims.int -> d: Prims.int
-> FStar.Pervasives.Lemma (requires FStar.Math.Euclid.is_gcd b (a - q * b) d)
(ensures FStar.Math.Euclid.is_gcd a b d) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"FStar.Math.Euclid.is_gcd_plus",
"Prims.op_Subtraction",
"FStar.Mul.op_Star",
"Prims.unit",
"FStar.Math.Euclid.add_sub_l"
] | [] | true | false | true | false | false | let is_gcd_for_euclid a b q d =
| add_sub_l a (q * b);
is_gcd_plus b (a - q * b) q d | false |
Spec.Blake2.Definitions.fst | Spec.Blake2.Definitions.nat_to_limb | val nat_to_limb (a: alg) (x: nat{x <= max_limb a}) : xl: limb_t a {uint_v xl == x} | val nat_to_limb (a: alg) (x: nat{x <= max_limb a}) : xl: limb_t a {uint_v xl == x} | let nat_to_limb (a:alg) (x:nat{x <= max_limb a}) : xl:limb_t a{uint_v xl == x} =
match (wt a) with
| U32 -> u64 x
| U64 -> let h = u64 (x / pow2 64) in
let l = u64 (x % pow2 64) in
(to_u128 h <<. 64ul) +! to_u128 l | {
"file_name": "specs/Spec.Blake2.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 36,
"end_line": 237,
"start_col": 0,
"start_line": 232
} | module Spec.Blake2.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50"
type alg =
| Blake2S
| Blake2B
let alg_inversion_lemma (a:alg) : Lemma (a == Blake2S \/ a == Blake2B) = ()
inline_for_extraction
let wt (a:alg) : t:inttype{u... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.L... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.Blake2.Definitions.alg -> x: Prims.nat{x <= Spec.Blake2.Definitions.max_limb a}
-> xl: Spec.Blake2.Definitions.limb_t a {Lib.IntTypes.uint_v xl == x} | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Spec.Blake2.Definitions.max_limb",
"Spec.Blake2.Definitions.wt",
"Lib.IntTypes.u64",
"Lib.IntTypes.op_Plus_Bang",
"Lib.IntTypes.U128",
"Lib.IntTypes.SEC",
"Lib.IntTypes.op_Less_Less_Dot",
"Lib.IntTypes.to_u12... | [] | false | false | false | false | false | let nat_to_limb (a: alg) (x: nat{x <= max_limb a}) : xl: limb_t a {uint_v xl == x} =
| match (wt a) with
| U32 -> u64 x
| U64 ->
let h = u64 (x / pow2 64) in
let l = u64 (x % pow2 64) in
(to_u128 h <<. 64ul) +! to_u128 l | false |
FStar.Math.Euclid.fst | FStar.Math.Euclid.divides_mult_right | val divides_mult_right (a b d:int) : Lemma
(requires d `divides` b)
(ensures d `divides` (a * b)) | val divides_mult_right (a b d:int) : Lemma
(requires d `divides` b)
(ensures d `divides` (a * b)) | let divides_mult_right a b d =
Classical.exists_elim (d `divides` (a * b)) (Squash.get_proof (d `divides` b))
(fun q ->
paren_mul_right a q d;
Classical.exists_intro (fun r -> a * b = r * d) (a * q)) | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 91,
"start_col": 0,
"start_line": 87
} | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int -> d: Prims.int
-> FStar.Pervasives.Lemma (requires FStar.Math.Euclid.divides d b)
(ensures FStar.Math.Euclid.divides d (a * b)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"FStar.Classical.exists_elim",
"FStar.Math.Euclid.divides",
"FStar.Mul.op_Star",
"Prims.b2t",
"Prims.op_Equality",
"FStar.Squash.get_proof",
"FStar.Classical.exists_intro",
"Prims.unit",
"FStar.Math.Lemmas.paren_mul_right",
"Prims.squash"
] | [] | false | false | true | false | false | let divides_mult_right a b d =
| Classical.exists_elim (d `divides` (a * b))
(Squash.get_proof (d `divides` b))
(fun q ->
paren_mul_right a q d;
Classical.exists_intro (fun r -> a * b = r * d) (a * q)) | false |
FStar.Math.Euclid.fst | FStar.Math.Euclid.divide_antisym | val divide_antisym (a b:int) : Lemma
(requires a `divides` b /\ b `divides` a)
(ensures a = b \/ a = -b) | val divide_antisym (a b:int) : Lemma
(requires a `divides` b /\ b `divides` a)
(ensures a = b \/ a = -b) | let divide_antisym a b =
if a <> 0 then
Classical.exists_elim (a = b \/ a = -b) (Squash.get_proof (exists q1. b = q1 * a))
(fun q1 ->
Classical.exists_elim (a = b \/ a = -b) (Squash.get_proof (exists q2. a = q2 * b))
(fun q2 ->
assert (b = q1 * a);
assert (a = q2 * ... | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 31,
"end_line": 57,
"start_col": 0,
"start_line": 46
} | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int
-> FStar.Pervasives.Lemma
(requires FStar.Math.Euclid.divides a b /\ FStar.Math.Euclid.divides b a)
(ensures a = b \/ a = - b) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.op_disEquality",
"FStar.Classical.exists_elim",
"Prims.l_or",
"Prims.b2t",
"Prims.op_Equality",
"Prims.op_Minus",
"FStar.Mul.op_Star",
"FStar.Squash.get_proof",
"Prims.l_Exists",
"FStar.Math.Euclid.eq_mult_one",
"Prims.unit",
"FStar.Math.Euclid.eq_mult_left",
"FStar.Mat... | [] | false | false | true | false | false | let divide_antisym a b =
| if a <> 0
then
Classical.exists_elim (a = b \/ a = - b)
(Squash.get_proof (exists q1. b = q1 * a))
(fun q1 ->
Classical.exists_elim (a = b \/ a = - b)
(Squash.get_proof (exists q2. a = q2 * b))
(fun q2 ->
assert (b = q1 * a);
assert (a = q2 * b);
... | false |
Vale.Def.Words.Four_s.fsti | Vale.Def.Words.Four_s.four_map | val four_map (#a #b: Type) (f: (a -> b)) (x: four a) : four b | val four_map (#a #b: Type) (f: (a -> b)) (x: four a) : four b | let four_map (#a #b:Type) (f:a -> b) (x:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
Mkfour (f x0) (f x1) (f x2) (f x3) | {
"file_name": "vale/specs/defs/Vale.Def.Words.Four_s.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 36,
"end_line": 7,
"start_col": 7,
"start_line": 5
} | module Vale.Def.Words.Four_s
open Vale.Def.Words_s
open FStar.Mul | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Def.Words.Four_s.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"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: (_: a -> b) -> x: Vale.Def.Words_s.four a -> Vale.Def.Words_s.four b | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Words_s.four",
"Vale.Def.Words_s.Mkfour"
] | [] | false | false | false | true | false | let four_map (#a #b: Type) (f: (a -> b)) (x: four a) : four b =
| let Mkfour x0 x1 x2 x3 = x in
Mkfour (f x0) (f x1) (f x2) (f x3) | false |
FStar.Math.Euclid.fst | FStar.Math.Euclid.divides_transitive | val divides_transitive (a b c:int) : Lemma
(requires a `divides` b /\ b `divides` c)
(ensures a `divides` c) | val divides_transitive (a b c:int) : Lemma
(requires a `divides` b /\ b `divides` c)
(ensures a `divides` c) | let divides_transitive a b c =
eliminate exists q1. b == q1 * a
returns a `divides` c
with _pf.
eliminate exists q2. c == q2 * b
returns _
with _pf2.
introduce exists q. c == q * a
with (q1 * q2)
and () | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 8,
"end_line": 43,
"start_col": 0,
"start_line": 34
} | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int -> c: Prims.int
-> FStar.Pervasives.Lemma
(requires FStar.Math.Euclid.divides a b /\ FStar.Math.Euclid.divides b c)
(ensures FStar.Math.Euclid.divides a c) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"FStar.Classical.Sugar.exists_elim",
"Prims.eq2",
"FStar.Mul.op_Star",
"FStar.Math.Euclid.divides",
"Prims.squash",
"Prims.l_Exists",
"FStar.Classical.Sugar.exists_intro",
"Prims.unit"
] | [] | false | false | true | false | false | let divides_transitive a b c =
| eliminate exists q1.
b == q1 * a
returns a `divides` c
with _pf.
eliminate exists q2.
c == q2 * b
returns _
with _pf2.
introduce exists q.c == q * a
with (q1 * q2)
and () | false |
FStar.Math.Euclid.fst | FStar.Math.Euclid.is_gcd_plus | val is_gcd_plus (a b q d:int) : Lemma
(requires is_gcd a b d)
(ensures is_gcd a (b + q * a) d) | val is_gcd_plus (a b q d:int) : Lemma
(requires is_gcd a b d)
(ensures is_gcd a (b + q * a) d) | let is_gcd_plus a b q d =
add_sub_r b (q * a);
Classical.forall_intro_3 (Classical.move_requires_3 divides_plus);
Classical.forall_intro_3 (Classical.move_requires_3 divides_mult_right);
Classical.forall_intro_3 (Classical.move_requires_3 divides_sub) | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 66,
"end_line": 128,
"start_col": 0,
"start_line": 124
} | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int -> q: Prims.int -> d: Prims.int
-> FStar.Pervasives.Lemma (requires FStar.Math.Euclid.is_gcd a b d)
(ensures FStar.Math.Euclid.is_gcd a (b + q * a) d) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"FStar.Classical.forall_intro_3",
"Prims.l_imp",
"Prims.l_and",
"FStar.Math.Euclid.divides",
"Prims.op_Subtraction",
"FStar.Classical.move_requires_3",
"FStar.Math.Euclid.divides_sub",
"Prims.unit",
"FStar.Mul.op_Star",
"FStar.Math.Euclid.divides_mult_right",
"Prims.op_Addition",
... | [] | false | false | true | false | false | let is_gcd_plus a b q d =
| add_sub_r b (q * a);
Classical.forall_intro_3 (Classical.move_requires_3 divides_plus);
Classical.forall_intro_3 (Classical.move_requires_3 divides_mult_right);
Classical.forall_intro_3 (Classical.move_requires_3 divides_sub) | false |
Rewrite.Monoid.fst | Rewrite.Monoid.apply_imp | val apply_imp : h: FStar.Tactics.NamedView.binding -> FStar.Tactics.Effect.Tac Prims.unit | let apply_imp (h:binding) =
mapply (mk_app (`elim_implies) [(pack (Tv_Var (binding_to_namedv h)), Q_Explicit)]) | {
"file_name": "examples/tactics/Rewrite.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 87,
"end_line": 86,
"start_col": 0,
"start_line": 85
} | (*
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.Tactics.CanonMonoid.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pe... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonMonoid",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.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 | h: FStar.Tactics.NamedView.binding -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.NamedView.binding",
"FStar.Tactics.MApply.mapply",
"FStar.Stubs.Reflection.Types.term",
"FStar.Tactics.MApply.termable_term",
"FStar.Reflection.V2.Derived.mk_app",
"Prims.Cons",
"FStar.Stubs.Reflection.V2.Data.argv",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Stubs.Reflection.V2.Data.... | [] | false | true | false | false | false | let apply_imp (h: binding) =
| mapply (mk_app (`elim_implies) [(pack (Tv_Var (binding_to_namedv h)), Q_Explicit)]) | false | |
Vale.Def.Words.Four_s.fsti | Vale.Def.Words.Four_s.two_two_to_four | val two_two_to_four (#a: Type) (x: two (two a)) : four a | val two_two_to_four (#a: Type) (x: two (two a)) : four a | let two_two_to_four (#a:Type) (x:two (two a)) : four a =
let (Mktwo (Mktwo x0 x1) (Mktwo x2 x3)) = x in
Mkfour x0 x1 x2 x3 | {
"file_name": "vale/specs/defs/Vale.Def.Words.Four_s.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 20,
"end_line": 16,
"start_col": 0,
"start_line": 14
} | module Vale.Def.Words.Four_s
open Vale.Def.Words_s
open FStar.Mul
unfold let four_map (#a #b:Type) (f:a -> b) (x:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
Mkfour (f x0) (f x1) (f x2) (f x3)
unfold let four_map2 (#a #b:Type) (f:a -> a -> b) (x y:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
let Mkfou... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Def.Words.Four_s.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"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.Def.Words_s.two (Vale.Def.Words_s.two a) -> Vale.Def.Words_s.four a | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Words_s.two",
"Vale.Def.Words_s.Mkfour",
"Vale.Def.Words_s.four"
] | [] | false | false | false | true | false | let two_two_to_four (#a: Type) (x: two (two a)) : four a =
| let Mktwo (Mktwo x0 x1) (Mktwo x2 x3) = x in
Mkfour x0 x1 x2 x3 | false |
Vale.Def.Words.Four_s.fsti | Vale.Def.Words.Four_s.four_map2 | val four_map2 (#a #b: Type) (f: (a -> a -> b)) (x y: four a) : four b | val four_map2 (#a #b: Type) (f: (a -> a -> b)) (x y: four a) : four b | let four_map2 (#a #b:Type) (f:a -> a -> b) (x y:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
let Mkfour y0 y1 y2 y3 = y in
Mkfour (f x0 y0) (f x1 y1) (f x2 y2) (f x3 y3) | {
"file_name": "vale/specs/defs/Vale.Def.Words.Four_s.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 48,
"end_line": 12,
"start_col": 7,
"start_line": 9
} | module Vale.Def.Words.Four_s
open Vale.Def.Words_s
open FStar.Mul
unfold let four_map (#a #b:Type) (f:a -> b) (x:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
Mkfour (f x0) (f x1) (f x2) (f x3) | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Def.Words.Four_s.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"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: (_: a -> _: a -> b) -> x: Vale.Def.Words_s.four a -> y: Vale.Def.Words_s.four a
-> Vale.Def.Words_s.four b | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Words_s.four",
"Vale.Def.Words_s.Mkfour"
] | [] | false | false | false | true | false | let four_map2 (#a #b: Type) (f: (a -> a -> b)) (x y: four a) : four b =
| let Mkfour x0 x1 x2 x3 = x in
let Mkfour y0 y1 y2 y3 = y in
Mkfour (f x0 y0) (f x1 y1) (f x2 y2) (f x3 y3) | false |
FStar.Math.Euclid.fst | FStar.Math.Euclid.mod_divides | val mod_divides (a:int) (b:nonzero) : Lemma (requires a % b = 0) (ensures b `divides` a) | val mod_divides (a:int) (b:nonzero) : Lemma (requires a % b = 0) (ensures b `divides` a) | let mod_divides a b =
Classical.exists_intro (fun q -> a = q * b) (a / b) | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 98,
"start_col": 0,
"start_line": 97
} | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.nonzero
-> FStar.Pervasives.Lemma (requires a % b = 0) (ensures FStar.Math.Euclid.divides b a) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.nonzero",
"FStar.Classical.exists_intro",
"Prims.b2t",
"Prims.op_Equality",
"FStar.Mul.op_Star",
"Prims.op_Division",
"Prims.unit"
] | [] | false | false | true | false | false | let mod_divides a b =
| Classical.exists_intro (fun q -> a = q * b) (a / b) | false |
Rewrite.Monoid.fst | Rewrite.Monoid.refl | val refl (#a: Type) (x: a) : (x == x) | val refl (#a: Type) (x: a) : (x == x) | let refl (#a:Type) (x:a) : (x==x) = FStar.Squash.return_squash Refl | {
"file_name": "examples/tactics/Rewrite.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 67,
"end_line": 87,
"start_col": 0,
"start_line": 87
} | (*
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.Tactics.CanonMonoid.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pe... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonMonoid",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.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 | x: a -> x == x | Prims.Tot | [
"total"
] | [] | [
"FStar.Squash.return_squash",
"Prims.equals",
"Prims.Refl",
"Prims.eq2"
] | [] | false | false | false | false | false | let refl (#a: Type) (x: a) : (x == x) =
| FStar.Squash.return_squash Refl | false |
FStar.Math.Euclid.fst | FStar.Math.Euclid.divides_sub | val divides_sub (a b d:int) : Lemma
(requires d `divides` a /\ d `divides` b)
(ensures d `divides` (a - b)) | val divides_sub (a b d:int) : Lemma
(requires d `divides` a /\ d `divides` b)
(ensures d `divides` (a - b)) | let divides_sub a b d =
Classical.forall_intro_2 (Classical.move_requires_2 divides_minus);
divides_plus a (-b) d | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 23,
"end_line": 85,
"start_col": 0,
"start_line": 83
} | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int -> d: Prims.int
-> FStar.Pervasives.Lemma
(requires FStar.Math.Euclid.divides d a /\ FStar.Math.Euclid.divides d b)
(ensures FStar.Math.Euclid.divides d (a - b)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"FStar.Math.Euclid.divides_plus",
"Prims.op_Minus",
"Prims.unit",
"FStar.Classical.forall_intro_2",
"Prims.l_imp",
"FStar.Math.Euclid.divides",
"FStar.Classical.move_requires_2",
"FStar.Math.Euclid.divides_minus"
] | [] | false | false | true | false | false | let divides_sub a b d =
| Classical.forall_intro_2 (Classical.move_requires_2 divides_minus);
divides_plus a (- b) d | false |
FStar.Math.Euclid.fst | FStar.Math.Euclid.divides_minus | val divides_minus (a b:int) : Lemma
(requires a `divides` b)
(ensures a `divides` (-b)) | val divides_minus (a b:int) : Lemma
(requires a `divides` b)
(ensures a `divides` (-b)) | let divides_minus a b =
Classical.exists_elim (a `divides` (-b))
(Squash.get_proof (a `divides` b))
(fun q -> Classical.exists_intro (fun q' -> -b = q' * a) (-q)) | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 66,
"end_line": 67,
"start_col": 0,
"start_line": 64
} | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int
-> FStar.Pervasives.Lemma (requires FStar.Math.Euclid.divides a b)
(ensures FStar.Math.Euclid.divides a (- b)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"FStar.Classical.exists_elim",
"FStar.Math.Euclid.divides",
"Prims.op_Minus",
"Prims.b2t",
"Prims.op_Equality",
"FStar.Mul.op_Star",
"FStar.Squash.get_proof",
"FStar.Classical.exists_intro",
"Prims.squash",
"Prims.unit"
] | [] | false | false | true | false | false | let divides_minus a b =
| Classical.exists_elim (a `divides` (- b))
(Squash.get_proof (a `divides` b))
(fun q -> Classical.exists_intro (fun q' -> - b = q' * a) (- q)) | false |
Vale.Def.Words.Four_s.fsti | Vale.Def.Words.Four_s.four_to_two_two | val four_to_two_two (#a: Type) (x: four a) : two (two a) | val four_to_two_two (#a: Type) (x: four a) : two (two a) | let four_to_two_two (#a:Type) (x:four a) : two (two a) =
let Mkfour x0 x1 x2 x3 = x in
Mktwo (Mktwo x0 x1) (Mktwo x2 x3) | {
"file_name": "vale/specs/defs/Vale.Def.Words.Four_s.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 35,
"end_line": 20,
"start_col": 0,
"start_line": 18
} | module Vale.Def.Words.Four_s
open Vale.Def.Words_s
open FStar.Mul
unfold let four_map (#a #b:Type) (f:a -> b) (x:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
Mkfour (f x0) (f x1) (f x2) (f x3)
unfold let four_map2 (#a #b:Type) (f:a -> a -> b) (x y:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
let Mkfou... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Def.Words.Four_s.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"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.Def.Words_s.four a -> Vale.Def.Words_s.two (Vale.Def.Words_s.two a) | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Words_s.four",
"Vale.Def.Words_s.Mktwo",
"Vale.Def.Words_s.two"
] | [] | false | false | false | true | false | let four_to_two_two (#a: Type) (x: four a) : two (two a) =
| let Mkfour x0 x1 x2 x3 = x in
Mktwo (Mktwo x0 x1) (Mktwo x2 x3) | false |
FStar.Math.Euclid.fst | FStar.Math.Euclid.divides_opp | val divides_opp (a b:int) : Lemma
(requires a `divides` b)
(ensures (-a) `divides` b) | val divides_opp (a b:int) : Lemma
(requires a `divides` b)
(ensures (-a) `divides` b) | let divides_opp a b =
Classical.exists_elim ((-a) `divides` b)
(Squash.get_proof (a `divides` b))
(fun q -> Classical.exists_intro (fun q' -> b = q' * (-a)) (-q)) | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 68,
"end_line": 72,
"start_col": 0,
"start_line": 69
} | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Prims.int -> b: Prims.int
-> FStar.Pervasives.Lemma (requires FStar.Math.Euclid.divides a b)
(ensures FStar.Math.Euclid.divides (- a) b) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"FStar.Classical.exists_elim",
"FStar.Math.Euclid.divides",
"Prims.op_Minus",
"Prims.b2t",
"Prims.op_Equality",
"FStar.Mul.op_Star",
"FStar.Squash.get_proof",
"FStar.Classical.exists_intro",
"Prims.squash",
"Prims.unit"
] | [] | false | false | true | false | false | let divides_opp a b =
| Classical.exists_elim ((- a) `divides` b)
(Squash.get_proof (a `divides` b))
(fun q -> Classical.exists_intro (fun q' -> b = q' * (- a)) (- q)) | false |
Vale.Def.Words.Four_s.fsti | Vale.Def.Words.Four_s.four_reverse | val four_reverse (#a: Type) (x: four a) : four a | val four_reverse (#a: Type) (x: four a) : four a | let four_reverse (#a:Type) (x:four a) : four a =
let Mkfour x0 x1 x2 x3 = x in
Mkfour x3 x2 x1 x0 | {
"file_name": "vale/specs/defs/Vale.Def.Words.Four_s.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 20,
"end_line": 63,
"start_col": 0,
"start_line": 61
} | module Vale.Def.Words.Four_s
open Vale.Def.Words_s
open FStar.Mul
unfold let four_map (#a #b:Type) (f:a -> b) (x:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
Mkfour (f x0) (f x1) (f x2) (f x3)
unfold let four_map2 (#a #b:Type) (f:a -> a -> b) (x y:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
let Mkfou... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Def.Words.Four_s.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"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.Def.Words_s.four a -> Vale.Def.Words_s.four a | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Words_s.four",
"Vale.Def.Words_s.Mkfour"
] | [] | false | false | false | true | false | let four_reverse (#a: Type) (x: four a) : four a =
| let Mkfour x0 x1 x2 x3 = x in
Mkfour x3 x2 x1 x0 | false |
Rewrite.Monoid.fst | Rewrite.Monoid.test | val test : a: Prims.int -> b: Prims.int -> p: Type0 -> Prims.unit | let test (a b : int) (p:Type) =
assert ((((a + b + 0) == (a + b)) ==> p) ==> p)
by (norm [];
rewrite_int true;
apply_imp (implies_intro());
norm [delta; zeta;iota; primops];
apply (`refl)) | {
"file_name": "examples/tactics/Rewrite.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 26,
"end_line": 94,
"start_col": 0,
"start_line": 88
} | (*
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.Tactics.CanonMonoid.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pe... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonMonoid",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.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 | a: Prims.int -> b: Prims.int -> p: Type0 -> Prims.unit | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.l_imp",
"Prims.eq2",
"Prims.op_Addition",
"Prims.unit",
"FStar.Tactics.V2.Derived.apply",
"FStar.Stubs.Tactics.V2.Builtins.norm",
"Prims.Cons",
"FStar.Pervasives.norm_step",
"FStar.Pervasives.delta",
"FStar.Pervasives.zeta",
"FStar... | [] | false | false | false | true | false | let test (a b: int) (p: Type) =
| FStar.Tactics.Effect.assert_by_tactic ((((a + b + 0) == (a + b)) ==> p) ==> p)
(fun _ ->
();
(norm [];
rewrite_int true;
apply_imp (implies_intro ());
norm [delta; zeta; iota; primops];
apply (`refl))) | false | |
FStar.DM4F.IntStoreFixed.fst | FStar.DM4F.IntStoreFixed.iget | val iget: Prims.unit -> int_store heap | val iget: Prims.unit -> int_store heap | let iget () : int_store heap = fun store -> store, store | {
"file_name": "examples/dm4free/FStar.DM4F.IntStoreFixed.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 56,
"end_line": 28,
"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.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreFixedReader.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.DM4F.IntStoreFi... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> FStar.DM4F.IntStoreFixed.int_store FStar.DM4F.Heap.IntStoreFixed.heap | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.tuple2",
"FStar.DM4F.IntStoreFixed.int_store"
] | [] | false | false | false | true | false | let iget () : int_store heap =
| fun store -> store, store | false |
Vale.Def.Words.Four_s.fsti | Vale.Def.Words.Four_s.four_to_nat_unfold | val four_to_nat_unfold (size: nat) (x: four (natN (pow2 size))) : natN (pow2 (4 * size)) | val four_to_nat_unfold (size: nat) (x: four (natN (pow2 size))) : natN (pow2 (4 * size)) | let four_to_nat_unfold (size:nat) (x:four (natN (pow2 size))) : natN (pow2 (4 * size)) =
let n1 = pow2_norm size in
let n2 = pow2_norm (2 * size) in
let n3 = pow2_norm (3 * size) in
let n4 = pow2_norm (4 * size) in
let Mkfour x0 x1 x2 x3 = x in
int_to_natN n4 (x0 + x1 * n1 + x2 * n2 + x3 * n3) | {
"file_name": "vale/specs/defs/Vale.Def.Words.Four_s.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 51,
"end_line": 41,
"start_col": 0,
"start_line": 35
} | module Vale.Def.Words.Four_s
open Vale.Def.Words_s
open FStar.Mul
unfold let four_map (#a #b:Type) (f:a -> b) (x:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
Mkfour (f x0) (f x1) (f x2) (f x3)
unfold let four_map2 (#a #b:Type) (f:a -> a -> b) (x y:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
let Mkfou... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Def.Words.Four_s.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"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 | size: Prims.nat -> x: Vale.Def.Words_s.four (Vale.Def.Words_s.natN (Prims.pow2 size))
-> Vale.Def.Words_s.natN (Prims.pow2 (4 * size)) | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Vale.Def.Words_s.four",
"Vale.Def.Words_s.natN",
"Prims.pow2",
"Vale.Def.Words_s.int_to_natN",
"Prims.op_Addition",
"FStar.Mul.op_Star",
"Prims.pos",
"Vale.Def.Words_s.pow2_norm"
] | [] | false | false | false | false | false | let four_to_nat_unfold (size: nat) (x: four (natN (pow2 size))) : natN (pow2 (4 * size)) =
| let n1 = pow2_norm size in
let n2 = pow2_norm (2 * size) in
let n3 = pow2_norm (3 * size) in
let n4 = pow2_norm (4 * size) in
let Mkfour x0 x1 x2 x3 = x in
int_to_natN n4 (x0 + x1 * n1 + x2 * n2 + x3 * n3) | false |
FStar.DM4F.IntStoreFixed.fst | FStar.DM4F.IntStoreFixed.return_is | val return_is (a: Type) (x: a) : int_store a | val return_is (a: Type) (x: a) : int_store a | let return_is (a:Type) (x:a) : int_store a = fun store -> x, store | {
"file_name": "examples/dm4free/FStar.DM4F.IntStoreFixed.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 66,
"end_line": 22,
"start_col": 0,
"start_line": 22
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreFixedReader.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.DM4F.IntStoreFi... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Type -> x: a -> FStar.DM4F.IntStoreFixed.int_store a | Prims.Tot | [
"total"
] | [] | [
"FStar.DM4F.Heap.IntStoreFixed.heap",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.tuple2",
"FStar.DM4F.IntStoreFixed.int_store"
] | [] | false | false | false | true | false | let return_is (a: Type) (x: a) : int_store a =
| fun store -> x, store | false |
Vale.Def.Words.Four_s.fsti | Vale.Def.Words.Four_s.four_insert | val four_insert (#a: Type) (x: four a) (y: a) (selector: nat2) : four a | val four_insert (#a: Type) (x: four a) (y: a) (selector: nat2) : four a | let four_insert (#a:Type) (x:four a) (y:a) (selector:nat2) : four a =
match selector with
| 0 -> Mkfour y x.lo1 x.hi2 x.hi3
| 1 -> Mkfour x.lo0 y x.hi2 x.hi3
| 2 -> Mkfour x.lo0 x.lo1 y x.hi3
| 3 -> Mkfour x.lo0 x.lo1 x.hi2 y | {
"file_name": "vale/specs/defs/Vale.Def.Words.Four_s.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 35,
"end_line": 59,
"start_col": 0,
"start_line": 54
} | module Vale.Def.Words.Four_s
open Vale.Def.Words_s
open FStar.Mul
unfold let four_map (#a #b:Type) (f:a -> b) (x:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
Mkfour (f x0) (f x1) (f x2) (f x3)
unfold let four_map2 (#a #b:Type) (f:a -> a -> b) (x y:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
let Mkfou... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Def.Words.Four_s.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"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.Def.Words_s.four a -> y: a -> selector: Vale.Def.Words_s.nat2 -> Vale.Def.Words_s.four a | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Words_s.four",
"Vale.Def.Words_s.nat2",
"Vale.Def.Words_s.Mkfour",
"Vale.Def.Words_s.__proj__Mkfour__item__lo1",
"Vale.Def.Words_s.__proj__Mkfour__item__hi2",
"Vale.Def.Words_s.__proj__Mkfour__item__hi3",
"Vale.Def.Words_s.__proj__Mkfour__item__lo0"
] | [] | false | false | false | true | false | let four_insert (#a: Type) (x: four a) (y: a) (selector: nat2) : four a =
| match selector with
| 0 -> Mkfour y x.lo1 x.hi2 x.hi3
| 1 -> Mkfour x.lo0 y x.hi2 x.hi3
| 2 -> Mkfour x.lo0 x.lo1 y x.hi3
| 3 -> Mkfour x.lo0 x.lo1 x.hi2 y | false |
Vale.Def.Words.Four_s.fsti | Vale.Def.Words.Four_s.four_to_nat | val four_to_nat (size: nat) (x: four (natN (pow2 size))) : natN (pow2 (4 * size)) | val four_to_nat (size: nat) (x: four (natN (pow2 size))) : natN (pow2 (4 * size)) | let four_to_nat (size:nat) (x:four (natN (pow2 size))) : natN (pow2 (4 * size)) =
four_to_nat_unfold size x | {
"file_name": "vale/specs/defs/Vale.Def.Words.Four_s.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 27,
"end_line": 45,
"start_col": 0,
"start_line": 44
} | module Vale.Def.Words.Four_s
open Vale.Def.Words_s
open FStar.Mul
unfold let four_map (#a #b:Type) (f:a -> b) (x:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
Mkfour (f x0) (f x1) (f x2) (f x3)
unfold let four_map2 (#a #b:Type) (f:a -> a -> b) (x y:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
let Mkfou... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Def.Words.Four_s.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"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 | size: Prims.nat -> x: Vale.Def.Words_s.four (Vale.Def.Words_s.natN (Prims.pow2 size))
-> Vale.Def.Words_s.natN (Prims.pow2 (4 * size)) | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Vale.Def.Words_s.four",
"Vale.Def.Words_s.natN",
"Prims.pow2",
"Vale.Def.Words.Four_s.four_to_nat_unfold",
"FStar.Mul.op_Star"
] | [] | false | false | false | false | false | let four_to_nat (size: nat) (x: four (natN (pow2 size))) : natN (pow2 (4 * size)) =
| four_to_nat_unfold size x | false |
FStar.DM4F.IntStoreFixed.fst | FStar.DM4F.IntStoreFixed.pre | val pre : Type | let pre = INT_STORE?.pre | {
"file_name": "examples/dm4free/FStar.DM4F.IntStoreFixed.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 54,
"start_col": 0,
"start_line": 54
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreFixedReader.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.DM4F.IntStoreFi... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Type | Prims.Tot | [
"total"
] | [] | [
"FStar.DM4F.IntStoreFixed._dm4f_INT_STORE_pre"
] | [] | false | false | false | true | true | let pre =
| INT_STORE?.pre | false | |
FStar.DM4F.IntStoreFixed.fst | FStar.DM4F.IntStoreFixed.bind_is | val bind_is (a b: Type) (x: int_store a) (f: (a -> int_store b)) : int_store b | val bind_is (a b: Type) (x: int_store a) (f: (a -> int_store b)) : int_store b | let bind_is (a b : Type) (x:int_store a) (f: a -> int_store b) : int_store b =
fun store ->
let (z, store') = x store in
f z store' | {
"file_name": "examples/dm4free/FStar.DM4F.IntStoreFixed.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 14,
"end_line": 26,
"start_col": 0,
"start_line": 23
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreFixedReader.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.DM4F.IntStoreFi... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
a: Type ->
b: Type ->
x: FStar.DM4F.IntStoreFixed.int_store a ->
f: (_: a -> FStar.DM4F.IntStoreFixed.int_store b)
-> FStar.DM4F.IntStoreFixed.int_store b | Prims.Tot | [
"total"
] | [] | [
"FStar.DM4F.IntStoreFixed.int_store",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"FStar.Pervasives.Native.tuple2"
] | [] | false | false | false | true | false | let bind_is (a b: Type) (x: int_store a) (f: (a -> int_store b)) : int_store b =
| fun store ->
let z, store' = x store in
f z store' | false |
Rewrite.Monoid.fst | Rewrite.Monoid.monoid_reflect_rhs | val monoid_reflect_rhs:
a: Type ->
m: monoid a ->
rhs: exp a ->
lhs: a ->
squash (lhs == mdenote m rhs)
-> Lemma (lhs == mldenote m (flatten rhs)) | val monoid_reflect_rhs:
a: Type ->
m: monoid a ->
rhs: exp a ->
lhs: a ->
squash (lhs == mdenote m rhs)
-> Lemma (lhs == mldenote m (flatten rhs)) | let monoid_reflect_rhs (a:Type) (m:monoid a) (rhs:exp a) (lhs:a)
(_ : squash (lhs == mdenote m rhs))
: Lemma (lhs == mldenote m (flatten rhs)) =
flatten_correct m rhs | {
"file_name": "examples/tactics/Rewrite.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 23,
"end_line": 39,
"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.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.CanonMonoid.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pe... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonMonoid",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.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 |
a: Type ->
m: FStar.Algebra.Monoid.monoid a ->
rhs: FStar.Tactics.CanonMonoid.exp a ->
lhs: a ->
_: Prims.squash (lhs == FStar.Tactics.CanonMonoid.mdenote m rhs)
-> FStar.Pervasives.Lemma
(ensures lhs == FStar.Tactics.CanonMonoid.mldenote m (FStar.Tactics.CanonMonoid.flatten rhs)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Algebra.Monoid.monoid",
"FStar.Tactics.CanonMonoid.exp",
"Prims.squash",
"Prims.eq2",
"FStar.Tactics.CanonMonoid.mdenote",
"FStar.Tactics.CanonMonoid.flatten_correct",
"Prims.unit",
"Prims.l_True",
"FStar.Tactics.CanonMonoid.mldenote",
"FStar.Tactics.CanonMonoid.flatten",
"Prims.Nil",
"... | [] | true | false | true | false | false | let monoid_reflect_rhs
(a: Type)
(m: monoid a)
(rhs: exp a)
(lhs: a)
(_: squash (lhs == mdenote m rhs))
: Lemma (lhs == mldenote m (flatten rhs)) =
| flatten_correct m rhs | false |
Vale.Def.Words.Four_s.fsti | Vale.Def.Words.Four_s.nat_to_four | val nat_to_four (size: nat) (n: natN (pow2 (4 * size))) : four (natN (pow2 size)) | val nat_to_four (size: nat) (n: natN (pow2 (4 * size))) : four (natN (pow2 size)) | let nat_to_four (size:nat) (n:natN (pow2 (4 * size))) : four (natN (pow2 size)) =
nat_to_four_unfold size n | {
"file_name": "vale/specs/defs/Vale.Def.Words.Four_s.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 27,
"end_line": 32,
"start_col": 0,
"start_line": 31
} | module Vale.Def.Words.Four_s
open Vale.Def.Words_s
open FStar.Mul
unfold let four_map (#a #b:Type) (f:a -> b) (x:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
Mkfour (f x0) (f x1) (f x2) (f x3)
unfold let four_map2 (#a #b:Type) (f:a -> a -> b) (x y:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
let Mkfou... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Def.Words.Four_s.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"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 | size: Prims.nat -> n: Vale.Def.Words_s.natN (Prims.pow2 (4 * size))
-> Vale.Def.Words_s.four (Vale.Def.Words_s.natN (Prims.pow2 size)) | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Vale.Def.Words_s.natN",
"Prims.pow2",
"FStar.Mul.op_Star",
"Vale.Def.Words.Four_s.nat_to_four_unfold",
"Vale.Def.Words_s.four"
] | [] | false | false | false | false | false | let nat_to_four (size: nat) (n: natN (pow2 (4 * size))) : four (natN (pow2 size)) =
| nat_to_four_unfold size n | false |
FStar.DM4F.IntStoreFixed.fst | FStar.DM4F.IntStoreFixed.post | val post : a: Type -> Type | let post = INT_STORE?.post | {
"file_name": "examples/dm4free/FStar.DM4F.IntStoreFixed.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 26,
"end_line": 55,
"start_col": 0,
"start_line": 55
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreFixedReader.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.DM4F.IntStoreFi... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Type -> Type | Prims.Tot | [
"total"
] | [] | [
"FStar.DM4F.IntStoreFixed._dm4f_INT_STORE_post"
] | [] | false | false | false | true | true | let post =
| INT_STORE?.post | false | |
FStar.DM4F.IntStoreFixed.fst | FStar.DM4F.IntStoreFixed.wp | val wp : a: Type -> Type | let wp = INT_STORE?.wp | {
"file_name": "examples/dm4free/FStar.DM4F.IntStoreFixed.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 22,
"end_line": 53,
"start_col": 0,
"start_line": 53
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreFixedReader.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.DM4F.IntStoreFi... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Type -> Type | Prims.Tot | [
"total"
] | [] | [
"FStar.DM4F.IntStoreFixed._dm4f_INT_STORE_wp"
] | [] | false | false | false | true | true | let wp =
| INT_STORE?.wp | false | |
FStar.Math.Euclid.fst | FStar.Math.Euclid.bezout_prime | val bezout_prime (p:int) (a:pos{a < p}) : Pure (int & int)
(requires is_prime p)
(ensures fun (r, s) -> r * p + s * a = 1) | val bezout_prime (p:int) (a:pos{a < p}) : Pure (int & int)
(requires is_prime p)
(ensures fun (r, s) -> r * p + s * a = 1) | let bezout_prime p a =
let r, s, d = euclid_gcd p a in
assert (r * p + s * a = d);
assert (is_gcd p a d);
is_gcd_prime p a;
is_gcd_unique p a 1 d;
assert (d = 1 \/ d = -1);
assert ((-r) * p + (-s) * a == -(r * p + s * a)) by (FStar.Tactics.Canon.canon());
if d = 1 then r, s else -r, -s | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 218,
"start_col": 0,
"start_line": 210
} | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: Prims.int -> a: Prims.pos{a < p} -> Prims.Pure (Prims.int * Prims.int) | Prims.Pure | [] | [] | [
"Prims.int",
"Prims.pos",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.op_Equality",
"FStar.Pervasives.Native.Mktuple2",
"Prims.bool",
"Prims.op_Minus",
"FStar.Pervasives.Native.tuple2",
"Prims.unit",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.eq2",
"Prims.op_Addition",
"FStar.Mul.op_Star... | [] | false | false | false | false | false | let bezout_prime p a =
| let r, s, d = euclid_gcd p a in
assert (r * p + s * a = d);
assert (is_gcd p a d);
is_gcd_prime p a;
is_gcd_unique p a 1 d;
assert (d = 1 \/ d = - 1);
FStar.Tactics.Effect.assert_by_tactic ((- r) * p + (- s) * a == - (r * p + s * a))
(fun _ ->
();
(FStar.Tactics.Canon.canon ()));
if d = 1 then r, s else -... | false |
FStar.DM4F.IntStoreFixed.fst | FStar.DM4F.IntStoreFixed.repr | val repr : a: Type ->
wp_a:
(
_: FStar.DM4F.Heap.IntStoreFixed.heap ->
_: (_: (a * FStar.DM4F.Heap.IntStoreFixed.heap) -> Type0)
-> Type0)
-> Type | let repr = INT_STORE?.repr | {
"file_name": "examples/dm4free/FStar.DM4F.IntStoreFixed.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 26,
"end_line": 56,
"start_col": 0,
"start_line": 56
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreFixedReader.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.DM4F.IntStoreFi... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
a: Type ->
wp_a:
(
_: FStar.DM4F.Heap.IntStoreFixed.heap ->
_: (_: (a * FStar.DM4F.Heap.IntStoreFixed.heap) -> Type0)
-> Type0)
-> Type | Prims.Tot | [
"total"
] | [] | [
"FStar.DM4F.IntStoreFixed._dm4f_INT_STORE_repr"
] | [] | false | false | false | true | true | let repr =
| INT_STORE?.repr | false | |
FStar.Math.Euclid.fst | FStar.Math.Euclid.euclid_prime | val euclid_prime (p:int{is_prime p}) (a b:int) : Lemma
(requires (a * b) % p = 0)
(ensures a % p = 0 \/ b % p = 0) | val euclid_prime (p:int{is_prime p}) (a b:int) : Lemma
(requires (a * b) % p = 0)
(ensures a % p = 0 \/ b % p = 0) | let euclid_prime p a b =
let ra, sa, da = euclid_gcd p a in
let rb, sb, db = euclid_gcd p b in
assert (is_gcd p a da);
assert (is_gcd p b db);
assert (da `divides` p);
assert (da = 1 \/ da = -1 \/ da = p \/ da = -p);
if da = 1 then
euclid p a b ra sa
else if da = -1 then
begin
assert ((-ra) ... | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 7,
"end_line": 273,
"start_col": 0,
"start_line": 252
} | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: Prims.int{FStar.Math.Euclid.is_prime p} -> a: Prims.int -> b: Prims.int
-> FStar.Pervasives.Lemma (requires a * b % p = 0) (ensures a % p = 0 \/ b % p = 0) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"FStar.Math.Euclid.is_prime",
"Prims.op_Equality",
"FStar.Math.Euclid.euclid",
"Prims.bool",
"Prims.op_Minus",
"Prims.unit",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.eq2",
"Prims.op_Addition",
"FStar.Mul.op_Star",
"FStar.Tactics.Canon.canon",
"FStar.Math.Euclid.divides_mo... | [] | false | false | true | false | false | let euclid_prime p a b =
| let ra, sa, da = euclid_gcd p a in
let rb, sb, db = euclid_gcd p b in
assert (is_gcd p a da);
assert (is_gcd p b db);
assert (da `divides` p);
assert (da = 1 \/ da = - 1 \/ da = p \/ da = - p);
if da = 1
then euclid p a b ra sa
else
if da = - 1
then
(FStar.Tactics.Effect.assert_by_tactic ((- ra) * p + (- sa) * ... | false |
Vale.Wrapper.X64.Sha.fsti | Vale.Wrapper.X64.Sha.uint32_i | val uint32_i : Type0 | let uint32_i = IB.ibuffer uint32 | {
"file_name": "vale/code/arch/x64/interop/Vale.Wrapper.X64.Sha.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 32,
"end_line": 17,
"start_col": 0,
"start_line": 17
} | module Vale.Wrapper.X64.Sha
open Vale.X64.CPU_Features_s
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module BV = LowStar.BufferView
module HS = FStar.HyperStack
module BF = Vale.Arch.BufferFriend
open FStar.Mul
open Vale.SHA.SHA_helpers
open Lib.IntTypes
unfold
let uint32_p ... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.SHA.SHA_helpers.fsti.checked",
"Vale.Arch.BufferFriend.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"prims.fst.checked",
"LowStar.ImmutableBuffer.fst.checked",
"LowStar.BufferView.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.SHA.SHA_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": ... | {
"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"
] | [] | [
"LowStar.ImmutableBuffer.ibuffer",
"Lib.IntTypes.uint32"
] | [] | false | false | false | true | true | let uint32_i =
| IB.ibuffer uint32 | false | |
FStar.DM4F.IntStoreFixed.fst | FStar.DM4F.IntStoreFixed.op_Colon_equals | val op_Colon_equals : i: FStar.DM4F.Heap.IntStoreFixed.id -> x: Prims.int -> FStar.DM4F.IntStoreFixed.INT_STORE Prims.unit | let op_Colon_equals = write | {
"file_name": "examples/dm4free/FStar.DM4F.IntStoreFixed.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 83,
"start_col": 0,
"start_line": 83
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreFixedReader.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.DM4F.IntStoreFi... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | i: FStar.DM4F.Heap.IntStoreFixed.id -> x: Prims.int -> FStar.DM4F.IntStoreFixed.INT_STORE Prims.unit | FStar.DM4F.IntStoreFixed.INT_STORE | [] | [] | [
"FStar.DM4F.IntStoreFixed.write"
] | [] | false | true | false | false | false | let op_Colon_equals =
| write | false | |
Vale.Wrapper.X64.Sha.fsti | Vale.Wrapper.X64.Sha.uint8_p | val uint8_p : Type0 | let uint8_p = B.buffer uint8 | {
"file_name": "vale/code/arch/x64/interop/Vale.Wrapper.X64.Sha.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 28,
"end_line": 19,
"start_col": 0,
"start_line": 19
} | module Vale.Wrapper.X64.Sha
open Vale.X64.CPU_Features_s
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module BV = LowStar.BufferView
module HS = FStar.HyperStack
module BF = Vale.Arch.BufferFriend
open FStar.Mul
open Vale.SHA.SHA_helpers
open Lib.IntTypes
unfold
let uint32_p ... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.SHA.SHA_helpers.fsti.checked",
"Vale.Arch.BufferFriend.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"prims.fst.checked",
"LowStar.ImmutableBuffer.fst.checked",
"LowStar.BufferView.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.SHA.SHA_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": ... | {
"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"
] | [] | [
"LowStar.Buffer.buffer",
"Lib.IntTypes.uint8"
] | [] | false | false | false | true | true | let uint8_p =
| B.buffer uint8 | false | |
FStar.DM4F.IntStoreFixed.fst | FStar.DM4F.IntStoreFixed.lift_int_store_reader_int_store_wp | val lift_int_store_reader_int_store_wp (a: Type) (wp: INT_STORE_READER?.wp a) : INT_STORE?.wp a | val lift_int_store_reader_int_store_wp (a: Type) (wp: INT_STORE_READER?.wp a) : INT_STORE?.wp a | let lift_int_store_reader_int_store_wp (a:Type) (wp:INT_STORE_READER?.wp a) : INT_STORE?.wp a =
fun (h0:heap) (p:INT_STORE?.post a) -> wp h0 (fun r -> p (r, h0)) | {
"file_name": "examples/dm4free/FStar.DM4F.IntStoreFixed.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 67,
"end_line": 110,
"start_col": 0,
"start_line": 109
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreFixedReader.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.DM4F.IntStoreFi... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixedReader",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Type -> wp: FStar.DM4F.IntStoreFixedReader._dm4f_INT_STORE_READER_wp a
-> FStar.DM4F.IntStoreFixed._dm4f_INT_STORE_wp a | Prims.Tot | [
"total"
] | [] | [
"FStar.DM4F.IntStoreFixedReader._dm4f_INT_STORE_READER_wp",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"FStar.DM4F.IntStoreFixed._dm4f_INT_STORE_post",
"FStar.Pervasives.Native.Mktuple2",
"FStar.DM4F.IntStoreFixed._dm4f_INT_STORE_wp"
] | [] | false | false | false | true | false | let lift_int_store_reader_int_store_wp (a: Type) (wp: INT_STORE_READER?.wp a) : INT_STORE?.wp a =
| fun (h0: heap) (p: INT_STORE?.post a) -> wp h0 (fun r -> p (r, h0)) | false |
Vale.Def.Words.Four_s.fsti | Vale.Def.Words.Four_s.four_select | val four_select (#a: Type) (x: four a) (selector: nat2) : a | val four_select (#a: Type) (x: four a) (selector: nat2) : a | let four_select (#a:Type) (x:four a) (selector:nat2) : a =
match selector with
| 0 -> x.lo0
| 1 -> x.lo1
| 2 -> x.hi2
| 3 -> x.hi3 | {
"file_name": "vale/specs/defs/Vale.Def.Words.Four_s.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 14,
"end_line": 52,
"start_col": 0,
"start_line": 47
} | module Vale.Def.Words.Four_s
open Vale.Def.Words_s
open FStar.Mul
unfold let four_map (#a #b:Type) (f:a -> b) (x:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
Mkfour (f x0) (f x1) (f x2) (f x3)
unfold let four_map2 (#a #b:Type) (f:a -> a -> b) (x y:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
let Mkfou... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Def.Words.Four_s.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"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.Def.Words_s.four a -> selector: Vale.Def.Words_s.nat2 -> a | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Words_s.four",
"Vale.Def.Words_s.nat2",
"Vale.Def.Words_s.__proj__Mkfour__item__lo0",
"Vale.Def.Words_s.__proj__Mkfour__item__lo1",
"Vale.Def.Words_s.__proj__Mkfour__item__hi2",
"Vale.Def.Words_s.__proj__Mkfour__item__hi3"
] | [] | false | false | false | true | false | let four_select (#a: Type) (x: four a) (selector: nat2) : a =
| match selector with
| 0 -> x.lo0
| 1 -> x.lo1
| 2 -> x.hi2
| 3 -> x.hi3 | false |
Vale.Wrapper.X64.Sha.fsti | Vale.Wrapper.X64.Sha.uint32_p | val uint32_p : Type0 | let uint32_p = B.buffer uint32 | {
"file_name": "vale/code/arch/x64/interop/Vale.Wrapper.X64.Sha.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 30,
"end_line": 15,
"start_col": 0,
"start_line": 15
} | module Vale.Wrapper.X64.Sha
open Vale.X64.CPU_Features_s
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module BV = LowStar.BufferView
module HS = FStar.HyperStack
module BF = Vale.Arch.BufferFriend
open FStar.Mul
open Vale.SHA.SHA_helpers
open Lib.IntTypes | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.SHA.SHA_helpers.fsti.checked",
"Vale.Arch.BufferFriend.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"prims.fst.checked",
"LowStar.ImmutableBuffer.fst.checked",
"LowStar.BufferView.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.SHA.SHA_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": ... | {
"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"
] | [] | [
"LowStar.Buffer.buffer",
"Lib.IntTypes.uint32"
] | [] | false | false | false | true | true | let uint32_p =
| B.buffer uint32 | false | |
FStar.Math.Euclid.fst | FStar.Math.Euclid.egcd | val egcd (a b u1 u2 u3 v1 v2 v3:int) : Pure (int & int & int)
(requires v3 >= 0 /\
u1 * a + u2 * b = u3 /\
v1 * a + v2 * b = v3 /\
(forall d. is_gcd u3 v3 d ==> is_gcd a b d))
(ensures (fun (u, v, d) -> u * a + v * b = d /\ is_gcd a b d))
(decreases v3) | val egcd (a b u1 u2 u3 v1 v2 v3:int) : Pure (int & int & int)
(requires v3 >= 0 /\
u1 * a + u2 * b = u3 /\
v1 * a + v2 * b = v3 /\
(forall d. is_gcd u3 v3 d ==> is_gcd a b d))
(ensures (fun (u, v, d) -> u * a + v * b = d /\ is_gcd a b d))
(decreases v3) | let rec egcd a b u1 u2 u3 v1 v2 v3 =
if v3 = 0 then
begin
divides_0 u3;
(u1, u2, u3)
end
else
begin
let q = u3 / v3 in
euclidean_division_definition u3 v3;
assert (u3 - q * v3 = (q * v3 + u3 % v3) - q * v3);
assert (q * v3 - q * v3 = 0);
swap_add_plus_minus (q * v3) (u3 % v3)... | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 7,
"end_line": 182,
"start_col": 0,
"start_line": 149
} | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
a: Prims.int ->
b: Prims.int ->
u1: Prims.int ->
u2: Prims.int ->
u3: Prims.int ->
v1: Prims.int ->
v2: Prims.int ->
v3: Prims.int
-> Prims.Pure ((Prims.int * Prims.int) * Prims.int) | Prims.Pure | [
""
] | [] | [
"Prims.int",
"Prims.op_Equality",
"FStar.Pervasives.Native.Mktuple3",
"Prims.unit",
"FStar.Math.Euclid.divides_0",
"Prims.bool",
"Prims.precedes",
"FStar.Pervasives.Native.tuple3",
"FStar.Math.Euclid.egcd",
"FStar.Classical.Sugar.forall_intro",
"Prims.l_imp",
"FStar.Math.Euclid.is_gcd",
"Pri... | [
"recursion"
] | false | false | false | false | false | let rec egcd a b u1 u2 u3 v1 v2 v3 =
| if v3 = 0
then
(divides_0 u3;
(u1, u2, u3))
else
let q = u3 / v3 in
euclidean_division_definition u3 v3;
assert (u3 - q * v3 = (q * v3 + u3 % v3) - q * v3);
assert (q * v3 - q * v3 = 0);
swap_add_plus_minus (q * v3) (u3 % v3) (q * v3);
calc ( == ) {
(u1 - q * v1) * a + (u2 - q * v2) * b;
( == ... | false |
Vale.Wrapper.X64.Sha.fsti | Vale.Wrapper.X64.Sha.uint64 | val uint64 : Type0 | let uint64 = uint_t U64 PUB | {
"file_name": "vale/code/arch/x64/interop/Vale.Wrapper.X64.Sha.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 27,
"end_line": 21,
"start_col": 0,
"start_line": 21
} | module Vale.Wrapper.X64.Sha
open Vale.X64.CPU_Features_s
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module BV = LowStar.BufferView
module HS = FStar.HyperStack
module BF = Vale.Arch.BufferFriend
open FStar.Mul
open Vale.SHA.SHA_helpers
open Lib.IntTypes
unfold
let uint32_p ... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.SHA.SHA_helpers.fsti.checked",
"Vale.Arch.BufferFriend.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"prims.fst.checked",
"LowStar.ImmutableBuffer.fst.checked",
"LowStar.BufferView.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.SHA.SHA_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": ... | {
"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"
] | [] | [
"Lib.IntTypes.uint_t",
"Lib.IntTypes.U64",
"Lib.IntTypes.PUB"
] | [] | false | false | false | true | true | let uint64 =
| uint_t U64 PUB | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.