effect stringclasses 48
values | original_source_type stringlengths 0 23k | opens_and_abbrevs listlengths 2 92 | isa_cross_project_example bool 1
class | source_definition stringlengths 9 57.9k | partial_definition stringlengths 7 23.3k | is_div bool 2
classes | is_type null | is_proof bool 2
classes | completed_definiton stringlengths 1 250k | dependencies dict | effect_flags listlengths 0 2 | ideal_premises listlengths 0 236 | mutual_with listlengths 0 11 | file_context stringlengths 0 407k | interleaved bool 1
class | is_simply_typed bool 2
classes | file_name stringlengths 5 48 | vconfig dict | is_simple_lemma null | source_type stringlengths 10 23k | proof_features listlengths 0 1 | name stringlengths 8 95 | source dict | verbose_type stringlengths 1 7.42k | source_range dict |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Prims.Tot | val sha3_224:impl | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "LowStar.Modifies",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "... | false | let sha3_224: impl = (| SHA3_224, () |) | val sha3_224:impl
let sha3_224:impl = | false | null | false | (| SHA3_224, () |) | {
"checked_file": "EverCrypt.Hash.fst.checked",
"dependencies": [
"Vale.Wrapper.X64.Sha.fsti.checked",
"Vale.SHA.SHA_helpers.fst.checked",
"Spec.SHA2.Lemmas.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.Blake2.fst.checked",
"prims.fst.checke... | [
"total"
] | [
"Prims.Mkdtuple2",
"Spec.Hash.Definitions.hash_alg",
"Hacl.Hash.Definitions.m_spec",
"Spec.Hash.Definitions.SHA3_224"
] | [] | module EverCrypt.Hash
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module HS = FStar.HyperStack
module ST = FStar.HyperStack.ST
module AC = EverCrypt.AutoConfig2
open LowStar.BufferOps
open FStar.Integers
open C.Fail... | false | true | EverCrypt.Hash.fst | {
"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... | null | val sha3_224:impl | [] | EverCrypt.Hash.sha3_224 | {
"file_name": "providers/evercrypt/fst/EverCrypt.Hash.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | EverCrypt.Hash.impl | {
"end_col": 39,
"end_line": 79,
"start_col": 21,
"start_line": 79
} |
Prims.Tot | val blake2b_256:impl | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "LowStar.Modifies",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "... | false | let blake2b_256: impl = (| Blake2B, Hacl.Impl.Blake2.Core.M256 |) | val blake2b_256:impl
let blake2b_256:impl = | false | null | false | (| Blake2B, Hacl.Impl.Blake2.Core.M256 |) | {
"checked_file": "EverCrypt.Hash.fst.checked",
"dependencies": [
"Vale.Wrapper.X64.Sha.fsti.checked",
"Vale.SHA.SHA_helpers.fst.checked",
"Spec.SHA2.Lemmas.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.Blake2.fst.checked",
"prims.fst.checke... | [
"total"
] | [
"Prims.Mkdtuple2",
"Spec.Hash.Definitions.hash_alg",
"Hacl.Hash.Definitions.m_spec",
"Spec.Hash.Definitions.Blake2B",
"Hacl.Impl.Blake2.Core.M256"
] | [] | module EverCrypt.Hash
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module HS = FStar.HyperStack
module ST = FStar.HyperStack.ST
module AC = EverCrypt.AutoConfig2
open LowStar.BufferOps
open FStar.Integers
open C.Fail... | false | true | EverCrypt.Hash.fst | {
"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... | null | val blake2b_256:impl | [] | EverCrypt.Hash.blake2b_256 | {
"file_name": "providers/evercrypt/fst/EverCrypt.Hash.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | EverCrypt.Hash.impl | {
"end_col": 65,
"end_line": 93,
"start_col": 24,
"start_line": 93
} |
Prims.Tot | val sha3_512:impl | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "LowStar.Modifies",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "... | false | let sha3_512: impl = (| SHA3_512, () |) | val sha3_512:impl
let sha3_512:impl = | false | null | false | (| SHA3_512, () |) | {
"checked_file": "EverCrypt.Hash.fst.checked",
"dependencies": [
"Vale.Wrapper.X64.Sha.fsti.checked",
"Vale.SHA.SHA_helpers.fst.checked",
"Spec.SHA2.Lemmas.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.Blake2.fst.checked",
"prims.fst.checke... | [
"total"
] | [
"Prims.Mkdtuple2",
"Spec.Hash.Definitions.hash_alg",
"Hacl.Hash.Definitions.m_spec",
"Spec.Hash.Definitions.SHA3_512"
] | [] | module EverCrypt.Hash
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module HS = FStar.HyperStack
module ST = FStar.HyperStack.ST
module AC = EverCrypt.AutoConfig2
open LowStar.BufferOps
open FStar.Integers
open C.Fail... | false | true | EverCrypt.Hash.fst | {
"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... | null | val sha3_512:impl | [] | EverCrypt.Hash.sha3_512 | {
"file_name": "providers/evercrypt/fst/EverCrypt.Hash.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | EverCrypt.Hash.impl | {
"end_col": 39,
"end_line": 85,
"start_col": 21,
"start_line": 85
} |
Prims.Tot | val alg_of_impl (i: impl{is_valid_impl i}) : alg | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "LowStar.Modifies",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "... | false | let alg_of_impl (i: impl { is_valid_impl i }): alg = dfst i | val alg_of_impl (i: impl{is_valid_impl i}) : alg
let alg_of_impl (i: impl{is_valid_impl i}) : alg = | false | null | false | dfst i | {
"checked_file": "EverCrypt.Hash.fst.checked",
"dependencies": [
"Vale.Wrapper.X64.Sha.fsti.checked",
"Vale.SHA.SHA_helpers.fst.checked",
"Spec.SHA2.Lemmas.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.Blake2.fst.checked",
"prims.fst.checke... | [
"total"
] | [
"EverCrypt.Hash.impl",
"Prims.b2t",
"EverCrypt.Hash.is_valid_impl",
"FStar.Pervasives.dfst",
"Spec.Hash.Definitions.hash_alg",
"Hacl.Hash.Definitions.m_spec",
"EverCrypt.Hash.alg"
] | [] | module EverCrypt.Hash
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module HS = FStar.HyperStack
module ST = FStar.HyperStack.ST
module AC = EverCrypt.AutoConfig2
open LowStar.BufferOps
open FStar.Integers
open C.Fail... | false | false | EverCrypt.Hash.fst | {
"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... | null | val alg_of_impl (i: impl{is_valid_impl i}) : alg | [] | EverCrypt.Hash.alg_of_impl | {
"file_name": "providers/evercrypt/fst/EverCrypt.Hash.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | i: EverCrypt.Hash.impl{EverCrypt.Hash.is_valid_impl i} -> EverCrypt.Hash.alg | {
"end_col": 59,
"end_line": 96,
"start_col": 53,
"start_line": 96
} |
Prims.Tot | val blake2s_32:impl | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "LowStar.Modifies",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "... | false | let blake2s_32: impl = (| Blake2S, Hacl.Impl.Blake2.Core.M32 |) | val blake2s_32:impl
let blake2s_32:impl = | false | null | false | (| Blake2S, Hacl.Impl.Blake2.Core.M32 |) | {
"checked_file": "EverCrypt.Hash.fst.checked",
"dependencies": [
"Vale.Wrapper.X64.Sha.fsti.checked",
"Vale.SHA.SHA_helpers.fst.checked",
"Spec.SHA2.Lemmas.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.Blake2.fst.checked",
"prims.fst.checke... | [
"total"
] | [
"Prims.Mkdtuple2",
"Spec.Hash.Definitions.hash_alg",
"Hacl.Hash.Definitions.m_spec",
"Spec.Hash.Definitions.Blake2S",
"Hacl.Impl.Blake2.Core.M32"
] | [] | module EverCrypt.Hash
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module HS = FStar.HyperStack
module ST = FStar.HyperStack.ST
module AC = EverCrypt.AutoConfig2
open LowStar.BufferOps
open FStar.Integers
open C.Fail... | false | true | EverCrypt.Hash.fst | {
"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... | null | val blake2s_32:impl | [] | EverCrypt.Hash.blake2s_32 | {
"file_name": "providers/evercrypt/fst/EverCrypt.Hash.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | EverCrypt.Hash.impl | {
"end_col": 63,
"end_line": 87,
"start_col": 23,
"start_line": 87
} |
FStar.HyperStack.ST.ST | val create: a:alg -> ST (state a)
(requires fun h0 -> True)
(ensures fun h0 s h1 ->
invariant s h1 /\
M.(modifies loc_none h0 h1) /\
B.fresh_loc (footprint s h1) h0 h1 /\
freeable h1 s) | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "LowStar.Modifies",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "... | false | let create a =
create_in a HS.root | val create: a:alg -> ST (state a)
(requires fun h0 -> True)
(ensures fun h0 s h1 ->
invariant s h1 /\
M.(modifies loc_none h0 h1) /\
B.fresh_loc (footprint s h1) h0 h1 /\
freeable h1 s)
let create a = | true | null | false | create_in a HS.root | {
"checked_file": "EverCrypt.Hash.fst.checked",
"dependencies": [
"Vale.Wrapper.X64.Sha.fsti.checked",
"Vale.SHA.SHA_helpers.fst.checked",
"Spec.SHA2.Lemmas.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.Blake2.fst.checked",
"prims.fst.checke... | [] | [
"EverCrypt.Hash.alg",
"EverCrypt.Hash.create_in",
"FStar.Monotonic.HyperHeap.root",
"EverCrypt.Hash.state"
] | [] | module EverCrypt.Hash
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module HS = FStar.HyperStack
module ST = FStar.HyperStack.ST
module AC = EverCrypt.AutoConfig2
open LowStar.BufferOps
open FStar.Integers
open C.Fail... | false | false | EverCrypt.Hash.fst | {
"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... | null | val create: a:alg -> ST (state a)
(requires fun h0 -> True)
(ensures fun h0 s h1 ->
invariant s h1 /\
M.(modifies loc_none h0 h1) /\
B.fresh_loc (footprint s h1) h0 h1 /\
freeable h1 s) | [] | EverCrypt.Hash.create | {
"file_name": "providers/evercrypt/fst/EverCrypt.Hash.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | a: EverCrypt.Hash.alg -> FStar.HyperStack.ST.ST (EverCrypt.Hash.state a) | {
"end_col": 21,
"end_line": 298,
"start_col": 2,
"start_line": 298
} |
Prims.Tot | val impl_of_state (#a: _) (s: state_s a) : i: impl{alg_of_impl i == a} | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "LowStar.Modifies",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "... | false | let impl_of_state #a (s: state_s a): i:impl { alg_of_impl i == a } =
match s with
| MD5_s _ -> md5
| SHA1_s _ -> sha1
| SHA2_224_s _ -> sha2_224
| SHA2_256_s _ -> sha2_256
| SHA2_384_s _ -> sha2_384
| SHA2_512_s _ -> sha2_512
| SHA3_224_s _ -> sha3_224
| SHA3_256_s _ -> sha3_256
| SHA3_384_s _ -> sh... | val impl_of_state (#a: _) (s: state_s a) : i: impl{alg_of_impl i == a}
let impl_of_state #a (s: state_s a) : i: impl{alg_of_impl i == a} = | false | null | false | match s with
| MD5_s _ -> md5
| SHA1_s _ -> sha1
| SHA2_224_s _ -> sha2_224
| SHA2_256_s _ -> sha2_256
| SHA2_384_s _ -> sha2_384
| SHA2_512_s _ -> sha2_512
| SHA3_224_s _ -> sha3_224
| SHA3_256_s _ -> sha3_256
| SHA3_384_s _ -> sha3_384
| SHA3_512_s _ -> sha3_512
| Blake2S_s _ -> blake2s_32
| Blake2S_128_s _ _ -> blak... | {
"checked_file": "EverCrypt.Hash.fst.checked",
"dependencies": [
"Vale.Wrapper.X64.Sha.fsti.checked",
"Vale.SHA.SHA_helpers.fst.checked",
"Spec.SHA2.Lemmas.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.Blake2.fst.checked",
"prims.fst.checke... | [
"total"
] | [
"Spec.Hash.Definitions.fixed_len_alg",
"EverCrypt.Hash.state_s",
"Hacl.Hash.Definitions.state",
"Prims.Mkdtuple2",
"Spec.Hash.Definitions.hash_alg",
"Hacl.Hash.Definitions.m_spec",
"Spec.Hash.Definitions.MD5",
"EverCrypt.Hash.md5",
"Spec.Hash.Definitions.SHA1",
"EverCrypt.Hash.sha1",
"Spec.Hash.... | [] | module EverCrypt.Hash
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module HS = FStar.HyperStack
module ST = FStar.HyperStack.ST
module AC = EverCrypt.AutoConfig2
open LowStar.BufferOps
open FStar.Integers
open C.Fail... | false | false | EverCrypt.Hash.fst | {
"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... | null | val impl_of_state (#a: _) (s: state_s a) : i: impl{alg_of_impl i == a} | [] | EverCrypt.Hash.impl_of_state | {
"file_name": "providers/evercrypt/fst/EverCrypt.Hash.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | s: EverCrypt.Hash.state_s a -> i: EverCrypt.Hash.impl{EverCrypt.Hash.alg_of_impl i == a} | {
"end_col": 36,
"end_line": 151,
"start_col": 2,
"start_line": 137
} |
Prims.Tot | val update_multi_224: Hacl.Hash.Definitions.update_multi_st (|SHA2_224, ()|) | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "LowStar.Modifies",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "... | false | let update_multi_224 s ev blocks n =
assert_norm (words_state SHA2_224 == words_state SHA2_256);
let h0 = ST.get () in
Spec.SHA2.Lemmas.update_multi_224_256 (B.as_seq h0 s) (B.as_seq h0 blocks);
update_multi_256 s ev blocks n | val update_multi_224: Hacl.Hash.Definitions.update_multi_st (|SHA2_224, ()|)
let update_multi_224 s ev blocks n = | false | null | false | assert_norm (words_state SHA2_224 == words_state SHA2_256);
let h0 = ST.get () in
Spec.SHA2.Lemmas.update_multi_224_256 (B.as_seq h0 s) (B.as_seq h0 blocks);
update_multi_256 s ev blocks n | {
"checked_file": "EverCrypt.Hash.fst.checked",
"dependencies": [
"Vale.Wrapper.X64.Sha.fsti.checked",
"Vale.SHA.SHA_helpers.fst.checked",
"Spec.SHA2.Lemmas.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.Blake2.fst.checked",
"prims.fst.checke... | [
"total"
] | [
"Hacl.Hash.Definitions.state",
"Prims.Mkdtuple2",
"Spec.Hash.Definitions.hash_alg",
"Hacl.Hash.Definitions.m_spec",
"Spec.Hash.Definitions.SHA2_224",
"Hacl.Hash.Definitions.extra_state",
"Hacl.Hash.Definitions.get_alg",
"Hacl.Hash.Definitions.blocks_t",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims... | [] | module EverCrypt.Hash
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module HS = FStar.HyperStack
module ST = FStar.HyperStack.ST
module AC = EverCrypt.AutoConfig2
open LowStar.BufferOps
open FStar.Integers
open C.Fail... | false | false | EverCrypt.Hash.fst | {
"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... | null | val update_multi_224: Hacl.Hash.Definitions.update_multi_st (|SHA2_224, ()|) | [] | EverCrypt.Hash.update_multi_224 | {
"file_name": "providers/evercrypt/fst/EverCrypt.Hash.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Hacl.Hash.Definitions.update_multi_st (| Spec.Hash.Definitions.SHA2_224, () |) | {
"end_col": 32,
"end_line": 372,
"start_col": 2,
"start_line": 369
} |
FStar.Pervasives.Lemma | val frame_invariant: #a:alg -> l:M.loc -> s:state a -> h0:HS.mem -> h1:HS.mem -> Lemma
(requires (
invariant s h0 /\
M.loc_disjoint l (footprint s h0) /\
M.modifies l h0 h1))
(ensures (
invariant s h1 /\
repr s h0 == repr s h1)) | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "LowStar.Modifies",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "... | false | let frame_invariant #a l s h0 h1 =
let state = B.deref h0 s in
assert (repr_eq (repr s h0) (repr s h1)) | val frame_invariant: #a:alg -> l:M.loc -> s:state a -> h0:HS.mem -> h1:HS.mem -> Lemma
(requires (
invariant s h0 /\
M.loc_disjoint l (footprint s h0) /\
M.modifies l h0 h1))
(ensures (
invariant s h1 /\
repr s h0 == repr s h1))
let frame_invariant #a l s h0 h1 = | false | null | true | let state = B.deref h0 s in
assert (repr_eq (repr s h0) (repr s h1)) | {
"checked_file": "EverCrypt.Hash.fst.checked",
"dependencies": [
"Vale.Wrapper.X64.Sha.fsti.checked",
"Vale.SHA.SHA_helpers.fst.checked",
"Spec.SHA2.Lemmas.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.Blake2.fst.checked",
"prims.fst.checke... | [
"lemma"
] | [
"EverCrypt.Hash.alg",
"LowStar.Monotonic.Buffer.loc",
"EverCrypt.Hash.state",
"FStar.Monotonic.HyperStack.mem",
"Prims._assert",
"EverCrypt.Hash.repr_eq",
"EverCrypt.Hash.repr",
"EverCrypt.Hash.state_s",
"LowStar.Monotonic.Buffer.deref",
"LowStar.Buffer.trivial_preorder",
"Prims.unit"
] | [] | module EverCrypt.Hash
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module HS = FStar.HyperStack
module ST = FStar.HyperStack.ST
module AC = EverCrypt.AutoConfig2
open LowStar.BufferOps
open FStar.Integers
open C.Fail... | false | false | EverCrypt.Hash.fst | {
"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... | null | val frame_invariant: #a:alg -> l:M.loc -> s:state a -> h0:HS.mem -> h1:HS.mem -> Lemma
(requires (
invariant s h0 /\
M.loc_disjoint l (footprint s h0) /\
M.modifies l h0 h1))
(ensures (
invariant s h1 /\
repr s h0 == repr s h1)) | [] | EverCrypt.Hash.frame_invariant | {
"file_name": "providers/evercrypt/fst/EverCrypt.Hash.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
l: LowStar.Monotonic.Buffer.loc ->
s: EverCrypt.Hash.state a ->
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem
-> FStar.Pervasives.Lemma
(requires
EverCrypt.Hash.invariant s h0 /\
LowStar.Monotonic.Buffer.loc_disjoint l (EverCrypt.Hash.footprint s h0) /... | {
"end_col": 42,
"end_line": 217,
"start_col": 34,
"start_line": 215
} |
Prims.Tot | val alg_of_state: a:e_alg -> (
let a = G.reveal a in
s: state a -> Stack alg
(fun h0 -> invariant s h0)
(fun h0 a' h1 -> h0 == h1 /\ a' == a)) | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "LowStar.Modifies",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "... | false | let alg_of_state a s =
let open LowStar.BufferOps in
match !*s with
| MD5_s _ -> MD5
| SHA1_s _ -> SHA1
| SHA2_224_s _ -> SHA2_224
| SHA2_256_s _ -> SHA2_256
| SHA2_384_s _ -> SHA2_384
| SHA2_512_s _ -> SHA2_512
| SHA3_224_s _ -> SHA3_224
| SHA3_256_s _ -> SHA3_256
| SHA3_384_s _ -> SHA3_384
| S... | val alg_of_state: a:e_alg -> (
let a = G.reveal a in
s: state a -> Stack alg
(fun h0 -> invariant s h0)
(fun h0 a' h1 -> h0 == h1 /\ a' == a))
let alg_of_state a s = | false | null | false | let open LowStar.BufferOps in
match !*s with
| MD5_s _ -> MD5
| SHA1_s _ -> SHA1
| SHA2_224_s _ -> SHA2_224
| SHA2_256_s _ -> SHA2_256
| SHA2_384_s _ -> SHA2_384
| SHA2_512_s _ -> SHA2_512
| SHA3_224_s _ -> SHA3_224
| SHA3_256_s _ -> SHA3_256
| SHA3_384_s _ -> SHA3_384
| SHA3_512_s _ -> SHA3_512
| Blake2S_s _ -> Blake2... | {
"checked_file": "EverCrypt.Hash.fst.checked",
"dependencies": [
"Vale.Wrapper.X64.Sha.fsti.checked",
"Vale.SHA.SHA_helpers.fst.checked",
"Spec.SHA2.Lemmas.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.Blake2.fst.checked",
"prims.fst.checke... | [
"total"
] | [
"EverCrypt.Hash.e_alg",
"EverCrypt.Hash.state",
"FStar.Ghost.reveal",
"EverCrypt.Hash.alg",
"Hacl.Hash.Definitions.state",
"Prims.Mkdtuple2",
"Spec.Hash.Definitions.hash_alg",
"Hacl.Hash.Definitions.m_spec",
"Spec.Hash.Definitions.MD5",
"Spec.Hash.Definitions.SHA1",
"Spec.Hash.Definitions.SHA2_2... | [] | module EverCrypt.Hash
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module HS = FStar.HyperStack
module ST = FStar.HyperStack.ST
module AC = EverCrypt.AutoConfig2
open LowStar.BufferOps
open FStar.Integers
open C.Fail... | false | false | EverCrypt.Hash.fst | {
"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... | null | val alg_of_state: a:e_alg -> (
let a = G.reveal a in
s: state a -> Stack alg
(fun h0 -> invariant s h0)
(fun h0 a' h1 -> h0 == h1 /\ a' == a)) | [] | EverCrypt.Hash.alg_of_state | {
"file_name": "providers/evercrypt/fst/EverCrypt.Hash.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | a: EverCrypt.Hash.e_alg
-> (let a = FStar.Ghost.reveal a in
s: EverCrypt.Hash.state a -> FStar.HyperStack.ST.Stack EverCrypt.Hash.alg) | {
"end_col": 32,
"end_line": 206,
"start_col": 2,
"start_line": 191
} |
Prims.Tot | val p (#a: _) (s: state_s a) : Hacl.Hash.Definitions.state (impl_of_state s) | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "LowStar.Modifies",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "... | false | let p #a (s: state_s a): Hacl.Hash.Definitions.state (impl_of_state s) =
match s with
| MD5_s p -> p
| SHA1_s p -> p
| SHA2_224_s p -> p
| SHA2_256_s p -> p
| SHA2_384_s p -> p
| SHA2_512_s p -> p
| SHA3_224_s p -> p
| SHA3_256_s p -> p
| SHA3_384_s p -> p
| SHA3_512_s p -> p
| Blake2S_s p -> p
... | val p (#a: _) (s: state_s a) : Hacl.Hash.Definitions.state (impl_of_state s)
let p #a (s: state_s a) : Hacl.Hash.Definitions.state (impl_of_state s) = | false | null | false | match s with
| MD5_s p -> p
| SHA1_s p -> p
| SHA2_224_s p -> p
| SHA2_256_s p -> p
| SHA2_384_s p -> p
| SHA2_512_s p -> p
| SHA3_224_s p -> p
| SHA3_256_s p -> p
| SHA3_384_s p -> p
| SHA3_512_s p -> p
| Blake2S_s p -> p
| Blake2S_128_s _ p -> p
| Blake2B_s p -> p
| Blake2B_256_s _ p -> p | {
"checked_file": "EverCrypt.Hash.fst.checked",
"dependencies": [
"Vale.Wrapper.X64.Sha.fsti.checked",
"Vale.SHA.SHA_helpers.fst.checked",
"Spec.SHA2.Lemmas.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.Blake2.fst.checked",
"prims.fst.checke... | [
"total"
] | [
"Spec.Hash.Definitions.fixed_len_alg",
"EverCrypt.Hash.state_s",
"Hacl.Hash.Definitions.state",
"Prims.Mkdtuple2",
"Spec.Hash.Definitions.hash_alg",
"Hacl.Hash.Definitions.m_spec",
"Spec.Hash.Definitions.MD5",
"Spec.Hash.Definitions.SHA1",
"Spec.Hash.Definitions.SHA2_224",
"Spec.Hash.Definitions.S... | [] | module EverCrypt.Hash
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module HS = FStar.HyperStack
module ST = FStar.HyperStack.ST
module AC = EverCrypt.AutoConfig2
open LowStar.BufferOps
open FStar.Integers
open C.Fail... | false | false | EverCrypt.Hash.fst | {
"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... | null | val p (#a: _) (s: state_s a) : Hacl.Hash.Definitions.state (impl_of_state s) | [] | EverCrypt.Hash.p | {
"file_name": "providers/evercrypt/fst/EverCrypt.Hash.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | s: EverCrypt.Hash.state_s a -> Hacl.Hash.Definitions.state (EverCrypt.Hash.impl_of_state s) | {
"end_col": 26,
"end_line": 176,
"start_col": 2,
"start_line": 162
} |
FStar.Pervasives.Lemma | val modulo_sub_lemma (a : int) (b : nat) (c : pos) :
Lemma
(requires (b < c /\ (a - b) % c = 0))
(ensures (b = a % c)) | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "LowStar.Modifies",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "... | false | let modulo_sub_lemma a b c =
calc(==) {
(a - b) % c;
(==) { Math.Lemmas.lemma_mod_add_distr (-b) a c }
((a % c) - b) % c;
};
assert(- c < (a % c) - b);
assert((a % c) - b < c);
Math.Lemmas.euclidean_division_definition ((a % c) - b) c;
assert(a % c - b = ((a % c - b) / c) * c);
assert(1 * c = c)... | val modulo_sub_lemma (a : int) (b : nat) (c : pos) :
Lemma
(requires (b < c /\ (a - b) % c = 0))
(ensures (b = a % c))
let modulo_sub_lemma a b c = | false | null | true | calc ( == ) {
(a - b) % c;
( == ) { Math.Lemmas.lemma_mod_add_distr (- b) a c }
((a % c) - b) % c;
};
assert (- c < (a % c) - b);
assert ((a % c) - b < c);
Math.Lemmas.euclidean_division_definition ((a % c) - b) c;
assert (a % c - b = ((a % c - b) / c) * c);
assert (1 * c = c);
assert ((- 1) * c = - c);
let d = (... | {
"checked_file": "EverCrypt.Hash.fst.checked",
"dependencies": [
"Vale.Wrapper.X64.Sha.fsti.checked",
"Vale.SHA.SHA_helpers.fst.checked",
"Spec.SHA2.Lemmas.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.Blake2.fst.checked",
"prims.fst.checke... | [
"lemma"
] | [
"FStar.Integers.int",
"FStar.Integers.nat",
"FStar.Integers.pos",
"Prims._assert",
"Prims.b2t",
"Prims.op_Equality",
"FStar.Integers.int_t",
"FStar.Integers.Signed",
"FStar.Integers.Winfinite",
"FStar.Integers.op_Percent",
"Prims.unit",
"Prims.int",
"FStar.Integers.op_Subtraction",
"FStar.... | [] | module EverCrypt.Hash
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module HS = FStar.HyperStack
module ST = FStar.HyperStack.ST
module AC = EverCrypt.AutoConfig2
open LowStar.BufferOps
open FStar.Integers
open C.Fail... | false | false | EverCrypt.Hash.fst | {
"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... | null | val modulo_sub_lemma (a : int) (b : nat) (c : pos) :
Lemma
(requires (b < c /\ (a - b) % c = 0))
(ensures (b = a % c)) | [] | EverCrypt.Hash.modulo_sub_lemma | {
"file_name": "providers/evercrypt/fst/EverCrypt.Hash.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | a: FStar.Integers.int -> b: FStar.Integers.nat -> c: FStar.Integers.pos
-> FStar.Pervasives.Lemma (requires b < c /\ (a - b) % c = 0) (ensures b = a % c) | {
"end_col": 19,
"end_line": 492,
"start_col": 2,
"start_line": 464
} |
Prims.Tot | val update_multi_256: Hacl.Hash.Definitions.update_multi_st (|SHA2_256, ()|) | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "LowStar.Modifies",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "... | false | let update_multi_256 s ev blocks n =
if EverCrypt.TargetConfig.hacl_can_compile_vale then begin
let has_shaext = AC.has_shaext () in
let has_sse = AC.has_sse () in
if (has_shaext && has_sse) then begin
let n = Int.Cast.Full.uint32_to_uint64 n in
B.recall k224_256;
IB.recall_contents k224... | val update_multi_256: Hacl.Hash.Definitions.update_multi_st (|SHA2_256, ()|)
let update_multi_256 s ev blocks n = | false | null | false | if EverCrypt.TargetConfig.hacl_can_compile_vale
then
let has_shaext = AC.has_shaext () in
let has_sse = AC.has_sse () in
if (has_shaext && has_sse)
then
let n = Int.Cast.Full.uint32_to_uint64 n in
B.recall k224_256;
IB.recall_contents k224_256 Spec.SHA2.Constants.k224_256;
let h1 = ST.get () in
... | {
"checked_file": "EverCrypt.Hash.fst.checked",
"dependencies": [
"Vale.Wrapper.X64.Sha.fsti.checked",
"Vale.SHA.SHA_helpers.fst.checked",
"Spec.SHA2.Lemmas.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.Blake2.fst.checked",
"prims.fst.checke... | [
"total"
] | [
"Hacl.Hash.Definitions.state",
"Prims.Mkdtuple2",
"Spec.Hash.Definitions.hash_alg",
"Hacl.Hash.Definitions.m_spec",
"Spec.Hash.Definitions.SHA2_256",
"Hacl.Hash.Definitions.extra_state",
"Hacl.Hash.Definitions.get_alg",
"Hacl.Hash.Definitions.blocks_t",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims... | [] | module EverCrypt.Hash
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module HS = FStar.HyperStack
module ST = FStar.HyperStack.ST
module AC = EverCrypt.AutoConfig2
open LowStar.BufferOps
open FStar.Integers
open C.Fail... | false | false | EverCrypt.Hash.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val update_multi_256: Hacl.Hash.Definitions.update_multi_st (|SHA2_256, ()|) | [] | EverCrypt.Hash.update_multi_256 | {
"file_name": "providers/evercrypt/fst/EverCrypt.Hash.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Hacl.Hash.Definitions.update_multi_st (| Spec.Hash.Definitions.SHA2_256, () |) | {
"end_col": 50,
"end_line": 363,
"start_col": 2,
"start_line": 346
} |
Prims.Tot | val free_:
#a:e_alg -> (
let a = Ghost.reveal a in
s:state a -> ST unit
(requires fun h0 ->
freeable h0 s /\
invariant s h0)
(ensures fun h0 _ h1 ->
M.(modifies (footprint s h0) h0 h1))) | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "LowStar.Modifies",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "... | false | let free_ #ea s =
begin match !*s with
| MD5_s p -> B.free p
| SHA1_s p -> B.free p
| SHA2_224_s p -> B.free p
| SHA2_256_s p -> B.free p
| SHA2_384_s p -> B.free p
| SHA2_512_s p -> B.free p
| SHA3_224_s p -> B.free p
| SHA3_256_s p -> B.free p
| SHA3_384_s p -> B.free p
| SHA3_512_s p -> B.free ... | val free_:
#a:e_alg -> (
let a = Ghost.reveal a in
s:state a -> ST unit
(requires fun h0 ->
freeable h0 s /\
invariant s h0)
(ensures fun h0 _ h1 ->
M.(modifies (footprint s h0) h0 h1)))
let free_ #ea s = | false | null | false | (match !*s with
| MD5_s p -> B.free p
| SHA1_s p -> B.free p
| SHA2_224_s p -> B.free p
| SHA2_256_s p -> B.free p
| SHA2_384_s p -> B.free p
| SHA2_512_s p -> B.free p
| SHA3_224_s p -> B.free p
| SHA3_256_s p -> B.free p
| SHA3_384_s p -> B.free p
| SHA3_512_s p -> B.free p
| Blake2S_s p -> B.fr... | {
"checked_file": "EverCrypt.Hash.fst.checked",
"dependencies": [
"Vale.Wrapper.X64.Sha.fsti.checked",
"Vale.SHA.SHA_helpers.fst.checked",
"Spec.SHA2.Lemmas.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.Blake2.fst.checked",
"prims.fst.checke... | [
"total"
] | [
"EverCrypt.Hash.e_alg",
"EverCrypt.Hash.state",
"FStar.Ghost.reveal",
"EverCrypt.Hash.alg",
"LowStar.Monotonic.Buffer.free",
"EverCrypt.Hash.state_s",
"LowStar.Buffer.trivial_preorder",
"Prims.unit",
"Hacl.Hash.Definitions.state",
"Prims.Mkdtuple2",
"Spec.Hash.Definitions.hash_alg",
"Hacl.Hash... | [] | module EverCrypt.Hash
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module HS = FStar.HyperStack
module ST = FStar.HyperStack.ST
module AC = EverCrypt.AutoConfig2
open LowStar.BufferOps
open FStar.Integers
open C.Fail... | false | false | EverCrypt.Hash.fst | {
"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... | null | val free_:
#a:e_alg -> (
let a = Ghost.reveal a in
s:state a -> ST unit
(requires fun h0 ->
freeable h0 s /\
invariant s h0)
(ensures fun h0 _ h1 ->
M.(modifies (footprint s h0) h0 h1))) | [] | EverCrypt.Hash.free_ | {
"file_name": "providers/evercrypt/fst/EverCrypt.Hash.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | let a = FStar.Ghost.reveal a in
s: EverCrypt.Hash.state a -> FStar.HyperStack.ST.ST Prims.unit | {
"end_col": 10,
"end_line": 539,
"start_col": 2,
"start_line": 523
} |
Prims.Tot | val init: #a:e_alg -> (
let a = Ghost.reveal a in
s: state a -> Stack unit
(requires invariant s)
(ensures fun h0 _ h1 ->
invariant s h1 /\
repr s h1 == Spec.Agile.Hash.init a /\
M.(modifies (footprint s h0) h0 h1) /\
footprint s h0 == footprint s h1 /\
preserves_freeable s h0 h1)) | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "LowStar.Modifies",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "... | false | let init #a s =
match !*s with
| MD5_s p -> Hacl.Hash.MD5.legacy_init p
| SHA1_s p -> Hacl.Hash.SHA1.legacy_init p
| SHA2_224_s p -> Hacl.Hash.SHA2.init_224 p
| SHA2_256_s p -> Hacl.Hash.SHA2.init_256 p
| SHA2_384_s p -> Hacl.Hash.SHA2.init_384 p
| SHA2_512_s p -> Hacl.Hash.SHA2.init_512 p
| SHA3_224_s ... | val init: #a:e_alg -> (
let a = Ghost.reveal a in
s: state a -> Stack unit
(requires invariant s)
(ensures fun h0 _ h1 ->
invariant s h1 /\
repr s h1 == Spec.Agile.Hash.init a /\
M.(modifies (footprint s h0) h0 h1) /\
footprint s h0 == footprint s h1 /\
preserves_freeable s h0 h1))
let init ... | false | null | false | match !*s with
| MD5_s p -> Hacl.Hash.MD5.legacy_init p
| SHA1_s p -> Hacl.Hash.SHA1.legacy_init p
| SHA2_224_s p -> Hacl.Hash.SHA2.init_224 p
| SHA2_256_s p -> Hacl.Hash.SHA2.init_256 p
| SHA2_384_s p -> Hacl.Hash.SHA2.init_384 p
| SHA2_512_s p -> Hacl.Hash.SHA2.init_512 p
| SHA3_224_s p -> Hacl.Hash.SHA3.init SHA3_22... | {
"checked_file": "EverCrypt.Hash.fst.checked",
"dependencies": [
"Vale.Wrapper.X64.Sha.fsti.checked",
"Vale.SHA.SHA_helpers.fst.checked",
"Spec.SHA2.Lemmas.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.Blake2.fst.checked",
"prims.fst.checke... | [
"total"
] | [
"EverCrypt.Hash.e_alg",
"EverCrypt.Hash.state",
"FStar.Ghost.reveal",
"EverCrypt.Hash.alg",
"Hacl.Hash.Definitions.state",
"Prims.Mkdtuple2",
"Spec.Hash.Definitions.hash_alg",
"Hacl.Hash.Definitions.m_spec",
"Spec.Hash.Definitions.MD5",
"Hacl.Hash.Core.MD5.legacy_init",
"Prims.unit",
"Spec.Has... | [] | module EverCrypt.Hash
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module HS = FStar.HyperStack
module ST = FStar.HyperStack.ST
module AC = EverCrypt.AutoConfig2
open LowStar.BufferOps
open FStar.Integers
open C.Fail... | false | false | EverCrypt.Hash.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val init: #a:e_alg -> (
let a = Ghost.reveal a in
s: state a -> Stack unit
(requires invariant s)
(ensures fun h0 _ h1 ->
invariant s h1 /\
repr s h1 == Spec.Agile.Hash.init a /\
M.(modifies (footprint s h0) h0 h1) /\
footprint s h0 == footprint s h1 /\
preserves_freeable s h0 h1)) | [] | EverCrypt.Hash.init | {
"file_name": "providers/evercrypt/fst/EverCrypt.Hash.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | let a = FStar.Ghost.reveal a in
s: EverCrypt.Hash.state a -> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 34,
"end_line": 326,
"start_col": 2,
"start_line": 306
} |
FStar.HyperStack.ST.StackInline | val alloca: a:alg -> StackInline (state a)
(requires (fun _ -> True))
(ensures (fun h0 s h1 ->
invariant s h1 /\
M.(modifies loc_none h0 h1) /\
B.fresh_loc (footprint s h1) h0 h1 /\
M.(loc_includes (loc_region_only true (HS.get_tip h1)) (footprint s h1)))) | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "LowStar.Modifies",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "... | false | let alloca a =
let s: state_s a =
match a with
| MD5 -> MD5_s (B.alloca 0ul 4ul)
| SHA1 -> SHA1_s (B.alloca 0ul 5ul)
| SHA2_224 -> SHA2_224_s (B.alloca 0ul 8ul)
| SHA2_256 -> SHA2_256_s (B.alloca 0ul 8ul)
| SHA2_384 -> SHA2_384_s (B.alloca 0UL 8ul)
| SHA2_512 -> SHA2_512_s (B.alloca 0UL 8u... | val alloca: a:alg -> StackInline (state a)
(requires (fun _ -> True))
(ensures (fun h0 s h1 ->
invariant s h1 /\
M.(modifies loc_none h0 h1) /\
B.fresh_loc (footprint s h1) h0 h1 /\
M.(loc_includes (loc_region_only true (HS.get_tip h1)) (footprint s h1))))
let alloca a = | true | null | false | let s:state_s a =
match a with
| MD5 -> MD5_s (B.alloca 0ul 4ul)
| SHA1 -> SHA1_s (B.alloca 0ul 5ul)
| SHA2_224 -> SHA2_224_s (B.alloca 0ul 8ul)
| SHA2_256 -> SHA2_256_s (B.alloca 0ul 8ul)
| SHA2_384 -> SHA2_384_s (B.alloca 0uL 8ul)
| SHA2_512 -> SHA2_512_s (B.alloca 0uL 8ul)
| SHA3_224 -> SHA3_224_s (B... | {
"checked_file": "EverCrypt.Hash.fst.checked",
"dependencies": [
"Vale.Wrapper.X64.Sha.fsti.checked",
"Vale.SHA.SHA_helpers.fst.checked",
"Spec.SHA2.Lemmas.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.Blake2.fst.checked",
"prims.fst.checke... | [] | [
"EverCrypt.Hash.alg",
"LowStar.Buffer.alloca",
"EverCrypt.Hash.state_s",
"FStar.UInt32.__uint_to_t",
"LowStar.Monotonic.Buffer.mbuffer",
"LowStar.Buffer.trivial_preorder",
"Prims.l_and",
"Prims.eq2",
"Prims.nat",
"LowStar.Monotonic.Buffer.length",
"FStar.UInt32.v",
"Prims.b2t",
"Prims.op_Neg... | [] | module EverCrypt.Hash
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module HS = FStar.HyperStack
module ST = FStar.HyperStack.ST
module AC = EverCrypt.AutoConfig2
open LowStar.BufferOps
open FStar.Integers
open C.Fail... | false | false | EverCrypt.Hash.fst | {
"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... | null | val alloca: a:alg -> StackInline (state a)
(requires (fun _ -> True))
(ensures (fun h0 s h1 ->
invariant s h1 /\
M.(modifies loc_none h0 h1) /\
B.fresh_loc (footprint s h1) h0 h1 /\
M.(loc_includes (loc_region_only true (HS.get_tip h1)) (footprint s h1)))) | [] | EverCrypt.Hash.alloca | {
"file_name": "providers/evercrypt/fst/EverCrypt.Hash.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | a: EverCrypt.Hash.alg -> FStar.HyperStack.ST.StackInline (EverCrypt.Hash.state a) | {
"end_col": 16,
"end_line": 257,
"start_col": 14,
"start_line": 221
} |
FStar.HyperStack.ST.ST | val create_in: a:alg -> r:HS.rid -> ST (state a)
(requires (fun _ ->
HyperStack.ST.is_eternal_region r))
(ensures (fun h0 s h1 ->
invariant s h1 /\
M.(modifies loc_none h0 h1) /\
B.fresh_loc (footprint s h1) h0 h1 /\
M.(loc_includes (loc_region_only true r) (footprint s h1)) /\
freeable h1 s... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "LowStar.Modifies",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "... | false | let create_in a r =
let h0 = ST.get () in
let s: state_s a =
match a with
| MD5 -> MD5_s (B.malloc r 0ul 4ul)
| SHA1 -> SHA1_s (B.malloc r 0ul 5ul)
| SHA2_224 -> SHA2_224_s (B.malloc r 0ul 8ul)
| SHA2_256 -> SHA2_256_s (B.malloc r 0ul 8ul)
| SHA2_384 -> SHA2_384_s (B.malloc r 0UL 8ul)
| ... | val create_in: a:alg -> r:HS.rid -> ST (state a)
(requires (fun _ ->
HyperStack.ST.is_eternal_region r))
(ensures (fun h0 s h1 ->
invariant s h1 /\
M.(modifies loc_none h0 h1) /\
B.fresh_loc (footprint s h1) h0 h1 /\
M.(loc_includes (loc_region_only true r) (footprint s h1)) /\
freeable h1 s... | true | null | false | let h0 = ST.get () in
let s:state_s a =
match a with
| MD5 -> MD5_s (B.malloc r 0ul 4ul)
| SHA1 -> SHA1_s (B.malloc r 0ul 5ul)
| SHA2_224 -> SHA2_224_s (B.malloc r 0ul 8ul)
| SHA2_256 -> SHA2_256_s (B.malloc r 0ul 8ul)
| SHA2_384 -> SHA2_384_s (B.malloc r 0uL 8ul)
| SHA2_512 -> SHA2_512_s (B.malloc r 0uL ... | {
"checked_file": "EverCrypt.Hash.fst.checked",
"dependencies": [
"Vale.Wrapper.X64.Sha.fsti.checked",
"Vale.SHA.SHA_helpers.fst.checked",
"Spec.SHA2.Lemmas.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.Blake2.fst.checked",
"prims.fst.checke... | [] | [
"EverCrypt.Hash.alg",
"FStar.Monotonic.HyperHeap.rid",
"LowStar.Buffer.malloc",
"EverCrypt.Hash.state_s",
"FStar.UInt32.__uint_to_t",
"LowStar.Monotonic.Buffer.mbuffer",
"LowStar.Buffer.trivial_preorder",
"Prims.l_and",
"Prims.eq2",
"Prims.nat",
"LowStar.Monotonic.Buffer.length",
"FStar.UInt32... | [] | module EverCrypt.Hash
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module HS = FStar.HyperStack
module ST = FStar.HyperStack.ST
module AC = EverCrypt.AutoConfig2
open LowStar.BufferOps
open FStar.Integers
open C.Fail... | false | false | EverCrypt.Hash.fst | {
"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... | null | val create_in: a:alg -> r:HS.rid -> ST (state a)
(requires (fun _ ->
HyperStack.ST.is_eternal_region r))
(ensures (fun h0 s h1 ->
invariant s h1 /\
M.(modifies loc_none h0 h1) /\
B.fresh_loc (footprint s h1) h0 h1 /\
M.(loc_includes (loc_region_only true r) (footprint s h1)) /\
freeable h1 s... | [] | EverCrypt.Hash.create_in | {
"file_name": "providers/evercrypt/fst/EverCrypt.Hash.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | a: EverCrypt.Hash.alg -> r: FStar.Monotonic.HyperHeap.rid
-> FStar.HyperStack.ST.ST (EverCrypt.Hash.state a) | {
"end_col": 18,
"end_line": 295,
"start_col": 19,
"start_line": 260
} |
Prims.Tot | val update_last:
#a:e_alg -> (
let a = Ghost.reveal a in
s:state a ->
prev_len:uint64_t ->
last:B.buffer Lib.IntTypes.uint8 { B.length last <= block_length a } ->
last_len:uint32_t {
v last_len = B.length last /\
(v prev_len + v last_len) `less_than_max_input_length` a /\
v prev_len % block_leng... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "LowStar.Modifies",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "... | false | let update_last #a s prev_len last last_len =
[@inline_let] let cast = FStar.Int.Cast.Full.uint64_to_uint128 in
match !*s with
| MD5_s p ->
Hacl.Hash.MD5.legacy_update_last p prev_len last last_len
| SHA1_s p ->
Hacl.Hash.SHA1.legacy_update_last p prev_len last last_len
| SHA2_224_s p ->
Hac... | val update_last:
#a:e_alg -> (
let a = Ghost.reveal a in
s:state a ->
prev_len:uint64_t ->
last:B.buffer Lib.IntTypes.uint8 { B.length last <= block_length a } ->
last_len:uint32_t {
v last_len = B.length last /\
(v prev_len + v last_len) `less_than_max_input_length` a /\
v prev_len % block_leng... | false | null | false | [@@ inline_let ]let cast = FStar.Int.Cast.Full.uint64_to_uint128 in
match !*s with
| MD5_s p -> Hacl.Hash.MD5.legacy_update_last p prev_len last last_len
| SHA1_s p -> Hacl.Hash.SHA1.legacy_update_last p prev_len last last_len
| SHA2_224_s p -> Hacl.Hash.SHA2.update_last_224 p prev_len last last_len
| SHA2_256_s p -> H... | {
"checked_file": "EverCrypt.Hash.fst.checked",
"dependencies": [
"Vale.Wrapper.X64.Sha.fsti.checked",
"Vale.SHA.SHA_helpers.fst.checked",
"Spec.SHA2.Lemmas.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.Blake2.fst.checked",
"prims.fst.checke... | [
"total"
] | [
"EverCrypt.Hash.e_alg",
"EverCrypt.Hash.state",
"FStar.Ghost.reveal",
"EverCrypt.Hash.alg",
"EverCrypt.Helpers.uint64_t",
"LowStar.Buffer.buffer",
"Lib.IntTypes.uint8",
"Prims.b2t",
"FStar.Integers.op_Less_Equals",
"FStar.Integers.Signed",
"FStar.Integers.Winfinite",
"LowStar.Monotonic.Buffer.... | [] | module EverCrypt.Hash
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module HS = FStar.HyperStack
module ST = FStar.HyperStack.ST
module AC = EverCrypt.AutoConfig2
open LowStar.BufferOps
open FStar.Integers
open C.Fail... | false | false | EverCrypt.Hash.fst | {
"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... | null | val update_last:
#a:e_alg -> (
let a = Ghost.reveal a in
s:state a ->
prev_len:uint64_t ->
last:B.buffer Lib.IntTypes.uint8 { B.length last <= block_length a } ->
last_len:uint32_t {
v last_len = B.length last /\
(v prev_len + v last_len) `less_than_max_input_length` a /\
v prev_len % block_leng... | [] | EverCrypt.Hash.update_last | {
"file_name": "providers/evercrypt/fst/EverCrypt.Hash.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | let a = FStar.Ghost.reveal a in
s: EverCrypt.Hash.state a ->
prev_len: EverCrypt.Helpers.uint64_t ->
last:
LowStar.Buffer.buffer Lib.IntTypes.uint8
{LowStar.Monotonic.Buffer.length last <= Spec.Hash.Definitions.block_length a} ->
last_len:
EverCrypt.Helpers.uint32_t
{ FStar.... | {
"end_col": 34,
"end_line": 456,
"start_col": 2,
"start_line": 427
} |
Prims.Tot | val finish:
#a:e_alg -> (
let a = Ghost.reveal a in
s:state a ->
dst:B.buffer Lib.IntTypes.uint8 { B.length dst = hash_length a } ->
Stack unit
(requires fun h0 ->
invariant s h0 /\
B.live h0 dst /\
M.(loc_disjoint (footprint s h0) (loc_buffer dst)))
(ensures fun h0 _ h1 ->
invariant s h1 ... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "LowStar.Modifies",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "... | false | let finish #a s dst =
match !*s with
| MD5_s p -> Hacl.Hash.MD5.legacy_finish p dst
| SHA1_s p -> Hacl.Hash.SHA1.legacy_finish p dst
| SHA2_224_s p -> Hacl.Hash.SHA2.finish_224 p dst
| SHA2_256_s p -> Hacl.Hash.SHA2.finish_256 p dst
| SHA2_384_s p -> Hacl.Hash.SHA2.finish_384 p dst
| SHA2_512_s p -> Hacl.... | val finish:
#a:e_alg -> (
let a = Ghost.reveal a in
s:state a ->
dst:B.buffer Lib.IntTypes.uint8 { B.length dst = hash_length a } ->
Stack unit
(requires fun h0 ->
invariant s h0 /\
B.live h0 dst /\
M.(loc_disjoint (footprint s h0) (loc_buffer dst)))
(ensures fun h0 _ h1 ->
invariant s h1 ... | false | null | false | match !*s with
| MD5_s p -> Hacl.Hash.MD5.legacy_finish p dst
| SHA1_s p -> Hacl.Hash.SHA1.legacy_finish p dst
| SHA2_224_s p -> Hacl.Hash.SHA2.finish_224 p dst
| SHA2_256_s p -> Hacl.Hash.SHA2.finish_256 p dst
| SHA2_384_s p -> Hacl.Hash.SHA2.finish_384 p dst
| SHA2_512_s p -> Hacl.Hash.SHA2.finish_512 p dst
| SHA3_22... | {
"checked_file": "EverCrypt.Hash.fst.checked",
"dependencies": [
"Vale.Wrapper.X64.Sha.fsti.checked",
"Vale.SHA.SHA_helpers.fst.checked",
"Spec.SHA2.Lemmas.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.Blake2.fst.checked",
"prims.fst.checke... | [
"total"
] | [
"EverCrypt.Hash.e_alg",
"EverCrypt.Hash.state",
"FStar.Ghost.reveal",
"EverCrypt.Hash.alg",
"LowStar.Buffer.buffer",
"Lib.IntTypes.uint8",
"Prims.b2t",
"Prims.op_Equality",
"Prims.nat",
"LowStar.Monotonic.Buffer.length",
"LowStar.Buffer.trivial_preorder",
"Spec.Hash.Definitions.hash_length",
... | [] | module EverCrypt.Hash
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module HS = FStar.HyperStack
module ST = FStar.HyperStack.ST
module AC = EverCrypt.AutoConfig2
open LowStar.BufferOps
open FStar.Integers
open C.Fail... | false | false | EverCrypt.Hash.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val finish:
#a:e_alg -> (
let a = Ghost.reveal a in
s:state a ->
dst:B.buffer Lib.IntTypes.uint8 { B.length dst = hash_length a } ->
Stack unit
(requires fun h0 ->
invariant s h0 /\
B.live h0 dst /\
M.(loc_disjoint (footprint s h0) (loc_buffer dst)))
(ensures fun h0 _ h1 ->
invariant s h1 ... | [] | EverCrypt.Hash.finish | {
"file_name": "providers/evercrypt/fst/EverCrypt.Hash.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | let a = FStar.Ghost.reveal a in
s: EverCrypt.Hash.state a ->
dst:
LowStar.Buffer.buffer Lib.IntTypes.uint8
{LowStar.Monotonic.Buffer.length dst = Spec.Hash.Definitions.hash_length a}
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 34,
"end_line": 518,
"start_col": 2,
"start_line": 497
} |
Prims.Tot | val update_multi:
#a:e_alg -> (
let a = Ghost.reveal a in
s:state a ->
prevlen : uint64_t { UInt64.v prevlen % block_length a = 0 } ->
blocks:B.buffer Lib.IntTypes.uint8 { B.length blocks % block_length a = 0 } ->
len: UInt32.t { v len = B.length blocks } ->
Stack unit
(requires fun h0 ->
invariant ... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "LowStar.Modifies",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "... | false | let update_multi #a s prevlen blocks len =
match !*s with
| MD5_s p ->
let n = len / block_len MD5 in
Hacl.Hash.MD5.legacy_update_multi p () blocks n
| SHA1_s p ->
let n = len / block_len SHA1 in
Hacl.Hash.SHA1.legacy_update_multi p () blocks n
| SHA2_224_s p ->
let n = len / block... | val update_multi:
#a:e_alg -> (
let a = Ghost.reveal a in
s:state a ->
prevlen : uint64_t { UInt64.v prevlen % block_length a = 0 } ->
blocks:B.buffer Lib.IntTypes.uint8 { B.length blocks % block_length a = 0 } ->
len: UInt32.t { v len = B.length blocks } ->
Stack unit
(requires fun h0 ->
invariant ... | false | null | false | match !*s with
| MD5_s p ->
let n = len / block_len MD5 in
Hacl.Hash.MD5.legacy_update_multi p () blocks n
| SHA1_s p ->
let n = len / block_len SHA1 in
Hacl.Hash.SHA1.legacy_update_multi p () blocks n
| SHA2_224_s p ->
let n = len / block_len SHA2_224 in
update_multi_224 p () blocks n
| SHA2_256_s p ->
l... | {
"checked_file": "EverCrypt.Hash.fst.checked",
"dependencies": [
"Vale.Wrapper.X64.Sha.fsti.checked",
"Vale.SHA.SHA_helpers.fst.checked",
"Spec.SHA2.Lemmas.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.Blake2.fst.checked",
"prims.fst.checke... | [
"total"
] | [
"EverCrypt.Hash.e_alg",
"EverCrypt.Hash.state",
"FStar.Ghost.reveal",
"EverCrypt.Hash.alg",
"EverCrypt.Helpers.uint64_t",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"FStar.Integers.op_Percent",
"FStar.Integers.Signed",
"FStar.Integers.Winfinite",
"FStar.UInt64.v",
"Spec.Hash.Definitions.... | [] | module EverCrypt.Hash
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module HS = FStar.HyperStack
module ST = FStar.HyperStack.ST
module AC = EverCrypt.AutoConfig2
open LowStar.BufferOps
open FStar.Integers
open C.Fail... | false | false | EverCrypt.Hash.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val update_multi:
#a:e_alg -> (
let a = Ghost.reveal a in
s:state a ->
prevlen : uint64_t { UInt64.v prevlen % block_length a = 0 } ->
blocks:B.buffer Lib.IntTypes.uint8 { B.length blocks % block_length a = 0 } ->
len: UInt32.t { v len = B.length blocks } ->
Stack unit
(requires fun h0 ->
invariant ... | [] | EverCrypt.Hash.update_multi | {
"file_name": "providers/evercrypt/fst/EverCrypt.Hash.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | let a = FStar.Ghost.reveal a in
s: EverCrypt.Hash.state a ->
prevlen:
EverCrypt.Helpers.uint64_t{FStar.UInt64.v prevlen % Spec.Hash.Definitions.block_length a = 0} ->
blocks:
LowStar.Buffer.buffer Lib.IntTypes.uint8
{LowStar.Monotonic.Buffer.length blocks % Spec.Hash.Definitions.block_l... | {
"end_col": 34,
"end_line": 422,
"start_col": 2,
"start_line": 378
} |
Prims.Tot | val copy:
#a:e_alg -> (
let a = Ghost.reveal a in
s_src:state a ->
s_dst:state a ->
Stack unit
(requires (fun h0 ->
invariant s_src h0 /\
invariant s_dst h0 /\
B.(loc_disjoint (footprint s_src h0) (footprint s_dst h0))))
(ensures fun h0 _ h1 ->
M.(modifies (footprint s_dst h0) ... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "LowStar.Modifies",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "... | false | let copy #a s_src s_dst =
match !*s_src with
| MD5_s p_src ->
[@inline_let]
let s_dst: state MD5 = s_dst in
let p_dst = MD5_s?.p !*s_dst in
B.blit p_src 0ul p_dst 0ul 4ul
| SHA1_s p_src ->
[@inline_let]
let s_dst: state SHA1 = s_dst in
let p_dst = SHA1_s?.p !*s_dst in
... | val copy:
#a:e_alg -> (
let a = Ghost.reveal a in
s_src:state a ->
s_dst:state a ->
Stack unit
(requires (fun h0 ->
invariant s_src h0 /\
invariant s_dst h0 /\
B.(loc_disjoint (footprint s_src h0) (footprint s_dst h0))))
(ensures fun h0 _ h1 ->
M.(modifies (footprint s_dst h0) ... | false | null | false | match !*s_src with
| MD5_s p_src ->
[@@ inline_let ]let s_dst:state MD5 = s_dst in
let p_dst = MD5_s?.p !*s_dst in
B.blit p_src 0ul p_dst 0ul 4ul
| SHA1_s p_src ->
[@@ inline_let ]let s_dst:state SHA1 = s_dst in
let p_dst = SHA1_s?.p !*s_dst in
B.blit p_src 0ul p_dst 0ul 5ul
| SHA2_224_s p_src ->
[@@ inli... | {
"checked_file": "EverCrypt.Hash.fst.checked",
"dependencies": [
"Vale.Wrapper.X64.Sha.fsti.checked",
"Vale.SHA.SHA_helpers.fst.checked",
"Spec.SHA2.Lemmas.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.Blake2.fst.checked",
"prims.fst.checke... | [
"total"
] | [
"EverCrypt.Hash.e_alg",
"EverCrypt.Hash.state",
"FStar.Ghost.reveal",
"EverCrypt.Hash.alg",
"Hacl.Hash.Definitions.state",
"Prims.Mkdtuple2",
"Spec.Hash.Definitions.hash_alg",
"Hacl.Hash.Definitions.m_spec",
"Spec.Hash.Definitions.MD5",
"LowStar.Monotonic.Buffer.blit",
"Hacl.Hash.Definitions.imp... | [] | module EverCrypt.Hash
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module HS = FStar.HyperStack
module ST = FStar.HyperStack.ST
module AC = EverCrypt.AutoConfig2
open LowStar.BufferOps
open FStar.Integers
open C.Fail... | false | false | EverCrypt.Hash.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val copy:
#a:e_alg -> (
let a = Ghost.reveal a in
s_src:state a ->
s_dst:state a ->
Stack unit
(requires (fun h0 ->
invariant s_src h0 /\
invariant s_dst h0 /\
B.(loc_disjoint (footprint s_src h0) (footprint s_dst h0))))
(ensures fun h0 _ h1 ->
M.(modifies (footprint s_dst h0) ... | [] | EverCrypt.Hash.copy | {
"file_name": "providers/evercrypt/fst/EverCrypt.Hash.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | let a = FStar.Ghost.reveal a in
s_src: EverCrypt.Hash.state a -> s_dst: EverCrypt.Hash.state a
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 9,
"end_line": 642,
"start_col": 2,
"start_line": 544
} |
Prims.Tot | val openBase: openBase_st cs vale_p | [
{
"abbrev": true,
"full_module": "Hacl.HPKE.Interface.AEAD",
"short_module": "IAEAD"
},
{
"abbrev": true,
"full_module": "Hacl.HPKE.Interface.Hash",
"short_module": "IHash"
},
{
"abbrev": true,
"full_module": "Hacl.HPKE.Interface.HKDF",
"short_module": "IHK"
},
{
... | false | let openBase = hpke_openBase_higher #cs vale_p IAEAD.aead_decrypt_cp32 setupBaseR | val openBase: openBase_st cs vale_p
let openBase = | false | null | false | hpke_openBase_higher #cs vale_p IAEAD.aead_decrypt_cp32 setupBaseR | {
"checked_file": "Hacl.HPKE.Curve64_CP32_SHA256.fst.checked",
"dependencies": [
"prims.fst.checked",
"Hacl.Meta.HPKE.fst.checked",
"Hacl.Meta.HPKE.fst.checked",
"Hacl.HPKE.Interface.HKDF.fst.checked",
"Hacl.HPKE.Interface.Hash.fst.checked",
"Hacl.HPKE.Interface.DH.fst.checked",
"Hacl.HP... | [
"total"
] | [
"Hacl.Meta.HPKE.hpke_openBase_higher",
"Hacl.HPKE.Curve64_CP32_SHA256.cs",
"Hacl.HPKE.Curve64_CP32_SHA256.vale_p",
"Hacl.HPKE.Interface.AEAD.aead_decrypt_cp32",
"Hacl.HPKE.Curve64_CP32_SHA256.setupBaseR"
] | [] | module Hacl.HPKE.Curve64_CP32_SHA256
open Hacl.Meta.HPKE
module IDH = Hacl.HPKE.Interface.DH
module IHK = Hacl.HPKE.Interface.HKDF
module IHash = Hacl.HPKE.Interface.Hash
module IAEAD = Hacl.HPKE.Interface.AEAD
friend Hacl.Meta.HPKE
#set-options "--fuel 0 --ifuel 0"
let setupBaseS = hpke_setupBaseS_higher #cs vale... | false | true | Hacl.HPKE.Curve64_CP32_SHA256.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val openBase: openBase_st cs vale_p | [] | Hacl.HPKE.Curve64_CP32_SHA256.openBase | {
"file_name": "code/hpke/Hacl.HPKE.Curve64_CP32_SHA256.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Hacl.Impl.HPKE.openBase_st Hacl.HPKE.Curve64_CP32_SHA256.cs Hacl.HPKE.Curve64_CP32_SHA256.vale_p | {
"end_col": 81,
"end_line": 20,
"start_col": 15,
"start_line": 20
} |
Prims.Tot | val sealBase: sealBase_st cs vale_p | [
{
"abbrev": true,
"full_module": "Hacl.HPKE.Interface.AEAD",
"short_module": "IAEAD"
},
{
"abbrev": true,
"full_module": "Hacl.HPKE.Interface.Hash",
"short_module": "IHash"
},
{
"abbrev": true,
"full_module": "Hacl.HPKE.Interface.HKDF",
"short_module": "IHK"
},
{
... | false | let sealBase = hpke_sealBase_higher #cs vale_p IAEAD.aead_encrypt_cp32 setupBaseS | val sealBase: sealBase_st cs vale_p
let sealBase = | false | null | false | hpke_sealBase_higher #cs vale_p IAEAD.aead_encrypt_cp32 setupBaseS | {
"checked_file": "Hacl.HPKE.Curve64_CP32_SHA256.fst.checked",
"dependencies": [
"prims.fst.checked",
"Hacl.Meta.HPKE.fst.checked",
"Hacl.Meta.HPKE.fst.checked",
"Hacl.HPKE.Interface.HKDF.fst.checked",
"Hacl.HPKE.Interface.Hash.fst.checked",
"Hacl.HPKE.Interface.DH.fst.checked",
"Hacl.HP... | [
"total"
] | [
"Hacl.Meta.HPKE.hpke_sealBase_higher",
"Hacl.HPKE.Curve64_CP32_SHA256.cs",
"Hacl.HPKE.Curve64_CP32_SHA256.vale_p",
"Hacl.HPKE.Interface.AEAD.aead_encrypt_cp32",
"Hacl.HPKE.Curve64_CP32_SHA256.setupBaseS"
] | [] | module Hacl.HPKE.Curve64_CP32_SHA256
open Hacl.Meta.HPKE
module IDH = Hacl.HPKE.Interface.DH
module IHK = Hacl.HPKE.Interface.HKDF
module IHash = Hacl.HPKE.Interface.Hash
module IAEAD = Hacl.HPKE.Interface.AEAD
friend Hacl.Meta.HPKE
#set-options "--fuel 0 --ifuel 0"
let setupBaseS = hpke_setupBaseS_higher #cs vale... | false | true | Hacl.HPKE.Curve64_CP32_SHA256.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val sealBase: sealBase_st cs vale_p | [] | Hacl.HPKE.Curve64_CP32_SHA256.sealBase | {
"file_name": "code/hpke/Hacl.HPKE.Curve64_CP32_SHA256.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Hacl.Impl.HPKE.sealBase_st Hacl.HPKE.Curve64_CP32_SHA256.cs Hacl.HPKE.Curve64_CP32_SHA256.vale_p | {
"end_col": 81,
"end_line": 18,
"start_col": 15,
"start_line": 18
} |
Prims.Tot | val setupBaseS: setupBaseS_st cs vale_p | [
{
"abbrev": true,
"full_module": "Hacl.HPKE.Interface.AEAD",
"short_module": "IAEAD"
},
{
"abbrev": true,
"full_module": "Hacl.HPKE.Interface.Hash",
"short_module": "IHash"
},
{
"abbrev": true,
"full_module": "Hacl.HPKE.Interface.HKDF",
"short_module": "IHK"
},
{
... | false | let setupBaseS = hpke_setupBaseS_higher #cs vale_p IHK.hkdf_expand256 IHK.hkdf_extract256 IDH.secret_to_public_c64 IDH.dh_c64 IHK.hkdf_expand256 IHK.hkdf_extract256 | val setupBaseS: setupBaseS_st cs vale_p
let setupBaseS = | false | null | false | hpke_setupBaseS_higher #cs
vale_p
IHK.hkdf_expand256
IHK.hkdf_extract256
IDH.secret_to_public_c64
IDH.dh_c64
IHK.hkdf_expand256
IHK.hkdf_extract256 | {
"checked_file": "Hacl.HPKE.Curve64_CP32_SHA256.fst.checked",
"dependencies": [
"prims.fst.checked",
"Hacl.Meta.HPKE.fst.checked",
"Hacl.Meta.HPKE.fst.checked",
"Hacl.HPKE.Interface.HKDF.fst.checked",
"Hacl.HPKE.Interface.Hash.fst.checked",
"Hacl.HPKE.Interface.DH.fst.checked",
"Hacl.HP... | [
"total"
] | [
"Hacl.Meta.HPKE.hpke_setupBaseS_higher",
"Hacl.HPKE.Curve64_CP32_SHA256.cs",
"Hacl.HPKE.Curve64_CP32_SHA256.vale_p",
"Hacl.HPKE.Interface.HKDF.hkdf_expand256",
"Hacl.HPKE.Interface.HKDF.hkdf_extract256",
"Hacl.HPKE.Interface.DH.secret_to_public_c64",
"Hacl.HPKE.Interface.DH.dh_c64"
] | [] | module Hacl.HPKE.Curve64_CP32_SHA256
open Hacl.Meta.HPKE
module IDH = Hacl.HPKE.Interface.DH
module IHK = Hacl.HPKE.Interface.HKDF
module IHash = Hacl.HPKE.Interface.Hash
module IAEAD = Hacl.HPKE.Interface.AEAD
friend Hacl.Meta.HPKE
#set-options "--fuel 0 --ifuel 0" | false | true | Hacl.HPKE.Curve64_CP32_SHA256.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val setupBaseS: setupBaseS_st cs vale_p | [] | Hacl.HPKE.Curve64_CP32_SHA256.setupBaseS | {
"file_name": "code/hpke/Hacl.HPKE.Curve64_CP32_SHA256.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Hacl.Impl.HPKE.setupBaseS_st Hacl.HPKE.Curve64_CP32_SHA256.cs Hacl.HPKE.Curve64_CP32_SHA256.vale_p | {
"end_col": 164,
"end_line": 14,
"start_col": 17,
"start_line": 14
} |
Prims.Tot | val setupBaseR: setupBaseR_st cs vale_p | [
{
"abbrev": true,
"full_module": "Hacl.HPKE.Interface.AEAD",
"short_module": "IAEAD"
},
{
"abbrev": true,
"full_module": "Hacl.HPKE.Interface.Hash",
"short_module": "IHash"
},
{
"abbrev": true,
"full_module": "Hacl.HPKE.Interface.HKDF",
"short_module": "IHK"
},
{
... | false | let setupBaseR = hpke_setupBaseR_higher #cs vale_p IHK.hkdf_expand256 IHK.hkdf_extract256 IDH.dh_c64 IHK.hkdf_expand256 IHK.hkdf_extract256 IDH.secret_to_public_c64 | val setupBaseR: setupBaseR_st cs vale_p
let setupBaseR = | false | null | false | hpke_setupBaseR_higher #cs
vale_p
IHK.hkdf_expand256
IHK.hkdf_extract256
IDH.dh_c64
IHK.hkdf_expand256
IHK.hkdf_extract256
IDH.secret_to_public_c64 | {
"checked_file": "Hacl.HPKE.Curve64_CP32_SHA256.fst.checked",
"dependencies": [
"prims.fst.checked",
"Hacl.Meta.HPKE.fst.checked",
"Hacl.Meta.HPKE.fst.checked",
"Hacl.HPKE.Interface.HKDF.fst.checked",
"Hacl.HPKE.Interface.Hash.fst.checked",
"Hacl.HPKE.Interface.DH.fst.checked",
"Hacl.HP... | [
"total"
] | [
"Hacl.Meta.HPKE.hpke_setupBaseR_higher",
"Hacl.HPKE.Curve64_CP32_SHA256.cs",
"Hacl.HPKE.Curve64_CP32_SHA256.vale_p",
"Hacl.HPKE.Interface.HKDF.hkdf_expand256",
"Hacl.HPKE.Interface.HKDF.hkdf_extract256",
"Hacl.HPKE.Interface.DH.dh_c64",
"Hacl.HPKE.Interface.DH.secret_to_public_c64"
] | [] | module Hacl.HPKE.Curve64_CP32_SHA256
open Hacl.Meta.HPKE
module IDH = Hacl.HPKE.Interface.DH
module IHK = Hacl.HPKE.Interface.HKDF
module IHash = Hacl.HPKE.Interface.Hash
module IAEAD = Hacl.HPKE.Interface.AEAD
friend Hacl.Meta.HPKE
#set-options "--fuel 0 --ifuel 0"
let setupBaseS = hpke_setupBaseS_higher #cs vale... | false | true | Hacl.HPKE.Curve64_CP32_SHA256.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val setupBaseR: setupBaseR_st cs vale_p | [] | Hacl.HPKE.Curve64_CP32_SHA256.setupBaseR | {
"file_name": "code/hpke/Hacl.HPKE.Curve64_CP32_SHA256.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Hacl.Impl.HPKE.setupBaseR_st Hacl.HPKE.Curve64_CP32_SHA256.cs Hacl.HPKE.Curve64_CP32_SHA256.vale_p | {
"end_col": 164,
"end_line": 16,
"start_col": 17,
"start_line": 16
} |
Prims.Tot | [
{
"abbrev": true,
"full_module": "Hacl.Bignum.Montgomery",
"short_module": "BM"
},
{
"abbrev": true,
"full_module": "Hacl.Bignum",
"short_module": "BN"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.AlmostMontgomery",
"short_module": "S"
},
{
"abbrev": fals... | false | let bn_almost_mont_reduction_st (t:limb_t) (len:size_t{0 < v len /\ v len + v len <= max_size_t}) =
n:lbignum t len
-> mu:limb t
-> c:lbignum t (len +! len)
-> res:lbignum t len ->
Stack unit
(requires fun h ->
live h n /\ live h c /\ live h res /\
disjoint res n /\ disjoint res c /\ disjoint n c)... | let bn_almost_mont_reduction_st (t: limb_t) (len: size_t{0 < v len /\ v len + v len <= max_size_t}) = | false | null | false | n: lbignum t len -> mu: limb t -> c: lbignum t (len +! len) -> res: lbignum t len
-> Stack unit
(requires
fun h ->
live h n /\ live h c /\ live h res /\ disjoint res n /\ disjoint res c /\ disjoint n c)
(ensures
fun h0 _ h1 ->
modifies (loc res |+| loc c) h0 h1 /\
... | {
"checked_file": "Hacl.Bignum.AlmostMontgomery.fsti.checked",
"dependencies": [
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.Bignum.AlmostMontgomery.fsti.checked",
"Hacl.Bignum.Montgomery.fsti.checked",
"Hacl.Bignum.Definitions.fst.checked",
"H... | [
"total"
] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Lib.IntTypes.max_size_t",
"Hacl.Bignum.Definitions.lbignum",
"Hacl.Bignum.Defi... | [] | module Hacl.Bignum.AlmostMontgomery
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Hacl.Bignum.Definitions
module S = Hacl.Spec.Bignum.AlmostMontgomery
module BN = Hacl.Bignum
module BM = Hacl.Bignum.Montgomery
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"... | false | false | Hacl.Bignum.AlmostMontgomery.fsti | {
"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... | null | val bn_almost_mont_reduction_st : t: Hacl.Bignum.Definitions.limb_t ->
len:
Lib.IntTypes.size_t
{ 0 < Lib.IntTypes.v len /\
Lib.IntTypes.v len + Lib.IntTypes.v len <= Lib.IntTypes.max_size_t }
-> Type0 | [] | Hacl.Bignum.AlmostMontgomery.bn_almost_mont_reduction_st | {
"file_name": "code/bignum/Hacl.Bignum.AlmostMontgomery.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
t: Hacl.Bignum.Definitions.limb_t ->
len:
Lib.IntTypes.size_t
{ 0 < Lib.IntTypes.v len /\
Lib.IntTypes.v len + Lib.IntTypes.v len <= Lib.IntTypes.max_size_t }
-> Type0 | {
"end_col": 79,
"end_line": 32,
"start_col": 4,
"start_line": 23
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "Hacl.Bignum.Montgomery",
"short_module": "BM"
},
{
"abbrev": true,
"full_module": "Hacl.Bignum",
"short_module": "BN"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.AlmostMontgomery",
"short_module": "S"
},
{
"abbrev": fals... | false | let bn_almost_mont_sqr_st (t:limb_t) (len:BN.meta_len t) =
n:lbignum t len
-> mu:limb t
-> aM:lbignum t len
-> resM:lbignum t len ->
Stack unit
(requires fun h ->
live h aM /\ live h resM /\ live h n /\
disjoint resM n /\ eq_or_disjoint aM resM)
(ensures fun h0 _ h1 -> modifies (loc resM) h0 h1... | let bn_almost_mont_sqr_st (t: limb_t) (len: BN.meta_len t) = | false | null | false | n: lbignum t len -> mu: limb t -> aM: lbignum t len -> resM: lbignum t len
-> Stack unit
(requires
fun h -> live h aM /\ live h resM /\ live h n /\ disjoint resM n /\ eq_or_disjoint aM resM)
(ensures
fun h0 _ h1 ->
modifies (loc resM) h0 h1 /\
as_seq h1 resM == S.bn_alm... | {
"checked_file": "Hacl.Bignum.AlmostMontgomery.fsti.checked",
"dependencies": [
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.Bignum.AlmostMontgomery.fsti.checked",
"Hacl.Bignum.Montgomery.fsti.checked",
"Hacl.Bignum.Definitions.fst.checked",
"H... | [
"total"
] | [
"Hacl.Bignum.Definitions.limb_t",
"Hacl.Bignum.meta_len",
"Hacl.Bignum.Definitions.lbignum",
"Hacl.Bignum.Definitions.limb",
"Prims.unit",
"FStar.Monotonic.HyperStack.mem",
"Prims.l_and",
"Lib.Buffer.live",
"Lib.Buffer.MUT",
"Lib.Buffer.disjoint",
"Lib.Buffer.eq_or_disjoint",
"Lib.Buffer.modif... | [] | module Hacl.Bignum.AlmostMontgomery
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Hacl.Bignum.Definitions
module S = Hacl.Spec.Bignum.AlmostMontgomery
module BN = Hacl.Bignum
module BM = Hacl.Bignum.Montgomery
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"... | false | false | Hacl.Bignum.AlmostMontgomery.fsti | {
"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... | null | val bn_almost_mont_sqr_st : t: Hacl.Bignum.Definitions.limb_t -> len: Hacl.Bignum.meta_len t -> Type0 | [] | Hacl.Bignum.AlmostMontgomery.bn_almost_mont_sqr_st | {
"file_name": "code/bignum/Hacl.Bignum.AlmostMontgomery.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | t: Hacl.Bignum.Definitions.limb_t -> len: Hacl.Bignum.meta_len t -> Type0 | {
"end_col": 75,
"end_line": 74,
"start_col": 4,
"start_line": 65
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "Hacl.Bignum.Montgomery",
"short_module": "BM"
},
{
"abbrev": true,
"full_module": "Hacl.Bignum",
"short_module": "BN"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.AlmostMontgomery",
"short_module": "S"
},
{
"abbrev": fals... | false | let bn_almost_mont_mul_st (t:limb_t) (len:BN.meta_len t) =
n:lbignum t len
-> mu:limb t
-> aM:lbignum t len
-> bM:lbignum t len
-> resM:lbignum t len ->
Stack unit
(requires fun h ->
live h aM /\ live h bM /\ live h resM /\ live h n /\
disjoint resM n /\ eq_or_disjoint aM bM /\
eq_or_disjoin... | let bn_almost_mont_mul_st (t: limb_t) (len: BN.meta_len t) = | false | null | false | n: lbignum t len -> mu: limb t -> aM: lbignum t len -> bM: lbignum t len -> resM: lbignum t len
-> Stack unit
(requires
fun h ->
live h aM /\ live h bM /\ live h resM /\ live h n /\ disjoint resM n /\
eq_or_disjoint aM bM /\ eq_or_disjoint aM resM /\ eq_or_disjoint bM resM)
(en... | {
"checked_file": "Hacl.Bignum.AlmostMontgomery.fsti.checked",
"dependencies": [
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.Bignum.AlmostMontgomery.fsti.checked",
"Hacl.Bignum.Montgomery.fsti.checked",
"Hacl.Bignum.Definitions.fst.checked",
"H... | [
"total"
] | [
"Hacl.Bignum.Definitions.limb_t",
"Hacl.Bignum.meta_len",
"Hacl.Bignum.Definitions.lbignum",
"Hacl.Bignum.Definitions.limb",
"Prims.unit",
"FStar.Monotonic.HyperStack.mem",
"Prims.l_and",
"Lib.Buffer.live",
"Lib.Buffer.MUT",
"Lib.Buffer.disjoint",
"Lib.Buffer.eq_or_disjoint",
"Lib.Buffer.modif... | [] | module Hacl.Bignum.AlmostMontgomery
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Hacl.Bignum.Definitions
module S = Hacl.Spec.Bignum.AlmostMontgomery
module BN = Hacl.Bignum
module BM = Hacl.Bignum.Montgomery
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"... | false | false | Hacl.Bignum.AlmostMontgomery.fsti | {
"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... | null | val bn_almost_mont_mul_st : t: Hacl.Bignum.Definitions.limb_t -> len: Hacl.Bignum.meta_len t -> Type0 | [] | Hacl.Bignum.AlmostMontgomery.bn_almost_mont_mul_st | {
"file_name": "code/bignum/Hacl.Bignum.AlmostMontgomery.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | t: Hacl.Bignum.Definitions.limb_t -> len: Hacl.Bignum.meta_len t -> Type0 | {
"end_col": 90,
"end_line": 52,
"start_col": 4,
"start_line": 41
} | |
Prims.Tot | val crypto_bytes:r: size_t{v r == FP.crypto_bytes FP.Frodo64} | [
{
"abbrev": true,
"full_module": "Spec.Frodo.Params",
"short_module": "FP"
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Frodo.Params",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Frodo.KEM",
"short_module": null
},
{
"abbrev": false,
"fu... | false | let crypto_bytes :r:size_t{v r == FP.crypto_bytes FP.Frodo64} =
crypto_bytes FP.Frodo64 | val crypto_bytes:r: size_t{v r == FP.crypto_bytes FP.Frodo64}
let crypto_bytes:r: size_t{v r == FP.crypto_bytes FP.Frodo64} = | false | null | false | crypto_bytes FP.Frodo64 | {
"checked_file": "Hacl.Frodo64.fst.checked",
"dependencies": [
"Spec.Frodo.Params.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.Frodo.Params.fst.checked",
"Hacl.Frodo.KEM.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Hy... | [
"total"
] | [
"Hacl.Impl.Frodo.Params.crypto_bytes",
"Spec.Frodo.Params.Frodo64"
] | [] | module Hacl.Frodo64
open FStar.HyperStack
open FStar.HyperStack.ST
open Lib.IntTypes
open Lib.Buffer
open Hacl.Frodo.KEM
open Hacl.Impl.Frodo.Params
module FP = Spec.Frodo.Params
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
[@@ CPrologue
"/*
this variant is used only for testing purposes!
*/\n" ] | false | false | Hacl.Frodo64.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val crypto_bytes:r: size_t{v r == FP.crypto_bytes FP.Frodo64} | [] | Hacl.Frodo64.crypto_bytes | {
"file_name": "code/frodo/Hacl.Frodo64.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | r:
Lib.IntTypes.int_t Lib.IntTypes.U32 Lib.IntTypes.PUB
{Lib.IntTypes.v r == Spec.Frodo.Params.crypto_bytes Spec.Frodo.Params.Frodo64} | {
"end_col": 25,
"end_line": 23,
"start_col": 2,
"start_line": 23
} |
Prims.Tot | val crypto_kem_dec: crypto_kem_dec_st FP.Frodo64 FP.SHAKE128 | [
{
"abbrev": true,
"full_module": "Spec.Frodo.Params",
"short_module": "FP"
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Frodo.Params",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Frodo.KEM",
"short_module": null
},
{
"abbrev": false,
"fu... | false | let crypto_kem_dec ss ct sk =
crypto_kem_dec FP.Frodo64 FP.SHAKE128 ss ct sk | val crypto_kem_dec: crypto_kem_dec_st FP.Frodo64 FP.SHAKE128
let crypto_kem_dec ss ct sk = | false | null | false | crypto_kem_dec FP.Frodo64 FP.SHAKE128 ss ct sk | {
"checked_file": "Hacl.Frodo64.fst.checked",
"dependencies": [
"Spec.Frodo.Params.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.Frodo.Params.fst.checked",
"Hacl.Frodo.KEM.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Hy... | [
"total"
] | [
"Hacl.Impl.Matrix.lbytes",
"Hacl.Impl.Frodo.Params.crypto_bytes",
"Spec.Frodo.Params.Frodo64",
"Hacl.Impl.Frodo.Params.crypto_ciphertextbytes",
"Hacl.Impl.Frodo.Params.crypto_secretkeybytes",
"Hacl.Frodo.KEM.crypto_kem_dec",
"Spec.Frodo.Params.SHAKE128",
"Lib.IntTypes.uint32"
] | [] | module Hacl.Frodo64
open FStar.HyperStack
open FStar.HyperStack.ST
open Lib.IntTypes
open Lib.Buffer
open Hacl.Frodo.KEM
open Hacl.Impl.Frodo.Params
module FP = Spec.Frodo.Params
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
[@@ CPrologue
"/*
this variant is used only for testing purposes!
*/\n" ]
let crypt... | false | true | Hacl.Frodo64.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val crypto_kem_dec: crypto_kem_dec_st FP.Frodo64 FP.SHAKE128 | [] | Hacl.Frodo64.crypto_kem_dec | {
"file_name": "code/frodo/Hacl.Frodo64.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Hacl.Frodo.KEM.crypto_kem_dec_st Spec.Frodo.Params.Frodo64 Spec.Frodo.Params.SHAKE128 | {
"end_col": 48,
"end_line": 45,
"start_col": 2,
"start_line": 45
} |
Prims.Tot | val crypto_kem_enc: crypto_kem_enc_st FP.Frodo64 FP.SHAKE128 | [
{
"abbrev": true,
"full_module": "Spec.Frodo.Params",
"short_module": "FP"
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Frodo.Params",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Frodo.KEM",
"short_module": null
},
{
"abbrev": false,
"fu... | false | let crypto_kem_enc ct ss pk =
crypto_kem_enc FP.Frodo64 FP.SHAKE128 ct ss pk | val crypto_kem_enc: crypto_kem_enc_st FP.Frodo64 FP.SHAKE128
let crypto_kem_enc ct ss pk = | false | null | false | crypto_kem_enc FP.Frodo64 FP.SHAKE128 ct ss pk | {
"checked_file": "Hacl.Frodo64.fst.checked",
"dependencies": [
"Spec.Frodo.Params.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.Frodo.Params.fst.checked",
"Hacl.Frodo.KEM.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Hy... | [
"total"
] | [
"Hacl.Impl.Matrix.lbytes",
"Hacl.Impl.Frodo.Params.crypto_ciphertextbytes",
"Spec.Frodo.Params.Frodo64",
"Hacl.Impl.Frodo.Params.crypto_bytes",
"Hacl.Impl.Frodo.Params.crypto_publickeybytes",
"Hacl.Frodo.KEM.crypto_kem_enc",
"Spec.Frodo.Params.SHAKE128",
"Lib.IntTypes.uint32"
] | [] | module Hacl.Frodo64
open FStar.HyperStack
open FStar.HyperStack.ST
open Lib.IntTypes
open Lib.Buffer
open Hacl.Frodo.KEM
open Hacl.Impl.Frodo.Params
module FP = Spec.Frodo.Params
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
[@@ CPrologue
"/*
this variant is used only for testing purposes!
*/\n" ]
let crypt... | false | true | Hacl.Frodo64.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val crypto_kem_enc: crypto_kem_enc_st FP.Frodo64 FP.SHAKE128 | [] | Hacl.Frodo64.crypto_kem_enc | {
"file_name": "code/frodo/Hacl.Frodo64.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Hacl.Frodo.KEM.crypto_kem_enc_st Spec.Frodo.Params.Frodo64 Spec.Frodo.Params.SHAKE128 | {
"end_col": 48,
"end_line": 41,
"start_col": 2,
"start_line": 41
} |
Prims.Tot | val crypto_kem_keypair: crypto_kem_keypair_st FP.Frodo64 FP.SHAKE128 | [
{
"abbrev": true,
"full_module": "Spec.Frodo.Params",
"short_module": "FP"
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Frodo.Params",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Frodo.KEM",
"short_module": null
},
{
"abbrev": false,
"fu... | false | let crypto_kem_keypair pk sk =
crypto_kem_keypair FP.Frodo64 FP.SHAKE128 pk sk | val crypto_kem_keypair: crypto_kem_keypair_st FP.Frodo64 FP.SHAKE128
let crypto_kem_keypair pk sk = | false | null | false | crypto_kem_keypair FP.Frodo64 FP.SHAKE128 pk sk | {
"checked_file": "Hacl.Frodo64.fst.checked",
"dependencies": [
"Spec.Frodo.Params.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.Frodo.Params.fst.checked",
"Hacl.Frodo.KEM.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Hy... | [
"total"
] | [
"Hacl.Impl.Matrix.lbytes",
"Hacl.Impl.Frodo.Params.crypto_publickeybytes",
"Spec.Frodo.Params.Frodo64",
"Hacl.Impl.Frodo.Params.crypto_secretkeybytes",
"Hacl.Frodo.KEM.crypto_kem_keypair",
"Spec.Frodo.Params.SHAKE128",
"Lib.IntTypes.uint32"
] | [] | module Hacl.Frodo64
open FStar.HyperStack
open FStar.HyperStack.ST
open Lib.IntTypes
open Lib.Buffer
open Hacl.Frodo.KEM
open Hacl.Impl.Frodo.Params
module FP = Spec.Frodo.Params
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
[@@ CPrologue
"/*
this variant is used only for testing purposes!
*/\n" ]
let crypt... | false | true | Hacl.Frodo64.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val crypto_kem_keypair: crypto_kem_keypair_st FP.Frodo64 FP.SHAKE128 | [] | Hacl.Frodo64.crypto_kem_keypair | {
"file_name": "code/frodo/Hacl.Frodo64.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Hacl.Frodo.KEM.crypto_kem_keypair_st Spec.Frodo.Params.Frodo64 Spec.Frodo.Params.SHAKE128 | {
"end_col": 49,
"end_line": 37,
"start_col": 2,
"start_line": 37
} |
Prims.Tot | val crypto_publickeybytes:r: size_t{v r == FP.crypto_publickeybytes FP.Frodo64} | [
{
"abbrev": true,
"full_module": "Spec.Frodo.Params",
"short_module": "FP"
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Frodo.Params",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Frodo.KEM",
"short_module": null
},
{
"abbrev": false,
"fu... | false | let crypto_publickeybytes :r:size_t{v r == FP.crypto_publickeybytes FP.Frodo64} =
normalize_term (crypto_publickeybytes FP.Frodo64) | val crypto_publickeybytes:r: size_t{v r == FP.crypto_publickeybytes FP.Frodo64}
let crypto_publickeybytes:r: size_t{v r == FP.crypto_publickeybytes FP.Frodo64} = | false | null | false | normalize_term (crypto_publickeybytes FP.Frodo64) | {
"checked_file": "Hacl.Frodo64.fst.checked",
"dependencies": [
"Spec.Frodo.Params.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.Frodo.Params.fst.checked",
"Hacl.Frodo.KEM.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Hy... | [
"total"
] | [
"FStar.Pervasives.normalize_term",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Prims.eq2",
"Prims.int",
"Prims.l_or",
"Lib.IntTypes.range",
"Prims.l_and",
"Prims.b2t",
"Prims.op_GreaterThan",
"Prims.op_LessThanOrEqual",
"Prims.op_Subtraction",
"Prims.pow2",
"Lib.IntTyp... | [] | module Hacl.Frodo64
open FStar.HyperStack
open FStar.HyperStack.ST
open Lib.IntTypes
open Lib.Buffer
open Hacl.Frodo.KEM
open Hacl.Impl.Frodo.Params
module FP = Spec.Frodo.Params
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
[@@ CPrologue
"/*
this variant is used only for testing purposes!
*/\n" ]
let crypt... | false | false | Hacl.Frodo64.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val crypto_publickeybytes:r: size_t{v r == FP.crypto_publickeybytes FP.Frodo64} | [] | Hacl.Frodo64.crypto_publickeybytes | {
"file_name": "code/frodo/Hacl.Frodo64.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | r:
Lib.IntTypes.int_t Lib.IntTypes.U32 Lib.IntTypes.PUB
{Lib.IntTypes.v r == Spec.Frodo.Params.crypto_publickeybytes Spec.Frodo.Params.Frodo64} | {
"end_col": 51,
"end_line": 26,
"start_col": 2,
"start_line": 26
} |
Prims.Tot | val crypto_ciphertextbytes:r: size_t{v r == FP.crypto_ciphertextbytes FP.Frodo64} | [
{
"abbrev": true,
"full_module": "Spec.Frodo.Params",
"short_module": "FP"
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Frodo.Params",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Frodo.KEM",
"short_module": null
},
{
"abbrev": false,
"fu... | false | let crypto_ciphertextbytes :r:size_t{v r == FP.crypto_ciphertextbytes FP.Frodo64} =
normalize_term (crypto_ciphertextbytes FP.Frodo64) | val crypto_ciphertextbytes:r: size_t{v r == FP.crypto_ciphertextbytes FP.Frodo64}
let crypto_ciphertextbytes:r: size_t{v r == FP.crypto_ciphertextbytes FP.Frodo64} = | false | null | false | normalize_term (crypto_ciphertextbytes FP.Frodo64) | {
"checked_file": "Hacl.Frodo64.fst.checked",
"dependencies": [
"Spec.Frodo.Params.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.Frodo.Params.fst.checked",
"Hacl.Frodo.KEM.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Hy... | [
"total"
] | [
"FStar.Pervasives.normalize_term",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Prims.eq2",
"Prims.int",
"Prims.l_or",
"Lib.IntTypes.range",
"Prims.l_and",
"Prims.b2t",
"Prims.op_GreaterThan",
"Prims.op_LessThanOrEqual",
"Prims.op_Subtraction",
"Prims.pow2",
"Lib.IntTyp... | [] | module Hacl.Frodo64
open FStar.HyperStack
open FStar.HyperStack.ST
open Lib.IntTypes
open Lib.Buffer
open Hacl.Frodo.KEM
open Hacl.Impl.Frodo.Params
module FP = Spec.Frodo.Params
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
[@@ CPrologue
"/*
this variant is used only for testing purposes!
*/\n" ]
let crypt... | false | false | Hacl.Frodo64.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val crypto_ciphertextbytes:r: size_t{v r == FP.crypto_ciphertextbytes FP.Frodo64} | [] | Hacl.Frodo64.crypto_ciphertextbytes | {
"file_name": "code/frodo/Hacl.Frodo64.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | r:
Lib.IntTypes.int_t Lib.IntTypes.U32 Lib.IntTypes.PUB
{Lib.IntTypes.v r == Spec.Frodo.Params.crypto_ciphertextbytes Spec.Frodo.Params.Frodo64} | {
"end_col": 52,
"end_line": 32,
"start_col": 2,
"start_line": 32
} |
Prims.Tot | val crypto_secretkeybytes:r: size_t{v r == FP.crypto_secretkeybytes FP.Frodo64} | [
{
"abbrev": true,
"full_module": "Spec.Frodo.Params",
"short_module": "FP"
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Frodo.Params",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Frodo.KEM",
"short_module": null
},
{
"abbrev": false,
"fu... | false | let crypto_secretkeybytes :r:size_t{v r == FP.crypto_secretkeybytes FP.Frodo64} =
normalize_term (crypto_secretkeybytes FP.Frodo64) | val crypto_secretkeybytes:r: size_t{v r == FP.crypto_secretkeybytes FP.Frodo64}
let crypto_secretkeybytes:r: size_t{v r == FP.crypto_secretkeybytes FP.Frodo64} = | false | null | false | normalize_term (crypto_secretkeybytes FP.Frodo64) | {
"checked_file": "Hacl.Frodo64.fst.checked",
"dependencies": [
"Spec.Frodo.Params.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.Frodo.Params.fst.checked",
"Hacl.Frodo.KEM.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Hy... | [
"total"
] | [
"FStar.Pervasives.normalize_term",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Prims.eq2",
"Prims.int",
"Prims.l_or",
"Lib.IntTypes.range",
"Prims.l_and",
"Prims.b2t",
"Prims.op_GreaterThan",
"Prims.op_LessThanOrEqual",
"Prims.op_Subtraction",
"Prims.pow2",
"Lib.IntTyp... | [] | module Hacl.Frodo64
open FStar.HyperStack
open FStar.HyperStack.ST
open Lib.IntTypes
open Lib.Buffer
open Hacl.Frodo.KEM
open Hacl.Impl.Frodo.Params
module FP = Spec.Frodo.Params
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
[@@ CPrologue
"/*
this variant is used only for testing purposes!
*/\n" ]
let crypt... | false | false | Hacl.Frodo64.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val crypto_secretkeybytes:r: size_t{v r == FP.crypto_secretkeybytes FP.Frodo64} | [] | Hacl.Frodo64.crypto_secretkeybytes | {
"file_name": "code/frodo/Hacl.Frodo64.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | r:
Lib.IntTypes.int_t Lib.IntTypes.U32 Lib.IntTypes.PUB
{Lib.IntTypes.v r == Spec.Frodo.Params.crypto_secretkeybytes Spec.Frodo.Params.Frodo64} | {
"end_col": 51,
"end_line": 29,
"start_col": 2,
"start_line": 29
} |
Prims.GTot | val i_sel (#r: rid) (#a: Type) (#p: (seq a -> Type)) (h: mem) (m: i_seq r a p)
: GTot (s: seq a {p s}) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let i_sel (#r:rid) (#a:Type) (#p:seq a -> Type) (h:mem) (m:i_seq r a p)
: GTot (s:seq a{p s})
= HS.sel h m | val i_sel (#r: rid) (#a: Type) (#p: (seq a -> Type)) (h: mem) (m: i_seq r a p)
: GTot (s: seq a {p s})
let i_sel (#r: rid) (#a: Type) (#p: (seq a -> Type)) (h: mem) (m: i_seq r a p)
: GTot (s: seq a {p s}) = | false | null | false | HS.sel h m | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"sometrivial"
] | [
"FStar.Monotonic.Seq.rid",
"FStar.Seq.Base.seq",
"FStar.Monotonic.HyperStack.mem",
"FStar.Monotonic.Seq.i_seq",
"FStar.Monotonic.HyperStack.sel",
"FStar.Monotonic.Seq.grows_p"
] | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val i_sel (#r: rid) (#a: Type) (#p: (seq a -> Type)) (h: mem) (m: i_seq r a p)
: GTot (s: seq a {p s}) | [] | FStar.Monotonic.Seq.i_sel | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | h: FStar.Monotonic.HyperStack.mem -> m: FStar.Monotonic.Seq.i_seq r a p
-> Prims.GTot (s: FStar.Seq.Base.seq a {p s}) | {
"end_col": 14,
"end_line": 132,
"start_col": 4,
"start_line": 132
} |
Prims.Tot | val int_at_most (#r #a #p: _) (x: int) (is: i_seq r a p) (h: mem) : Type0 | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let int_at_most #r #a #p (x:int) (is:i_seq r a p) (h:mem) : Type0 =
x < Seq.length (HS.sel h is) | val int_at_most (#r #a #p: _) (x: int) (is: i_seq r a p) (h: mem) : Type0
let int_at_most #r #a #p (x: int) (is: i_seq r a p) (h: mem) : Type0 = | false | null | false | x < Seq.length (HS.sel h is) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"total"
] | [
"FStar.Monotonic.Seq.rid",
"FStar.Seq.Base.seq",
"Prims.int",
"FStar.Monotonic.Seq.i_seq",
"FStar.Monotonic.HyperStack.mem",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Seq.Base.length",
"FStar.Monotonic.HyperStack.sel",
"FStar.Monotonic.Seq.grows_p"
] | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val int_at_most (#r #a #p: _) (x: int) (is: i_seq r a p) (h: mem) : Type0 | [] | FStar.Monotonic.Seq.int_at_most | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | x: Prims.int -> is: FStar.Monotonic.Seq.i_seq r a p -> h: FStar.Monotonic.HyperStack.mem -> Type0 | {
"end_col": 30,
"end_line": 124,
"start_col": 2,
"start_line": 124
} |
Prims.GTot | val i_contains (#r: rid) (#a: Type) (#p: (seq a -> Type)) (m: i_seq r a p) (h: mem) : GTot Type0 | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let i_contains (#r:rid) (#a:Type) (#p:seq a -> Type) (m:i_seq r a p) (h:mem)
: GTot Type0
= HS.contains h m | val i_contains (#r: rid) (#a: Type) (#p: (seq a -> Type)) (m: i_seq r a p) (h: mem) : GTot Type0
let i_contains (#r: rid) (#a: Type) (#p: (seq a -> Type)) (m: i_seq r a p) (h: mem) : GTot Type0 = | false | null | false | HS.contains h m | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"sometrivial"
] | [
"FStar.Monotonic.Seq.rid",
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.i_seq",
"FStar.Monotonic.HyperStack.mem",
"FStar.Monotonic.HyperStack.contains",
"FStar.Monotonic.Seq.grows_p"
] | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val i_contains (#r: rid) (#a: Type) (#p: (seq a -> Type)) (m: i_seq r a p) (h: mem) : GTot Type0 | [] | FStar.Monotonic.Seq.i_contains | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | m: FStar.Monotonic.Seq.i_seq r a p -> h: FStar.Monotonic.HyperStack.mem -> Prims.GTot Type0 | {
"end_col": 19,
"end_line": 142,
"start_col": 4,
"start_line": 142
} |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let collect_prefix (#a:Type) (#b:Type) (#i:rid)
(r:m_rref i (seq a) grows)
(f:a -> Tot (seq b))
(bs:seq b)
(h:mem) =
grows bs (collect f (HS.sel h r)) | let collect_prefix
(#a #b: Type)
(#i: rid)
(r: m_rref i (seq a) grows)
(f: (a -> Tot (seq b)))
(bs: seq b)
(h: mem)
= | false | null | false | grows bs (collect f (HS.sel h r)) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"total"
] | [
"FStar.Monotonic.Seq.rid",
"FStar.HyperStack.ST.m_rref",
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.grows",
"FStar.Monotonic.HyperStack.mem",
"FStar.Monotonic.Seq.collect",
"FStar.Monotonic.HyperStack.sel"
] | [] | (*
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... | false | false | FStar.Monotonic.Seq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val collect_prefix : r: FStar.HyperStack.ST.m_rref i (FStar.Seq.Base.seq a) FStar.Monotonic.Seq.grows ->
f: (_: a -> FStar.Seq.Base.seq b) ->
bs: FStar.Seq.Base.seq b ->
h: FStar.Monotonic.HyperStack.mem
-> Type0 | [] | FStar.Monotonic.Seq.collect_prefix | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
r: FStar.HyperStack.ST.m_rref i (FStar.Seq.Base.seq a) FStar.Monotonic.Seq.grows ->
f: (_: a -> FStar.Seq.Base.seq b) ->
bs: FStar.Seq.Base.seq b ->
h: FStar.Monotonic.HyperStack.mem
-> Type0 | {
"end_col": 35,
"end_line": 332,
"start_col": 2,
"start_line": 332
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let grows #a = grows_aux #a | let grows #a = | false | null | false | grows_aux #a | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"total"
] | [
"FStar.Monotonic.Seq.grows_aux",
"FStar.Preorder.preorder",
"FStar.Seq.Base.seq"
] | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val grows : FStar.Preorder.preorder (FStar.Seq.Base.seq a) | [] | FStar.Monotonic.Seq.grows | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | FStar.Preorder.preorder (FStar.Seq.Base.seq a) | {
"end_col": 27,
"end_line": 47,
"start_col": 15,
"start_line": 47
} | |
Prims.Tot | val snoc (s: seq 'a) (x: 'a) : Tot (seq 'a) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let snoc (s:seq 'a) (x:'a)
: Tot (seq 'a)
= Seq.append s (Seq.create 1 x) | val snoc (s: seq 'a) (x: 'a) : Tot (seq 'a)
let snoc (s: seq 'a) (x: 'a) : Tot (seq 'a) = | false | null | false | Seq.append s (Seq.create 1 x) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"total"
] | [
"FStar.Seq.Base.seq",
"FStar.Seq.Base.append",
"FStar.Seq.Base.create"
] | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val snoc (s: seq 'a) (x: 'a) : Tot (seq 'a) | [] | FStar.Monotonic.Seq.snoc | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | s: FStar.Seq.Base.seq 'a -> x: 'a -> FStar.Seq.Base.seq 'a | {
"end_col": 33,
"end_line": 53,
"start_col": 4,
"start_line": 53
} |
Prims.GTot | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let collect_has_at_index (#a:Type) (#b:Type) (#i:rid)
(r:m_rref i (seq a) grows)
(f:a -> Tot (seq b))
(n:nat) (v:b) (h:mem) =
let s = HS.sel h r in
n < Seq.length (collect f s)
/\ Seq.index (collect f s) n == v | let collect_has_at_index
(#a #b: Type)
(#i: rid)
(r: m_rref i (seq a) grows)
(f: (a -> Tot (seq b)))
(n: nat)
(v: b)
(h: mem)
= | false | null | false | let s = HS.sel h r in
n < Seq.length (collect f s) /\ Seq.index (collect f s) n == v | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"sometrivial"
] | [
"FStar.Monotonic.Seq.rid",
"FStar.HyperStack.ST.m_rref",
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.grows",
"Prims.nat",
"FStar.Monotonic.HyperStack.mem",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Seq.Base.length",
"FStar.Monotonic.Seq.collect",
"Prims.eq2",
"FStar.Seq.Base.ind... | [] | (*
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... | false | false | FStar.Monotonic.Seq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val collect_has_at_index : r: FStar.HyperStack.ST.m_rref i (FStar.Seq.Base.seq a) FStar.Monotonic.Seq.grows ->
f: (_: a -> FStar.Seq.Base.seq b) ->
n: Prims.nat ->
v: b ->
h: FStar.Monotonic.HyperStack.mem
-> Prims.GTot Prims.logical | [] | FStar.Monotonic.Seq.collect_has_at_index | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
r: FStar.HyperStack.ST.m_rref i (FStar.Seq.Base.seq a) FStar.Monotonic.Seq.grows ->
f: (_: a -> FStar.Seq.Base.seq b) ->
n: Prims.nat ->
v: b ->
h: FStar.Monotonic.HyperStack.mem
-> Prims.GTot Prims.logical | {
"end_col": 35,
"end_line": 353,
"start_col": 27,
"start_line": 350
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let op_At s1 s2 = Seq.append s1 s2 | let op_At s1 s2 = | false | null | false | Seq.append s1 s2 | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"total"
] | [
"FStar.Seq.Base.seq",
"FStar.Seq.Base.append"
] | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val op_At : s1: FStar.Seq.Base.seq _ -> s2: FStar.Seq.Base.seq _ -> FStar.Seq.Base.seq _ | [] | FStar.Monotonic.Seq.op_At | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | s1: FStar.Seq.Base.seq _ -> s2: FStar.Seq.Base.seq _ -> FStar.Seq.Base.seq _ | {
"end_col": 42,
"end_line": 210,
"start_col": 26,
"start_line": 210
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let i_seq (r:rid) (a:Type) (p:seq a -> Type) = m_rref r (s:seq a{p s}) (grows_p p) | let i_seq (r: rid) (a: Type) (p: (seq a -> Type)) = | false | null | false | m_rref r (s: seq a {p s}) (grows_p p) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"total"
] | [
"FStar.Monotonic.Seq.rid",
"FStar.Seq.Base.seq",
"FStar.HyperStack.ST.m_rref",
"FStar.Monotonic.Seq.grows_p"
] | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val i_seq : r: FStar.Monotonic.Seq.rid -> a: Type0 -> p: (_: FStar.Seq.Base.seq a -> Type) -> Type0 | [] | FStar.Monotonic.Seq.i_seq | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | r: FStar.Monotonic.Seq.rid -> a: Type0 -> p: (_: FStar.Seq.Base.seq a -> Type) -> Type0 | {
"end_col": 82,
"end_line": 107,
"start_col": 47,
"start_line": 107
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let increases (x:int) (y:int) = b2t (x <= y) | let increases (x y: int) = | false | null | false | b2t (x <= y) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"total"
] | [
"Prims.int",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.logical"
] | [] | (*
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... | false | true | FStar.Monotonic.Seq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val increases : x: Prims.int -> y: Prims.int -> Prims.logical | [] | FStar.Monotonic.Seq.increases | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | x: Prims.int -> y: Prims.int -> Prims.logical | {
"end_col": 44,
"end_line": 368,
"start_col": 32,
"start_line": 368
} | |
Prims.GTot | val at_most_log_len: #l: rid -> #a: Type -> x: nat -> log: log_t l a -> mem -> GTot Type0 | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let at_most_log_len (#l:rid) (#a:Type) (x:nat) (log:log_t l a)
: mem -> GTot Type0
= fun h -> x <= Seq.length (HS.sel h log) | val at_most_log_len: #l: rid -> #a: Type -> x: nat -> log: log_t l a -> mem -> GTot Type0
let at_most_log_len (#l: rid) (#a: Type) (x: nat) (log: log_t l a) : mem -> GTot Type0 = | false | null | false | fun h -> x <= Seq.length (HS.sel h log) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"sometrivial"
] | [
"FStar.Monotonic.Seq.rid",
"Prims.nat",
"FStar.Monotonic.Seq.log_t",
"FStar.Monotonic.HyperStack.mem",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Seq.Base.length",
"FStar.Monotonic.HyperStack.sel",
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.grows"
] | [] | (*
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... | false | false | FStar.Monotonic.Seq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val at_most_log_len: #l: rid -> #a: Type -> x: nat -> log: log_t l a -> mem -> GTot Type0 | [] | FStar.Monotonic.Seq.at_most_log_len | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | x: Prims.nat -> log: FStar.Monotonic.Seq.log_t l a -> _: FStar.Monotonic.HyperStack.mem
-> Prims.GTot Type0 | {
"end_col": 45,
"end_line": 372,
"start_col": 6,
"start_line": 372
} |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let map_prefix (#a:Type) (#b:Type) (#i:rid)
(r:m_rref i (seq a) grows)
(f:a -> Tot b)
(bs:seq b)
(h:mem) =
grows bs (map f (HS.sel h r)) | let map_prefix
(#a #b: Type)
(#i: rid)
(r: m_rref i (seq a) grows)
(f: (a -> Tot b))
(bs: seq b)
(h: mem)
= | false | null | false | grows bs (map f (HS.sel h r)) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"total"
] | [
"FStar.Monotonic.Seq.rid",
"FStar.HyperStack.ST.m_rref",
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.grows",
"FStar.Monotonic.HyperStack.mem",
"FStar.Monotonic.Seq.map",
"FStar.Monotonic.HyperStack.sel"
] | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val map_prefix : r: FStar.HyperStack.ST.m_rref i (FStar.Seq.Base.seq a) FStar.Monotonic.Seq.grows ->
f: (_: a -> b) ->
bs: FStar.Seq.Base.seq b ->
h: FStar.Monotonic.HyperStack.mem
-> Type0 | [] | FStar.Monotonic.Seq.map_prefix | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
r: FStar.HyperStack.ST.m_rref i (FStar.Seq.Base.seq a) FStar.Monotonic.Seq.grows ->
f: (_: a -> b) ->
bs: FStar.Seq.Base.seq b ->
h: FStar.Monotonic.HyperStack.mem
-> Type0 | {
"end_col": 31,
"end_line": 269,
"start_col": 2,
"start_line": 269
} | |
FStar.Pervasives.Lemma | val at_least_is_stable (#a: Type) (#i: rid) (n: nat) (x: a) (r: m_rref i (seq a) grows)
: Lemma (ensures stable_on_t r (at_least n x r)) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let at_least_is_stable (#a:Type) (#i:rid) (n:nat) (x:a) (r:m_rref i (seq a) grows)
: Lemma (ensures stable_on_t r (at_least n x r))
= reveal_opaque (`%grows) (grows #a) | val at_least_is_stable (#a: Type) (#i: rid) (n: nat) (x: a) (r: m_rref i (seq a) grows)
: Lemma (ensures stable_on_t r (at_least n x r))
let at_least_is_stable (#a: Type) (#i: rid) (n: nat) (x: a) (r: m_rref i (seq a) grows)
: Lemma (ensures stable_on_t r (at_least n x r)) = | false | null | true | reveal_opaque (`%grows) (grows #a) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"lemma"
] | [
"FStar.Monotonic.Seq.rid",
"Prims.nat",
"FStar.HyperStack.ST.m_rref",
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.grows",
"FStar.Pervasives.reveal_opaque",
"FStar.Preorder.preorder",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"FStar.HyperStack.ST.stable_on_t",
"FStar.Monotonic.Seq.at_least",... | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val at_least_is_stable (#a: Type) (#i: rid) (n: nat) (x: a) (r: m_rref i (seq a) grows)
: Lemma (ensures stable_on_t r (at_least n x r)) | [] | FStar.Monotonic.Seq.at_least_is_stable | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
n: Prims.nat ->
x: a ->
r: FStar.HyperStack.ST.m_rref i (FStar.Seq.Base.seq a) FStar.Monotonic.Seq.grows
-> FStar.Pervasives.Lemma
(ensures FStar.HyperStack.ST.stable_on_t r (FStar.Monotonic.Seq.at_least n x r)) | {
"end_col": 38,
"end_line": 79,
"start_col": 4,
"start_line": 79
} |
FStar.Pervasives.Lemma | val lemma_snoc_extends (#a: Type) (s: seq a) (x: a)
: Lemma (requires True) (ensures (grows s (Seq.snoc s x))) [SMTPat (grows s (Seq.snoc s x))] | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let lemma_snoc_extends (#a:Type) (s:seq a) (x:a)
: Lemma (requires True)
(ensures (grows s (Seq.snoc s x)))
[SMTPat (grows s (Seq.snoc s x))]
= reveal_opaque (`%grows) (grows #a) | val lemma_snoc_extends (#a: Type) (s: seq a) (x: a)
: Lemma (requires True) (ensures (grows s (Seq.snoc s x))) [SMTPat (grows s (Seq.snoc s x))]
let lemma_snoc_extends (#a: Type) (s: seq a) (x: a)
: Lemma (requires True) (ensures (grows s (Seq.snoc s x))) [SMTPat (grows s (Seq.snoc s x))] = | false | null | true | reveal_opaque (`%grows) (grows #a) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"lemma"
] | [
"FStar.Seq.Base.seq",
"FStar.Pervasives.reveal_opaque",
"FStar.Preorder.preorder",
"FStar.Monotonic.Seq.grows",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"FStar.Seq.Properties.snoc",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"Prims.Nil"
] | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val lemma_snoc_extends (#a: Type) (s: seq a) (x: a)
: Lemma (requires True) (ensures (grows s (Seq.snoc s x))) [SMTPat (grows s (Seq.snoc s x))] | [] | FStar.Monotonic.Seq.lemma_snoc_extends | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | s: FStar.Seq.Base.seq a -> x: a
-> FStar.Pervasives.Lemma (ensures FStar.Monotonic.Seq.grows s (FStar.Seq.Properties.snoc s x))
[SMTPat (FStar.Monotonic.Seq.grows s (FStar.Seq.Properties.snoc s x))] | {
"end_col": 38,
"end_line": 59,
"start_col": 4,
"start_line": 59
} |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let at_least (#a:Type) (#i:rid) (n:nat) (x:a) (r:m_rref i (seq a) grows) (h:mem) =
Seq.length (HS.sel h r) > n
/\ Seq.index (HS.sel h r) n == x | let at_least (#a: Type) (#i: rid) (n: nat) (x: a) (r: m_rref i (seq a) grows) (h: mem) = | false | null | false | Seq.length (HS.sel h r) > n /\ Seq.index (HS.sel h r) n == x | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"total"
] | [
"FStar.Monotonic.Seq.rid",
"Prims.nat",
"FStar.HyperStack.ST.m_rref",
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.grows",
"FStar.Monotonic.HyperStack.mem",
"Prims.l_and",
"Prims.b2t",
"Prims.op_GreaterThan",
"FStar.Seq.Base.length",
"FStar.Monotonic.HyperStack.sel",
"Prims.eq2",
"FStar.Seq.Ba... | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val at_least : n: Prims.nat ->
x: a ->
r: FStar.HyperStack.ST.m_rref i (FStar.Seq.Base.seq a) FStar.Monotonic.Seq.grows ->
h: FStar.Monotonic.HyperStack.mem
-> Prims.logical | [] | FStar.Monotonic.Seq.at_least | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
n: Prims.nat ->
x: a ->
r: FStar.HyperStack.ST.m_rref i (FStar.Seq.Base.seq a) FStar.Monotonic.Seq.grows ->
h: FStar.Monotonic.HyperStack.mem
-> Prims.logical | {
"end_col": 34,
"end_line": 75,
"start_col": 4,
"start_line": 74
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let i_at_least (#r:rid) (#a:Type) (#p:(seq a -> Type)) (n:nat) (x:a) (m:i_seq r a p) (h:mem) =
Seq.length (HS.sel h m) > n
/\ Seq.index (HS.sel h m) n == x | let i_at_least (#r: rid) (#a: Type) (#p: (seq a -> Type)) (n: nat) (x: a) (m: i_seq r a p) (h: mem) = | false | null | false | Seq.length (HS.sel h m) > n /\ Seq.index (HS.sel h m) n == x | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"total"
] | [
"FStar.Monotonic.Seq.rid",
"FStar.Seq.Base.seq",
"Prims.nat",
"FStar.Monotonic.Seq.i_seq",
"FStar.Monotonic.HyperStack.mem",
"Prims.l_and",
"Prims.b2t",
"Prims.op_GreaterThan",
"FStar.Seq.Base.length",
"FStar.Monotonic.HyperStack.sel",
"FStar.Monotonic.Seq.grows_p",
"Prims.eq2",
"FStar.Seq.B... | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val i_at_least : n: Prims.nat -> x: a -> m: FStar.Monotonic.Seq.i_seq r a p -> h: FStar.Monotonic.HyperStack.mem
-> Prims.logical | [] | FStar.Monotonic.Seq.i_at_least | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | n: Prims.nat -> x: a -> m: FStar.Monotonic.Seq.i_seq r a p -> h: FStar.Monotonic.HyperStack.mem
-> Prims.logical | {
"end_col": 38,
"end_line": 117,
"start_col": 8,
"start_line": 116
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let invariant (s:seq nat) =
forall (i:nat) (j:nat). i < Seq.length s /\ j < Seq.length s /\ i<>j
==> Seq.index s i <> Seq.index s j | let invariant (s: seq nat) = | false | null | false | forall (i: nat) (j: nat).
i < Seq.length s /\ j < Seq.length s /\ i <> j ==> Seq.index s i <> Seq.index s j | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"total"
] | [
"FStar.Seq.Base.seq",
"Prims.nat",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Seq.Base.length",
"Prims.op_disEquality",
"FStar.Seq.Base.index",
"Prims.logical"
] | [] | (*
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... | false | true | FStar.Monotonic.Seq.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... | null | val invariant : s: FStar.Seq.Base.seq Prims.nat -> Prims.logical | [] | FStar.Monotonic.Seq.invariant | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | s: FStar.Seq.Base.seq Prims.nat -> Prims.logical | {
"end_col": 37,
"end_line": 167,
"start_col": 2,
"start_line": 166
} | |
Prims.Tot | val grows_aux (#a: Type) : Preorder.preorder (seq a) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let grows_aux (#a:Type) :Preorder.preorder (seq a)
= fun (s1:seq a) (s2:seq a) ->
length s1 <= length s2 /\
(forall (i:nat).{:pattern (Seq.index s1 i) \/ (Seq.index s2 i)} i < length s1 ==> index s1 i == index s2 i) | val grows_aux (#a: Type) : Preorder.preorder (seq a)
let grows_aux (#a: Type) : Preorder.preorder (seq a) = | false | null | false | fun (s1: seq a) (s2: seq a) ->
length s1 <= length s2 /\
(forall (i: nat). {:pattern (Seq.index s1 i)\/(Seq.index s2 i)}
i < length s1 ==> index s1 i == index s2 i) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"total"
] | [
"FStar.Seq.Base.seq",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Seq.Base.length",
"Prims.l_Forall",
"Prims.nat",
"Prims.l_imp",
"Prims.op_LessThan",
"Prims.eq2",
"FStar.Seq.Base.index",
"Prims.logical",
"FStar.Preorder.preorder"
] | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val grows_aux (#a: Type) : Preorder.preorder (seq a) | [] | FStar.Monotonic.Seq.grows_aux | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | FStar.Preorder.preorder (FStar.Seq.Base.seq a) | {
"end_col": 111,
"end_line": 44,
"start_col": 4,
"start_line": 42
} |
FStar.HyperStack.ST.ST | val alloc_mref_seq (#a: Type) (r: rid) (init: seq a)
: ST (m_rref r (seq a) grows)
(requires (fun _ -> HST.witnessed (region_contains_pred r)))
(ensures
(fun h0 m h1 -> HS.contains h1 m /\ HS.sel h1 m == init /\ HST.ralloc_post r init h0 m h1)) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let alloc_mref_seq (#a:Type) (r:rid) (init:seq a)
: ST (m_rref r (seq a) grows)
(requires (fun _ -> HST.witnessed (region_contains_pred r)))
(ensures (fun h0 m h1 ->
HS.contains h1 m /\
HS.sel h1 m == init /\
HST.ralloc_post r init h0 m h1))
= ralloc r init | val alloc_mref_seq (#a: Type) (r: rid) (init: seq a)
: ST (m_rref r (seq a) grows)
(requires (fun _ -> HST.witnessed (region_contains_pred r)))
(ensures
(fun h0 m h1 -> HS.contains h1 m /\ HS.sel h1 m == init /\ HST.ralloc_post r init h0 m h1))
let alloc_mref_seq (#a: Type) (r: rid) (init: seq a... | true | null | false | ralloc r init | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [] | [
"FStar.Monotonic.Seq.rid",
"FStar.Seq.Base.seq",
"FStar.HyperStack.ST.ralloc",
"FStar.Monotonic.Seq.grows",
"FStar.HyperStack.ST.mref",
"FStar.HyperStack.ST.m_rref",
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.ST.witnessed",
"FStar.HyperStack.ST.region_contains_pred",
"Prims.l_and",
"FSt... | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val alloc_mref_seq (#a: Type) (r: rid) (init: seq a)
: ST (m_rref r (seq a) grows)
(requires (fun _ -> HST.witnessed (region_contains_pred r)))
(ensures
(fun h0 m h1 -> HS.contains h1 m /\ HS.sel h1 m == init /\ HST.ralloc_post r init h0 m h1)) | [] | FStar.Monotonic.Seq.alloc_mref_seq | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | r: FStar.Monotonic.Seq.rid -> init: FStar.Seq.Base.seq a
-> FStar.HyperStack.ST.ST
(FStar.HyperStack.ST.m_rref r (FStar.Seq.Base.seq a) FStar.Monotonic.Seq.grows) | {
"end_col": 17,
"end_line": 68,
"start_col": 4,
"start_line": 68
} |
Prims.Tot | val un_snoc: #a: Type -> s:seq a {Seq.length s > 0} -> Tot(seq a * a) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let un_snoc #a s =
let last = Seq.length s - 1 in
Seq.slice s 0 last, Seq.index s last | val un_snoc: #a: Type -> s:seq a {Seq.length s > 0} -> Tot(seq a * a)
let un_snoc #a s = | false | null | false | let last = Seq.length s - 1 in
Seq.slice s 0 last, Seq.index s last | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"total"
] | [
"FStar.Seq.Base.seq",
"Prims.b2t",
"Prims.op_GreaterThan",
"FStar.Seq.Base.length",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Seq.Base.slice",
"FStar.Seq.Base.index",
"Prims.int",
"Prims.op_Subtraction",
"FStar.Pervasives.Native.tuple2"
] | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val un_snoc: #a: Type -> s:seq a {Seq.length s > 0} -> Tot(seq a * a) | [] | FStar.Monotonic.Seq.un_snoc | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | s: FStar.Seq.Base.seq a {FStar.Seq.Base.length s > 0} -> FStar.Seq.Base.seq a * a | {
"end_col": 38,
"end_line": 195,
"start_col": 18,
"start_line": 193
} |
Prims.Tot | val grows_p (#a: Type) (p: (seq a -> Type)) : Preorder.preorder (s: seq a {p s}) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let grows_p (#a:Type) (p:seq a -> Type) :Preorder.preorder (s:seq a{p s}) =
fun s1 s2 -> grows s1 s2 | val grows_p (#a: Type) (p: (seq a -> Type)) : Preorder.preorder (s: seq a {p s})
let grows_p (#a: Type) (p: (seq a -> Type)) : Preorder.preorder (s: seq a {p s}) = | false | null | false | fun s1 s2 -> grows s1 s2 | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"total"
] | [
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.grows",
"FStar.Preorder.preorder"
] | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val grows_p (#a: Type) (p: (seq a -> Type)) : Preorder.preorder (s: seq a {p s}) | [] | FStar.Monotonic.Seq.grows_p | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | p: (_: FStar.Seq.Base.seq a -> Type) -> FStar.Preorder.preorder (s: FStar.Seq.Base.seq a {p s}) | {
"end_col": 26,
"end_line": 105,
"start_col": 2,
"start_line": 105
} |
FStar.Pervasives.Lemma | val map_grows (#a #b: Type) (f: (a -> Tot b)) (s1 s3: seq a)
: Lemma (grows s1 s3 ==> grows (map f s1) (map f s3)) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let map_grows (#a:Type) (#b:Type) (f:a -> Tot b)
(s1:seq a) (s3:seq a)
: Lemma (grows s1 s3
==> grows (map f s1) (map f s3))
= reveal_opaque (`%grows) (grows #a);
reveal_opaque (`%grows) (grows #b) | val map_grows (#a #b: Type) (f: (a -> Tot b)) (s1 s3: seq a)
: Lemma (grows s1 s3 ==> grows (map f s1) (map f s3))
let map_grows (#a #b: Type) (f: (a -> Tot b)) (s1 s3: seq a)
: Lemma (grows s1 s3 ==> grows (map f s1) (map f s3)) = | false | null | true | reveal_opaque (`%grows) (grows #a);
reveal_opaque (`%grows) (grows #b) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"lemma"
] | [
"FStar.Seq.Base.seq",
"FStar.Pervasives.reveal_opaque",
"FStar.Preorder.preorder",
"FStar.Monotonic.Seq.grows",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_imp",
"FStar.Monotonic.Seq.map",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val map_grows (#a #b: Type) (f: (a -> Tot b)) (s1 s3: seq a)
: Lemma (grows s1 s3 ==> grows (map f s1) (map f s3)) | [] | FStar.Monotonic.Seq.map_grows | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: (_: a -> b) -> s1: FStar.Seq.Base.seq a -> s3: FStar.Seq.Base.seq a
-> FStar.Pervasives.Lemma
(ensures
FStar.Monotonic.Seq.grows s1 s3 ==>
FStar.Monotonic.Seq.grows (FStar.Monotonic.Seq.map f s1) (FStar.Monotonic.Seq.map f s3)) | {
"end_col": 38,
"end_line": 262,
"start_col": 4,
"start_line": 261
} |
FStar.Pervasives.Lemma | val collect_snoc: f:('a -> Tot (seq 'b)) -> s:seq 'a -> a:'a -> Lemma
(collect f (Seq.snoc s a) == Seq.append (collect f s) (f a)) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let collect_snoc f s a =
let prefix, last = un_snoc (Seq.snoc s a) in
cut (Seq.equal prefix s) | val collect_snoc: f:('a -> Tot (seq 'b)) -> s:seq 'a -> a:'a -> Lemma
(collect f (Seq.snoc s a) == Seq.append (collect f s) (f a))
let collect_snoc f s a = | false | null | true | let prefix, last = un_snoc (Seq.snoc s a) in
cut (Seq.equal prefix s) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"lemma"
] | [
"FStar.Seq.Base.seq",
"Prims.cut",
"FStar.Seq.Base.equal",
"Prims.unit",
"FStar.Pervasives.Native.tuple2",
"FStar.Monotonic.Seq.un_snoc",
"FStar.Seq.Properties.snoc"
] | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val collect_snoc: f:('a -> Tot (seq 'b)) -> s:seq 'a -> a:'a -> Lemma
(collect f (Seq.snoc s a) == Seq.append (collect f s) (f a)) | [] | FStar.Monotonic.Seq.collect_snoc | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: (_: 'a -> FStar.Seq.Base.seq 'b) -> s: FStar.Seq.Base.seq 'a -> a: 'a
-> FStar.Pervasives.Lemma
(ensures
FStar.Monotonic.Seq.collect f (FStar.Seq.Properties.snoc s a) ==
FStar.Seq.Base.append (FStar.Monotonic.Seq.collect f s) (f a)) | {
"end_col": 26,
"end_line": 308,
"start_col": 24,
"start_line": 306
} |
FStar.Pervasives.Lemma | val map_prefix_stable
(#a #b: Type)
(#i: rid)
(r: m_rref i (seq a) grows)
(f: (a -> Tot b))
(bs: seq b)
: Lemma (stable_on_t r (map_prefix r f bs)) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let map_prefix_stable (#a:Type) (#b:Type) (#i:rid) (r:m_rref i (seq a) grows) (f:a -> Tot b) (bs:seq b)
:Lemma (stable_on_t r (map_prefix r f bs))
= reveal_opaque (`%grows) (grows #a);
reveal_opaque (`%grows) (grows #b) | val map_prefix_stable
(#a #b: Type)
(#i: rid)
(r: m_rref i (seq a) grows)
(f: (a -> Tot b))
(bs: seq b)
: Lemma (stable_on_t r (map_prefix r f bs))
let map_prefix_stable
(#a #b: Type)
(#i: rid)
(r: m_rref i (seq a) grows)
(f: (a -> Tot b))
(bs: seq b)
... | false | null | true | reveal_opaque (`%grows) (grows #a);
reveal_opaque (`%grows) (grows #b) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"lemma"
] | [
"FStar.Monotonic.Seq.rid",
"FStar.HyperStack.ST.m_rref",
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.grows",
"FStar.Pervasives.reveal_opaque",
"FStar.Preorder.preorder",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"FStar.HyperStack.ST.stable_on_t",
"FStar.Monotonic.Seq.map_prefix",
"Prims.Nil... | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val map_prefix_stable
(#a #b: Type)
(#i: rid)
(r: m_rref i (seq a) grows)
(f: (a -> Tot b))
(bs: seq b)
: Lemma (stable_on_t r (map_prefix r f bs)) | [] | FStar.Monotonic.Seq.map_prefix_stable | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
r: FStar.HyperStack.ST.m_rref i (FStar.Seq.Base.seq a) FStar.Monotonic.Seq.grows ->
f: (_: a -> b) ->
bs: FStar.Seq.Base.seq b
-> FStar.Pervasives.Lemma
(ensures FStar.HyperStack.ST.stable_on_t r (FStar.Monotonic.Seq.map_prefix r f bs)) | {
"end_col": 38,
"end_line": 275,
"start_col": 4,
"start_line": 274
} |
FStar.Pervasives.Lemma | val int_at_most_is_stable (#r: rid) (#a: Type) (#p: (seq a -> Type)) (is: i_seq r a p) (k: int)
: Lemma (ensures stable_on_t is (int_at_most k is)) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let int_at_most_is_stable (#r:rid) (#a:Type) (#p:seq a -> Type) (is:i_seq r a p) (k:int)
: Lemma (ensures stable_on_t is (int_at_most k is))
= reveal_opaque (`%grows) (grows #a) | val int_at_most_is_stable (#r: rid) (#a: Type) (#p: (seq a -> Type)) (is: i_seq r a p) (k: int)
: Lemma (ensures stable_on_t is (int_at_most k is))
let int_at_most_is_stable (#r: rid) (#a: Type) (#p: (seq a -> Type)) (is: i_seq r a p) (k: int)
: Lemma (ensures stable_on_t is (int_at_most k is)) = | false | null | true | reveal_opaque (`%grows) (grows #a) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"lemma"
] | [
"FStar.Monotonic.Seq.rid",
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.i_seq",
"Prims.int",
"FStar.Pervasives.reveal_opaque",
"FStar.Preorder.preorder",
"FStar.Monotonic.Seq.grows",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"FStar.HyperStack.ST.stable_on_t",
"FStar.Monotonic.Seq.grows_p",
... | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val int_at_most_is_stable (#r: rid) (#a: Type) (#p: (seq a -> Type)) (is: i_seq r a p) (k: int)
: Lemma (ensures stable_on_t is (int_at_most k is)) | [] | FStar.Monotonic.Seq.int_at_most_is_stable | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | is: FStar.Monotonic.Seq.i_seq r a p -> k: Prims.int
-> FStar.Pervasives.Lemma
(ensures FStar.HyperStack.ST.stable_on_t is (FStar.Monotonic.Seq.int_at_most k is)) | {
"end_col": 38,
"end_line": 128,
"start_col": 4,
"start_line": 128
} |
FStar.HyperStack.ST.ST | val test0: r:rid -> a:m_rref r (seq nat) grows -> k:nat -> ST unit
(requires (fun h -> k < Seq.length (HS.sel h a)))
(ensures (fun h0 result h1 -> True)) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let test0 r a k =
let h0 = HST.get() in
let _ =
let s = HS.sel h0 a in
at_least_is_stable k (Seq.index (HS.sel h0 a) k) a;
Seq.contains_intro s k (Seq.index s k) in
mr_witness a (at_least k (Seq.index (HS.sel h0 a) k) a) | val test0: r:rid -> a:m_rref r (seq nat) grows -> k:nat -> ST unit
(requires (fun h -> k < Seq.length (HS.sel h a)))
(ensures (fun h0 result h1 -> True))
let test0 r a k = | true | null | false | let h0 = HST.get () in
let _ =
let s = HS.sel h0 a in
at_least_is_stable k (Seq.index (HS.sel h0 a) k) a;
Seq.contains_intro s k (Seq.index s k)
in
mr_witness a (at_least k (Seq.index (HS.sel h0 a) k) a) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [] | [
"FStar.Monotonic.Seq.rid",
"FStar.HyperStack.ST.m_rref",
"FStar.Seq.Base.seq",
"Prims.nat",
"FStar.Monotonic.Seq.grows",
"FStar.HyperStack.ST.mr_witness",
"FStar.Monotonic.Seq.at_least",
"FStar.Seq.Base.index",
"FStar.Monotonic.HyperStack.sel",
"Prims.unit",
"FStar.Seq.Properties.contains_intro"... | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val test0: r:rid -> a:m_rref r (seq nat) grows -> k:nat -> ST unit
(requires (fun h -> k < Seq.length (HS.sel h a)))
(ensures (fun h0 result h1 -> True)) | [] | FStar.Monotonic.Seq.test0 | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
r: FStar.Monotonic.Seq.rid ->
a: FStar.HyperStack.ST.m_rref r (FStar.Seq.Base.seq Prims.nat) FStar.Monotonic.Seq.grows ->
k: Prims.nat
-> FStar.HyperStack.ST.ST Prims.unit | {
"end_col": 57,
"end_line": 178,
"start_col": 17,
"start_line": 172
} |
Prims.GTot | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let map_has_at_index (#a:Type) (#b:Type) (#i:rid)
(r:m_rref i (seq a) grows)
(f:a -> Tot b)
(n:nat) (v:b) (h:mem) =
let s = HS.sel h r in
n < Seq.length s
/\ Seq.index (map f s) n == v | let map_has_at_index
(#a #b: Type)
(#i: rid)
(r: m_rref i (seq a) grows)
(f: (a -> Tot b))
(n: nat)
(v: b)
(h: mem)
= | false | null | false | let s = HS.sel h r in
n < Seq.length s /\ Seq.index (map f s) n == v | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"sometrivial"
] | [
"FStar.Monotonic.Seq.rid",
"FStar.HyperStack.ST.m_rref",
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.grows",
"Prims.nat",
"FStar.Monotonic.HyperStack.mem",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Seq.Base.length",
"Prims.eq2",
"FStar.Seq.Base.index",
"FStar.Monotonic.Seq.map",... | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val map_has_at_index : r: FStar.HyperStack.ST.m_rref i (FStar.Seq.Base.seq a) FStar.Monotonic.Seq.grows ->
f: (_: a -> b) ->
n: Prims.nat ->
v: b ->
h: FStar.Monotonic.HyperStack.mem
-> Prims.GTot Prims.logical | [] | FStar.Monotonic.Seq.map_has_at_index | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
r: FStar.HyperStack.ST.m_rref i (FStar.Seq.Base.seq a) FStar.Monotonic.Seq.grows ->
f: (_: a -> b) ->
n: Prims.nat ->
v: b ->
h: FStar.Monotonic.HyperStack.mem
-> Prims.GTot Prims.logical | {
"end_col": 31,
"end_line": 283,
"start_col": 30,
"start_line": 280
} | |
FStar.HyperStack.ST.ST | val i_read (#a: Type) (#p: (Seq.seq a -> Type)) (#r: rid) (m: i_seq r a p)
: ST (s: seq a {p s})
(requires (fun h -> True))
(ensures (fun h0 x h1 -> h0 == h1 /\ x == i_sel h0 m)) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let i_read (#a:Type) (#p:Seq.seq a -> Type) (#r:rid) (m:i_seq r a p)
: ST (s:seq a{p s})
(requires (fun h -> True))
(ensures (fun h0 x h1 -> h0==h1 /\ x == i_sel h0 m))
= !m | val i_read (#a: Type) (#p: (Seq.seq a -> Type)) (#r: rid) (m: i_seq r a p)
: ST (s: seq a {p s})
(requires (fun h -> True))
(ensures (fun h0 x h1 -> h0 == h1 /\ x == i_sel h0 m))
let i_read (#a: Type) (#p: (Seq.seq a -> Type)) (#r: rid) (m: i_seq r a p)
: ST (s: seq a {p s})
(requires (fun h -... | true | null | false | !m | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [] | [
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.rid",
"FStar.Monotonic.Seq.i_seq",
"FStar.HyperStack.ST.op_Bang",
"FStar.Monotonic.Seq.grows_p",
"FStar.Monotonic.HyperStack.mem",
"Prims.l_True",
"Prims.l_and",
"Prims.eq2",
"Prims.l_or",
"Prims.squash",
"FStar.Monotonic.Seq.i_sel"
] | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val i_read (#a: Type) (#p: (Seq.seq a -> Type)) (#r: rid) (m: i_seq r a p)
: ST (s: seq a {p s})
(requires (fun h -> True))
(ensures (fun h0 x h1 -> h0 == h1 /\ x == i_sel h0 m)) | [] | FStar.Monotonic.Seq.i_read | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | m: FStar.Monotonic.Seq.i_seq r a p -> FStar.HyperStack.ST.ST (s: FStar.Seq.Base.seq a {p s}) | {
"end_col": 6,
"end_line": 138,
"start_col": 4,
"start_line": 138
} |
Prims.Tot | val collect: ('a -> Tot (seq 'b)) -> s:seq 'a -> Tot (seq 'b)
(decreases (Seq.length s)) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let rec collect f s =
if Seq.length s = 0 then Seq.empty
else let prefix, last = un_snoc s in
Seq.append (collect f prefix) (f last) | val collect: ('a -> Tot (seq 'b)) -> s:seq 'a -> Tot (seq 'b)
(decreases (Seq.length s))
let rec collect f s = | false | null | false | if Seq.length s = 0
then Seq.empty
else
let prefix, last = un_snoc s in
Seq.append (collect f prefix) (f last) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"total",
""
] | [
"FStar.Seq.Base.seq",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"FStar.Seq.Base.empty",
"Prims.bool",
"FStar.Seq.Base.append",
"FStar.Monotonic.Seq.collect",
"FStar.Pervasives.Native.tuple2",
"FStar.Monotonic.Seq.un_snoc"
] | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val collect: ('a -> Tot (seq 'b)) -> s:seq 'a -> Tot (seq 'b)
(decreases (Seq.length s)) | [
"recursion"
] | FStar.Monotonic.Seq.collect | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: (_: 'a -> FStar.Seq.Base.seq 'b) -> s: FStar.Seq.Base.seq 'a -> Prims.Tot (FStar.Seq.Base.seq 'b) | {
"end_col": 45,
"end_line": 302,
"start_col": 2,
"start_line": 300
} |
FStar.HyperStack.ST.ST | val alloc_mref_iseq (#a: Type) (p: (seq a -> Type)) (r: rid) (init: seq a {p init})
: ST (i_seq r a p)
(requires (fun _ -> HST.witnessed (region_contains_pred r)))
(ensures (fun h0 m h1 -> HST.ralloc_post r init h0 m h1)) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let alloc_mref_iseq (#a:Type) (p:seq a -> Type) (r:rid) (init:seq a{p init})
: ST (i_seq r a p)
(requires (fun _ -> HST.witnessed (region_contains_pred r)))
(ensures (fun h0 m h1 -> HST.ralloc_post r init h0 m h1))
= ralloc r init | val alloc_mref_iseq (#a: Type) (p: (seq a -> Type)) (r: rid) (init: seq a {p init})
: ST (i_seq r a p)
(requires (fun _ -> HST.witnessed (region_contains_pred r)))
(ensures (fun h0 m h1 -> HST.ralloc_post r init h0 m h1))
let alloc_mref_iseq (#a: Type) (p: (seq a -> Type)) (r: rid) (init: seq a {p init}... | true | null | false | ralloc r init | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [] | [
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.rid",
"FStar.HyperStack.ST.ralloc",
"FStar.Monotonic.Seq.grows_p",
"FStar.HyperStack.ST.mref",
"FStar.Monotonic.Seq.i_seq",
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.ST.witnessed",
"FStar.HyperStack.ST.region_contains_pred",
"FStar.HyperStack.ST... | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val alloc_mref_iseq (#a: Type) (p: (seq a -> Type)) (r: rid) (init: seq a {p init})
: ST (i_seq r a p)
(requires (fun _ -> HST.witnessed (region_contains_pred r)))
(ensures (fun h0 m h1 -> HST.ralloc_post r init h0 m h1)) | [] | FStar.Monotonic.Seq.alloc_mref_iseq | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
p: (_: FStar.Seq.Base.seq a -> Type) ->
r: FStar.Monotonic.Seq.rid ->
init: FStar.Seq.Base.seq a {p init}
-> FStar.HyperStack.ST.ST (FStar.Monotonic.Seq.i_seq r a p) | {
"end_col": 17,
"end_line": 113,
"start_col": 4,
"start_line": 113
} |
FStar.Pervasives.Lemma | val map_snoc: f:('a -> Tot 'b) -> s:seq 'a -> a:'a -> Lemma
(map f (Seq.snoc s a) == Seq.snoc (map f s) (f a)) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let map_snoc f s a =
let prefix, last = un_snoc (Seq.snoc s a) in
cut (Seq.equal prefix s) | val map_snoc: f:('a -> Tot 'b) -> s:seq 'a -> a:'a -> Lemma
(map f (Seq.snoc s a) == Seq.snoc (map f s) (f a))
let map_snoc f s a = | false | null | true | let prefix, last = un_snoc (Seq.snoc s a) in
cut (Seq.equal prefix s) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"lemma"
] | [
"FStar.Seq.Base.seq",
"Prims.cut",
"FStar.Seq.Base.equal",
"Prims.unit",
"FStar.Pervasives.Native.tuple2",
"FStar.Monotonic.Seq.un_snoc",
"FStar.Seq.Properties.snoc"
] | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val map_snoc: f:('a -> Tot 'b) -> s:seq 'a -> a:'a -> Lemma
(map f (Seq.snoc s a) == Seq.snoc (map f s) (f a)) | [] | FStar.Monotonic.Seq.map_snoc | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: (_: 'a -> 'b) -> s: FStar.Seq.Base.seq 'a -> a: 'a
-> FStar.Pervasives.Lemma
(ensures
FStar.Monotonic.Seq.map f (FStar.Seq.Properties.snoc s a) ==
FStar.Seq.Properties.snoc (FStar.Monotonic.Seq.map f s) (f a)) | {
"end_col": 26,
"end_line": 208,
"start_col": 20,
"start_line": 206
} |
FStar.Pervasives.Lemma | val map_has_at_index_stable
(#a #b: Type)
(#i: rid)
(r: m_rref i (seq a) grows)
(f: (a -> Tot b))
(n: nat)
(v: b)
: Lemma (stable_on_t r (map_has_at_index r f n v)) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let map_has_at_index_stable (#a:Type) (#b:Type) (#i:rid)
(r:m_rref i (seq a) grows)
(f:a -> Tot b) (n:nat) (v:b)
: Lemma (stable_on_t r (map_has_at_index r f n v))
= reveal_opaque (`%grows) (grows #a) | val map_has_at_index_stable
(#a #b: Type)
(#i: rid)
(r: m_rref i (seq a) grows)
(f: (a -> Tot b))
(n: nat)
(v: b)
: Lemma (stable_on_t r (map_has_at_index r f n v))
let map_has_at_index_stable
(#a #b: Type)
(#i: rid)
(r: m_rref i (seq a) grows)
(f: (a -> T... | false | null | true | reveal_opaque (`%grows) (grows #a) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"lemma"
] | [
"FStar.Monotonic.Seq.rid",
"FStar.HyperStack.ST.m_rref",
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.grows",
"Prims.nat",
"FStar.Pervasives.reveal_opaque",
"FStar.Preorder.preorder",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"FStar.HyperStack.ST.stable_on_t",
"FStar.Monotonic.Seq.map_has_at... | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val map_has_at_index_stable
(#a #b: Type)
(#i: rid)
(r: m_rref i (seq a) grows)
(f: (a -> Tot b))
(n: nat)
(v: b)
: Lemma (stable_on_t r (map_has_at_index r f n v)) | [] | FStar.Monotonic.Seq.map_has_at_index_stable | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
r: FStar.HyperStack.ST.m_rref i (FStar.Seq.Base.seq a) FStar.Monotonic.Seq.grows ->
f: (_: a -> b) ->
n: Prims.nat ->
v: b
-> FStar.Pervasives.Lemma
(ensures FStar.HyperStack.ST.stable_on_t r (FStar.Monotonic.Seq.map_has_at_index r f n v)) | {
"end_col": 38,
"end_line": 289,
"start_col": 4,
"start_line": 289
} |
FStar.HyperStack.ST.ST | val itest: r:rid -> a:i_seq r nat invariant -> k:nat -> ST unit
(requires (fun h -> k < Seq.length (i_sel h a)))
(ensures (fun h0 result h1 -> True)) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let itest r a k =
let h0 = HST.get() in
i_at_least_is_stable k (Seq.index (i_sel h0 a) k) a;
mr_witness a (i_at_least k (Seq.index (i_sel h0 a) k) a) | val itest: r:rid -> a:i_seq r nat invariant -> k:nat -> ST unit
(requires (fun h -> k < Seq.length (i_sel h a)))
(ensures (fun h0 result h1 -> True))
let itest r a k = | true | null | false | let h0 = HST.get () in
i_at_least_is_stable k (Seq.index (i_sel h0 a) k) a;
mr_witness a (i_at_least k (Seq.index (i_sel h0 a) k) a) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [] | [
"FStar.Monotonic.Seq.rid",
"FStar.Monotonic.Seq.i_seq",
"Prims.nat",
"FStar.Monotonic.Seq.invariant",
"FStar.HyperStack.ST.mr_witness",
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.grows_p",
"FStar.Monotonic.Seq.i_at_least",
"FStar.Seq.Base.index",
"FStar.Monotonic.Seq.i_sel",
"Prims.unit",
"FSt... | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val itest: r:rid -> a:i_seq r nat invariant -> k:nat -> ST unit
(requires (fun h -> k < Seq.length (i_sel h a)))
(ensures (fun h0 result h1 -> True)) | [] | FStar.Monotonic.Seq.itest | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
r: FStar.Monotonic.Seq.rid ->
a: FStar.Monotonic.Seq.i_seq r Prims.nat FStar.Monotonic.Seq.invariant ->
k: Prims.nat
-> FStar.HyperStack.ST.ST Prims.unit | {
"end_col": 58,
"end_line": 186,
"start_col": 17,
"start_line": 183
} |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let test (i:rid) (l:rid) (a:Type0) (log:log_t l a) //(p:(nat -> Type))
(r:seqn i log 8) (h:mem)
= assert (HS.sel h r = Heap.sel (FStar.Map.sel (HS.get_hmap h) i) (HS.as_ref r)) | let test (i l: rid) (a: Type0) (log: log_t l a) (r: seqn i log 8) (h: mem) = | false | null | false | assert (HS.sel h r = Heap.sel (FStar.Map.sel (HS.get_hmap h) i) (HS.as_ref r)) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"total"
] | [
"FStar.Monotonic.Seq.rid",
"FStar.Monotonic.Seq.log_t",
"FStar.Monotonic.Seq.seqn",
"FStar.Monotonic.HyperStack.mem",
"Prims._assert",
"Prims.b2t",
"Prims.op_Equality",
"FStar.Monotonic.Seq.seqn_val",
"FStar.Monotonic.HyperStack.sel",
"FStar.Monotonic.Seq.increases",
"FStar.Monotonic.Heap.sel",
... | [] | (*
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... | false | false | FStar.Monotonic.Seq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val test : i: FStar.Monotonic.Seq.rid ->
l: FStar.Monotonic.Seq.rid ->
a: Type0 ->
log: FStar.Monotonic.Seq.log_t l a ->
r: FStar.Monotonic.Seq.seqn i log 8 ->
h: FStar.Monotonic.HyperStack.mem
-> Prims.unit | [] | FStar.Monotonic.Seq.test | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
i: FStar.Monotonic.Seq.rid ->
l: FStar.Monotonic.Seq.rid ->
a: Type0 ->
log: FStar.Monotonic.Seq.log_t l a ->
r: FStar.Monotonic.Seq.seqn i log 8 ->
h: FStar.Monotonic.HyperStack.mem
-> Prims.unit | {
"end_col": 82,
"end_line": 435,
"start_col": 4,
"start_line": 435
} | |
Prims.Tot | val map: ('a -> Tot 'b) -> s:seq 'a -> Tot (seq 'b)
(decreases (Seq.length s)) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let rec map f s =
if Seq.length s = 0 then Seq.empty
else let prefix, last = un_snoc s in
Seq.snoc (map f prefix) (f last) | val map: ('a -> Tot 'b) -> s:seq 'a -> Tot (seq 'b)
(decreases (Seq.length s))
let rec map f s = | false | null | false | if Seq.length s = 0
then Seq.empty
else
let prefix, last = un_snoc s in
Seq.snoc (map f prefix) (f last) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"total",
""
] | [
"FStar.Seq.Base.seq",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"FStar.Seq.Base.empty",
"Prims.bool",
"FStar.Seq.Properties.snoc",
"FStar.Monotonic.Seq.map",
"FStar.Pervasives.Native.tuple2",
"FStar.Monotonic.Seq.un_snoc"
] | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val map: ('a -> Tot 'b) -> s:seq 'a -> Tot (seq 'b)
(decreases (Seq.length s)) | [
"recursion"
] | FStar.Monotonic.Seq.map | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: (_: 'a -> 'b) -> s: FStar.Seq.Base.seq 'a -> Prims.Tot (FStar.Seq.Base.seq 'b) | {
"end_col": 39,
"end_line": 202,
"start_col": 2,
"start_line": 200
} |
FStar.Pervasives.Lemma | val collect_prefix_stable
(#a #b: Type)
(#i: rid)
(r: m_rref i (seq a) grows)
(f: (a -> Tot (seq b)))
(bs: seq b)
: Lemma (stable_on_t r (collect_prefix r f bs)) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let collect_prefix_stable (#a:Type) (#b:Type) (#i:rid) (r:m_rref i (seq a) grows) (f:a -> Tot (seq b)) (bs:seq b)
: Lemma (stable_on_t r (collect_prefix r f bs))
= let aux : h0:mem -> h1:mem -> Lemma
(collect_prefix r f bs h0
/\ grows (HS.sel h0 r) (HS.sel h1 r)
==> collect_prefix r f bs h1) =
... | val collect_prefix_stable
(#a #b: Type)
(#i: rid)
(r: m_rref i (seq a) grows)
(f: (a -> Tot (seq b)))
(bs: seq b)
: Lemma (stable_on_t r (collect_prefix r f bs))
let collect_prefix_stable
(#a #b: Type)
(#i: rid)
(r: m_rref i (seq a) grows)
(f: (a -> Tot (seq b))... | false | null | true | let aux: h0: mem -> h1: mem
-> Lemma
(collect_prefix r f bs h0 /\ grows (HS.sel h0 r) (HS.sel h1 r) ==> collect_prefix r f bs h1) =
fun h0 h1 ->
let s1 = HS.sel h0 r in
let s3 = HS.sel h1 r in
collect_grows f s1 s3
in
forall_intro_2 aux | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"lemma"
] | [
"FStar.Monotonic.Seq.rid",
"FStar.HyperStack.ST.m_rref",
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.grows",
"FStar.Classical.forall_intro_2",
"FStar.Monotonic.HyperStack.mem",
"Prims.l_imp",
"Prims.l_and",
"FStar.Monotonic.Seq.collect_prefix",
"FStar.Monotonic.HyperStack.sel",
"Prims.unit",
"P... | [] | (*
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... | false | false | FStar.Monotonic.Seq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val collect_prefix_stable
(#a #b: Type)
(#i: rid)
(r: m_rref i (seq a) grows)
(f: (a -> Tot (seq b)))
(bs: seq b)
: Lemma (stable_on_t r (collect_prefix r f bs)) | [] | FStar.Monotonic.Seq.collect_prefix_stable | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
r: FStar.HyperStack.ST.m_rref i (FStar.Seq.Base.seq a) FStar.Monotonic.Seq.grows ->
f: (_: a -> FStar.Seq.Base.seq b) ->
bs: FStar.Seq.Base.seq b
-> FStar.Pervasives.Lemma
(ensures FStar.HyperStack.ST.stable_on_t r (FStar.Monotonic.Seq.collect_prefix r f bs)) | {
"end_col": 22,
"end_line": 345,
"start_col": 3,
"start_line": 336
} |
FStar.Pervasives.Lemma | val i_at_least_is_stable (#r: rid) (#a: Type) (#p: (seq a -> Type)) (n: nat) (x: a) (m: i_seq r a p)
: Lemma (ensures stable_on_t m (i_at_least n x m)) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let i_at_least_is_stable (#r:rid) (#a:Type) (#p:seq a -> Type) (n:nat) (x:a) (m:i_seq r a p)
: Lemma (ensures stable_on_t m (i_at_least n x m))
= reveal_opaque (`%grows) (grows #a) | val i_at_least_is_stable (#r: rid) (#a: Type) (#p: (seq a -> Type)) (n: nat) (x: a) (m: i_seq r a p)
: Lemma (ensures stable_on_t m (i_at_least n x m))
let i_at_least_is_stable (#r: rid) (#a: Type) (#p: (seq a -> Type)) (n: nat) (x: a) (m: i_seq r a p)
: Lemma (ensures stable_on_t m (i_at_least n x m)) = | false | null | true | reveal_opaque (`%grows) (grows #a) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"lemma"
] | [
"FStar.Monotonic.Seq.rid",
"FStar.Seq.Base.seq",
"Prims.nat",
"FStar.Monotonic.Seq.i_seq",
"FStar.Pervasives.reveal_opaque",
"FStar.Preorder.preorder",
"FStar.Monotonic.Seq.grows",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"FStar.HyperStack.ST.stable_on_t",
"FStar.Monotonic.Seq.grows_p",
... | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val i_at_least_is_stable (#r: rid) (#a: Type) (#p: (seq a -> Type)) (n: nat) (x: a) (m: i_seq r a p)
: Lemma (ensures stable_on_t m (i_at_least n x m)) | [] | FStar.Monotonic.Seq.i_at_least_is_stable | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | n: Prims.nat -> x: a -> m: FStar.Monotonic.Seq.i_seq r a p
-> FStar.Pervasives.Lemma
(ensures FStar.HyperStack.ST.stable_on_t m (FStar.Monotonic.Seq.i_at_least n x m)) | {
"end_col": 38,
"end_line": 121,
"start_col": 4,
"start_line": 121
} |
FStar.Pervasives.Lemma | val at_most_log_len_stable (#l: rid) (#a: Type) (x: nat) (log: log_t l a)
: Lemma (stable_on_t log (at_most_log_len x log)) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let at_most_log_len_stable (#l:rid) (#a:Type) (x:nat) (log:log_t l a)
: Lemma (stable_on_t log (at_most_log_len x log))
= reveal_opaque (`%grows) (grows #a) | val at_most_log_len_stable (#l: rid) (#a: Type) (x: nat) (log: log_t l a)
: Lemma (stable_on_t log (at_most_log_len x log))
let at_most_log_len_stable (#l: rid) (#a: Type) (x: nat) (log: log_t l a)
: Lemma (stable_on_t log (at_most_log_len x log)) = | false | null | true | reveal_opaque (`%grows) (grows #a) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"lemma"
] | [
"FStar.Monotonic.Seq.rid",
"Prims.nat",
"FStar.Monotonic.Seq.log_t",
"FStar.Pervasives.reveal_opaque",
"FStar.Preorder.preorder",
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.grows",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"FStar.HyperStack.ST.stable_on_t",
"FStar.Monotonic.Seq.at_most_log... | [] | (*
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... | false | false | FStar.Monotonic.Seq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val at_most_log_len_stable (#l: rid) (#a: Type) (x: nat) (log: log_t l a)
: Lemma (stable_on_t log (at_most_log_len x log)) | [] | FStar.Monotonic.Seq.at_most_log_len_stable | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | x: Prims.nat -> log: FStar.Monotonic.Seq.log_t l a
-> FStar.Pervasives.Lemma
(ensures FStar.HyperStack.ST.stable_on_t log (FStar.Monotonic.Seq.at_most_log_len x log)) | {
"end_col": 38,
"end_line": 386,
"start_col": 4,
"start_line": 386
} |
FStar.HyperStack.ST.ST | val testify_seqn (#a: Type0) (#i #l: rid) (#log: log_t l a) (#max: nat) (ctr: seqn i log max)
: ST unit
(requires (fun h -> True))
(ensures (fun h0 _ h1 -> h0 == h1 /\ at_most_log_len (HS.sel h1 ctr) log h1)) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let testify_seqn (#a:Type0) (#i:rid) (#l:rid) (#log:log_t l a) (#max:nat) (ctr:seqn i log max)
: ST unit
(requires (fun h -> True))
(ensures (fun h0 _ h1 ->
h0==h1 /\
at_most_log_len (HS.sel h1 ctr) log h1))
= let n = !ctr in
testify (at_most_log_len n log) | val testify_seqn (#a: Type0) (#i #l: rid) (#log: log_t l a) (#max: nat) (ctr: seqn i log max)
: ST unit
(requires (fun h -> True))
(ensures (fun h0 _ h1 -> h0 == h1 /\ at_most_log_len (HS.sel h1 ctr) log h1))
let testify_seqn (#a: Type0) (#i #l: rid) (#log: log_t l a) (#max: nat) (ctr: seqn i log max)
... | true | null | false | let n = !ctr in
testify (at_most_log_len n log) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [] | [
"FStar.Monotonic.Seq.rid",
"FStar.Monotonic.Seq.log_t",
"Prims.nat",
"FStar.Monotonic.Seq.seqn",
"FStar.HyperStack.ST.testify",
"FStar.Monotonic.Seq.at_most_log_len",
"Prims.unit",
"FStar.Monotonic.Seq.seqn_val",
"FStar.HyperStack.ST.op_Bang",
"FStar.Monotonic.Seq.increases",
"FStar.Monotonic.Hy... | [] | (*
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... | false | false | FStar.Monotonic.Seq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val testify_seqn (#a: Type0) (#i #l: rid) (#log: log_t l a) (#max: nat) (ctr: seqn i log max)
: ST unit
(requires (fun h -> True))
(ensures (fun h0 _ h1 -> h0 == h1 /\ at_most_log_len (HS.sel h1 ctr) log h1)) | [] | FStar.Monotonic.Seq.testify_seqn | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | ctr: FStar.Monotonic.Seq.seqn i log max -> FStar.HyperStack.ST.ST Prims.unit | {
"end_col": 35,
"end_line": 431,
"start_col": 3,
"start_line": 430
} |
FStar.Pervasives.Lemma | val collect_grows (f: ('a -> Tot (seq 'b))) (s1 s2: seq 'a)
: Lemma (grows s1 s2 ==> grows (collect f s1) (collect f s2)) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let collect_grows (f:'a -> Tot (seq 'b))
(s1:seq 'a) (s2:seq 'a)
: Lemma (grows s1 s2 ==> grows (collect f s1) (collect f s2))
= reveal_opaque (`%grows) (grows #'a);
reveal_opaque (`%grows) (grows #'b);
let rec collect_grows_aux (f:'a -> Tot (seq 'b)) (s1:seq 'a) (s2:seq 'a)
:Lemma (requires (grow... | val collect_grows (f: ('a -> Tot (seq 'b))) (s1 s2: seq 'a)
: Lemma (grows s1 s2 ==> grows (collect f s1) (collect f s2))
let collect_grows (f: ('a -> Tot (seq 'b))) (s1 s2: seq 'a)
: Lemma (grows s1 s2 ==> grows (collect f s1) (collect f s2)) = | false | null | true | reveal_opaque (`%grows) (grows #'a);
reveal_opaque (`%grows) (grows #'b);
let rec collect_grows_aux (f: ('a -> Tot (seq 'b))) (s1 s2: seq 'a)
: Lemma (requires (grows s1 s2))
(ensures (grows (collect f s1) (collect f s2)))
(decreases (Seq.length s2)) =
if length s1 = length s2
then assert (Seq.equal... | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"lemma"
] | [
"FStar.Seq.Base.seq",
"FStar.Classical.arrow_to_impl",
"FStar.Monotonic.Seq.grows",
"FStar.Monotonic.Seq.collect",
"Prims.squash",
"Prims.unit",
"FStar.Seq.Base.length",
"Prims.Nil",
"FStar.Pervasives.pattern",
"Prims.op_Equality",
"Prims.nat",
"Prims._assert",
"FStar.Seq.Base.equal",
"Pri... | [] | (*
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... | false | false | FStar.Monotonic.Seq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val collect_grows (f: ('a -> Tot (seq 'b))) (s1 s2: seq 'a)
: Lemma (grows s1 s2 ==> grows (collect f s1) (collect f s2)) | [] | FStar.Monotonic.Seq.collect_grows | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: (_: 'a -> FStar.Seq.Base.seq 'b) -> s1: FStar.Seq.Base.seq 'a -> s2: FStar.Seq.Base.seq 'a
-> FStar.Pervasives.Lemma
(ensures
FStar.Monotonic.Seq.grows s1 s2 ==>
FStar.Monotonic.Seq.grows (FStar.Monotonic.Seq.collect f s1)
(FStar.Monotonic.Seq.collect f s2)) | {
"end_col": 118,
"end_line": 325,
"start_col": 4,
"start_line": 315
} |
FStar.Pervasives.Lemma | val collect_has_at_index_stable
(#a #b: Type)
(#i: rid)
(r: m_rref i (seq a) grows)
(f: (a -> Tot (seq b)))
(n: nat)
(v: b)
: Lemma (stable_on_t r (collect_has_at_index r f n v)) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let collect_has_at_index_stable (#a:Type) (#b:Type) (#i:rid)
(r:m_rref i (seq a) grows)
(f:a -> Tot (seq b)) (n:nat) (v:b)
: Lemma (stable_on_t r (collect_has_at_index r f n v))
= reveal_opaque (`%grows) (grows #b);
Classical.forall_intro_2 (collect_grows f) | val collect_has_at_index_stable
(#a #b: Type)
(#i: rid)
(r: m_rref i (seq a) grows)
(f: (a -> Tot (seq b)))
(n: nat)
(v: b)
: Lemma (stable_on_t r (collect_has_at_index r f n v))
let collect_has_at_index_stable
(#a #b: Type)
(#i: rid)
(r: m_rref i (seq a) grows)... | false | null | true | reveal_opaque (`%grows) (grows #b);
Classical.forall_intro_2 (collect_grows f) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"lemma"
] | [
"FStar.Monotonic.Seq.rid",
"FStar.HyperStack.ST.m_rref",
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.grows",
"Prims.nat",
"FStar.Classical.forall_intro_2",
"Prims.l_imp",
"FStar.Monotonic.Seq.collect",
"FStar.Monotonic.Seq.collect_grows",
"Prims.unit",
"FStar.Pervasives.reveal_opaque",
"FStar.P... | [] | (*
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... | false | false | FStar.Monotonic.Seq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val collect_has_at_index_stable
(#a #b: Type)
(#i: rid)
(r: m_rref i (seq a) grows)
(f: (a -> Tot (seq b)))
(n: nat)
(v: b)
: Lemma (stable_on_t r (collect_has_at_index r f n v)) | [] | FStar.Monotonic.Seq.collect_has_at_index_stable | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
r: FStar.HyperStack.ST.m_rref i (FStar.Seq.Base.seq a) FStar.Monotonic.Seq.grows ->
f: (_: a -> FStar.Seq.Base.seq b) ->
n: Prims.nat ->
v: b
-> FStar.Pervasives.Lemma
(ensures FStar.HyperStack.ST.stable_on_t r (FStar.Monotonic.Seq.collect_has_at_index r f n v)) | {
"end_col": 46,
"end_line": 360,
"start_col": 4,
"start_line": 359
} |
FStar.HyperStack.ST.ST | val write_at_end (#a: Type) (#i: rid) (r: m_rref i (seq a) grows) (x: a)
: ST unit
(requires (fun h -> True))
(ensures
(fun h0 _ h1 ->
contains h1 r /\ modifies_one i h0 h1 /\
modifies_ref i (Set.singleton (HS.as_addr r)) h0 h1 /\
HS.sel h1 r == Seq.snoc (HS.s... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let write_at_end (#a:Type) (#i:rid) (r:m_rref i (seq a) grows) (x:a)
: ST unit
(requires (fun h -> True))
(ensures (fun h0 _ h1 ->
contains h1 r
/\ modifies_one i h0 h1
/\ modifies_ref i (Set.singleton (HS.as_addr r)) h0 h1
/\ HS.sel h1 r == Seq.snoc (HS.sel h0 r) x
... | val write_at_end (#a: Type) (#i: rid) (r: m_rref i (seq a) grows) (x: a)
: ST unit
(requires (fun h -> True))
(ensures
(fun h0 _ h1 ->
contains h1 r /\ modifies_one i h0 h1 /\
modifies_ref i (Set.singleton (HS.as_addr r)) h0 h1 /\
HS.sel h1 r == Seq.snoc (HS.s... | true | null | false | recall r;
let s0 = !r in
let n = Seq.length s0 in
r := Seq.snoc s0 x;
at_least_is_stable n x r;
Seq.contains_snoc s0 x;
mr_witness r (at_least n x r) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [] | [
"FStar.Monotonic.Seq.rid",
"FStar.HyperStack.ST.m_rref",
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.grows",
"FStar.HyperStack.ST.mr_witness",
"FStar.Monotonic.Seq.at_least",
"Prims.unit",
"FStar.Seq.Properties.contains_snoc",
"FStar.Monotonic.Seq.at_least_is_stable",
"FStar.HyperStack.ST.op_Colon_... | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val write_at_end (#a: Type) (#i: rid) (r: m_rref i (seq a) grows) (x: a)
: ST unit
(requires (fun h -> True))
(ensures
(fun h0 _ h1 ->
contains h1 r /\ modifies_one i h0 h1 /\
modifies_ref i (Set.singleton (HS.as_addr r)) h0 h1 /\
HS.sel h1 r == Seq.snoc (HS.s... | [] | FStar.Monotonic.Seq.write_at_end | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | r: FStar.HyperStack.ST.m_rref i (FStar.Seq.Base.seq a) FStar.Monotonic.Seq.grows -> x: a
-> FStar.HyperStack.ST.ST Prims.unit | {
"end_col": 33,
"end_line": 98,
"start_col": 4,
"start_line": 92
} |
FStar.Pervasives.Lemma | val map_append: f:('a -> Tot 'b) -> s1:seq 'a -> s2:seq 'a -> Lemma
(requires True)
(ensures (map f (s1@s2) == (map f s1 @ map f s2)))
(decreases (Seq.length s2)) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let rec map_append f s_1 s_2 =
if Seq.length s_2 = 0
then (cut (Seq.equal (s_1@s_2) s_1);
cut (Seq.equal (map f s_1 @ map f s_2) (map f s_1)))
else (let prefix_2, last = un_snoc s_2 in
let m_s_1 = map f s_1 in
let m_p_2 = map f prefix_2 in
let flast = f last in
cut (Seq.equal (s_1@s_2) (S... | val map_append: f:('a -> Tot 'b) -> s1:seq 'a -> s2:seq 'a -> Lemma
(requires True)
(ensures (map f (s1@s2) == (map f s1 @ map f s2)))
(decreases (Seq.length s2))
let rec map_append f s_1 s_2 = | false | null | true | if Seq.length s_2 = 0
then
(cut (Seq.equal (s_1 @ s_2) s_1);
cut (Seq.equal (map f s_1 @ map f s_2) (map f s_1)))
else
(let prefix_2, last = un_snoc s_2 in
let m_s_1 = map f s_1 in
let m_p_2 = map f prefix_2 in
let flast = f last in
cut (Seq.equal (s_1 @ s_2) (Seq.snoc (s_1 @ prefix_2) last));
... | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"lemma",
""
] | [
"FStar.Seq.Base.seq",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"Prims.cut",
"FStar.Seq.Base.equal",
"FStar.Monotonic.Seq.op_At",
"FStar.Monotonic.Seq.map",
"Prims.unit",
"Prims.bool",
"FStar.Monotonic.Seq.map_snoc",
"FStar.Seq.Properties.snoc",
"FStar.Monotonic.Seq.map_appe... | [] | (*
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... | false | false | FStar.Monotonic.Seq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val map_append: f:('a -> Tot 'b) -> s1:seq 'a -> s2:seq 'a -> Lemma
(requires True)
(ensures (map f (s1@s2) == (map f s1 @ map f s2)))
(decreases (Seq.length s2)) | [
"recursion"
] | FStar.Monotonic.Seq.map_append | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: (_: 'a -> 'b) -> s1: FStar.Seq.Base.seq 'a -> s2: FStar.Seq.Base.seq 'a
-> FStar.Pervasives.Lemma
(ensures
FStar.Monotonic.Seq.map f (s1 @ s2) ==
FStar.Monotonic.Seq.map f s1 @ FStar.Monotonic.Seq.map f s2)
(decreases FStar.Seq.Base.length s2) | {
"end_col": 33,
"end_line": 230,
"start_col": 2,
"start_line": 218
} |
FStar.Pervasives.Lemma | val map_length: f:('a -> Tot 'b) -> s1:seq 'a -> Lemma
(requires True)
(ensures (Seq.length s1 = Seq.length (map f s1)))
(decreases (length s1))
[SMTPat (Seq.length (map f s1))] | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let rec map_length f s1 =
if Seq.length s1 = 0 then ()
else let prefix, last = un_snoc s1 in
map_length f prefix | val map_length: f:('a -> Tot 'b) -> s1:seq 'a -> Lemma
(requires True)
(ensures (Seq.length s1 = Seq.length (map f s1)))
(decreases (length s1))
[SMTPat (Seq.length (map f s1))]
let rec map_length f s1 = | false | null | true | if Seq.length s1 = 0
then ()
else
let prefix, last = un_snoc s1 in
map_length f prefix | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"lemma",
""
] | [
"FStar.Seq.Base.seq",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"Prims.bool",
"FStar.Monotonic.Seq.map_length",
"Prims.unit",
"FStar.Pervasives.Native.tuple2",
"FStar.Monotonic.Seq.un_snoc"
] | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val map_length: f:('a -> Tot 'b) -> s1:seq 'a -> Lemma
(requires True)
(ensures (Seq.length s1 = Seq.length (map f s1)))
(decreases (length s1))
[SMTPat (Seq.length (map f s1))] | [
"recursion"
] | FStar.Monotonic.Seq.map_length | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: (_: 'a -> 'b) -> s1: FStar.Seq.Base.seq 'a
-> FStar.Pervasives.Lemma
(ensures FStar.Seq.Base.length s1 = FStar.Seq.Base.length (FStar.Monotonic.Seq.map f s1))
(decreases FStar.Seq.Base.length s1)
[SMTPat (FStar.Seq.Base.length (FStar.Monotonic.Seq.map f s1))] | {
"end_col": 26,
"end_line": 242,
"start_col": 2,
"start_line": 240
} |
FStar.HyperStack.ST.ST | val i_write_at_end (#a: Type) (#p: (seq a -> Type)) (#rgn: rid) (r: i_seq rgn a p) (x: a)
: ST unit
(requires (fun h -> p (Seq.snoc (i_sel h r) x)))
(ensures
(fun h0 _ h1 ->
i_contains r h1 /\ modifies_one rgn h0 h1 /\
modifies_ref rgn (Set.singleton (HS.as_addr r)) h0 h1... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let i_write_at_end (#a:Type) (#p:seq a -> Type) (#rgn:rid) (r:i_seq rgn a p) (x:a)
: ST unit
(requires (fun h -> p (Seq.snoc (i_sel h r) x)))
(ensures (fun h0 _ h1 ->
i_contains r h1
/\ modifies_one rgn h0 h1
/\ modifies_ref rgn (Set.singleton (HS.as_addr r)) h0 h1
/... | val i_write_at_end (#a: Type) (#p: (seq a -> Type)) (#rgn: rid) (r: i_seq rgn a p) (x: a)
: ST unit
(requires (fun h -> p (Seq.snoc (i_sel h r) x)))
(ensures
(fun h0 _ h1 ->
i_contains r h1 /\ modifies_one rgn h0 h1 /\
modifies_ref rgn (Set.singleton (HS.as_addr r)) h0 h1... | true | null | false | recall r;
let s0 = !r in
let n = Seq.length s0 in
r := Seq.snoc s0 x;
i_at_least_is_stable n x r;
contains_snoc s0 x;
mr_witness r (i_at_least n x r) | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [] | [
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.rid",
"FStar.Monotonic.Seq.i_seq",
"FStar.HyperStack.ST.mr_witness",
"FStar.Monotonic.Seq.grows_p",
"FStar.Monotonic.Seq.i_at_least",
"Prims.unit",
"FStar.Seq.Properties.contains_snoc",
"FStar.Monotonic.Seq.i_at_least_is_stable",
"FStar.HyperStack.ST.op_C... | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val i_write_at_end (#a: Type) (#p: (seq a -> Type)) (#rgn: rid) (r: i_seq rgn a p) (x: a)
: ST unit
(requires (fun h -> p (Seq.snoc (i_sel h r) x)))
(ensures
(fun h0 _ h1 ->
i_contains r h1 /\ modifies_one rgn h0 h1 /\
modifies_ref rgn (Set.singleton (HS.as_addr r)) h0 h1... | [] | FStar.Monotonic.Seq.i_write_at_end | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | r: FStar.Monotonic.Seq.i_seq rgn a p -> x: a -> FStar.HyperStack.ST.ST Prims.unit | {
"end_col": 35,
"end_line": 160,
"start_col": 4,
"start_line": 154
} |
FStar.HyperStack.ST.ST | val new_seqn (#a: Type) (#l: rid) (#max: nat) (i: rid) (init: nat) (log: log_t l a)
: ST (seqn i log max)
(requires
(fun h ->
HST.witnessed (region_contains_pred i) /\ init <= max /\
init <= Seq.length (HS.sel h log)))
(ensures
(fun h0 c h1 ->
modifies... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let new_seqn (#a:Type) (#l:rid) (#max:nat)
(i:rid) (init:nat) (log:log_t l a)
: ST (seqn i log max)
(requires (fun h ->
HST.witnessed (region_contains_pred i) /\
init <= max /\
init <= Seq.length (HS.sel h log)))
(ensures (fun h0 c h1 -> //17-01-05 unify with ralloc_post?
... | val new_seqn (#a: Type) (#l: rid) (#max: nat) (i: rid) (init: nat) (log: log_t l a)
: ST (seqn i log max)
(requires
(fun h ->
HST.witnessed (region_contains_pred i) /\ init <= max /\
init <= Seq.length (HS.sel h log)))
(ensures
(fun h0 c h1 ->
modifies... | true | null | false | reveal_opaque (`%grows) (grows #a);
recall log;
recall_region i;
mr_witness log (at_most_log_len init log);
ralloc i init | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [] | [
"FStar.Monotonic.Seq.rid",
"Prims.nat",
"FStar.Monotonic.Seq.log_t",
"FStar.HyperStack.ST.ralloc",
"FStar.Monotonic.Seq.seqn_val",
"FStar.Monotonic.Seq.increases",
"FStar.HyperStack.ST.mref",
"Prims.unit",
"FStar.HyperStack.ST.mr_witness",
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.grows",
"FS... | [] | (*
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... | false | false | FStar.Monotonic.Seq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val new_seqn (#a: Type) (#l: rid) (#max: nat) (i: rid) (init: nat) (log: log_t l a)
: ST (seqn i log max)
(requires
(fun h ->
HST.witnessed (region_contains_pred i) /\ init <= max /\
init <= Seq.length (HS.sel h log)))
(ensures
(fun h0 c h1 ->
modifies... | [] | FStar.Monotonic.Seq.new_seqn | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | i: FStar.Monotonic.Seq.rid -> init: Prims.nat -> log: FStar.Monotonic.Seq.log_t l a
-> FStar.HyperStack.ST.ST (FStar.Monotonic.Seq.seqn i log max) | {
"end_col": 17,
"end_line": 404,
"start_col": 4,
"start_line": 401
} |
FStar.Pervasives.Lemma | val map_index: f:('a -> Tot 'b) -> s:seq 'a -> i:nat{i<Seq.length s} -> Lemma
(requires True)
(ensures (Seq.index (map f s) i == f (Seq.index s i)))
(decreases (Seq.length s))
[SMTPat (Seq.index (map f s) i)] | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let rec map_index f s i =
if i = Seq.length s - 1
then ()
else let prefix, last = un_snoc s in
map_index f prefix i | val map_index: f:('a -> Tot 'b) -> s:seq 'a -> i:nat{i<Seq.length s} -> Lemma
(requires True)
(ensures (Seq.index (map f s) i == f (Seq.index s i)))
(decreases (Seq.length s))
[SMTPat (Seq.index (map f s) i)]
let rec map_index f s i = | false | null | true | if i = Seq.length s - 1
then ()
else
let prefix, last = un_snoc s in
map_index f prefix i | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [
"lemma",
""
] | [
"FStar.Seq.Base.seq",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Seq.Base.length",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Subtraction",
"Prims.bool",
"FStar.Monotonic.Seq.map_index",
"Prims.unit",
"FStar.Pervasives.Native.tuple2",
"FStar.Monotonic.Seq.un_snoc"
] | [] | (*
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... | false | false | FStar.Monotonic.Seq.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... | null | val map_index: f:('a -> Tot 'b) -> s:seq 'a -> i:nat{i<Seq.length s} -> Lemma
(requires True)
(ensures (Seq.index (map f s) i == f (Seq.index s i)))
(decreases (Seq.length s))
[SMTPat (Seq.index (map f s) i)] | [
"recursion"
] | FStar.Monotonic.Seq.map_index | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: (_: 'a -> 'b) -> s: FStar.Seq.Base.seq 'a -> i: Prims.nat{i < FStar.Seq.Base.length s}
-> FStar.Pervasives.Lemma
(ensures FStar.Seq.Base.index (FStar.Monotonic.Seq.map f s) i == f (FStar.Seq.Base.index s i))
(decreases FStar.Seq.Base.length s)
[SMTPat (FStar.Seq.Base.index (FStar.Monotonic.Seq.ma... | {
"end_col": 27,
"end_line": 253,
"start_col": 2,
"start_line": 250
} |
FStar.HyperStack.ST.ST | val increment_seqn (#a: Type) (#l: rid) (#max: nat) (#i: rid) (#log: log_t l a) ($c: seqn i log max)
: ST unit
(requires
(fun h ->
let log = HS.sel h log in
let n = HS.sel h c in
n < Seq.length log /\ n + 1 <= max))
(ensures
(fun h0 _ h1 ->
... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | false | let increment_seqn (#a:Type) (#l:rid) (#max:nat)
(#i:rid) (#log:log_t l a) ($c:seqn i log max)
: ST unit
(requires (fun h ->
let log = HS.sel h log in
let n = HS.sel h c in
n < Seq.length log /\
n + 1 <= max))
(ensures (fun h0 _ h1 ->
modifies_one i h0 h1 /\
modifies_ref i... | val increment_seqn (#a: Type) (#l: rid) (#max: nat) (#i: rid) (#log: log_t l a) ($c: seqn i log max)
: ST unit
(requires
(fun h ->
let log = HS.sel h log in
let n = HS.sel h c in
n < Seq.length log /\ n + 1 <= max))
(ensures
(fun h0 _ h1 ->
... | true | null | false | reveal_opaque (`%grows) (grows #a);
recall c;
recall log;
let n = !c + 1 in
mr_witness log (at_most_log_len n log);
c := n | {
"checked_file": "FStar.Monotonic.Seq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"F... | [] | [
"FStar.Monotonic.Seq.rid",
"Prims.nat",
"FStar.Monotonic.Seq.log_t",
"FStar.Monotonic.Seq.seqn",
"FStar.HyperStack.ST.op_Colon_Equals",
"FStar.Monotonic.Seq.seqn_val",
"FStar.Monotonic.Seq.increases",
"Prims.unit",
"FStar.HyperStack.ST.mr_witness",
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.grow... | [] | (*
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... | false | false | FStar.Monotonic.Seq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val increment_seqn (#a: Type) (#l: rid) (#max: nat) (#i: rid) (#log: log_t l a) ($c: seqn i log max)
: ST unit
(requires
(fun h ->
let log = HS.sel h log in
let n = HS.sel h c in
n < Seq.length log /\ n + 1 <= max))
(ensures
(fun h0 _ h1 ->
... | [] | FStar.Monotonic.Seq.increment_seqn | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | $c: FStar.Monotonic.Seq.seqn i log max -> FStar.HyperStack.ST.ST Prims.unit | {
"end_col": 10,
"end_line": 422,
"start_col": 4,
"start_line": 418
} |
Prims.Tot | val pts_to (#a: Type u#1) (r: ref a) (p: perm) (v: a) : vprop | [
{
"abbrev": true,
"full_module": "Steel.Memory",
"short_module": "Mem"
},
{
"abbrev": false,
"full_module": "Steel.Effect",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.Effect.Atomic",
"short_module": null
},
{
"abbrev": false,
"full_module... | false | let pts_to (#a:Type u#1) (r:ref a) (p:perm) (v:a) : vprop =
to_vprop (pts_to_sl r p v) | val pts_to (#a: Type u#1) (r: ref a) (p: perm) (v: a) : vprop
let pts_to (#a: Type u#1) (r: ref a) (p: perm) (v: a) : vprop = | false | null | false | to_vprop (pts_to_sl r p v) | {
"checked_file": "Steel.HigherReference.fsti.checked",
"dependencies": [
"Steel.Memory.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checke... | [
"total"
] | [
"Steel.HigherReference.ref",
"Steel.FractionalPermission.perm",
"Steel.Effect.Common.to_vprop",
"Steel.HigherReference.pts_to_sl",
"Steel.Effect.Common.vprop"
] | [] | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | false | false | Steel.HigherReference.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val pts_to (#a: Type u#1) (r: ref a) (p: perm) (v: a) : vprop | [] | Steel.HigherReference.pts_to | {
"file_name": "lib/steel/Steel.HigherReference.fsti",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | r: Steel.HigherReference.ref a -> p: Steel.FractionalPermission.perm -> v: a
-> Steel.Effect.Common.vprop | {
"end_col": 28,
"end_line": 49,
"start_col": 2,
"start_line": 49
} |
Prims.Tot | val ghost_pts_to (#a: _) (r: ghost_ref a) (p: perm) (x: a) : vprop | [
{
"abbrev": true,
"full_module": "Steel.Memory",
"short_module": "Mem"
},
{
"abbrev": false,
"full_module": "Steel.Effect",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.Effect.Atomic",
"short_module": null
},
{
"abbrev": false,
"full_module... | false | let ghost_pts_to (#a:_) (r:ghost_ref a) (p:perm) (x:a) : vprop =
to_vprop (ghost_pts_to_sl r p x) | val ghost_pts_to (#a: _) (r: ghost_ref a) (p: perm) (x: a) : vprop
let ghost_pts_to (#a: _) (r: ghost_ref a) (p: perm) (x: a) : vprop = | false | null | false | to_vprop (ghost_pts_to_sl r p x) | {
"checked_file": "Steel.HigherReference.fsti.checked",
"dependencies": [
"Steel.Memory.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checke... | [
"total"
] | [
"Steel.HigherReference.ghost_ref",
"Steel.FractionalPermission.perm",
"Steel.Effect.Common.to_vprop",
"Steel.HigherReference.ghost_pts_to_sl",
"Steel.Effect.Common.vprop"
] | [] | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | false | false | Steel.HigherReference.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val ghost_pts_to (#a: _) (r: ghost_ref a) (p: perm) (x: a) : vprop | [] | Steel.HigherReference.ghost_pts_to | {
"file_name": "lib/steel/Steel.HigherReference.fsti",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | r: Steel.HigherReference.ghost_ref a -> p: Steel.FractionalPermission.perm -> x: a
-> Steel.Effect.Common.vprop | {
"end_col": 34,
"end_line": 191,
"start_col": 2,
"start_line": 191
} |
FStar.Pervasives.Lemma | val exp_mont_ladder_swap_lemma: #t:Type -> k:comm_monoid t -> a:t -> bBits:nat -> b:nat{b < pow2 bBits} ->
Lemma (exp_mont_ladder_swap k a bBits b == exp_mont_ladder k a bBits b) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Exponentiation.Definition",
"short_module": null
},
{
"abbrev": true,
... | false | let exp_mont_ladder_swap_lemma #t k a bBits b =
exp_mont_ladder_swap_lemma_loop #t k a bBits b 0 bBits | val exp_mont_ladder_swap_lemma: #t:Type -> k:comm_monoid t -> a:t -> bBits:nat -> b:nat{b < pow2 bBits} ->
Lemma (exp_mont_ladder_swap k a bBits b == exp_mont_ladder k a bBits b)
let exp_mont_ladder_swap_lemma #t k a bBits b = | false | null | true | exp_mont_ladder_swap_lemma_loop #t k a bBits b 0 bBits | {
"checked_file": "Lib.Exponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.LoopCombinators.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
... | [
"lemma"
] | [
"Lib.Exponentiation.Definition.comm_monoid",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"Lib.Exponentiation.exp_mont_ladder_swap_lemma_loop",
"Prims.unit"
] | [] | module Lib.Exponentiation
open FStar.Mul
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val lemma_b_mod_pow2i: bBits:nat -> b:nat{b < pow2 bBits} -> i:pos{i <= bBits} ->
Lemma (b % pow2 i == b / pow2 (i - 1) % 2 * pow2 (i - 1) + b % pow2 (i - 1))
let lemma_b_mod_pow2i bBits b i... | false | false | Lib.Exponentiation.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val exp_mont_ladder_swap_lemma: #t:Type -> k:comm_monoid t -> a:t -> bBits:nat -> b:nat{b < pow2 bBits} ->
Lemma (exp_mont_ladder_swap k a bBits b == exp_mont_ladder k a bBits b) | [] | Lib.Exponentiation.exp_mont_ladder_swap_lemma | {
"file_name": "lib/Lib.Exponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
k: Lib.Exponentiation.Definition.comm_monoid t ->
a: t ->
bBits: Prims.nat ->
b: Prims.nat{b < Prims.pow2 bBits}
-> FStar.Pervasives.Lemma
(ensures
Lib.Exponentiation.exp_mont_ladder_swap k a bBits b ==
Lib.Exponentiation.exp_mont_ladder k a bBits b) | {
"end_col": 56,
"end_line": 278,
"start_col": 2,
"start_line": 278
} |
FStar.Pervasives.Lemma | val exp_lr_lemma: #t:Type -> k:comm_monoid t -> a:t -> bBits:nat -> b:nat{b < pow2 bBits} ->
Lemma (exp_lr k a bBits b == pow k a b) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Exponentiation.Definition",
"short_module": null
},
{
"abbrev": true,
... | false | let exp_lr_lemma #t k a bBits b =
let acc = Loops.repeati bBits (exp_lr_f k a bBits b) one in
exp_lr_lemma_loop #t k a bBits b bBits;
assert (acc == pow k a (b / pow2 0));
assert_norm (pow2 0 = 1) | val exp_lr_lemma: #t:Type -> k:comm_monoid t -> a:t -> bBits:nat -> b:nat{b < pow2 bBits} ->
Lemma (exp_lr k a bBits b == pow k a b)
let exp_lr_lemma #t k a bBits b = | false | null | true | let acc = Loops.repeati bBits (exp_lr_f k a bBits b) one in
exp_lr_lemma_loop #t k a bBits b bBits;
assert (acc == pow k a (b / pow2 0));
assert_norm (pow2 0 = 1) | {
"checked_file": "Lib.Exponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.LoopCombinators.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
... | [
"lemma"
] | [
"Lib.Exponentiation.Definition.comm_monoid",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"FStar.Pervasives.assert_norm",
"Prims.op_Equality",
"Prims.int",
"Prims.unit",
"Prims._assert",
"Prims.eq2",
"Lib.Exponentiation.Definition.pow",
"Prims.op_Division",
"Lib.Exponentiat... | [] | module Lib.Exponentiation
open FStar.Mul
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val lemma_b_mod_pow2i: bBits:nat -> b:nat{b < pow2 bBits} -> i:pos{i <= bBits} ->
Lemma (b % pow2 i == b / pow2 (i - 1) % 2 * pow2 (i - 1) + b % pow2 (i - 1))
let lemma_b_mod_pow2i bBits b i... | false | false | Lib.Exponentiation.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val exp_lr_lemma: #t:Type -> k:comm_monoid t -> a:t -> bBits:nat -> b:nat{b < pow2 bBits} ->
Lemma (exp_lr k a bBits b == pow k a b) | [] | Lib.Exponentiation.exp_lr_lemma | {
"file_name": "lib/Lib.Exponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
k: Lib.Exponentiation.Definition.comm_monoid t ->
a: t ->
bBits: Prims.nat ->
b: Prims.nat{b < Prims.pow2 bBits}
-> FStar.Pervasives.Lemma
(ensures Lib.Exponentiation.exp_lr k a bBits b == Lib.Exponentiation.Definition.pow k a b) | {
"end_col": 26,
"end_line": 151,
"start_col": 33,
"start_line": 147
} |
FStar.Pervasives.Lemma | val exp_pow2_lemma: #t:Type -> k:comm_monoid t -> a:t -> b:nat ->
Lemma (exp_pow2 k a b == pow k a (pow2 b)) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Exponentiation.Definition",
"short_module": null
},
{
"abbrev": true,
... | false | let exp_pow2_lemma #t k a b = exp_pow2_loop_lemma k a b b | val exp_pow2_lemma: #t:Type -> k:comm_monoid t -> a:t -> b:nat ->
Lemma (exp_pow2 k a b == pow k a (pow2 b))
let exp_pow2_lemma #t k a b = | false | null | true | exp_pow2_loop_lemma k a b b | {
"checked_file": "Lib.Exponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.LoopCombinators.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
... | [
"lemma"
] | [
"Lib.Exponentiation.Definition.comm_monoid",
"Prims.nat",
"Lib.Exponentiation.exp_pow2_loop_lemma",
"Prims.unit"
] | [] | module Lib.Exponentiation
open FStar.Mul
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val lemma_b_mod_pow2i: bBits:nat -> b:nat{b < pow2 bBits} -> i:pos{i <= bBits} ->
Lemma (b % pow2 i == b / pow2 (i - 1) % 2 * pow2 (i - 1) + b % pow2 (i - 1))
let lemma_b_mod_pow2i bBits b i... | false | false | Lib.Exponentiation.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val exp_pow2_lemma: #t:Type -> k:comm_monoid t -> a:t -> b:nat ->
Lemma (exp_pow2 k a b == pow k a (pow2 b)) | [] | Lib.Exponentiation.exp_pow2_lemma | {
"file_name": "lib/Lib.Exponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | k: Lib.Exponentiation.Definition.comm_monoid t -> a: t -> b: Prims.nat
-> FStar.Pervasives.Lemma
(ensures
Lib.Exponentiation.exp_pow2 k a b == Lib.Exponentiation.Definition.pow k a (Prims.pow2 b)) | {
"end_col": 57,
"end_line": 296,
"start_col": 30,
"start_line": 296
} |
FStar.Pervasives.Lemma | val exp_mont_ladder_swap2_lemma: #t:Type -> k:comm_monoid t -> a:t -> bBits:nat -> b:nat{b < pow2 bBits} ->
Lemma (exp_mont_ladder_swap2 k a bBits b == exp_mont_ladder k a bBits b) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Exponentiation.Definition",
"short_module": null
},
{
"abbrev": true,
... | false | let exp_mont_ladder_swap2_lemma #t k a bBits b =
exp_mont_ladder_swap2_lemma_loop #t k a bBits b bBits | val exp_mont_ladder_swap2_lemma: #t:Type -> k:comm_monoid t -> a:t -> bBits:nat -> b:nat{b < pow2 bBits} ->
Lemma (exp_mont_ladder_swap2 k a bBits b == exp_mont_ladder k a bBits b)
let exp_mont_ladder_swap2_lemma #t k a bBits b = | false | null | true | exp_mont_ladder_swap2_lemma_loop #t k a bBits b bBits | {
"checked_file": "Lib.Exponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.LoopCombinators.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
... | [
"lemma"
] | [
"Lib.Exponentiation.Definition.comm_monoid",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"Lib.Exponentiation.exp_mont_ladder_swap2_lemma_loop",
"Prims.unit"
] | [] | module Lib.Exponentiation
open FStar.Mul
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val lemma_b_mod_pow2i: bBits:nat -> b:nat{b < pow2 bBits} -> i:pos{i <= bBits} ->
Lemma (b % pow2 i == b / pow2 (i - 1) % 2 * pow2 (i - 1) + b % pow2 (i - 1))
let lemma_b_mod_pow2i bBits b i... | false | false | Lib.Exponentiation.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val exp_mont_ladder_swap2_lemma: #t:Type -> k:comm_monoid t -> a:t -> bBits:nat -> b:nat{b < pow2 bBits} ->
Lemma (exp_mont_ladder_swap2 k a bBits b == exp_mont_ladder k a bBits b) | [] | Lib.Exponentiation.exp_mont_ladder_swap2_lemma | {
"file_name": "lib/Lib.Exponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
k: Lib.Exponentiation.Definition.comm_monoid t ->
a: t ->
bBits: Prims.nat ->
b: Prims.nat{b < Prims.pow2 bBits}
-> FStar.Pervasives.Lemma
(ensures
Lib.Exponentiation.exp_mont_ladder_swap2 k a bBits b ==
Lib.Exponentiation.exp_mont_ladder k a bBits b) | {
"end_col": 55,
"end_line": 251,
"start_col": 2,
"start_line": 251
} |
FStar.Pervasives.Lemma | val exp_mont_ladder_lemma: #t:Type -> k:comm_monoid t -> a:t -> bBits:nat -> b:nat{b < pow2 bBits} ->
Lemma (exp_mont_ladder k a bBits b == pow k a b) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Exponentiation.Definition",
"short_module": null
},
{
"abbrev": true,
... | false | let exp_mont_ladder_lemma # t k a bBits b =
let (r0, r1) = Loops.repeati bBits (exp_mont_ladder_f k bBits b) (one, a) in
exp_mont_ladder_lemma_loop #t k bBits b a bBits;
assert_norm (pow2 0 = 1) | val exp_mont_ladder_lemma: #t:Type -> k:comm_monoid t -> a:t -> bBits:nat -> b:nat{b < pow2 bBits} ->
Lemma (exp_mont_ladder k a bBits b == pow k a b)
let exp_mont_ladder_lemma #t k a bBits b = | false | null | true | let r0, r1 = Loops.repeati bBits (exp_mont_ladder_f k bBits b) (one, a) in
exp_mont_ladder_lemma_loop #t k bBits b a bBits;
assert_norm (pow2 0 = 1) | {
"checked_file": "Lib.Exponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.LoopCombinators.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
... | [
"lemma"
] | [
"Lib.Exponentiation.Definition.comm_monoid",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"FStar.Pervasives.assert_norm",
"Prims.op_Equality",
"Prims.int",
"Prims.unit",
"Lib.Exponentiation.exp_mont_ladder_lemma_loop",
"FStar.Pervasives.Native.tuple2",
"Lib.LoopCombinators.repe... | [] | module Lib.Exponentiation
open FStar.Mul
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val lemma_b_mod_pow2i: bBits:nat -> b:nat{b < pow2 bBits} -> i:pos{i <= bBits} ->
Lemma (b % pow2 i == b / pow2 (i - 1) % 2 * pow2 (i - 1) + b % pow2 (i - 1))
let lemma_b_mod_pow2i bBits b i... | false | false | Lib.Exponentiation.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val exp_mont_ladder_lemma: #t:Type -> k:comm_monoid t -> a:t -> bBits:nat -> b:nat{b < pow2 bBits} ->
Lemma (exp_mont_ladder k a bBits b == pow k a b) | [] | Lib.Exponentiation.exp_mont_ladder_lemma | {
"file_name": "lib/Lib.Exponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
k: Lib.Exponentiation.Definition.comm_monoid t ->
a: t ->
bBits: Prims.nat ->
b: Prims.nat{b < Prims.pow2 bBits}
-> FStar.Pervasives.Lemma
(ensures
Lib.Exponentiation.exp_mont_ladder k a bBits b == Lib.Exponentiation.Definition.pow k a b) | {
"end_col": 26,
"end_line": 225,
"start_col": 43,
"start_line": 222
} |
FStar.Pervasives.Lemma | val exp_rl_lemma: #t:Type -> k:comm_monoid t -> a:t -> bBits:nat -> b:nat{b < pow2 bBits} ->
Lemma (exp_rl k a bBits b == pow k a b) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Exponentiation.Definition",
"short_module": null
},
{
"abbrev": true,
... | false | let exp_rl_lemma #t k a bBits b =
let (acc, c) = Loops.repeati bBits (exp_rl_f k bBits b) (one, a) in
exp_rl_lemma_loop k bBits b bBits a;
assert (acc == pow k a (b % pow2 bBits));
Math.Lemmas.small_mod b (pow2 bBits) | val exp_rl_lemma: #t:Type -> k:comm_monoid t -> a:t -> bBits:nat -> b:nat{b < pow2 bBits} ->
Lemma (exp_rl k a bBits b == pow k a b)
let exp_rl_lemma #t k a bBits b = | false | null | true | let acc, c = Loops.repeati bBits (exp_rl_f k bBits b) (one, a) in
exp_rl_lemma_loop k bBits b bBits a;
assert (acc == pow k a (b % pow2 bBits));
Math.Lemmas.small_mod b (pow2 bBits) | {
"checked_file": "Lib.Exponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.LoopCombinators.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
... | [
"lemma"
] | [
"Lib.Exponentiation.Definition.comm_monoid",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"FStar.Math.Lemmas.small_mod",
"Prims.unit",
"Prims._assert",
"Prims.eq2",
"Lib.Exponentiation.Definition.pow",
"Prims.op_Modulus",
"Lib.Exponentiation.exp_rl_lemma_loop",
"FStar.Pervasi... | [] | module Lib.Exponentiation
open FStar.Mul
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val lemma_b_mod_pow2i: bBits:nat -> b:nat{b < pow2 bBits} -> i:pos{i <= bBits} ->
Lemma (b % pow2 i == b / pow2 (i - 1) % 2 * pow2 (i - 1) + b % pow2 (i - 1))
let lemma_b_mod_pow2i bBits b i... | false | false | Lib.Exponentiation.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val exp_rl_lemma: #t:Type -> k:comm_monoid t -> a:t -> bBits:nat -> b:nat{b < pow2 bBits} ->
Lemma (exp_rl k a bBits b == pow k a b) | [] | Lib.Exponentiation.exp_rl_lemma | {
"file_name": "lib/Lib.Exponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
k: Lib.Exponentiation.Definition.comm_monoid t ->
a: t ->
bBits: Prims.nat ->
b: Prims.nat{b < Prims.pow2 bBits}
-> FStar.Pervasives.Lemma
(ensures Lib.Exponentiation.exp_rl k a bBits b == Lib.Exponentiation.Definition.pow k a b) | {
"end_col": 38,
"end_line": 96,
"start_col": 33,
"start_line": 92
} |
FStar.Pervasives.Lemma | val exp_pow2_loop_lemma: #t:Type -> k:comm_monoid t -> a:t -> b:nat -> i:nat{i <= b} ->
Lemma (Loops.repeat i (sqr k) a == pow k a (pow2 i)) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Exponentiation.Definition",
"short_module": null
},
{
"abbrev": true,
... | false | let rec exp_pow2_loop_lemma #t k a b i =
if i = 0 then begin
Loops.eq_repeat0 (sqr k) a;
assert_norm (pow2 0 = 1);
lemma_pow1 k a end
else begin
Loops.unfold_repeat b (sqr k) a (i - 1);
exp_pow2_loop_lemma k a b (i - 1);
lemma_pow_add k a (pow2 (i - 1)) (pow2 (i - 1));
Math.Lemmas.pow2_d... | val exp_pow2_loop_lemma: #t:Type -> k:comm_monoid t -> a:t -> b:nat -> i:nat{i <= b} ->
Lemma (Loops.repeat i (sqr k) a == pow k a (pow2 i))
let rec exp_pow2_loop_lemma #t k a b i = | false | null | true | if i = 0
then
(Loops.eq_repeat0 (sqr k) a;
assert_norm (pow2 0 = 1);
lemma_pow1 k a)
else
(Loops.unfold_repeat b (sqr k) a (i - 1);
exp_pow2_loop_lemma k a b (i - 1);
lemma_pow_add k a (pow2 (i - 1)) (pow2 (i - 1));
Math.Lemmas.pow2_double_sum (i - 1);
()) | {
"checked_file": "Lib.Exponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.LoopCombinators.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
... | [
"lemma"
] | [
"Lib.Exponentiation.Definition.comm_monoid",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Equality",
"Prims.int",
"Lib.Exponentiation.Definition.lemma_pow1",
"Prims.unit",
"FStar.Pervasives.assert_norm",
"Prims.pow2",
"Lib.LoopCombinators.eq_repeat0",
"Lib.Exponentiation.Def... | [] | module Lib.Exponentiation
open FStar.Mul
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val lemma_b_mod_pow2i: bBits:nat -> b:nat{b < pow2 bBits} -> i:pos{i <= bBits} ->
Lemma (b % pow2 i == b / pow2 (i - 1) % 2 * pow2 (i - 1) + b % pow2 (i - 1))
let lemma_b_mod_pow2i bBits b i... | false | false | Lib.Exponentiation.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val exp_pow2_loop_lemma: #t:Type -> k:comm_monoid t -> a:t -> b:nat -> i:nat{i <= b} ->
Lemma (Loops.repeat i (sqr k) a == pow k a (pow2 i)) | [
"recursion"
] | Lib.Exponentiation.exp_pow2_loop_lemma | {
"file_name": "lib/Lib.Exponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | k: Lib.Exponentiation.Definition.comm_monoid t -> a: t -> b: Prims.nat -> i: Prims.nat{i <= b}
-> FStar.Pervasives.Lemma
(ensures
Lib.LoopCombinators.repeat i (Lib.Exponentiation.Definition.sqr k) a ==
Lib.Exponentiation.Definition.pow k a (Prims.pow2 i)) | {
"end_col": 10,
"end_line": 294,
"start_col": 2,
"start_line": 285
} |
FStar.Pervasives.Lemma | val lemma_b_div_pow2i: bBits:nat -> b:nat{b < pow2 bBits} -> i:pos{i <= bBits} ->
Lemma (b / pow2 (bBits - i) == b / pow2 (bBits - i + 1) * 2 + b / pow2 (bBits - i) % 2) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Exponentiation.Definition",
"short_module": null
},
{
"abbrev": true,
... | false | let lemma_b_div_pow2i bBits b i =
assert_norm (pow2 1 = 2);
lemma_b_div_pow2ki bBits b 1 i | val lemma_b_div_pow2i: bBits:nat -> b:nat{b < pow2 bBits} -> i:pos{i <= bBits} ->
Lemma (b / pow2 (bBits - i) == b / pow2 (bBits - i + 1) * 2 + b / pow2 (bBits - i) % 2)
let lemma_b_div_pow2i bBits b i = | false | null | true | assert_norm (pow2 1 = 2);
lemma_b_div_pow2ki bBits b 1 i | {
"checked_file": "Lib.Exponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.LoopCombinators.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
... | [
"lemma"
] | [
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"Prims.pos",
"Prims.op_LessThanOrEqual",
"Lib.Exponentiation.lemma_b_div_pow2ki",
"Prims.unit",
"FStar.Pervasives.assert_norm",
"Prims.op_Equality",
"Prims.int"
] | [] | module Lib.Exponentiation
open FStar.Mul
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val lemma_b_mod_pow2i: bBits:nat -> b:nat{b < pow2 bBits} -> i:pos{i <= bBits} ->
Lemma (b % pow2 i == b / pow2 (i - 1) % 2 * pow2 (i - 1) + b % pow2 (i - 1))
let lemma_b_mod_pow2i bBits b i... | false | false | Lib.Exponentiation.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val lemma_b_div_pow2i: bBits:nat -> b:nat{b < pow2 bBits} -> i:pos{i <= bBits} ->
Lemma (b / pow2 (bBits - i) == b / pow2 (bBits - i + 1) * 2 + b / pow2 (bBits - i) % 2) | [] | Lib.Exponentiation.lemma_b_div_pow2i | {
"file_name": "lib/Lib.Exponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | bBits: Prims.nat -> b: Prims.nat{b < Prims.pow2 bBits} -> i: Prims.pos{i <= bBits}
-> FStar.Pervasives.Lemma
(ensures
b / Prims.pow2 (bBits - i) ==
(b / Prims.pow2 (bBits - i + 1)) * 2 + b / Prims.pow2 (bBits - i) % 2) | {
"end_col": 32,
"end_line": 47,
"start_col": 2,
"start_line": 46
} |
FStar.Pervasives.Lemma | val lemma_mul_assoc4: #t:Type -> k:comm_monoid t -> a1:t -> a2:t -> a3:t -> a4:t ->
Lemma (k.mul a1 (k.mul (k.mul a2 a3) a4) == k.mul (k.mul (k.mul a1 a2) a3) a4) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Exponentiation.Definition",
"short_module": null
},
{
"abbrev": true,
... | false | let lemma_mul_assoc4 #t k a1 a2 a3 a4 =
calc (==) {
k.mul a1 (k.mul (k.mul a2 a3) a4);
(==) { k.lemma_mul_assoc a1 (k.mul a2 a3) a4 }
k.mul (k.mul a1 (k.mul a2 a3)) a4;
(==) { k.lemma_mul_assoc a1 a2 a3 }
k.mul (k.mul (k.mul a1 a2) a3) a4;
} | val lemma_mul_assoc4: #t:Type -> k:comm_monoid t -> a1:t -> a2:t -> a3:t -> a4:t ->
Lemma (k.mul a1 (k.mul (k.mul a2 a3) a4) == k.mul (k.mul (k.mul a1 a2) a3) a4)
let lemma_mul_assoc4 #t k a1 a2 a3 a4 = | false | null | true | calc ( == ) {
k.mul a1 (k.mul (k.mul a2 a3) a4);
( == ) { k.lemma_mul_assoc a1 (k.mul a2 a3) a4 }
k.mul (k.mul a1 (k.mul a2 a3)) a4;
( == ) { k.lemma_mul_assoc a1 a2 a3 }
k.mul (k.mul (k.mul a1 a2) a3) a4;
} | {
"checked_file": "Lib.Exponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.LoopCombinators.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
... | [
"lemma"
] | [
"Lib.Exponentiation.Definition.comm_monoid",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Lib.Exponentiation.Definition.__proj__Mkcomm_monoid__item__mul",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"FStar.Calc.calc_init",
"FStar.Calc.calc_pack",
"Lib... | [] | module Lib.Exponentiation
open FStar.Mul
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val lemma_b_mod_pow2i: bBits:nat -> b:nat{b < pow2 bBits} -> i:pos{i <= bBits} ->
Lemma (b % pow2 i == b / pow2 (i - 1) % 2 * pow2 (i - 1) + b % pow2 (i - 1))
let lemma_b_mod_pow2i bBits b i... | false | false | Lib.Exponentiation.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val lemma_mul_assoc4: #t:Type -> k:comm_monoid t -> a1:t -> a2:t -> a3:t -> a4:t ->
Lemma (k.mul a1 (k.mul (k.mul a2 a3) a4) == k.mul (k.mul (k.mul a1 a2) a3) a4) | [] | Lib.Exponentiation.lemma_mul_assoc4 | {
"file_name": "lib/Lib.Exponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | k: Lib.Exponentiation.Definition.comm_monoid t -> a1: t -> a2: t -> a3: t -> a4: t
-> FStar.Pervasives.Lemma
(ensures
Mkcomm_monoid?.mul k a1 (Mkcomm_monoid?.mul k (Mkcomm_monoid?.mul k a2 a3) a4) ==
Mkcomm_monoid?.mul k (Mkcomm_monoid?.mul k (Mkcomm_monoid?.mul k a1 a2) a3) a4) | {
"end_col": 3,
"end_line": 543,
"start_col": 2,
"start_line": 537
} |
Prims.Tot | val b_acc (l: pos) (bBits: nat) (b: nat{b < pow2 bBits}) (i: nat{i <= bBits / l}) : nat | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Exponentiation.Definition",
"short_module": null
},
{
"abbrev": true,
... | false | let b_acc (l:pos) (bBits:nat) (b:nat{b < pow2 bBits}) (i:nat{i <= bBits / l}) : nat =
b / pow2 (bBits - bBits % l - l * i) | val b_acc (l: pos) (bBits: nat) (b: nat{b < pow2 bBits}) (i: nat{i <= bBits / l}) : nat
let b_acc (l: pos) (bBits: nat) (b: nat{b < pow2 bBits}) (i: nat{i <= bBits / l}) : nat = | false | null | false | b / pow2 (bBits - bBits % l - l * i) | {
"checked_file": "Lib.Exponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.LoopCombinators.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
... | [
"total"
] | [
"Prims.pos",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"Prims.op_LessThanOrEqual",
"Prims.op_Division",
"Prims.op_Subtraction",
"Prims.op_Modulus",
"FStar.Mul.op_Star"
] | [] | module Lib.Exponentiation
open FStar.Mul
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val lemma_b_mod_pow2i: bBits:nat -> b:nat{b < pow2 bBits} -> i:pos{i <= bBits} ->
Lemma (b % pow2 i == b / pow2 (i - 1) % 2 * pow2 (i - 1) + b % pow2 (i - 1))
let lemma_b_mod_pow2i bBits b i... | false | false | Lib.Exponentiation.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val b_acc (l: pos) (bBits: nat) (b: nat{b < pow2 bBits}) (i: nat{i <= bBits / l}) : nat | [] | Lib.Exponentiation.b_acc | {
"file_name": "lib/Lib.Exponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
l: Prims.pos ->
bBits: Prims.nat ->
b: Prims.nat{b < Prims.pow2 bBits} ->
i: Prims.nat{i <= bBits / l}
-> Prims.nat | {
"end_col": 38,
"end_line": 23,
"start_col": 2,
"start_line": 23
} |
FStar.Pervasives.Lemma | val exp_double_fw_lemma: #t:Type -> k:comm_monoid t
-> a1:t -> bBits:nat -> b1:nat{b1 < pow2 bBits}
-> a2:t -> b2:nat{b2 < pow2 bBits} -> l:pos ->
Lemma (exp_double_fw k a1 bBits b1 a2 b2 l == mul (pow k a1 b1) (pow k a2 b2)) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Exponentiation.Definition",
"short_module": null
},
{
"abbrev": true,
... | false | let exp_double_fw_lemma #t k a1 bBits b1 a2 b2 l =
let acc0 = if bBits % l = 0 then one else exp_double_fw_acc0 k a1 bBits b1 a2 b2 l in
exp_double_fw_acc0_lemma #t k a1 bBits b1 a2 b2 l;
assert (acc0 == mul (pow k a1 (b_acc l bBits b1 0)) (pow k a2 (b_acc l bBits b2 0)));
let res = Loops.repeati (bBits / l) (... | val exp_double_fw_lemma: #t:Type -> k:comm_monoid t
-> a1:t -> bBits:nat -> b1:nat{b1 < pow2 bBits}
-> a2:t -> b2:nat{b2 < pow2 bBits} -> l:pos ->
Lemma (exp_double_fw k a1 bBits b1 a2 b2 l == mul (pow k a1 b1) (pow k a2 b2))
let exp_double_fw_lemma #t k a1 bBits b1 a2 b2 l = | false | null | true | let acc0 = if bBits % l = 0 then one else exp_double_fw_acc0 k a1 bBits b1 a2 b2 l in
exp_double_fw_acc0_lemma #t k a1 bBits b1 a2 b2 l;
assert (acc0 == mul (pow k a1 (b_acc l bBits b1 0)) (pow k a2 (b_acc l bBits b2 0)));
let res = Loops.repeati (bBits / l) (exp_double_fw_f k a1 bBits b1 a2 b2 l) acc0 in
exp_double_fw... | {
"checked_file": "Lib.Exponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.LoopCombinators.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
... | [
"lemma"
] | [
"Lib.Exponentiation.Definition.comm_monoid",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"Prims.pos",
"FStar.Pervasives.assert_norm",
"Prims.op_Equality",
"Prims.int",
"Prims.unit",
"FStar.Math.Lemmas.euclidean_division_definition",
"Lib.Exponentiation.exp_double_fw_lemma_loop... | [] | module Lib.Exponentiation
open FStar.Mul
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val lemma_b_mod_pow2i: bBits:nat -> b:nat{b < pow2 bBits} -> i:pos{i <= bBits} ->
Lemma (b % pow2 i == b / pow2 (i - 1) % 2 * pow2 (i - 1) + b % pow2 (i - 1))
let lemma_b_mod_pow2i bBits b i... | false | false | Lib.Exponentiation.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val exp_double_fw_lemma: #t:Type -> k:comm_monoid t
-> a1:t -> bBits:nat -> b1:nat{b1 < pow2 bBits}
-> a2:t -> b2:nat{b2 < pow2 bBits} -> l:pos ->
Lemma (exp_double_fw k a1 bBits b1 a2 b2 l == mul (pow k a1 b1) (pow k a2 b2)) | [] | Lib.Exponentiation.exp_double_fw_lemma | {
"file_name": "lib/Lib.Exponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
k: Lib.Exponentiation.Definition.comm_monoid t ->
a1: t ->
bBits: Prims.nat ->
b1: Prims.nat{b1 < Prims.pow2 bBits} ->
a2: t ->
b2: Prims.nat{b2 < Prims.pow2 bBits} ->
l: Prims.pos
-> FStar.Pervasives.Lemma
(ensures
Lib.Exponentiation.exp_double_fw k a1 bBits b1 a2 b2 l ==
... | {
"end_col": 26,
"end_line": 529,
"start_col": 50,
"start_line": 521
} |
FStar.Pervasives.Lemma | val exp_fw_lemma: #t:Type -> k:comm_monoid t -> a:t -> bBits:nat -> b:nat{b < pow2 bBits} -> l:pos ->
Lemma (exp_fw k a bBits b l == pow k a b) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Exponentiation.Definition",
"short_module": null
},
{
"abbrev": true,
... | false | let exp_fw_lemma #t k a bBits b l =
let b_rem = b_acc l bBits b 0 in
let acc0 = if bBits % l = 0 then one else exp_fw_acc0 k a bBits b l in
exp_fw_acc0_aux_lemma k a bBits b l;
assert (acc0 == pow k a b_rem);
let res = Loops.repeati (bBits / l) (exp_fw_f k a bBits b l) acc0 in
exp_fw_lemma_loop k a bBits b... | val exp_fw_lemma: #t:Type -> k:comm_monoid t -> a:t -> bBits:nat -> b:nat{b < pow2 bBits} -> l:pos ->
Lemma (exp_fw k a bBits b l == pow k a b)
let exp_fw_lemma #t k a bBits b l = | false | null | true | let b_rem = b_acc l bBits b 0 in
let acc0 = if bBits % l = 0 then one else exp_fw_acc0 k a bBits b l in
exp_fw_acc0_aux_lemma k a bBits b l;
assert (acc0 == pow k a b_rem);
let res = Loops.repeati (bBits / l) (exp_fw_f k a bBits b l) acc0 in
exp_fw_lemma_loop k a bBits b l (bBits / l);
assert (res == pow k a (b_acc l b... | {
"checked_file": "Lib.Exponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.LoopCombinators.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
... | [
"lemma"
] | [
"Lib.Exponentiation.Definition.comm_monoid",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"Prims.pos",
"FStar.Pervasives.assert_norm",
"Prims.op_Equality",
"Prims.int",
"Prims.unit",
"Prims._assert",
"Prims.eq2",
"Lib.Exponentiation.Definition.pow",
"Prims.op_Division",
"... | [] | module Lib.Exponentiation
open FStar.Mul
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val lemma_b_mod_pow2i: bBits:nat -> b:nat{b < pow2 bBits} -> i:pos{i <= bBits} ->
Lemma (b % pow2 i == b / pow2 (i - 1) % 2 * pow2 (i - 1) + b % pow2 (i - 1))
let lemma_b_mod_pow2i bBits b i... | false | false | Lib.Exponentiation.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val exp_fw_lemma: #t:Type -> k:comm_monoid t -> a:t -> bBits:nat -> b:nat{b < pow2 bBits} -> l:pos ->
Lemma (exp_fw k a bBits b l == pow k a b) | [] | Lib.Exponentiation.exp_fw_lemma | {
"file_name": "lib/Lib.Exponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
k: Lib.Exponentiation.Definition.comm_monoid t ->
a: t ->
bBits: Prims.nat ->
b: Prims.nat{b < Prims.pow2 bBits} ->
l: Prims.pos
-> FStar.Pervasives.Lemma
(ensures Lib.Exponentiation.exp_fw k a bBits b l == Lib.Exponentiation.Definition.pow k a b) | {
"end_col": 26,
"end_line": 404,
"start_col": 35,
"start_line": 393
} |
FStar.Pervasives.Lemma | val exp_fw_acc0_aux_lemma:
#t:Type -> k:comm_monoid t
-> a:t -> bBits:nat -> b:nat{b < pow2 bBits}
-> l:pos ->
Lemma (let acc0 = if bBits % l = 0 then one else exp_fw_acc0 k a bBits b l in
acc0 == pow k a (b_acc l bBits b 0)) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Exponentiation.Definition",
"short_module": null
},
{
"abbrev": true,
... | false | let exp_fw_acc0_aux_lemma #t k a bBits b l =
if bBits % l = 0 then begin
let acc = one in
assert (bBits / l * l == bBits);
Math.Lemmas.small_div b (pow2 bBits);
assert (b / pow2 (bBits / l * l) == 0);
lemma_pow0 k a;
assert (acc == pow k a (b / pow2 (bBits / l * l)));
() end
else
exp... | val exp_fw_acc0_aux_lemma:
#t:Type -> k:comm_monoid t
-> a:t -> bBits:nat -> b:nat{b < pow2 bBits}
-> l:pos ->
Lemma (let acc0 = if bBits % l = 0 then one else exp_fw_acc0 k a bBits b l in
acc0 == pow k a (b_acc l bBits b 0))
let exp_fw_acc0_aux_lemma #t k a bBits b l = | false | null | true | if bBits % l = 0
then
let acc = one in
assert ((bBits / l) * l == bBits);
Math.Lemmas.small_div b (pow2 bBits);
assert (b / pow2 ((bBits / l) * l) == 0);
lemma_pow0 k a;
assert (acc == pow k a (b / pow2 ((bBits / l) * l)));
()
else exp_fw_acc0_lemma #t k a bBits b l | {
"checked_file": "Lib.Exponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.LoopCombinators.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
... | [
"lemma"
] | [
"Lib.Exponentiation.Definition.comm_monoid",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"Prims.pos",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Prims.unit",
"Prims._assert",
"Prims.eq2",
"Lib.Exponentiation.Definition.pow",
"Prims.op_Division",
"FStar.Mul.op... | [] | module Lib.Exponentiation
open FStar.Mul
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val lemma_b_mod_pow2i: bBits:nat -> b:nat{b < pow2 bBits} -> i:pos{i <= bBits} ->
Lemma (b % pow2 i == b / pow2 (i - 1) % 2 * pow2 (i - 1) + b % pow2 (i - 1))
let lemma_b_mod_pow2i bBits b i... | false | false | Lib.Exponentiation.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val exp_fw_acc0_aux_lemma:
#t:Type -> k:comm_monoid t
-> a:t -> bBits:nat -> b:nat{b < pow2 bBits}
-> l:pos ->
Lemma (let acc0 = if bBits % l = 0 then one else exp_fw_acc0 k a bBits b l in
acc0 == pow k a (b_acc l bBits b 0)) | [] | Lib.Exponentiation.exp_fw_acc0_aux_lemma | {
"file_name": "lib/Lib.Exponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
k: Lib.Exponentiation.Definition.comm_monoid t ->
a: t ->
bBits: Prims.nat ->
b: Prims.nat{b < Prims.pow2 bBits} ->
l: Prims.pos
-> FStar.Pervasives.Lemma
(ensures
(let acc0 =
(match bBits % l = 0 with
| true -> Lib.Exponentiation.Definition.one
| _ -> ... | {
"end_col": 38,
"end_line": 390,
"start_col": 2,
"start_line": 381
} |
FStar.Pervasives.Lemma | val exp_four_fw_lemma: #t:Type -> k:comm_monoid t
-> a1:t -> bBits:nat -> b1:nat{b1 < pow2 bBits}
-> a2:t -> b2:nat{b2 < pow2 bBits}
-> a3:t -> b3:nat{b3 < pow2 bBits}
-> a4:t -> b4:nat{b4 < pow2 bBits}
-> l:pos ->
Lemma (exp_four_fw k a1 bBits b1 a2 b2 a3 b3 a4 b4 l ==
mul (mul (mul (pow k a1 b1) (pow ... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Exponentiation.Definition",
"short_module": null
},
{
"abbrev": true,
... | false | let exp_four_fw_lemma #t k a1 bBits b1 a2 b2 a3 b3 a4 b4 l =
let b1_rem = b_acc l bBits b1 0 in
let b2_rem = b_acc l bBits b2 0 in
let b3_rem = b_acc l bBits b3 0 in
let b4_rem = b_acc l bBits b4 0 in
let acc0 =
if bBits % l = 0 then one
else exp_four_fw_acc0 k a1 bBits b1 a2 b2 a3 b3 a4 b4 l in
ex... | val exp_four_fw_lemma: #t:Type -> k:comm_monoid t
-> a1:t -> bBits:nat -> b1:nat{b1 < pow2 bBits}
-> a2:t -> b2:nat{b2 < pow2 bBits}
-> a3:t -> b3:nat{b3 < pow2 bBits}
-> a4:t -> b4:nat{b4 < pow2 bBits}
-> l:pos ->
Lemma (exp_four_fw k a1 bBits b1 a2 b2 a3 b3 a4 b4 l ==
mul (mul (mul (pow k a1 b1) (pow ... | false | null | true | let b1_rem = b_acc l bBits b1 0 in
let b2_rem = b_acc l bBits b2 0 in
let b3_rem = b_acc l bBits b3 0 in
let b4_rem = b_acc l bBits b4 0 in
let acc0 = if bBits % l = 0 then one else exp_four_fw_acc0 k a1 bBits b1 a2 b2 a3 b3 a4 b4 l in
exp_four_fw_acc0_lemma #t k a1 bBits b1 a2 b2 a3 b3 a4 b4 l;
assert (acc0 ==
mul... | {
"checked_file": "Lib.Exponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.LoopCombinators.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
... | [
"lemma"
] | [
"Lib.Exponentiation.Definition.comm_monoid",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"Prims.pos",
"FStar.Pervasives.assert_norm",
"Prims.op_Equality",
"Prims.int",
"Prims.unit",
"Lib.Exponentiation.exp_four_fw_lemma_loop",
"Prims.op_Division",
"Lib.LoopCombinators.repeat... | [] | module Lib.Exponentiation
open FStar.Mul
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val lemma_b_mod_pow2i: bBits:nat -> b:nat{b < pow2 bBits} -> i:pos{i <= bBits} ->
Lemma (b % pow2 i == b / pow2 (i - 1) % 2 * pow2 (i - 1) + b % pow2 (i - 1))
let lemma_b_mod_pow2i bBits b i... | false | false | Lib.Exponentiation.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val exp_four_fw_lemma: #t:Type -> k:comm_monoid t
-> a1:t -> bBits:nat -> b1:nat{b1 < pow2 bBits}
-> a2:t -> b2:nat{b2 < pow2 bBits}
-> a3:t -> b3:nat{b3 < pow2 bBits}
-> a4:t -> b4:nat{b4 < pow2 bBits}
-> l:pos ->
Lemma (exp_four_fw k a1 bBits b1 a2 b2 a3 b3 a4 b4 l ==
mul (mul (mul (pow k a1 b1) (pow ... | [] | Lib.Exponentiation.exp_four_fw_lemma | {
"file_name": "lib/Lib.Exponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
k: Lib.Exponentiation.Definition.comm_monoid t ->
a1: t ->
bBits: Prims.nat ->
b1: Prims.nat{b1 < Prims.pow2 bBits} ->
a2: t ->
b2: Prims.nat{b2 < Prims.pow2 bBits} ->
a3: t ->
b3: Prims.nat{b3 < Prims.pow2 bBits} ->
a4: t ->
b4: Prims.nat{b4 < Prims.pow2 bBits} ->
l: Prims.... | {
"end_col": 26,
"end_line": 780,
"start_col": 60,
"start_line": 758
} |
FStar.Pervasives.Lemma | val exp_lr_lemma_step:
#t:Type -> k:comm_monoid t
-> a:t -> bBits:nat -> b:nat{b < pow2 bBits}
-> i:nat{i < bBits}
-> acc1:t -> Lemma
(requires acc1 == pow k a (b / pow2 (bBits - i)))
(ensures exp_lr_f k a bBits b i acc1 == pow k a (b / pow2 (bBits - i - 1))) | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Exponentiation.Definition",
"short_module": null
},
{
"abbrev": true,
... | false | let exp_lr_lemma_step #t k a bBits b i acc1 =
let acc = exp_lr_f k a bBits b i acc1 in
lemma_b_div_pow2i bBits b (i + 1);
assert (b / pow2 (bBits - i - 1) == b / pow2 (bBits - i) * 2 + b / pow2 (bBits - i - 1) % 2);
lemma_pow_add k a (b / pow2 (bBits - i)) (b / pow2 (bBits - i));
assert (mul acc1 acc1 == pow ... | val exp_lr_lemma_step:
#t:Type -> k:comm_monoid t
-> a:t -> bBits:nat -> b:nat{b < pow2 bBits}
-> i:nat{i < bBits}
-> acc1:t -> Lemma
(requires acc1 == pow k a (b / pow2 (bBits - i)))
(ensures exp_lr_f k a bBits b i acc1 == pow k a (b / pow2 (bBits - i - 1)))
let exp_lr_lemma_step #t k a bBits b i acc1 = | false | null | true | let acc = exp_lr_f k a bBits b i acc1 in
lemma_b_div_pow2i bBits b (i + 1);
assert (b / pow2 (bBits - i - 1) == (b / pow2 (bBits - i)) * 2 + b / pow2 (bBits - i - 1) % 2);
lemma_pow_add k a (b / pow2 (bBits - i)) (b / pow2 (bBits - i));
assert (mul acc1 acc1 == pow k a ((b / pow2 (bBits - i)) * 2));
if (b / pow2 (bBits... | {
"checked_file": "Lib.Exponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.LoopCombinators.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
... | [
"lemma"
] | [
"Lib.Exponentiation.Definition.comm_monoid",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Prims.op_Division",
"Prims.op_Subtraction",
"Prims.bool",
"Prims.unit",
"Lib.Exponentiation.Definition.lemma_pow_add",
"FStar.Mul... | [] | module Lib.Exponentiation
open FStar.Mul
module Loops = Lib.LoopCombinators
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val lemma_b_mod_pow2i: bBits:nat -> b:nat{b < pow2 bBits} -> i:pos{i <= bBits} ->
Lemma (b % pow2 i == b / pow2 (i - 1) % 2 * pow2 (i - 1) + b % pow2 (i - 1))
let lemma_b_mod_pow2i bBits b i... | false | false | Lib.Exponentiation.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val exp_lr_lemma_step:
#t:Type -> k:comm_monoid t
-> a:t -> bBits:nat -> b:nat{b < pow2 bBits}
-> i:nat{i < bBits}
-> acc1:t -> Lemma
(requires acc1 == pow k a (b / pow2 (bBits - i)))
(ensures exp_lr_f k a bBits b i acc1 == pow k a (b / pow2 (bBits - i - 1))) | [] | Lib.Exponentiation.exp_lr_lemma_step | {
"file_name": "lib/Lib.Exponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
k: Lib.Exponentiation.Definition.comm_monoid t ->
a: t ->
bBits: Prims.nat ->
b: Prims.nat{b < Prims.pow2 bBits} ->
i: Prims.nat{i < bBits} ->
acc1: t
-> FStar.Pervasives.Lemma
(requires acc1 == Lib.Exponentiation.Definition.pow k a (b / Prims.pow2 (bBits - i)))
(ensures
L... | {
"end_col": 10,
"end_line": 120,
"start_col": 45,
"start_line": 108
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.