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 smul_add_felem5:
#m1:scale64
-> #m2:scale64_5
-> #m3:scale128_5
-> u1:uint64{felem_fits1 u1 m1}
-> f2:felem5{felem_fits5 f2 m2}
-> acc1:felem_wide5{felem_wide_fits5 acc1 m3 /\ m3 +* m1 *^ m2 <=* s128x5 67108864}
-> acc2:felem_wide5{
wide_as_nat5 acc2 == wide_as_nat5 acc1 + uint_v u1 * as_nat5 ... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | false | let smul_add_felem5 #m1 #m2 #m3 u1 (f20, f21, f22, f23, f24) (o0, o1, o2, o3, o4) =
let (m20, m21, m22, m23, m24) = m2 in
let (m30, m31, m32, m33, m34) = m3 in
[@inline_let]
let o0' = mul_add_wide128 #m1 #m20 #m30 u1 f20 o0 in
[@inline_let]
let o1' = mul_add_wide128 #m1 #m21 #m31 u1 f21 o1 in
[@inline_let... | val smul_add_felem5:
#m1:scale64
-> #m2:scale64_5
-> #m3:scale128_5
-> u1:uint64{felem_fits1 u1 m1}
-> f2:felem5{felem_fits5 f2 m2}
-> acc1:felem_wide5{felem_wide_fits5 acc1 m3 /\ m3 +* m1 *^ m2 <=* s128x5 67108864}
-> acc2:felem_wide5{
wide_as_nat5 acc2 == wide_as_nat5 acc1 + uint_v u1 * as_nat5 ... | false | null | false | let m20, m21, m22, m23, m24 = m2 in
let m30, m31, m32, m33, m34 = m3 in
[@@ inline_let ]let o0' = mul_add_wide128 #m1 #m20 #m30 u1 f20 o0 in
[@@ inline_let ]let o1' = mul_add_wide128 #m1 #m21 #m31 u1 f21 o1 in
[@@ inline_let ]let o2' = mul_add_wide128 #m1 #m22 #m32 u1 f22 o2 in
[@@ inline_let ]let o3' = mul_add_wide128... | {
"checked_file": "Hacl.Spec.Curve25519.Field51.fst.checked",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checke... | [
"total"
] | [
"Hacl.Spec.Curve25519.Field51.Definition.scale64",
"Hacl.Spec.Curve25519.Field51.Definition.scale64_5",
"Hacl.Spec.Curve25519.Field51.Definition.scale128_5",
"Lib.IntTypes.uint64",
"Prims.b2t",
"Hacl.Spec.Curve25519.Field51.Definition.felem_fits1",
"Hacl.Spec.Curve25519.Field51.Definition.felem5",
"Ha... | [] | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | false | false | Hacl.Spec.Curve25519.Field51.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 smul_add_felem5:
#m1:scale64
-> #m2:scale64_5
-> #m3:scale128_5
-> u1:uint64{felem_fits1 u1 m1}
-> f2:felem5{felem_fits5 f2 m2}
-> acc1:felem_wide5{felem_wide_fits5 acc1 m3 /\ m3 +* m1 *^ m2 <=* s128x5 67108864}
-> acc2:felem_wide5{
wide_as_nat5 acc2 == wide_as_nat5 acc1 + uint_v u1 * as_nat5 ... | [] | Hacl.Spec.Curve25519.Field51.smul_add_felem5 | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
u1: Lib.IntTypes.uint64{Hacl.Spec.Curve25519.Field51.Definition.felem_fits1 u1 m1} ->
f2:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 f2 m2} ->
acc1:
Hacl.Spec.Curve25519.Field51.Definition.felem_wide5
{ Hacl.Spec.Curve2551... | {
"end_col": 5,
"end_line": 168,
"start_col": 83,
"start_line": 152
} |
Prims.Pure | val mul64_wide_add3:
#m0:scale64 -> #m1:scale64 -> #m2:scale64
-> #m3:scale64 -> #m4:scale64 -> #m5:scale64
-> a0:uint64{felem_fits1 a0 m0}
-> a1:uint64{felem_fits1 a1 m1}
-> b0:uint64{felem_fits1 b0 m2}
-> b1:uint64{felem_fits1 b1 m3}
-> c0:uint64{felem_fits1 c0 m4}
-> c1:uint64{felem_fits1 c1 m5} ->... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | false | let mul64_wide_add3 #m0 #m1 #m2 #m3 #m4 #m5 a0 a1 b0 b1 c0 c1 =
assert_norm (pow2 13 = 8192);
mul64_wide_add3_lemma #m0 #m1 #m2 #m3 #m4 #m5 a0 a1 b0 b1 c0 c1;
mul64_wide a0 a1 +! mul64_wide b0 b1 +! mul64_wide c0 c1 | val mul64_wide_add3:
#m0:scale64 -> #m1:scale64 -> #m2:scale64
-> #m3:scale64 -> #m4:scale64 -> #m5:scale64
-> a0:uint64{felem_fits1 a0 m0}
-> a1:uint64{felem_fits1 a1 m1}
-> b0:uint64{felem_fits1 b0 m2}
-> b1:uint64{felem_fits1 b1 m3}
-> c0:uint64{felem_fits1 c0 m4}
-> c1:uint64{felem_fits1 c1 m5} ->... | false | null | false | assert_norm (pow2 13 = 8192);
mul64_wide_add3_lemma #m0 #m1 #m2 #m3 #m4 #m5 a0 a1 b0 b1 c0 c1;
mul64_wide a0 a1 +! mul64_wide b0 b1 +! mul64_wide c0 c1 | {
"checked_file": "Hacl.Spec.Curve25519.Field51.fst.checked",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checke... | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.scale64",
"Lib.IntTypes.uint64",
"Prims.b2t",
"Hacl.Spec.Curve25519.Field51.Definition.felem_fits1",
"Lib.IntTypes.op_Plus_Bang",
"Lib.IntTypes.U128",
"Lib.IntTypes.SEC",
"Lib.IntTypes.mul64_wide",
"Prims.unit",
"Hacl.Spec.Curve25519.Field51.Lemmas.mul64_wi... | [] | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | false | false | Hacl.Spec.Curve25519.Field51.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 mul64_wide_add3:
#m0:scale64 -> #m1:scale64 -> #m2:scale64
-> #m3:scale64 -> #m4:scale64 -> #m5:scale64
-> a0:uint64{felem_fits1 a0 m0}
-> a1:uint64{felem_fits1 a1 m1}
-> b0:uint64{felem_fits1 b0 m2}
-> b1:uint64{felem_fits1 b1 m3}
-> c0:uint64{felem_fits1 c0 m4}
-> c1:uint64{felem_fits1 c1 m5} ->... | [] | Hacl.Spec.Curve25519.Field51.mul64_wide_add3 | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
a0: Lib.IntTypes.uint64{Hacl.Spec.Curve25519.Field51.Definition.felem_fits1 a0 m0} ->
a1: Lib.IntTypes.uint64{Hacl.Spec.Curve25519.Field51.Definition.felem_fits1 a1 m1} ->
b0: Lib.IntTypes.uint64{Hacl.Spec.Curve25519.Field51.Definition.felem_fits1 b0 m2} ->
b1: Lib.IntTypes.uint64{Hacl.Spec.Curve25519.... | {
"end_col": 58,
"end_line": 380,
"start_col": 2,
"start_line": 378
} |
Prims.Pure | val carry_wide5:
inp:felem_wide5{felem_wide_fits5 inp (6579, 4797, 3340, 1881, 423)}
-> Pure felem5
(requires True)
(ensures fun out ->
mul_inv_t out /\ feval out == feval_wide inp) | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | false | let carry_wide5 (i0, i1, i2, i3, i4) =
assert_norm (6579 < pow2 13);
assert_norm (pow2 13 < max51);
let tmp0, c0 = carry51_wide #6579 i0 (u64 0) in
let tmp1, c1 = carry51_wide #4797 i1 c0 in
let tmp2, c2 = carry51_wide #3340 i2 c1 in
let tmp3, c3 = carry51_wide #1881 i3 c2 in
let tmp4, c4 = carry51_wide #... | val carry_wide5:
inp:felem_wide5{felem_wide_fits5 inp (6579, 4797, 3340, 1881, 423)}
-> Pure felem5
(requires True)
(ensures fun out ->
mul_inv_t out /\ feval out == feval_wide inp)
let carry_wide5 (i0, i1, i2, i3, i4) = | false | null | false | assert_norm (6579 < pow2 13);
assert_norm (pow2 13 < max51);
let tmp0, c0 = carry51_wide #6579 i0 (u64 0) in
let tmp1, c1 = carry51_wide #4797 i1 c0 in
let tmp2, c2 = carry51_wide #3340 i2 c1 in
let tmp3, c3 = carry51_wide #1881 i3 c2 in
let tmp4, c4 = carry51_wide #423 i4 c3 in
lemma_carry5_simplify c0 c1 c2 c3 c4 tmp... | {
"checked_file": "Hacl.Spec.Curve25519.Field51.fst.checked",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checke... | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.felem_wide5",
"Hacl.Spec.Curve25519.Field51.Definition.felem_wide_fits5",
"FStar.Pervasives.Native.Mktuple5",
"Prims.nat",
"Lib.IntTypes.uint128",
"Lib.IntTypes.uint64",
"Prims.unit",
"Hacl.Spec.Curve25519.Field51.lemma_mul_inv",
"Lib.IntTypes.int_t",
"Lib.... | [] | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | false | false | Hacl.Spec.Curve25519.Field51.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 carry_wide5:
inp:felem_wide5{felem_wide_fits5 inp (6579, 4797, 3340, 1881, 423)}
-> Pure felem5
(requires True)
(ensures fun out ->
mul_inv_t out /\ feval out == feval_wide inp) | [] | Hacl.Spec.Curve25519.Field51.carry_wide5 | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
inp:
Hacl.Spec.Curve25519.Field51.Definition.felem_wide5
{Hacl.Spec.Curve25519.Field51.Definition.felem_wide_fits5 inp (6579, 4797, 3340, 1881, 423)}
-> Prims.Pure Hacl.Spec.Curve25519.Field51.Definition.felem5 | {
"end_col": 34,
"end_line": 282,
"start_col": 2,
"start_line": 269
} |
Prims.Tot | val carry_felem5_full:
inp:felem5{mul_inv_t inp}
-> out:felem5{feval out == feval inp /\ felem_fits5 out (1, 1, 1, 1, 1)} | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
... | false | let carry_felem5_full (f0, f1, f2, f3, f4) =
assert_norm (pow51 = pow2 51);
let tmp0, c0 = carry51 f0 (u64 0) in
let tmp1, c1 = carry51 f1 c0 in
assert (if v f1 < pow2 51 then v tmp1 < pow2 51 else v tmp1 < 8192);
let tmp2, c2 = carry51 f2 c1 in
let tmp3, c3 = carry51 f3 c2 in
let tmp4, c4 = carry51 f4 c3... | val carry_felem5_full:
inp:felem5{mul_inv_t inp}
-> out:felem5{feval out == feval inp /\ felem_fits5 out (1, 1, 1, 1, 1)}
let carry_felem5_full (f0, f1, f2, f3, f4) = | false | null | false | assert_norm (pow51 = pow2 51);
let tmp0, c0 = carry51 f0 (u64 0) in
let tmp1, c1 = carry51 f1 c0 in
assert (if v f1 < pow2 51 then v tmp1 < pow2 51 else v tmp1 < 8192);
let tmp2, c2 = carry51 f2 c1 in
let tmp3, c3 = carry51 f3 c2 in
let tmp4, c4 = carry51 f4 c3 in
lemma_carry5_simplify c0 c1 c2 c3 c4 tmp0 tmp1 tmp2 tmp... | {
"checked_file": "Hacl.Spec.Curve25519.Field51.fst.checked",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Lemmas.fst.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checke... | [
"total"
] | [
"Hacl.Spec.Curve25519.Field51.Definition.felem5",
"Hacl.Spec.Curve25519.Field51.mul_inv_t",
"Lib.IntTypes.uint64",
"FStar.Pervasives.Native.Mktuple5",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U64",
"Lib.IntTypes.SEC",
"Lib.IntTypes.op_Plus_Bang",
"Prims.l_and",
"Prims.eq2",
"Spec.Curve25519.elem",
... | [] | module Hacl.Spec.Curve25519.Field51
open Lib.Sequence
open Lib.IntTypes
open FStar.Mul
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
open Hacl.Spec.Curve25519.Field51.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0 --using_facts_from '* -FStar.Seq'"
inline_for_extraction noextract
val fa... | false | false | Hacl.Spec.Curve25519.Field51.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 2,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val carry_felem5_full:
inp:felem5{mul_inv_t inp}
-> out:felem5{feval out == feval inp /\ felem_fits5 out (1, 1, 1, 1, 1)} | [] | Hacl.Spec.Curve25519.Field51.carry_felem5_full | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | inp: Hacl.Spec.Curve25519.Field51.Definition.felem5{Hacl.Spec.Curve25519.Field51.mul_inv_t inp}
-> out:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{ Hacl.Spec.Curve25519.Field51.Definition.feval out ==
Hacl.Spec.Curve25519.Field51.Definition.feval inp /\
Hacl.Spec.Curve25519.Field51.Defi... | {
"end_col": 34,
"end_line": 455,
"start_col": 2,
"start_line": 443
} |
Prims.Tot | val ecdh: ecdh_st M51 True | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Curve25519.Field51",
"short_module": "C"
},
{
"abbrev": false,
"full_module": "Hacl.Meta.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Curve25519.Fields",
"short_module": null
},
{
"ab... | false | let ecdh = generic_ecdh_higher #M51 True scalarmult | val ecdh: ecdh_st M51 True
let ecdh = | false | null | false | generic_ecdh_higher #M51 True scalarmult | {
"checked_file": "Hacl.Curve25519_51.fst.checked",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Meta.Curve25519.fst.checked",
"Hacl.Impl.Curve25519.Field51.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
... | [
"total"
] | [
"Hacl.Meta.Curve25519.generic_ecdh_higher",
"Hacl.Impl.Curve25519.Fields.Core.M51",
"Prims.l_True",
"Hacl.Curve25519_51.scalarmult"
] | [] | module Hacl.Curve25519_51
friend Hacl.Meta.Curve25519
open Hacl.Meta.Curve25519
// The Hacl core.
module C = Hacl.Impl.Curve25519.Field51
let g25519: g25519_t =
Lib.Buffer.createL_global Spec.Curve25519.basepoint_list
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
let point_add_and_double =
addanddoub... | false | true | Hacl.Curve25519_51.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 ecdh: ecdh_st M51 True | [] | Hacl.Curve25519_51.ecdh | {
"file_name": "code/curve25519/Hacl.Curve25519_51.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Hacl.Impl.Curve25519.Generic.ecdh_st Hacl.Impl.Curve25519.Fields.Core.M51 Prims.l_True | {
"end_col": 51,
"end_line": 24,
"start_col": 11,
"start_line": 24
} |
Prims.Tot | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Curve25519.Field51",
"short_module": "C"
},
{
"abbrev": false,
"full_module": "Hacl.Meta.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Curve25519.Fields",
"short_module": null
},
{
"ab... | false | let montgomery_ladder =
generic_montgomery_ladder_higher #M51 True point_double C.cswap2 point_add_and_double | let montgomery_ladder = | false | null | false | generic_montgomery_ladder_higher #M51 True point_double C.cswap2 point_add_and_double | {
"checked_file": "Hacl.Curve25519_51.fst.checked",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Meta.Curve25519.fst.checked",
"Hacl.Impl.Curve25519.Field51.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
... | [
"total"
] | [
"Hacl.Meta.Curve25519.generic_montgomery_ladder_higher",
"Hacl.Impl.Curve25519.Fields.Core.M51",
"Prims.l_True",
"Hacl.Curve25519_51.point_double",
"Hacl.Impl.Curve25519.Field51.cswap2",
"Hacl.Curve25519_51.point_add_and_double"
] | [] | module Hacl.Curve25519_51
friend Hacl.Meta.Curve25519
open Hacl.Meta.Curve25519
// The Hacl core.
module C = Hacl.Impl.Curve25519.Field51
let g25519: g25519_t =
Lib.Buffer.createL_global Spec.Curve25519.basepoint_list
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
let point_add_and_double =
addanddoub... | false | true | Hacl.Curve25519_51.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 montgomery_ladder : Hacl.Meta.Curve25519.generic_montgomery_ladder_higher_t Prims.l_True | [] | Hacl.Curve25519_51.montgomery_ladder | {
"file_name": "code/curve25519/Hacl.Curve25519_51.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Hacl.Meta.Curve25519.generic_montgomery_ladder_higher_t Prims.l_True | {
"end_col": 87,
"end_line": 18,
"start_col": 2,
"start_line": 18
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Curve25519.Field51",
"short_module": "C"
},
{
"abbrev": false,
"full_module": "Hacl.Meta.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Curve25519.Fields",
"short_module": null
},
{
"ab... | false | let point_add_and_double =
addanddouble_point_add_and_double_higher #M51 True C.fmul C.fsqr2 C.fmul1 C.fmul2 C.fsub C.fadd | let point_add_and_double = | false | null | false | addanddouble_point_add_and_double_higher #M51 True C.fmul C.fsqr2 C.fmul1 C.fmul2 C.fsub C.fadd | {
"checked_file": "Hacl.Curve25519_51.fst.checked",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Meta.Curve25519.fst.checked",
"Hacl.Impl.Curve25519.Field51.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
... | [
"total"
] | [
"Hacl.Meta.Curve25519.addanddouble_point_add_and_double_higher",
"Hacl.Impl.Curve25519.Fields.Core.M51",
"Prims.l_True",
"Hacl.Impl.Curve25519.Field51.fmul",
"Hacl.Impl.Curve25519.Field51.fsqr2",
"Hacl.Impl.Curve25519.Field51.fmul1",
"Hacl.Impl.Curve25519.Field51.fmul2",
"Hacl.Impl.Curve25519.Field51.... | [] | module Hacl.Curve25519_51
friend Hacl.Meta.Curve25519
open Hacl.Meta.Curve25519
// The Hacl core.
module C = Hacl.Impl.Curve25519.Field51
let g25519: g25519_t =
Lib.Buffer.createL_global Spec.Curve25519.basepoint_list
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100" | false | true | Hacl.Curve25519_51.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 point_add_and_double : Hacl.Meta.Curve25519.addanddouble_point_add_and_double_higher_t Prims.l_True | [] | Hacl.Curve25519_51.point_add_and_double | {
"file_name": "code/curve25519/Hacl.Curve25519_51.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Hacl.Meta.Curve25519.addanddouble_point_add_and_double_higher_t Prims.l_True | {
"end_col": 97,
"end_line": 14,
"start_col": 2,
"start_line": 14
} | |
Prims.Tot | val secret_to_public: secret_to_public_st M51 True | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Curve25519.Field51",
"short_module": "C"
},
{
"abbrev": false,
"full_module": "Hacl.Meta.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Curve25519.Fields",
"short_module": null
},
{
"ab... | false | let secret_to_public = generic_secret_to_public_higher #M51 True scalarmult g25519 | val secret_to_public: secret_to_public_st M51 True
let secret_to_public = | false | null | false | generic_secret_to_public_higher #M51 True scalarmult g25519 | {
"checked_file": "Hacl.Curve25519_51.fst.checked",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Meta.Curve25519.fst.checked",
"Hacl.Impl.Curve25519.Field51.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
... | [
"total"
] | [
"Hacl.Meta.Curve25519.generic_secret_to_public_higher",
"Hacl.Impl.Curve25519.Fields.Core.M51",
"Prims.l_True",
"Hacl.Curve25519_51.scalarmult",
"Hacl.Curve25519_51.g25519"
] | [] | module Hacl.Curve25519_51
friend Hacl.Meta.Curve25519
open Hacl.Meta.Curve25519
// The Hacl core.
module C = Hacl.Impl.Curve25519.Field51
let g25519: g25519_t =
Lib.Buffer.createL_global Spec.Curve25519.basepoint_list
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
let point_add_and_double =
addanddoub... | false | true | Hacl.Curve25519_51.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 secret_to_public: secret_to_public_st M51 True | [] | Hacl.Curve25519_51.secret_to_public | {
"file_name": "code/curve25519/Hacl.Curve25519_51.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Hacl.Impl.Curve25519.Generic.secret_to_public_st Hacl.Impl.Curve25519.Fields.Core.M51 Prims.l_True | {
"end_col": 82,
"end_line": 23,
"start_col": 23,
"start_line": 23
} |
Prims.Tot | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Curve25519.Field51",
"short_module": "C"
},
{
"abbrev": false,
"full_module": "Hacl.Meta.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Curve25519.Fields",
"short_module": null
},
{
"ab... | false | let finv = finv_finv_higher #M51 True C.fmul fsquare_times | let finv = | false | null | false | finv_finv_higher #M51 True C.fmul fsquare_times | {
"checked_file": "Hacl.Curve25519_51.fst.checked",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Meta.Curve25519.fst.checked",
"Hacl.Impl.Curve25519.Field51.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
... | [
"total"
] | [
"Hacl.Meta.Curve25519.finv_finv_higher",
"Hacl.Impl.Curve25519.Fields.Core.M51",
"Prims.l_True",
"Hacl.Impl.Curve25519.Field51.fmul",
"Hacl.Curve25519_51.fsquare_times"
] | [] | module Hacl.Curve25519_51
friend Hacl.Meta.Curve25519
open Hacl.Meta.Curve25519
// The Hacl core.
module C = Hacl.Impl.Curve25519.Field51
let g25519: g25519_t =
Lib.Buffer.createL_global Spec.Curve25519.basepoint_list
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
let point_add_and_double =
addanddoub... | false | true | Hacl.Curve25519_51.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 finv : Hacl.Meta.Curve25519.finv_finv_higher_t Prims.l_True | [] | Hacl.Curve25519_51.finv | {
"file_name": "code/curve25519/Hacl.Curve25519_51.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Hacl.Meta.Curve25519.finv_finv_higher_t Prims.l_True | {
"end_col": 58,
"end_line": 20,
"start_col": 11,
"start_line": 20
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Curve25519.Field51",
"short_module": "C"
},
{
"abbrev": false,
"full_module": "Hacl.Meta.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Curve25519.Fields",
"short_module": null
},
{
"ab... | false | let point_double =
addanddouble_point_double_higher #M51 True C.fmul2 C.fmul1 C.fsqr2 C.fsub C.fadd | let point_double = | false | null | false | addanddouble_point_double_higher #M51 True C.fmul2 C.fmul1 C.fsqr2 C.fsub C.fadd | {
"checked_file": "Hacl.Curve25519_51.fst.checked",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Meta.Curve25519.fst.checked",
"Hacl.Impl.Curve25519.Field51.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
... | [
"total"
] | [
"Hacl.Meta.Curve25519.addanddouble_point_double_higher",
"Hacl.Impl.Curve25519.Fields.Core.M51",
"Prims.l_True",
"Hacl.Impl.Curve25519.Field51.fmul2",
"Hacl.Impl.Curve25519.Field51.fmul1",
"Hacl.Impl.Curve25519.Field51.fsqr2",
"Hacl.Impl.Curve25519.Field51.fsub",
"Hacl.Impl.Curve25519.Field51.fadd"
] | [] | module Hacl.Curve25519_51
friend Hacl.Meta.Curve25519
open Hacl.Meta.Curve25519
// The Hacl core.
module C = Hacl.Impl.Curve25519.Field51
let g25519: g25519_t =
Lib.Buffer.createL_global Spec.Curve25519.basepoint_list
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
let point_add_and_double =
addanddoub... | false | true | Hacl.Curve25519_51.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 point_double : Hacl.Meta.Curve25519.addanddouble_point_double_higher_t Prims.l_True | [] | Hacl.Curve25519_51.point_double | {
"file_name": "code/curve25519/Hacl.Curve25519_51.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Hacl.Meta.Curve25519.addanddouble_point_double_higher_t Prims.l_True | {
"end_col": 82,
"end_line": 16,
"start_col": 2,
"start_line": 16
} | |
Prims.Tot | val scalarmult: scalarmult_st M51 True | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Curve25519.Field51",
"short_module": "C"
},
{
"abbrev": false,
"full_module": "Hacl.Meta.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Curve25519.Fields",
"short_module": null
},
{
"ab... | false | let scalarmult = generic_scalarmult_higher #M51 True encode_point montgomery_ladder decode_point | val scalarmult: scalarmult_st M51 True
let scalarmult = | false | null | false | generic_scalarmult_higher #M51 True encode_point montgomery_ladder decode_point | {
"checked_file": "Hacl.Curve25519_51.fst.checked",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Meta.Curve25519.fst.checked",
"Hacl.Impl.Curve25519.Field51.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
... | [
"total"
] | [
"Hacl.Meta.Curve25519.generic_scalarmult_higher",
"Hacl.Impl.Curve25519.Fields.Core.M51",
"Prims.l_True",
"Hacl.Curve25519_51.encode_point",
"Hacl.Curve25519_51.montgomery_ladder",
"Hacl.Impl.Curve25519.Generic.decode_point"
] | [] | module Hacl.Curve25519_51
friend Hacl.Meta.Curve25519
open Hacl.Meta.Curve25519
// The Hacl core.
module C = Hacl.Impl.Curve25519.Field51
let g25519: g25519_t =
Lib.Buffer.createL_global Spec.Curve25519.basepoint_list
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
let point_add_and_double =
addanddoub... | false | true | Hacl.Curve25519_51.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 scalarmult: scalarmult_st M51 True | [] | Hacl.Curve25519_51.scalarmult | {
"file_name": "code/curve25519/Hacl.Curve25519_51.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Hacl.Impl.Curve25519.Generic.scalarmult_st Hacl.Impl.Curve25519.Fields.Core.M51 Prims.l_True | {
"end_col": 96,
"end_line": 22,
"start_col": 17,
"start_line": 22
} |
Prims.Tot | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Curve25519.Field51",
"short_module": "C"
},
{
"abbrev": false,
"full_module": "Hacl.Meta.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Curve25519.Fields",
"short_module": null
},
{
"ab... | false | let fsquare_times = finv_fsquare_times_higher #M51 True C.fsqr | let fsquare_times = | false | null | false | finv_fsquare_times_higher #M51 True C.fsqr | {
"checked_file": "Hacl.Curve25519_51.fst.checked",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Meta.Curve25519.fst.checked",
"Hacl.Impl.Curve25519.Field51.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
... | [
"total"
] | [
"Hacl.Meta.Curve25519.finv_fsquare_times_higher",
"Hacl.Impl.Curve25519.Fields.Core.M51",
"Prims.l_True",
"Hacl.Impl.Curve25519.Field51.fsqr"
] | [] | module Hacl.Curve25519_51
friend Hacl.Meta.Curve25519
open Hacl.Meta.Curve25519
// The Hacl core.
module C = Hacl.Impl.Curve25519.Field51
let g25519: g25519_t =
Lib.Buffer.createL_global Spec.Curve25519.basepoint_list
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
let point_add_and_double =
addanddoub... | false | true | Hacl.Curve25519_51.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 fsquare_times : Hacl.Meta.Curve25519.finv_fsquare_times_higher_t Prims.l_True | [] | Hacl.Curve25519_51.fsquare_times | {
"file_name": "code/curve25519/Hacl.Curve25519_51.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Hacl.Meta.Curve25519.finv_fsquare_times_higher_t Prims.l_True | {
"end_col": 62,
"end_line": 19,
"start_col": 20,
"start_line": 19
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Curve25519.Field51",
"short_module": "C"
},
{
"abbrev": false,
"full_module": "Hacl.Meta.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Curve25519.Fields",
"short_module": null
},
{
"ab... | false | let encode_point = generic_encode_point_higher #M51 True C.store_felem C.fmul finv | let encode_point = | false | null | false | generic_encode_point_higher #M51 True C.store_felem C.fmul finv | {
"checked_file": "Hacl.Curve25519_51.fst.checked",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Meta.Curve25519.fst.checked",
"Hacl.Impl.Curve25519.Field51.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
... | [
"total"
] | [
"Hacl.Meta.Curve25519.generic_encode_point_higher",
"Hacl.Impl.Curve25519.Fields.Core.M51",
"Prims.l_True",
"Hacl.Impl.Curve25519.Field51.store_felem",
"Hacl.Impl.Curve25519.Field51.fmul",
"Hacl.Curve25519_51.finv"
] | [] | module Hacl.Curve25519_51
friend Hacl.Meta.Curve25519
open Hacl.Meta.Curve25519
// The Hacl core.
module C = Hacl.Impl.Curve25519.Field51
let g25519: g25519_t =
Lib.Buffer.createL_global Spec.Curve25519.basepoint_list
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 100"
let point_add_and_double =
addanddoub... | false | true | Hacl.Curve25519_51.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 encode_point : Hacl.Meta.Curve25519.generic_encode_point_higher_t Prims.l_True | [] | Hacl.Curve25519_51.encode_point | {
"file_name": "code/curve25519/Hacl.Curve25519_51.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Hacl.Meta.Curve25519.generic_encode_point_higher_t Prims.l_True | {
"end_col": 82,
"end_line": 21,
"start_col": 19,
"start_line": 21
} | |
Prims.Tot | val g25519:g25519_t | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Curve25519.Field51",
"short_module": "C"
},
{
"abbrev": false,
"full_module": "Hacl.Meta.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Curve25519.Fields",
"short_module": null
},
{
"ab... | false | let g25519: g25519_t =
Lib.Buffer.createL_global Spec.Curve25519.basepoint_list | val g25519:g25519_t
let g25519:g25519_t = | false | null | false | Lib.Buffer.createL_global Spec.Curve25519.basepoint_list | {
"checked_file": "Hacl.Curve25519_51.fst.checked",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Meta.Curve25519.fst.checked",
"Hacl.Impl.Curve25519.Field51.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
... | [
"total"
] | [
"Lib.Buffer.createL_global",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.PUB",
"Spec.Curve25519.basepoint_list",
"Lib.Buffer.glbuffer",
"Lib.IntTypes.size",
"FStar.Pervasives.normalize_term",
"Lib.IntTypes.size_nat",
"FStar.List.Tot.Base.length"
] | [] | module Hacl.Curve25519_51
friend Hacl.Meta.Curve25519
open Hacl.Meta.Curve25519
// The Hacl core.
module C = Hacl.Impl.Curve25519.Field51 | false | true | Hacl.Curve25519_51.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 g25519:g25519_t | [] | Hacl.Curve25519_51.g25519 | {
"file_name": "code/curve25519/Hacl.Curve25519_51.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Hacl.Impl.Curve25519.Generic.g25519_t | {
"end_col": 58,
"end_line": 10,
"start_col": 2,
"start_line": 10
} |
Prims.Tot | val normal (#a: Type) (x: a) : a | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives"... | false | let normal (#a: Type) (x: a) : a =
FStar.Pervasives.norm [
iota;
zeta;
delta_only [`%L.fold_right_gtot; `%L.map_gtot];
delta_attr [`%__reduce__];
primops;
simplify
]
x | val normal (#a: Type) (x: a) : a
let normal (#a: Type) (x: a) : a = | false | null | false | FStar.Pervasives.norm [
iota;
zeta;
delta_only [`%L.fold_right_gtot; `%L.map_gtot];
delta_attr [`%__reduce__];
primops;
simplify
]
x | {
"checked_file": "FStar.BigOps.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_file": "FStar.BigOps.fsti"
} | [
"total"
] | [
"FStar.Pervasives.norm",
"Prims.Cons",
"FStar.Pervasives.norm_step",
"FStar.Pervasives.iota",
"FStar.Pervasives.zeta",
"FStar.Pervasives.delta_only",
"Prims.string",
"Prims.Nil",
"FStar.Pervasives.delta_attr",
"FStar.Pervasives.primops",
"FStar.Pervasives.simplify"
] | [] | (*
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.BigOps.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 normal (#a: Type) (x: a) : a | [] | FStar.BigOps.normal | {
"file_name": "ulib/FStar.BigOps.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | x: a -> a | {
"end_col": 5,
"end_line": 57,
"start_col": 2,
"start_line": 49
} |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | false | let symmetric (#a: Type) (f: (a -> a -> Type)) = forall x y. f x y <==> f y x | let symmetric (#a: Type) (f: (a -> a -> Type)) = | false | null | false | forall x y. f x y <==> f y x | {
"checked_file": "FStar.BigOps.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_file": "FStar.BigOps.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.l_iff",
"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 | false | FStar.BigOps.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 symmetric : f: (_: a -> _: a -> Type0) -> Prims.logical | [] | FStar.BigOps.symmetric | {
"file_name": "ulib/FStar.BigOps.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: (_: a -> _: a -> Type0) -> Prims.logical | {
"end_col": 77,
"end_line": 183,
"start_col": 49,
"start_line": 183
} | |
Prims.GTot | val map_op' (#a #b #c: _) (op: (b -> c -> GTot c)) (f: (a -> GTot b)) (l: list a) (z: c) : GTot c | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | false | let map_op' #a #b #c (op: (b -> c -> GTot c)) (f: (a -> GTot b)) (l: list a) (z: c) : GTot c =
L.fold_right_gtot #a #c l (fun x acc -> (f x) `op` acc) z | val map_op' (#a #b #c: _) (op: (b -> c -> GTot c)) (f: (a -> GTot b)) (l: list a) (z: c) : GTot c
let map_op' #a #b #c (op: (b -> c -> GTot c)) (f: (a -> GTot b)) (l: list a) (z: c) : GTot c = | false | null | false | L.fold_right_gtot #a #c l (fun x acc -> (f x) `op` acc) z | {
"checked_file": "FStar.BigOps.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_file": "FStar.BigOps.fsti"
} | [
"sometrivial"
] | [
"Prims.list",
"FStar.List.Tot.Base.fold_right_gtot"
] | [] | (*
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.BigOps.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 map_op' (#a #b #c: _) (op: (b -> c -> GTot c)) (f: (a -> GTot b)) (l: list a) (z: c) : GTot c | [] | FStar.BigOps.map_op' | {
"file_name": "ulib/FStar.BigOps.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | op: (_: b -> _: c -> Prims.GTot c) -> f: (_: a -> Prims.GTot b) -> l: Prims.list a -> z: c
-> Prims.GTot c | {
"end_col": 59,
"end_line": 68,
"start_col": 2,
"start_line": 68
} |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | false | let reflexive (#a: Type) (f: (a -> a -> Type)) = forall x. f x x | let reflexive (#a: Type) (f: (a -> a -> Type)) = | false | null | false | forall x. f x x | {
"checked_file": "FStar.BigOps.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_file": "FStar.BigOps.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"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 | false | FStar.BigOps.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 reflexive : f: (_: a -> _: a -> Type0) -> Prims.logical | [] | FStar.BigOps.reflexive | {
"file_name": "ulib/FStar.BigOps.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: (_: a -> _: a -> Type0) -> Prims.logical | {
"end_col": 64,
"end_line": 186,
"start_col": 49,
"start_line": 186
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | false | let anti_reflexive (#a: Type) (f: (a -> a -> Type)) = forall x. ~(f x x) | let anti_reflexive (#a: Type) (f: (a -> a -> Type)) = | false | null | false | forall x. ~(f x x) | {
"checked_file": "FStar.BigOps.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_file": "FStar.BigOps.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.l_not",
"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 | false | FStar.BigOps.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 anti_reflexive : f: (_: a -> _: a -> Type0) -> Prims.logical | [] | FStar.BigOps.anti_reflexive | {
"file_name": "ulib/FStar.BigOps.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: (_: a -> _: a -> Type0) -> Prims.logical | {
"end_col": 72,
"end_line": 189,
"start_col": 54,
"start_line": 189
} | |
Prims.GTot | val pairwise_op' (#a #b: _) (op: (b -> b -> GTot b)) (f: (a -> a -> b)) (l: list a) (z: b) : GTot b | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | false | let rec pairwise_op' #a #b (op: (b -> b -> GTot b)) (f: (a -> a -> b)) (l: list a) (z: b) : GTot b =
match l with
| [] -> z
| hd :: tl -> (map_op' op (f hd) tl z) `op` (pairwise_op' op f tl z) | val pairwise_op' (#a #b: _) (op: (b -> b -> GTot b)) (f: (a -> a -> b)) (l: list a) (z: b) : GTot b
let rec pairwise_op' #a #b (op: (b -> b -> GTot b)) (f: (a -> a -> b)) (l: list a) (z: b) : GTot b = | false | null | false | match l with
| [] -> z
| hd :: tl -> (map_op' op (f hd) tl z) `op` (pairwise_op' op f tl z) | {
"checked_file": "FStar.BigOps.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_file": "FStar.BigOps.fsti"
} | [
"sometrivial"
] | [
"Prims.list",
"FStar.BigOps.map_op'",
"FStar.BigOps.pairwise_op'"
] | [] | (*
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.BigOps.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 pairwise_op' (#a #b: _) (op: (b -> b -> GTot b)) (f: (a -> a -> b)) (l: list a) (z: b) : GTot b | [
"recursion"
] | FStar.BigOps.pairwise_op' | {
"file_name": "ulib/FStar.BigOps.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | op: (_: b -> _: b -> Prims.GTot b) -> f: (_: a -> _: a -> b) -> l: Prims.list a -> z: b
-> Prims.GTot b | {
"end_col": 70,
"end_line": 180,
"start_col": 2,
"start_line": 178
} |
Prims.Tot | val gf128_rev_shift:poly | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits_s",
"short_module": null
},
{
"abbrev": false,
... | false | let gf128_rev_shift : poly = reverse gf128_low_shift 127 | val gf128_rev_shift:poly
let gf128_rev_shift:poly = | false | null | false | reverse gf128_low_shift 127 | {
"checked_file": "Vale.AES.GF128.fsti.checked",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.... | [
"total"
] | [
"Vale.Math.Poly2_s.reverse",
"Vale.AES.GF128.gf128_low_shift"
] | [] | module Vale.AES.GF128
open FStar.Seq
open FStar.Mul
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GF128_s
open Vale.Math.Poly2_s
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Lemmas
let quad32_shift_left_1 (q:quad32) : quad32 =
let l... | false | true | Vale.AES.GF128.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val gf128_rev_shift:poly | [] | Vale.AES.GF128.gf128_rev_shift | {
"file_name": "vale/code/crypto/aes/Vale.AES.GF128.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Vale.Math.Poly2_s.poly | {
"end_col": 56,
"end_line": 152,
"start_col": 29,
"start_line": 152
} |
Prims.Tot | val gf128_low_shift:poly | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits_s",
"short_module": null
},
{
"abbrev": false,
... | false | let gf128_low_shift : poly = shift gf128_modulus_low_terms (-1) | val gf128_low_shift:poly
let gf128_low_shift:poly = | false | null | false | shift gf128_modulus_low_terms (- 1) | {
"checked_file": "Vale.AES.GF128.fsti.checked",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.... | [
"total"
] | [
"Vale.Math.Poly2_s.shift",
"Vale.AES.GF128_s.gf128_modulus_low_terms",
"Prims.op_Minus"
] | [] | module Vale.AES.GF128
open FStar.Seq
open FStar.Mul
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GF128_s
open Vale.Math.Poly2_s
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Lemmas
let quad32_shift_left_1 (q:quad32) : quad32 =
let l... | false | true | Vale.AES.GF128.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val gf128_low_shift:poly | [] | Vale.AES.GF128.gf128_low_shift | {
"file_name": "vale/code/crypto/aes/Vale.AES.GF128.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Vale.Math.Poly2_s.poly | {
"end_col": 63,
"end_line": 149,
"start_col": 29,
"start_line": 149
} |
Prims.Tot | val gf128_mul_rev (a b: poly) : poly | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits_s",
"short_module": null
},
{
"abbrev": false,
... | false | let gf128_mul_rev (a b:poly) : poly =
reverse (gf128_mul (reverse a 127) (reverse b 127)) 127 | val gf128_mul_rev (a b: poly) : poly
let gf128_mul_rev (a b: poly) : poly = | false | null | false | reverse (gf128_mul (reverse a 127) (reverse b 127)) 127 | {
"checked_file": "Vale.AES.GF128.fsti.checked",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.... | [
"total"
] | [
"Vale.Math.Poly2_s.poly",
"Vale.Math.Poly2_s.reverse",
"Vale.AES.GF128_s.gf128_mul"
] | [] | module Vale.AES.GF128
open FStar.Seq
open FStar.Mul
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GF128_s
open Vale.Math.Poly2_s
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Lemmas
let quad32_shift_left_1 (q:quad32) : quad32 =
let l... | false | true | Vale.AES.GF128.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val gf128_mul_rev (a b: poly) : poly | [] | Vale.AES.GF128.gf128_mul_rev | {
"file_name": "vale/code/crypto/aes/Vale.AES.GF128.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | a: Vale.Math.Poly2_s.poly -> b: Vale.Math.Poly2_s.poly -> Vale.Math.Poly2_s.poly | {
"end_col": 57,
"end_line": 164,
"start_col": 2,
"start_line": 164
} |
Prims.Tot | val quad32_shift_left_1 (q: quad32) : quad32 | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits_s",
"short_module": null
},
{
"abbrev": false,
... | false | let quad32_shift_left_1 (q:quad32) : quad32 =
let l = four_map (fun (i:nat32) -> ishl i 1) q in
let r = four_map (fun (i:nat32) -> ishr i 31) q in
let Mkfour r0 r1 r2 r3 = r in
quad32_xor l (Mkfour 0 r0 r1 r2) | val quad32_shift_left_1 (q: quad32) : quad32
let quad32_shift_left_1 (q: quad32) : quad32 = | false | null | false | let l = four_map (fun (i: nat32) -> ishl i 1) q in
let r = four_map (fun (i: nat32) -> ishr i 31) q in
let Mkfour r0 r1 r2 r3 = r in
quad32_xor l (Mkfour 0 r0 r1 r2) | {
"checked_file": "Vale.AES.GF128.fsti.checked",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.... | [
"total"
] | [
"Vale.Def.Types_s.quad32",
"Vale.Def.Words_s.natN",
"Vale.Def.Words_s.pow2_32",
"Vale.Def.Types_s.quad32_xor",
"Vale.Def.Words_s.Mkfour",
"Vale.Def.Types_s.nat32",
"Vale.Def.Words_s.four",
"Vale.Def.Words.Four_s.four_map",
"Vale.Def.Types_s.ishr",
"Vale.Def.Types_s.ishl"
] | [] | module Vale.AES.GF128
open FStar.Seq
open FStar.Mul
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GF128_s
open Vale.Math.Poly2_s
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Lemmas | false | true | Vale.AES.GF128.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val quad32_shift_left_1 (q: quad32) : quad32 | [] | Vale.AES.GF128.quad32_shift_left_1 | {
"file_name": "vale/code/crypto/aes/Vale.AES.GF128.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | q: Vale.Def.Types_s.quad32 -> Vale.Def.Types_s.quad32 | {
"end_col": 34,
"end_line": 18,
"start_col": 45,
"start_line": 14
} |
Prims.Tot | val quad32_shift_2_left_1 (qa qb: quad32) : quad32 & quad32 | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits_s",
"short_module": null
},
{
"abbrev": false,
... | false | let quad32_shift_2_left_1 (qa qb:quad32) : quad32 & quad32 =
let la = four_map (fun (i:nat32) -> ishl i 1) qa in
let lb = four_map (fun (i:nat32) -> ishl i 1) qb in
let ra = four_map (fun (i:nat32) -> ishr i 31) qa in
let rb = four_map (fun (i:nat32) -> ishr i 31) qb in
let Mkfour ra0 ra1 ra2 ra3 = ra in
le... | val quad32_shift_2_left_1 (qa qb: quad32) : quad32 & quad32
let quad32_shift_2_left_1 (qa qb: quad32) : quad32 & quad32 = | false | null | false | let la = four_map (fun (i: nat32) -> ishl i 1) qa in
let lb = four_map (fun (i: nat32) -> ishl i 1) qb in
let ra = four_map (fun (i: nat32) -> ishr i 31) qa in
let rb = four_map (fun (i: nat32) -> ishr i 31) qb in
let Mkfour ra0 ra1 ra2 ra3 = ra in
let Mkfour rb0 rb1 rb2 rb3 = rb in
let qa' = quad32_xor la (Mkfour 0 ra... | {
"checked_file": "Vale.AES.GF128.fsti.checked",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.... | [
"total"
] | [
"Vale.Def.Types_s.quad32",
"Vale.Def.Words_s.natN",
"Vale.Def.Words_s.pow2_32",
"FStar.Pervasives.Native.Mktuple2",
"Vale.Def.Types_s.quad32_xor",
"Vale.Def.Words_s.Mkfour",
"Vale.Def.Types_s.nat32",
"FStar.Pervasives.Native.tuple2",
"Vale.Def.Words_s.four",
"Vale.Def.Words.Four_s.four_map",
"Va... | [] | module Vale.AES.GF128
open FStar.Seq
open FStar.Mul
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GF128_s
open Vale.Math.Poly2_s
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Lemmas
let quad32_shift_left_1 (q:quad32) : quad32 =
let l... | false | true | Vale.AES.GF128.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val quad32_shift_2_left_1 (qa qb: quad32) : quad32 & quad32 | [] | Vale.AES.GF128.quad32_shift_2_left_1 | {
"file_name": "vale/code/crypto/aes/Vale.AES.GF128.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | qa: Vale.Def.Types_s.quad32 -> qb: Vale.Def.Types_s.quad32
-> Vale.Def.Types_s.quad32 * Vale.Def.Types_s.quad32 | {
"end_col": 12,
"end_line": 29,
"start_col": 60,
"start_line": 20
} |
Prims.Tot | val mod_rev (n: pos) (a b: poly) : poly | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits_s",
"short_module": null
},
{
"abbrev": false,
... | false | let mod_rev (n:pos) (a b:poly) : poly =
reverse (reverse a (n + n - 1) %. b) (n - 1) | val mod_rev (n: pos) (a b: poly) : poly
let mod_rev (n: pos) (a b: poly) : poly = | false | null | false | reverse (reverse a (n + n - 1) %. b) (n - 1) | {
"checked_file": "Vale.AES.GF128.fsti.checked",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.... | [
"total"
] | [
"Prims.pos",
"Vale.Math.Poly2_s.poly",
"Vale.Math.Poly2_s.reverse",
"Vale.Math.Poly2.op_Percent_Dot",
"Prims.op_Subtraction",
"Prims.op_Addition"
] | [] | module Vale.AES.GF128
open FStar.Seq
open FStar.Mul
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GF128_s
open Vale.Math.Poly2_s
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Lemmas
let quad32_shift_left_1 (q:quad32) : quad32 =
let l... | false | true | Vale.AES.GF128.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val mod_rev (n: pos) (a b: poly) : poly | [] | Vale.AES.GF128.mod_rev | {
"file_name": "vale/code/crypto/aes/Vale.AES.GF128.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | n: Prims.pos -> a: Vale.Math.Poly2_s.poly -> b: Vale.Math.Poly2_s.poly -> Vale.Math.Poly2_s.poly | {
"end_col": 46,
"end_line": 181,
"start_col": 2,
"start_line": 181
} |
Prims.Tot | val shift_key_1 (n: pos) (f h: poly) : poly | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits_s",
"short_module": null
},
{
"abbrev": false,
... | false | let shift_key_1 (n:pos) (f h:poly) : poly =
let g = monomial n +. f in
let h1 = shift h 1 in
let offset = reverse (shift g (-1)) (n - 1) in
mask h1 n +. (if h1.[n] then offset else zero) | val shift_key_1 (n: pos) (f h: poly) : poly
let shift_key_1 (n: pos) (f h: poly) : poly = | false | null | false | let g = monomial n +. f in
let h1 = shift h 1 in
let offset = reverse (shift g (- 1)) (n - 1) in
mask h1 n +. (if h1.[ n ] then offset else zero) | {
"checked_file": "Vale.AES.GF128.fsti.checked",
"dependencies": [
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.... | [
"total"
] | [
"Prims.pos",
"Vale.Math.Poly2_s.poly",
"Vale.Math.Poly2.op_Plus_Dot",
"Vale.Math.Poly2.mask",
"Vale.Math.Poly2_s.op_String_Access",
"Prims.bool",
"Vale.Math.Poly2_s.zero",
"Vale.Math.Poly2_s.reverse",
"Vale.Math.Poly2_s.shift",
"Prims.op_Minus",
"Prims.op_Subtraction",
"Vale.Math.Poly2_s.monom... | [] | module Vale.AES.GF128
open FStar.Seq
open FStar.Mul
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GF128_s
open Vale.Math.Poly2_s
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Lemmas
let quad32_shift_left_1 (q:quad32) : quad32 =
let l... | false | true | Vale.AES.GF128.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val shift_key_1 (n: pos) (f h: poly) : poly | [] | Vale.AES.GF128.shift_key_1 | {
"file_name": "vale/code/crypto/aes/Vale.AES.GF128.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | n: Prims.pos -> f: Vale.Math.Poly2_s.poly -> h: Vale.Math.Poly2_s.poly -> Vale.Math.Poly2_s.poly | {
"end_col": 48,
"end_line": 191,
"start_col": 43,
"start_line": 187
} |
FStar.HyperStack.ST.Stack | val default_error_handler
(typename_s fieldname reason: string)
(error_code: U64.t)
(context: B.pointer LPE.error_frame)
(input: input_buffer)
(start_pos: U64.t)
: HST.Stack unit
(requires (fun h -> B.live h context))
(ensures (fun h _ h' -> B.modifies (B.loc_buffer context... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "EverParse3d.ErrorCode",
"short_module": "LPE"
},
{
"abbrev": true,
"full_... | false | let default_error_handler
(typename_s: string)
(fieldname: string)
(reason: string)
(error_code: U64.t)
(context: B.pointer LPE.error_frame)
(input: input_buffer)
(start_pos: U64.t)
: HST.Stack unit
(requires (fun h -> B.live h context))
(ensures (fun h _ h' -> B.modifies (B.loc_buffer context) h h'))... | val default_error_handler
(typename_s fieldname reason: string)
(error_code: U64.t)
(context: B.pointer LPE.error_frame)
(input: input_buffer)
(start_pos: U64.t)
: HST.Stack unit
(requires (fun h -> B.live h context))
(ensures (fun h _ h' -> B.modifies (B.loc_buffer context... | true | null | false | if not (!*context).LPE.filled
then
context *=
{
LPE.filled = true;
LPE.start_pos = start_pos;
LPE.typename_s = typename_s;
LPE.fieldname = fieldname;
LPE.reason = reason;
LPE.error_code = error_code
} | {
"checked_file": "EverParse3d.InputStream.Extern.Type.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked"... | [] | [
"Prims.string",
"FStar.UInt64.t",
"LowStar.Buffer.pointer",
"EverParse3d.ErrorCode.error_frame",
"EverParse3d.InputStream.Extern.Type.input_buffer",
"LowStar.BufferOps.op_Star_Equals",
"LowStar.Buffer.trivial_preorder",
"EverParse3d.ErrorCode.Mkerror_frame",
"Prims.unit",
"Prims.bool",
"Prims.op... | [] | module EverParse3d.InputStream.Extern.Type
include EverParse3d.InputStream.Extern.Base
module B = LowStar.Buffer
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module LPE = EverParse3d.ErrorCode
module U64 = FStar.UInt64
noeq
type input_buffer = {
bas... | false | false | EverParse3d.InputStream.Extern.Type.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val default_error_handler
(typename_s fieldname reason: string)
(error_code: U64.t)
(context: B.pointer LPE.error_frame)
(input: input_buffer)
(start_pos: U64.t)
: HST.Stack unit
(requires (fun h -> B.live h context))
(ensures (fun h _ h' -> B.modifies (B.loc_buffer context... | [] | EverParse3d.InputStream.Extern.Type.default_error_handler | {
"file_name": "src/3d/prelude/extern/EverParse3d.InputStream.Extern.Type.fst",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} |
typename_s: Prims.string ->
fieldname: Prims.string ->
reason: Prims.string ->
error_code: FStar.UInt64.t ->
context: LowStar.Buffer.pointer EverParse3d.ErrorCode.error_frame ->
input: EverParse3d.InputStream.Extern.Type.input_buffer ->
start_pos: FStar.UInt64.t
-> FStar.HyperStack.ST.Sta... | {
"end_col": 5,
"end_line": 89,
"start_col": 2,
"start_line": 80
} |
FStar.HyperStack.ST.Stack | val make_input_buffer (base: t) (position: B.pointer (Ghost.erased LPE.pos_t))
: HST.Stack input_buffer
(requires
(fun h -> B.loc_disjoint (footprint base) (B.loc_buffer position) /\ B.live h position))
(ensures (fun h _ h' -> B.modifies (B.loc_buffer position) h h')) | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "EverParse3d.ErrorCode",
"short_module": "LPE"
},
{
"abbrev": true,
"full_... | false | let make_input_buffer
(base: t)
(position: B.pointer (Ghost.erased LPE.pos_t))
: HST.Stack input_buffer
(requires (fun h ->
B.loc_disjoint (footprint base) (B.loc_buffer position) /\
B.live h position
))
(ensures (fun h _ h' ->
B.modifies (B.loc_buffer position) h h'
))
= position *= 0uL;
{
... | val make_input_buffer (base: t) (position: B.pointer (Ghost.erased LPE.pos_t))
: HST.Stack input_buffer
(requires
(fun h -> B.loc_disjoint (footprint base) (B.loc_buffer position) /\ B.live h position))
(ensures (fun h _ h' -> B.modifies (B.loc_buffer position) h h'))
let make_input_buffer (base... | true | null | false | position *= 0uL;
{ base = base; has_length = false; length = 0uL; position = position; prf = () } | {
"checked_file": "EverParse3d.InputStream.Extern.Type.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked"... | [] | [
"EverParse3d.InputStream.Extern.Base.t",
"LowStar.Buffer.pointer",
"FStar.Ghost.erased",
"EverParse3d.ErrorCode.pos_t",
"EverParse3d.InputStream.Extern.Type.Mkinput_buffer",
"FStar.UInt64.__uint_to_t",
"EverParse3d.InputStream.Extern.Type.input_buffer",
"Prims.unit",
"LowStar.BufferOps.op_Star_Equal... | [] | module EverParse3d.InputStream.Extern.Type
include EverParse3d.InputStream.Extern.Base
module B = LowStar.Buffer
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module LPE = EverParse3d.ErrorCode
module U64 = FStar.UInt64
noeq
type input_buffer = {
bas... | false | false | EverParse3d.InputStream.Extern.Type.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val make_input_buffer (base: t) (position: B.pointer (Ghost.erased LPE.pos_t))
: HST.Stack input_buffer
(requires
(fun h -> B.loc_disjoint (footprint base) (B.loc_buffer position) /\ B.live h position))
(ensures (fun h _ h' -> B.modifies (B.loc_buffer position) h h')) | [] | EverParse3d.InputStream.Extern.Type.make_input_buffer | {
"file_name": "src/3d/prelude/extern/EverParse3d.InputStream.Extern.Type.fst",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} |
base: EverParse3d.InputStream.Extern.Base.t ->
position: LowStar.Buffer.pointer (FStar.Ghost.erased EverParse3d.ErrorCode.pos_t)
-> FStar.HyperStack.ST.Stack EverParse3d.InputStream.Extern.Type.input_buffer | {
"end_col": 3,
"end_line": 44,
"start_col": 2,
"start_line": 37
} |
FStar.HyperStack.ST.Stack | val make_input_buffer_with_length
(base: t)
(position: B.pointer (Ghost.erased LPE.pos_t))
(length: LPE.pos_t)
: HST.Stack input_buffer
(requires
(fun h ->
B.loc_disjoint (footprint base) (B.loc_buffer position) /\ B.live h position /\
U64.v length <= U64.v (l... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "EverParse3d.ErrorCode",
"short_module": "LPE"
},
{
"abbrev": true,
"full_... | false | let make_input_buffer_with_length
(base: t)
(position: B.pointer (Ghost.erased LPE.pos_t))
(length: LPE.pos_t)
: HST.Stack input_buffer
(requires (fun h ->
B.loc_disjoint (footprint base) (B.loc_buffer position) /\
B.live h position /\
U64.v length <= U64.v (len_all base)
))
(ensures (fun h _ h'... | val make_input_buffer_with_length
(base: t)
(position: B.pointer (Ghost.erased LPE.pos_t))
(length: LPE.pos_t)
: HST.Stack input_buffer
(requires
(fun h ->
B.loc_disjoint (footprint base) (B.loc_buffer position) /\ B.live h position /\
U64.v length <= U64.v (l... | true | null | false | position *= 0uL;
{ base = base; has_length = true; length = length; position = position; prf = () } | {
"checked_file": "EverParse3d.InputStream.Extern.Type.fst.checked",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked"... | [] | [
"EverParse3d.InputStream.Extern.Base.t",
"LowStar.Buffer.pointer",
"FStar.Ghost.erased",
"EverParse3d.ErrorCode.pos_t",
"EverParse3d.InputStream.Extern.Type.Mkinput_buffer",
"EverParse3d.InputStream.Extern.Type.input_buffer",
"Prims.unit",
"LowStar.BufferOps.op_Star_Equals",
"LowStar.Buffer.trivial_... | [] | module EverParse3d.InputStream.Extern.Type
include EverParse3d.InputStream.Extern.Base
module B = LowStar.Buffer
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module LPE = EverParse3d.ErrorCode
module U64 = FStar.UInt64
noeq
type input_buffer = {
bas... | false | false | EverParse3d.InputStream.Extern.Type.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val make_input_buffer_with_length
(base: t)
(position: B.pointer (Ghost.erased LPE.pos_t))
(length: LPE.pos_t)
: HST.Stack input_buffer
(requires
(fun h ->
B.loc_disjoint (footprint base) (B.loc_buffer position) /\ B.live h position /\
U64.v length <= U64.v (l... | [] | EverParse3d.InputStream.Extern.Type.make_input_buffer_with_length | {
"file_name": "src/3d/prelude/extern/EverParse3d.InputStream.Extern.Type.fst",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} |
base: EverParse3d.InputStream.Extern.Base.t ->
position: LowStar.Buffer.pointer (FStar.Ghost.erased EverParse3d.ErrorCode.pos_t) ->
length: EverParse3d.ErrorCode.pos_t
-> FStar.HyperStack.ST.Stack EverParse3d.InputStream.Extern.Type.input_buffer | {
"end_col": 3,
"end_line": 66,
"start_col": 2,
"start_line": 59
} |
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_cp256 setupBaseR | val openBase: openBase_st cs vale_p
let openBase = | false | null | false | hpke_openBase_higher #cs vale_p IAEAD.aead_decrypt_cp256 setupBaseR | {
"checked_file": "Hacl.HPKE.Curve64_CP256_SHA512.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.H... | [
"total"
] | [
"Hacl.Meta.HPKE.hpke_openBase_higher",
"Hacl.HPKE.Curve64_CP256_SHA512.cs",
"Hacl.HPKE.Curve64_CP256_SHA512.vale_p",
"Hacl.HPKE.Interface.AEAD.aead_decrypt_cp256",
"Hacl.HPKE.Curve64_CP256_SHA512.setupBaseR"
] | [] | module Hacl.HPKE.Curve64_CP256_SHA512
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 val... | false | true | Hacl.HPKE.Curve64_CP256_SHA512.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_CP256_SHA512.openBase | {
"file_name": "code/hpke/Hacl.HPKE.Curve64_CP256_SHA512.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_CP256_SHA512.cs Hacl.HPKE.Curve64_CP256_SHA512.vale_p | {
"end_col": 82,
"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_cp256 setupBaseS | val sealBase: sealBase_st cs vale_p
let sealBase = | false | null | false | hpke_sealBase_higher #cs vale_p IAEAD.aead_encrypt_cp256 setupBaseS | {
"checked_file": "Hacl.HPKE.Curve64_CP256_SHA512.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.H... | [
"total"
] | [
"Hacl.Meta.HPKE.hpke_sealBase_higher",
"Hacl.HPKE.Curve64_CP256_SHA512.cs",
"Hacl.HPKE.Curve64_CP256_SHA512.vale_p",
"Hacl.HPKE.Interface.AEAD.aead_encrypt_cp256",
"Hacl.HPKE.Curve64_CP256_SHA512.setupBaseS"
] | [] | module Hacl.HPKE.Curve64_CP256_SHA512
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 val... | false | true | Hacl.HPKE.Curve64_CP256_SHA512.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_CP256_SHA512.sealBase | {
"file_name": "code/hpke/Hacl.HPKE.Curve64_CP256_SHA512.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_CP256_SHA512.cs Hacl.HPKE.Curve64_CP256_SHA512.vale_p | {
"end_col": 82,
"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_expand512 IHK.hkdf_extract512 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_expand512
IHK.hkdf_extract512
IDH.secret_to_public_c64
IDH.dh_c64
IHK.hkdf_expand256
IHK.hkdf_extract256 | {
"checked_file": "Hacl.HPKE.Curve64_CP256_SHA512.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.H... | [
"total"
] | [
"Hacl.Meta.HPKE.hpke_setupBaseS_higher",
"Hacl.HPKE.Curve64_CP256_SHA512.cs",
"Hacl.HPKE.Curve64_CP256_SHA512.vale_p",
"Hacl.HPKE.Interface.HKDF.hkdf_expand512",
"Hacl.HPKE.Interface.HKDF.hkdf_extract512",
"Hacl.HPKE.Interface.DH.secret_to_public_c64",
"Hacl.HPKE.Interface.DH.dh_c64",
"Hacl.HPKE.Inter... | [] | module Hacl.HPKE.Curve64_CP256_SHA512
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_CP256_SHA512.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_CP256_SHA512.setupBaseS | {
"file_name": "code/hpke/Hacl.HPKE.Curve64_CP256_SHA512.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_CP256_SHA512.cs Hacl.HPKE.Curve64_CP256_SHA512.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_expand512 IHK.hkdf_extract512 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_expand512
IHK.hkdf_extract512
IDH.dh_c64
IHK.hkdf_expand256
IHK.hkdf_extract256
IDH.secret_to_public_c64 | {
"checked_file": "Hacl.HPKE.Curve64_CP256_SHA512.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.H... | [
"total"
] | [
"Hacl.Meta.HPKE.hpke_setupBaseR_higher",
"Hacl.HPKE.Curve64_CP256_SHA512.cs",
"Hacl.HPKE.Curve64_CP256_SHA512.vale_p",
"Hacl.HPKE.Interface.HKDF.hkdf_expand512",
"Hacl.HPKE.Interface.HKDF.hkdf_extract512",
"Hacl.HPKE.Interface.DH.dh_c64",
"Hacl.HPKE.Interface.HKDF.hkdf_expand256",
"Hacl.HPKE.Interface... | [] | module Hacl.HPKE.Curve64_CP256_SHA512
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 val... | false | true | Hacl.HPKE.Curve64_CP256_SHA512.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_CP256_SHA512.setupBaseR | {
"file_name": "code/hpke/Hacl.HPKE.Curve64_CP256_SHA512.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_CP256_SHA512.cs Hacl.HPKE.Curve64_CP256_SHA512.vale_p | {
"end_col": 164,
"end_line": 16,
"start_col": 17,
"start_line": 16
} |
Prims.Tot | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.PPC64LE.Semantics_s",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Vale.Lib.Seqs",
"short_module": null
},
{
"abbrev": false,
"ful... | false | let is_full_read (#t:base_typ) (h1 h2:vale_heap) (b:buffer t) (i:int) =
buffer_addr b h1 == buffer_addr b h2 /\
buffer_read b i h1 == buffer_read b i h2 /\
valid_buffer_read h1 b i | let is_full_read (#t: base_typ) (h1 h2: vale_heap) (b: buffer t) (i: int) = | false | null | false | buffer_addr b h1 == buffer_addr b h2 /\ buffer_read b i h1 == buffer_read b i h2 /\
valid_buffer_read h1 b i | {
"checked_file": "Vale.PPC64LE.Memory_Sems.fsti.checked",
"dependencies": [
"Vale.PPC64LE.Semantics_s.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.Lib.Seqs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Val... | [
"total"
] | [
"Vale.Arch.HeapTypes_s.base_typ",
"Vale.PPC64LE.Memory.vale_heap",
"Vale.PPC64LE.Memory.buffer",
"Prims.int",
"Prims.l_and",
"Prims.eq2",
"Vale.PPC64LE.Memory.buffer_addr",
"Vale.PPC64LE.Memory.base_typ_as_vale_type",
"Vale.PPC64LE.Memory.buffer_read",
"Vale.PPC64LE.Memory.valid_buffer_read",
"P... | [] | module Vale.PPC64LE.Memory_Sems
open FStar.Mul
open Vale.Def.Prop_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Arch.Heap
open Vale.Arch.MachineHeap_s
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.Memory
open Vale.Lib.Seqs
module S = Vale.PPC64LE.Semantics_s
module Map16 = Vale.Lib.Map... | false | false | Vale.PPC64LE.Memory_Sems.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val is_full_read : h1: Vale.PPC64LE.Memory.vale_heap ->
h2: Vale.PPC64LE.Memory.vale_heap ->
b: Vale.PPC64LE.Memory.buffer t ->
i: Prims.int
-> Prims.logical | [] | Vale.PPC64LE.Memory_Sems.is_full_read | {
"file_name": "vale/code/arch/ppc64le/Vale.PPC64LE.Memory_Sems.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
h1: Vale.PPC64LE.Memory.vale_heap ->
h2: Vale.PPC64LE.Memory.vale_heap ->
b: Vale.PPC64LE.Memory.buffer t ->
i: Prims.int
-> Prims.logical | {
"end_col": 26,
"end_line": 48,
"start_col": 2,
"start_line": 46
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.PPC64LE.Semantics_s",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Vale.Lib.Seqs",
"short_module": null
},
{
"abbrev": false,
"ful... | false | let is_full_update (vfh:vale_full_heap) (h':vale_heap) (hid:heaplet_id) (mh':machine_heap) (mt':memtaint) =
is_machine_heap_update (heap_get (coerce vfh)) mh' /\ (
let vfh' = coerce (heap_upd (coerce vfh) mh' mt') in
mem_inv vfh' /\
vfh'.vf_layout == vfh.vf_layout /\
vfh'.vf_heaplets == Map16.upd vfh.... | let is_full_update
(vfh: vale_full_heap)
(h': vale_heap)
(hid: heaplet_id)
(mh': machine_heap)
(mt': memtaint)
= | false | null | false | is_machine_heap_update (heap_get (coerce vfh)) mh' /\
(let vfh' = coerce (heap_upd (coerce vfh) mh' mt') in
mem_inv vfh' /\ vfh'.vf_layout == vfh.vf_layout /\
vfh'.vf_heaplets == Map16.upd vfh.vf_heaplets hid h') | {
"checked_file": "Vale.PPC64LE.Memory_Sems.fsti.checked",
"dependencies": [
"Vale.PPC64LE.Semantics_s.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.Lib.Seqs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Val... | [
"total"
] | [
"Vale.PPC64LE.Memory.vale_full_heap",
"Vale.PPC64LE.Memory.vale_heap",
"Vale.PPC64LE.Memory.heaplet_id",
"Vale.Arch.MachineHeap_s.machine_heap",
"Vale.PPC64LE.Memory.memtaint",
"Prims.l_and",
"Vale.Arch.MachineHeap_s.is_machine_heap_update",
"Vale.Arch.Heap.heap_get",
"Vale.PPC64LE.Memory_Sems.coerc... | [] | module Vale.PPC64LE.Memory_Sems
open FStar.Mul
open Vale.Def.Prop_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Arch.Heap
open Vale.Arch.MachineHeap_s
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.Memory
open Vale.Lib.Seqs
module S = Vale.PPC64LE.Semantics_s
module Map16 = Vale.Lib.Map... | false | true | Vale.PPC64LE.Memory_Sems.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val is_full_update : vfh: Vale.PPC64LE.Memory.vale_full_heap ->
h': Vale.PPC64LE.Memory.vale_heap ->
hid: Vale.PPC64LE.Memory.heaplet_id ->
mh': Vale.Arch.MachineHeap_s.machine_heap ->
mt': Vale.PPC64LE.Memory.memtaint
-> Prims.logical | [] | Vale.PPC64LE.Memory_Sems.is_full_update | {
"file_name": "vale/code/arch/ppc64le/Vale.PPC64LE.Memory_Sems.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
vfh: Vale.PPC64LE.Memory.vale_full_heap ->
h': Vale.PPC64LE.Memory.vale_heap ->
hid: Vale.PPC64LE.Memory.heaplet_id ->
mh': Vale.Arch.MachineHeap_s.machine_heap ->
mt': Vale.PPC64LE.Memory.memtaint
-> Prims.logical | {
"end_col": 3,
"end_line": 56,
"start_col": 2,
"start_line": 51
} | |
Prims.Tot | val coerce (#b #a: Type) (x: a{a == b}) : b | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": true,
"full_module": "Vale.PPC64LE.Semantics_s",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Vale.Lib.Seqs",
"short_module": null
},
{
"abbrev": false,
"ful... | false | let coerce (#b #a:Type) (x:a{a == b}) : b = x | val coerce (#b #a: Type) (x: a{a == b}) : b
let coerce (#b #a: Type) (x: a{a == b}) : b = | false | null | false | x | {
"checked_file": "Vale.PPC64LE.Memory_Sems.fsti.checked",
"dependencies": [
"Vale.PPC64LE.Semantics_s.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.Lib.Seqs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Val... | [
"total"
] | [
"Prims.eq2"
] | [] | module Vale.PPC64LE.Memory_Sems
open FStar.Mul
open Vale.Def.Prop_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Arch.Heap
open Vale.Arch.MachineHeap_s
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.Memory
open Vale.Lib.Seqs
module S = Vale.PPC64LE.Semantics_s
module Map16 = Vale.Lib.Map... | false | false | Vale.PPC64LE.Memory_Sems.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val coerce (#b #a: Type) (x: a{a == b}) : b | [] | Vale.PPC64LE.Memory_Sems.coerce | {
"file_name": "vale/code/arch/ppc64le/Vale.PPC64LE.Memory_Sems.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | x: a{a == b} -> b | {
"end_col": 52,
"end_line": 33,
"start_col": 51,
"start_line": 33
} |
FStar.Pervasives.Lemma | val is_gcd_unique (a b c d:int) : Lemma
(requires is_gcd a b c /\ is_gcd a b d)
(ensures c = d \/ c = -d) | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | false | let is_gcd_unique a b c d =
divide_antisym c d | val is_gcd_unique (a b c d:int) : Lemma
(requires is_gcd a b c /\ is_gcd a b d)
(ensures c = d \/ c = -d)
let is_gcd_unique a b c d = | false | null | true | divide_antisym c d | {
"checked_file": "FStar.Math.Euclid.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
"lemma"
] | [
"Prims.int",
"FStar.Math.Euclid.divide_antisym",
"Prims.unit"
] | [] | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | false | false | FStar.Math.Euclid.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 is_gcd_unique (a b c d:int) : Lemma
(requires is_gcd a b c /\ is_gcd a b d)
(ensures c = d \/ c = -d) | [] | FStar.Math.Euclid.is_gcd_unique | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | a: Prims.int -> b: Prims.int -> c: Prims.int -> d: Prims.int
-> FStar.Pervasives.Lemma
(requires FStar.Math.Euclid.is_gcd a b c /\ FStar.Math.Euclid.is_gcd a b d)
(ensures c = d \/ c = - d) | {
"end_col": 20,
"end_line": 105,
"start_col": 2,
"start_line": 105
} |
FStar.Pervasives.Lemma | val is_gcd_for_euclid (a b q d:int) : Lemma
(requires is_gcd b (a - q * b) d)
(ensures is_gcd a b d) | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | false | let is_gcd_for_euclid a b q d =
add_sub_l a (q * b);
is_gcd_plus b (a - q * b) q d | val is_gcd_for_euclid (a b q d:int) : Lemma
(requires is_gcd b (a - q * b) d)
(ensures is_gcd a b d)
let is_gcd_for_euclid a b q d = | false | null | true | add_sub_l a (q * b);
is_gcd_plus b (a - q * b) q d | {
"checked_file": "FStar.Math.Euclid.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
"lemma"
] | [
"Prims.int",
"FStar.Math.Euclid.is_gcd_plus",
"Prims.op_Subtraction",
"FStar.Mul.op_Star",
"Prims.unit",
"FStar.Math.Euclid.add_sub_l"
] | [] | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | false | false | FStar.Math.Euclid.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 is_gcd_for_euclid (a b q d:int) : Lemma
(requires is_gcd b (a - q * b) d)
(ensures is_gcd a b d) | [] | FStar.Math.Euclid.is_gcd_for_euclid | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | a: Prims.int -> b: Prims.int -> q: Prims.int -> d: Prims.int
-> FStar.Pervasives.Lemma (requires FStar.Math.Euclid.is_gcd b (a - q * b) d)
(ensures FStar.Math.Euclid.is_gcd a b d) | {
"end_col": 31,
"end_line": 139,
"start_col": 2,
"start_line": 138
} |
FStar.Pervasives.Lemma | val mod_divides (a:int) (b:nonzero) : Lemma (requires a % b = 0) (ensures b `divides` a) | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | false | let mod_divides a b =
Classical.exists_intro (fun q -> a = q * b) (a / b) | val mod_divides (a:int) (b:nonzero) : Lemma (requires a % b = 0) (ensures b `divides` a)
let mod_divides a b = | false | null | true | Classical.exists_intro (fun q -> a = q * b) (a / b) | {
"checked_file": "FStar.Math.Euclid.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
"lemma"
] | [
"Prims.int",
"Prims.nonzero",
"FStar.Classical.exists_intro",
"Prims.b2t",
"Prims.op_Equality",
"FStar.Mul.op_Star",
"Prims.op_Division",
"Prims.unit"
] | [] | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | false | false | FStar.Math.Euclid.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 mod_divides (a:int) (b:nonzero) : Lemma (requires a % b = 0) (ensures b `divides` a) | [] | FStar.Math.Euclid.mod_divides | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | a: Prims.int -> b: Prims.nonzero
-> FStar.Pervasives.Lemma (requires a % b = 0) (ensures FStar.Math.Euclid.divides b a) | {
"end_col": 53,
"end_line": 98,
"start_col": 2,
"start_line": 98
} |
FStar.Pervasives.Lemma | val divides_reflexive (a:int) : Lemma (a `divides` a) [SMTPat (a `divides` a)] | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | false | let divides_reflexive a =
Classical.exists_intro (fun q -> a = q * a) 1 | val divides_reflexive (a:int) : Lemma (a `divides` a) [SMTPat (a `divides` a)]
let divides_reflexive a = | false | null | true | Classical.exists_intro (fun q -> a = q * a) 1 | {
"checked_file": "FStar.Math.Euclid.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
"lemma"
] | [
"Prims.int",
"FStar.Classical.exists_intro",
"Prims.b2t",
"Prims.op_Equality",
"FStar.Mul.op_Star",
"Prims.unit"
] | [] | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | false | false | FStar.Math.Euclid.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 divides_reflexive (a:int) : Lemma (a `divides` a) [SMTPat (a `divides` a)] | [] | FStar.Math.Euclid.divides_reflexive | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | a: Prims.int
-> FStar.Pervasives.Lemma (ensures FStar.Math.Euclid.divides a a)
[SMTPat (FStar.Math.Euclid.divides a a)] | {
"end_col": 47,
"end_line": 32,
"start_col": 2,
"start_line": 32
} |
FStar.Pervasives.Lemma | val divides_opp (a b:int) : Lemma
(requires a `divides` b)
(ensures (-a) `divides` b) | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | false | let divides_opp a b =
Classical.exists_elim ((-a) `divides` b)
(Squash.get_proof (a `divides` b))
(fun q -> Classical.exists_intro (fun q' -> b = q' * (-a)) (-q)) | val divides_opp (a b:int) : Lemma
(requires a `divides` b)
(ensures (-a) `divides` b)
let divides_opp a b = | false | null | true | Classical.exists_elim ((- a) `divides` b)
(Squash.get_proof (a `divides` b))
(fun q -> Classical.exists_intro (fun q' -> b = q' * (- a)) (- q)) | {
"checked_file": "FStar.Math.Euclid.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
"lemma"
] | [
"Prims.int",
"FStar.Classical.exists_elim",
"FStar.Math.Euclid.divides",
"Prims.op_Minus",
"Prims.b2t",
"Prims.op_Equality",
"FStar.Mul.op_Star",
"FStar.Squash.get_proof",
"FStar.Classical.exists_intro",
"Prims.squash",
"Prims.unit"
] | [] | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | false | false | FStar.Math.Euclid.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 divides_opp (a b:int) : Lemma
(requires a `divides` b)
(ensures (-a) `divides` b) | [] | FStar.Math.Euclid.divides_opp | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | a: Prims.int -> b: Prims.int
-> FStar.Pervasives.Lemma (requires FStar.Math.Euclid.divides a b)
(ensures FStar.Math.Euclid.divides (- a) b) | {
"end_col": 68,
"end_line": 72,
"start_col": 2,
"start_line": 70
} |
FStar.Pervasives.Lemma | val divides_transitive (a b c:int) : Lemma
(requires a `divides` b /\ b `divides` c)
(ensures a `divides` c) | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | false | let divides_transitive a b c =
eliminate exists q1. b == q1 * a
returns a `divides` c
with _pf.
eliminate exists q2. c == q2 * b
returns _
with _pf2.
introduce exists q. c == q * a
with (q1 * q2)
and () | val divides_transitive (a b c:int) : Lemma
(requires a `divides` b /\ b `divides` c)
(ensures a `divides` c)
let divides_transitive a b c = | false | null | true | eliminate exists q1.
b == q1 * a
returns a `divides` c
with _pf.
eliminate exists q2.
c == q2 * b
returns _
with _pf2.
introduce exists q.c == q * a
with (q1 * q2)
and () | {
"checked_file": "FStar.Math.Euclid.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
"lemma"
] | [
"Prims.int",
"FStar.Classical.Sugar.exists_elim",
"Prims.eq2",
"FStar.Mul.op_Star",
"FStar.Math.Euclid.divides",
"Prims.squash",
"Prims.l_Exists",
"FStar.Classical.Sugar.exists_intro",
"Prims.unit"
] | [] | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | false | false | FStar.Math.Euclid.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 divides_transitive (a b c:int) : Lemma
(requires a `divides` b /\ b `divides` c)
(ensures a `divides` c) | [] | FStar.Math.Euclid.divides_transitive | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | a: Prims.int -> b: Prims.int -> c: Prims.int
-> FStar.Pervasives.Lemma
(requires FStar.Math.Euclid.divides a b /\ FStar.Math.Euclid.divides b c)
(ensures FStar.Math.Euclid.divides a c) | {
"end_col": 8,
"end_line": 43,
"start_col": 2,
"start_line": 35
} |
FStar.Pervasives.Lemma | val is_gcd_opp (a b d:int) : Lemma
(requires is_gcd a b d)
(ensures is_gcd b a (-d)) | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | false | let is_gcd_opp a b d =
Classical.forall_intro_2 (Classical.move_requires_2 divides_minus);
divides_opp d a;
divides_opp d b | val is_gcd_opp (a b d:int) : Lemma
(requires is_gcd a b d)
(ensures is_gcd b a (-d))
let is_gcd_opp a b d = | false | null | true | Classical.forall_intro_2 (Classical.move_requires_2 divides_minus);
divides_opp d a;
divides_opp d b | {
"checked_file": "FStar.Math.Euclid.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
"lemma"
] | [
"Prims.int",
"FStar.Math.Euclid.divides_opp",
"Prims.unit",
"FStar.Classical.forall_intro_2",
"Prims.l_imp",
"FStar.Math.Euclid.divides",
"Prims.op_Minus",
"FStar.Classical.move_requires_2",
"FStar.Math.Euclid.divides_minus"
] | [] | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | false | false | FStar.Math.Euclid.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 is_gcd_opp (a b d:int) : Lemma
(requires is_gcd a b d)
(ensures is_gcd b a (-d)) | [] | FStar.Math.Euclid.is_gcd_opp | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | a: Prims.int -> b: Prims.int -> d: Prims.int
-> FStar.Pervasives.Lemma (requires FStar.Math.Euclid.is_gcd a b d)
(ensures FStar.Math.Euclid.is_gcd b a (- d)) | {
"end_col": 17,
"end_line": 122,
"start_col": 2,
"start_line": 120
} |
FStar.Pervasives.Lemma | val divides_mod (a:int) (b:nonzero) : Lemma (requires b `divides` a) (ensures a % b = 0) | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | false | let divides_mod a b =
Classical.exists_elim (a % b = 0) (Squash.get_proof (b `divides` a))
(fun q -> cancel_mul_div q b) | val divides_mod (a:int) (b:nonzero) : Lemma (requires b `divides` a) (ensures a % b = 0)
let divides_mod a b = | false | null | true | Classical.exists_elim (a % b = 0) (Squash.get_proof (b `divides` a)) (fun q -> cancel_mul_div q b) | {
"checked_file": "FStar.Math.Euclid.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
"lemma"
] | [
"Prims.int",
"Prims.nonzero",
"FStar.Classical.exists_elim",
"Prims.b2t",
"Prims.op_Equality",
"Prims.op_Modulus",
"FStar.Mul.op_Star",
"FStar.Squash.get_proof",
"FStar.Math.Euclid.divides",
"FStar.Math.Lemmas.cancel_mul_div",
"Prims.squash",
"Prims.unit"
] | [] | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | false | false | FStar.Math.Euclid.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 divides_mod (a:int) (b:nonzero) : Lemma (requires b `divides` a) (ensures a % b = 0) | [] | FStar.Math.Euclid.divides_mod | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | a: Prims.int -> b: Prims.nonzero
-> FStar.Pervasives.Lemma (requires FStar.Math.Euclid.divides b a) (ensures a % b = 0) | {
"end_col": 33,
"end_line": 102,
"start_col": 2,
"start_line": 101
} |
FStar.Pervasives.Lemma | val divides_mult_right (a b d:int) : Lemma
(requires d `divides` b)
(ensures d `divides` (a * b)) | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | false | let divides_mult_right a b d =
Classical.exists_elim (d `divides` (a * b)) (Squash.get_proof (d `divides` b))
(fun q ->
paren_mul_right a q d;
Classical.exists_intro (fun r -> a * b = r * d) (a * q)) | val divides_mult_right (a b d:int) : Lemma
(requires d `divides` b)
(ensures d `divides` (a * b))
let divides_mult_right a b d = | false | null | true | Classical.exists_elim (d `divides` (a * b))
(Squash.get_proof (d `divides` b))
(fun q ->
paren_mul_right a q d;
Classical.exists_intro (fun r -> a * b = r * d) (a * q)) | {
"checked_file": "FStar.Math.Euclid.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
"lemma"
] | [
"Prims.int",
"FStar.Classical.exists_elim",
"FStar.Math.Euclid.divides",
"FStar.Mul.op_Star",
"Prims.b2t",
"Prims.op_Equality",
"FStar.Squash.get_proof",
"FStar.Classical.exists_intro",
"Prims.unit",
"FStar.Math.Lemmas.paren_mul_right",
"Prims.squash"
] | [] | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | false | false | FStar.Math.Euclid.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 divides_mult_right (a b d:int) : Lemma
(requires d `divides` b)
(ensures d `divides` (a * b)) | [] | FStar.Math.Euclid.divides_mult_right | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | a: Prims.int -> b: Prims.int -> d: Prims.int
-> FStar.Pervasives.Lemma (requires FStar.Math.Euclid.divides d b)
(ensures FStar.Math.Euclid.divides d (a * b)) | {
"end_col": 62,
"end_line": 91,
"start_col": 2,
"start_line": 88
} |
FStar.Pervasives.Lemma | val is_gcd_minus (a b d:int) : Lemma
(requires is_gcd a (-b) d)
(ensures is_gcd b a d) | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | false | let is_gcd_minus a b d =
Classical.forall_intro_2 (Classical.move_requires_2 divides_minus);
opp_idempotent b | val is_gcd_minus (a b d:int) : Lemma
(requires is_gcd a (-b) d)
(ensures is_gcd b a d)
let is_gcd_minus a b d = | false | null | true | Classical.forall_intro_2 (Classical.move_requires_2 divides_minus);
opp_idempotent b | {
"checked_file": "FStar.Math.Euclid.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
"lemma"
] | [
"Prims.int",
"FStar.Math.Euclid.opp_idempotent",
"Prims.unit",
"FStar.Classical.forall_intro_2",
"Prims.l_imp",
"FStar.Math.Euclid.divides",
"Prims.op_Minus",
"FStar.Classical.move_requires_2",
"FStar.Math.Euclid.divides_minus"
] | [] | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | false | false | FStar.Math.Euclid.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 is_gcd_minus (a b d:int) : Lemma
(requires is_gcd a (-b) d)
(ensures is_gcd b a d) | [] | FStar.Math.Euclid.is_gcd_minus | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | a: Prims.int -> b: Prims.int -> d: Prims.int
-> FStar.Pervasives.Lemma (requires FStar.Math.Euclid.is_gcd a (- b) d)
(ensures FStar.Math.Euclid.is_gcd b a d) | {
"end_col": 18,
"end_line": 117,
"start_col": 2,
"start_line": 116
} |
FStar.Pervasives.Lemma | val divide_antisym (a b:int) : Lemma
(requires a `divides` b /\ b `divides` a)
(ensures a = b \/ a = -b) | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | false | let divide_antisym a b =
if a <> 0 then
Classical.exists_elim (a = b \/ a = -b) (Squash.get_proof (exists q1. b = q1 * a))
(fun q1 ->
Classical.exists_elim (a = b \/ a = -b) (Squash.get_proof (exists q2. a = q2 * b))
(fun q2 ->
assert (b = q1 * a);
assert (a = q2 * ... | val divide_antisym (a b:int) : Lemma
(requires a `divides` b /\ b `divides` a)
(ensures a = b \/ a = -b)
let divide_antisym a b = | false | null | true | if a <> 0
then
Classical.exists_elim (a = b \/ a = - b)
(Squash.get_proof (exists q1. b = q1 * a))
(fun q1 ->
Classical.exists_elim (a = b \/ a = - b)
(Squash.get_proof (exists q2. a = q2 * b))
(fun q2 ->
assert (b = q1 * a);
assert (a = q2 * b);
... | {
"checked_file": "FStar.Math.Euclid.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
"lemma"
] | [
"Prims.int",
"Prims.op_disEquality",
"FStar.Classical.exists_elim",
"Prims.l_or",
"Prims.b2t",
"Prims.op_Equality",
"Prims.op_Minus",
"FStar.Mul.op_Star",
"FStar.Squash.get_proof",
"Prims.l_Exists",
"FStar.Math.Euclid.eq_mult_one",
"Prims.unit",
"FStar.Math.Euclid.eq_mult_left",
"FStar.Mat... | [] | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | false | false | FStar.Math.Euclid.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 divide_antisym (a b:int) : Lemma
(requires a `divides` b /\ b `divides` a)
(ensures a = b \/ a = -b) | [] | FStar.Math.Euclid.divide_antisym | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | a: Prims.int -> b: Prims.int
-> FStar.Pervasives.Lemma
(requires FStar.Math.Euclid.divides a b /\ FStar.Math.Euclid.divides b a)
(ensures a = b \/ a = - b) | {
"end_col": 31,
"end_line": 57,
"start_col": 2,
"start_line": 47
} |
FStar.Pervasives.Lemma | val divides_plus (a b d:int) : Lemma
(requires d `divides` a /\ d `divides` b)
(ensures d `divides` (a + b)) | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | false | let divides_plus a b d =
Classical.exists_elim (d `divides` (a + b)) (Squash.get_proof (exists q1. a = q1 * d))
(fun q1 ->
Classical.exists_elim (d `divides` (a + b)) (Squash.get_proof (exists q2. b = q2 * d))
(fun q2 ->
assert (a + b = q1 * d + q2 * d);
distributivity_add_left q... | val divides_plus (a b d:int) : Lemma
(requires d `divides` a /\ d `divides` b)
(ensures d `divides` (a + b))
let divides_plus a b d = | false | null | true | Classical.exists_elim (d `divides` (a + b))
(Squash.get_proof (exists q1. a = q1 * d))
(fun q1 ->
Classical.exists_elim (d `divides` (a + b))
(Squash.get_proof (exists q2. b = q2 * d))
(fun q2 ->
assert (a + b = q1 * d + q2 * d);
distributivity_add_left q1 q2 d;
... | {
"checked_file": "FStar.Math.Euclid.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
"lemma"
] | [
"Prims.int",
"FStar.Classical.exists_elim",
"FStar.Math.Euclid.divides",
"Prims.op_Addition",
"Prims.b2t",
"Prims.op_Equality",
"FStar.Mul.op_Star",
"FStar.Squash.get_proof",
"Prims.l_Exists",
"FStar.Classical.exists_intro",
"Prims.unit",
"FStar.Math.Lemmas.distributivity_add_left",
"Prims._... | [] | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | false | false | FStar.Math.Euclid.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 divides_plus (a b d:int) : Lemma
(requires d `divides` a /\ d `divides` b)
(ensures d `divides` (a + b)) | [] | FStar.Math.Euclid.divides_plus | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | a: Prims.int -> b: Prims.int -> d: Prims.int
-> FStar.Pervasives.Lemma
(requires FStar.Math.Euclid.divides d a /\ FStar.Math.Euclid.divides d b)
(ensures FStar.Math.Euclid.divides d (a + b)) | {
"end_col": 69,
"end_line": 81,
"start_col": 2,
"start_line": 75
} |
FStar.Pervasives.Lemma | val divides_0 (a:int) : Lemma (a `divides` 0) | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | false | let divides_0 a =
Classical.exists_intro (fun q -> 0 = q * a) 0 | val divides_0 (a:int) : Lemma (a `divides` 0)
let divides_0 a = | false | null | true | Classical.exists_intro (fun q -> 0 = q * a) 0 | {
"checked_file": "FStar.Math.Euclid.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
"lemma"
] | [
"Prims.int",
"FStar.Classical.exists_intro",
"Prims.b2t",
"Prims.op_Equality",
"FStar.Mul.op_Star",
"Prims.unit"
] | [] | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | false | false | FStar.Math.Euclid.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 divides_0 (a:int) : Lemma (a `divides` 0) | [] | FStar.Math.Euclid.divides_0 | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | a: Prims.int -> FStar.Pervasives.Lemma (ensures FStar.Math.Euclid.divides a 0) | {
"end_col": 47,
"end_line": 60,
"start_col": 2,
"start_line": 60
} |
FStar.Pervasives.Lemma | val divides_sub (a b d:int) : Lemma
(requires d `divides` a /\ d `divides` b)
(ensures d `divides` (a - b)) | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | false | let divides_sub a b d =
Classical.forall_intro_2 (Classical.move_requires_2 divides_minus);
divides_plus a (-b) d | val divides_sub (a b d:int) : Lemma
(requires d `divides` a /\ d `divides` b)
(ensures d `divides` (a - b))
let divides_sub a b d = | false | null | true | Classical.forall_intro_2 (Classical.move_requires_2 divides_minus);
divides_plus a (- b) d | {
"checked_file": "FStar.Math.Euclid.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
"lemma"
] | [
"Prims.int",
"FStar.Math.Euclid.divides_plus",
"Prims.op_Minus",
"Prims.unit",
"FStar.Classical.forall_intro_2",
"Prims.l_imp",
"FStar.Math.Euclid.divides",
"FStar.Classical.move_requires_2",
"FStar.Math.Euclid.divides_minus"
] | [] | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | false | false | FStar.Math.Euclid.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 divides_sub (a b d:int) : Lemma
(requires d `divides` a /\ d `divides` b)
(ensures d `divides` (a - b)) | [] | FStar.Math.Euclid.divides_sub | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | a: Prims.int -> b: Prims.int -> d: Prims.int
-> FStar.Pervasives.Lemma
(requires FStar.Math.Euclid.divides d a /\ FStar.Math.Euclid.divides d b)
(ensures FStar.Math.Euclid.divides d (a - b)) | {
"end_col": 23,
"end_line": 85,
"start_col": 2,
"start_line": 84
} |
FStar.Pervasives.Lemma | val divides_minus (a b:int) : Lemma
(requires a `divides` b)
(ensures a `divides` (-b)) | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | false | let divides_minus a b =
Classical.exists_elim (a `divides` (-b))
(Squash.get_proof (a `divides` b))
(fun q -> Classical.exists_intro (fun q' -> -b = q' * a) (-q)) | val divides_minus (a b:int) : Lemma
(requires a `divides` b)
(ensures a `divides` (-b))
let divides_minus a b = | false | null | true | Classical.exists_elim (a `divides` (- b))
(Squash.get_proof (a `divides` b))
(fun q -> Classical.exists_intro (fun q' -> - b = q' * a) (- q)) | {
"checked_file": "FStar.Math.Euclid.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
"lemma"
] | [
"Prims.int",
"FStar.Classical.exists_elim",
"FStar.Math.Euclid.divides",
"Prims.op_Minus",
"Prims.b2t",
"Prims.op_Equality",
"FStar.Mul.op_Star",
"FStar.Squash.get_proof",
"FStar.Classical.exists_intro",
"Prims.squash",
"Prims.unit"
] | [] | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | false | false | FStar.Math.Euclid.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 divides_minus (a b:int) : Lemma
(requires a `divides` b)
(ensures a `divides` (-b)) | [] | FStar.Math.Euclid.divides_minus | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | a: Prims.int -> b: Prims.int
-> FStar.Pervasives.Lemma (requires FStar.Math.Euclid.divides a b)
(ensures FStar.Math.Euclid.divides a (- b)) | {
"end_col": 66,
"end_line": 67,
"start_col": 2,
"start_line": 65
} |
FStar.Pervasives.Lemma | val is_gcd_plus (a b q d:int) : Lemma
(requires is_gcd a b d)
(ensures is_gcd a (b + q * a) d) | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | false | let is_gcd_plus a b q d =
add_sub_r b (q * a);
Classical.forall_intro_3 (Classical.move_requires_3 divides_plus);
Classical.forall_intro_3 (Classical.move_requires_3 divides_mult_right);
Classical.forall_intro_3 (Classical.move_requires_3 divides_sub) | val is_gcd_plus (a b q d:int) : Lemma
(requires is_gcd a b d)
(ensures is_gcd a (b + q * a) d)
let is_gcd_plus a b q d = | false | null | true | add_sub_r b (q * a);
Classical.forall_intro_3 (Classical.move_requires_3 divides_plus);
Classical.forall_intro_3 (Classical.move_requires_3 divides_mult_right);
Classical.forall_intro_3 (Classical.move_requires_3 divides_sub) | {
"checked_file": "FStar.Math.Euclid.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
"lemma"
] | [
"Prims.int",
"FStar.Classical.forall_intro_3",
"Prims.l_imp",
"Prims.l_and",
"FStar.Math.Euclid.divides",
"Prims.op_Subtraction",
"FStar.Classical.move_requires_3",
"FStar.Math.Euclid.divides_sub",
"Prims.unit",
"FStar.Mul.op_Star",
"FStar.Math.Euclid.divides_mult_right",
"Prims.op_Addition",
... | [] | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | false | false | FStar.Math.Euclid.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 is_gcd_plus (a b q d:int) : Lemma
(requires is_gcd a b d)
(ensures is_gcd a (b + q * a) d) | [] | FStar.Math.Euclid.is_gcd_plus | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | a: Prims.int -> b: Prims.int -> q: Prims.int -> d: Prims.int
-> FStar.Pervasives.Lemma (requires FStar.Math.Euclid.is_gcd a b d)
(ensures FStar.Math.Euclid.is_gcd a (b + q * a) d) | {
"end_col": 66,
"end_line": 128,
"start_col": 2,
"start_line": 125
} |
Prims.Pure | val bezout_prime (p:int) (a:pos{a < p}) : Pure (int & int)
(requires is_prime p)
(ensures fun (r, s) -> r * p + s * a = 1) | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | false | let bezout_prime p a =
let r, s, d = euclid_gcd p a in
assert (r * p + s * a = d);
assert (is_gcd p a d);
is_gcd_prime p a;
is_gcd_unique p a 1 d;
assert (d = 1 \/ d = -1);
assert ((-r) * p + (-s) * a == -(r * p + s * a)) by (FStar.Tactics.Canon.canon());
if d = 1 then r, s else -r, -s | val bezout_prime (p:int) (a:pos{a < p}) : Pure (int & int)
(requires is_prime p)
(ensures fun (r, s) -> r * p + s * a = 1)
let bezout_prime p a = | false | null | false | let r, s, d = euclid_gcd p a in
assert (r * p + s * a = d);
assert (is_gcd p a d);
is_gcd_prime p a;
is_gcd_unique p a 1 d;
assert (d = 1 \/ d = - 1);
FStar.Tactics.Effect.assert_by_tactic ((- r) * p + (- s) * a == - (r * p + s * a))
(fun _ ->
();
(FStar.Tactics.Canon.canon ()));
if d = 1 then r, s else -... | {
"checked_file": "FStar.Math.Euclid.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [] | [
"Prims.int",
"Prims.pos",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.op_Equality",
"FStar.Pervasives.Native.Mktuple2",
"Prims.bool",
"Prims.op_Minus",
"FStar.Pervasives.Native.tuple2",
"Prims.unit",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.eq2",
"Prims.op_Addition",
"FStar.Mul.op_Star... | [] | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | false | false | FStar.Math.Euclid.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 bezout_prime (p:int) (a:pos{a < p}) : Pure (int & int)
(requires is_prime p)
(ensures fun (r, s) -> r * p + s * a = 1) | [] | FStar.Math.Euclid.bezout_prime | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | p: Prims.int -> a: Prims.pos{a < p} -> Prims.Pure (Prims.int * Prims.int) | {
"end_col": 32,
"end_line": 218,
"start_col": 22,
"start_line": 210
} |
FStar.Pervasives.Lemma | val is_gcd_prime (p:int{is_prime p}) (a:pos{a < p}) : Lemma (is_gcd p a 1) | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | false | let is_gcd_prime p a =
Classical.forall_intro_2 (Classical.move_requires_2 divides_minus);
Classical.forall_intro (Classical.move_requires (is_gcd_prime_aux p a));
assert (forall x. x `divides` p /\ x `divides` a ==> x = 1 \/ x = -1 /\ x `divides` 1) | val is_gcd_prime (p:int{is_prime p}) (a:pos{a < p}) : Lemma (is_gcd p a 1)
let is_gcd_prime p a = | false | null | true | Classical.forall_intro_2 (Classical.move_requires_2 divides_minus);
Classical.forall_intro (Classical.move_requires (is_gcd_prime_aux p a));
assert (forall x. x `divides` p /\ x `divides` a ==> x = 1 \/ x = - 1 /\ x `divides` 1) | {
"checked_file": "FStar.Math.Euclid.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
"lemma"
] | [
"Prims.int",
"FStar.Math.Euclid.is_prime",
"Prims.pos",
"Prims.b2t",
"Prims.op_LessThan",
"Prims._assert",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.l_and",
"FStar.Math.Euclid.divides",
"Prims.l_or",
"Prims.op_Equality",
"Prims.op_Minus",
"Prims.unit",
"FStar.Classical.forall_intro",
"FS... | [] | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | false | false | FStar.Math.Euclid.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 is_gcd_prime (p:int{is_prime p}) (a:pos{a < p}) : Lemma (is_gcd p a 1) | [] | FStar.Math.Euclid.is_gcd_prime | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | p: Prims.int{FStar.Math.Euclid.is_prime p} -> a: Prims.pos{a < p}
-> FStar.Pervasives.Lemma (ensures FStar.Math.Euclid.is_gcd p a 1) | {
"end_col": 88,
"end_line": 208,
"start_col": 2,
"start_line": 206
} |
FStar.Pervasives.Lemma | val euclid_prime (p:int{is_prime p}) (a b:int) : Lemma
(requires (a * b) % p = 0)
(ensures a % p = 0 \/ b % p = 0) | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | false | let euclid_prime p a b =
let ra, sa, da = euclid_gcd p a in
let rb, sb, db = euclid_gcd p b in
assert (is_gcd p a da);
assert (is_gcd p b db);
assert (da `divides` p);
assert (da = 1 \/ da = -1 \/ da = p \/ da = -p);
if da = 1 then
euclid p a b ra sa
else if da = -1 then
begin
assert ((-ra) ... | val euclid_prime (p:int{is_prime p}) (a b:int) : Lemma
(requires (a * b) % p = 0)
(ensures a % p = 0 \/ b % p = 0)
let euclid_prime p a b = | false | null | true | let ra, sa, da = euclid_gcd p a in
let rb, sb, db = euclid_gcd p b in
assert (is_gcd p a da);
assert (is_gcd p b db);
assert (da `divides` p);
assert (da = 1 \/ da = - 1 \/ da = p \/ da = - p);
if da = 1
then euclid p a b ra sa
else
if da = - 1
then
(FStar.Tactics.Effect.assert_by_tactic ((- ra) * p + (- sa) * ... | {
"checked_file": "FStar.Math.Euclid.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
"lemma"
] | [
"Prims.int",
"FStar.Math.Euclid.is_prime",
"Prims.op_Equality",
"FStar.Math.Euclid.euclid",
"Prims.bool",
"Prims.op_Minus",
"Prims.unit",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.eq2",
"Prims.op_Addition",
"FStar.Mul.op_Star",
"FStar.Tactics.Canon.canon",
"FStar.Math.Euclid.divides_mo... | [] | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | false | false | FStar.Math.Euclid.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 euclid_prime (p:int{is_prime p}) (a b:int) : Lemma
(requires (a * b) % p = 0)
(ensures a % p = 0 \/ b % p = 0) | [] | FStar.Math.Euclid.euclid_prime | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | p: Prims.int{FStar.Math.Euclid.is_prime p} -> a: Prims.int -> b: Prims.int
-> FStar.Pervasives.Lemma (requires a * b % p = 0) (ensures a % p = 0 \/ b % p = 0) | {
"end_col": 7,
"end_line": 273,
"start_col": 24,
"start_line": 252
} |
Prims.Pure | val egcd (a b u1 u2 u3 v1 v2 v3:int) : Pure (int & int & int)
(requires v3 >= 0 /\
u1 * a + u2 * b = u3 /\
v1 * a + v2 * b = v3 /\
(forall d. is_gcd u3 v3 d ==> is_gcd a b d))
(ensures (fun (u, v, d) -> u * a + v * b = d /\ is_gcd a b d))
(decreases v3) | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | false | let rec egcd a b u1 u2 u3 v1 v2 v3 =
if v3 = 0 then
begin
divides_0 u3;
(u1, u2, u3)
end
else
begin
let q = u3 / v3 in
euclidean_division_definition u3 v3;
assert (u3 - q * v3 = (q * v3 + u3 % v3) - q * v3);
assert (q * v3 - q * v3 = 0);
swap_add_plus_minus (q * v3) (u3 % v3)... | val egcd (a b u1 u2 u3 v1 v2 v3:int) : Pure (int & int & int)
(requires v3 >= 0 /\
u1 * a + u2 * b = u3 /\
v1 * a + v2 * b = v3 /\
(forall d. is_gcd u3 v3 d ==> is_gcd a b d))
(ensures (fun (u, v, d) -> u * a + v * b = d /\ is_gcd a b d))
(decreases v3)
let rec egcd a b u1 u2 u... | false | null | false | if v3 = 0
then
(divides_0 u3;
(u1, u2, u3))
else
let q = u3 / v3 in
euclidean_division_definition u3 v3;
assert (u3 - q * v3 = (q * v3 + u3 % v3) - q * v3);
assert (q * v3 - q * v3 = 0);
swap_add_plus_minus (q * v3) (u3 % v3) (q * v3);
calc ( == ) {
(u1 - q * v1) * a + (u2 - q * v2) * b;
( == ... | {
"checked_file": "FStar.Math.Euclid.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
""
] | [
"Prims.int",
"Prims.op_Equality",
"FStar.Pervasives.Native.Mktuple3",
"Prims.unit",
"FStar.Math.Euclid.divides_0",
"Prims.bool",
"Prims.precedes",
"FStar.Pervasives.Native.tuple3",
"FStar.Math.Euclid.egcd",
"FStar.Classical.Sugar.forall_intro",
"Prims.l_imp",
"FStar.Math.Euclid.is_gcd",
"Pri... | [] | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | false | false | FStar.Math.Euclid.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 egcd (a b u1 u2 u3 v1 v2 v3:int) : Pure (int & int & int)
(requires v3 >= 0 /\
u1 * a + u2 * b = u3 /\
v1 * a + v2 * b = v3 /\
(forall d. is_gcd u3 v3 d ==> is_gcd a b d))
(ensures (fun (u, v, d) -> u * a + v * b = d /\ is_gcd a b d))
(decreases v3) | [
"recursion"
] | FStar.Math.Euclid.egcd | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
a: Prims.int ->
b: Prims.int ->
u1: Prims.int ->
u2: Prims.int ->
u3: Prims.int ->
v1: Prims.int ->
v2: Prims.int ->
v3: Prims.int
-> Prims.Pure ((Prims.int * Prims.int) * Prims.int) | {
"end_col": 7,
"end_line": 182,
"start_col": 2,
"start_line": 150
} |
FStar.Pervasives.Lemma | val euclid (n:pos) (a b r s:int) : Lemma
(requires (a * b) % n = 0 /\ r * n + s * a = 1)
(ensures b % n = 0) | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | false | let euclid n a b r s =
let open FStar.Math.Lemmas in
calc (==) {
b % n;
== { distributivity_add_left (r * n) (s * a) b }
(r * n * b + s * a * b) % n;
== { paren_mul_right s a b }
(r * n * b + s * (a * b)) % n;
== { modulo_distributivity (r * n * b) (s * (a * b)) n }
((r * n * b) % n + s ... | val euclid (n:pos) (a b r s:int) : Lemma
(requires (a * b) % n = 0 /\ r * n + s * a = 1)
(ensures b % n = 0)
let euclid n a b r s = | false | null | true | let open FStar.Math.Lemmas in
calc ( == ) {
b % n;
( == ) { distributivity_add_left (r * n) (s * a) b }
((r * n) * b + (s * a) * b) % n;
( == ) { paren_mul_right s a b }
((r * n) * b + s * (a * b)) % n;
( == ) { modulo_distributivity ((r * n) * b) (s * (a * b)) n }
(((r * n) * b) % n + s * (a * b) % n) % ... | {
"checked_file": "FStar.Math.Euclid.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
"lemma"
] | [
"Prims.pos",
"Prims.int",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Prims.op_Modulus",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"FStar.Mul.op_Star",
"Prims.op_Addition",
"FStar.Calc.calc_init",
"FStar.Calc.calc_pack",
"FStar.Math.Lemmas.di... | [] | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | false | false | FStar.Math.Euclid.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 euclid (n:pos) (a b r s:int) : Lemma
(requires (a * b) % n = 0 /\ r * n + s * a = 1)
(ensures b % n = 0) | [] | FStar.Math.Euclid.euclid | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | n: Prims.pos -> a: Prims.int -> b: Prims.int -> r: Prims.int -> s: Prims.int
-> FStar.Pervasives.Lemma (requires a * b % n = 0 /\ r * n + s * a = 1) (ensures b % n = 0) | {
"end_col": 3,
"end_line": 250,
"start_col": 2,
"start_line": 221
} |
Prims.Pure | val euclid_gcd (a b:int) : Pure (int & int & int)
(requires True)
(ensures fun (r, s, d) -> r * a + s * b = d /\ is_gcd a b d) | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | false | let euclid_gcd a b =
if b >= 0 then
egcd a b 1 0 a 0 1 b
else (
introduce forall d. is_gcd a (-b) d ==> is_gcd a b d
with introduce _ ==> _
with _pf.
(is_gcd_minus a b d;
is_gcd_symmetric b a d);
let res = egcd a b 1 0 a 0 (-1) (-b) in
let _, _, d = res in
as... | val euclid_gcd (a b:int) : Pure (int & int & int)
(requires True)
(ensures fun (r, s, d) -> r * a + s * b = d /\ is_gcd a b d)
let euclid_gcd a b = | false | null | false | if b >= 0
then egcd a b 1 0 a 0 1 b
else
(introduce forall d . is_gcd a (- b) d ==> is_gcd a b d
with introduce _ ==> _
with _pf. (is_gcd_minus a b d;
is_gcd_symmetric b a d);
let res = egcd a b 1 0 a 0 (- 1) (- b) in
let _, _, d = res in
assert (is_gcd a b d);
res) | {
"checked_file": "FStar.Math.Euclid.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Tactics.Canon.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [] | [
"Prims.int",
"Prims.op_GreaterThanOrEqual",
"FStar.Math.Euclid.egcd",
"Prims.bool",
"Prims.unit",
"Prims._assert",
"FStar.Math.Euclid.is_gcd",
"FStar.Pervasives.Native.tuple3",
"Prims.op_Minus",
"FStar.Classical.Sugar.forall_intro",
"Prims.l_imp",
"FStar.Classical.Sugar.implies_intro",
"Prim... | [] | module FStar.Math.Euclid
open FStar.Mul
open FStar.Math.Lemmas
///
/// Auxiliary lemmas
///
val eq_mult_left (a b:int) : Lemma (requires a = b * a) (ensures a = 0 \/ b = 1)
let eq_mult_left a b = ()
val eq_mult_one (a b:int) : Lemma
(requires a * b = 1)
(ensures (a = 1 /\ b = 1) \/ (a = -1 /\ b = -1))
let eq_mu... | false | false | FStar.Math.Euclid.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 euclid_gcd (a b:int) : Pure (int & int & int)
(requires True)
(ensures fun (r, s, d) -> r * a + s * b = d /\ is_gcd a b d) | [] | FStar.Math.Euclid.euclid_gcd | {
"file_name": "ulib/FStar.Math.Euclid.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | a: Prims.int -> b: Prims.int -> Prims.Pure ((Prims.int * Prims.int) * Prims.int) | {
"end_col": 3,
"end_line": 197,
"start_col": 2,
"start_line": 185
} |
Prims.Tot | [
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.SHA.SHA_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": ... | false | let uint32_i = IB.ibuffer uint32 | let uint32_i = | false | null | false | IB.ibuffer uint32 | {
"checked_file": "Vale.Wrapper.X64.Sha.fsti.checked",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.SHA.SHA_helpers.fsti.checked",
"Vale.Arch.BufferFriend.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"prims.fst.checked",
"LowStar.ImmutableBuffer.fst.checked",
"LowS... | [
"total"
] | [
"LowStar.ImmutableBuffer.ibuffer",
"Lib.IntTypes.uint32"
] | [] | module Vale.Wrapper.X64.Sha
open Vale.X64.CPU_Features_s
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module BV = LowStar.BufferView
module HS = FStar.HyperStack
module BF = Vale.Arch.BufferFriend
open FStar.Mul
open Vale.SHA.SHA_helpers
open Lib.IntTypes
unfold
let uint32_p ... | false | true | Vale.Wrapper.X64.Sha.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val uint32_i : Type0 | [] | Vale.Wrapper.X64.Sha.uint32_i | {
"file_name": "vale/code/arch/x64/interop/Vale.Wrapper.X64.Sha.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Type0 | {
"end_col": 32,
"end_line": 17,
"start_col": 15,
"start_line": 17
} | |
Prims.Tot | [
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.SHA.SHA_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": ... | false | let uint32_p = B.buffer uint32 | let uint32_p = | false | null | false | B.buffer uint32 | {
"checked_file": "Vale.Wrapper.X64.Sha.fsti.checked",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.SHA.SHA_helpers.fsti.checked",
"Vale.Arch.BufferFriend.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"prims.fst.checked",
"LowStar.ImmutableBuffer.fst.checked",
"LowS... | [
"total"
] | [
"LowStar.Buffer.buffer",
"Lib.IntTypes.uint32"
] | [] | module Vale.Wrapper.X64.Sha
open Vale.X64.CPU_Features_s
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module BV = LowStar.BufferView
module HS = FStar.HyperStack
module BF = Vale.Arch.BufferFriend
open FStar.Mul
open Vale.SHA.SHA_helpers
open Lib.IntTypes | false | true | Vale.Wrapper.X64.Sha.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val uint32_p : Type0 | [] | Vale.Wrapper.X64.Sha.uint32_p | {
"file_name": "vale/code/arch/x64/interop/Vale.Wrapper.X64.Sha.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Type0 | {
"end_col": 30,
"end_line": 15,
"start_col": 15,
"start_line": 15
} | |
Prims.Tot | [
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.SHA.SHA_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": ... | false | let uint64 = uint_t U64 PUB | let uint64 = | false | null | false | uint_t U64 PUB | {
"checked_file": "Vale.Wrapper.X64.Sha.fsti.checked",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.SHA.SHA_helpers.fsti.checked",
"Vale.Arch.BufferFriend.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"prims.fst.checked",
"LowStar.ImmutableBuffer.fst.checked",
"LowS... | [
"total"
] | [
"Lib.IntTypes.uint_t",
"Lib.IntTypes.U64",
"Lib.IntTypes.PUB"
] | [] | module Vale.Wrapper.X64.Sha
open Vale.X64.CPU_Features_s
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module BV = LowStar.BufferView
module HS = FStar.HyperStack
module BF = Vale.Arch.BufferFriend
open FStar.Mul
open Vale.SHA.SHA_helpers
open Lib.IntTypes
unfold
let uint32_p ... | false | true | Vale.Wrapper.X64.Sha.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val uint64 : Type0 | [] | Vale.Wrapper.X64.Sha.uint64 | {
"file_name": "vale/code/arch/x64/interop/Vale.Wrapper.X64.Sha.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Type0 | {
"end_col": 27,
"end_line": 21,
"start_col": 13,
"start_line": 21
} | |
Prims.Tot | [
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.SHA.SHA_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": ... | false | let uint8_p = B.buffer uint8 | let uint8_p = | false | null | false | B.buffer uint8 | {
"checked_file": "Vale.Wrapper.X64.Sha.fsti.checked",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.SHA.SHA_helpers.fsti.checked",
"Vale.Arch.BufferFriend.fsti.checked",
"Spec.SHA2.Constants.fst.checked",
"prims.fst.checked",
"LowStar.ImmutableBuffer.fst.checked",
"LowS... | [
"total"
] | [
"LowStar.Buffer.buffer",
"Lib.IntTypes.uint8"
] | [] | module Vale.Wrapper.X64.Sha
open Vale.X64.CPU_Features_s
open FStar.HyperStack.ST
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module BV = LowStar.BufferView
module HS = FStar.HyperStack
module BF = Vale.Arch.BufferFriend
open FStar.Mul
open Vale.SHA.SHA_helpers
open Lib.IntTypes
unfold
let uint32_p ... | false | true | Vale.Wrapper.X64.Sha.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val uint8_p : Type0 | [] | Vale.Wrapper.X64.Sha.uint8_p | {
"file_name": "vale/code/arch/x64/interop/Vale.Wrapper.X64.Sha.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Type0 | {
"end_col": 28,
"end_line": 19,
"start_col": 14,
"start_line": 19
} | |
Prims.Tot | val two_two_to_four (#a: Type) (x: two (two a)) : four a | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | false | let two_two_to_four (#a:Type) (x:two (two a)) : four a =
let (Mktwo (Mktwo x0 x1) (Mktwo x2 x3)) = x in
Mkfour x0 x1 x2 x3 | val two_two_to_four (#a: Type) (x: two (two a)) : four a
let two_two_to_four (#a: Type) (x: two (two a)) : four a = | false | null | false | let Mktwo (Mktwo x0 x1) (Mktwo x2 x3) = x in
Mkfour x0 x1 x2 x3 | {
"checked_file": "Vale.Def.Words.Four_s.fsti.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Def.Words.Four_s.fsti"
} | [
"total"
] | [
"Vale.Def.Words_s.two",
"Vale.Def.Words_s.Mkfour",
"Vale.Def.Words_s.four"
] | [] | module Vale.Def.Words.Four_s
open Vale.Def.Words_s
open FStar.Mul
unfold let four_map (#a #b:Type) (f:a -> b) (x:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
Mkfour (f x0) (f x1) (f x2) (f x3)
unfold let four_map2 (#a #b:Type) (f:a -> a -> b) (x y:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
let Mkfou... | false | false | Vale.Def.Words.Four_s.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val two_two_to_four (#a: Type) (x: two (two a)) : four a | [] | Vale.Def.Words.Four_s.two_two_to_four | {
"file_name": "vale/specs/defs/Vale.Def.Words.Four_s.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | x: Vale.Def.Words_s.two (Vale.Def.Words_s.two a) -> Vale.Def.Words_s.four a | {
"end_col": 20,
"end_line": 16,
"start_col": 56,
"start_line": 14
} |
Prims.Tot | val four_to_two_two (#a: Type) (x: four a) : two (two a) | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | false | let four_to_two_two (#a:Type) (x:four a) : two (two a) =
let Mkfour x0 x1 x2 x3 = x in
Mktwo (Mktwo x0 x1) (Mktwo x2 x3) | val four_to_two_two (#a: Type) (x: four a) : two (two a)
let four_to_two_two (#a: Type) (x: four a) : two (two a) = | false | null | false | let Mkfour x0 x1 x2 x3 = x in
Mktwo (Mktwo x0 x1) (Mktwo x2 x3) | {
"checked_file": "Vale.Def.Words.Four_s.fsti.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Def.Words.Four_s.fsti"
} | [
"total"
] | [
"Vale.Def.Words_s.four",
"Vale.Def.Words_s.Mktwo",
"Vale.Def.Words_s.two"
] | [] | module Vale.Def.Words.Four_s
open Vale.Def.Words_s
open FStar.Mul
unfold let four_map (#a #b:Type) (f:a -> b) (x:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
Mkfour (f x0) (f x1) (f x2) (f x3)
unfold let four_map2 (#a #b:Type) (f:a -> a -> b) (x y:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
let Mkfou... | false | false | Vale.Def.Words.Four_s.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val four_to_two_two (#a: Type) (x: four a) : two (two a) | [] | Vale.Def.Words.Four_s.four_to_two_two | {
"file_name": "vale/specs/defs/Vale.Def.Words.Four_s.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | x: Vale.Def.Words_s.four a -> Vale.Def.Words_s.two (Vale.Def.Words_s.two a) | {
"end_col": 35,
"end_line": 20,
"start_col": 56,
"start_line": 18
} |
Prims.Tot | val four_map2 (#a #b: Type) (f: (a -> a -> b)) (x y: four a) : four b | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | false | let four_map2 (#a #b:Type) (f:a -> a -> b) (x y:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
let Mkfour y0 y1 y2 y3 = y in
Mkfour (f x0 y0) (f x1 y1) (f x2 y2) (f x3 y3) | val four_map2 (#a #b: Type) (f: (a -> a -> b)) (x y: four a) : four b
let four_map2 (#a #b: Type) (f: (a -> a -> b)) (x y: four a) : four b = | false | null | false | let Mkfour x0 x1 x2 x3 = x in
let Mkfour y0 y1 y2 y3 = y in
Mkfour (f x0 y0) (f x1 y1) (f x2 y2) (f x3 y3) | {
"checked_file": "Vale.Def.Words.Four_s.fsti.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Def.Words.Four_s.fsti"
} | [
"total"
] | [
"Vale.Def.Words_s.four",
"Vale.Def.Words_s.Mkfour"
] | [] | module Vale.Def.Words.Four_s
open Vale.Def.Words_s
open FStar.Mul
unfold let four_map (#a #b:Type) (f:a -> b) (x:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
Mkfour (f x0) (f x1) (f x2) (f x3) | false | false | Vale.Def.Words.Four_s.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val four_map2 (#a #b: Type) (f: (a -> a -> b)) (x y: four a) : four b | [] | Vale.Def.Words.Four_s.four_map2 | {
"file_name": "vale/specs/defs/Vale.Def.Words.Four_s.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | f: (_: a -> _: a -> b) -> x: Vale.Def.Words_s.four a -> y: Vale.Def.Words_s.four a
-> Vale.Def.Words_s.four b | {
"end_col": 48,
"end_line": 12,
"start_col": 73,
"start_line": 9
} |
Prims.Tot | val four_map (#a #b: Type) (f: (a -> b)) (x: four a) : four b | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | false | let four_map (#a #b:Type) (f:a -> b) (x:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
Mkfour (f x0) (f x1) (f x2) (f x3) | val four_map (#a #b: Type) (f: (a -> b)) (x: four a) : four b
let four_map (#a #b: Type) (f: (a -> b)) (x: four a) : four b = | false | null | false | let Mkfour x0 x1 x2 x3 = x in
Mkfour (f x0) (f x1) (f x2) (f x3) | {
"checked_file": "Vale.Def.Words.Four_s.fsti.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Def.Words.Four_s.fsti"
} | [
"total"
] | [
"Vale.Def.Words_s.four",
"Vale.Def.Words_s.Mkfour"
] | [] | module Vale.Def.Words.Four_s
open Vale.Def.Words_s
open FStar.Mul | false | false | Vale.Def.Words.Four_s.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val four_map (#a #b: Type) (f: (a -> b)) (x: four a) : four b | [] | Vale.Def.Words.Four_s.four_map | {
"file_name": "vale/specs/defs/Vale.Def.Words.Four_s.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | f: (_: a -> b) -> x: Vale.Def.Words_s.four a -> Vale.Def.Words_s.four b | {
"end_col": 36,
"end_line": 7,
"start_col": 65,
"start_line": 5
} |
Prims.Tot | val four_reverse (#a: Type) (x: four a) : four a | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | false | let four_reverse (#a:Type) (x:four a) : four a =
let Mkfour x0 x1 x2 x3 = x in
Mkfour x3 x2 x1 x0 | val four_reverse (#a: Type) (x: four a) : four a
let four_reverse (#a: Type) (x: four a) : four a = | false | null | false | let Mkfour x0 x1 x2 x3 = x in
Mkfour x3 x2 x1 x0 | {
"checked_file": "Vale.Def.Words.Four_s.fsti.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Def.Words.Four_s.fsti"
} | [
"total"
] | [
"Vale.Def.Words_s.four",
"Vale.Def.Words_s.Mkfour"
] | [] | module Vale.Def.Words.Four_s
open Vale.Def.Words_s
open FStar.Mul
unfold let four_map (#a #b:Type) (f:a -> b) (x:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
Mkfour (f x0) (f x1) (f x2) (f x3)
unfold let four_map2 (#a #b:Type) (f:a -> a -> b) (x y:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
let Mkfou... | false | false | Vale.Def.Words.Four_s.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val four_reverse (#a: Type) (x: four a) : four a | [] | Vale.Def.Words.Four_s.four_reverse | {
"file_name": "vale/specs/defs/Vale.Def.Words.Four_s.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | x: Vale.Def.Words_s.four a -> Vale.Def.Words_s.four a | {
"end_col": 20,
"end_line": 63,
"start_col": 48,
"start_line": 61
} |
Prims.Tot | val four_select (#a: Type) (x: four a) (selector: nat2) : a | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | false | let four_select (#a:Type) (x:four a) (selector:nat2) : a =
match selector with
| 0 -> x.lo0
| 1 -> x.lo1
| 2 -> x.hi2
| 3 -> x.hi3 | val four_select (#a: Type) (x: four a) (selector: nat2) : a
let four_select (#a: Type) (x: four a) (selector: nat2) : a = | false | null | false | match selector with
| 0 -> x.lo0
| 1 -> x.lo1
| 2 -> x.hi2
| 3 -> x.hi3 | {
"checked_file": "Vale.Def.Words.Four_s.fsti.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Def.Words.Four_s.fsti"
} | [
"total"
] | [
"Vale.Def.Words_s.four",
"Vale.Def.Words_s.nat2",
"Vale.Def.Words_s.__proj__Mkfour__item__lo0",
"Vale.Def.Words_s.__proj__Mkfour__item__lo1",
"Vale.Def.Words_s.__proj__Mkfour__item__hi2",
"Vale.Def.Words_s.__proj__Mkfour__item__hi3"
] | [] | module Vale.Def.Words.Four_s
open Vale.Def.Words_s
open FStar.Mul
unfold let four_map (#a #b:Type) (f:a -> b) (x:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
Mkfour (f x0) (f x1) (f x2) (f x3)
unfold let four_map2 (#a #b:Type) (f:a -> a -> b) (x y:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
let Mkfou... | false | false | Vale.Def.Words.Four_s.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val four_select (#a: Type) (x: four a) (selector: nat2) : a | [] | Vale.Def.Words.Four_s.four_select | {
"file_name": "vale/specs/defs/Vale.Def.Words.Four_s.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | x: Vale.Def.Words_s.four a -> selector: Vale.Def.Words_s.nat2 -> a | {
"end_col": 14,
"end_line": 52,
"start_col": 2,
"start_line": 48
} |
Prims.Tot | val four_insert (#a: Type) (x: four a) (y: a) (selector: nat2) : four a | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | false | let four_insert (#a:Type) (x:four a) (y:a) (selector:nat2) : four a =
match selector with
| 0 -> Mkfour y x.lo1 x.hi2 x.hi3
| 1 -> Mkfour x.lo0 y x.hi2 x.hi3
| 2 -> Mkfour x.lo0 x.lo1 y x.hi3
| 3 -> Mkfour x.lo0 x.lo1 x.hi2 y | val four_insert (#a: Type) (x: four a) (y: a) (selector: nat2) : four a
let four_insert (#a: Type) (x: four a) (y: a) (selector: nat2) : four a = | false | null | false | match selector with
| 0 -> Mkfour y x.lo1 x.hi2 x.hi3
| 1 -> Mkfour x.lo0 y x.hi2 x.hi3
| 2 -> Mkfour x.lo0 x.lo1 y x.hi3
| 3 -> Mkfour x.lo0 x.lo1 x.hi2 y | {
"checked_file": "Vale.Def.Words.Four_s.fsti.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Def.Words.Four_s.fsti"
} | [
"total"
] | [
"Vale.Def.Words_s.four",
"Vale.Def.Words_s.nat2",
"Vale.Def.Words_s.Mkfour",
"Vale.Def.Words_s.__proj__Mkfour__item__lo1",
"Vale.Def.Words_s.__proj__Mkfour__item__hi2",
"Vale.Def.Words_s.__proj__Mkfour__item__hi3",
"Vale.Def.Words_s.__proj__Mkfour__item__lo0"
] | [] | module Vale.Def.Words.Four_s
open Vale.Def.Words_s
open FStar.Mul
unfold let four_map (#a #b:Type) (f:a -> b) (x:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
Mkfour (f x0) (f x1) (f x2) (f x3)
unfold let four_map2 (#a #b:Type) (f:a -> a -> b) (x y:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
let Mkfou... | false | false | Vale.Def.Words.Four_s.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val four_insert (#a: Type) (x: four a) (y: a) (selector: nat2) : four a | [] | Vale.Def.Words.Four_s.four_insert | {
"file_name": "vale/specs/defs/Vale.Def.Words.Four_s.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | x: Vale.Def.Words_s.four a -> y: a -> selector: Vale.Def.Words_s.nat2 -> Vale.Def.Words_s.four a | {
"end_col": 35,
"end_line": 59,
"start_col": 2,
"start_line": 55
} |
Prims.Tot | val four_to_nat (size: nat) (x: four (natN (pow2 size))) : natN (pow2 (4 * size)) | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | false | let four_to_nat (size:nat) (x:four (natN (pow2 size))) : natN (pow2 (4 * size)) =
four_to_nat_unfold size x | val four_to_nat (size: nat) (x: four (natN (pow2 size))) : natN (pow2 (4 * size))
let four_to_nat (size: nat) (x: four (natN (pow2 size))) : natN (pow2 (4 * size)) = | false | null | false | four_to_nat_unfold size x | {
"checked_file": "Vale.Def.Words.Four_s.fsti.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Def.Words.Four_s.fsti"
} | [
"total"
] | [
"Prims.nat",
"Vale.Def.Words_s.four",
"Vale.Def.Words_s.natN",
"Prims.pow2",
"Vale.Def.Words.Four_s.four_to_nat_unfold",
"FStar.Mul.op_Star"
] | [] | module Vale.Def.Words.Four_s
open Vale.Def.Words_s
open FStar.Mul
unfold let four_map (#a #b:Type) (f:a -> b) (x:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
Mkfour (f x0) (f x1) (f x2) (f x3)
unfold let four_map2 (#a #b:Type) (f:a -> a -> b) (x y:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
let Mkfou... | false | false | Vale.Def.Words.Four_s.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val four_to_nat (size: nat) (x: four (natN (pow2 size))) : natN (pow2 (4 * size)) | [] | Vale.Def.Words.Four_s.four_to_nat | {
"file_name": "vale/specs/defs/Vale.Def.Words.Four_s.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | size: Prims.nat -> x: Vale.Def.Words_s.four (Vale.Def.Words_s.natN (Prims.pow2 size))
-> Vale.Def.Words_s.natN (Prims.pow2 (4 * size)) | {
"end_col": 27,
"end_line": 45,
"start_col": 2,
"start_line": 45
} |
Prims.Tot | val nat_to_four (size: nat) (n: natN (pow2 (4 * size))) : four (natN (pow2 size)) | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | false | let nat_to_four (size:nat) (n:natN (pow2 (4 * size))) : four (natN (pow2 size)) =
nat_to_four_unfold size n | val nat_to_four (size: nat) (n: natN (pow2 (4 * size))) : four (natN (pow2 size))
let nat_to_four (size: nat) (n: natN (pow2 (4 * size))) : four (natN (pow2 size)) = | false | null | false | nat_to_four_unfold size n | {
"checked_file": "Vale.Def.Words.Four_s.fsti.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Def.Words.Four_s.fsti"
} | [
"total"
] | [
"Prims.nat",
"Vale.Def.Words_s.natN",
"Prims.pow2",
"FStar.Mul.op_Star",
"Vale.Def.Words.Four_s.nat_to_four_unfold",
"Vale.Def.Words_s.four"
] | [] | module Vale.Def.Words.Four_s
open Vale.Def.Words_s
open FStar.Mul
unfold let four_map (#a #b:Type) (f:a -> b) (x:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
Mkfour (f x0) (f x1) (f x2) (f x3)
unfold let four_map2 (#a #b:Type) (f:a -> a -> b) (x y:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
let Mkfou... | false | false | Vale.Def.Words.Four_s.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val nat_to_four (size: nat) (n: natN (pow2 (4 * size))) : four (natN (pow2 size)) | [] | Vale.Def.Words.Four_s.nat_to_four | {
"file_name": "vale/specs/defs/Vale.Def.Words.Four_s.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | size: Prims.nat -> n: Vale.Def.Words_s.natN (Prims.pow2 (4 * size))
-> Vale.Def.Words_s.four (Vale.Def.Words_s.natN (Prims.pow2 size)) | {
"end_col": 27,
"end_line": 32,
"start_col": 2,
"start_line": 32
} |
Prims.Tot | val four_to_nat_unfold (size: nat) (x: four (natN (pow2 size))) : natN (pow2 (4 * size)) | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | false | let four_to_nat_unfold (size:nat) (x:four (natN (pow2 size))) : natN (pow2 (4 * size)) =
let n1 = pow2_norm size in
let n2 = pow2_norm (2 * size) in
let n3 = pow2_norm (3 * size) in
let n4 = pow2_norm (4 * size) in
let Mkfour x0 x1 x2 x3 = x in
int_to_natN n4 (x0 + x1 * n1 + x2 * n2 + x3 * n3) | val four_to_nat_unfold (size: nat) (x: four (natN (pow2 size))) : natN (pow2 (4 * size))
let four_to_nat_unfold (size: nat) (x: four (natN (pow2 size))) : natN (pow2 (4 * size)) = | false | null | false | let n1 = pow2_norm size in
let n2 = pow2_norm (2 * size) in
let n3 = pow2_norm (3 * size) in
let n4 = pow2_norm (4 * size) in
let Mkfour x0 x1 x2 x3 = x in
int_to_natN n4 (x0 + x1 * n1 + x2 * n2 + x3 * n3) | {
"checked_file": "Vale.Def.Words.Four_s.fsti.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Def.Words.Four_s.fsti"
} | [
"total"
] | [
"Prims.nat",
"Vale.Def.Words_s.four",
"Vale.Def.Words_s.natN",
"Prims.pow2",
"Vale.Def.Words_s.int_to_natN",
"Prims.op_Addition",
"FStar.Mul.op_Star",
"Prims.pos",
"Vale.Def.Words_s.pow2_norm"
] | [] | module Vale.Def.Words.Four_s
open Vale.Def.Words_s
open FStar.Mul
unfold let four_map (#a #b:Type) (f:a -> b) (x:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
Mkfour (f x0) (f x1) (f x2) (f x3)
unfold let four_map2 (#a #b:Type) (f:a -> a -> b) (x y:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
let Mkfou... | false | false | Vale.Def.Words.Four_s.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val four_to_nat_unfold (size: nat) (x: four (natN (pow2 size))) : natN (pow2 (4 * size)) | [] | Vale.Def.Words.Four_s.four_to_nat_unfold | {
"file_name": "vale/specs/defs/Vale.Def.Words.Four_s.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | size: Prims.nat -> x: Vale.Def.Words_s.four (Vale.Def.Words_s.natN (Prims.pow2 size))
-> Vale.Def.Words_s.natN (Prims.pow2 (4 * size)) | {
"end_col": 51,
"end_line": 41,
"start_col": 88,
"start_line": 35
} |
Prims.Tot | val nat_to_four_unfold (size: nat) (n: natN (pow2 (4 * size))) : four (natN (pow2 size)) | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | false | let nat_to_four_unfold (size:nat) (n:natN (pow2 (4 * size))) : four (natN (pow2 size)) =
let n1 = pow2_norm size in
let n2 = pow2_norm (2 * size) in
let n3 = pow2_norm (3 * size) in
let n4 = pow2_norm (4 * size) in
Mkfour (n % n1) ((n / n1) % n1) ((n / n2) % n1) ((n / n3) % n1) | val nat_to_four_unfold (size: nat) (n: natN (pow2 (4 * size))) : four (natN (pow2 size))
let nat_to_four_unfold (size: nat) (n: natN (pow2 (4 * size))) : four (natN (pow2 size)) = | false | null | false | let n1 = pow2_norm size in
let n2 = pow2_norm (2 * size) in
let n3 = pow2_norm (3 * size) in
let n4 = pow2_norm (4 * size) in
Mkfour (n % n1) ((n / n1) % n1) ((n / n2) % n1) ((n / n3) % n1) | {
"checked_file": "Vale.Def.Words.Four_s.fsti.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Def.Words.Four_s.fsti"
} | [
"total"
] | [
"Prims.nat",
"Vale.Def.Words_s.natN",
"Prims.pow2",
"FStar.Mul.op_Star",
"Vale.Def.Words_s.Mkfour",
"Prims.op_Modulus",
"Prims.op_Division",
"Prims.pos",
"Vale.Def.Words_s.pow2_norm",
"Vale.Def.Words_s.four"
] | [] | module Vale.Def.Words.Four_s
open Vale.Def.Words_s
open FStar.Mul
unfold let four_map (#a #b:Type) (f:a -> b) (x:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
Mkfour (f x0) (f x1) (f x2) (f x3)
unfold let four_map2 (#a #b:Type) (f:a -> a -> b) (x y:four a) : four b =
let Mkfour x0 x1 x2 x3 = x in
let Mkfou... | false | false | Vale.Def.Words.Four_s.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val nat_to_four_unfold (size: nat) (n: natN (pow2 (4 * size))) : four (natN (pow2 size)) | [] | Vale.Def.Words.Four_s.nat_to_four_unfold | {
"file_name": "vale/specs/defs/Vale.Def.Words.Four_s.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | size: Prims.nat -> n: Vale.Def.Words_s.natN (Prims.pow2 (4 * size))
-> Vale.Def.Words_s.four (Vale.Def.Words_s.natN (Prims.pow2 size)) | {
"end_col": 65,
"end_line": 28,
"start_col": 88,
"start_line": 23
} |
Prims.Tot | [
{
"abbrev": false,
"full_module": "Vale.Lib.Seqs",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GCTR_s",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let bytes_to_quad_size (num_bytes:nat) =
((num_bytes + 15) / 16) | let bytes_to_quad_size (num_bytes: nat) = | false | null | false | ((num_bytes + 15) / 16) | {
"checked_file": "Vale.AES.GCM_helpers.fsti.checked",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.GCT... | [
"total"
] | [
"Prims.nat",
"Prims.op_Division",
"Prims.op_Addition",
"Prims.int"
] | [] | module Vale.AES.GCM_helpers
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open Vale.Arch.Types
open FStar.Mul
open FStar.Seq
open Vale.AES.AES_s
open Vale.AES.GCTR_s
open FStar.Math.Lemmas
open Vale.Lib.Seqs | false | true | Vale.AES.GCM_helpers.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val bytes_to_quad_size : num_bytes: Prims.nat -> Prims.int | [] | Vale.AES.GCM_helpers.bytes_to_quad_size | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM_helpers.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | num_bytes: Prims.nat -> Prims.int | {
"end_col": 25,
"end_line": 16,
"start_col": 2,
"start_line": 16
} | |
FStar.Tactics.Effect.Tac | [
{
"abbrev": false,
"full_module": "Vale.Curve25519.Fast_defs",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommSemiring",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev... | false | let int_canon = fun _ -> norm [delta; zeta; iota]; int_semiring () | let int_canon = | true | null | false | fun _ ->
norm [delta; zeta; iota];
int_semiring () | {
"checked_file": "Vale.Curve25519.FastMul_helpers.fsti.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Curve25519.Fast_defs.fst.checked",
"prims.fst.checked",
"FStar.Tactics.CanonCommSemiring.fst.checked",
"FStar.Tactics.fst.checked",
"... | [] | [
"FStar.Tactics.CanonCommSemiring.int_semiring",
"Prims.unit",
"FStar.Tactics.V1.Builtins.norm",
"Prims.Cons",
"FStar.Pervasives.norm_step",
"FStar.Pervasives.delta",
"FStar.Pervasives.zeta",
"FStar.Pervasives.iota",
"Prims.Nil"
] | [] | module Vale.Curve25519.FastMul_helpers
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Mul
open FStar.Tactics
open FStar.Tactics.CanonCommSemiring
open Vale.Curve25519.Fast_defs | false | false | Vale.Curve25519.FastMul_helpers.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val int_canon : _: _ -> FStar.Tactics.Effect.Tac Prims.unit | [] | Vale.Curve25519.FastMul_helpers.int_canon | {
"file_name": "vale/code/crypto/ecc/curve25519/Vale.Curve25519.FastMul_helpers.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | _: _ -> FStar.Tactics.Effect.Tac Prims.unit | {
"end_col": 66,
"end_line": 11,
"start_col": 16,
"start_line": 11
} | |
Prims.Tot | val merkle_tree_conditions
(#hsz: Ghost.erased hash_size_t)
(offset: uint64_t)
(i j: uint32_t)
(hs: hash_vv hsz)
(rhs_ok: bool)
(rhs: hash_vec #hsz)
(mroot: hash #hsz)
: Tot bool | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | false | let merkle_tree_conditions (#hsz:Ghost.erased hash_size_t) (offset:uint64_t) (i j:uint32_t) (hs:hash_vv hsz) (rhs_ok:bool) (rhs:hash_vec #hsz) (mroot:hash #hsz): Tot bool =
j >= i && add64_fits offset j &&
V.size_of hs = merkle_tree_size_lg &&
V.size_of rhs = merkle_tree_size_lg | val merkle_tree_conditions
(#hsz: Ghost.erased hash_size_t)
(offset: uint64_t)
(i j: uint32_t)
(hs: hash_vv hsz)
(rhs_ok: bool)
(rhs: hash_vec #hsz)
(mroot: hash #hsz)
: Tot bool
let merkle_tree_conditions
(#hsz: Ghost.erased hash_size_t)
(offset: uint64_t)
... | false | null | false | j >= i && add64_fits offset j && V.size_of hs = merkle_tree_size_lg &&
V.size_of rhs = merkle_tree_size_lg | {
"checked_file": "MerkleTree.Low.fst.checked",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"Lo... | [
"total"
] | [
"FStar.Ghost.erased",
"MerkleTree.Low.Datastructures.hash_size_t",
"EverCrypt.Helpers.uint64_t",
"LowStar.Vector.uint32_t",
"MerkleTree.Low.Datastructures.hash_vv",
"FStar.Ghost.reveal",
"Prims.bool",
"MerkleTree.Low.Datastructures.hash_vec",
"MerkleTree.Low.Datastructures.hash",
"Prims.op_AmpAmp"... | [] | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | false | false | MerkleTree.Low.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 merkle_tree_conditions
(#hsz: Ghost.erased hash_size_t)
(offset: uint64_t)
(i j: uint32_t)
(hs: hash_vv hsz)
(rhs_ok: bool)
(rhs: hash_vec #hsz)
(mroot: hash #hsz)
: Tot bool | [] | MerkleTree.Low.merkle_tree_conditions | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "3b0f086655c145aa23f58a97259ebf4cf112a4a3",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} |
offset: EverCrypt.Helpers.uint64_t ->
i: LowStar.Vector.uint32_t ->
j: LowStar.Vector.uint32_t ->
hs: MerkleTree.Low.Datastructures.hash_vv (FStar.Ghost.reveal hsz) ->
rhs_ok: Prims.bool ->
rhs: MerkleTree.Low.Datastructures.hash_vec ->
mroot: MerkleTree.Low.Datastructures.hash
-> Prims.b... | {
"end_col": 37,
"end_line": 110,
"start_col": 2,
"start_line": 108
} |
Prims.Tot | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | false | let uint64_max = 18446744073709551615UL | let uint64_max = | false | null | false | 18446744073709551615uL | {
"checked_file": "MerkleTree.Low.fst.checked",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"Lo... | [
"total"
] | [
"FStar.UInt64.__uint_to_t"
] | [] | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | false | true | MerkleTree.Low.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 uint64_max : FStar.UInt64.t | [] | MerkleTree.Low.uint64_max | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "3b0f086655c145aa23f58a97259ebf4cf112a4a3",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | FStar.UInt64.t | {
"end_col": 39,
"end_line": 54,
"start_col": 17,
"start_line": 54
} | |
Prims.GTot | val mt_loc: mt_p -> GTot loc | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | false | let mt_loc mt = B.loc_all_regions_from false (B.frameOf mt) | val mt_loc: mt_p -> GTot loc
let mt_loc mt = | false | null | false | B.loc_all_regions_from false (B.frameOf mt) | {
"checked_file": "MerkleTree.Low.fst.checked",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"Lo... | [
"sometrivial"
] | [
"MerkleTree.Low.mt_p",
"LowStar.Monotonic.Buffer.loc_all_regions_from",
"LowStar.Monotonic.Buffer.frameOf",
"MerkleTree.Low.merkle_tree",
"LowStar.Buffer.trivial_preorder",
"LowStar.Monotonic.Buffer.loc"
] | [] | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | false | false | MerkleTree.Low.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 mt_loc: mt_p -> GTot loc | [] | MerkleTree.Low.mt_loc | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "3b0f086655c145aa23f58a97259ebf4cf112a4a3",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | mt: MerkleTree.Low.mt_p -> Prims.GTot LowStar.Monotonic.Buffer.loc | {
"end_col": 59,
"end_line": 232,
"start_col": 16,
"start_line": 232
} |
Prims.Tot | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | false | let uint32_32_max = 4294967295ul | let uint32_32_max = | false | null | false | 4294967295ul | {
"checked_file": "MerkleTree.Low.fst.checked",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"Lo... | [
"total"
] | [
"FStar.UInt32.__uint_to_t"
] | [] | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | false | true | MerkleTree.Low.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 uint32_32_max : FStar.UInt32.t | [] | MerkleTree.Low.uint32_32_max | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "3b0f086655c145aa23f58a97259ebf4cf112a4a3",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | FStar.UInt32.t | {
"end_col": 32,
"end_line": 51,
"start_col": 20,
"start_line": 51
} | |
Prims.Tot | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | false | let uint32_max = 4294967295UL | let uint32_max = | false | null | false | 4294967295uL | {
"checked_file": "MerkleTree.Low.fst.checked",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"Lo... | [
"total"
] | [
"FStar.UInt64.__uint_to_t"
] | [] | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | false | true | MerkleTree.Low.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 uint32_max : FStar.UInt64.t | [] | MerkleTree.Low.uint32_max | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "3b0f086655c145aa23f58a97259ebf4cf112a4a3",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | FStar.UInt64.t | {
"end_col": 29,
"end_line": 53,
"start_col": 17,
"start_line": 53
} | |
Prims.Tot | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | false | let u32_64 = Int.Cast.uint32_to_uint64 | let u32_64 = | false | null | false | Int.Cast.uint32_to_uint64 | {
"checked_file": "MerkleTree.Low.fst.checked",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"Lo... | [
"total"
] | [
"FStar.Int.Cast.uint32_to_uint64"
] | [] | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | false | false | MerkleTree.Low.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 u32_64 : a: FStar.UInt32.t -> b: FStar.UInt64.t{FStar.UInt64.v b = FStar.UInt32.v a} | [] | MerkleTree.Low.u32_64 | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "3b0f086655c145aa23f58a97259ebf4cf112a4a3",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | a: FStar.UInt32.t -> b: FStar.UInt64.t{FStar.UInt64.v b = FStar.UInt32.v a} | {
"end_col": 77,
"end_line": 58,
"start_col": 52,
"start_line": 58
} | |
Prims.Tot | val mt_flush_to_pre_nst: mtv:merkle_tree -> idx:offset_t -> Tot bool | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | false | let mt_flush_to_pre_nst mtv idx =
offsets_connect (MT?.offset mtv) idx &&
([@inline_let] let idx = split_offset (MT?.offset mtv) idx in
idx >= MT?.i mtv &&
idx < MT?.j mtv) | val mt_flush_to_pre_nst: mtv:merkle_tree -> idx:offset_t -> Tot bool
let mt_flush_to_pre_nst mtv idx = | false | null | false | offsets_connect (MT?.offset mtv) idx &&
([@@ inline_let ]let idx = split_offset (MT?.offset mtv) idx in
idx >= MT?.i mtv && idx < MT?.j mtv) | {
"checked_file": "MerkleTree.Low.fst.checked",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"Lo... | [
"total"
] | [
"MerkleTree.Low.merkle_tree",
"MerkleTree.Low.offset_t",
"Prims.op_AmpAmp",
"MerkleTree.Low.offsets_connect",
"MerkleTree.Low.__proj__MT__item__offset",
"FStar.Integers.op_Greater_Equals",
"FStar.Integers.Unsigned",
"FStar.Integers.W32",
"MerkleTree.Low.__proj__MT__item__i",
"FStar.Integers.op_Les... | [] | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | false | true | MerkleTree.Low.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 mt_flush_to_pre_nst: mtv:merkle_tree -> idx:offset_t -> Tot bool | [] | MerkleTree.Low.mt_flush_to_pre_nst | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "3b0f086655c145aa23f58a97259ebf4cf112a4a3",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | mtv: MerkleTree.Low.merkle_tree -> idx: MerkleTree.Low.offset_t -> Prims.bool | {
"end_col": 19,
"end_line": 2423,
"start_col": 2,
"start_line": 2420
} |
Prims.GTot | val path_loc: path_p -> GTot loc | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | false | let path_loc p = B.loc_all_regions_from false (B.frameOf p) | val path_loc: path_p -> GTot loc
let path_loc p = | false | null | false | B.loc_all_regions_from false (B.frameOf p) | {
"checked_file": "MerkleTree.Low.fst.checked",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"Lo... | [
"sometrivial"
] | [
"MerkleTree.Low.path_p",
"LowStar.Monotonic.Buffer.loc_all_regions_from",
"LowStar.Monotonic.Buffer.frameOf",
"MerkleTree.Low.path",
"LowStar.Buffer.trivial_preorder",
"LowStar.Monotonic.Buffer.loc"
] | [] | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | false | false | MerkleTree.Low.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 path_loc: path_p -> GTot loc | [] | MerkleTree.Low.path_loc | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "3b0f086655c145aa23f58a97259ebf4cf112a4a3",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | p: MerkleTree.Low.path_p -> Prims.GTot LowStar.Monotonic.Buffer.loc | {
"end_col": 59,
"end_line": 1080,
"start_col": 17,
"start_line": 1080
} |
Prims.Tot | val mt_flush_pre_nst: mt:merkle_tree -> Tot bool | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | false | let mt_flush_pre_nst mt = MT?.j mt > MT?.i mt | val mt_flush_pre_nst: mt:merkle_tree -> Tot bool
let mt_flush_pre_nst mt = | false | null | false | MT?.j mt > MT?.i mt | {
"checked_file": "MerkleTree.Low.fst.checked",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"Lo... | [
"total"
] | [
"MerkleTree.Low.merkle_tree",
"FStar.Integers.op_Greater",
"FStar.Integers.Unsigned",
"FStar.Integers.W32",
"MerkleTree.Low.__proj__MT__item__j",
"MerkleTree.Low.__proj__MT__item__i",
"Prims.bool"
] | [] | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | false | true | MerkleTree.Low.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 mt_flush_pre_nst: mt:merkle_tree -> Tot bool | [] | MerkleTree.Low.mt_flush_pre_nst | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "3b0f086655c145aa23f58a97259ebf4cf112a4a3",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | mt: MerkleTree.Low.merkle_tree -> Prims.bool | {
"end_col": 45,
"end_line": 2497,
"start_col": 26,
"start_line": 2497
} |
Prims.Tot | val mt_get_path_step_pre_nst:
#hsz:Ghost.erased hash_size_t ->
mtr:HH.rid ->
p:path ->
i:uint32_t ->
Tot bool | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | false | let mt_get_path_step_pre_nst #hsz mtr p i =
i < V.size_of (Path?.hashes p) | val mt_get_path_step_pre_nst:
#hsz:Ghost.erased hash_size_t ->
mtr:HH.rid ->
p:path ->
i:uint32_t ->
Tot bool
let mt_get_path_step_pre_nst #hsz mtr p i = | false | null | false | i < V.size_of (Path?.hashes p) | {
"checked_file": "MerkleTree.Low.fst.checked",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"Lo... | [
"total"
] | [
"FStar.Ghost.erased",
"MerkleTree.Low.Datastructures.hash_size_t",
"FStar.Monotonic.HyperHeap.rid",
"MerkleTree.Low.path",
"LowStar.Vector.uint32_t",
"FStar.Integers.op_Less",
"FStar.Integers.Unsigned",
"FStar.Integers.W32",
"LowStar.Vector.size_of",
"MerkleTree.Low.Datastructures.hash",
"Merkle... | [] | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | false | true | MerkleTree.Low.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 mt_get_path_step_pre_nst:
#hsz:Ghost.erased hash_size_t ->
mtr:HH.rid ->
p:path ->
i:uint32_t ->
Tot bool | [] | MerkleTree.Low.mt_get_path_step_pre_nst | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "3b0f086655c145aa23f58a97259ebf4cf112a4a3",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | mtr: FStar.Monotonic.HyperHeap.rid -> p: MerkleTree.Low.path -> i: LowStar.Vector.uint32_t
-> Prims.bool | {
"end_col": 32,
"end_line": 1860,
"start_col": 2,
"start_line": 1860
} |
Prims.Tot | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | false | let offset_range_limit = uint32_max | let offset_range_limit = | false | null | false | uint32_max | {
"checked_file": "MerkleTree.Low.fst.checked",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"Lo... | [
"total"
] | [
"MerkleTree.Low.uint32_max"
] | [] | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | false | true | MerkleTree.Low.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 offset_range_limit : FStar.UInt64.t | [] | MerkleTree.Low.offset_range_limit | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "3b0f086655c145aa23f58a97259ebf4cf112a4a3",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | FStar.UInt64.t | {
"end_col": 35,
"end_line": 55,
"start_col": 25,
"start_line": 55
} | |
Prims.Tot | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | false | let u64_32 = Int.Cast.uint64_to_uint32 | let u64_32 = | false | null | false | Int.Cast.uint64_to_uint32 | {
"checked_file": "MerkleTree.Low.fst.checked",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"Lo... | [
"total"
] | [
"FStar.Int.Cast.uint64_to_uint32"
] | [] | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | false | false | MerkleTree.Low.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 u64_32 : a: FStar.UInt64.t -> b: FStar.UInt32.t{FStar.UInt32.v b = FStar.UInt64.v a % Prims.pow2 32} | [] | MerkleTree.Low.u64_32 | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "3b0f086655c145aa23f58a97259ebf4cf112a4a3",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | a: FStar.UInt64.t -> b: FStar.UInt32.t{FStar.UInt32.v b = FStar.UInt64.v a % Prims.pow2 32} | {
"end_col": 77,
"end_line": 59,
"start_col": 52,
"start_line": 59
} | |
Prims.Tot | val merkle_tree_size_lg: uint32_t | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | false | let merkle_tree_size_lg = 32ul | val merkle_tree_size_lg: uint32_t
let merkle_tree_size_lg = | false | null | false | 32ul | {
"checked_file": "MerkleTree.Low.fst.checked",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"Lo... | [
"total"
] | [
"FStar.UInt32.__uint_to_t"
] | [] | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | false | true | MerkleTree.Low.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 merkle_tree_size_lg: uint32_t | [] | MerkleTree.Low.merkle_tree_size_lg | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "3b0f086655c145aa23f58a97259ebf4cf112a4a3",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | LowStar.Vector.uint32_t | {
"end_col": 30,
"end_line": 78,
"start_col": 26,
"start_line": 78
} |
Prims.Tot | val mt_not_full_nst: mtv:merkle_tree -> Tot bool | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | false | let mt_not_full_nst mtv = MT?.j mtv < uint32_32_max | val mt_not_full_nst: mtv:merkle_tree -> Tot bool
let mt_not_full_nst mtv = | false | null | false | MT?.j mtv < uint32_32_max | {
"checked_file": "MerkleTree.Low.fst.checked",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"Lo... | [
"total"
] | [
"MerkleTree.Low.merkle_tree",
"FStar.Integers.op_Less",
"FStar.Integers.Unsigned",
"FStar.Integers.W32",
"MerkleTree.Low.__proj__MT__item__j",
"MerkleTree.Low.uint32_32_max",
"Prims.bool"
] | [] | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | false | true | MerkleTree.Low.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 mt_not_full_nst: mtv:merkle_tree -> Tot bool | [] | MerkleTree.Low.mt_not_full_nst | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "3b0f086655c145aa23f58a97259ebf4cf112a4a3",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | mtv: MerkleTree.Low.merkle_tree -> Prims.bool | {
"end_col": 51,
"end_line": 117,
"start_col": 26,
"start_line": 117
} |
FStar.Pervasives.Lemma | val loc_union_assoc_4:
a:loc -> b:loc -> c:loc -> d:loc ->
Lemma (loc_union (loc_union a b) (loc_union c d) ==
loc_union (loc_union a c) (loc_union b d)) | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | false | let loc_union_assoc_4 a b c d =
loc_union_assoc (loc_union a b) c d;
loc_union_assoc a b c;
loc_union_assoc a c b;
loc_union_assoc (loc_union a c) b d | val loc_union_assoc_4:
a:loc -> b:loc -> c:loc -> d:loc ->
Lemma (loc_union (loc_union a b) (loc_union c d) ==
loc_union (loc_union a c) (loc_union b d))
let loc_union_assoc_4 a b c d = | false | null | true | loc_union_assoc (loc_union a b) c d;
loc_union_assoc a b c;
loc_union_assoc a c b;
loc_union_assoc (loc_union a c) b d | {
"checked_file": "MerkleTree.Low.fst.checked",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"Lo... | [
"lemma"
] | [
"LowStar.Monotonic.Buffer.loc",
"LowStar.Monotonic.Buffer.loc_union_assoc",
"LowStar.Monotonic.Buffer.loc_union",
"Prims.unit"
] | [] | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | false | false | MerkleTree.Low.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 loc_union_assoc_4:
a:loc -> b:loc -> c:loc -> d:loc ->
Lemma (loc_union (loc_union a b) (loc_union c d) ==
loc_union (loc_union a c) (loc_union b d)) | [] | MerkleTree.Low.loc_union_assoc_4 | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "3b0f086655c145aa23f58a97259ebf4cf112a4a3",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} |
a: LowStar.Monotonic.Buffer.loc ->
b: LowStar.Monotonic.Buffer.loc ->
c: LowStar.Monotonic.Buffer.loc ->
d: LowStar.Monotonic.Buffer.loc
-> FStar.Pervasives.Lemma
(ensures
LowStar.Monotonic.Buffer.loc_union (LowStar.Monotonic.Buffer.loc_union a b)
(LowStar.Monotonic.Buffer.loc_union... | {
"end_col": 37,
"end_line": 598,
"start_col": 2,
"start_line": 595
} |
FStar.Pervasives.Lemma | val insert_modifies_union_loc_weakening:
l1:loc -> l2:loc -> l3:loc -> h0:HS.mem -> h1:HS.mem ->
Lemma (requires (modifies l1 h0 h1))
(ensures (modifies (loc_union (loc_union l1 l2) l3) h0 h1)) | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | false | let insert_modifies_union_loc_weakening l1 l2 l3 h0 h1 =
B.loc_includes_union_l l1 l2 l1;
B.loc_includes_union_l (loc_union l1 l2) l3 (loc_union l1 l2) | val insert_modifies_union_loc_weakening:
l1:loc -> l2:loc -> l3:loc -> h0:HS.mem -> h1:HS.mem ->
Lemma (requires (modifies l1 h0 h1))
(ensures (modifies (loc_union (loc_union l1 l2) l3) h0 h1))
let insert_modifies_union_loc_weakening l1 l2 l3 h0 h1 = | false | null | true | B.loc_includes_union_l l1 l2 l1;
B.loc_includes_union_l (loc_union l1 l2) l3 (loc_union l1 l2) | {
"checked_file": "MerkleTree.Low.fst.checked",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"Lo... | [
"lemma"
] | [
"LowStar.Monotonic.Buffer.loc",
"FStar.Monotonic.HyperStack.mem",
"LowStar.Monotonic.Buffer.loc_includes_union_l",
"LowStar.Monotonic.Buffer.loc_union",
"Prims.unit"
] | [] | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | false | false | MerkleTree.Low.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 insert_modifies_union_loc_weakening:
l1:loc -> l2:loc -> l3:loc -> h0:HS.mem -> h1:HS.mem ->
Lemma (requires (modifies l1 h0 h1))
(ensures (modifies (loc_union (loc_union l1 l2) l3) h0 h1)) | [] | MerkleTree.Low.insert_modifies_union_loc_weakening | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "3b0f086655c145aa23f58a97259ebf4cf112a4a3",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} |
l1: LowStar.Monotonic.Buffer.loc ->
l2: LowStar.Monotonic.Buffer.loc ->
l3: LowStar.Monotonic.Buffer.loc ->
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem
-> FStar.Pervasives.Lemma (requires LowStar.Monotonic.Buffer.modifies l1 h0 h1)
(ensures
LowStar.Monot... | {
"end_col": 63,
"end_line": 669,
"start_col": 2,
"start_line": 668
} |
Prims.Tot | val mt_insert_pre_nst: mtv:merkle_tree -> v:hash #(MT?.hash_size mtv) -> Tot bool | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | false | let mt_insert_pre_nst mtv v = mt_not_full_nst mtv && add64_fits (MT?.offset mtv) ((MT?.j mtv) + 1ul) | val mt_insert_pre_nst: mtv:merkle_tree -> v:hash #(MT?.hash_size mtv) -> Tot bool
let mt_insert_pre_nst mtv v = | false | null | false | mt_not_full_nst mtv && add64_fits (MT?.offset mtv) ((MT?.j mtv) + 1ul) | {
"checked_file": "MerkleTree.Low.fst.checked",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"Lo... | [
"total"
] | [
"MerkleTree.Low.merkle_tree",
"MerkleTree.Low.Datastructures.hash",
"MerkleTree.Low.__proj__MT__item__hash_size",
"Prims.op_AmpAmp",
"MerkleTree.Low.mt_not_full_nst",
"MerkleTree.Low.add64_fits",
"MerkleTree.Low.__proj__MT__item__offset",
"FStar.Integers.op_Plus",
"FStar.Integers.Unsigned",
"FStar... | [] | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | false | false | MerkleTree.Low.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 mt_insert_pre_nst: mtv:merkle_tree -> v:hash #(MT?.hash_size mtv) -> Tot bool | [] | MerkleTree.Low.mt_insert_pre_nst | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "3b0f086655c145aa23f58a97259ebf4cf112a4a3",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | mtv: MerkleTree.Low.merkle_tree -> v: MerkleTree.Low.Datastructures.hash -> Prims.bool | {
"end_col": 100,
"end_line": 927,
"start_col": 30,
"start_line": 927
} |
Prims.Tot | val add64_fits (x: offset_t) (i: index_t) : Tot bool | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | false | let add64_fits (x:offset_t) (i:index_t): Tot bool = uint64_max - x >= (u32_64 i) | val add64_fits (x: offset_t) (i: index_t) : Tot bool
let add64_fits (x: offset_t) (i: index_t) : Tot bool = | false | null | false | uint64_max - x >= (u32_64 i) | {
"checked_file": "MerkleTree.Low.fst.checked",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"Lo... | [
"total"
] | [
"MerkleTree.Low.offset_t",
"MerkleTree.Low.index_t",
"FStar.Integers.op_Greater_Equals",
"FStar.Integers.Unsigned",
"FStar.Integers.W64",
"FStar.Integers.op_Subtraction",
"MerkleTree.Low.uint64_max",
"MerkleTree.Low.u32_64",
"Prims.bool"
] | [] | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | false | true | MerkleTree.Low.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 add64_fits (x: offset_t) (i: index_t) : Tot bool | [] | MerkleTree.Low.add64_fits | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "3b0f086655c145aa23f58a97259ebf4cf112a4a3",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | x: MerkleTree.Low.offset_t -> i: MerkleTree.Low.index_t -> Prims.bool | {
"end_col": 80,
"end_line": 71,
"start_col": 52,
"start_line": 71
} |
Prims.Tot | val offset_of: i:index_t -> Tot index_t | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | false | let offset_of i = if i % 2ul = 0ul then i else i - 1ul | val offset_of: i:index_t -> Tot index_t
let offset_of i = | false | null | false | if i % 2ul = 0ul then i else i - 1ul | {
"checked_file": "MerkleTree.Low.fst.checked",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"Lo... | [
"total"
] | [
"MerkleTree.Low.index_t",
"Prims.op_Equality",
"FStar.UInt32.t",
"FStar.Integers.op_Percent",
"FStar.Integers.Unsigned",
"FStar.Integers.W32",
"FStar.UInt32.__uint_to_t",
"Prims.bool",
"FStar.Integers.op_Subtraction"
] | [] | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | false | true | MerkleTree.Low.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 offset_of: i:index_t -> Tot index_t | [] | MerkleTree.Low.offset_of | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "3b0f086655c145aa23f58a97259ebf4cf112a4a3",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | i: MerkleTree.Low.index_t -> MerkleTree.Low.index_t | {
"end_col": 54,
"end_line": 125,
"start_col": 18,
"start_line": 125
} |
Prims.GTot | val mt_safe_elts:
#hsz:hash_size_t ->
h:HS.mem -> lv:uint32_t{lv <= merkle_tree_size_lg} ->
hs:hash_vv hsz {V.size_of hs = merkle_tree_size_lg} ->
i:index_t -> j:index_t{j >= i} ->
GTot Type0 (decreases (32 - U32.v lv)) | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | false | let rec mt_safe_elts #hsz h lv hs i j =
if lv = merkle_tree_size_lg then true
else (let ofs = offset_of i in
V.size_of (V.get h hs lv) == j - ofs /\
mt_safe_elts #hsz h (lv + 1ul) hs (i / 2ul) (j / 2ul)) | val mt_safe_elts:
#hsz:hash_size_t ->
h:HS.mem -> lv:uint32_t{lv <= merkle_tree_size_lg} ->
hs:hash_vv hsz {V.size_of hs = merkle_tree_size_lg} ->
i:index_t -> j:index_t{j >= i} ->
GTot Type0 (decreases (32 - U32.v lv))
let rec mt_safe_elts #hsz h lv hs i j = | false | null | false | if lv = merkle_tree_size_lg
then true
else
(let ofs = offset_of i in
V.size_of (V.get h hs lv) == j - ofs /\ mt_safe_elts #hsz h (lv + 1ul) hs (i / 2ul) (j / 2ul)) | {
"checked_file": "MerkleTree.Low.fst.checked",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"Lo... | [
"sometrivial",
""
] | [
"MerkleTree.Low.Datastructures.hash_size_t",
"FStar.Monotonic.HyperStack.mem",
"LowStar.Vector.uint32_t",
"Prims.b2t",
"FStar.Integers.op_Less_Equals",
"FStar.Integers.Unsigned",
"FStar.Integers.W32",
"MerkleTree.Low.merkle_tree_size_lg",
"MerkleTree.Low.Datastructures.hash_vv",
"Prims.op_Equality... | [] | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | false | false | MerkleTree.Low.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 mt_safe_elts:
#hsz:hash_size_t ->
h:HS.mem -> lv:uint32_t{lv <= merkle_tree_size_lg} ->
hs:hash_vv hsz {V.size_of hs = merkle_tree_size_lg} ->
i:index_t -> j:index_t{j >= i} ->
GTot Type0 (decreases (32 - U32.v lv)) | [
"recursion"
] | MerkleTree.Low.mt_safe_elts | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "3b0f086655c145aa23f58a97259ebf4cf112a4a3",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} |
h: FStar.Monotonic.HyperStack.mem ->
lv: LowStar.Vector.uint32_t{lv <= MerkleTree.Low.merkle_tree_size_lg} ->
hs:
MerkleTree.Low.Datastructures.hash_vv hsz
{LowStar.Vector.size_of hs = MerkleTree.Low.merkle_tree_size_lg} ->
i: MerkleTree.Low.index_t ->
j: MerkleTree.Low.index_t{j >= i... | {
"end_col": 61,
"end_line": 141,
"start_col": 2,
"start_line": 138
} |
Prims.Tot | val join_offset (tree: offset_t) (i: index_t{add64_fits tree i})
: Tot (r: offset_t{offsets_connect tree r}) | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | false | let join_offset (tree:offset_t) (i:index_t{add64_fits tree i}): Tot (r:offset_t{offsets_connect tree r}) =
U64.add tree (u32_64 i) | val join_offset (tree: offset_t) (i: index_t{add64_fits tree i})
: Tot (r: offset_t{offsets_connect tree r})
let join_offset (tree: offset_t) (i: index_t{add64_fits tree i})
: Tot (r: offset_t{offsets_connect tree r}) = | false | null | false | U64.add tree (u32_64 i) | {
"checked_file": "MerkleTree.Low.fst.checked",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"Lo... | [
"total"
] | [
"MerkleTree.Low.offset_t",
"MerkleTree.Low.index_t",
"Prims.b2t",
"MerkleTree.Low.add64_fits",
"FStar.UInt64.add",
"MerkleTree.Low.u32_64",
"MerkleTree.Low.offsets_connect"
] | [] | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | false | false | MerkleTree.Low.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 join_offset (tree: offset_t) (i: index_t{add64_fits tree i})
: Tot (r: offset_t{offsets_connect tree r}) | [] | MerkleTree.Low.join_offset | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "3b0f086655c145aa23f58a97259ebf4cf112a4a3",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | tree: MerkleTree.Low.offset_t -> i: MerkleTree.Low.index_t{MerkleTree.Low.add64_fits tree i}
-> r: MerkleTree.Low.offset_t{MerkleTree.Low.offsets_connect tree r} | {
"end_col": 25,
"end_line": 75,
"start_col": 2,
"start_line": 75
} |
Prims.Tot | val split_offset (tree: offset_t) (index: offset_t{offsets_connect tree index}) : Tot index_t | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | false | let split_offset (tree:offset_t) (index:offset_t{offsets_connect tree index}): Tot index_t =
[@inline_let] let diff = U64.sub_mod index tree in
assert (diff <= offset_range_limit);
Int.Cast.uint64_to_uint32 diff | val split_offset (tree: offset_t) (index: offset_t{offsets_connect tree index}) : Tot index_t
let split_offset (tree: offset_t) (index: offset_t{offsets_connect tree index}) : Tot index_t = | false | null | false | [@@ inline_let ]let diff = U64.sub_mod index tree in
assert (diff <= offset_range_limit);
Int.Cast.uint64_to_uint32 diff | {
"checked_file": "MerkleTree.Low.fst.checked",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"Lo... | [
"total"
] | [
"MerkleTree.Low.offset_t",
"Prims.b2t",
"MerkleTree.Low.offsets_connect",
"FStar.Int.Cast.uint64_to_uint32",
"Prims.unit",
"Prims._assert",
"FStar.Integers.op_Less_Equals",
"FStar.Integers.Unsigned",
"FStar.Integers.W64",
"MerkleTree.Low.offset_range_limit",
"FStar.UInt64.t",
"FStar.UInt64.sub... | [] | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | false | false | MerkleTree.Low.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 split_offset (tree: offset_t) (index: offset_t{offsets_connect tree index}) : Tot index_t | [] | MerkleTree.Low.split_offset | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "3b0f086655c145aa23f58a97259ebf4cf112a4a3",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} |
tree: MerkleTree.Low.offset_t ->
index: MerkleTree.Low.offset_t{MerkleTree.Low.offsets_connect tree index}
-> MerkleTree.Low.index_t | {
"end_col": 32,
"end_line": 68,
"start_col": 2,
"start_line": 66
} |
Prims.GTot | val phashes (h: HS.mem) (p: path_p) : GTot (V.vector (hash #(Path?.hash_size (B.get h p 0)))) | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | false | let phashes (h:HS.mem) (p:path_p)
: GTot (V.vector (hash #(Path?.hash_size (B.get h p 0))))
= Path?.hashes (B.get h p 0) | val phashes (h: HS.mem) (p: path_p) : GTot (V.vector (hash #(Path?.hash_size (B.get h p 0))))
let phashes (h: HS.mem) (p: path_p) : GTot (V.vector (hash #(Path?.hash_size (B.get h p 0)))) = | false | null | false | Path?.hashes (B.get h p 0) | {
"checked_file": "MerkleTree.Low.fst.checked",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"Lo... | [
"sometrivial"
] | [
"FStar.Monotonic.HyperStack.mem",
"MerkleTree.Low.path_p",
"MerkleTree.Low.__proj__Path__item__hashes",
"LowStar.Monotonic.Buffer.get",
"MerkleTree.Low.path",
"LowStar.Buffer.trivial_preorder",
"LowStar.Vector.vector",
"MerkleTree.Low.Datastructures.hash",
"MerkleTree.Low.__proj__Path__item__hash_si... | [] | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | false | false | MerkleTree.Low.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 phashes (h: HS.mem) (p: path_p) : GTot (V.vector (hash #(Path?.hash_size (B.get h p 0)))) | [] | MerkleTree.Low.phashes | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "3b0f086655c145aa23f58a97259ebf4cf112a4a3",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | h: FStar.Monotonic.HyperStack.mem -> p: MerkleTree.Low.path_p
-> Prims.GTot (LowStar.Vector.vector MerkleTree.Low.Datastructures.hash) | {
"end_col": 28,
"end_line": 1062,
"start_col": 2,
"start_line": 1062
} |
Prims.Tot | val mt_verify_pre_nst: mt:merkle_tree -> k:offset_t -> j:offset_t -> p:path -> rt:(hash #(MT?.hash_size mt)) -> Tot bool | [
{
"abbrev": false,
"full_module": "MerkleTree.Low.VectorExtras",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Hashfunctions",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.Low.Datastructures",
"short_module": null
},
... | false | let mt_verify_pre_nst mt k j p rt =
k < j &&
offsets_connect (MT?.offset mt) k &&
offsets_connect (MT?.offset mt) j &&
MT?.hash_size mt = Path?.hash_size p &&
([@inline_let] let k = split_offset (MT?.offset mt) k in
[@inline_let] let j = split_offset (MT?.offset mt) j in
// We need to add one since the ... | val mt_verify_pre_nst: mt:merkle_tree -> k:offset_t -> j:offset_t -> p:path -> rt:(hash #(MT?.hash_size mt)) -> Tot bool
let mt_verify_pre_nst mt k j p rt = | false | null | false | k < j && offsets_connect (MT?.offset mt) k && offsets_connect (MT?.offset mt) j &&
MT?.hash_size mt = Path?.hash_size p &&
([@@ inline_let ]let k = split_offset (MT?.offset mt) k in
[@@ inline_let ]let j = split_offset (MT?.offset mt) j in
V.size_of (Path?.hashes p) = 1ul + mt_path_length 0ul k j false) | {
"checked_file": "MerkleTree.Low.fst.checked",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.fst.checked",
"MerkleTree.Low.VectorExtras.fst.checked",
"MerkleTree.Low.Hashfunctions.fst.checked",
"MerkleTree.Low.Datastructures.fst.checked",
"Lo... | [
"total"
] | [
"MerkleTree.Low.merkle_tree",
"MerkleTree.Low.offset_t",
"MerkleTree.Low.path",
"MerkleTree.Low.Datastructures.hash",
"MerkleTree.Low.__proj__MT__item__hash_size",
"Prims.op_AmpAmp",
"FStar.Integers.op_Less",
"FStar.Integers.Unsigned",
"FStar.Integers.W64",
"MerkleTree.Low.offsets_connect",
"Mer... | [] | module MerkleTree.Low
open EverCrypt.Helpers
open FStar.All
open FStar.Integers
open FStar.Mul
open LowStar.Buffer
open LowStar.BufferOps
open LowStar.Vector
open LowStar.Regional
open LowStar.RVector
open LowStar.Regional.Instances
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module MHS = FStar.Mo... | false | false | MerkleTree.Low.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 mt_verify_pre_nst: mt:merkle_tree -> k:offset_t -> j:offset_t -> p:path -> rt:(hash #(MT?.hash_size mt)) -> Tot bool | [] | MerkleTree.Low.mt_verify_pre_nst | {
"file_name": "src/MerkleTree.Low.fst",
"git_rev": "3b0f086655c145aa23f58a97259ebf4cf112a4a3",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} |
mt: MerkleTree.Low.merkle_tree ->
k: MerkleTree.Low.offset_t ->
j: MerkleTree.Low.offset_t ->
p: MerkleTree.Low.path ->
rt: MerkleTree.Low.Datastructures.hash
-> Prims.bool | {
"end_col": 67,
"end_line": 2896,
"start_col": 2,
"start_line": 2889
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.