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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
LowParse.SLow.Base.fst | LowParse.SLow.Base.parse32_total | val parse32_total (#k: parser_kind) (#t: Type) (#p: parser k t) (p32: parser32 p) (input: bytes32)
: Lemma
(requires
(k.parser_kind_high == Some k.parser_kind_low /\
k.parser_kind_metadata == Some ParserKindMetadataTotal /\
k.parser_kind_low <= B32.length input)) (ensures (Some? (p... | val parse32_total (#k: parser_kind) (#t: Type) (#p: parser k t) (p32: parser32 p) (input: bytes32)
: Lemma
(requires
(k.parser_kind_high == Some k.parser_kind_low /\
k.parser_kind_metadata == Some ParserKindMetadataTotal /\
k.parser_kind_low <= B32.length input)) (ensures (Some? (p... | let parse32_total
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(p32: parser32 p)
(input: bytes32)
: Lemma
(requires (
k.parser_kind_high == Some k.parser_kind_low /\
k.parser_kind_metadata == Some ParserKindMetadataTotal /\
k.parser_kind_low <= B32.length input
))
(ensures (
Some? (p32 ... | {
"file_name": "src/lowparse/LowParse.SLow.Base.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 28,
"end_line": 298,
"start_col": 0,
"start_line": 283
} | module LowParse.SLow.Base
include LowParse.Spec.Base
module B32 = LowParse.Bytes32
module U32 = FStar.UInt32
let bytes32 = B32.bytes
let parser32_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(input: bytes32)
(res: option (t * U32.t))
: GTot Type0
= let gp = parse p (B32.reveal input) in
match res... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p32: LowParse.SLow.Base.parser32 p -> input: LowParse.SLow.Base.bytes32
-> FStar.Pervasives.Lemma
(requires
Mkparser_kind'?.parser_kind_high k ==
FStar.Pervasives.Native.Some (Mkparser_kind'?.parser_kind_low k) /\
Mkparser_kind'?.parser_kind_metadata k ==
FStar.Pervasives.Native.... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.SLow.Base.parser32",
"LowParse.SLow.Base.bytes32",
"LowParse.Spec.Base.parser_kind_prop_equiv",
"Prims.unit",
"Prims.l_and",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"Prims.nat",
"LowParse.Spec.Base.__proj__Mkparser_k... | [] | true | false | true | false | false | let parse32_total (#k: parser_kind) (#t: Type) (#p: parser k t) (p32: parser32 p) (input: bytes32)
: Lemma
(requires
(k.parser_kind_high == Some k.parser_kind_low /\
k.parser_kind_metadata == Some ParserKindMetadataTotal /\
k.parser_kind_low <= B32.length input)) (ensures (Some? (p... | parser_kind_prop_equiv k p | false |
LowParse.SLow.Base.fst | LowParse.SLow.Base.size32_constant_precond | val size32_constant_precond
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(len32: U32.t)
: GTot Type0 | val size32_constant_precond
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(len32: U32.t)
: GTot Type0 | let size32_constant_precond
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(len32: U32.t)
: GTot Type0
= k.parser_kind_high == Some k.parser_kind_low /\
U32.v len32 == k.parser_kind_low | {
"file_name": "src/lowparse/LowParse.SLow.Base.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 34,
"end_line": 352,
"start_col": 0,
"start_line": 344
} | module LowParse.SLow.Base
include LowParse.Spec.Base
module B32 = LowParse.Bytes32
module U32 = FStar.UInt32
let bytes32 = B32.bytes
let parser32_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(input: bytes32)
(res: option (t * U32.t))
: GTot Type0
= let gp = parse p (B32.reveal input) in
match res... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: LowParse.Spec.Base.serializer p -> len32: FStar.UInt32.t -> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"FStar.UInt32.t",
"Prims.l_and",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"Prims.nat",
"LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_high",
"FStar.Pervasives.Native.Some",
"LowPa... | [] | false | false | false | false | true | let size32_constant_precond
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(len32: U32.t)
: GTot Type0 =
| k.parser_kind_high == Some k.parser_kind_low /\ U32.v len32 == k.parser_kind_low | false |
LowParse.SLow.Base.fst | LowParse.SLow.Base.bytes_of_seq' | val bytes_of_seq' (x: Seq.seq byte) (accu: bytes32{B32.length accu + Seq.length x < 4294967296})
: Tot (y: bytes32{(B32.reveal y) `Seq.equal` ((B32.reveal accu) `Seq.append` x)})
(decreases (Seq.length x)) | val bytes_of_seq' (x: Seq.seq byte) (accu: bytes32{B32.length accu + Seq.length x < 4294967296})
: Tot (y: bytes32{(B32.reveal y) `Seq.equal` ((B32.reveal accu) `Seq.append` x)})
(decreases (Seq.length x)) | let rec bytes_of_seq'
(x: Seq.seq byte)
(accu: bytes32 { B32.length accu + Seq.length x < 4294967296 })
: Tot (y: bytes32 { B32.reveal y `Seq.equal` (B32.reveal accu `Seq.append` x) })
(decreases (Seq.length x))
= if Seq.length x = 0
then accu
else bytes_of_seq' (Seq.tail x) (B32.append accu (B32.create 1ul ... | {
"file_name": "src/lowparse/LowParse.SLow.Base.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 81,
"end_line": 393,
"start_col": 0,
"start_line": 386
} | module LowParse.SLow.Base
include LowParse.Spec.Base
module B32 = LowParse.Bytes32
module U32 = FStar.UInt32
let bytes32 = B32.bytes
let parser32_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(input: bytes32)
(res: option (t * U32.t))
: GTot Type0
= let gp = parse p (B32.reveal input) in
match res... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
x: FStar.Seq.Base.seq LowParse.Bytes.byte ->
accu: LowParse.SLow.Base.bytes32{FStar.Bytes.length accu + FStar.Seq.Base.length x < 4294967296}
-> Prims.Tot
(y:
LowParse.SLow.Base.bytes32
{ FStar.Seq.Base.equal (FStar.Bytes.reveal y)
(FStar.Seq.Base.append (FStar.Bytes.reveal accu... | Prims.Tot | [
"total",
""
] | [] | [
"FStar.Seq.Base.seq",
"LowParse.Bytes.byte",
"LowParse.SLow.Base.bytes32",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.op_Addition",
"FStar.Bytes.length",
"FStar.Seq.Base.length",
"Prims.op_Equality",
"Prims.int",
"Prims.bool",
"LowParse.SLow.Base.bytes_of_seq'",
"FStar.Seq.Properties.tail",
... | [
"recursion"
] | false | false | false | false | false | let rec bytes_of_seq' (x: Seq.seq byte) (accu: bytes32{B32.length accu + Seq.length x < 4294967296})
: Tot (y: bytes32{(B32.reveal y) `Seq.equal` ((B32.reveal accu) `Seq.append` x)})
(decreases (Seq.length x)) =
| if Seq.length x = 0
then accu
else bytes_of_seq' (Seq.tail x) (B32.append accu (B32.create 1ul (Seq.head x))) | false |
LowParse.SLow.Base.fst | LowParse.SLow.Base.u32_max | val u32_max:(y: U32.t{forall (x: U32.t). {:pattern (U32.v x)} U32.v x <= U32.v y}) | val u32_max:(y: U32.t{forall (x: U32.t). {:pattern (U32.v x)} U32.v x <= U32.v y}) | let u32_max : (y: U32.t { forall (x: U32.t) . {:pattern (U32.v x)} U32.v x <= U32.v y } ) =
4294967295ul | {
"file_name": "src/lowparse/LowParse.SLow.Base.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 14,
"end_line": 302,
"start_col": 0,
"start_line": 301
} | module LowParse.SLow.Base
include LowParse.Spec.Base
module B32 = LowParse.Bytes32
module U32 = FStar.UInt32
let bytes32 = B32.bytes
let parser32_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(input: bytes32)
(res: option (t * U32.t))
: GTot Type0
= let gp = parse p (B32.reveal input) in
match res... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | y:
FStar.UInt32.t
{forall (x: FStar.UInt32.t). {:pattern FStar.UInt32.v x} FStar.UInt32.v x <= FStar.UInt32.v y} | Prims.Tot | [
"total"
] | [] | [
"FStar.UInt32.__uint_to_t"
] | [] | false | false | false | false | false | let u32_max:(y: U32.t{forall (x: U32.t). {:pattern (U32.v x)} U32.v x <= U32.v y}) =
| 4294967295ul | false |
LowParse.SLow.Base.fst | LowParse.SLow.Base.size32_constant | val size32_constant
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(len32: U32.t)
(u: unit{size32_constant_precond s len32})
: Tot (size32 s) | val size32_constant
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(len32: U32.t)
(u: unit{size32_constant_precond s len32})
: Tot (size32 s) | let size32_constant
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(len32: U32.t)
(u: unit { size32_constant_precond s len32 } )
: Tot (size32 s)
= fun x ->
[@inline_let]
let (z: U32.t { size32_postcond s x z } ) = len32 in
z | {
"file_name": "src/lowparse/LowParse.SLow.Base.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 3,
"end_line": 366,
"start_col": 0,
"start_line": 355
} | module LowParse.SLow.Base
include LowParse.Spec.Base
module B32 = LowParse.Bytes32
module U32 = FStar.UInt32
let bytes32 = B32.bytes
let parser32_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(input: bytes32)
(res: option (t * U32.t))
: GTot Type0
= let gp = parse p (B32.reveal input) in
match res... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
s: LowParse.Spec.Base.serializer p ->
len32: FStar.UInt32.t ->
u353: u354: Prims.unit{LowParse.SLow.Base.size32_constant_precond s len32}
-> LowParse.SLow.Base.size32 s | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"FStar.UInt32.t",
"Prims.unit",
"LowParse.SLow.Base.size32_constant_precond",
"LowParse.SLow.Base.size32_postcond",
"LowParse.SLow.Base.size32"
] | [] | false | false | false | false | false | let size32_constant
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(len32: U32.t)
(u: unit{size32_constant_precond s len32})
: Tot (size32 s) =
| fun x ->
[@@ inline_let ]let z:z: U32.t{size32_postcond s x z} = len32 in
z | false |
LowParse.SLow.Base.fst | LowParse.SLow.Base.serializer32_correct_length | val serializer32_correct_length
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(input: t)
(res: bytes32)
: Lemma (requires (serializer32_correct s input res))
(ensures
(let len = FStar.Bytes.length res in
k.parser_kind_low <= len /\
... | val serializer32_correct_length
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(input: t)
(res: bytes32)
: Lemma (requires (serializer32_correct s input res))
(ensures
(let len = FStar.Bytes.length res in
k.parser_kind_low <= len /\
... | let serializer32_correct_length
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(input: t)
(res: bytes32)
: Lemma
(requires (serializer32_correct s input res))
(ensures (
let len = FStar.Bytes.length res in
k.parser_kind_low <= len /\ (
match k.parser_kind_high with
| Som... | {
"file_name": "src/lowparse/LowParse.SLow.Base.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 26,
"end_line": 147,
"start_col": 0,
"start_line": 130
} | module LowParse.SLow.Base
include LowParse.Spec.Base
module B32 = LowParse.Bytes32
module U32 = FStar.UInt32
let bytes32 = B32.bytes
let parser32_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(input: bytes32)
(res: option (t * U32.t))
: GTot Type0
= let gp = parse p (B32.reveal input) in
match res... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: LowParse.Spec.Base.serializer p -> input: t -> res: LowParse.SLow.Base.bytes32
-> FStar.Pervasives.Lemma (requires LowParse.SLow.Base.serializer32_correct s input res)
(ensures
(let len = FStar.Bytes.length res in
Mkparser_kind'?.parser_kind_low k <= len /\
(match Mkparser_kind'?.... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"LowParse.SLow.Base.bytes32",
"LowParse.Spec.Base.serialize_length",
"Prims.unit",
"LowParse.SLow.Base.serializer32_correct",
"Prims.squash",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
... | [] | true | false | true | false | false | let serializer32_correct_length
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(input: t)
(res: bytes32)
: Lemma (requires (serializer32_correct s input res))
(ensures
(let len = FStar.Bytes.length res in
k.parser_kind_low <= len /\
... | serialize_length s input | false |
LowParse.SLow.Base.fst | LowParse.SLow.Base.serializer32_injective | val serializer32_injective
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(s32: serializer32 s)
(input1 input2: t)
: Lemma (requires (s32 input1 == s32 input2)) (ensures (input1 == input2)) | val serializer32_injective
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(s32: serializer32 s)
(input1 input2: t)
: Lemma (requires (s32 input1 == s32 input2)) (ensures (input1 == input2)) | let serializer32_injective
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(s32: serializer32 s)
(input1 input2: t)
: Lemma
(requires (s32 input1 == s32 input2))
(ensures (input1 == input2))
= assert (parse p (serialize s input1) == parse p (serialize s input2)) | {
"file_name": "src/lowparse/LowParse.SLow.Base.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 71,
"end_line": 263,
"start_col": 0,
"start_line": 253
} | module LowParse.SLow.Base
include LowParse.Spec.Base
module B32 = LowParse.Bytes32
module U32 = FStar.UInt32
let bytes32 = B32.bytes
let parser32_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(input: bytes32)
(res: option (t * U32.t))
: GTot Type0
= let gp = parse p (B32.reveal input) in
match res... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
s: LowParse.Spec.Base.serializer p ->
s32: LowParse.SLow.Base.serializer32 s ->
input1: t ->
input2: t
-> FStar.Pervasives.Lemma (requires s32 input1 == s32 input2) (ensures input1 == input2) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"LowParse.SLow.Base.serializer32",
"Prims._assert",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"FStar.Pervasives.Native.tuple2",
"LowParse.Spec.Base.consumed_length",
"LowParse.Spec.Base.serialize",... | [] | true | false | true | false | false | let serializer32_injective
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(s32: serializer32 s)
(input1 input2: t)
: Lemma (requires (s32 input1 == s32 input2)) (ensures (input1 == input2)) =
| assert (parse p (serialize s input1) == parse p (serialize s input2)) | false |
LowParse.SLow.Base.fst | LowParse.SLow.Base.size32_postcond | val size32_postcond
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(x: t)
(y: U32.t)
: GTot Type0 | val size32_postcond
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(x: t)
(y: U32.t)
: GTot Type0 | let size32_postcond
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(x: t)
(y: U32.t)
: GTot Type0
= let sz = Seq.length (serialize s x) in
if sz > U32.v u32_max
then y == u32_max
else U32.v y == sz | {
"file_name": "src/lowparse/LowParse.SLow.Base.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 20,
"end_line": 329,
"start_col": 0,
"start_line": 318
} | module LowParse.SLow.Base
include LowParse.Spec.Base
module B32 = LowParse.Bytes32
module U32 = FStar.UInt32
let bytes32 = B32.bytes
let parser32_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(input: bytes32)
(res: option (t * U32.t))
: GTot Type0
= let gp = parse p (B32.reveal input) in
match res... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: LowParse.Spec.Base.serializer p -> x: t -> y: FStar.UInt32.t -> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"FStar.UInt32.t",
"Prims.op_GreaterThan",
"FStar.UInt32.v",
"LowParse.SLow.Base.u32_max",
"Prims.eq2",
"Prims.bool",
"Prims.int",
"Prims.l_or",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"FStar... | [] | false | false | false | false | true | let size32_postcond
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(x: t)
(y: U32.t)
: GTot Type0 =
| let sz = Seq.length (serialize s x) in
if sz > U32.v u32_max then y == u32_max else U32.v y == sz | false |
LowParse.SLow.Base.fst | LowParse.SLow.Base.parser32_then_serializer32 | val parser32_then_serializer32
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(p32: parser32 p)
(s32: serializer32 s)
(input: bytes32)
: Lemma (requires (Some? (p32 input)))
(ensures
(let Some (v, consumed) = p32 input in
U32.v consu... | val parser32_then_serializer32
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(p32: parser32 p)
(s32: serializer32 s)
(input: bytes32)
: Lemma (requires (Some? (p32 input)))
(ensures
(let Some (v, consumed) = p32 input in
U32.v consu... | let parser32_then_serializer32
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(p32: parser32 p)
(s32: serializer32 s)
(input: bytes32)
: Lemma
(requires (Some? (p32 input)))
(ensures (
let (Some (v, consumed)) = p32 input in
U32.v consumed <= B32.length input /\
s32 v == B... | {
"file_name": "src/lowparse/LowParse.SLow.Base.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 41,
"end_line": 199,
"start_col": 0,
"start_line": 184
} | module LowParse.SLow.Base
include LowParse.Spec.Base
module B32 = LowParse.Bytes32
module U32 = FStar.UInt32
let bytes32 = B32.bytes
let parser32_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(input: bytes32)
(res: option (t * U32.t))
: GTot Type0
= let gp = parse p (B32.reveal input) in
match res... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
s: LowParse.Spec.Base.serializer p ->
p32: LowParse.SLow.Base.parser32 p ->
s32: LowParse.SLow.Base.serializer32 s ->
input: LowParse.SLow.Base.bytes32
-> FStar.Pervasives.Lemma (requires Some? (p32 input))
(ensures
(let _ = p32 input in
(let FStar.Pervasives.Native.Some #_ (F... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"LowParse.SLow.Base.parser32",
"LowParse.SLow.Base.serializer32",
"LowParse.SLow.Base.bytes32",
"LowParse.Spec.Base.serializer_correct_implies_complete",
"Prims.unit",
"Prims.b2t",
"FStar.Pervasives.Nat... | [] | true | false | true | false | false | let parser32_then_serializer32
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(p32: parser32 p)
(s32: serializer32 s)
(input: bytes32)
: Lemma (requires (Some? (p32 input)))
(ensures
(let Some (v, consumed) = p32 input in
U32.v consu... | serializer_correct_implies_complete p s | false |
Hacl.Spec.Poly1305.Lemmas.fst | Hacl.Spec.Poly1305.Lemmas.prime | val prime:pos | val prime:pos | let prime: pos = Scalar.prime | {
"file_name": "code/poly1305/Hacl.Spec.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 29,
"end_line": 13,
"start_col": 0,
"start_line": 13
} | module Hacl.Spec.Poly1305.Lemmas
open FStar.Mul
module Scalar = Spec.Poly1305
open FStar.Algebra.CommMonoid
open FStar.Tactics.CanonCommSemiring
/// Semiring for Poly1305
#set-options "--z3rlimit 5 --max_fuel 0 --max_ifuel 0 --z3cliopt smt.arith.nl=false" | {
"checked_file": "/",
"dependencies": [
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.CanonCommSemiring.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommSemiring",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra.CommMonoid",
"short_module": null
},
{
"abbrev": true,
"full_module": "Spec.Poly1305",
"short_module": "Scalar"
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Prims.pos | Prims.Tot | [
"total"
] | [] | [
"Spec.Poly1305.prime"
] | [] | false | false | false | true | false | let prime:pos =
| Scalar.prime | false |
LowParse.SLow.Base.fst | LowParse.SLow.Base.parse32_size | val parse32_size
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(p32: parser32 p)
(input: bytes32)
(data: t)
(consumed: U32.t)
: Lemma (requires (p32 input == Some (data, consumed)))
(ensures
(k.parser_kind_low <= U32.v consumed /\
(Some? k.parser_kin... | val parse32_size
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(p32: parser32 p)
(input: bytes32)
(data: t)
(consumed: U32.t)
: Lemma (requires (p32 input == Some (data, consumed)))
(ensures
(k.parser_kind_low <= U32.v consumed /\
(Some? k.parser_kin... | let parse32_size
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(p32: parser32 p)
(input: bytes32)
(data: t)
(consumed: U32.t)
: Lemma
(requires (p32 input == Some (data, consumed)))
(ensures (
k.parser_kind_low <= U32.v consumed /\ (
Some? k.parser_kind_high ==> (
let (Some hi) = k.parser_... | {
"file_name": "src/lowparse/LowParse.SLow.Base.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 28,
"end_line": 281,
"start_col": 0,
"start_line": 265
} | module LowParse.SLow.Base
include LowParse.Spec.Base
module B32 = LowParse.Bytes32
module U32 = FStar.UInt32
let bytes32 = B32.bytes
let parser32_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(input: bytes32)
(res: option (t * U32.t))
: GTot Type0
= let gp = parse p (B32.reveal input) in
match res... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
p32: LowParse.SLow.Base.parser32 p ->
input: LowParse.SLow.Base.bytes32 ->
data: t ->
consumed: FStar.UInt32.t
-> FStar.Pervasives.Lemma (requires p32 input == FStar.Pervasives.Native.Some (data, consumed))
(ensures
Mkparser_kind'?.parser_kind_low k <= FStar.UInt32.v consumed /\
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.SLow.Base.parser32",
"LowParse.SLow.Base.bytes32",
"FStar.UInt32.t",
"LowParse.Spec.Base.parser_kind_prop_equiv",
"Prims.unit",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasi... | [] | true | false | true | false | false | let parse32_size
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(p32: parser32 p)
(input: bytes32)
(data: t)
(consumed: U32.t)
: Lemma (requires (p32 input == Some (data, consumed)))
(ensures
(k.parser_kind_low <= U32.v consumed /\
(Some? k.parser_kin... | parser_kind_prop_equiv k p | false |
LowParse.SLow.Base.fst | LowParse.SLow.Base.add_overflow | val add_overflow (x y: U32.t)
: Pure U32.t
(requires True)
(ensures
(fun z ->
if U32.v x + U32.v y > U32.v u32_max then z == u32_max else U32.v z == U32.v x + U32.v y
)) | val add_overflow (x y: U32.t)
: Pure U32.t
(requires True)
(ensures
(fun z ->
if U32.v x + U32.v y > U32.v u32_max then z == u32_max else U32.v z == U32.v x + U32.v y
)) | let add_overflow
(x y: U32.t)
: Pure U32.t
(requires True)
(ensures (fun z ->
if U32.v x + U32.v y > U32.v u32_max then
z == u32_max
else U32.v z == U32.v x + U32.v y
))
= if U32.lt (U32.sub u32_max y) x
then u32_max
else U32.add x y | {
"file_name": "src/lowparse/LowParse.SLow.Base.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 18,
"end_line": 316,
"start_col": 0,
"start_line": 305
} | module LowParse.SLow.Base
include LowParse.Spec.Base
module B32 = LowParse.Bytes32
module U32 = FStar.UInt32
let bytes32 = B32.bytes
let parser32_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(input: bytes32)
(res: option (t * U32.t))
: GTot Type0
= let gp = parse p (B32.reveal input) in
match res... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: FStar.UInt32.t -> y: FStar.UInt32.t -> Prims.Pure FStar.UInt32.t | Prims.Pure | [] | [] | [
"FStar.UInt32.t",
"FStar.UInt32.lt",
"FStar.UInt32.sub",
"LowParse.SLow.Base.u32_max",
"Prims.bool",
"FStar.UInt32.add",
"Prims.l_True",
"Prims.op_GreaterThan",
"Prims.op_Addition",
"FStar.UInt32.v",
"Prims.eq2",
"Prims.int"
] | [] | false | false | false | false | false | let add_overflow (x y: U32.t)
: Pure U32.t
(requires True)
(ensures
(fun z ->
if U32.v x + U32.v y > U32.v u32_max then z == u32_max else U32.v z == U32.v x + U32.v y
)) =
| if U32.lt (U32.sub u32_max y) x then u32_max else U32.add x y | false |
LowParse.SLow.Base.fst | LowParse.SLow.Base.seq_of_bytes | val seq_of_bytes (x: bytes32) : Tot (y: Seq.seq byte {y `Seq.equal` (B32.reveal x)}) | val seq_of_bytes (x: bytes32) : Tot (y: Seq.seq byte {y `Seq.equal` (B32.reveal x)}) | let seq_of_bytes
(x: bytes32)
: Tot (y: Seq.seq byte { y `Seq.equal` B32.reveal x })
= seq_of_bytes' x Seq.empty | {
"file_name": "src/lowparse/LowParse.SLow.Base.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 27,
"end_line": 451,
"start_col": 0,
"start_line": 448
} | module LowParse.SLow.Base
include LowParse.Spec.Base
module B32 = LowParse.Bytes32
module U32 = FStar.UInt32
let bytes32 = B32.bytes
let parser32_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(input: bytes32)
(res: option (t * U32.t))
: GTot Type0
= let gp = parse p (B32.reveal input) in
match res... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: LowParse.SLow.Base.bytes32
-> y: FStar.Seq.Base.seq LowParse.Bytes.byte {FStar.Seq.Base.equal y (FStar.Bytes.reveal x)} | Prims.Tot | [
"total"
] | [] | [
"LowParse.SLow.Base.bytes32",
"LowParse.SLow.Base.seq_of_bytes'",
"FStar.Seq.Base.empty",
"LowParse.Bytes.byte",
"FStar.Seq.Base.seq",
"FStar.Seq.Base.equal",
"FStar.Bytes.reveal"
] | [] | false | false | false | false | false | let seq_of_bytes (x: bytes32) : Tot (y: Seq.seq byte {y `Seq.equal` (B32.reveal x)}) =
| seq_of_bytes' x Seq.empty | false |
LowParse.SLow.Base.fst | LowParse.SLow.Base.parser32_then_serializer32' | val parser32_then_serializer32'
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(#s: serializer p)
(p32: parser32 p)
(s32: serializer32 s)
(input: bytes32)
(v: t)
(consumed: U32.t)
: Lemma (requires (p32 input == Some (v, consumed)))
(ensures
(B32.le... | val parser32_then_serializer32'
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(#s: serializer p)
(p32: parser32 p)
(s32: serializer32 s)
(input: bytes32)
(v: t)
(consumed: U32.t)
: Lemma (requires (p32 input == Some (v, consumed)))
(ensures
(B32.le... | let parser32_then_serializer32'
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(#s: serializer p)
(p32: parser32 p)
(s32: serializer32 s)
(input: bytes32)
(v: t)
(consumed: U32.t)
: Lemma
(requires (p32 input == Some (v, consumed)))
(ensures (
B32.length (s32 v) == U32.v consumed /\
U32.v c... | {
"file_name": "src/lowparse/LowParse.SLow.Base.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 44,
"end_line": 218,
"start_col": 0,
"start_line": 201
} | module LowParse.SLow.Base
include LowParse.Spec.Base
module B32 = LowParse.Bytes32
module U32 = FStar.UInt32
let bytes32 = B32.bytes
let parser32_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(input: bytes32)
(res: option (t * U32.t))
: GTot Type0
= let gp = parse p (B32.reveal input) in
match res... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
p32: LowParse.SLow.Base.parser32 p ->
s32: LowParse.SLow.Base.serializer32 s ->
input: LowParse.SLow.Base.bytes32 ->
v: t ->
consumed: FStar.UInt32.t
-> FStar.Pervasives.Lemma (requires p32 input == FStar.Pervasives.Native.Some (v, consumed))
(ensures
FStar.Bytes.length (s32 v) == F... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"LowParse.SLow.Base.parser32",
"LowParse.SLow.Base.serializer32",
"LowParse.SLow.Base.bytes32",
"FStar.UInt32.t",
"LowParse.SLow.Base.parser32_then_serializer32",
"Prims.unit",
"Prims.eq2",
"FStar.Per... | [] | true | false | true | false | false | let parser32_then_serializer32'
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(#s: serializer p)
(p32: parser32 p)
(s32: serializer32 s)
(input: bytes32)
(v: t)
(consumed: U32.t)
: Lemma (requires (p32 input == Some (v, consumed)))
(ensures
(B32.le... | parser32_then_serializer32 s p32 s32 input | false |
LowParse.SLow.Base.fst | LowParse.SLow.Base.size32_ext | val size32_ext
(#k1: parser_kind)
(#t1: Type)
(p1: parser k1 t1)
(s1: serializer p1)
(s1': size32 s1)
(#k2: parser_kind)
(#t2: Type)
(p2: parser k2 t2)
(u: squash (t1 == t2 /\ (forall (input: bytes). parse p1 input == parse p2 input)))
: Tot (size32 (serialize_e... | val size32_ext
(#k1: parser_kind)
(#t1: Type)
(p1: parser k1 t1)
(s1: serializer p1)
(s1': size32 s1)
(#k2: parser_kind)
(#t2: Type)
(p2: parser k2 t2)
(u: squash (t1 == t2 /\ (forall (input: bytes). parse p1 input == parse p2 input)))
: Tot (size32 (serialize_e... | let size32_ext
(#k1: parser_kind)
(#t1: Type)
(p1: parser k1 t1)
(s1: serializer p1)
(s1': size32 s1)
(#k2: parser_kind)
(#t2: Type)
(p2: parser k2 t2)
(u: squash (t1 == t2 /\ (forall (input: bytes) . parse p1 input == parse p2 input)))
: Tot (size32 (serialize_ext p1 s1 p2))
= fun input -> s1' input | {
"file_name": "src/lowparse/LowParse.SLow.Base.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 24,
"end_line": 380,
"start_col": 0,
"start_line": 369
} | module LowParse.SLow.Base
include LowParse.Spec.Base
module B32 = LowParse.Bytes32
module U32 = FStar.UInt32
let bytes32 = B32.bytes
let parser32_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(input: bytes32)
(res: option (t * U32.t))
: GTot Type0
= let gp = parse p (B32.reveal input) in
match res... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
p1: LowParse.Spec.Base.parser k1 t1 ->
s1: LowParse.Spec.Base.serializer p1 ->
s1': LowParse.SLow.Base.size32 s1 ->
p2: LowParse.Spec.Base.parser k2 t2 ->
u374:
Prims.squash (t1 == t2 /\
(forall (input: LowParse.Bytes.bytes).
LowParse.Spec.Base.parse p1 input == LowPar... | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"LowParse.SLow.Base.size32",
"Prims.squash",
"Prims.l_and",
"Prims.eq2",
"Prims.l_Forall",
"LowParse.Bytes.bytes",
"FStar.Pervasives.Native.option",
"FStar.Pervasives.Native.tuple2",
"LowParse.Spec.... | [] | false | false | false | false | false | let size32_ext
(#k1: parser_kind)
(#t1: Type)
(p1: parser k1 t1)
(s1: serializer p1)
(s1': size32 s1)
(#k2: parser_kind)
(#t2: Type)
(p2: parser k2 t2)
(u: squash (t1 == t2 /\ (forall (input: bytes). parse p1 input == parse p2 input)))
: Tot (size32 (serialize_e... | fun input -> s1' input | false |
LowParse.SLow.Base.fst | LowParse.SLow.Base.bytes_of_seq | val bytes_of_seq (x: Seq.seq byte {Seq.length x < 4294967296})
: Tot (y: bytes32{(B32.reveal y) `Seq.equal` x}) | val bytes_of_seq (x: Seq.seq byte {Seq.length x < 4294967296})
: Tot (y: bytes32{(B32.reveal y) `Seq.equal` x}) | let bytes_of_seq
(x: Seq.seq byte { Seq.length x < 4294967296 })
: Tot (y: bytes32 { B32.reveal y `Seq.equal` x })
= bytes_of_seq' x B32.empty_bytes | {
"file_name": "src/lowparse/LowParse.SLow.Base.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 33,
"end_line": 400,
"start_col": 0,
"start_line": 397
} | module LowParse.SLow.Base
include LowParse.Spec.Base
module B32 = LowParse.Bytes32
module U32 = FStar.UInt32
let bytes32 = B32.bytes
let parser32_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(input: bytes32)
(res: option (t * U32.t))
: GTot Type0
= let gp = parse p (B32.reveal input) in
match res... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: FStar.Seq.Base.seq LowParse.Bytes.byte {FStar.Seq.Base.length x < 4294967296}
-> y: LowParse.SLow.Base.bytes32{FStar.Seq.Base.equal (FStar.Bytes.reveal y) x} | Prims.Tot | [
"total"
] | [] | [
"FStar.Seq.Base.seq",
"LowParse.Bytes.byte",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Seq.Base.length",
"LowParse.SLow.Base.bytes_of_seq'",
"FStar.Bytes.empty_bytes",
"LowParse.SLow.Base.bytes32",
"FStar.Seq.Base.equal",
"FStar.Bytes.byte",
"FStar.Bytes.reveal"
] | [] | false | false | false | false | false | let bytes_of_seq (x: Seq.seq byte {Seq.length x < 4294967296})
: Tot (y: bytes32{(B32.reveal y) `Seq.equal` x}) =
| bytes_of_seq' x B32.empty_bytes | false |
LowParse.SLow.Base.fst | LowParse.SLow.Base.serialize_tot_seq_of_serializer32 | val serialize_tot_seq_of_serializer32
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(#s: serializer p)
(s32: serializer32 s)
(x: t)
: Tot (y: _{y == serialize s x}) | val serialize_tot_seq_of_serializer32
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(#s: serializer p)
(s32: serializer32 s)
(x: t)
: Tot (y: _{y == serialize s x}) | let serialize_tot_seq_of_serializer32
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(#s: serializer p)
(s32: serializer32 s)
(x: t)
: Tot (y: _ { y == serialize s x })
= seq_of_bytes (s32 x) | {
"file_name": "src/lowparse/LowParse.SLow.Base.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 22,
"end_line": 462,
"start_col": 0,
"start_line": 454
} | module LowParse.SLow.Base
include LowParse.Spec.Base
module B32 = LowParse.Bytes32
module U32 = FStar.UInt32
let bytes32 = B32.bytes
let parser32_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(input: bytes32)
(res: option (t * U32.t))
: GTot Type0
= let gp = parse p (B32.reveal input) in
match res... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s32: LowParse.SLow.Base.serializer32 s -> x: t
-> y: LowParse.Bytes.bytes{y == LowParse.Spec.Base.serialize s x} | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"LowParse.SLow.Base.serializer32",
"LowParse.SLow.Base.seq_of_bytes",
"LowParse.Bytes.bytes",
"Prims.eq2",
"LowParse.Spec.Base.serialize"
] | [] | false | false | false | false | false | let serialize_tot_seq_of_serializer32
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(#s: serializer p)
(s32: serializer32 s)
(x: t)
: Tot (y: _{y == serialize s x}) =
| seq_of_bytes (s32 x) | false |
LowStar.Endianness.fst | LowStar.Endianness.upd_32_be | val upd_32_be (#rrel #rel: MB.srel u8) (b: MB.mbuffer u8 rrel rel) (i v: u32)
: Stack unit
(requires
fun h ->
MB.length b % 4 = 0 /\ U32.v i < MB.length b / 4 /\
store_pre b (let open U32 in v (4ul *^ i)) 4 (fun s -> be_to_n s == U32.v v) h)
(ensures
fun h0 _ h1 ->
... | val upd_32_be (#rrel #rel: MB.srel u8) (b: MB.mbuffer u8 rrel rel) (i v: u32)
: Stack unit
(requires
fun h ->
MB.length b % 4 = 0 /\ U32.v i < MB.length b / 4 /\
store_pre b (let open U32 in v (4ul *^ i)) 4 (fun s -> be_to_n s == U32.v v) h)
(ensures
fun h0 _ h1 ->
... | let upd_32_be
(#rrel #rel:MB.srel u8) (b:MB.mbuffer u8 rrel rel)
(i:u32) (v:u32)
: Stack unit
(requires fun h ->
MB.length b % 4 = 0 /\
U32.v i < MB.length b / 4 /\
store_pre b (U32.(v (4ul *^ i))) 4 (fun s -> be_to_n s == U32.v v) h)
(ensures fun h0 _ h1 ->
MB.(modifies (loc... | {
"file_name": "ulib/LowStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 8,
"end_line": 551,
"start_col": 0,
"start_line": 493
} | module LowStar.Endianness
/// Stateful operations between machine integers and buffers of uint8s. Most of
/// these operations are implemented natively using the target's system endianness
/// headers, relying on macros or static inline declarations.
///
/// .. note::
///
/// This module supersedes ``C.Endianness``... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt128",
"short_module": "U128"
},
{
"abbrev": true,
"full_module": "FS... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
b: LowStar.Monotonic.Buffer.mbuffer LowStar.Endianness.u8 rrel rel ->
i: LowStar.Endianness.u32 ->
v: LowStar.Endianness.u32
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"LowStar.Monotonic.Buffer.srel",
"LowStar.Endianness.u8",
"LowStar.Monotonic.Buffer.mbuffer",
"LowStar.Endianness.u32",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"FStar.Seq.Base.equal",
"FStar.UInt32.t",
"FStar.Endianness.seq_uint32_of_be",
"Prims.op_Division",
"LowStar.Monotonic.Buffer.le... | [] | false | true | false | false | false | let upd_32_be (#rrel #rel: MB.srel u8) (b: MB.mbuffer u8 rrel rel) (i v: u32)
: Stack unit
(requires
fun h ->
MB.length b % 4 = 0 /\ U32.v i < MB.length b / 4 /\
store_pre b (let open U32 in v (4ul *^ i)) 4 (fun s -> be_to_n s == U32.v v) h)
(ensures
fun h0 _ h1 ->
... | let h0 = get () in
store32_be_i b U32.(4ul *^ i) v;
let h1 = get () in
assert (be_to_n (Seq.slice (MB.as_seq h1 b)
(let open U32 in v (4ul *^ i))
(let open U32 in v (4ul *^ i) + 4)) ==
U32.v v);
assert (Seq.equal (Seq.slice (MB.as_seq h0 b) 0 (let open U32 in v (4ul *^ i)))
(Seq.slice (MB.... | false |
LowParse.SLow.Base.fst | LowParse.SLow.Base.seq_of_bytes' | val seq_of_bytes' (x: bytes32) (accu: Seq.seq byte)
: Tot (y: Seq.seq byte {y `Seq.equal` (accu `Seq.append` (B32.reveal x))})
(decreases (B32.length x)) | val seq_of_bytes' (x: bytes32) (accu: Seq.seq byte)
: Tot (y: Seq.seq byte {y `Seq.equal` (accu `Seq.append` (B32.reveal x))})
(decreases (B32.length x)) | let rec seq_of_bytes'
(x: bytes32)
(accu: Seq.seq byte)
: Tot (y: Seq.seq byte { y `Seq.equal` (accu `Seq.append` B32.reveal x) })
(decreases (B32.length x))
= if B32.len x = 0ul
then accu
else (seq_of_bytes' (B32.slice x 1ul (B32.len x)) (Seq.append accu (Seq.create 1 (B32.index x 0))) <: Seq.seq byte) | {
"file_name": "src/lowparse/LowParse.SLow.Base.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 117,
"end_line": 444,
"start_col": 0,
"start_line": 437
} | module LowParse.SLow.Base
include LowParse.Spec.Base
module B32 = LowParse.Bytes32
module U32 = FStar.UInt32
let bytes32 = B32.bytes
let parser32_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(input: bytes32)
(res: option (t * U32.t))
: GTot Type0
= let gp = parse p (B32.reveal input) in
match res... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: LowParse.SLow.Base.bytes32 -> accu: FStar.Seq.Base.seq LowParse.Bytes.byte
-> Prims.Tot
(y:
FStar.Seq.Base.seq LowParse.Bytes.byte
{FStar.Seq.Base.equal y (FStar.Seq.Base.append accu (FStar.Bytes.reveal x))}) | Prims.Tot | [
"total",
""
] | [] | [
"LowParse.SLow.Base.bytes32",
"FStar.Seq.Base.seq",
"LowParse.Bytes.byte",
"Prims.op_Equality",
"FStar.UInt32.t",
"FStar.Bytes.len",
"FStar.UInt32.__uint_to_t",
"Prims.bool",
"LowParse.SLow.Base.seq_of_bytes'",
"FStar.Bytes.slice",
"FStar.Seq.Base.append",
"FStar.Seq.Base.create",
"FStar.Byt... | [
"recursion"
] | false | false | false | false | false | let rec seq_of_bytes' (x: bytes32) (accu: Seq.seq byte)
: Tot (y: Seq.seq byte {y `Seq.equal` (accu `Seq.append` (B32.reveal x))})
(decreases (B32.length x)) =
| if B32.len x = 0ul
then accu
else
(seq_of_bytes' (B32.slice x 1ul (B32.len x)) (Seq.append accu (Seq.create 1 (B32.index x 0)))
<:
Seq.seq byte) | false |
LowParse.SLow.Base.fst | LowParse.SLow.Base.parser32_injective | val parser32_injective
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(p32: parser32 p)
(input1 input2: bytes32)
: Lemma
(requires
(let p1 = p32 input1 in
let p2 = p32 input2 in
Some? p1 /\ Some? p2 /\
(let Some (v1, _) = p1 in
let... | val parser32_injective
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(p32: parser32 p)
(input1 input2: bytes32)
: Lemma
(requires
(let p1 = p32 input1 in
let p2 = p32 input2 in
Some? p1 /\ Some? p2 /\
(let Some (v1, _) = p1 in
let... | let parser32_injective
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(p32: parser32 p)
(input1 input2: bytes32)
: Lemma
(requires (
let p1 = p32 input1 in
let p2 = p32 input2 in
Some? p1 /\
Some? p2 /\ (
let (Some (v1, _)) = p1 in
let (Some (v2, _)) = p2 in
v1 == v2
)))
(ensu... | {
"file_name": "src/lowparse/LowParse.SLow.Base.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 71,
"end_line": 251,
"start_col": 0,
"start_line": 220
} | module LowParse.SLow.Base
include LowParse.Spec.Base
module B32 = LowParse.Bytes32
module U32 = FStar.UInt32
let bytes32 = B32.bytes
let parser32_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(input: bytes32)
(res: option (t * U32.t))
: GTot Type0
= let gp = parse p (B32.reveal input) in
match res... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
p32: LowParse.SLow.Base.parser32 p ->
input1: LowParse.SLow.Base.bytes32 ->
input2: LowParse.SLow.Base.bytes32
-> FStar.Pervasives.Lemma
(requires
(let p1 = p32 input1 in
let p2 = p32 input2 in
Some? p1 /\ Some? p2 /\
(let _ = p1 in
(let FStar.Perva... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.SLow.Base.parser32",
"LowParse.SLow.Base.bytes32",
"Prims._assert",
"LowParse.Spec.Base.injective_postcond",
"FStar.Bytes.reveal",
"Prims.unit",
"LowParse.Spec.Base.injective_precond",
"LowParse.Spec.Base.parser_kind_prop_equ... | [] | true | false | true | false | false | let parser32_injective
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(p32: parser32 p)
(input1 input2: bytes32)
: Lemma
(requires
(let p1 = p32 input1 in
let p2 = p32 input2 in
Some? p1 /\ Some? p2 /\
(let Some (v1, _) = p1 in
let... | parser_kind_prop_equiv k p;
assert (injective_precond p (B32.reveal input1) (B32.reveal input2));
assert (injective_postcond p (B32.reveal input1) (B32.reveal input2)) | false |
Hacl.Spec.Poly1305.Lemmas.fst | Hacl.Spec.Poly1305.Lemmas.pfelem_add_cm | val pfelem_add_cm:cm pfelem | val pfelem_add_cm:cm pfelem | let pfelem_add_cm : cm pfelem =
CM zero ( +% ) add_identity add_associativity add_commutativity | {
"file_name": "code/poly1305/Hacl.Spec.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 65,
"end_line": 79,
"start_col": 0,
"start_line": 78
} | module Hacl.Spec.Poly1305.Lemmas
open FStar.Mul
module Scalar = Spec.Poly1305
open FStar.Algebra.CommMonoid
open FStar.Tactics.CanonCommSemiring
/// Semiring for Poly1305
#set-options "--z3rlimit 5 --max_fuel 0 --max_ifuel 0 --z3cliopt smt.arith.nl=false"
let prime: pos = Scalar.prime
let pfelem : eqtype = a:nat{... | {
"checked_file": "/",
"dependencies": [
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.CanonCommSemiring.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommSemiring",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra.CommMonoid",
"short_module": null
},
{
"abbrev": true,
"full_module": "Spec.Poly1305",
"short_module": "Scalar"
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | FStar.Algebra.CommMonoid.cm Hacl.Spec.Poly1305.Lemmas.pfelem | Prims.Tot | [
"total"
] | [] | [
"FStar.Algebra.CommMonoid.CM",
"Hacl.Spec.Poly1305.Lemmas.pfelem",
"Hacl.Spec.Poly1305.Lemmas.zero",
"Hacl.Spec.Poly1305.Lemmas.op_Plus_Percent",
"Hacl.Spec.Poly1305.Lemmas.add_identity",
"Hacl.Spec.Poly1305.Lemmas.add_associativity",
"Hacl.Spec.Poly1305.Lemmas.add_commutativity"
] | [] | false | false | false | true | false | let pfelem_add_cm:cm pfelem =
| CM zero ( +% ) add_identity add_associativity add_commutativity | false |
Hacl.Spec.Poly1305.Lemmas.fst | Hacl.Spec.Poly1305.Lemmas.poly_semiring | val poly_semiring: Prims.unit -> Tac unit | val poly_semiring: Prims.unit -> Tac unit | let poly_semiring () : Tac unit = canon_semiring pfelem_cr; trefl() | {
"file_name": "code/poly1305/Hacl.Spec.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 67,
"end_line": 124,
"start_col": 0,
"start_line": 124
} | module Hacl.Spec.Poly1305.Lemmas
open FStar.Mul
module Scalar = Spec.Poly1305
open FStar.Algebra.CommMonoid
open FStar.Tactics.CanonCommSemiring
/// Semiring for Poly1305
#set-options "--z3rlimit 5 --max_fuel 0 --max_ifuel 0 --z3cliopt smt.arith.nl=false"
let prime: pos = Scalar.prime
let pfelem : eqtype = a:nat{... | {
"checked_file": "/",
"dependencies": [
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.CanonCommSemiring.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst... | [
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommSemiring",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra.CommMonoid",
"short_module": null
},
{
"abbrev"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Tactics.V1.Derived.trefl",
"FStar.Tactics.CanonCommSemiring.canon_semiring",
"Hacl.Spec.Poly1305.Lemmas.pfelem",
"Hacl.Spec.Poly1305.Lemmas.pfelem_cr"
] | [] | false | true | false | false | false | let poly_semiring () : Tac unit =
| canon_semiring pfelem_cr;
trefl () | false |
Hacl.Spec.Poly1305.Lemmas.fst | Hacl.Spec.Poly1305.Lemmas.pfelem_mul_cm | val pfelem_mul_cm:cm pfelem | val pfelem_mul_cm:cm pfelem | let pfelem_mul_cm : cm pfelem =
CM one ( *% ) mul_identity mul_associativity mul_commutativity | {
"file_name": "code/poly1305/Hacl.Spec.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 64,
"end_line": 83,
"start_col": 0,
"start_line": 82
} | module Hacl.Spec.Poly1305.Lemmas
open FStar.Mul
module Scalar = Spec.Poly1305
open FStar.Algebra.CommMonoid
open FStar.Tactics.CanonCommSemiring
/// Semiring for Poly1305
#set-options "--z3rlimit 5 --max_fuel 0 --max_ifuel 0 --z3cliopt smt.arith.nl=false"
let prime: pos = Scalar.prime
let pfelem : eqtype = a:nat{... | {
"checked_file": "/",
"dependencies": [
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.CanonCommSemiring.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommSemiring",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra.CommMonoid",
"short_module": null
},
{
"abbrev": true,
"full_module": "Spec.Poly1305",
"short_module": "Scalar"
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | FStar.Algebra.CommMonoid.cm Hacl.Spec.Poly1305.Lemmas.pfelem | Prims.Tot | [
"total"
] | [] | [
"FStar.Algebra.CommMonoid.CM",
"Hacl.Spec.Poly1305.Lemmas.pfelem",
"Hacl.Spec.Poly1305.Lemmas.one",
"Hacl.Spec.Poly1305.Lemmas.op_Star_Percent",
"Hacl.Spec.Poly1305.Lemmas.mul_identity",
"Hacl.Spec.Poly1305.Lemmas.mul_associativity",
"Hacl.Spec.Poly1305.Lemmas.mul_commutativity"
] | [] | false | false | false | true | false | let pfelem_mul_cm:cm pfelem =
| CM one ( *% ) mul_identity mul_associativity mul_commutativity | false |
ImmutableBuffer.fst | ImmutableBuffer.l | val l:list int | val l:list int | let l :list int = [1; 2; 3; 4; 5; 6; 7; 8; 9; 10] | {
"file_name": "examples/low-mitls-experiments/ImmutableBuffer.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 49,
"end_line": 31,
"start_col": 0,
"start_line": 31
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.UninitializedBuffer.fst.checked",
"LowStar.PrefixFreezableBuffer.fsti.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.ImmutableBuffer.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8.fsti.checked",... | [
{
"abbrev": true,
"full_module": "LowStar.ImmutableBuffer",
"short_module": "IB"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": true,
"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 | Prims.list Prims.int | Prims.Tot | [
"total"
] | [] | [
"Prims.Cons",
"Prims.int",
"Prims.Nil"
] | [] | false | false | false | true | false | let l:list int =
| [1; 2; 3; 4; 5; 6; 7; 8; 9; 10] | false |
LowParse.SLow.Base.fst | LowParse.SLow.Base.parse_tot_seq_of_parser32 | val parse_tot_seq_of_parser32
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(p32:
parser32 p
{ k.parser_kind_subkind == Some ParserStrong /\
(match k.parser_kind_high with
| None -> False
| Some max -> max < 4294967296) })
... | val parse_tot_seq_of_parser32
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(p32:
parser32 p
{ k.parser_kind_subkind == Some ParserStrong /\
(match k.parser_kind_high with
| None -> False
| Some max -> max < 4294967296) })
... | let parse_tot_seq_of_parser32
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(p32: parser32 p {
k.parser_kind_subkind == Some ParserStrong /\
begin match k.parser_kind_high with
| None -> False
| Some max -> max < 4294967296
end
})
(x: Seq.seq byte)
: Tot (y: _ { y == parse p x })
= match... | {
"file_name": "src/lowparse/LowParse.SLow.Base.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 7,
"end_line": 433,
"start_col": 0,
"start_line": 403
} | module LowParse.SLow.Base
include LowParse.Spec.Base
module B32 = LowParse.Bytes32
module U32 = FStar.UInt32
let bytes32 = B32.bytes
let parser32_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(input: bytes32)
(res: option (t * U32.t))
: GTot Type0
= let gp = parse p (B32.reveal input) in
match res... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"LowParse.Bytes32.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked... | [
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "LowParse.Bytes32",
"short_module": "B32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Base",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
p32:
LowParse.SLow.Base.parser32 p
{ Mkparser_kind'?.parser_kind_subkind k ==
FStar.Pervasives.Native.Some LowParse.Spec.Base.ParserStrong /\
(match Mkparser_kind'?.parser_kind_high k with
| FStar.Pervasives.Native.None #_ -> Prims.l_False
| FStar.Pervasive... | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.SLow.Base.parser32",
"Prims.l_and",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"LowParse.Spec.Base.parser_subkind",
"LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_subkind",
"FStar.Pervasives.Native.Some",
"... | [] | false | false | false | false | false | let parse_tot_seq_of_parser32
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(p32:
parser32 p
{ k.parser_kind_subkind == Some ParserStrong /\
(match k.parser_kind_high with
| None -> False
| Some max -> max < 4294967296) })
... | match k.parser_kind_high with
| Some max ->
if Seq.length x < max
then
match p32 (bytes_of_seq x) with
| None -> None
| Some (x, consumed) -> Some (x, U32.v consumed)
else
[@@ inline_let ]let max32 = U32.uint_to_t max in
let res = p32 (bytes_of_seq (Seq.slice x 0 max)) in
Classical.move_re... | false |
Hacl.Spec.Poly1305.Lemmas.fst | Hacl.Spec.Poly1305.Lemmas.zero | val zero:pfelem | val zero:pfelem | let zero : pfelem = 0 | {
"file_name": "code/poly1305/Hacl.Spec.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 21,
"end_line": 18,
"start_col": 0,
"start_line": 18
} | module Hacl.Spec.Poly1305.Lemmas
open FStar.Mul
module Scalar = Spec.Poly1305
open FStar.Algebra.CommMonoid
open FStar.Tactics.CanonCommSemiring
/// Semiring for Poly1305
#set-options "--z3rlimit 5 --max_fuel 0 --max_ifuel 0 --z3cliopt smt.arith.nl=false"
let prime: pos = Scalar.prime
let pfelem : eqtype = a:nat{... | {
"checked_file": "/",
"dependencies": [
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.CanonCommSemiring.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommSemiring",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra.CommMonoid",
"short_module": null
},
{
"abbrev": true,
"full_module": "Spec.Poly1305",
"short_module": "Scalar"
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Spec.Poly1305.Lemmas.pfelem | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | true | false | let zero:pfelem =
| 0 | false |
Hacl.Spec.Poly1305.Lemmas.fst | Hacl.Spec.Poly1305.Lemmas.one | val one:pfelem | val one:pfelem | let one : pfelem = normalize_term_spec prime; 1 | {
"file_name": "code/poly1305/Hacl.Spec.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 47,
"end_line": 21,
"start_col": 0,
"start_line": 21
} | module Hacl.Spec.Poly1305.Lemmas
open FStar.Mul
module Scalar = Spec.Poly1305
open FStar.Algebra.CommMonoid
open FStar.Tactics.CanonCommSemiring
/// Semiring for Poly1305
#set-options "--z3rlimit 5 --max_fuel 0 --max_ifuel 0 --z3cliopt smt.arith.nl=false"
let prime: pos = Scalar.prime
let pfelem : eqtype = a:nat{... | {
"checked_file": "/",
"dependencies": [
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.CanonCommSemiring.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommSemiring",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra.CommMonoid",
"short_module": null
},
{
"abbrev": true,
"full_module": "Spec.Poly1305",
"short_module": "Scalar"
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Spec.Poly1305.Lemmas.pfelem | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"FStar.Pervasives.normalize_term_spec",
"Prims.pos",
"Hacl.Spec.Poly1305.Lemmas.prime"
] | [] | false | false | false | true | false | let one:pfelem =
| normalize_term_spec prime;
1 | false |
Hacl.Spec.Poly1305.Lemmas.fst | Hacl.Spec.Poly1305.Lemmas.pfelem | val pfelem:eqtype | val pfelem:eqtype | let pfelem : eqtype = a:nat{a < prime} | {
"file_name": "code/poly1305/Hacl.Spec.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 38,
"end_line": 15,
"start_col": 0,
"start_line": 15
} | module Hacl.Spec.Poly1305.Lemmas
open FStar.Mul
module Scalar = Spec.Poly1305
open FStar.Algebra.CommMonoid
open FStar.Tactics.CanonCommSemiring
/// Semiring for Poly1305
#set-options "--z3rlimit 5 --max_fuel 0 --max_ifuel 0 --z3cliopt smt.arith.nl=false"
let prime: pos = Scalar.prime | {
"checked_file": "/",
"dependencies": [
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.CanonCommSemiring.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommSemiring",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra.CommMonoid",
"short_module": null
},
{
"abbrev": true,
"full_module": "Spec.Poly1305",
"short_module": "Scalar"
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Prims.eqtype | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Hacl.Spec.Poly1305.Lemmas.prime"
] | [] | false | false | false | true | false | let pfelem:eqtype =
| a: nat{a < prime} | false |
Hacl.Spec.Poly1305.Lemmas.fst | Hacl.Spec.Poly1305.Lemmas.mul_identity | val mul_identity: a:pfelem -> Lemma (one *% a == a) | val mul_identity: a:pfelem -> Lemma (one *% a == a) | let mul_identity a = normalize_term_spec prime | {
"file_name": "code/poly1305/Hacl.Spec.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 46,
"end_line": 36,
"start_col": 0,
"start_line": 36
} | module Hacl.Spec.Poly1305.Lemmas
open FStar.Mul
module Scalar = Spec.Poly1305
open FStar.Algebra.CommMonoid
open FStar.Tactics.CanonCommSemiring
/// Semiring for Poly1305
#set-options "--z3rlimit 5 --max_fuel 0 --max_ifuel 0 --z3cliopt smt.arith.nl=false"
let prime: pos = Scalar.prime
let pfelem : eqtype = a:nat{... | {
"checked_file": "/",
"dependencies": [
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.CanonCommSemiring.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommSemiring",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra.CommMonoid",
"short_module": null
},
{
"abbrev": true,
"full_module": "Spec.Poly1305",
"short_module": "Scalar"
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Hacl.Spec.Poly1305.Lemmas.pfelem
-> FStar.Pervasives.Lemma (ensures Hacl.Spec.Poly1305.Lemmas.one *% a == a) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Poly1305.Lemmas.pfelem",
"FStar.Pervasives.normalize_term_spec",
"Prims.pos",
"Hacl.Spec.Poly1305.Lemmas.prime",
"Prims.unit"
] | [] | true | false | true | false | false | let mul_identity a =
| normalize_term_spec prime | false |
ImmutableBuffer.fst | ImmutableBuffer.test_ub | val test_ub: Prims.unit -> HST.St unit | val test_ub: Prims.unit -> HST.St unit | let test_ub () :HST.St unit =
let b = UB.ugcmalloc #int HS.root 10ul in //allocate an uninitialized buffer, no initializer
UB.uupd b 1ul 2; //update at index 1 with value 2
let j = UB.uindex b 1ul in //can now project index 1
assert (j == 2); //and check that the value is indeed 2
//let j = UB.uindex b 4u... | {
"file_name": "examples/low-mitls-experiments/ImmutableBuffer.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 107,
"start_col": 0,
"start_line": 93
} | (*
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",
"LowStar.UninitializedBuffer.fst.checked",
"LowStar.PrefixFreezableBuffer.fsti.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.ImmutableBuffer.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8.fsti.checked",... | [
{
"abbrev": true,
"full_module": "LowStar.UninitializedBuffer",
"short_module": "UB"
},
{
"abbrev": true,
"full_module": "LowStar.ImmutableBuffer",
"short_module": "IB"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> FStar.HyperStack.ST.St Prims.unit | FStar.HyperStack.ST.St | [] | [] | [
"Prims.unit",
"Prims._assert",
"Prims.eq2",
"Prims.int",
"FStar.Pervasives.Native.option",
"FStar.Seq.Base.index",
"LowStar.Monotonic.Buffer.as_seq",
"LowStar.UninitializedBuffer.initialization_preorder",
"FStar.Seq.Base.slice",
"LowStar.UninitializedBuffer.uindex",
"FStar.UInt32.__uint_to_t",
... | [] | false | true | false | false | false | let test_ub () : HST.St unit =
| let b = UB.ugcmalloc #int HS.root 10ul in
UB.uupd b 1ul 2;
let j = UB.uindex b 1ul in
assert (j == 2);
let b1 = B.gcmalloc HS.root 0 10ul in
let h0 = HST.get () in
UB.ublit b1 2ul b 2ul 3ul;
let h1 = HST.get () in
let j = UB.uindex b 4ul in
assert (j == 0);
let j = UB.uindex b 1ul in
assert (Seq.index (UB.as_seq h0 b) ... | false |
Hacl.Spec.Poly1305.Lemmas.fst | Hacl.Spec.Poly1305.Lemmas.add_identity | val add_identity: a:pfelem -> Lemma (zero +% a == a) | val add_identity: a:pfelem -> Lemma (zero +% a == a) | let add_identity a = normalize_term_spec prime | {
"file_name": "code/poly1305/Hacl.Spec.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 46,
"end_line": 33,
"start_col": 0,
"start_line": 33
} | module Hacl.Spec.Poly1305.Lemmas
open FStar.Mul
module Scalar = Spec.Poly1305
open FStar.Algebra.CommMonoid
open FStar.Tactics.CanonCommSemiring
/// Semiring for Poly1305
#set-options "--z3rlimit 5 --max_fuel 0 --max_ifuel 0 --z3cliopt smt.arith.nl=false"
let prime: pos = Scalar.prime
let pfelem : eqtype = a:nat{... | {
"checked_file": "/",
"dependencies": [
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.CanonCommSemiring.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommSemiring",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra.CommMonoid",
"short_module": null
},
{
"abbrev": true,
"full_module": "Spec.Poly1305",
"short_module": "Scalar"
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Hacl.Spec.Poly1305.Lemmas.pfelem
-> FStar.Pervasives.Lemma (ensures Hacl.Spec.Poly1305.Lemmas.zero +% a == a) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Poly1305.Lemmas.pfelem",
"FStar.Pervasives.normalize_term_spec",
"Prims.pos",
"Hacl.Spec.Poly1305.Lemmas.prime",
"Prims.unit"
] | [] | true | false | true | false | false | let add_identity a =
| normalize_term_spec prime | false |
ImmutableBuffer.fst | ImmutableBuffer.test_witnessed_functoriality | val test_witnessed_functoriality : _: Prims.unit -> Prims.unit | let test_witnessed_functoriality () =
assert (LowStar.Monotonic.Buffer.rrel_rel_always_compatible (B.trivial_preorder int) (B.trivial_preorder int));
assert (LowStar.Monotonic.Buffer.rrel_rel_always_compatible (IB.immutable_preorder int) (IB.immutable_preorder int)) | {
"file_name": "examples/low-mitls-experiments/ImmutableBuffer.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 118,
"end_line": 166,
"start_col": 0,
"start_line": 164
} | (*
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",
"LowStar.UninitializedBuffer.fst.checked",
"LowStar.PrefixFreezableBuffer.fsti.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.ImmutableBuffer.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8.fsti.checked",... | [
{
"abbrev": true,
"full_module": "LowStar.PrefixFreezableBuffer",
"short_module": "PF"
},
{
"abbrev": true,
"full_module": "LowStar.UninitializedBuffer",
"short_module": "UB"
},
{
"abbrev": true,
"full_module": "LowStar.ImmutableBuffer",
"short_module": "IB"
},
{
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> Prims.unit | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"Prims._assert",
"LowStar.Monotonic.Buffer.rrel_rel_always_compatible",
"Prims.int",
"LowStar.ImmutableBuffer.immutable_preorder",
"LowStar.Buffer.trivial_preorder"
] | [] | false | false | false | true | false | let test_witnessed_functoriality () =
| assert (LowStar.Monotonic.Buffer.rrel_rel_always_compatible (B.trivial_preorder int)
(B.trivial_preorder int));
assert (LowStar.Monotonic.Buffer.rrel_rel_always_compatible (IB.immutable_preorder int)
(IB.immutable_preorder int)) | false | |
ImmutableBuffer.fst | ImmutableBuffer.test2 | val test2 (lll: list int {List.Tot.length lll > 0 /\ List.Tot.length lll <= UInt.max_int 32})
: HST.ST unit (fun h0 -> HS.is_stack_region (HS.get_tip h0)) (fun _ _ _ -> True) | val test2 (lll: list int {List.Tot.length lll > 0 /\ List.Tot.length lll <= UInt.max_int 32})
: HST.ST unit (fun h0 -> HS.is_stack_region (HS.get_tip h0)) (fun _ _ _ -> True) | let test2 (lll:list int{List.Tot.length lll > 0 /\
List.Tot.length lll <= UInt.max_int 32})
:HST.ST unit (fun h0 -> HS.is_stack_region (HS.get_tip h0)) (fun _ _ _ -> True)=
let b = B.gcmalloc_of_list HS.root l in
assert (B.length b == 10);
let h = HST.get () in
assert (B.as_seq h b == Se... | {
"file_name": "examples/low-mitls-experiments/ImmutableBuffer.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 18,
"end_line": 52,
"start_col": 0,
"start_line": 33
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.UninitializedBuffer.fst.checked",
"LowStar.PrefixFreezableBuffer.fsti.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.ImmutableBuffer.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8.fsti.checked",... | [
{
"abbrev": true,
"full_module": "LowStar.ImmutableBuffer",
"short_module": "IB"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": true,
"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 |
lll:
Prims.list Prims.int
{ FStar.List.Tot.Base.length lll > 0 /\
FStar.List.Tot.Base.length lll <= FStar.UInt.max_int 32 }
-> FStar.HyperStack.ST.ST Prims.unit | FStar.HyperStack.ST.ST | [] | [] | [
"Prims.list",
"Prims.int",
"Prims.l_and",
"Prims.b2t",
"Prims.op_GreaterThan",
"FStar.List.Tot.Base.length",
"Prims.op_LessThanOrEqual",
"FStar.UInt.max_int",
"FStar.HyperStack.ST.pop_frame",
"Prims.unit",
"Prims._assert",
"Prims.eq2",
"Prims.nat",
"LowStar.Monotonic.Buffer.length",
"Low... | [] | false | true | false | false | false | let test2 (lll: list int {List.Tot.length lll > 0 /\ List.Tot.length lll <= UInt.max_int 32})
: HST.ST unit (fun h0 -> HS.is_stack_region (HS.get_tip h0)) (fun _ _ _ -> True) =
| let b = B.gcmalloc_of_list HS.root l in
assert (B.length b == 10);
let h = HST.get () in
assert (B.as_seq h b == Seq.seq_of_list l);
assert (B.length b == List.Tot.length l);
let ll = [1; 2; 3; 4; 5; 6; 7; 8; 9; 10; 11] in
HST.push_frame ();
let b = B.alloca_of_list ll in
assert (B.length b == 11);
let h = HST.get () i... | false |
Hacl.Spec.Poly1305.Lemmas.fst | Hacl.Spec.Poly1305.Lemmas.add_opp | val add_opp (a:pfelem) : Lemma (a +% ~%a == zero) | val add_opp (a:pfelem) : Lemma (a +% ~%a == zero) | let add_opp a =
FStar.Math.Lemmas.lemma_mod_add_distr a (-a) prime;
FStar.Math.Lemmas.small_mod 0 prime | {
"file_name": "code/poly1305/Hacl.Spec.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 37,
"end_line": 116,
"start_col": 0,
"start_line": 114
} | module Hacl.Spec.Poly1305.Lemmas
open FStar.Mul
module Scalar = Spec.Poly1305
open FStar.Algebra.CommMonoid
open FStar.Tactics.CanonCommSemiring
/// Semiring for Poly1305
#set-options "--z3rlimit 5 --max_fuel 0 --max_ifuel 0 --z3cliopt smt.arith.nl=false"
let prime: pos = Scalar.prime
let pfelem : eqtype = a:nat{... | {
"checked_file": "/",
"dependencies": [
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.CanonCommSemiring.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommSemiring",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra.CommMonoid",
"short_module": null
},
{
"abbrev": true,
"full_module": "Spec.Poly1305",
"short_module": "Scalar"
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Hacl.Spec.Poly1305.Lemmas.pfelem
-> FStar.Pervasives.Lemma (ensures a +% ~%a == Hacl.Spec.Poly1305.Lemmas.zero) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Poly1305.Lemmas.pfelem",
"FStar.Math.Lemmas.small_mod",
"Hacl.Spec.Poly1305.Lemmas.prime",
"Prims.unit",
"FStar.Math.Lemmas.lemma_mod_add_distr",
"Prims.op_Minus"
] | [] | true | false | true | false | false | let add_opp a =
| FStar.Math.Lemmas.lemma_mod_add_distr a (- a) prime;
FStar.Math.Lemmas.small_mod 0 prime | false |
ImmutableBuffer.fst | ImmutableBuffer.test | val test (l: list int {List.Tot.length l == 10}) : HST.St unit | val test (l: list int {List.Tot.length l == 10}) : HST.St unit | let test (l:list int{List.Tot.length l == 10}) :HST.St unit =
let ls = Seq.seq_of_list l in
let b = IB.igcmalloc_of_list HS.root l in
assert (B.length b == 10);
havoc b;
IB.recall_contents b ls;
let h = HST.get () in
assert (B.as_seq h b == ls);
assert (B.live h b);
let sb = IB.isub b 0ul 2ul in
... | {
"file_name": "examples/low-mitls-experiments/ImmutableBuffer.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 83,
"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",
"LowStar.UninitializedBuffer.fst.checked",
"LowStar.PrefixFreezableBuffer.fsti.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.ImmutableBuffer.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8.fsti.checked",... | [
{
"abbrev": true,
"full_module": "LowStar.ImmutableBuffer",
"short_module": "IB"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": true,
"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 | l: Prims.list Prims.int {FStar.List.Tot.Base.length l == 10} -> FStar.HyperStack.ST.St Prims.unit | FStar.HyperStack.ST.St | [] | [] | [
"Prims.list",
"Prims.int",
"Prims.eq2",
"FStar.List.Tot.Base.length",
"Prims.unit",
"Prims.bool",
"Prims._assert",
"FStar.Seq.Base.seq",
"LowStar.Monotonic.Buffer.as_seq",
"LowStar.ImmutableBuffer.immutable_preorder",
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.ST.get",
"LowStar.Immu... | [] | false | true | false | false | false | let test (l: list int {List.Tot.length l == 10}) : HST.St unit =
| let ls = Seq.seq_of_list l in
let b = IB.igcmalloc_of_list HS.root l in
assert (B.length b == 10);
havoc b;
IB.recall_contents b ls;
let h = HST.get () in
assert (B.as_seq h b == ls);
assert (B.live h b);
let sb = IB.isub b 0ul 2ul in
IB.witness_contents sb (Seq.slice ls 0 2);
havoc sb;
IB.recall_contents sb (Seq.slice... | false |
Hacl.Spec.Poly1305.Lemmas.fst | Hacl.Spec.Poly1305.Lemmas.pfelem_cr | val pfelem_cr:cr pfelem | val pfelem_cr:cr pfelem | let pfelem_cr : cr pfelem =
CR pfelem_add_cm pfelem_mul_cm ( ~% ) add_opp mul_add_distr mul_zero_l | {
"file_name": "code/poly1305/Hacl.Spec.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 72,
"end_line": 120,
"start_col": 0,
"start_line": 119
} | module Hacl.Spec.Poly1305.Lemmas
open FStar.Mul
module Scalar = Spec.Poly1305
open FStar.Algebra.CommMonoid
open FStar.Tactics.CanonCommSemiring
/// Semiring for Poly1305
#set-options "--z3rlimit 5 --max_fuel 0 --max_ifuel 0 --z3cliopt smt.arith.nl=false"
let prime: pos = Scalar.prime
let pfelem : eqtype = a:nat{... | {
"checked_file": "/",
"dependencies": [
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.CanonCommSemiring.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommSemiring",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra.CommMonoid",
"short_module": null
},
{
"abbrev": true,
"full_module": "Spec.Poly1305",
"short_module": "Scalar"
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | FStar.Tactics.CanonCommSemiring.cr Hacl.Spec.Poly1305.Lemmas.pfelem | Prims.Tot | [
"total"
] | [] | [
"FStar.Tactics.CanonCommSemiring.CR",
"Hacl.Spec.Poly1305.Lemmas.pfelem",
"Hacl.Spec.Poly1305.Lemmas.pfelem_add_cm",
"Hacl.Spec.Poly1305.Lemmas.pfelem_mul_cm",
"Hacl.Spec.Poly1305.Lemmas.op_Tilde_Percent",
"Hacl.Spec.Poly1305.Lemmas.add_opp",
"Hacl.Spec.Poly1305.Lemmas.mul_add_distr",
"Hacl.Spec.Poly1... | [] | false | false | false | true | false | let pfelem_cr:cr pfelem =
| CR pfelem_add_cm pfelem_mul_cm ( ~% ) add_opp mul_add_distr mul_zero_l | false |
ImmutableBuffer.fst | ImmutableBuffer.test_pf | val test_pf: Prims.unit -> HST.St unit | val test_pf: Prims.unit -> HST.St unit | let test_pf () : HST.St unit =
let open LowStar.PrefixFreezableBuffer in
let b = gcmalloc HS.root 5ul in
upd b 4ul 1uy;
upd b 5ul 2uy;
upd b 6ul 3uy;
upd b 7ul 4uy;
upd b 8ul 5uy;
freeze b 5ul;
upd b 5ul 2uy;
upd b 6ul 3uy;
upd b 7ul 4uy;
upd b 8ul 5uy;
let snap = Ghost.hide (Seq.create 1... | {
"file_name": "examples/low-mitls-experiments/ImmutableBuffer.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 4,
"end_line": 162,
"start_col": 0,
"start_line": 135
} | (*
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",
"LowStar.UninitializedBuffer.fst.checked",
"LowStar.PrefixFreezableBuffer.fsti.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.ImmutableBuffer.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8.fsti.checked",... | [
{
"abbrev": true,
"full_module": "LowStar.PrefixFreezableBuffer",
"short_module": "PF"
},
{
"abbrev": true,
"full_module": "LowStar.UninitializedBuffer",
"short_module": "UB"
},
{
"abbrev": true,
"full_module": "LowStar.ImmutableBuffer",
"short_module": "IB"
},
{
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> FStar.HyperStack.ST.St Prims.unit | FStar.HyperStack.ST.St | [] | [] | [
"Prims.unit",
"Prims._assert",
"FStar.Seq.Base.equal",
"LowStar.PrefixFreezableBuffer.u8",
"FStar.Seq.Base.slice",
"LowStar.Monotonic.Buffer.as_seq",
"LowStar.PrefixFreezableBuffer.prefix_freezable_preorder",
"FStar.Ghost.reveal",
"FStar.Seq.Base.seq",
"FStar.Monotonic.HyperStack.mem",
"FStar.Hy... | [] | false | true | false | false | false | let test_pf () : HST.St unit =
| let open LowStar.PrefixFreezableBuffer in
let b = gcmalloc HS.root 5ul in
upd b 4ul 1uy;
upd b 5ul 2uy;
upd b 6ul 3uy;
upd b 7ul 4uy;
upd b 8ul 5uy;
freeze b 5ul;
upd b 5ul 2uy;
upd b 6ul 3uy;
upd b 7ul 4uy;
upd b 8ul 5uy;
let snap = Ghost.hide (Seq.create 1 1uy) in
witness_slice b 4ul 5ul snap;
havoc_pf b;
recall_slic... | false |
Hacl.Spec.Poly1305.Lemmas.fst | Hacl.Spec.Poly1305.Lemmas.mul_zero_l | val mul_zero_l: mult_zero_l_lemma pfelem pfelem_add_cm pfelem_mul_cm | val mul_zero_l: mult_zero_l_lemma pfelem pfelem_add_cm pfelem_mul_cm | let mul_zero_l a = assert_norm (forall x. zero *% x == zero) | {
"file_name": "code/poly1305/Hacl.Spec.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 60,
"end_line": 111,
"start_col": 0,
"start_line": 111
} | module Hacl.Spec.Poly1305.Lemmas
open FStar.Mul
module Scalar = Spec.Poly1305
open FStar.Algebra.CommMonoid
open FStar.Tactics.CanonCommSemiring
/// Semiring for Poly1305
#set-options "--z3rlimit 5 --max_fuel 0 --max_ifuel 0 --z3cliopt smt.arith.nl=false"
let prime: pos = Scalar.prime
let pfelem : eqtype = a:nat{... | {
"checked_file": "/",
"dependencies": [
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.CanonCommSemiring.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommSemiring",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra.CommMonoid",
"short_module": null
},
{
"abbrev": true,
"full_module": "Spec.Poly1305",
"short_module": "Scalar"
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | FStar.Tactics.CanonCommSemiring.mult_zero_l_lemma Hacl.Spec.Poly1305.Lemmas.pfelem
Hacl.Spec.Poly1305.Lemmas.pfelem_add_cm
Hacl.Spec.Poly1305.Lemmas.pfelem_mul_cm | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Poly1305.Lemmas.pfelem",
"FStar.Pervasives.assert_norm",
"Prims.l_Forall",
"Prims.eq2",
"Hacl.Spec.Poly1305.Lemmas.op_Star_Percent",
"Hacl.Spec.Poly1305.Lemmas.zero",
"Prims.unit"
] | [] | false | false | false | true | false | let mul_zero_l a =
| assert_norm (forall x. zero *% x == zero) | false |
Hacl.Spec.Poly1305.Lemmas.fst | Hacl.Spec.Poly1305.Lemmas.add_associativity | val add_associativity: a:pfelem -> b:pfelem -> c:pfelem
-> Lemma (a +% b +% c == a +% (b +% c)) | val add_associativity: a:pfelem -> b:pfelem -> c:pfelem
-> Lemma (a +% b +% c == a +% (b +% c)) | let add_associativity a b c =
normalize_term_spec prime;
calc (==) {
a +% b +% c;
== { }
((a + b) % prime + c) % prime;
== { Math.Lemmas.lemma_mod_plus_distr_l (a + b) c prime }
((a + b) + c) % prime;
== { }
(a + (b + c)) % prime;
== { Math.Lemmas.lemma_mod_plus_distr_r a (b + c) pri... | {
"file_name": "code/poly1305/Hacl.Spec.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 52,
"start_col": 0,
"start_line": 40
} | module Hacl.Spec.Poly1305.Lemmas
open FStar.Mul
module Scalar = Spec.Poly1305
open FStar.Algebra.CommMonoid
open FStar.Tactics.CanonCommSemiring
/// Semiring for Poly1305
#set-options "--z3rlimit 5 --max_fuel 0 --max_ifuel 0 --z3cliopt smt.arith.nl=false"
let prime: pos = Scalar.prime
let pfelem : eqtype = a:nat{... | {
"checked_file": "/",
"dependencies": [
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.CanonCommSemiring.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommSemiring",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra.CommMonoid",
"short_module": null
},
{
"abbrev": true,
"full_module": "Spec.Poly1305",
"short_module": "Scalar"
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
a: Hacl.Spec.Poly1305.Lemmas.pfelem ->
b: Hacl.Spec.Poly1305.Lemmas.pfelem ->
c: Hacl.Spec.Poly1305.Lemmas.pfelem
-> FStar.Pervasives.Lemma (ensures a +% b +% c == a +% (b +% c)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Poly1305.Lemmas.pfelem",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Hacl.Spec.Poly1305.Lemmas.op_Plus_Percent",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"Prims.op_Modulus",
"Prims.op_Addition",
"Hacl.Spec.Poly1305.Lemmas.prime",
"FSt... | [] | false | false | true | false | false | let add_associativity a b c =
| normalize_term_spec prime;
calc ( == ) {
a +% b +% c;
( == ) { () }
((a + b) % prime + c) % prime;
( == ) { Math.Lemmas.lemma_mod_plus_distr_l (a + b) c prime }
((a + b) + c) % prime;
( == ) { () }
(a + (b + c)) % prime;
( == ) { Math.Lemmas.lemma_mod_plus_distr_r a (b + c) prime }
a +% (b +% c);
} | false |
Hacl.Spec.Poly1305.Lemmas.fst | Hacl.Spec.Poly1305.Lemmas.poly_update_multi_lemma_load2_simplify | val poly_update_multi_lemma_load2_simplify:
acc0:pfelem -> r:pfelem -> c0:pfelem -> c1:pfelem ->
Lemma
( (((acc0 +% c0) *% r) +% c1) *% r ==
((acc0 +% c0) *% (r *% r)) +% c1 *% r ) | val poly_update_multi_lemma_load2_simplify:
acc0:pfelem -> r:pfelem -> c0:pfelem -> c1:pfelem ->
Lemma
( (((acc0 +% c0) *% r) +% c1) *% r ==
((acc0 +% c0) *% (r *% r)) +% c1 *% r ) | let poly_update_multi_lemma_load2_simplify acc0 r c0 c1 =
assert (
(((acc0 +% c0) *% r) +% c1) *% r ==
((acc0 +% c0) *% (r *% r)) +% c1 *% r )
by (poly_semiring ()) | {
"file_name": "code/poly1305/Hacl.Spec.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 23,
"end_line": 178,
"start_col": 0,
"start_line": 174
} | module Hacl.Spec.Poly1305.Lemmas
open FStar.Mul
module Scalar = Spec.Poly1305
open FStar.Algebra.CommMonoid
open FStar.Tactics.CanonCommSemiring
/// Semiring for Poly1305
#set-options "--z3rlimit 5 --max_fuel 0 --max_ifuel 0 --z3cliopt smt.arith.nl=false"
let prime: pos = Scalar.prime
let pfelem : eqtype = a:nat{... | {
"checked_file": "/",
"dependencies": [
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.CanonCommSemiring.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst... | [
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommSemiring",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra.CommMonoid",
"short_module": null
},
{
"abbrev"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
acc0: Hacl.Spec.Poly1305.Lemmas.pfelem ->
r: Hacl.Spec.Poly1305.Lemmas.pfelem ->
c0: Hacl.Spec.Poly1305.Lemmas.pfelem ->
c1: Hacl.Spec.Poly1305.Lemmas.pfelem
-> FStar.Pervasives.Lemma
(ensures ((acc0 +% c0) *% r +% c1) *% r == (acc0 +% c0) *% (r *% r) +% c1 *% r) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Poly1305.Lemmas.pfelem",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.eq2",
"Hacl.Spec.Poly1305.Lemmas.op_Star_Percent",
"Hacl.Spec.Poly1305.Lemmas.op_Plus_Percent",
"Prims.unit",
"Hacl.Spec.Poly1305.Lemmas.poly_semiring"
] | [] | false | false | true | false | false | let poly_update_multi_lemma_load2_simplify acc0 r c0 c1 =
| FStar.Tactics.Effect.assert_by_tactic ((((acc0 +% c0) *% r) +% c1) *% r ==
((acc0 +% c0) *% (r *% r)) +% c1 *% r)
(fun _ ->
();
(poly_semiring ())) | false |
Vale.AES.AES_helpers.fst | Vale.AES.AES_helpers.commute_sub_bytes_shift_rows_forall | val commute_sub_bytes_shift_rows_forall (_:unit) :
Lemma
(forall q.{:pattern sub_bytes (shift_rows_LE q) \/ shift_rows_LE (sub_bytes q)}
sub_bytes (shift_rows_LE q) == shift_rows_LE (sub_bytes q)) | val commute_sub_bytes_shift_rows_forall (_:unit) :
Lemma
(forall q.{:pattern sub_bytes (shift_rows_LE q) \/ shift_rows_LE (sub_bytes q)}
sub_bytes (shift_rows_LE q) == shift_rows_LE (sub_bytes q)) | let commute_sub_bytes_shift_rows_forall () =
FStar.Classical.forall_intro commute_sub_bytes_shift_rows | {
"file_name": "vale/code/crypto/aes/Vale.AES.AES_helpers.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 59,
"end_line": 57,
"start_col": 0,
"start_line": 56
} | module Vale.AES.AES_helpers
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open FStar.Mul
#reset-options "--initial_fuel 4 --max_fuel 4 --max_ifuel 0"
let lemma_expand_key_128_0 (key:aes_key_LE AES_128) =
expand_key_reveal ()
#reset-options "--initial_fuel 1 -... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.TypesNative.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.De... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures
forall (q: Vale.Def.Types_s.quad32).
{:pattern
Vale.AES.AES_common_s.sub_bytes (Vale.AES.AES_s.shift_rows_LE q)\/Vale.AES.AES_s.shift_rows_LE
(Vale.AES.AES_common_s.sub_bytes q)}
Vale.AES.AES_common_s.sub_bytes (Vale.AES... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.unit",
"FStar.Classical.forall_intro",
"Vale.Def.Types_s.quad32",
"Prims.eq2",
"Vale.AES.AES_common_s.sub_bytes",
"Vale.AES.AES_s.shift_rows_LE",
"Vale.AES.AES_s.commute_sub_bytes_shift_rows"
] | [] | false | false | true | false | false | let commute_sub_bytes_shift_rows_forall () =
| FStar.Classical.forall_intro commute_sub_bytes_shift_rows | false |
Hacl.Spec.Poly1305.Lemmas.fst | Hacl.Spec.Poly1305.Lemmas.mul_associativity | val mul_associativity: a:pfelem -> b:pfelem -> c:pfelem
-> Lemma (a *% b *% c == a *% (b *% c)) | val mul_associativity: a:pfelem -> b:pfelem -> c:pfelem
-> Lemma (a *% b *% c == a *% (b *% c)) | let mul_associativity a b c =
calc (==) {
a *% b *% c;
== { }
(((a * b) % prime) * c) % prime;
== { Math.Lemmas.lemma_mod_mul_distr_l (a * b) c prime }
((a * b) * c) % prime;
== { Math.Lemmas.paren_mul_right a b c }
(a * (b * c)) % prime;
== { Math.Lemmas.lemma_mod_mul_distr_r a (b * c... | {
"file_name": "code/poly1305/Hacl.Spec.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 72,
"start_col": 0,
"start_line": 59
} | module Hacl.Spec.Poly1305.Lemmas
open FStar.Mul
module Scalar = Spec.Poly1305
open FStar.Algebra.CommMonoid
open FStar.Tactics.CanonCommSemiring
/// Semiring for Poly1305
#set-options "--z3rlimit 5 --max_fuel 0 --max_ifuel 0 --z3cliopt smt.arith.nl=false"
let prime: pos = Scalar.prime
let pfelem : eqtype = a:nat{... | {
"checked_file": "/",
"dependencies": [
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.CanonCommSemiring.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommSemiring",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra.CommMonoid",
"short_module": null
},
{
"abbrev": true,
"full_module": "Spec.Poly1305",
"short_module": "Scalar"
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
a: Hacl.Spec.Poly1305.Lemmas.pfelem ->
b: Hacl.Spec.Poly1305.Lemmas.pfelem ->
c: Hacl.Spec.Poly1305.Lemmas.pfelem
-> FStar.Pervasives.Lemma (ensures a *% b *% c == a *% (b *% c)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Poly1305.Lemmas.pfelem",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Hacl.Spec.Poly1305.Lemmas.op_Star_Percent",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"Prims.op_Modulus",
"FStar.Mul.op_Star",
"Hacl.Spec.Poly1305.Lemmas.prime",
"FSt... | [] | false | false | true | false | false | let mul_associativity a b c =
| calc ( == ) {
a *% b *% c;
( == ) { () }
(((a * b) % prime) * c) % prime;
( == ) { Math.Lemmas.lemma_mod_mul_distr_l (a * b) c prime }
((a * b) * c) % prime;
( == ) { Math.Lemmas.paren_mul_right a b c }
(a * (b * c)) % prime;
( == ) { Math.Lemmas.lemma_mod_mul_distr_r a (b * c) prime }
(a * ((b * c) %... | false |
Hacl.Spec.Poly1305.Lemmas.fst | Hacl.Spec.Poly1305.Lemmas.poly_update_multi_lemma_load4_simplify | val poly_update_multi_lemma_load4_simplify:
acc0:pfelem -> r:pfelem -> c0:pfelem -> c1:pfelem -> c2:pfelem -> c3:pfelem ->
Lemma
( (((((((acc0 +% c0) *% r) +% c1) *% r) +% c2) *% r) +% c3) *% r ==
((((acc0 +% c0) *% ((r *% r) *% (r *% r))) +%
(c1 *% ((r *% r) *% r))) +% (c2 *% (r *% r))) +% c3 *% r ) | val poly_update_multi_lemma_load4_simplify:
acc0:pfelem -> r:pfelem -> c0:pfelem -> c1:pfelem -> c2:pfelem -> c3:pfelem ->
Lemma
( (((((((acc0 +% c0) *% r) +% c1) *% r) +% c2) *% r) +% c3) *% r ==
((((acc0 +% c0) *% ((r *% r) *% (r *% r))) +%
(c1 *% ((r *% r) *% r))) +% (c2 *% (r *% r))) +% c3 *% r ) | let poly_update_multi_lemma_load4_simplify acc0 r c0 c1 c2 c3 =
assert (
(((((((acc0 +% c0) *% r) +% c1) *% r) +% c2) *% r) +% c3) *% r ==
((((acc0 +% c0) *% ((r *% r) *% (r *% r))) +%
(c1 *% ((r *% r) *% r))) +% (c2 *% (r *% r))) +% c3 *% r )
by (poly_semiring ()) | {
"file_name": "code/poly1305/Hacl.Spec.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 23,
"end_line": 191,
"start_col": 0,
"start_line": 186
} | module Hacl.Spec.Poly1305.Lemmas
open FStar.Mul
module Scalar = Spec.Poly1305
open FStar.Algebra.CommMonoid
open FStar.Tactics.CanonCommSemiring
/// Semiring for Poly1305
#set-options "--z3rlimit 5 --max_fuel 0 --max_ifuel 0 --z3cliopt smt.arith.nl=false"
let prime: pos = Scalar.prime
let pfelem : eqtype = a:nat{... | {
"checked_file": "/",
"dependencies": [
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.CanonCommSemiring.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst... | [
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommSemiring",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra.CommMonoid",
"short_module": null
},
{
"abbrev"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
acc0: Hacl.Spec.Poly1305.Lemmas.pfelem ->
r: Hacl.Spec.Poly1305.Lemmas.pfelem ->
c0: Hacl.Spec.Poly1305.Lemmas.pfelem ->
c1: Hacl.Spec.Poly1305.Lemmas.pfelem ->
c2: Hacl.Spec.Poly1305.Lemmas.pfelem ->
c3: Hacl.Spec.Poly1305.Lemmas.pfelem
-> FStar.Pervasives.Lemma
(ensures
((((acc0 +... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Poly1305.Lemmas.pfelem",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.eq2",
"Hacl.Spec.Poly1305.Lemmas.op_Star_Percent",
"Hacl.Spec.Poly1305.Lemmas.op_Plus_Percent",
"Prims.unit",
"Hacl.Spec.Poly1305.Lemmas.poly_semiring"
] | [] | false | false | true | false | false | let poly_update_multi_lemma_load4_simplify acc0 r c0 c1 c2 c3 =
| FStar.Tactics.Effect.assert_by_tactic ((((((((acc0 +% c0) *% r) +% c1) *% r) +% c2) *% r) +% c3) *%
r ==
((((acc0 +% c0) *% ((r *% r) *% (r *% r))) +% (c1 *% ((r *% r) *% r))) +% (c2 *% (r *% r))) +%
c3 *% r)
(fun _ ->
();
(poly_semiring ())) | false |
Hacl.Spec.Poly1305.Lemmas.fst | Hacl.Spec.Poly1305.Lemmas.poly_update_repeat_blocks_multi_lemma2_simplify | val poly_update_repeat_blocks_multi_lemma2_simplify:
acc0:pfelem -> acc1:pfelem -> c0:pfelem -> c1:pfelem -> r:pfelem ->
Lemma (
(acc0 *% (r *% r) +% c0) *% (r *% r) +% (acc1 *% (r *% r) +% c1) *% r ==
((((acc0 *% (r *% r) +% acc1 *% r) +% c0) *% r) +% c1) *% r ) | val poly_update_repeat_blocks_multi_lemma2_simplify:
acc0:pfelem -> acc1:pfelem -> c0:pfelem -> c1:pfelem -> r:pfelem ->
Lemma (
(acc0 *% (r *% r) +% c0) *% (r *% r) +% (acc1 *% (r *% r) +% c1) *% r ==
((((acc0 *% (r *% r) +% acc1 *% r) +% c0) *% r) +% c1) *% r ) | let poly_update_repeat_blocks_multi_lemma2_simplify acc0 acc1 c0 c1 r =
assert (
(acc0 *% (r *% r) +% c0) *% (r *% r) +% (acc1 *% (r *% r) +% c1) *% r ==
((((acc0 *% (r *% r) +% acc1 *% r) +% c0) *% r) +% c1) *% r )
by (poly_semiring ()) | {
"file_name": "code/poly1305/Hacl.Spec.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 23,
"end_line": 138,
"start_col": 0,
"start_line": 134
} | module Hacl.Spec.Poly1305.Lemmas
open FStar.Mul
module Scalar = Spec.Poly1305
open FStar.Algebra.CommMonoid
open FStar.Tactics.CanonCommSemiring
/// Semiring for Poly1305
#set-options "--z3rlimit 5 --max_fuel 0 --max_ifuel 0 --z3cliopt smt.arith.nl=false"
let prime: pos = Scalar.prime
let pfelem : eqtype = a:nat{... | {
"checked_file": "/",
"dependencies": [
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.CanonCommSemiring.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst... | [
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommSemiring",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra.CommMonoid",
"short_module": null
},
{
"abbrev"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
acc0: Hacl.Spec.Poly1305.Lemmas.pfelem ->
acc1: Hacl.Spec.Poly1305.Lemmas.pfelem ->
c0: Hacl.Spec.Poly1305.Lemmas.pfelem ->
c1: Hacl.Spec.Poly1305.Lemmas.pfelem ->
r: Hacl.Spec.Poly1305.Lemmas.pfelem
-> FStar.Pervasives.Lemma
(ensures
(acc0 *% (r *% r) +% c0) *% (r *% r) +% (acc1 *% (r ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Poly1305.Lemmas.pfelem",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.eq2",
"Hacl.Spec.Poly1305.Lemmas.op_Plus_Percent",
"Hacl.Spec.Poly1305.Lemmas.op_Star_Percent",
"Prims.unit",
"Hacl.Spec.Poly1305.Lemmas.poly_semiring"
] | [] | false | false | true | false | false | let poly_update_repeat_blocks_multi_lemma2_simplify acc0 acc1 c0 c1 r =
| FStar.Tactics.Effect.assert_by_tactic ((acc0 *% (r *% r) +% c0) *% (r *% r) +%
(acc1 *% (r *% r) +% c1) *% r ==
((((acc0 *% (r *% r) +% acc1 *% r) +% c0) *% r) +% c1) *% r)
(fun _ ->
();
(poly_semiring ())) | false |
Vale.AES.AES_helpers.fst | Vale.AES.AES_helpers.lemma_expand_key_128_0 | val lemma_expand_key_128_0 (key:aes_key_LE AES_128) : Lemma
(equal key (expand_key AES_128 key 4)) | val lemma_expand_key_128_0 (key:aes_key_LE AES_128) : Lemma
(equal key (expand_key AES_128 key 4)) | let lemma_expand_key_128_0 (key:aes_key_LE AES_128) =
expand_key_reveal () | {
"file_name": "vale/code/crypto/aes/Vale.AES.AES_helpers.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 12,
"start_col": 0,
"start_line": 11
} | module Vale.AES.AES_helpers
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open FStar.Mul | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.TypesNative.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.De... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"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 | key: Vale.AES.AES_s.aes_key_LE Vale.AES.AES_common_s.AES_128
-> FStar.Pervasives.Lemma
(ensures
FStar.Seq.Base.equal key (Vale.AES.AES_s.expand_key Vale.AES.AES_common_s.AES_128 key 4)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.AES.AES_s.aes_key_LE",
"Vale.AES.AES_common_s.AES_128",
"Vale.AES.AES_s.expand_key_reveal",
"Prims.unit"
] | [] | true | false | true | false | false | let lemma_expand_key_128_0 (key: aes_key_LE AES_128) =
| expand_key_reveal () | false |
Vale.AES.AES_helpers.fst | Vale.AES.AES_helpers.lemma_simd_round_key | val lemma_simd_round_key (prev:quad32) (rcon:nat32) : Lemma
(simd_round_key_128 prev rcon == round_key_128_rcon prev rcon) | val lemma_simd_round_key (prev:quad32) (rcon:nat32) : Lemma
(simd_round_key_128 prev rcon == round_key_128_rcon prev rcon) | let lemma_simd_round_key (prev:quad32) (rcon:nat32) =
quad32_xor_reveal ();
reverse_bytes_nat32_reveal ();
commute_rot_word_sub_word prev.hi3;
Vale.Arch.Types.xor_lemmas () | {
"file_name": "vale/code/crypto/aes/Vale.AES.AES_helpers.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 31,
"end_line": 53,
"start_col": 0,
"start_line": 49
} | module Vale.AES.AES_helpers
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open FStar.Mul
#reset-options "--initial_fuel 4 --max_fuel 4 --max_ifuel 0"
let lemma_expand_key_128_0 (key:aes_key_LE AES_128) =
expand_key_reveal ()
#reset-options "--initial_fuel 1 -... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.TypesNative.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.De... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 3,
"initial_ifuel": 3,
"max_fuel": 3,
"max_ifuel": 3,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | prev: Vale.Def.Types_s.quad32 -> rcon: Vale.Def.Types_s.nat32
-> FStar.Pervasives.Lemma
(ensures
Vale.AES.AES_helpers.simd_round_key_128 prev rcon ==
Vale.AES.AES_helpers.round_key_128_rcon prev rcon) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Def.Types_s.quad32",
"Vale.Def.Types_s.nat32",
"Vale.Arch.Types.xor_lemmas",
"Prims.unit",
"Vale.AES.AES_s.commute_rot_word_sub_word",
"Vale.Def.Words_s.__proj__Mkfour__item__hi3",
"Vale.Def.Types_s.reverse_bytes_nat32_reveal",
"Vale.Def.Types_s.quad32_xor_reveal"
] | [] | true | false | true | false | false | let lemma_simd_round_key (prev: quad32) (rcon: nat32) =
| quad32_xor_reveal ();
reverse_bytes_nat32_reveal ();
commute_rot_word_sub_word prev.hi3;
Vale.Arch.Types.xor_lemmas () | false |
Vale.AES.AES_helpers.fst | Vale.AES.AES_helpers.finish_cipher | val finish_cipher (alg:algorithm) (input:quad32) (round_keys:seq quad32) :
Lemma
(length round_keys == (nr alg) + 1 ==>
length round_keys > 0 /\ nr alg > 1 /\ // REVIEW: Why are these needed?
(let state = quad32_xor input (index round_keys 0) in
let state = eval_rounds state round... | val finish_cipher (alg:algorithm) (input:quad32) (round_keys:seq quad32) :
Lemma
(length round_keys == (nr alg) + 1 ==>
length round_keys > 0 /\ nr alg > 1 /\ // REVIEW: Why are these needed?
(let state = quad32_xor input (index round_keys 0) in
let state = eval_rounds state round... | let finish_cipher (alg:algorithm) (input:quad32) (round_keys:seq quad32) =
eval_rounds_reveal ();
eval_cipher_reveal ();
commute_sub_bytes_shift_rows_forall() | {
"file_name": "vale/code/crypto/aes/Vale.AES.AES_helpers.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 39,
"end_line": 66,
"start_col": 0,
"start_line": 63
} | module Vale.AES.AES_helpers
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open FStar.Mul
#reset-options "--initial_fuel 4 --max_fuel 4 --max_ifuel 0"
let lemma_expand_key_128_0 (key:aes_key_LE AES_128) =
expand_key_reveal ()
#reset-options "--initial_fuel 1 -... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.TypesNative.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.De... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 1,
"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 |
alg: Vale.AES.AES_common_s.algorithm ->
input: Vale.Def.Types_s.quad32 ->
round_keys: FStar.Seq.Base.seq Vale.Def.Types_s.quad32
-> FStar.Pervasives.Lemma
(ensures
FStar.Seq.Base.length round_keys == Vale.AES.AES_common_s.nr alg + 1 ==>
FStar.Seq.Base.length round_keys > 0 /\ Vale.AES.AES... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.AES.AES_common_s.algorithm",
"Vale.Def.Types_s.quad32",
"FStar.Seq.Base.seq",
"Vale.AES.AES_helpers.commute_sub_bytes_shift_rows_forall",
"Prims.unit",
"Vale.AES.AES_s.eval_cipher_reveal",
"Vale.AES.AES_s.eval_rounds_reveal"
] | [] | true | false | true | false | false | let finish_cipher (alg: algorithm) (input: quad32) (round_keys: seq quad32) =
| eval_rounds_reveal ();
eval_cipher_reveal ();
commute_sub_bytes_shift_rows_forall () | false |
Vale.AES.AES_helpers.fst | Vale.AES.AES_helpers.lemma_expand_append | val lemma_expand_append (key:aes_key_LE AES_128) (size1:nat) (size2:nat) : Lemma
(requires size1 <= size2 /\ size2 <= 44)
(ensures equal (expand_key AES_128 key size1) (slice (expand_key AES_128 key size2) 0 size1))
(decreases size2) | val lemma_expand_append (key:aes_key_LE AES_128) (size1:nat) (size2:nat) : Lemma
(requires size1 <= size2 /\ size2 <= 44)
(ensures equal (expand_key AES_128 key size1) (slice (expand_key AES_128 key size2) 0 size1))
(decreases size2) | let rec lemma_expand_append (key:aes_key_LE AES_128) (size1:nat) (size2:nat) =
expand_key_reveal ();
if size1 < size2 then lemma_expand_append key size1 (size2 - 1) | {
"file_name": "vale/code/crypto/aes/Vale.AES.AES_helpers.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 65,
"end_line": 28,
"start_col": 0,
"start_line": 26
} | module Vale.AES.AES_helpers
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open FStar.Mul
#reset-options "--initial_fuel 4 --max_fuel 4 --max_ifuel 0"
let lemma_expand_key_128_0 (key:aes_key_LE AES_128) =
expand_key_reveal ()
#reset-options "--initial_fuel 1 -... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.TypesNative.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.De... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | key: Vale.AES.AES_s.aes_key_LE Vale.AES.AES_common_s.AES_128 -> size1: Prims.nat -> size2: Prims.nat
-> FStar.Pervasives.Lemma (requires size1 <= size2 /\ size2 <= 44)
(ensures
FStar.Seq.Base.equal (Vale.AES.AES_s.expand_key Vale.AES.AES_common_s.AES_128 key size1)
(FStar.Seq.Base.slice (Vale.... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Vale.AES.AES_s.aes_key_LE",
"Vale.AES.AES_common_s.AES_128",
"Prims.nat",
"Prims.op_LessThan",
"Vale.AES.AES_helpers.lemma_expand_append",
"Prims.op_Subtraction",
"Prims.bool",
"Prims.unit",
"Vale.AES.AES_s.expand_key_reveal"
] | [
"recursion"
] | false | false | true | false | false | let rec lemma_expand_append (key: aes_key_LE AES_128) (size1 size2: nat) =
| expand_key_reveal ();
if size1 < size2 then lemma_expand_append key size1 (size2 - 1) | false |
Vale.AES.AES_helpers.fst | Vale.AES.AES_helpers.init_rounds_opaque | val init_rounds_opaque (init:quad32) (round_keys:seq quad32) :
Lemma (length round_keys > 0 ==> eval_rounds init round_keys 0 == init) | val init_rounds_opaque (init:quad32) (round_keys:seq quad32) :
Lemma (length round_keys > 0 ==> eval_rounds init round_keys 0 == init) | let init_rounds_opaque (init:quad32) (round_keys:seq quad32) =
eval_rounds_reveal () | {
"file_name": "vale/code/crypto/aes/Vale.AES.AES_helpers.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 23,
"end_line": 60,
"start_col": 0,
"start_line": 59
} | module Vale.AES.AES_helpers
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open FStar.Mul
#reset-options "--initial_fuel 4 --max_fuel 4 --max_ifuel 0"
let lemma_expand_key_128_0 (key:aes_key_LE AES_128) =
expand_key_reveal ()
#reset-options "--initial_fuel 1 -... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.TypesNative.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.De... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | init: Vale.Def.Types_s.quad32 -> round_keys: FStar.Seq.Base.seq Vale.Def.Types_s.quad32
-> FStar.Pervasives.Lemma
(ensures
FStar.Seq.Base.length round_keys > 0 ==> Vale.AES.AES_s.eval_rounds init round_keys 0 == init) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Def.Types_s.quad32",
"FStar.Seq.Base.seq",
"Vale.AES.AES_s.eval_rounds_reveal",
"Prims.unit"
] | [] | true | false | true | false | false | let init_rounds_opaque (init: quad32) (round_keys: seq quad32) =
| eval_rounds_reveal () | false |
Vale.AES.AES_helpers.fst | Vale.AES.AES_helpers.lemma_expand_key_128_i | val lemma_expand_key_128_i (key:aes_key_LE AES_128) (i:nat) : Lemma
(requires
0 < i /\ i < 11
)
(ensures (
let m = 4 * (i - 1) in
let n = 4 * i in
let v = expand_key AES_128 key n in
let w = expand_key AES_128 key (n + 4) in
let prev = Mkfour v.[m + 0] v.[m + 1] v.[m + 2] v.[m... | val lemma_expand_key_128_i (key:aes_key_LE AES_128) (i:nat) : Lemma
(requires
0 < i /\ i < 11
)
(ensures (
let m = 4 * (i - 1) in
let n = 4 * i in
let v = expand_key AES_128 key n in
let w = expand_key AES_128 key (n + 4) in
let prev = Mkfour v.[m + 0] v.[m + 1] v.[m + 2] v.[m... | let lemma_expand_key_128_i (key:aes_key_LE AES_128) (i:nat) =
expand_key_reveal ();
let n = 4 * i in
// unfold expand_key 4 times (could use fuel, but that unfolds everything):
let _ = expand_key AES_128 key (n + 1) in
let _ = expand_key AES_128 key (n + 2) in
let _ = expand_key AES_128 key (n + 3) in
() | {
"file_name": "vale/code/crypto/aes/Vale.AES.AES_helpers.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 22,
"start_col": 0,
"start_line": 15
} | module Vale.AES.AES_helpers
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open FStar.Mul
#reset-options "--initial_fuel 4 --max_fuel 4 --max_ifuel 0"
let lemma_expand_key_128_0 (key:aes_key_LE AES_128) =
expand_key_reveal () | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.TypesNative.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.De... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | key: Vale.AES.AES_s.aes_key_LE Vale.AES.AES_common_s.AES_128 -> i: Prims.nat
-> FStar.Pervasives.Lemma (requires 0 < i /\ i < 11)
(ensures
(let m = 4 * (i - 1) in
let n = 4 * i in
let v = Vale.AES.AES_s.expand_key Vale.AES.AES_common_s.AES_128 key n in
let w = Vale.AES.AES_... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.AES.AES_s.aes_key_LE",
"Vale.AES.AES_common_s.AES_128",
"Prims.nat",
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat32",
"Prims.eq2",
"FStar.Seq.Base.length",
"Prims.op_Addition",
"Vale.AES.AES_s.expand_key",
"Prims.int",
"FStar.Mul.op_Star",
"Prims.unit",
"Vale.AES.AES_s.expand_key_reveal... | [] | true | false | true | false | false | let lemma_expand_key_128_i (key: aes_key_LE AES_128) (i: nat) =
| expand_key_reveal ();
let n = 4 * i in
let _ = expand_key AES_128 key (n + 1) in
let _ = expand_key AES_128 key (n + 2) in
let _ = expand_key AES_128 key (n + 3) in
() | false |
Vale.AES.AES_helpers.fst | Vale.AES.AES_helpers.lemma_incr_msb | val lemma_incr_msb (orig ctr ctr':quad32) (increment:nat) : Lemma
(requires increment < 256 /\
ctr == reverse_bytes_quad32 orig /\
ctr' == Vale.Arch.Types.add_wrap_quad32 ctr (Mkfour 0 0 0 (increment * 0x1000000)))
(ensures (orig.lo0 % 256) + increment < 256 ==> ctr' == reverse_bytes_quad32... | val lemma_incr_msb (orig ctr ctr':quad32) (increment:nat) : Lemma
(requires increment < 256 /\
ctr == reverse_bytes_quad32 orig /\
ctr' == Vale.Arch.Types.add_wrap_quad32 ctr (Mkfour 0 0 0 (increment * 0x1000000)))
(ensures (orig.lo0 % 256) + increment < 256 ==> ctr' == reverse_bytes_quad32... | let lemma_incr_msb (orig ctr ctr':quad32) (increment:nat) : Lemma
(requires increment < 256 /\
ctr == reverse_bytes_quad32 orig /\
ctr' == Vale.Arch.Types.add_wrap_quad32 ctr (Mkfour 0 0 0 (increment * 0x1000000)))
(ensures (orig.lo0 % 256) + increment < 256 ==> ctr' == reverse_bytes_quad32... | {
"file_name": "vale/code/crypto/aes/Vale.AES.AES_helpers.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 151,
"start_col": 0,
"start_line": 138
} | module Vale.AES.AES_helpers
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open FStar.Mul
#reset-options "--initial_fuel 4 --max_fuel 4 --max_ifuel 0"
let lemma_expand_key_128_0 (key:aes_key_LE AES_128) =
expand_key_reveal ()
#reset-options "--initial_fuel 1 -... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.TypesNative.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.De... | {
"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 |
orig: Vale.Def.Types_s.quad32 ->
ctr: Vale.Def.Types_s.quad32 ->
ctr': Vale.Def.Types_s.quad32 ->
increment: Prims.nat
-> FStar.Pervasives.Lemma
(requires
increment < 256 /\ ctr == Vale.Def.Types_s.reverse_bytes_quad32 orig /\
ctr' ==
Vale.Arch.Types.add_wrap_quad32 ctr ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Def.Types_s.quad32",
"Prims.nat",
"Prims.unit",
"Prims.op_LessThan",
"Prims.op_Addition",
"Prims.op_Modulus",
"Vale.Def.Words_s.__proj__Mkfour__item__lo0",
"Vale.Def.Types_s.nat32",
"Vale.AES.AES_helpers.lemma_add_0x1000000_reverse_mult",
"Prims.bool",
"Vale.Def.Types_s.reveal_reverse_byte... | [] | false | false | true | false | false | let lemma_incr_msb (orig ctr ctr': quad32) (increment: nat)
: Lemma
(requires
increment < 256 /\ ctr == reverse_bytes_quad32 orig /\
ctr' == Vale.Arch.Types.add_wrap_quad32 ctr (Mkfour 0 0 0 (increment * 0x1000000)))
(ensures
(orig.lo0 % 256) + increment < 256 ==>
ctr' ==... | let ctr_new = Vale.AES.GCTR_s.inc32 orig increment in
reveal_reverse_bytes_quad32 orig;
reveal_reverse_bytes_quad32 ctr_new;
if (orig.lo0 % 256) + increment < 256
then
(lemma_add_0x1000000_reverse_mult orig.lo0 increment;
());
() | false |
Vale.AES.AES_helpers.fst | Vale.AES.AES_helpers.finish_cipher_opt | val finish_cipher_opt (alg:algorithm) (input plain t0 t1 out:quad32) (round_keys:seq quad32) : Lemma
(requires length round_keys == (nr alg) + 1 /\
length round_keys > 0 /\ nr alg > 1 /\ // REVIEW: Why are these needed?
t0 = quad32_xor input (index round_keys 0) /\
t1 = eval_roun... | val finish_cipher_opt (alg:algorithm) (input plain t0 t1 out:quad32) (round_keys:seq quad32) : Lemma
(requires length round_keys == (nr alg) + 1 /\
length round_keys > 0 /\ nr alg > 1 /\ // REVIEW: Why are these needed?
t0 = quad32_xor input (index round_keys 0) /\
t1 = eval_roun... | let finish_cipher_opt (alg:algorithm) (input plain t0 t1 out:quad32) (round_keys:seq quad32) : Lemma
(requires length round_keys == (nr alg) + 1 /\
length round_keys > 0 /\ nr alg > 1 /\ // REVIEW: Why are these needed?
t0 = quad32_xor input (index round_keys 0) /\
t1 = eval_roun... | {
"file_name": "vale/code/crypto/aes/Vale.AES.AES_helpers.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 94,
"start_col": 0,
"start_line": 69
} | module Vale.AES.AES_helpers
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open FStar.Mul
#reset-options "--initial_fuel 4 --max_fuel 4 --max_ifuel 0"
let lemma_expand_key_128_0 (key:aes_key_LE AES_128) =
expand_key_reveal ()
#reset-options "--initial_fuel 1 -... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.TypesNative.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.De... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 1,
"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 |
alg: Vale.AES.AES_common_s.algorithm ->
input: Vale.Def.Types_s.quad32 ->
plain: Vale.Def.Types_s.quad32 ->
t0: Vale.Def.Types_s.quad32 ->
t1: Vale.Def.Types_s.quad32 ->
out: Vale.Def.Types_s.quad32 ->
round_keys: FStar.Seq.Base.seq Vale.Def.Types_s.quad32
-> FStar.Pervasives.Lemma
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.AES.AES_common_s.algorithm",
"Vale.Def.Types_s.quad32",
"FStar.Seq.Base.seq",
"Prims.unit",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Vale.Def.Types_s.quad32_xor",
"Vale.AES.AES_s.eval_cipher",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"FStar.Calc.calc_step",
"Vale.AES.AES_co... | [] | false | false | true | false | false | let finish_cipher_opt (alg: algorithm) (input plain t0 t1 out: quad32) (round_keys: seq quad32)
: Lemma
(requires
length round_keys == (nr alg) + 1 /\ length round_keys > 0 /\ nr alg > 1 /\
t0 = quad32_xor input (index round_keys 0) /\ t1 = eval_rounds t0 round_keys (nr alg - 1) /\
out... | calc ( == ) {
out;
( == ) { () }
quad32_xor (sub_bytes (shift_rows_LE t1)) (quad32_xor plain (index round_keys (nr alg)));
( == ) { Vale.Arch.TypesNative.lemma_quad32_xor_commutes plain (index round_keys (nr alg)) }
quad32_xor (sub_bytes (shift_rows_LE t1)) (quad32_xor (index round_keys (nr alg)) plain);
( ... | false |
Vale.AES.AES_helpers.fst | Vale.AES.AES_helpers.lemma_msb_in_bounds | val lemma_msb_in_bounds (ctr_BE inout5 t1':quad32) (counter:nat) : Lemma
(requires inout5 == reverse_bytes_quad32 (Vale.AES.GCTR_s.inc32 ctr_BE 5) /\
counter == ctr_BE.lo0 % 256 /\
counter + 6 < 256 /\
t1' == Vale.Arch.Types.add_wrap_quad32 inout5 (Mkfour 0 0 0 0x1000000))
(ensur... | val lemma_msb_in_bounds (ctr_BE inout5 t1':quad32) (counter:nat) : Lemma
(requires inout5 == reverse_bytes_quad32 (Vale.AES.GCTR_s.inc32 ctr_BE 5) /\
counter == ctr_BE.lo0 % 256 /\
counter + 6 < 256 /\
t1' == Vale.Arch.Types.add_wrap_quad32 inout5 (Mkfour 0 0 0 0x1000000))
(ensur... | let lemma_msb_in_bounds (ctr_BE inout5 t1':quad32) (counter:nat) : Lemma
(requires inout5 == reverse_bytes_quad32 (Vale.AES.GCTR_s.inc32 ctr_BE 5) /\
counter == ctr_BE.lo0 % 256 /\
counter + 6 < 256 /\
t1' == Vale.Arch.Types.add_wrap_quad32 inout5 (Mkfour 0 0 0 0x1000000))
(ensur... | {
"file_name": "vale/code/crypto/aes/Vale.AES.AES_helpers.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 182,
"start_col": 0,
"start_line": 154
} | module Vale.AES.AES_helpers
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open FStar.Mul
#reset-options "--initial_fuel 4 --max_fuel 4 --max_ifuel 0"
let lemma_expand_key_128_0 (key:aes_key_LE AES_128) =
expand_key_reveal ()
#reset-options "--initial_fuel 1 -... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.TypesNative.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.De... | {
"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 |
ctr_BE: Vale.Def.Types_s.quad32 ->
inout5: Vale.Def.Types_s.quad32 ->
t1': Vale.Def.Types_s.quad32 ->
counter: Prims.nat
-> FStar.Pervasives.Lemma
(requires
inout5 == Vale.Def.Types_s.reverse_bytes_quad32 (Vale.AES.GCTR_s.inc32 ctr_BE 5) /\
counter == Mkfour?.lo0 ctr_BE % 256 /\... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Def.Types_s.quad32",
"Prims.nat",
"Prims.unit",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"FStar.Calc.calc_step",
"Vale.Def.Words_s.Mkfour",
"Vale.Def.Types_s.nat32",
"Vale.Def.Words_s.__proj__Mkfour__item__lo0",
"Vale.Def.Words_s.__pr... | [] | false | false | true | false | false | let lemma_msb_in_bounds (ctr_BE inout5 t1': quad32) (counter: nat)
: Lemma
(requires
inout5 == reverse_bytes_quad32 (Vale.AES.GCTR_s.inc32 ctr_BE 5) /\
counter == ctr_BE.lo0 % 256 /\ counter + 6 < 256 /\
t1' == Vale.Arch.Types.add_wrap_quad32 inout5 (Mkfour 0 0 0 0x1000000))
(ens... | let ctr5 = Vale.AES.GCTR_s.inc32 ctr_BE 5 in
let ctr6 = Vale.AES.GCTR_s.inc32 ctr_BE 6 in
reveal_reverse_bytes_quad32 ctr5;
reveal_reverse_bytes_quad32 ctr6;
let r5 = reverse_bytes_quad32 ctr5 in
let r6 = reverse_bytes_quad32 ctr6 in
assert (ctr_BE.lo0 + 6 < pow2_32);
assert (ctr6.lo0 == ctr5.lo0 + 1);
calc ( == ) {
... | false |
Hacl.Spec.Poly1305.Lemmas.fst | Hacl.Spec.Poly1305.Lemmas.mul_add_distr | val mul_add_distr: distribute_left_lemma pfelem pfelem_add_cm pfelem_mul_cm | val mul_add_distr: distribute_left_lemma pfelem pfelem_add_cm pfelem_mul_cm | let mul_add_distr a b c =
normalize_term_spec prime;
calc (==) {
a *% (b +% c);
== { }
(a * (b +% c)) % prime;
== { Math.Lemmas.lemma_mod_add_distr a (b + c) prime }
(a * ((b + c) % prime)) % prime;
== { Math.Lemmas.lemma_mod_mul_distr_r a (b + c) prime }
(a * (b + c)) % prime;
== { ... | {
"file_name": "code/poly1305/Hacl.Spec.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 108,
"start_col": 0,
"start_line": 86
} | module Hacl.Spec.Poly1305.Lemmas
open FStar.Mul
module Scalar = Spec.Poly1305
open FStar.Algebra.CommMonoid
open FStar.Tactics.CanonCommSemiring
/// Semiring for Poly1305
#set-options "--z3rlimit 5 --max_fuel 0 --max_ifuel 0 --z3cliopt smt.arith.nl=false"
let prime: pos = Scalar.prime
let pfelem : eqtype = a:nat{... | {
"checked_file": "/",
"dependencies": [
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.CanonCommSemiring.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommSemiring",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra.CommMonoid",
"short_module": null
},
{
"abbrev": true,
"full_module": "Spec.Poly1305",
"short_module": "Scalar"
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | FStar.Tactics.CanonCommSemiring.distribute_left_lemma Hacl.Spec.Poly1305.Lemmas.pfelem
Hacl.Spec.Poly1305.Lemmas.pfelem_add_cm
Hacl.Spec.Poly1305.Lemmas.pfelem_mul_cm | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Poly1305.Lemmas.pfelem",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Hacl.Spec.Poly1305.Lemmas.op_Star_Percent",
"Hacl.Spec.Poly1305.Lemmas.op_Plus_Percent",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"Prims.op_Modulus",
"Prims.op_Additio... | [] | false | false | false | true | false | let mul_add_distr a b c =
| normalize_term_spec prime;
calc ( == ) {
a *% (b +% c);
( == ) { () }
(a * (b +% c)) % prime;
( == ) { Math.Lemmas.lemma_mod_add_distr a (b + c) prime }
(a * ((b + c) % prime)) % prime;
( == ) { Math.Lemmas.lemma_mod_mul_distr_r a (b + c) prime }
(a * (b + c)) % prime;
( == ) { Math.Lemmas.distributivit... | false |
Vale.AES.AES_helpers.fst | Vale.AES.AES_helpers.lemma_expand_key_128 | val lemma_expand_key_128 (key:seq nat32) (size:nat) : Lemma
(requires size <= 11 /\ is_aes_key_LE AES_128 key)
(ensures (
let s = key_schedule_to_round_keys size (expand_key AES_128 key 44) in
(forall (i:nat).{:pattern (expand_key_128 key i) \/ (expand_key_128_def key i)}
i < size ==> expand_key_128 k... | val lemma_expand_key_128 (key:seq nat32) (size:nat) : Lemma
(requires size <= 11 /\ is_aes_key_LE AES_128 key)
(ensures (
let s = key_schedule_to_round_keys size (expand_key AES_128 key 44) in
(forall (i:nat).{:pattern (expand_key_128 key i) \/ (expand_key_128_def key i)}
i < size ==> expand_key_128 k... | let rec lemma_expand_key_128 (key:seq nat32) (size:nat) =
expand_key_128_reveal ();
lemma_expand_append key (4 * size) 44;
if size = 0 then ()
else
(
let i = size - 1 in
lemma_expand_append key (4 * i) 44;
lemma_expand_key_128 key i;
if i = 0 then lemma_expand_key_128_0 key
else lemma_expa... | {
"file_name": "vale/code/crypto/aes/Vale.AES.AES_helpers.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 44,
"start_col": 0,
"start_line": 33
} | module Vale.AES.AES_helpers
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open FStar.Mul
#reset-options "--initial_fuel 4 --max_fuel 4 --max_ifuel 0"
let lemma_expand_key_128_0 (key:aes_key_LE AES_128) =
expand_key_reveal ()
#reset-options "--initial_fuel 1 -... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.TypesNative.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.De... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | key: FStar.Seq.Base.seq Vale.Def.Types_s.nat32 -> size: Prims.nat
-> FStar.Pervasives.Lemma
(requires size <= 11 /\ Vale.AES.AES_s.is_aes_key_LE Vale.AES.AES_common_s.AES_128 key)
(ensures
(let s =
Vale.AES.AES_s.key_schedule_to_round_keys size
(Vale.AES.AES_s.expand_key ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.nat32",
"Prims.nat",
"Prims.op_Equality",
"Prims.int",
"Prims.bool",
"Vale.AES.AES_helpers.lemma_expand_key_128_0",
"Vale.AES.AES_helpers.lemma_expand_key_128_i",
"Prims.unit",
"Vale.AES.AES_helpers.lemma_expand_key_128",
"Vale.AES.AES_helpers.lemma_expand... | [
"recursion"
] | false | false | true | false | false | let rec lemma_expand_key_128 (key: seq nat32) (size: nat) =
| expand_key_128_reveal ();
lemma_expand_append key (4 * size) 44;
if size = 0
then ()
else
(let i = size - 1 in
lemma_expand_append key (4 * i) 44;
lemma_expand_key_128 key i;
if i = 0 then lemma_expand_key_128_0 key else lemma_expand_key_128_i key i) | false |
CQueue.fst | CQueue.elim_queue_tail | val elim_queue_tail
(#opened: _)
(#a: Type)
(x: t a)
(l: Ghost.erased (list a))
: SteelGhost (Ghost.erased (ref (ccell_ptrvalue a))) opened
(queue_tail x l)
(fun tail -> llist_fragment_tail l (cllist_head x) `star` vptr (cllist_tail x) `star` vptr tail)
(fun h -> True)
(fun _ tail h ->
sel... | val elim_queue_tail
(#opened: _)
(#a: Type)
(x: t a)
(l: Ghost.erased (list a))
: SteelGhost (Ghost.erased (ref (ccell_ptrvalue a))) opened
(queue_tail x l)
(fun tail -> llist_fragment_tail l (cllist_head x) `star` vptr (cllist_tail x) `star` vptr tail)
(fun h -> True)
(fun _ tail h ->
sel... | let elim_queue_tail
#_ #a x l
=
let tail0 = elim_vdep
(llist_fragment_tail l (cllist_head x))
(queue_tail_dep1 x l)
in
let tail : Ghost.erased (ref (ccell_ptrvalue a)) = tail0 in
change_equal_slprop
(queue_tail_dep1 x l (Ghost.reveal tail0))
(vptr (cllist_tail x) `vdep` queue_tail_dep2 x l tai... | {
"file_name": "share/steel/examples/steel/CQueue.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 6,
"end_line": 736,
"start_col": 0,
"start_line": 713
} | module CQueue
open CQueue.LList
#set-options "--ide_id_info_off"
//Re-define squash, since this module explicitly
//replies on proving equalities of the form `t_of v == squash p`
//which are delicate in the presence of optimizations that
//unfold `Prims.squash (p /\ q)`to _:unit{p /\ q}
//See Issue #2496
let squash (... | {
"checked_file": "/",
"dependencies": [
"Steel.Memory.fsti.checked",
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"CQueue.LList.fsti.checked"
],
"interface_file": true,
"source... | [
{
"abbrev": false,
"full_module": "CQueue.LList",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Steel.Reference",
"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 | x: CQueue.t a -> l: FStar.Ghost.erased (Prims.list a)
-> Steel.Effect.Atomic.SteelGhost
(FStar.Ghost.erased (Steel.Reference.ref (CQueue.Cell.ccell_ptrvalue a))) | Steel.Effect.Atomic.SteelGhost | [] | [] | [
"Steel.Memory.inames",
"CQueue.t",
"FStar.Ghost.erased",
"Prims.list",
"Steel.Reference.ref",
"CQueue.Cell.ccell_ptrvalue",
"Prims.unit",
"Steel.Effect.Atomic.change_equal_slprop",
"Steel.Reference.vptr",
"FStar.Ghost.reveal",
"Steel.Effect.Atomic.elim_vrefine",
"CQueue.queue_tail_refine",
"... | [] | false | true | false | false | false | let elim_queue_tail #_ #a x l =
| let tail0 = elim_vdep (llist_fragment_tail l (cllist_head x)) (queue_tail_dep1 x l) in
let tail:Ghost.erased (ref (ccell_ptrvalue a)) = tail0 in
change_equal_slprop (queue_tail_dep1 x l (Ghost.reveal tail0))
((vptr (cllist_tail x)) `vdep` (queue_tail_dep2 x l tail0));
let tail2 = elim_vdep (vptr (cllist_tail x)) (que... | false |
Vale.AES.AES_helpers.fst | Vale.AES.AES_helpers.lemma_add_0x1000000_reverse_mult | val lemma_add_0x1000000_reverse_mult (n: nat32) (increment: nat)
: Lemma (requires (n % 256) + increment < 256)
(ensures
(let r = reverse_bytes_nat32 n in
r + increment * 0x1000000 == reverse_bytes_nat32 (n + increment))) | val lemma_add_0x1000000_reverse_mult (n: nat32) (increment: nat)
: Lemma (requires (n % 256) + increment < 256)
(ensures
(let r = reverse_bytes_nat32 n in
r + increment * 0x1000000 == reverse_bytes_nat32 (n + increment))) | let lemma_add_0x1000000_reverse_mult (n:nat32) (increment:nat) : Lemma
(requires (n % 256) + increment < 256)
(ensures (let r = reverse_bytes_nat32 n in
r + increment * 0x1000000 == reverse_bytes_nat32 (n + increment)))
=
let r = reverse_bytes_nat32 n in
assert_norm (Vale.Def.Words.Four_s.nat_to_f... | {
"file_name": "vale/code/crypto/aes/Vale.AES.AES_helpers.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 135,
"start_col": 0,
"start_line": 98
} | module Vale.AES.AES_helpers
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open FStar.Mul
#reset-options "--initial_fuel 4 --max_fuel 4 --max_ifuel 0"
let lemma_expand_key_128_0 (key:aes_key_LE AES_128) =
expand_key_reveal ()
#reset-options "--initial_fuel 1 -... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.TypesNative.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.De... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | n: Vale.Def.Types_s.nat32 -> increment: Prims.nat
-> FStar.Pervasives.Lemma (requires n % 256 + increment < 256)
(ensures
(let r = Vale.Def.Types_s.reverse_bytes_nat32 n in
r + increment * 0x1000000 == Vale.Def.Types_s.reverse_bytes_nat32 (n + increment))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Def.Types_s.nat32",
"Prims.nat",
"Prims.unit",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Vale.Def.Types_s.reverse_bytes_nat32",
"Prims.op_Addition",
"Vale.Def.Types_s.be_bytes_to_nat32",
"Vale.Lib.Seqs_s.reverse_seq",
"Vale.Def.Types_s.nat8",
"Vale.Def.Types_s.nat32_to_be_bytes",
"Prims.Co... | [] | false | false | true | false | false | let lemma_add_0x1000000_reverse_mult (n: nat32) (increment: nat)
: Lemma (requires (n % 256) + increment < 256)
(ensures
(let r = reverse_bytes_nat32 n in
r + increment * 0x1000000 == reverse_bytes_nat32 (n + increment))) =
| let r = reverse_bytes_nat32 n in
assert_norm (Vale.Def.Words.Four_s.nat_to_four 8 (n + increment) ==
Mkfour ((n + increment) % 0x100)
(((n + increment) / 0x100) % 0x100)
(((n + increment) / 0x10000) % 0x100)
(((n + increment) / 0x1000000) % 0x100));
assert ((n + increment) / 0x1000000 == n / 0x100... | false |
CQueue.fst | CQueue.llist_fragment_tail_append | val llist_fragment_tail_append
(#opened: _)
(#a: Type)
(phead0: ref (ccell_ptrvalue a))
(l1: Ghost.erased (list a))
(phead1: Ghost.erased (ref (ccell_ptrvalue a)))
(l2: Ghost.erased (list a))
: SteelGhost (Ghost.erased (list a))
opened
((llist_fragment_tail l1 phead0)... | val llist_fragment_tail_append
(#opened: _)
(#a: Type)
(phead0: ref (ccell_ptrvalue a))
(l1: Ghost.erased (list a))
(phead1: Ghost.erased (ref (ccell_ptrvalue a)))
(l2: Ghost.erased (list a))
: SteelGhost (Ghost.erased (list a))
opened
((llist_fragment_tail l1 phead0)... | let rec llist_fragment_tail_append
(#opened: _)
(#a: Type)
(phead0: ref (ccell_ptrvalue a))
(l1: Ghost.erased (list a))
(phead1: Ghost.erased (ref (ccell_ptrvalue a)))
(l2: Ghost.erased (list a))
: SteelGhost (Ghost.erased (list a)) opened
(llist_fragment_tail l1 phead0 `star` llist_fragment_tail l2 phe... | {
"file_name": "share/steel/examples/steel/CQueue.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 5,
"end_line": 629,
"start_col": 0,
"start_line": 597
} | module CQueue
open CQueue.LList
#set-options "--ide_id_info_off"
//Re-define squash, since this module explicitly
//replies on proving equalities of the form `t_of v == squash p`
//which are delicate in the presence of optimizations that
//unfold `Prims.squash (p /\ q)`to _:unit{p /\ q}
//See Issue #2496
let squash (... | {
"checked_file": "/",
"dependencies": [
"Steel.Memory.fsti.checked",
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"CQueue.LList.fsti.checked"
],
"interface_file": true,
"source... | [
{
"abbrev": false,
"full_module": "CQueue.LList",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Steel.Reference",
"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 |
phead0: Steel.Reference.ref (CQueue.Cell.ccell_ptrvalue a) ->
l1: FStar.Ghost.erased (Prims.list a) ->
phead1: FStar.Ghost.erased (Steel.Reference.ref (CQueue.Cell.ccell_ptrvalue a)) ->
l2: FStar.Ghost.erased (Prims.list a)
-> Steel.Effect.Atomic.SteelGhost (FStar.Ghost.erased (Prims.list a)) | Steel.Effect.Atomic.SteelGhost | [
""
] | [] | [
"Steel.Memory.inames",
"Steel.Reference.ref",
"CQueue.Cell.ccell_ptrvalue",
"FStar.Ghost.erased",
"Prims.list",
"Prims.uu___is_Nil",
"FStar.Ghost.reveal",
"Prims.unit",
"CQueue.elim_llist_fragment_tail_nil",
"FStar.List.Tot.Properties.append_l_nil",
"Prims.bool",
"CQueue.intro_llist_fragment_t... | [
"recursion"
] | false | true | false | false | false | let rec llist_fragment_tail_append
(#opened: _)
(#a: Type)
(phead0: ref (ccell_ptrvalue a))
(l1: Ghost.erased (list a))
(phead1: Ghost.erased (ref (ccell_ptrvalue a)))
(l2: Ghost.erased (list a))
: SteelGhost (Ghost.erased (list a))
opened
((llist_fragment_tail l1 phe... | let g1 = gget (llist_fragment_tail l1 phead0) in
assert (Ghost.reveal phead1 == Ghost.reveal g1);
if Nil? l2
then
(L.append_l_nil (Ghost.reveal l1);
elim_llist_fragment_tail_nil l2 phead1;
l1)
else
let res = elim_llist_fragment_tail_snoc l2 (Ghost.reveal phead1) in
let d = gget (vptr (ccell_data res.ll_un... | false |
Hacl.Spec.Poly1305.Lemmas.fst | Hacl.Spec.Poly1305.Lemmas.poly_update_repeat_blocks_multi_lemma4_simplify | val poly_update_repeat_blocks_multi_lemma4_simplify:
a0:pfelem -> a1:pfelem -> a2:pfelem -> a3:pfelem
-> c0:pfelem -> c1:pfelem -> c2:pfelem -> c3:pfelem
-> r:pfelem -> r2:pfelem{r2 == r *% r} -> r4:pfelem {r4 == r2 *% r2} ->
Lemma
(((a0 *% r4 +% c0) *% r4) +%
((a1 *% r4 +% c1) *% (r2 *% r)) +%
((a... | val poly_update_repeat_blocks_multi_lemma4_simplify:
a0:pfelem -> a1:pfelem -> a2:pfelem -> a3:pfelem
-> c0:pfelem -> c1:pfelem -> c2:pfelem -> c3:pfelem
-> r:pfelem -> r2:pfelem{r2 == r *% r} -> r4:pfelem {r4 == r2 *% r2} ->
Lemma
(((a0 *% r4 +% c0) *% r4) +%
((a1 *% r4 +% c1) *% (r2 *% r)) +%
((a... | let poly_update_repeat_blocks_multi_lemma4_simplify a0 a1 a2 a3 c0 c1 c2 c3 r r2 r4 =
let r2 = r *% r in
let r4 = r2 *% r2 in
assert (
((a0 *% r4 +% c0) *% r4) +%
((a1 *% r4 +% c1) *% (r2 *% r)) +%
((a2 *% r4 +% c2) *% r2) +%
((a3 *% r4 +% c3) *% r)
==
(((((((((((a0 *% r4 +%
(a1 *% (... | {
"file_name": "code/poly1305/Hacl.Spec.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 23,
"end_line": 167,
"start_col": 0,
"start_line": 154
} | module Hacl.Spec.Poly1305.Lemmas
open FStar.Mul
module Scalar = Spec.Poly1305
open FStar.Algebra.CommMonoid
open FStar.Tactics.CanonCommSemiring
/// Semiring for Poly1305
#set-options "--z3rlimit 5 --max_fuel 0 --max_ifuel 0 --z3cliopt smt.arith.nl=false"
let prime: pos = Scalar.prime
let pfelem : eqtype = a:nat{... | {
"checked_file": "/",
"dependencies": [
"Spec.Poly1305.fst.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.CanonCommSemiring.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst... | [
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommSemiring",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra.CommMonoid",
"short_module": null
},
{
"abbrev"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
a0: Hacl.Spec.Poly1305.Lemmas.pfelem ->
a1: Hacl.Spec.Poly1305.Lemmas.pfelem ->
a2: Hacl.Spec.Poly1305.Lemmas.pfelem ->
a3: Hacl.Spec.Poly1305.Lemmas.pfelem ->
c0: Hacl.Spec.Poly1305.Lemmas.pfelem ->
c1: Hacl.Spec.Poly1305.Lemmas.pfelem ->
c2: Hacl.Spec.Poly1305.Lemmas.pfelem ->
c3: Hac... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Poly1305.Lemmas.pfelem",
"Prims.eq2",
"Hacl.Spec.Poly1305.Lemmas.op_Star_Percent",
"FStar.Tactics.Effect.assert_by_tactic",
"Hacl.Spec.Poly1305.Lemmas.op_Plus_Percent",
"Prims.unit",
"Hacl.Spec.Poly1305.Lemmas.poly_semiring"
] | [] | false | false | true | false | false | let poly_update_repeat_blocks_multi_lemma4_simplify a0 a1 a2 a3 c0 c1 c2 c3 r r2 r4 =
| let r2 = r *% r in
let r4 = r2 *% r2 in
FStar.Tactics.Effect.assert_by_tactic (((a0 *% r4 +% c0) *% r4) +% ((a1 *% r4 +% c1) *% (r2 *% r)) +%
((a2 *% r4 +% c2) *% r2) +%
((a3 *% r4 +% c3) *% r) ==
(((((((((((a0 *% r4 +% (a1 *% (r2 *% r))) +% a2 *% r2) +% a3 *% r) +% c0) *% r) +% c1) *% r) +%
c2)... | false |
Hacl.Spec.K256.GLV.Lemmas.fst | Hacl.Spec.K256.GLV.Lemmas.lemma_aff_point_mul_split_lambda | val lemma_aff_point_mul_split_lambda: k:S.qelem -> p:S.aff_point ->
Lemma (let r1, r2 = scalar_split_lambda k in aff_point_mul k p ==
S.aff_point_add (aff_point_mul r1 p) (aff_point_mul r2 (aff_point_mul_lambda p))) | val lemma_aff_point_mul_split_lambda: k:S.qelem -> p:S.aff_point ->
Lemma (let r1, r2 = scalar_split_lambda k in aff_point_mul k p ==
S.aff_point_add (aff_point_mul r1 p) (aff_point_mul r2 (aff_point_mul_lambda p))) | let lemma_aff_point_mul_split_lambda k p =
let r1, r2 = scalar_split_lambda k in
calc (==) {
aff_point_mul k p;
(==) { lemma_scalar_split_lambda_eval k }
aff_point_mul S.(r1 +^ r2 *^ lambda) p;
(==) { Math.Lemmas.lemma_mod_plus_distr_r r1 (r2 * lambda) S.q }
aff_point_mul ((r1 + r2 * lambda) % S... | {
"file_name": "code/k256/Hacl.Spec.K256.GLV.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 103,
"start_col": 0,
"start_line": 87
} | module Hacl.Spec.K256.GLV.Lemmas
open FStar.Mul
module M = Lib.NatMod
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module S = Spec.K256
module LS = Spec.K256.Lemmas
module SM = Hacl.Spec.K256.ECSM.Lemmas
open Hacl.Spec.K256.GLV
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
// [lambda](px, py) ... | {
"checked_file": "/",
"dependencies": [
"Spec.K256.Lemmas.fsti.checked",
"Spec.K256.fst.checked",
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.NatMod.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Hacl.Spec.K256.GLV.fst.checked",
"Hacl.Spec.K256.ECSM.Lemmas.fst.... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.K256.GLV",
"short_module": null
},
{
"abbrev": true,
"full_module": "Hacl.Spec.K256.ECSM.Lemmas",
"short_module": "SM"
},
{
"abbrev": true,
"full_module": "Spec.K256.Lemmas",
"short_module": "LS"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | k: Spec.K256.PointOps.qelem -> p: Spec.K256.PointOps.aff_point
-> FStar.Pervasives.Lemma
(ensures
(let _ = Hacl.Spec.K256.GLV.scalar_split_lambda k in
(let FStar.Pervasives.Native.Mktuple2 #_ #_ r1 r2 = _ in
Hacl.Spec.K256.GLV.aff_point_mul k p ==
Spec.K256.PointOps.aff_point_add... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Spec.K256.PointOps.qelem",
"Spec.K256.PointOps.aff_point",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Hacl.Spec.K256.GLV.aff_point_mul",
"Spec.K256.PointOps.aff_point_add",
"Hacl.Spec.K256.GLV.aff_point_mul_lambda",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.... | [] | false | false | true | false | false | let lemma_aff_point_mul_split_lambda k p =
| let r1, r2 = scalar_split_lambda k in
calc ( == ) {
aff_point_mul k p;
( == ) { lemma_scalar_split_lambda_eval k }
aff_point_mul S.(r1 +^ r2 *^ lambda) p;
( == ) { Math.Lemmas.lemma_mod_plus_distr_r r1 (r2 * lambda) S.q }
aff_point_mul ((r1 + r2 * lambda) % S.q) p;
( == ) { SM.lemma_aff_point_mul_neg_modq (... | false |
LList2.fst | LList2.elim_llist_cons | val elim_llist_cons (#opened: _) (p1: ptr cell) (a: U32.t) (q: Ghost.erased (list U32.t))
: STGhostT (p2: Ghost.erased (ptr cell) {~(p1 == null _)})
opened
(llist p1 (a :: q))
(fun p2 ->
((pts_to p1 ({ hd = mk_scalar a; tl = mk_scalar (Ghost.reveal p2) })) `star` (llist p2 q))
... | val elim_llist_cons (#opened: _) (p1: ptr cell) (a: U32.t) (q: Ghost.erased (list U32.t))
: STGhostT (p2: Ghost.erased (ptr cell) {~(p1 == null _)})
opened
(llist p1 (a :: q))
(fun p2 ->
((pts_to p1 ({ hd = mk_scalar a; tl = mk_scalar (Ghost.reveal p2) })) `star` (llist p2 q))
... | let elim_llist_cons
(#opened: _)
(p1: ptr cell) (a: U32.t) (q: Ghost.erased (list U32.t))
: STGhostT (p2: Ghost.erased (ptr cell) { ~ (p1 == null _) }) opened
(llist p1 (a :: q))
(fun p2 ->
pts_to p1 ({ hd = mk_scalar a; tl = mk_scalar (Ghost.reveal p2) }) `star`
llist p2 q `star`
freeable... | {
"file_name": "share/steel/examples/steelc/LList2.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 3,
"end_line": 88,
"start_col": 0,
"start_line": 71
} | module LList2
open Steel.ST.GenElim
open Steel.ST.C.Types
open Steel.ST.C.Types.Struct.Aux
open Steel.ST.C.Types.UserStruct // hides Struct
module U32 = FStar.UInt32
noeq
type cell_t = {
hd: scalar_t U32.t;
tl: scalar_t (ptr_gen cell_t);
}
noextract
inline_for_extraction
[@@ norm_field_attr]
let cell_struct_def ... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.GenElim.fsti.checked",
"Steel.ST.C.Types.UserStruct.fsti.checked",
"Steel.ST.C.Types.Struct.Aux.fsti.checked",
"Steel.ST.C.Types.fst.checked",
"prims.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasi... | [
{
"abbrev": false,
"full_module": "Steel.ST.C.Types.UserStruct // hides Struct",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "Steel.ST.C.Types.UserStruct",
"short_module": null
},
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
p1: Steel.ST.C.Types.Base.ptr LList2.cell ->
a: FStar.UInt32.t ->
q: FStar.Ghost.erased (Prims.list FStar.UInt32.t)
-> Steel.ST.Effect.Ghost.STGhostT
(p2:
FStar.Ghost.erased (Steel.ST.C.Types.Base.ptr LList2.cell)
{~(p1 == Steel.ST.C.Types.Base.null LList2.cell)}) | Steel.ST.Effect.Ghost.STGhostT | [] | [] | [
"Steel.Memory.inames",
"Steel.ST.C.Types.Base.ptr",
"LList2.cell_t",
"LList2.cell",
"FStar.UInt32.t",
"FStar.Ghost.erased",
"Prims.list",
"Prims.l_not",
"Prims.eq2",
"Steel.ST.C.Types.Base.null",
"Prims.unit",
"Steel.ST.Util.rewrite",
"Steel.ST.C.Types.Base.freeable",
"Steel.ST.GenElim.Bas... | [] | false | true | false | false | false | let elim_llist_cons (#opened: _) (p1: ptr cell) (a: U32.t) (q: Ghost.erased (list U32.t))
: STGhostT (p2: Ghost.erased (ptr cell) {~(p1 == null _)})
opened
(llist p1 (a :: q))
(fun p2 ->
((pts_to p1 ({ hd = mk_scalar a; tl = mk_scalar (Ghost.reveal p2) })) `star` (llist p2 q))
... | rewrite_with_tactic (llist p1 (a :: q)) (llist_cons p1 a q llist);
let _ = gen_elim () in
let p2' = vpattern_erased (fun x -> llist x q) in
let p2:(p2: Ghost.erased (ptr cell) {~(p1 == null _)}) = p2' in
vpattern_rewrite (fun x -> llist x q) p2;
rewrite (pts_to _ _) (pts_to _ _);
rewrite (freeable _) (freeable _);
_ | false |
FStar.DM4F.ST.fst | FStar.DM4F.ST.st | val st : s: Type -> a: Type -> Type | let st (s:Type) (a:Type) = s -> M (a * s) | {
"file_name": "examples/dm4free/FStar.DM4F.ST.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 41,
"end_line": 27,
"start_col": 0,
"start_line": 27
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.DM4F.ST.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pri... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: Type -> a: Type -> Type | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.Native.tuple2"
] | [] | false | false | false | true | true | let st (s a: Type) =
| s -> M (a * s) | false | |
FStar.DM4F.ST.fst | FStar.DM4F.ST.return_st | val return_st (s a: Type) (x: a) : st s a | val return_st (s a: Type) (x: a) : st s a | let return_st (s:Type) (a:Type) (x:a) : st s a = fun s0 -> x, s0 | {
"file_name": "examples/dm4free/FStar.DM4F.ST.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 64,
"end_line": 30,
"start_col": 0,
"start_line": 30
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.DM4F.ST.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pri... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: Type -> a: Type -> x: a -> FStar.DM4F.ST.st s a | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.tuple2",
"FStar.DM4F.ST.st"
] | [] | false | false | false | true | false | let return_st (s a: Type) (x: a) : st s a =
| fun s0 -> x, s0 | false |
FStar.DM4F.ST.fst | FStar.DM4F.ST.bind_st | val bind_st (s a b: Type) (f: st s a) (g: (a -> st s b)) : st s b | val bind_st (s a b: Type) (f: st s a) (g: (a -> st s b)) : st s b | let bind_st (s:Type) (a:Type) (b:Type) (f:st s a) (g:a -> st s b) : st s b
= fun (s0:s) -> let (x,s) = f s0 in g x s | {
"file_name": "examples/dm4free/FStar.DM4F.ST.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 43,
"end_line": 33,
"start_col": 0,
"start_line": 32
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.DM4F.ST.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pri... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: Type -> a: Type -> b: Type -> f: FStar.DM4F.ST.st s a -> g: (_: a -> FStar.DM4F.ST.st s b)
-> FStar.DM4F.ST.st s b | Prims.Tot | [
"total"
] | [] | [
"FStar.DM4F.ST.st",
"FStar.Pervasives.Native.tuple2"
] | [] | false | false | false | true | false | let bind_st (s a b: Type) (f: st s a) (g: (a -> st s b)) : st s b =
| fun (s0: s) ->
let x, s = f s0 in
g x s | false |
FStar.DM4F.ST.fst | FStar.DM4F.ST.get | val get: s: Type -> Prims.unit -> st s s | val get: s: Type -> Prims.unit -> st s s | let get (s:Type) () : st s s = fun s0 -> s0, s0 | {
"file_name": "examples/dm4free/FStar.DM4F.ST.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 47,
"end_line": 38,
"start_col": 0,
"start_line": 38
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.DM4F.ST.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pri... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: Type -> _: Prims.unit -> FStar.DM4F.ST.st s s | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.tuple2",
"FStar.DM4F.ST.st"
] | [] | false | false | false | true | false | let get (s: Type) () : st s s =
| fun s0 -> s0, s0 | false |
FStar.DM4F.ST.fst | FStar.DM4F.ST.put | val put (s: Type) (x: s) : st s unit | val put (s: Type) (x: s) : st s unit | let put (s:Type) (x:s) : st s unit = fun _ -> (), x | {
"file_name": "examples/dm4free/FStar.DM4F.ST.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 51,
"end_line": 40,
"start_col": 0,
"start_line": 40
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.DM4F.ST.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pri... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: Type -> x: s -> FStar.DM4F.ST.st s Prims.unit | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.Native.Mktuple2",
"Prims.unit",
"FStar.Pervasives.Native.tuple2",
"FStar.DM4F.ST.st"
] | [] | false | false | false | true | false | let put (s: Type) (x: s) : st s unit =
| fun _ -> (), x | false |
FStar.PtrdiffT.fst | FStar.PtrdiffT.min_bound | val min_bound:erased int | val min_bound:erased int | let min_bound : erased int = hide (- (reveal max_bound + 1)) | {
"file_name": "ulib/FStar.PtrdiffT.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 60,
"end_line": 15,
"start_col": 0,
"start_line": 15
} | module FStar.PtrdiffT
module Cast = FStar.Int.Cast
module I64 = FStar.Int64
open FStar.Ghost
friend FStar.SizeT
(** We assume the existence of lower and upper bounds corresponding to PTRDIFF_MIN
and PTRDIFF_MAX, which ensure that a ptrdiff_t has at least width 16 according to
the C standard *)
assume | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.SizeT.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Int64.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.Int.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_fil... | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Int64",
"short_module": "I64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"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 | FStar.Ghost.erased Prims.int | Prims.Tot | [
"total"
] | [] | [
"FStar.Ghost.hide",
"Prims.int",
"Prims.op_Minus",
"Prims.op_Addition",
"FStar.Ghost.reveal",
"FStar.PtrdiffT.max_bound"
] | [] | false | false | false | true | false | let min_bound:erased int =
| hide (- (reveal max_bound + 1)) | false |
FStar.PtrdiffT.fst | FStar.PtrdiffT.fits | val fits (x: int) : Tot prop | val fits (x: int) : Tot prop | let fits x =
FStar.Int.fits x I64.n == true /\
x <= max_bound /\ x >= min_bound | {
"file_name": "ulib/FStar.PtrdiffT.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 25,
"start_col": 0,
"start_line": 23
} | module FStar.PtrdiffT
module Cast = FStar.Int.Cast
module I64 = FStar.Int64
open FStar.Ghost
friend FStar.SizeT
(** We assume the existence of lower and upper bounds corresponding to PTRDIFF_MIN
and PTRDIFF_MAX, which ensure that a ptrdiff_t has at least width 16 according to
the C standard *)
assume
val ma... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.SizeT.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Int64.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.Int.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_fil... | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Int64",
"short_module": "I64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"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 | x: Prims.int -> Prims.prop | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"Prims.l_and",
"Prims.eq2",
"Prims.bool",
"FStar.Int.fits",
"FStar.Int64.n",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Ghost.reveal",
"FStar.PtrdiffT.max_bound",
"Prims.op_GreaterThanOrEqual",
"FStar.PtrdiffT.min_bound",
"Prims.prop"
] | [] | false | false | false | true | true | let fits x =
| FStar.Int.fits x I64.n == true /\ x <= max_bound /\ x >= min_bound | false |
FStar.PtrdiffT.fst | FStar.PtrdiffT.t | val t : eqtype | val t : eqtype | let t = x:I64.t{I64.v x >= min_bound /\ I64.v x <= max_bound } | {
"file_name": "ulib/FStar.PtrdiffT.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 21,
"start_col": 0,
"start_line": 21
} | module FStar.PtrdiffT
module Cast = FStar.Int.Cast
module I64 = FStar.Int64
open FStar.Ghost
friend FStar.SizeT
(** We assume the existence of lower and upper bounds corresponding to PTRDIFF_MIN
and PTRDIFF_MAX, which ensure that a ptrdiff_t has at least width 16 according to
the C standard *)
assume
val ma... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.SizeT.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Int64.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.Int.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_fil... | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Int64",
"short_module": "I64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"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 | Prims.eqtype | Prims.Tot | [
"total"
] | [] | [
"FStar.Int64.t",
"Prims.l_and",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"FStar.Int64.v",
"FStar.Ghost.reveal",
"Prims.int",
"FStar.PtrdiffT.min_bound",
"Prims.op_LessThanOrEqual",
"FStar.PtrdiffT.max_bound"
] | [] | false | false | false | true | false | let t =
| x: I64.t{I64.v x >= min_bound /\ I64.v x <= max_bound} | false |
FStar.PtrdiffT.fst | FStar.PtrdiffT.v | val v (x: t) : Pure int
(requires True)
(ensures (fun y -> fits y)) | val v (x: t) : Pure int
(requires True)
(ensures (fun y -> fits y)) | let v x =
I64.v x | {
"file_name": "ulib/FStar.PtrdiffT.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 9,
"end_line": 30,
"start_col": 0,
"start_line": 29
} | module FStar.PtrdiffT
module Cast = FStar.Int.Cast
module I64 = FStar.Int64
open FStar.Ghost
friend FStar.SizeT
(** We assume the existence of lower and upper bounds corresponding to PTRDIFF_MIN
and PTRDIFF_MAX, which ensure that a ptrdiff_t has at least width 16 according to
the C standard *)
assume
val ma... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.SizeT.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Int64.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.Int.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_fil... | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Int64",
"short_module": "I64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"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 | x: FStar.PtrdiffT.t -> Prims.Pure Prims.int | Prims.Pure | [] | [] | [
"FStar.PtrdiffT.t",
"FStar.Int64.v",
"Prims.int"
] | [] | false | false | false | false | false | let v x =
| I64.v x | false |
FStar.PtrdiffT.fst | FStar.PtrdiffT.int_to_t | val int_to_t (x: int) : Pure t
(requires (fits x))
(ensures (fun y -> v y == x)) | val int_to_t (x: int) : Pure t
(requires (fits x))
(ensures (fun y -> v y == x)) | let int_to_t (x: int) : Pure t
(requires (fits x))
(ensures (fun y -> v y == x))
= I64.int_to_t x | {
"file_name": "ulib/FStar.PtrdiffT.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 18,
"end_line": 35,
"start_col": 0,
"start_line": 32
} | module FStar.PtrdiffT
module Cast = FStar.Int.Cast
module I64 = FStar.Int64
open FStar.Ghost
friend FStar.SizeT
(** We assume the existence of lower and upper bounds corresponding to PTRDIFF_MIN
and PTRDIFF_MAX, which ensure that a ptrdiff_t has at least width 16 according to
the C standard *)
assume
val ma... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.SizeT.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Int64.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.Int.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_fil... | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Int64",
"short_module": "I64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"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 | x: Prims.int -> Prims.Pure FStar.PtrdiffT.t | Prims.Pure | [] | [] | [
"Prims.int",
"FStar.Int64.int_to_t",
"FStar.PtrdiffT.t",
"FStar.PtrdiffT.fits",
"Prims.eq2",
"FStar.PtrdiffT.v"
] | [] | false | false | false | false | false | let int_to_t (x: int) : Pure t (requires (fits x)) (ensures (fun y -> v y == x)) =
| I64.int_to_t x | false |
FStar.PtrdiffT.fst | FStar.PtrdiffT.add | val add (x y: t) : Pure t
(requires (fits (v x + v y)))
(ensures (fun z -> v z == v x + v y)) | val add (x y: t) : Pure t
(requires (fits (v x + v y)))
(ensures (fun z -> v z == v x + v y)) | let add x y = I64.add x y | {
"file_name": "ulib/FStar.PtrdiffT.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 25,
"end_line": 46,
"start_col": 0,
"start_line": 46
} | module FStar.PtrdiffT
module Cast = FStar.Int.Cast
module I64 = FStar.Int64
open FStar.Ghost
friend FStar.SizeT
(** We assume the existence of lower and upper bounds corresponding to PTRDIFF_MIN
and PTRDIFF_MAX, which ensure that a ptrdiff_t has at least width 16 according to
the C standard *)
assume
val ma... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.SizeT.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Int64.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.Int.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_fil... | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Int64",
"short_module": "I64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"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 | x: FStar.PtrdiffT.t -> y: FStar.PtrdiffT.t -> Prims.Pure FStar.PtrdiffT.t | Prims.Pure | [] | [] | [
"FStar.PtrdiffT.t",
"FStar.Int64.add"
] | [] | false | false | false | false | false | let add x y =
| I64.add x y | false |
FStar.PtrdiffT.fst | FStar.PtrdiffT.ptrdifft_to_sizet | val ptrdifft_to_sizet (x:t{v x >= 0}) : Pure US.t
(requires True)
(ensures fun c -> v x == US.v c) | val ptrdifft_to_sizet (x:t{v x >= 0}) : Pure US.t
(requires True)
(ensures fun c -> v x == US.v c) | let ptrdifft_to_sizet x =
bounds_lemma ();
Cast.int64_to_uint64 x | {
"file_name": "ulib/FStar.PtrdiffT.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 44,
"start_col": 0,
"start_line": 42
} | module FStar.PtrdiffT
module Cast = FStar.Int.Cast
module I64 = FStar.Int64
open FStar.Ghost
friend FStar.SizeT
(** We assume the existence of lower and upper bounds corresponding to PTRDIFF_MIN
and PTRDIFF_MAX, which ensure that a ptrdiff_t has at least width 16 according to
the C standard *)
assume
val ma... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.SizeT.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Int64.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.Int.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_fil... | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Int64",
"short_module": "I64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"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 | x: FStar.PtrdiffT.t{FStar.PtrdiffT.v x >= 0} -> Prims.Pure FStar.SizeT.t | Prims.Pure | [] | [] | [
"FStar.PtrdiffT.t",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"FStar.PtrdiffT.v",
"FStar.Int.Cast.int64_to_uint64",
"Prims.unit",
"FStar.PtrdiffT.bounds_lemma",
"FStar.SizeT.t"
] | [] | false | false | false | false | false | let ptrdifft_to_sizet x =
| bounds_lemma ();
Cast.int64_to_uint64 x | false |
FStar.PtrdiffT.fst | FStar.PtrdiffT.mk | val mk (x: I16.t) : Pure t
(requires True)
(ensures (fun y -> v y == I16.v x)) | val mk (x: I16.t) : Pure t
(requires True)
(ensures (fun y -> v y == I16.v x)) | let mk x = int_to_t (I16.v x) | {
"file_name": "ulib/FStar.PtrdiffT.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 29,
"end_line": 40,
"start_col": 0,
"start_line": 40
} | module FStar.PtrdiffT
module Cast = FStar.Int.Cast
module I64 = FStar.Int64
open FStar.Ghost
friend FStar.SizeT
(** We assume the existence of lower and upper bounds corresponding to PTRDIFF_MIN
and PTRDIFF_MAX, which ensure that a ptrdiff_t has at least width 16 according to
the C standard *)
assume
val ma... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.SizeT.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Int64.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.Int.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_fil... | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Int64",
"short_module": "I64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"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 | x: FStar.Int16.t -> Prims.Pure FStar.PtrdiffT.t | Prims.Pure | [] | [] | [
"FStar.Int16.t",
"FStar.PtrdiffT.int_to_t",
"FStar.Int16.v",
"FStar.PtrdiffT.t"
] | [] | false | false | false | false | false | let mk x =
| int_to_t (I16.v x) | false |
FStar.PtrdiffT.fst | FStar.PtrdiffT.rem | val rem (a:t{v a >= 0}) (b:t{v b > 0}) : Pure t
(requires True)
(ensures (fun c -> mod_spec (v a) (v b) = v c)) | val rem (a:t{v a >= 0}) (b:t{v b > 0}) : Pure t
(requires True)
(ensures (fun c -> mod_spec (v a) (v b) = v c)) | let rem x y = I64.rem x y | {
"file_name": "ulib/FStar.PtrdiffT.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 25,
"end_line": 52,
"start_col": 0,
"start_line": 52
} | module FStar.PtrdiffT
module Cast = FStar.Int.Cast
module I64 = FStar.Int64
open FStar.Ghost
friend FStar.SizeT
(** We assume the existence of lower and upper bounds corresponding to PTRDIFF_MIN
and PTRDIFF_MAX, which ensure that a ptrdiff_t has at least width 16 according to
the C standard *)
assume
val ma... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.SizeT.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Int64.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.Int.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_fil... | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Int64",
"short_module": "I64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"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: FStar.PtrdiffT.t{FStar.PtrdiffT.v a >= 0} -> b: FStar.PtrdiffT.t{FStar.PtrdiffT.v b > 0}
-> Prims.Pure FStar.PtrdiffT.t | Prims.Pure | [] | [] | [
"FStar.PtrdiffT.t",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"FStar.PtrdiffT.v",
"Prims.op_GreaterThan",
"FStar.Int64.rem"
] | [] | false | false | false | false | false | let rem x y =
| I64.rem x y | false |
FStar.PtrdiffT.fst | FStar.PtrdiffT.lt | val lt (x y:t) : Pure bool
(requires True)
(ensures (fun z -> z == (v x < v y))) | val lt (x y:t) : Pure bool
(requires True)
(ensures (fun z -> z == (v x < v y))) | let lt x y = I64.lt x y | {
"file_name": "ulib/FStar.PtrdiffT.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 23,
"end_line": 55,
"start_col": 0,
"start_line": 55
} | module FStar.PtrdiffT
module Cast = FStar.Int.Cast
module I64 = FStar.Int64
open FStar.Ghost
friend FStar.SizeT
(** We assume the existence of lower and upper bounds corresponding to PTRDIFF_MIN
and PTRDIFF_MAX, which ensure that a ptrdiff_t has at least width 16 according to
the C standard *)
assume
val ma... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.SizeT.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Int64.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.Int.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_fil... | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Int64",
"short_module": "I64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"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 | x: FStar.PtrdiffT.t -> y: FStar.PtrdiffT.t -> Prims.Pure Prims.bool | Prims.Pure | [] | [] | [
"FStar.PtrdiffT.t",
"FStar.Int64.lt",
"Prims.bool"
] | [] | false | false | false | false | false | let lt x y =
| I64.lt x y | false |
FStar.PtrdiffT.fst | FStar.PtrdiffT.gt | val gt (x y:t) : Pure bool
(requires True)
(ensures (fun z -> z == (v x > v y))) | val gt (x y:t) : Pure bool
(requires True)
(ensures (fun z -> z == (v x > v y))) | let gt x y = I64.gt x y | {
"file_name": "ulib/FStar.PtrdiffT.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 23,
"end_line": 53,
"start_col": 0,
"start_line": 53
} | module FStar.PtrdiffT
module Cast = FStar.Int.Cast
module I64 = FStar.Int64
open FStar.Ghost
friend FStar.SizeT
(** We assume the existence of lower and upper bounds corresponding to PTRDIFF_MIN
and PTRDIFF_MAX, which ensure that a ptrdiff_t has at least width 16 according to
the C standard *)
assume
val ma... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.SizeT.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Int64.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.Int.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_fil... | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Int64",
"short_module": "I64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"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 | x: FStar.PtrdiffT.t -> y: FStar.PtrdiffT.t -> Prims.Pure Prims.bool | Prims.Pure | [] | [] | [
"FStar.PtrdiffT.t",
"FStar.Int64.gt",
"Prims.bool"
] | [] | false | false | false | false | false | let gt x y =
| I64.gt x y | false |
FStar.PtrdiffT.fst | FStar.PtrdiffT.div | val div (a:t{v a >= 0}) (b:t{v b > 0}) : Pure t
(requires True)
(ensures fun c -> v a / v b == v c) | val div (a:t{v a >= 0}) (b:t{v b > 0}) : Pure t
(requires True)
(ensures fun c -> v a / v b == v c) | let div x y =
FStar.Math.Lib.slash_decr_axiom (v x) (v y);
I64.div x y | {
"file_name": "ulib/FStar.PtrdiffT.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 13,
"end_line": 50,
"start_col": 0,
"start_line": 48
} | module FStar.PtrdiffT
module Cast = FStar.Int.Cast
module I64 = FStar.Int64
open FStar.Ghost
friend FStar.SizeT
(** We assume the existence of lower and upper bounds corresponding to PTRDIFF_MIN
and PTRDIFF_MAX, which ensure that a ptrdiff_t has at least width 16 according to
the C standard *)
assume
val ma... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.SizeT.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Int64.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.Int.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_fil... | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Int64",
"short_module": "I64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"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: FStar.PtrdiffT.t{FStar.PtrdiffT.v a >= 0} -> b: FStar.PtrdiffT.t{FStar.PtrdiffT.v b > 0}
-> Prims.Pure FStar.PtrdiffT.t | Prims.Pure | [] | [] | [
"FStar.PtrdiffT.t",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"FStar.PtrdiffT.v",
"Prims.op_GreaterThan",
"FStar.Int64.div",
"Prims.unit",
"FStar.Math.Lib.slash_decr_axiom"
] | [] | false | false | false | false | false | let div x y =
| FStar.Math.Lib.slash_decr_axiom (v x) (v y);
I64.div x y | false |
FStar.PtrdiffT.fst | FStar.PtrdiffT.lte | val lte (x y: t) : Pure bool
(requires True)
(ensures (fun z -> z == (v x <= v y))) | val lte (x y: t) : Pure bool
(requires True)
(ensures (fun z -> z == (v x <= v y))) | let lte x y = I64.lte x y | {
"file_name": "ulib/FStar.PtrdiffT.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 25,
"end_line": 56,
"start_col": 0,
"start_line": 56
} | module FStar.PtrdiffT
module Cast = FStar.Int.Cast
module I64 = FStar.Int64
open FStar.Ghost
friend FStar.SizeT
(** We assume the existence of lower and upper bounds corresponding to PTRDIFF_MIN
and PTRDIFF_MAX, which ensure that a ptrdiff_t has at least width 16 according to
the C standard *)
assume
val ma... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.SizeT.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Int64.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.Int.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_fil... | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Int64",
"short_module": "I64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"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 | x: FStar.PtrdiffT.t -> y: FStar.PtrdiffT.t -> Prims.Pure Prims.bool | Prims.Pure | [] | [] | [
"FStar.PtrdiffT.t",
"FStar.Int64.lte",
"Prims.bool"
] | [] | false | false | false | false | false | let lte x y =
| I64.lte x y | false |
FStar.PtrdiffT.fst | FStar.PtrdiffT.gte | val gte (x y:t) : Pure bool
(requires True)
(ensures (fun z -> z == (v x >= v y))) | val gte (x y:t) : Pure bool
(requires True)
(ensures (fun z -> z == (v x >= v y))) | let gte x y = I64.gte x y | {
"file_name": "ulib/FStar.PtrdiffT.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 25,
"end_line": 54,
"start_col": 0,
"start_line": 54
} | module FStar.PtrdiffT
module Cast = FStar.Int.Cast
module I64 = FStar.Int64
open FStar.Ghost
friend FStar.SizeT
(** We assume the existence of lower and upper bounds corresponding to PTRDIFF_MIN
and PTRDIFF_MAX, which ensure that a ptrdiff_t has at least width 16 according to
the C standard *)
assume
val ma... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.SizeT.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Int64.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.Int.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_fil... | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Int64",
"short_module": "I64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"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 | x: FStar.PtrdiffT.t -> y: FStar.PtrdiffT.t -> Prims.Pure Prims.bool | Prims.Pure | [] | [] | [
"FStar.PtrdiffT.t",
"FStar.Int64.gte",
"Prims.bool"
] | [] | false | false | false | false | false | let gte x y =
| I64.gte x y | false |
Steel.ST.SeqMatch.fst | Steel.ST.SeqMatch.seq_list_match_nil0 | val seq_list_match_nil0 (#t: Type) (c: Seq.seq t) : Tot vprop | val seq_list_match_nil0 (#t: Type) (c: Seq.seq t) : Tot vprop | let seq_list_match_nil0
(#t: Type)
(c: Seq.seq t)
: Tot vprop
= pure (c `Seq.equal` Seq.empty) | {
"file_name": "lib/steel/Steel.ST.SeqMatch.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 32,
"end_line": 19,
"start_col": 0,
"start_line": 15
} | module Steel.ST.SeqMatch
include Steel.ST.OnRange
open Steel.ST.GenElim
module Seq = FStar.Seq
module SZ = FStar.SizeT
(* `seq_list_match` describes how to match a sequence of low-level
values (the low-level contents of an array) with a list of high-level
values. `seq_list_match` is carefully designed to be usable wi... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.OnRange.fsti.checked",
"Steel.ST.GenElim.fsti.checked",
"prims.fst.checked",
"FStar.SizeT.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_fil... | [
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "SZ"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim",
"short_module": null
},
{
"abbrev": false,
"full_module": "Stee... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | c: FStar.Seq.Base.seq t -> Steel.Effect.Common.vprop | Prims.Tot | [
"total"
] | [] | [
"FStar.Seq.Base.seq",
"Steel.ST.Util.pure",
"FStar.Seq.Base.equal",
"FStar.Seq.Base.empty",
"Steel.Effect.Common.vprop"
] | [] | false | false | false | true | false | let seq_list_match_nil0 (#t: Type) (c: Seq.seq t) : Tot vprop =
| pure (c `Seq.equal` Seq.empty) | false |
Steel.ST.SeqMatch.fst | Steel.ST.SeqMatch.seq_seq_match | val seq_seq_match
(#t1 #t2: Type)
(p: (t1 -> t2 -> vprop))
(c: Seq.seq t1)
(l: Seq.seq t2)
(i j: nat)
: Tot vprop | val seq_seq_match
(#t1 #t2: Type)
(p: (t1 -> t2 -> vprop))
(c: Seq.seq t1)
(l: Seq.seq t2)
(i j: nat)
: Tot vprop | let seq_seq_match
(#t1 #t2: Type)
(p: t1 -> t2 -> vprop)
(c: Seq.seq t1)
(l: Seq.seq t2)
(i j: nat)
: Tot vprop
= on_range (seq_seq_match_item p c l) i j | {
"file_name": "lib/steel/Steel.ST.SeqMatch.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 41,
"end_line": 226,
"start_col": 0,
"start_line": 219
} | module Steel.ST.SeqMatch
include Steel.ST.OnRange
open Steel.ST.GenElim
module Seq = FStar.Seq
module SZ = FStar.SizeT
(* `seq_list_match` describes how to match a sequence of low-level
values (the low-level contents of an array) with a list of high-level
values. `seq_list_match` is carefully designed to be usable wi... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.OnRange.fsti.checked",
"Steel.ST.GenElim.fsti.checked",
"prims.fst.checked",
"FStar.SizeT.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_fil... | [
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "SZ"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim",
"short_module": null
},
{
"abbrev": false,
"full_module": "Stee... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
p: (_: t1 -> _: t2 -> Steel.Effect.Common.vprop) ->
c: FStar.Seq.Base.seq t1 ->
l: FStar.Seq.Base.seq t2 ->
i: Prims.nat ->
j: Prims.nat
-> Steel.Effect.Common.vprop | Prims.Tot | [
"total"
] | [] | [
"Steel.Effect.Common.vprop",
"FStar.Seq.Base.seq",
"Prims.nat",
"Steel.ST.OnRange.on_range",
"Steel.ST.SeqMatch.seq_seq_match_item"
] | [] | false | false | false | true | false | let seq_seq_match
(#t1 #t2: Type)
(p: (t1 -> t2 -> vprop))
(c: Seq.seq t1)
(l: Seq.seq t2)
(i j: nat)
: Tot vprop =
| on_range (seq_seq_match_item p c l) i j | false |
Steel.ST.SeqMatch.fst | Steel.ST.SeqMatch.seq_list_match_cons0 | val seq_list_match_cons0
(#t #t': Type)
(c: Seq.seq t)
(l: list t' {Cons? l})
(item_match: (t -> v': t'{v' << l} -> vprop))
(seq_list_match:
(
Seq.seq t ->
v': list t' ->
raw_data_item_match: (t -> v'': t'{v'' << v'} -> vprop){v' <<... | val seq_list_match_cons0
(#t #t': Type)
(c: Seq.seq t)
(l: list t' {Cons? l})
(item_match: (t -> v': t'{v' << l} -> vprop))
(seq_list_match:
(
Seq.seq t ->
v': list t' ->
raw_data_item_match: (t -> v'': t'{v'' << v'} -> vprop){v' <<... | let seq_list_match_cons0
(#t #t': Type)
(c: Seq.seq t)
(l: list t' { Cons? l })
(item_match: (t -> (v': t' { v' << l }) -> vprop))
(seq_list_match: (Seq.seq t -> (v': list t') -> (raw_data_item_match: (t -> (v'': t' { v'' << v' }) -> vprop) { v' << l }) ->
vprop))
: Tot vprop
= exists_ (fun (c1: t) -> exists_... | {
"file_name": "lib/steel/Steel.ST.SeqMatch.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 4,
"end_line": 34,
"start_col": 0,
"start_line": 22
} | module Steel.ST.SeqMatch
include Steel.ST.OnRange
open Steel.ST.GenElim
module Seq = FStar.Seq
module SZ = FStar.SizeT
(* `seq_list_match` describes how to match a sequence of low-level
values (the low-level contents of an array) with a list of high-level
values. `seq_list_match` is carefully designed to be usable wi... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.OnRange.fsti.checked",
"Steel.ST.GenElim.fsti.checked",
"prims.fst.checked",
"FStar.SizeT.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_fil... | [
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "SZ"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim",
"short_module": null
},
{
"abbrev": false,
"full_module": "Stee... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
c: FStar.Seq.Base.seq t ->
l: Prims.list t' {Cons? l} ->
item_match: (_: t -> v': t'{v' << l} -> Steel.Effect.Common.vprop) ->
seq_list_match:
(
_: FStar.Seq.Base.seq t ->
v': Prims.list t' ->
raw_data_item_match: (_: t -> v'': t'{v'' << v'} -> Steel.Effect.Com... | Prims.Tot | [
"total"
] | [] | [
"FStar.Seq.Base.seq",
"Prims.list",
"Prims.b2t",
"Prims.uu___is_Cons",
"Prims.precedes",
"Steel.Effect.Common.vprop",
"Steel.ST.Util.exists_",
"Steel.Effect.Common.star",
"FStar.List.Tot.Base.hd",
"FStar.List.Tot.Base.tl",
"Steel.ST.Util.pure",
"FStar.Seq.Base.equal",
"FStar.Seq.Base.cons"
] | [] | false | false | false | false | false | let seq_list_match_cons0
(#t #t': Type)
(c: Seq.seq t)
(l: list t' {Cons? l})
(item_match: (t -> v': t'{v' << l} -> vprop))
(seq_list_match:
(
Seq.seq t ->
v': list t' ->
raw_data_item_match: (t -> v'': t'{v'' << v'} -> vprop){v' <<... | exists_ (fun (c1: t) ->
exists_ (fun (c2: Seq.seq t) ->
((item_match c1 (List.Tot.hd l)) `star` (seq_list_match c2 (List.Tot.tl l) item_match))
`star`
(pure (c `Seq.equal` (Seq.cons c1 c2))))) | false |
Steel.ST.SeqMatch.fst | Steel.ST.SeqMatch.seq_list_match | val seq_list_match
(#t #t': Type)
(c: Seq.seq t)
(v: list t')
(item_match: (t -> v': t'{v' << v} -> vprop))
: Tot vprop (decreases v) | val seq_list_match
(#t #t': Type)
(c: Seq.seq t)
(v: list t')
(item_match: (t -> v': t'{v' << v} -> vprop))
: Tot vprop (decreases v) | let rec seq_list_match
(#t #t': Type)
(c: Seq.seq t)
(v: list t')
(item_match: (t -> (v': t' { v' << v }) -> vprop))
: Tot vprop
(decreases v)
= if Nil? v
then seq_list_match_nil0 c
else seq_list_match_cons0 c v item_match seq_list_match | {
"file_name": "lib/steel/Steel.ST.SeqMatch.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 57,
"end_line": 45,
"start_col": 0,
"start_line": 36
} | module Steel.ST.SeqMatch
include Steel.ST.OnRange
open Steel.ST.GenElim
module Seq = FStar.Seq
module SZ = FStar.SizeT
(* `seq_list_match` describes how to match a sequence of low-level
values (the low-level contents of an array) with a list of high-level
values. `seq_list_match` is carefully designed to be usable wi... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.OnRange.fsti.checked",
"Steel.ST.GenElim.fsti.checked",
"prims.fst.checked",
"FStar.SizeT.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_fil... | [
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "SZ"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim",
"short_module": null
},
{
"abbrev": false,
"full_module": "Stee... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
c: FStar.Seq.Base.seq t ->
v: Prims.list t' ->
item_match: (_: t -> v': t'{v' << v} -> Steel.Effect.Common.vprop)
-> Prims.Tot Steel.Effect.Common.vprop | Prims.Tot | [
"total",
""
] | [] | [
"FStar.Seq.Base.seq",
"Prims.list",
"Prims.precedes",
"Steel.Effect.Common.vprop",
"Prims.uu___is_Nil",
"Steel.ST.SeqMatch.seq_list_match_nil0",
"Prims.bool",
"Steel.ST.SeqMatch.seq_list_match_cons0",
"Steel.ST.SeqMatch.seq_list_match"
] | [
"recursion"
] | false | false | false | false | false | let rec seq_list_match
(#t #t': Type)
(c: Seq.seq t)
(v: list t')
(item_match: (t -> v': t'{v' << v} -> vprop))
: Tot vprop (decreases v) =
| if Nil? v then seq_list_match_nil0 c else seq_list_match_cons0 c v item_match seq_list_match | false |
Steel.ST.SeqMatch.fst | Steel.ST.SeqMatch.seq_list_match_cons_eq | val seq_list_match_cons_eq
(#t #t': Type)
(c: Seq.seq t)
(v: list t')
(item_match: (t -> v': t'{v' << v} -> vprop))
: Lemma (requires (Cons? v))
(ensures (seq_list_match c v item_match == seq_list_match_cons0 c v item_match seq_list_match)
) | val seq_list_match_cons_eq
(#t #t': Type)
(c: Seq.seq t)
(v: list t')
(item_match: (t -> v': t'{v' << v} -> vprop))
: Lemma (requires (Cons? v))
(ensures (seq_list_match c v item_match == seq_list_match_cons0 c v item_match seq_list_match)
) | let seq_list_match_cons_eq
(#t #t': Type)
(c: Seq.seq t)
(v: list t')
(item_match: (t -> (v': t' { v' << v }) -> vprop))
: Lemma
(requires (Cons? v))
(ensures (
seq_list_match c v item_match ==
seq_list_match_cons0 c v item_match seq_list_match
))
= let a :: q = v in
assert_norm (seq_list_match ... | {
"file_name": "lib/steel/Steel.ST.SeqMatch.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 3,
"end_line": 61,
"start_col": 0,
"start_line": 47
} | module Steel.ST.SeqMatch
include Steel.ST.OnRange
open Steel.ST.GenElim
module Seq = FStar.Seq
module SZ = FStar.SizeT
(* `seq_list_match` describes how to match a sequence of low-level
values (the low-level contents of an array) with a list of high-level
values. `seq_list_match` is carefully designed to be usable wi... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.OnRange.fsti.checked",
"Steel.ST.GenElim.fsti.checked",
"prims.fst.checked",
"FStar.SizeT.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_fil... | [
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "SZ"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim",
"short_module": null
},
{
"abbrev": false,
"full_module": "Stee... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
c: FStar.Seq.Base.seq t ->
v: Prims.list t' ->
item_match: (_: t -> v': t'{v' << v} -> Steel.Effect.Common.vprop)
-> FStar.Pervasives.Lemma (requires Cons? v)
(ensures
Steel.ST.SeqMatch.seq_list_match c v item_match ==
Steel.ST.SeqMatch.seq_list_match_cons0 c v item_match Steel.ST.S... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Base.seq",
"Prims.list",
"Prims.precedes",
"Steel.Effect.Common.vprop",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"Steel.ST.SeqMatch.seq_list_match",
"Prims.Cons",
"Steel.ST.SeqMatch.seq_list_match_cons0",
"Prims.unit",
"Prims.b2t",
"Prims.uu___is_Cons",
"Prims.squash",
"Prim... | [] | false | false | true | false | false | let seq_list_match_cons_eq
(#t #t': Type)
(c: Seq.seq t)
(v: list t')
(item_match: (t -> v': t'{v' << v} -> vprop))
: Lemma (requires (Cons? v))
(ensures (seq_list_match c v item_match == seq_list_match_cons0 c v item_match seq_list_match)
) =
| let a :: q = v in
assert_norm (seq_list_match c (a :: q) item_match ==
seq_list_match_cons0 c (a :: q) item_match seq_list_match) | false |
Steel.ST.SeqMatch.fst | Steel.ST.SeqMatch.list_cons_precedes | val list_cons_precedes (#t: Type) (a: t) (q: list t)
: Lemma ((a << a :: q) /\ (q << a :: q)) [SMTPat (a :: q)] | val list_cons_precedes (#t: Type) (a: t) (q: list t)
: Lemma ((a << a :: q) /\ (q << a :: q)) [SMTPat (a :: q)] | let list_cons_precedes
(#t: Type)
(a: t)
(q: list t)
: Lemma
((a << a :: q) /\ (q << a :: q))
[SMTPat (a :: q)]
= assert (List.Tot.hd (a :: q) << (a :: q));
assert (List.Tot.tl (a :: q) << (a :: q)) | {
"file_name": "lib/steel/Steel.ST.SeqMatch.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 43,
"end_line": 88,
"start_col": 0,
"start_line": 80
} | module Steel.ST.SeqMatch
include Steel.ST.OnRange
open Steel.ST.GenElim
module Seq = FStar.Seq
module SZ = FStar.SizeT
(* `seq_list_match` describes how to match a sequence of low-level
values (the low-level contents of an array) with a list of high-level
values. `seq_list_match` is carefully designed to be usable wi... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.OnRange.fsti.checked",
"Steel.ST.GenElim.fsti.checked",
"prims.fst.checked",
"FStar.SizeT.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_fil... | [
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "SZ"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim",
"short_module": null
},
{
"abbrev": false,
"full_module": "Stee... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: t -> q: Prims.list t
-> FStar.Pervasives.Lemma (ensures a << a :: q /\ q << a :: q) [SMTPat (a :: q)] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"Prims._assert",
"Prims.precedes",
"FStar.List.Tot.Base.tl",
"Prims.Cons",
"Prims.unit",
"FStar.List.Tot.Base.hd",
"Prims.l_True",
"Prims.squash",
"Prims.l_and",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"Prims.Nil"
] | [] | true | false | true | false | false | let list_cons_precedes (#t: Type) (a: t) (q: list t)
: Lemma ((a << a :: q) /\ (q << a :: q)) [SMTPat (a :: q)] =
| assert (List.Tot.hd (a :: q) << (a :: q));
assert (List.Tot.tl (a :: q) << (a :: q)) | false |
Steel.ST.SeqMatch.fst | Steel.ST.SeqMatch.seq_seq_match_item | val seq_seq_match_item
(#t1 #t2: Type)
(p: (t1 -> t2 -> vprop))
(c: Seq.seq t1)
(l: Seq.seq t2)
(i: nat)
: Tot vprop | val seq_seq_match_item
(#t1 #t2: Type)
(p: (t1 -> t2 -> vprop))
(c: Seq.seq t1)
(l: Seq.seq t2)
(i: nat)
: Tot vprop | let seq_seq_match_item
(#t1 #t2: Type)
(p: t1 -> t2 -> vprop)
(c: Seq.seq t1)
(l: Seq.seq t2)
(i: nat)
: Tot vprop
= if i < Seq.length c && i < Seq.length l
then
p (Seq.index c i) (Seq.index l i)
else
pure (squash False) | {
"file_name": "lib/steel/Steel.ST.SeqMatch.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 23,
"end_line": 198,
"start_col": 0,
"start_line": 187
} | module Steel.ST.SeqMatch
include Steel.ST.OnRange
open Steel.ST.GenElim
module Seq = FStar.Seq
module SZ = FStar.SizeT
(* `seq_list_match` describes how to match a sequence of low-level
values (the low-level contents of an array) with a list of high-level
values. `seq_list_match` is carefully designed to be usable wi... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.OnRange.fsti.checked",
"Steel.ST.GenElim.fsti.checked",
"prims.fst.checked",
"FStar.SizeT.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_fil... | [
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "SZ"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim",
"short_module": null
},
{
"abbrev": false,
"full_module": "Stee... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
p: (_: t1 -> _: t2 -> Steel.Effect.Common.vprop) ->
c: FStar.Seq.Base.seq t1 ->
l: FStar.Seq.Base.seq t2 ->
i: Prims.nat
-> Steel.Effect.Common.vprop | Prims.Tot | [
"total"
] | [] | [
"Steel.Effect.Common.vprop",
"FStar.Seq.Base.seq",
"Prims.nat",
"Prims.op_AmpAmp",
"Prims.op_LessThan",
"FStar.Seq.Base.length",
"FStar.Seq.Base.index",
"Prims.bool",
"Steel.ST.Util.pure",
"Prims.squash",
"Prims.l_False"
] | [] | false | false | false | true | false | let seq_seq_match_item
(#t1 #t2: Type)
(p: (t1 -> t2 -> vprop))
(c: Seq.seq t1)
(l: Seq.seq t2)
(i: nat)
: Tot vprop =
| if i < Seq.length c && i < Seq.length l
then p (Seq.index c i) (Seq.index l i)
else pure (squash False) | false |
Steel.ST.SeqMatch.fst | Steel.ST.SeqMatch.seq_map | val seq_map (#t1 #t2: Type) (f: (t1 -> t2)) (s: Seq.seq t1) : Tot (Seq.seq t2) | val seq_map (#t1 #t2: Type) (f: (t1 -> t2)) (s: Seq.seq t1) : Tot (Seq.seq t2) | let seq_map (#t1 #t2: Type) (f: t1 -> t2) (s: Seq.seq t1) : Tot (Seq.seq t2) =
Seq.init (Seq.length s) (fun i -> f (Seq.index s i)) | {
"file_name": "lib/steel/Steel.ST.SeqMatch.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 54,
"end_line": 599,
"start_col": 0,
"start_line": 598
} | module Steel.ST.SeqMatch
include Steel.ST.OnRange
open Steel.ST.GenElim
module Seq = FStar.Seq
module SZ = FStar.SizeT
(* `seq_list_match` describes how to match a sequence of low-level
values (the low-level contents of an array) with a list of high-level
values. `seq_list_match` is carefully designed to be usable wi... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.OnRange.fsti.checked",
"Steel.ST.GenElim.fsti.checked",
"prims.fst.checked",
"FStar.SizeT.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_fil... | [
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "SZ"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim",
"short_module": null
},
{
"abbrev": false,
"full_module": "Stee... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f: (_: t1 -> t2) -> s: FStar.Seq.Base.seq t1 -> FStar.Seq.Base.seq t2 | Prims.Tot | [
"total"
] | [] | [
"FStar.Seq.Base.seq",
"FStar.Seq.Base.init",
"FStar.Seq.Base.length",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Seq.Base.index"
] | [] | false | false | false | true | false | let seq_map (#t1 #t2: Type) (f: (t1 -> t2)) (s: Seq.seq t1) : Tot (Seq.seq t2) =
| Seq.init (Seq.length s) (fun i -> f (Seq.index s i)) | false |
FStar.UInt.fst | FStar.UInt.pow2_values | val pow2_values: x:nat -> Lemma
(let p = pow2 x in
match x with
| 0 -> p=1
| 1 -> p=2
| 8 -> p=256
| 16 -> p=65536
| 31 -> p=2147483648
| 32 -> p=4294967296
| 63 -> p=9223372036854775808
| 64 -> p=18446744073709551616
| 128 -> p=0x100000000000000000000000000000000
| _ -> True)
[... | val pow2_values: x:nat -> Lemma
(let p = pow2 x in
match x with
| 0 -> p=1
| 1 -> p=2
| 8 -> p=256
| 16 -> p=65536
| 31 -> p=2147483648
| 32 -> p=4294967296
| 63 -> p=9223372036854775808
| 64 -> p=18446744073709551616
| 128 -> p=0x100000000000000000000000000000000
| _ -> True)
[... | let pow2_values x =
match x with
| 0 -> assert_norm (pow2 0 == 1)
| 1 -> assert_norm (pow2 1 == 2)
| 8 -> assert_norm (pow2 8 == 256)
| 16 -> assert_norm (pow2 16 == 65536)
| 31 -> assert_norm (pow2 31 == 2147483648)
| 32 -> assert_norm (pow2 32 == 4294967296)
| 63 -> assert_norm (pow2 63 == ... | {
"file_name": "ulib/FStar.UInt.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 13,
"end_line": 36,
"start_col": 0,
"start_line": 25
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical.fsti.checked",
"FStar.Ca... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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 | x: Prims.nat
-> FStar.Pervasives.Lemma
(ensures
(let p = Prims.pow2 x in
(match x with
| 0 -> p = 1
| 1 -> p = 2
| 8 -> p = 256
| 16 -> p = 65536
| 31 -> p = 2147483648
| 32 -> p = 4294967296
| 63 -> p = 922337... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"Prims.int",
"Prims.pow2",
"Prims.b2t",
"Prims.op_Equality",
"Prims.unit"
] | [] | false | false | true | false | false | let pow2_values x =
| match x with
| 0 -> assert_norm (pow2 0 == 1)
| 1 -> assert_norm (pow2 1 == 2)
| 8 -> assert_norm (pow2 8 == 256)
| 16 -> assert_norm (pow2 16 == 65536)
| 31 -> assert_norm (pow2 31 == 2147483648)
| 32 -> assert_norm (pow2 32 == 4294967296)
| 63 -> assert_norm (pow2 63 == 9223372036854775808)
| 64 -> assert_norm (pow2 ... | false |
FStar.UInt.fst | FStar.UInt.incr_underspec | val incr_underspec: #n:nat -> a:uint_t n -> Pure (uint_t n)
(requires (b2t (a < max_int n)))
(ensures (fun b -> a + 1 = b)) | val incr_underspec: #n:nat -> a:uint_t n -> Pure (uint_t n)
(requires (b2t (a < max_int n)))
(ensures (fun b -> a + 1 = b)) | let incr_underspec #n a =
if a < max_int n then a + 1 else 0 | {
"file_name": "ulib/FStar.UInt.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 36,
"end_line": 39,
"start_col": 0,
"start_line": 38
} | (*
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.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical.fsti.checked",
"FStar.Ca... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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: FStar.UInt.uint_t n -> Prims.Pure (FStar.UInt.uint_t n) | Prims.Pure | [] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"Prims.op_LessThan",
"FStar.UInt.max_int",
"Prims.op_Addition",
"Prims.bool"
] | [] | false | false | false | false | false | let incr_underspec #n a =
| if a < max_int n then a + 1 else 0 | false |
FStar.UInt.fst | FStar.UInt.add_underspec | val add_underspec: #n:nat -> a:uint_t n -> b:uint_t n -> Pure (uint_t n)
(requires True)
(ensures (fun c ->
size (a + b) n ==> a + b = c)) | val add_underspec: #n:nat -> a:uint_t n -> b:uint_t n -> Pure (uint_t n)
(requires True)
(ensures (fun c ->
size (a + b) n ==> a + b = c)) | let add_underspec #n a b =
if fits (a+b) n then a + b else 0 | {
"file_name": "ulib/FStar.UInt.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 35,
"end_line": 45,
"start_col": 0,
"start_line": 44
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical.fsti.checked",
"FStar.Ca... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n -> Prims.Pure (FStar.UInt.uint_t n) | Prims.Pure | [] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"FStar.UInt.fits",
"Prims.op_Addition",
"Prims.bool"
] | [] | false | false | false | false | false | let add_underspec #n a b =
| if fits (a + b) n then a + b else 0 | false |
FStar.UInt.fst | FStar.UInt.decr_underspec | val decr_underspec: #n:nat -> a:uint_t n -> Pure (uint_t n)
(requires (b2t (a > min_int n)))
(ensures (fun b -> a - 1 = b)) | val decr_underspec: #n:nat -> a:uint_t n -> Pure (uint_t n)
(requires (b2t (a > min_int n)))
(ensures (fun b -> a - 1 = b)) | let decr_underspec #n a =
if a > min_int n then a - 1 else 0 | {
"file_name": "ulib/FStar.UInt.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 36,
"end_line": 42,
"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.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical.fsti.checked",
"FStar.Ca... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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: FStar.UInt.uint_t n -> Prims.Pure (FStar.UInt.uint_t n) | Prims.Pure | [] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"Prims.op_GreaterThan",
"FStar.UInt.min_int",
"Prims.op_Subtraction",
"Prims.bool"
] | [] | false | false | false | false | false | let decr_underspec #n a =
| if a > min_int n then a - 1 else 0 | false |
Steel.ST.SeqMatch.fst | Steel.ST.SeqMatch.item_match_option | val item_match_option (#t1 #t2: Type) (p: (t1 -> t2 -> vprop)) (x1: t1) (x2: option t2) : Tot vprop | val item_match_option (#t1 #t2: Type) (p: (t1 -> t2 -> vprop)) (x1: t1) (x2: option t2) : Tot vprop | let item_match_option
(#t1 #t2: Type)
(p: t1 -> t2 -> vprop)
(x1: t1)
(x2: option t2)
: Tot vprop
= match x2 with
| None -> emp
| Some x2' -> p x1 x2' | {
"file_name": "lib/steel/Steel.ST.SeqMatch.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 24,
"end_line": 609,
"start_col": 0,
"start_line": 601
} | module Steel.ST.SeqMatch
include Steel.ST.OnRange
open Steel.ST.GenElim
module Seq = FStar.Seq
module SZ = FStar.SizeT
(* `seq_list_match` describes how to match a sequence of low-level
values (the low-level contents of an array) with a list of high-level
values. `seq_list_match` is carefully designed to be usable wi... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.OnRange.fsti.checked",
"Steel.ST.GenElim.fsti.checked",
"prims.fst.checked",
"FStar.SizeT.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_fil... | [
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "SZ"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim",
"short_module": null
},
{
"abbrev": false,
"full_module": "Stee... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: (_: t1 -> _: t2 -> Steel.Effect.Common.vprop) -> x1: t1 -> x2: FStar.Pervasives.Native.option t2
-> Steel.Effect.Common.vprop | Prims.Tot | [
"total"
] | [] | [
"Steel.Effect.Common.vprop",
"FStar.Pervasives.Native.option",
"Steel.Effect.Common.emp"
] | [] | false | false | false | true | false | let item_match_option (#t1 #t2: Type) (p: (t1 -> t2 -> vprop)) (x1: t1) (x2: option t2) : Tot vprop =
| match x2 with
| None -> emp
| Some x2' -> p x1 x2' | false |
FStar.UInt.fst | FStar.UInt.sub_underspec | val sub_underspec: #n:nat -> a:uint_t n -> b:uint_t n -> Pure (uint_t n)
(requires True)
(ensures (fun c ->
size (a - b) n ==> a - b = c)) | val sub_underspec: #n:nat -> a:uint_t n -> b:uint_t n -> Pure (uint_t n)
(requires True)
(ensures (fun c ->
size (a - b) n ==> a - b = c)) | let sub_underspec #n a b =
if fits (a-b) n then a - b else 0 | {
"file_name": "ulib/FStar.UInt.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 35,
"end_line": 48,
"start_col": 0,
"start_line": 47
} | (*
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.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical.fsti.checked",
"FStar.Ca... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n -> Prims.Pure (FStar.UInt.uint_t n) | Prims.Pure | [] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"FStar.UInt.fits",
"Prims.op_Subtraction",
"Prims.bool"
] | [] | false | false | false | false | false | let sub_underspec #n a b =
| if fits (a - b) n then a - b else 0 | false |
FStar.UInt.fst | FStar.UInt.mul_underspec | val mul_underspec: #n:nat -> a:uint_t n -> b:uint_t n -> Pure (uint_t n)
(requires True)
(ensures (fun c ->
size (a * b) n ==> a * b = c)) | val mul_underspec: #n:nat -> a:uint_t n -> b:uint_t n -> Pure (uint_t n)
(requires True)
(ensures (fun c ->
size (a * b) n ==> a * b = c)) | let mul_underspec #n a b =
if fits (a*b) n then a * b else 0 | {
"file_name": "ulib/FStar.UInt.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 35,
"end_line": 51,
"start_col": 0,
"start_line": 50
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical.fsti.checked",
"FStar.Ca... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n -> Prims.Pure (FStar.UInt.uint_t n) | Prims.Pure | [] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"FStar.UInt.fits",
"FStar.Mul.op_Star",
"Prims.bool"
] | [] | false | false | false | false | false | let mul_underspec #n a b =
| if fits (a * b) n then a * b else 0 | false |
FStar.UInt.fst | FStar.UInt.div_size | val div_size: #n:pos -> a:uint_t n -> b:uint_t n{b <> 0} ->
Lemma (requires (size a n)) (ensures (size (a / b) n)) | val div_size: #n:pos -> a:uint_t n -> b:uint_t n{b <> 0} ->
Lemma (requires (size a n)) (ensures (size (a / b) n)) | let div_size #n a b =
FStar.Math.Lib.slash_decr_axiom a b; () | {
"file_name": "ulib/FStar.UInt.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 41,
"end_line": 61,
"start_col": 0,
"start_line": 60
} | (*
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.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical.fsti.checked",
"FStar.Ca... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n {b <> 0}
-> FStar.Pervasives.Lemma (requires FStar.UInt.size a n) (ensures FStar.UInt.size (a / b) n) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"Prims.b2t",
"Prims.op_disEquality",
"Prims.int",
"Prims.unit",
"FStar.Math.Lib.slash_decr_axiom"
] | [] | true | false | true | false | false | let div_size #n a b =
| FStar.Math.Lib.slash_decr_axiom a b;
() | false |
FStar.UInt.fst | FStar.UInt.div_underspec | val div_underspec: #n:nat -> a:uint_t n -> b:uint_t n{b <> 0} -> Pure (uint_t n)
(requires True)
(ensures (fun c ->
(b <> 0 /\ size (a / b) n) ==> a / b = c)) | val div_underspec: #n:nat -> a:uint_t n -> b:uint_t n{b <> 0} -> Pure (uint_t n)
(requires True)
(ensures (fun c ->
(b <> 0 /\ size (a / b) n) ==> a / b = c)) | let div_underspec #n a b =
if fits (a / b) n then a / b else 0 | {
"file_name": "ulib/FStar.UInt.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 37,
"end_line": 57,
"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.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical.fsti.checked",
"FStar.Ca... | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module":... | {
"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: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n {b <> 0} -> Prims.Pure (FStar.UInt.uint_t n) | Prims.Pure | [] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"Prims.b2t",
"Prims.op_disEquality",
"Prims.int",
"FStar.UInt.fits",
"Prims.op_Division",
"Prims.bool"
] | [] | false | false | false | false | false | let div_underspec #n a b =
| if fits (a / b) n then a / b else 0 | false |
FStar.UInt.fst | FStar.UInt.to_vec_lemma_2 | val to_vec_lemma_2: #n:nat -> a:uint_t n -> b:uint_t n ->
Lemma (requires equal (to_vec a) (to_vec b)) (ensures a = b) | val to_vec_lemma_2: #n:nat -> a:uint_t n -> b:uint_t n ->
Lemma (requires equal (to_vec a) (to_vec b)) (ensures a = b) | let rec to_vec_lemma_2 #n a b =
if n = 0 then () else begin
assert(equal (slice (to_vec b) 0 (n - 1)) (to_vec #(n - 1) (b / 2)));
assert(equal (slice (to_vec a) 0 (n - 1)) (to_vec #(n - 1) (a / 2)));
to_vec_lemma_2 #(n - 1) (a / 2) (b / 2);
assert(a % 2 = (if index (to_vec a) (n - 1) then 1 else 0));
... | {
"file_name": "ulib/FStar.UInt.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 75,
"start_col": 0,
"start_line": 67
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical.fsti.checked",
"FStar.Ca... | [
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"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: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n
-> FStar.Pervasives.Lemma
(requires FStar.Seq.Base.equal (FStar.UInt.to_vec a) (FStar.UInt.to_vec b)) (ensures a = b) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"Prims.op_Equality",
"Prims.int",
"Prims.bool",
"Prims._assert",
"Prims.b2t",
"Prims.op_Modulus",
"Prims.unit",
"FStar.Seq.Base.index",
"FStar.UInt.to_vec",
"Prims.op_Subtraction",
"FStar.UInt.to_vec_lemma_2",
"Prims.op_Division",
"FStar.Seq.Base.equal",... | [
"recursion"
] | false | false | true | false | false | let rec to_vec_lemma_2 #n a b =
| if n = 0
then ()
else
(assert (equal (slice (to_vec b) 0 (n - 1)) (to_vec #(n - 1) (b / 2)));
assert (equal (slice (to_vec a) 0 (n - 1)) (to_vec #(n - 1) (a / 2)));
to_vec_lemma_2 #(n - 1) (a / 2) (b / 2);
assert (a % 2 = (if index (to_vec a) (n - 1) then 1 else 0));
assert (b % 2 = (if index (to_vec ... | false |
FStar.UInt.fst | FStar.UInt.inverse_num_lemma | val inverse_num_lemma: #n:nat -> num:uint_t n ->
Lemma (requires True) (ensures num = from_vec (to_vec num))
[SMTPat (from_vec (to_vec num))] | val inverse_num_lemma: #n:nat -> num:uint_t n ->
Lemma (requires True) (ensures num = from_vec (to_vec num))
[SMTPat (from_vec (to_vec num))] | let inverse_num_lemma #n num = to_vec_lemma_2 #n num (from_vec (to_vec num)) | {
"file_name": "ulib/FStar.UInt.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 76,
"end_line": 84,
"start_col": 0,
"start_line": 84
} | (*
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.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical.fsti.checked",
"FStar.Ca... | [
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"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 | num: FStar.UInt.uint_t n
-> FStar.Pervasives.Lemma (ensures num = FStar.UInt.from_vec (FStar.UInt.to_vec num))
[SMTPat (FStar.UInt.from_vec (FStar.UInt.to_vec num))] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"FStar.UInt.to_vec_lemma_2",
"FStar.UInt.from_vec",
"FStar.UInt.to_vec",
"Prims.unit"
] | [] | true | false | true | false | false | let inverse_num_lemma #n num =
| to_vec_lemma_2 #n num (from_vec (to_vec num)) | false |
FStar.UInt.fst | FStar.UInt.from_vec_lemma_2 | val from_vec_lemma_2: #n:nat -> a:bv_t n -> b:bv_t n ->
Lemma (requires from_vec a = from_vec b) (ensures equal a b) | val from_vec_lemma_2: #n:nat -> a:bv_t n -> b:bv_t n ->
Lemma (requires from_vec a = from_vec b) (ensures equal a b) | let from_vec_lemma_2 #n a b = inverse_vec_lemma a; inverse_vec_lemma b | {
"file_name": "ulib/FStar.UInt.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 70,
"end_line": 88,
"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.Seq.Base.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical.fsti.checked",
"FStar.Ca... | [
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"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: FStar.BitVector.bv_t n -> b: FStar.BitVector.bv_t n
-> FStar.Pervasives.Lemma (requires FStar.UInt.from_vec a = FStar.UInt.from_vec b)
(ensures FStar.Seq.Base.equal a b) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"FStar.BitVector.bv_t",
"FStar.UInt.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let from_vec_lemma_2 #n a b =
| inverse_vec_lemma a;
inverse_vec_lemma b | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.