file_name stringlengths 5 52 | name stringlengths 4 95 | original_source_type stringlengths 0 23k | source_type stringlengths 9 23k | source_definition stringlengths 9 57.9k | source dict | source_range dict | file_context stringlengths 0 721k | dependencies dict | opens_and_abbrevs listlengths 2 94 | vconfig dict | interleaved bool 1
class | verbose_type stringlengths 1 7.42k | effect stringclasses 118
values | effect_flags listlengths 0 2 | mutual_with listlengths 0 11 | ideal_premises listlengths 0 236 | proof_features listlengths 0 1 | is_simple_lemma bool 2
classes | is_div bool 2
classes | is_proof bool 2
classes | is_simply_typed bool 2
classes | is_type bool 2
classes | partial_definition stringlengths 5 3.99k | completed_definiton stringlengths 1 1.63M | isa_cross_project_example bool 1
class |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Hacl.Spec.P256.Montgomery.fst | Hacl.Spec.P256.Montgomery.qmont_mul_lemma | val qmont_mul_lemma: a:S.qelem -> b:S.qelem ->
Lemma (S.qmul (from_qmont a) (from_qmont b) = from_qmont ((a * b * qmont_R_inv) % S.order)) | val qmont_mul_lemma: a:S.qelem -> b:S.qelem ->
Lemma (S.qmul (from_qmont a) (from_qmont b) = from_qmont ((a * b * qmont_R_inv) % S.order)) | let qmont_mul_lemma a b =
mont_mul_lemma_gen S.order qmont_R_inv a b | {
"file_name": "code/ecdsap256/Hacl.Spec.P256.Montgomery.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 44,
"end_line": 299,
"start_col": 0,
"start_line": 298
} | module Hacl.Spec.P256.Montgomery
open FStar.Mul
open Lib.IntTypes
module S = Spec.P256
module M = Lib.NatMod
module BD = Hacl.Spec.Bignum.Definitions
module SBM = Hacl.Spec.Bignum.Montgomery
module SBML = Hacl.Spec.Montgomery.Lemmas
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
/// Montgomery arithmetic for a b... | {
"checked_file": "/",
"dependencies": [
"Spec.P256.Lemmas.fsti.checked",
"Spec.P256.fst.checked",
"prims.fst.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Montgomery.fsti.checked",
"Hacl.Spec.Bignum.Def... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "SBML"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "SBM"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "BD"
},
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.P256.PointOps.qelem -> b: Spec.P256.PointOps.qelem
-> FStar.Pervasives.Lemma
(ensures
Spec.P256.PointOps.qmul (Hacl.Spec.P256.Montgomery.from_qmont a)
(Hacl.Spec.P256.Montgomery.from_qmont b) =
Hacl.Spec.P256.Montgomery.from_qmont ((a * b) * Hacl.Spec.P256.Montgomery.qmont_R_inv %
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Spec.P256.PointOps.qelem",
"Hacl.Spec.P256.Montgomery.mont_mul_lemma_gen",
"Spec.P256.PointOps.order",
"Hacl.Spec.P256.Montgomery.qmont_R_inv",
"Prims.unit"
] | [] | true | false | true | false | false | let qmont_mul_lemma a b =
| mont_mul_lemma_gen S.order qmont_R_inv a b | false |
MerkleTree.New.High.fst | MerkleTree.New.High.hash_init | val hash_init (#hsz: pos) : hash #hsz | val hash_init (#hsz: pos) : hash #hsz | let hash_init (#hsz:pos): hash #hsz =
Seq.create hsz (Lib.IntTypes.u8 0) | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 36,
"end_line": 24,
"start_col": 0,
"start_line": 23
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "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... | false | MerkleTree.New.High.hash | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.Seq.Base.create",
"Lib.IntTypes.uint8",
"Lib.IntTypes.u8",
"MerkleTree.New.High.hash"
] | [] | false | false | false | false | false | let hash_init (#hsz: pos) : hash #hsz =
| Seq.create hsz (Lib.IntTypes.u8 0) | false |
OneTimePad.fst | OneTimePad.nib | val nib : Type0 | let nib = bool * bool * bool * bool | {
"file_name": "examples/rel/OneTimePad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 35,
"end_line": 20,
"start_col": 0,
"start_line": 20
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"Bijection.fst.checked"
],
"interface_file": false,
"source_file": "OneTimePad.fst"
} | [
{
"abbrev": false,
"full_module": "Bijection",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 4,
"max_fuel": 0,
"max_ifuel": 4,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.Native.tuple4",
"Prims.bool"
] | [] | false | false | false | true | true | let nib =
| ((bool * bool) * bool) * bool | false | |
OneTimePad.fst | OneTimePad.xor_b | val xor_b : b1: Prims.bool -> b2: Prims.bool -> Prims.bool | let xor_b (b1:bool) (b2:bool) = b1 <> b2 | {
"file_name": "examples/rel/OneTimePad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 40,
"end_line": 21,
"start_col": 0,
"start_line": 21
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"Bijection.fst.checked"
],
"interface_file": false,
"source_file": "OneTimePad.fst"
} | [
{
"abbrev": false,
"full_module": "Bijection",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 4,
"max_fuel": 0,
"max_ifuel": 4,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | b1: Prims.bool -> b2: Prims.bool -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.bool",
"Prims.op_disEquality"
] | [] | false | false | false | true | false | let xor_b (b1 b2: bool) =
| b1 <> b2 | false | |
MerkleTree.New.High.fst | MerkleTree.New.High.seq_slice_more_equal | val seq_slice_more_equal:
#a:Type -> s1:S.seq a -> s2:S.seq a ->
n:nat -> m:nat{n <= m && m <= S.length s1 && m <= S.length s2} ->
k:nat{n <= k} -> l:nat{k <= l && l <= m} ->
Lemma (requires S.equal (S.slice s1 n m) (S.slice s2 n m))
(ensures S.equal (S.slice s1 k l) (S.slice s2 k l))
[SMTPat (... | val seq_slice_more_equal:
#a:Type -> s1:S.seq a -> s2:S.seq a ->
n:nat -> m:nat{n <= m && m <= S.length s1 && m <= S.length s2} ->
k:nat{n <= k} -> l:nat{k <= l && l <= m} ->
Lemma (requires S.equal (S.slice s1 n m) (S.slice s2 n m))
(ensures S.equal (S.slice s1 k l) (S.slice s2 k l))
[SMTPat (... | let seq_slice_more_equal #a s1 s2 n m k l =
slice_slice s1 n m (k - n) (l - n);
slice_slice s2 n m (k - n) (l - n) | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 36,
"end_line": 53,
"start_col": 8,
"start_line": 51
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "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... | false |
s1: FStar.Seq.Base.seq a ->
s2: FStar.Seq.Base.seq a ->
n: Prims.nat ->
m: Prims.nat{n <= m && m <= FStar.Seq.Base.length s1 && m <= FStar.Seq.Base.length s2} ->
k: Prims.nat{n <= k} ->
l: Prims.nat{k <= l && l <= m}
-> FStar.Pervasives.Lemma
(requires FStar.Seq.Base.equal (FStar.Seq.Ba... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Base.seq",
"Prims.nat",
"Prims.b2t",
"Prims.op_AmpAmp",
"Prims.op_LessThanOrEqual",
"FStar.Seq.Base.length",
"FStar.Seq.Properties.slice_slice",
"Prims.op_Subtraction",
"Prims.unit"
] | [] | true | false | true | false | false | let seq_slice_more_equal #a s1 s2 n m k l =
| slice_slice s1 n m (k - n) (l - n);
slice_slice s2 n m (k - n) (l - n) | false |
Hacl.Spec.P256.Montgomery.fst | Hacl.Spec.P256.Montgomery.qmont_add_lemma | val qmont_add_lemma: a:S.qelem -> b:S.qelem ->
Lemma (S.qadd (from_qmont a) (from_qmont b) = from_qmont ((a + b) % S.order)) | val qmont_add_lemma: a:S.qelem -> b:S.qelem ->
Lemma (S.qadd (from_qmont a) (from_qmont b) = from_qmont ((a + b) % S.order)) | let qmont_add_lemma a b =
mont_add_lemma_gen S.order qmont_R_inv a b | {
"file_name": "code/ecdsap256/Hacl.Spec.P256.Montgomery.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 44,
"end_line": 295,
"start_col": 0,
"start_line": 294
} | module Hacl.Spec.P256.Montgomery
open FStar.Mul
open Lib.IntTypes
module S = Spec.P256
module M = Lib.NatMod
module BD = Hacl.Spec.Bignum.Definitions
module SBM = Hacl.Spec.Bignum.Montgomery
module SBML = Hacl.Spec.Montgomery.Lemmas
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
/// Montgomery arithmetic for a b... | {
"checked_file": "/",
"dependencies": [
"Spec.P256.Lemmas.fsti.checked",
"Spec.P256.fst.checked",
"prims.fst.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Montgomery.fsti.checked",
"Hacl.Spec.Bignum.Def... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "SBML"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "SBM"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "BD"
},
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.P256.PointOps.qelem -> b: Spec.P256.PointOps.qelem
-> FStar.Pervasives.Lemma
(ensures
Spec.P256.PointOps.qadd (Hacl.Spec.P256.Montgomery.from_qmont a)
(Hacl.Spec.P256.Montgomery.from_qmont b) =
Hacl.Spec.P256.Montgomery.from_qmont ((a + b) % Spec.P256.PointOps.order)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Spec.P256.PointOps.qelem",
"Hacl.Spec.P256.Montgomery.mont_add_lemma_gen",
"Spec.P256.PointOps.order",
"Hacl.Spec.P256.Montgomery.qmont_R_inv",
"Prims.unit"
] | [] | true | false | true | false | false | let qmont_add_lemma a b =
| mont_add_lemma_gen S.order qmont_R_inv a b | false |
Hacl.Spec.P256.Montgomery.fst | Hacl.Spec.P256.Montgomery.lemma_to_from_qmont_id | val lemma_to_from_qmont_id: a:S.qelem -> Lemma (from_qmont (to_qmont a) == a) | val lemma_to_from_qmont_id: a:S.qelem -> Lemma (from_qmont (to_qmont a) == a) | let lemma_to_from_qmont_id a =
mul_qmont_R_and_R_inv_is_one ();
lemma_to_from_mont_id_gen S.order qmont_R qmont_R_inv a | {
"file_name": "code/ecdsap256/Hacl.Spec.P256.Montgomery.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 57,
"end_line": 285,
"start_col": 0,
"start_line": 283
} | module Hacl.Spec.P256.Montgomery
open FStar.Mul
open Lib.IntTypes
module S = Spec.P256
module M = Lib.NatMod
module BD = Hacl.Spec.Bignum.Definitions
module SBM = Hacl.Spec.Bignum.Montgomery
module SBML = Hacl.Spec.Montgomery.Lemmas
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
/// Montgomery arithmetic for a b... | {
"checked_file": "/",
"dependencies": [
"Spec.P256.Lemmas.fsti.checked",
"Spec.P256.fst.checked",
"prims.fst.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Montgomery.fsti.checked",
"Hacl.Spec.Bignum.Def... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "SBML"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "SBM"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "BD"
},
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.P256.PointOps.qelem
-> FStar.Pervasives.Lemma
(ensures Hacl.Spec.P256.Montgomery.from_qmont (Hacl.Spec.P256.Montgomery.to_qmont a) == a) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Spec.P256.PointOps.qelem",
"Hacl.Spec.P256.Montgomery.lemma_to_from_mont_id_gen",
"Spec.P256.PointOps.order",
"Hacl.Spec.P256.Montgomery.qmont_R",
"Hacl.Spec.P256.Montgomery.qmont_R_inv",
"Prims.unit",
"Hacl.Spec.P256.Montgomery.mul_qmont_R_and_R_inv_is_one"
] | [] | true | false | true | false | false | let lemma_to_from_qmont_id a =
| mul_qmont_R_and_R_inv_is_one ();
lemma_to_from_mont_id_gen S.order qmont_R qmont_R_inv a | false |
OneTimePad.fst | OneTimePad.xor | val xor : _: (((Prims.bool * Prims.bool) * Prims.bool) * Prims.bool) ->
_: (((Prims.bool * Prims.bool) * Prims.bool) * Prims.bool)
-> ((Prims.bool * Prims.bool) * Prims.bool) * Prims.bool | let xor (a, b, c, d) (w, x, y, z) = (a `xor_b` w, b `xor_b` x, c `xor_b` y, d `xor_b` z) | {
"file_name": "examples/rel/OneTimePad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 89,
"end_line": 22,
"start_col": 0,
"start_line": 22
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"Bijection.fst.checked"
],
"interface_file": false,
"source_file": "OneTimePad.fst"
} | [
{
"abbrev": false,
"full_module": "Bijection",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 4,
"max_fuel": 0,
"max_ifuel": 4,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
_: (((Prims.bool * Prims.bool) * Prims.bool) * Prims.bool) ->
_: (((Prims.bool * Prims.bool) * Prims.bool) * Prims.bool)
-> ((Prims.bool * Prims.bool) * Prims.bool) * Prims.bool | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.Native.tuple4",
"Prims.bool",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.Mktuple4",
"OneTimePad.xor_b"
] | [] | false | false | false | true | false | let xor (a, b, c, d) (w, x, y, z) =
| (a `xor_b` w, b `xor_b` x, c `xor_b` y, d `xor_b` z) | false | |
MerkleTree.New.High.fst | MerkleTree.New.High.path_insert | val path_insert: (#hsz:pos) -> p:path #hsz -> hp:hash #hsz -> GTot (path #hsz) | val path_insert: (#hsz:pos) -> p:path #hsz -> hp:hash #hsz -> GTot (path #hsz) | let path_insert #_ p hp = S.snoc p hp | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 37,
"end_line": 380,
"start_col": 0,
"start_line": 380
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: MerkleTree.New.High.path -> hp: MerkleTree.New.High.hash -> Prims.GTot MerkleTree.New.High.path | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.pos",
"MerkleTree.New.High.path",
"MerkleTree.New.High.hash",
"FStar.Seq.Properties.snoc"
] | [] | false | false | false | false | false | let path_insert #_ p hp =
| S.snoc p hp | false |
OneTimePad.fst | OneTimePad.bind | val bind (a b: Type) (x: random a) (f: (a -> random b)) : random b | val bind (a b: Type) (x: random a) (f: (a -> random b)) : random b | let bind (a b : Type) (x:random a) (f: a -> random b)
: random b
= fun store ->
let (z, n) = x store in
f z (n, snd store) | {
"file_name": "examples/rel/OneTimePad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 22,
"end_line": 36,
"start_col": 0,
"start_line": 32
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"Bijection.fst.checked"
],
"interface_file": false,
"source_file": "OneTimePad.fst"
} | [
{
"abbrev": false,
"full_module": "Bijection",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 4,
"max_fuel": 0,
"max_ifuel": 4,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Type -> b: Type -> x: OneTimePad.random a -> f: (_: a -> OneTimePad.random b)
-> OneTimePad.random b | Prims.Tot | [
"total"
] | [] | [
"OneTimePad.random",
"FStar.Pervasives.Native.tuple2",
"Prims.int",
"OneTimePad.nib",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.snd"
] | [] | false | false | false | true | false | let bind (a b: Type) (x: random a) (f: (a -> random b)) : random b =
| fun store ->
let z, n = x store in
f z (n, snd store) | false |
OneTimePad.fst | OneTimePad.return | val return (a: Type) (x: a) : random a | val return (a: Type) (x: a) : random a | let return (a:Type) (x:a) : random a = fun s -> (x, fst s) | {
"file_name": "examples/rel/OneTimePad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 31,
"start_col": 0,
"start_line": 31
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"Bijection.fst.checked"
],
"interface_file": false,
"source_file": "OneTimePad.fst"
} | [
{
"abbrev": false,
"full_module": "Bijection",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 4,
"max_fuel": 0,
"max_ifuel": 4,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Type -> x: a -> OneTimePad.random a | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.Native.tuple2",
"Prims.int",
"OneTimePad.nib",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.fst",
"OneTimePad.random"
] | [] | false | false | false | true | false | let return (a: Type) (x: a) : random a =
| fun s -> (x, fst s) | false |
OneTimePad.fst | OneTimePad.rand | val rand: Prims.unit -> random nib | val rand: Prims.unit -> random nib | let rand () : random nib = fun store ->
let n, tape = store in
tape n, n + 1 | {
"file_name": "examples/rel/OneTimePad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 15,
"end_line": 39,
"start_col": 0,
"start_line": 37
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"Bijection.fst.checked"
],
"interface_file": false,
"source_file": "OneTimePad.fst"
} | [
{
"abbrev": false,
"full_module": "Bijection",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 4,
"max_fuel": 0,
"max_ifuel": 4,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> OneTimePad.random OneTimePad.nib | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"FStar.Pervasives.Native.tuple2",
"Prims.int",
"OneTimePad.nib",
"FStar.Pervasives.Native.Mktuple2",
"Prims.op_Addition",
"OneTimePad.random"
] | [] | false | false | false | true | false | let rand () : random nib =
| fun store ->
let n, tape = store in
tape n, n + 1 | false |
OneTimePad.fst | OneTimePad.id_nib | val id_nib : x: OneTimePad.nib -> OneTimePad.nib | let id_nib (x:nib) = x | {
"file_name": "examples/rel/OneTimePad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 22,
"end_line": 60,
"start_col": 0,
"start_line": 60
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"Bijection.fst.checked"
],
"interface_file": false,
"source_file": "OneTimePad.fst"
} | [
{
"abbrev": false,
"full_module": "Bijection",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 4,
"max_fuel": 0,
"max_ifuel": 4,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: OneTimePad.nib -> OneTimePad.nib | Prims.Tot | [
"total"
] | [] | [
"OneTimePad.nib"
] | [] | false | false | false | true | false | let id_nib (x: nib) =
| x | false | |
MerkleTree.New.High.fst | MerkleTree.New.High.mt_wf_elts | val mt_wf_elts (#hsz:pos): merkle_tree #hsz -> GTot Type0 | val mt_wf_elts (#hsz:pos): merkle_tree #hsz -> GTot Type0 | let mt_wf_elts #_ (MT i j hs _ _ _ _) =
hs_wf_elts 0 hs i j | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 21,
"end_line": 136,
"start_col": 0,
"start_line": 135
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: MerkleTree.New.High.merkle_tree -> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.pos",
"MerkleTree.New.High.merkle_tree",
"Prims.nat",
"Prims.b2t",
"Prims.op_AmpAmp",
"Prims.op_LessThanOrEqual",
"Prims.op_LessThan",
"Prims.pow2",
"MerkleTree.New.High.hashess",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"MerkleTree.New.High.hashes",
"Prims.bool",
... | [] | false | false | false | false | true | let mt_wf_elts #_ (MT i j hs _ _ _ _) =
| hs_wf_elts 0 hs i j | false |
OneTimePad.fst | OneTimePad.xor_properties | val xor_properties : x: OneTimePad.nib -> y: OneTimePad.nib -> Prims.unit | let xor_properties (x:nib) (y:nib) =
assert (x `xor` y = y `xor` x);
assert (y `xor` (x `xor` y) = x);
assert (x `xor` (x `xor` y) = y);
assert ((x `xor` y) `xor` y = x) | {
"file_name": "examples/rel/OneTimePad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 27,
"start_col": 0,
"start_line": 23
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"Bijection.fst.checked"
],
"interface_file": false,
"source_file": "OneTimePad.fst"
} | [
{
"abbrev": false,
"full_module": "Bijection",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 4,
"max_fuel": 0,
"max_ifuel": 4,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: OneTimePad.nib -> y: OneTimePad.nib -> Prims.unit | Prims.Tot | [
"total"
] | [] | [
"OneTimePad.nib",
"Prims._assert",
"Prims.b2t",
"Prims.op_Equality",
"FStar.Pervasives.Native.tuple4",
"Prims.bool",
"OneTimePad.xor",
"Prims.unit"
] | [] | false | false | false | true | false | let xor_properties (x y: nib) =
| assert (x `xor` y = y `xor` x);
assert (y `xor` (x `xor` y) = x);
assert (x `xor` (x `xor` y) = y);
assert ((x `xor` y) `xor` y = x) | false | |
MerkleTree.New.High.fst | MerkleTree.New.High.offset_of | val offset_of: i:nat -> Tot nat | val offset_of: i:nat -> Tot nat | let offset_of i =
if i % 2 = 0 then i else i - 1 | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 32,
"end_line": 96,
"start_col": 0,
"start_line": 95
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "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... | false | i: Prims.nat -> Prims.nat | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Prims.bool",
"Prims.op_Subtraction"
] | [] | false | false | false | true | false | let offset_of i =
| if i % 2 = 0 then i else i - 1 | false |
LowStar.RVector.fst | LowStar.RVector.flush | val flush:
#a:Type0 -> #rst:Type -> #rg:regional rst a ->
rv:rvector rg -> i:uint32_t{i <= V.size_of rv} ->
HST.ST (rvector rg)
(requires (fun h0 -> rv_inv h0 rv))
(ensures (fun h0 frv h1 ->
V.size_of frv = V.size_of rv - i /\
V.frameOf rv = V.frameOf frv /\
modifies (loc_rvector rv) h0 ... | val flush:
#a:Type0 -> #rst:Type -> #rg:regional rst a ->
rv:rvector rg -> i:uint32_t{i <= V.size_of rv} ->
HST.ST (rvector rg)
(requires (fun h0 -> rv_inv h0 rv))
(ensures (fun h0 frv h1 ->
V.size_of frv = V.size_of rv - i /\
V.frameOf rv = V.frameOf frv /\
modifies (loc_rvector rv) h0 ... | let flush #a #rst #rg rv i =
let hh0 = HST.get () in
(if i = 0ul then () else free_elems rv (i - 1ul));
rv_loc_elems_included hh0 rv 0ul i;
let hh1 = HST.get () in
assert (modifies (rs_loc_elems rg (V.as_seq hh0 rv) 0 (U32.v i)) hh0 hh1);
let frv = V.flush rv (rg_dummy rg) i in
let hh2 = HST.get () in
... | {
"file_name": "ulib/LowStar.RVector.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 1079,
"start_col": 0,
"start_line": 1032
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Vector.fst.checked",
"LowStar.Regional.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasi... | [
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "LowStar.Vector",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | rv: LowStar.RVector.rvector rg -> i: LowStar.Vector.uint32_t{i <= LowStar.Vector.size_of rv}
-> FStar.HyperStack.ST.ST (LowStar.RVector.rvector rg) | FStar.HyperStack.ST.ST | [] | [] | [
"LowStar.Regional.regional",
"LowStar.RVector.rvector",
"LowStar.Vector.uint32_t",
"Prims.b2t",
"FStar.Integers.op_Less_Equals",
"FStar.Integers.Unsigned",
"FStar.Integers.W32",
"LowStar.Vector.size_of",
"Prims.unit",
"Prims._assert",
"FStar.Seq.Base.equal",
"LowStar.Regional.__proj__Rgl__item... | [] | false | true | false | false | false | let flush #a #rst #rg rv i =
| let hh0 = HST.get () in
(if i = 0ul then () else free_elems rv (i - 1ul));
rv_loc_elems_included hh0 rv 0ul i;
let hh1 = HST.get () in
assert (modifies (rs_loc_elems rg (V.as_seq hh0 rv) 0 (U32.v i)) hh0 hh1);
let frv = V.flush rv (rg_dummy rg) i in
let hh2 = HST.get () in
assert (modifies (loc_region_only false (V.fra... | false |
MerkleTree.New.High.fst | MerkleTree.New.High.mt_insert | val mt_insert:
#hsz:pos ->
mt:merkle_tree #hsz {mt_wf_elts mt /\ mt_not_full mt} -> v:hash #hsz ->
GTot (imt:merkle_tree #hsz{mt_wf_elts #hsz imt}) | val mt_insert:
#hsz:pos ->
mt:merkle_tree #hsz {mt_wf_elts mt /\ mt_not_full mt} -> v:hash #hsz ->
GTot (imt:merkle_tree #hsz{mt_wf_elts #hsz imt}) | let mt_insert #hsz mt v =
MT (MT?.i mt)
(MT?.j mt + 1)
(insert_ #_ #(MT?.hash_fun mt) 0 (MT?.i mt) (MT?.j mt) (MT?.hs mt) v)
false
(MT?.rhs mt)
(MT?.mroot mt)
(MT?.hash_fun mt) | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 22,
"end_line": 241,
"start_col": 0,
"start_line": 234
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
mt:
MerkleTree.New.High.merkle_tree
{MerkleTree.New.High.mt_wf_elts mt /\ MerkleTree.New.High.mt_not_full mt} ->
v: MerkleTree.New.High.hash
-> Prims.GTot (imt: MerkleTree.New.High.merkle_tree{MerkleTree.New.High.mt_wf_elts imt}) | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.pos",
"MerkleTree.New.High.merkle_tree",
"Prims.l_and",
"MerkleTree.New.High.mt_wf_elts",
"Prims.b2t",
"MerkleTree.New.High.mt_not_full",
"MerkleTree.New.High.hash",
"MerkleTree.New.High.MT",
"MerkleTree.New.High.__proj__MT__item__i",
"Prims.op_Addition",
"MerkleTree.New.High.__proj__MT__... | [] | false | false | false | false | false | let mt_insert #hsz mt v =
| MT (MT?.i mt)
(MT?.j mt + 1)
(insert_ #_ #(MT?.hash_fun mt) 0 (MT?.i mt) (MT?.j mt) (MT?.hs mt) v)
false
(MT?.rhs mt)
(MT?.mroot mt)
(MT?.hash_fun mt) | false |
MerkleTree.New.High.fst | MerkleTree.New.High.create_empty_mt | val create_empty_mt (#hsz:pos) (#f:MTS.hash_fun_t #hsz): unit -> GTot (mt:merkle_tree #hsz {mt_wf_elts #hsz mt}) | val create_empty_mt (#hsz:pos) (#f:MTS.hash_fun_t #hsz): unit -> GTot (mt:merkle_tree #hsz {mt_wf_elts #hsz mt}) | let create_empty_mt #hsz #f _ =
hs_wf_elts_empty #hsz 0;
MT 0 0 (S.create 32 S.empty) false (S.create 32 (hash_init #hsz)) (hash_init #hsz) f | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 86,
"end_line": 156,
"start_col": 0,
"start_line": 154
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> Prims.GTot (mt: MerkleTree.New.High.merkle_tree{MerkleTree.New.High.mt_wf_elts mt}) | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.pos",
"MerkleTree.Spec.hash_fun_t",
"Prims.unit",
"MerkleTree.New.High.MT",
"FStar.Seq.Base.create",
"MerkleTree.New.High.hashes",
"FStar.Seq.Base.empty",
"MerkleTree.New.High.hash",
"MerkleTree.New.High.hash_init",
"MerkleTree.New.High.hs_wf_elts_empty",
"MerkleTree.New.High.merkle_tree"... | [] | false | false | false | false | false | let create_empty_mt #hsz #f _ =
| hs_wf_elts_empty #hsz 0;
MT 0 0 (S.create 32 S.empty) false (S.create 32 (hash_init #hsz)) (hash_init #hsz) f | false |
MerkleTree.New.High.fst | MerkleTree.New.High.seq_slice_equal_index | val seq_slice_equal_index:
#a:Type -> s1:S.seq a -> s2:S.seq a ->
i:nat -> j:nat{i <= j && j <= S.length s1 && j <= S.length s2} ->
k:nat{i <= k && k < j} ->
Lemma (requires S.equal (S.slice s1 i j) (S.slice s2 i j))
(ensures S.index s1 k == S.index s2 k)
[SMTPat (S.equal (S.slice s1 i j) (S.sl... | val seq_slice_equal_index:
#a:Type -> s1:S.seq a -> s2:S.seq a ->
i:nat -> j:nat{i <= j && j <= S.length s1 && j <= S.length s2} ->
k:nat{i <= k && k < j} ->
Lemma (requires S.equal (S.slice s1 i j) (S.slice s2 i j))
(ensures S.index s1 k == S.index s2 k)
[SMTPat (S.equal (S.slice s1 i j) (S.sl... | let seq_slice_equal_index #a s1 s2 i j k =
assert (S.index (S.slice s1 i j) (k - i) == S.index (S.slice s2 i j) (k - i)) | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 79,
"end_line": 41,
"start_col": 0,
"start_line": 40
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "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... | false |
s1: FStar.Seq.Base.seq a ->
s2: FStar.Seq.Base.seq a ->
i: Prims.nat ->
j: Prims.nat{i <= j && j <= FStar.Seq.Base.length s1 && j <= FStar.Seq.Base.length s2} ->
k: Prims.nat{i <= k && k < j}
-> FStar.Pervasives.Lemma
(requires FStar.Seq.Base.equal (FStar.Seq.Base.slice s1 i j) (FStar.Seq.B... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Base.seq",
"Prims.nat",
"Prims.b2t",
"Prims.op_AmpAmp",
"Prims.op_LessThanOrEqual",
"FStar.Seq.Base.length",
"Prims.op_LessThan",
"Prims._assert",
"Prims.eq2",
"FStar.Seq.Base.index",
"FStar.Seq.Base.slice",
"Prims.op_Subtraction",
"Prims.unit"
] | [] | true | false | true | false | false | let seq_slice_equal_index #a s1 s2 i j k =
| assert (S.index (S.slice s1 i j) (k - i) == S.index (S.slice s2 i j) (k - i)) | false |
MerkleTree.New.High.fst | MerkleTree.New.High.hs_wf_elts | val hs_wf_elts:
#hsz:pos ->
lv:nat{lv <= 32} ->
hs:hashess #hsz {S.length hs = 32} ->
i:nat -> j:nat{j >= i} ->
GTot Type0 (decreases (32 - lv)) | val hs_wf_elts:
#hsz:pos ->
lv:nat{lv <= 32} ->
hs:hashess #hsz {S.length hs = 32} ->
i:nat -> j:nat{j >= i} ->
GTot Type0 (decreases (32 - lv)) | let rec hs_wf_elts #hsz lv hs i j =
if lv = 32 then true
else (let ofs = offset_of i in
S.length (S.index hs lv) == j - ofs /\
hs_wf_elts #hsz (lv + 1) hs (i / 2) (j / 2)) | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 51,
"end_line": 108,
"start_col": 0,
"start_line": 104
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "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... | false |
lv: Prims.nat{lv <= 32} ->
hs: MerkleTree.New.High.hashess{FStar.Seq.Base.length hs = 32} ->
i: Prims.nat ->
j: Prims.nat{j >= i}
-> Prims.GTot Type0 | Prims.GTot | [
"sometrivial",
""
] | [] | [
"Prims.pos",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"MerkleTree.New.High.hashess",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"MerkleTree.New.High.hashes",
"Prims.op_GreaterThanOrEqual",
"Prims.bool",
"Prims.l_and",
"Prims.eq2",
"MerkleTree.New.High.hash",
... | [
"recursion"
] | false | false | false | false | true | let rec hs_wf_elts #hsz lv hs i j =
| if lv = 32
then true
else
(let ofs = offset_of i in
S.length (S.index hs lv) == j - ofs /\ hs_wf_elts #hsz (lv + 1) hs (i / 2) (j / 2)) | false |
OneTimePad.fst | OneTimePad.related_tape | val related_tape : b: (_: Prims.int -> Bijection.bij) -> t_0: OneTimePad.tape -> t_1: OneTimePad.tape -> Prims.logical | let related_tape (b:int -> bij) (t_0 t_1:tape) = forall i. b i (t_0 i) = (t_1 i) | {
"file_name": "examples/rel/OneTimePad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 80,
"end_line": 59,
"start_col": 0,
"start_line": 59
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"Bijection.fst.checked"
],
"interface_file": false,
"source_file": "OneTimePad.fst"
} | [
{
"abbrev": false,
"full_module": "Bijection",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 4,
"max_fuel": 0,
"max_ifuel": 4,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | b: (_: Prims.int -> Bijection.bij) -> t_0: OneTimePad.tape -> t_1: OneTimePad.tape -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"Bijection.bij",
"OneTimePad.nib",
"OneTimePad.tape",
"Prims.l_Forall",
"Prims.b2t",
"Prims.op_Equality",
"Prims.logical"
] | [] | false | false | false | true | true | let related_tape (b: (int -> bij)) (t_0 t_1: tape) =
| forall i. b i (t_0 i) = (t_1 i) | false | |
MerkleTree.New.High.fst | MerkleTree.New.High.hs_wf_elts_equal | val hs_wf_elts_equal:
#hsz:pos ->
lv:nat{lv <= 32} ->
hs1:hashess #hsz {S.length hs1 = 32} ->
hs2:hashess #hsz {S.length hs2 = 32} ->
i:nat ->
j:nat{j >= i} ->
Lemma (requires hs_wf_elts lv hs1 i j /\
S.equal (S.slice hs1 lv 32) (S.slice hs2 lv 32))
(ensures hs_wf_elts lv hs2 i j)
(decreases (32 -... | val hs_wf_elts_equal:
#hsz:pos ->
lv:nat{lv <= 32} ->
hs1:hashess #hsz {S.length hs1 = 32} ->
hs2:hashess #hsz {S.length hs2 = 32} ->
i:nat ->
j:nat{j >= i} ->
Lemma (requires hs_wf_elts lv hs1 i j /\
S.equal (S.slice hs1 lv 32) (S.slice hs2 lv 32))
(ensures hs_wf_elts lv hs2 i j)
(decreases (32 -... | let rec hs_wf_elts_equal #hsz lv hs1 hs2 i j =
if lv = 32 then ()
else (S.slice_slice hs1 lv 32 1 (32 - lv);
S.slice_slice hs2 lv 32 1 (32 - lv);
assert (S.equal (S.slice hs1 (lv + 1) 32)
(S.slice hs2 (lv + 1) 32));
S.lemma_index_slice hs1 lv 32 0;
S.lemma_index_slice hs2 lv 32 ... | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 57,
"end_line": 132,
"start_col": 0,
"start_line": 123
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
lv: Prims.nat{lv <= 32} ->
hs1: MerkleTree.New.High.hashess{FStar.Seq.Base.length hs1 = 32} ->
hs2: MerkleTree.New.High.hashess{FStar.Seq.Base.length hs2 = 32} ->
i: Prims.nat ->
j: Prims.nat{j >= i}
-> FStar.Pervasives.Lemma
(requires
MerkleTree.New.High.hs_wf_elts lv hs1 i j /\
... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.pos",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"MerkleTree.New.High.hashess",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"MerkleTree.New.High.hashes",
"Prims.op_GreaterThanOrEqual",
"Prims.bool",
"MerkleTree.New.High.hs_wf_elts_equal",
"Prims.op_Addition",... | [
"recursion"
] | false | false | true | false | false | let rec hs_wf_elts_equal #hsz lv hs1 hs2 i j =
| if lv = 32
then ()
else
(S.slice_slice hs1 lv 32 1 (32 - lv);
S.slice_slice hs2 lv 32 1 (32 - lv);
assert (S.equal (S.slice hs1 (lv + 1) 32) (S.slice hs2 (lv + 1) 32));
S.lemma_index_slice hs1 lv 32 0;
S.lemma_index_slice hs2 lv 32 0;
assert (S.index hs1 lv == S.index hs2 lv);
hs_wf_elts_equal... | false |
MerkleTree.New.High.fst | MerkleTree.New.High.mt_create | val mt_create:
hsz:pos -> f:MTS.hash_fun_t #hsz ->
init:hash #hsz -> GTot (mt:merkle_tree{mt_wf_elts #hsz mt}) | val mt_create:
hsz:pos -> f:MTS.hash_fun_t #hsz ->
init:hash #hsz -> GTot (mt:merkle_tree{mt_wf_elts #hsz mt}) | let mt_create hsz f init =
mt_insert #_ (create_empty_mt #_ #f ()) init | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 46,
"end_line": 247,
"start_col": 0,
"start_line": 246
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | hsz: Prims.pos -> f: MerkleTree.Spec.hash_fun_t -> init: MerkleTree.New.High.hash
-> Prims.GTot (mt: MerkleTree.New.High.merkle_tree{MerkleTree.New.High.mt_wf_elts mt}) | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.pos",
"MerkleTree.Spec.hash_fun_t",
"MerkleTree.New.High.hash",
"MerkleTree.New.High.mt_insert",
"MerkleTree.New.High.create_empty_mt",
"MerkleTree.New.High.merkle_tree",
"MerkleTree.New.High.mt_wf_elts"
] | [] | false | false | false | false | false | let mt_create hsz f init =
| mt_insert #_ (create_empty_mt #_ #f ()) init | false |
Hacl.Spec.P256.Montgomery.fst | Hacl.Spec.P256.Montgomery.qmont_cancel_lemma1 | val qmont_cancel_lemma1: a:S.qelem -> b:S.qelem ->
Lemma ((a * qmont_R % S.order * b * qmont_R_inv) % S.order = a * b % S.order) | val qmont_cancel_lemma1: a:S.qelem -> b:S.qelem ->
Lemma ((a * qmont_R % S.order * b * qmont_R_inv) % S.order = a * b % S.order) | let qmont_cancel_lemma1 a b =
mul_qmont_R_and_R_inv_is_one ();
mont_cancel_lemma_gen S.order qmont_R qmont_R_inv a b | {
"file_name": "code/ecdsap256/Hacl.Spec.P256.Montgomery.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 55,
"end_line": 318,
"start_col": 0,
"start_line": 316
} | module Hacl.Spec.P256.Montgomery
open FStar.Mul
open Lib.IntTypes
module S = Spec.P256
module M = Lib.NatMod
module BD = Hacl.Spec.Bignum.Definitions
module SBM = Hacl.Spec.Bignum.Montgomery
module SBML = Hacl.Spec.Montgomery.Lemmas
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
/// Montgomery arithmetic for a b... | {
"checked_file": "/",
"dependencies": [
"Spec.P256.Lemmas.fsti.checked",
"Spec.P256.fst.checked",
"prims.fst.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Montgomery.fsti.checked",
"Hacl.Spec.Bignum.Def... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "SBML"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "SBM"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "BD"
},
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.P256.PointOps.qelem -> b: Spec.P256.PointOps.qelem
-> FStar.Pervasives.Lemma
(ensures
((a * Hacl.Spec.P256.Montgomery.qmont_R % Spec.P256.PointOps.order) * b) *
Hacl.Spec.P256.Montgomery.qmont_R_inv %
Spec.P256.PointOps.order =
a * b % Spec.P256.PointOps.order) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Spec.P256.PointOps.qelem",
"Hacl.Spec.P256.Montgomery.mont_cancel_lemma_gen",
"Spec.P256.PointOps.order",
"Hacl.Spec.P256.Montgomery.qmont_R",
"Hacl.Spec.P256.Montgomery.qmont_R_inv",
"Prims.unit",
"Hacl.Spec.P256.Montgomery.mul_qmont_R_and_R_inv_is_one"
] | [] | true | false | true | false | false | let qmont_cancel_lemma1 a b =
| mul_qmont_R_and_R_inv_is_one ();
mont_cancel_lemma_gen S.order qmont_R qmont_R_inv a b | false |
Hacl.Spec.P256.Montgomery.fst | Hacl.Spec.P256.Montgomery.qmont_inv_lemma | val qmont_inv_lemma: k:S.qelem ->
Lemma (S.qinv (from_qmont k) == to_qmont (S.qinv k)) | val qmont_inv_lemma: k:S.qelem ->
Lemma (S.qinv (from_qmont k) == to_qmont (S.qinv k)) | let qmont_inv_lemma k =
assert_norm (M.pow_mod_ #S.order qmont_R_inv (S.order - 2) == qmont_R % S.order);
M.pow_mod_def #S.order qmont_R_inv (S.order - 2);
assert (M.pow_mod #S.order qmont_R_inv (S.order - 2) == qmont_R % S.order);
lemma_mont_inv_gen S.order qmont_R qmont_R_inv k;
assert (M.pow_mod #S.order ... | {
"file_name": "code/ecdsap256/Hacl.Spec.P256.Montgomery.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 77,
"end_line": 310,
"start_col": 0,
"start_line": 302
} | module Hacl.Spec.P256.Montgomery
open FStar.Mul
open Lib.IntTypes
module S = Spec.P256
module M = Lib.NatMod
module BD = Hacl.Spec.Bignum.Definitions
module SBM = Hacl.Spec.Bignum.Montgomery
module SBML = Hacl.Spec.Montgomery.Lemmas
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
/// Montgomery arithmetic for a b... | {
"checked_file": "/",
"dependencies": [
"Spec.P256.Lemmas.fsti.checked",
"Spec.P256.fst.checked",
"prims.fst.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Montgomery.fsti.checked",
"Hacl.Spec.Bignum.Def... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "SBML"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "SBM"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "BD"
},
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | k: Spec.P256.PointOps.qelem
-> FStar.Pervasives.Lemma
(ensures
Spec.P256.PointOps.qinv (Hacl.Spec.P256.Montgomery.from_qmont k) ==
Hacl.Spec.P256.Montgomery.to_qmont (Spec.P256.PointOps.qinv k)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Spec.P256.PointOps.qelem",
"Prims._assert",
"Prims.eq2",
"Prims.int",
"Spec.P256.PointOps.qinv",
"Prims.op_Modulus",
"FStar.Mul.op_Star",
"Hacl.Spec.P256.Montgomery.qmont_R_inv",
"Spec.P256.PointOps.order",
"Hacl.Spec.P256.Montgomery.qmont_R",
"Prims.unit",
"Lib.NatMod.pow_mod",
"Prims.op_S... | [] | true | false | true | false | false | let qmont_inv_lemma k =
| assert_norm (M.pow_mod_ #S.order qmont_R_inv (S.order - 2) == qmont_R % S.order);
M.pow_mod_def #S.order qmont_R_inv (S.order - 2);
assert (M.pow_mod #S.order qmont_R_inv (S.order - 2) == qmont_R % S.order);
lemma_mont_inv_gen S.order qmont_R qmont_R_inv k;
assert (M.pow_mod #S.order (k * qmont_R_inv % S.order) (S.orde... | false |
MerkleTree.New.High.fst | MerkleTree.New.High.mt_get_root | val mt_get_root:
#hsz:pos ->
mt:merkle_tree #hsz {mt_wf_elts #hsz mt} -> drt:hash #hsz ->
GTot (merkle_tree #hsz * hash #hsz) | val mt_get_root:
#hsz:pos ->
mt:merkle_tree #hsz {mt_wf_elts #hsz mt} -> drt:hash #hsz ->
GTot (merkle_tree #hsz * hash #hsz) | let mt_get_root #hsz mt drt =
if MT?.rhs_ok mt then (mt, MT?.mroot mt)
else begin
let (nrhs, rt) = construct_rhs #_ #(MT?.hash_fun mt) 0 (MT?.hs mt) (MT?.rhs mt) (MT?.i mt) (MT?.j mt) drt false in
(MT (MT?.i mt) (MT?.j mt) (MT?.hs mt) true nrhs rt (MT?.hash_fun mt), rt)
end | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 5,
"end_line": 358,
"start_col": 0,
"start_line": 353
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
mt: MerkleTree.New.High.merkle_tree{MerkleTree.New.High.mt_wf_elts mt} ->
drt: MerkleTree.New.High.hash
-> Prims.GTot (MerkleTree.New.High.merkle_tree * MerkleTree.New.High.hash) | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.pos",
"MerkleTree.New.High.merkle_tree",
"MerkleTree.New.High.mt_wf_elts",
"MerkleTree.New.High.hash",
"MerkleTree.New.High.__proj__MT__item__rhs_ok",
"FStar.Pervasives.Native.Mktuple2",
"MerkleTree.New.High.__proj__MT__item__mroot",
"Prims.bool",
"MerkleTree.New.High.hashes",
"Prims.b2t",
... | [] | false | false | false | false | false | let mt_get_root #hsz mt drt =
| if MT?.rhs_ok mt
then (mt, MT?.mroot mt)
else
let nrhs, rt =
construct_rhs #_ #(MT?.hash_fun mt) 0 (MT?.hs mt) (MT?.rhs mt) (MT?.i mt) (MT?.j mt) drt false
in
(MT (MT?.i mt) (MT?.j mt) (MT?.hs mt) true nrhs rt (MT?.hash_fun mt), rt) | false |
MerkleTree.New.High.fst | MerkleTree.New.High.hs_wf_elts_empty | val hs_wf_elts_empty:
#hsz:pos ->
lv:nat{lv <= 32} ->
Lemma (requires True)
(ensures hs_wf_elts #hsz lv (S.create 32 S.empty) 0 0)
(decreases (32 - lv)) | val hs_wf_elts_empty:
#hsz:pos ->
lv:nat{lv <= 32} ->
Lemma (requires True)
(ensures hs_wf_elts #hsz lv (S.create 32 S.empty) 0 0)
(decreases (32 - lv)) | let rec hs_wf_elts_empty #hsz lv =
if lv = 32 then ()
else hs_wf_elts_empty #hsz (lv + 1) | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 37,
"end_line": 148,
"start_col": 0,
"start_line": 146
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | lv: Prims.nat{lv <= 32}
-> FStar.Pervasives.Lemma
(ensures MerkleTree.New.High.hs_wf_elts lv (FStar.Seq.Base.create 32 FStar.Seq.Base.empty) 0 0
) (decreases 32 - lv) | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.pos",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Equality",
"Prims.int",
"Prims.bool",
"MerkleTree.New.High.hs_wf_elts_empty",
"Prims.op_Addition",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec hs_wf_elts_empty #hsz lv =
| if lv = 32 then () else hs_wf_elts_empty #hsz (lv + 1) | false |
MerkleTree.New.High.fst | MerkleTree.New.High.mt_path_length_step | val mt_path_length_step:
k:nat -> j:nat{k <= j} -> actd:bool -> GTot nat | val mt_path_length_step:
k:nat -> j:nat{k <= j} -> actd:bool -> GTot nat | let mt_path_length_step k j actd =
if j = 0 then 0
else (if k % 2 = 0
then (if j = k || (j = k + 1 && not actd) then 0 else 1)
else 1) | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 14,
"end_line": 388,
"start_col": 0,
"start_line": 384
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | k: Prims.nat -> j: Prims.nat{k <= j} -> actd: Prims.bool -> Prims.GTot Prims.nat | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.bool",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Prims.op_BarBar",
"Prims.op_AmpAmp",
"Prims.op_Addition",
"Prims.op_Negation"
] | [] | false | false | false | false | false | let mt_path_length_step k j actd =
| if j = 0 then 0 else (if k % 2 = 0 then (if j = k || (j = k + 1 && not actd) then 0 else 1) else 1) | false |
MerkleTree.New.High.fst | MerkleTree.New.High.hashess_insert | val hashess_insert:
#hsz:pos ->
lv:nat{lv < 32} ->
i:nat ->
j:nat{i <= j /\ j < pow2 (32 - lv) - 1} ->
hs:hashess #hsz {S.length hs = 32 /\ hs_wf_elts lv hs i j} ->
v:hash #hsz ->
GTot (ihs:hashess #hsz {S.length ihs = 32 /\ hs_wf_elts (lv + 1) ihs (i / 2) (j / 2)}) | val hashess_insert:
#hsz:pos ->
lv:nat{lv < 32} ->
i:nat ->
j:nat{i <= j /\ j < pow2 (32 - lv) - 1} ->
hs:hashess #hsz {S.length hs = 32 /\ hs_wf_elts lv hs i j} ->
v:hash #hsz ->
GTot (ihs:hashess #hsz {S.length ihs = 32 /\ hs_wf_elts (lv + 1) ihs (i / 2) (j / 2)}) | let hashess_insert #hsz lv i j hs v =
let ihs = S.upd hs lv (S.snoc (S.index hs lv) v) in
hs_wf_elts_equal (lv + 1) hs ihs (i / 2) (j / 2);
ihs | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 5,
"end_line": 171,
"start_col": 0,
"start_line": 168
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
lv: Prims.nat{lv < 32} ->
i: Prims.nat ->
j: Prims.nat{i <= j /\ j < Prims.pow2 (32 - lv) - 1} ->
hs:
MerkleTree.New.High.hashess
{FStar.Seq.Base.length hs = 32 /\ MerkleTree.New.High.hs_wf_elts lv hs i j} ->
v: MerkleTree.New.High.hash
-> Prims.GTot
(ihs:
MerkleTree.New.H... | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.pos",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.l_and",
"Prims.op_LessThanOrEqual",
"Prims.op_Subtraction",
"Prims.pow2",
"MerkleTree.New.High.hashess",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"MerkleTree.New.High.hashes",
"MerkleTree.New.High.hs_wf_el... | [] | false | false | false | false | false | let hashess_insert #hsz lv i j hs v =
| let ihs = S.upd hs lv (S.snoc (S.index hs lv) v) in
hs_wf_elts_equal (lv + 1) hs ihs (i / 2) (j / 2);
ihs | false |
MerkleTree.New.High.fst | MerkleTree.New.High.mt_path_length | val mt_path_length:
k:nat -> j:nat{k <= j} -> actd:bool -> GTot nat | val mt_path_length:
k:nat -> j:nat{k <= j} -> actd:bool -> GTot nat | let rec mt_path_length k j actd =
if j = 0 then 0
else (let nactd = actd || (j % 2 = 1) in
mt_path_length_step k j actd +
mt_path_length (k / 2) (j / 2) nactd) | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 44,
"end_line": 396,
"start_col": 0,
"start_line": 392
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | k: Prims.nat -> j: Prims.nat{k <= j} -> actd: Prims.bool -> Prims.GTot Prims.nat | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.bool",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Addition",
"MerkleTree.New.High.mt_path_length_step",
"MerkleTree.New.High.mt_path_length",
"Prims.op_Division",
"Prims.op_BarBar",
"Prims.op_Modulus"
] | [
"recursion"
] | false | false | false | false | false | let rec mt_path_length k j actd =
| if j = 0
then 0
else
(let nactd = actd || (j % 2 = 1) in
mt_path_length_step k j actd + mt_path_length (k / 2) (j / 2) nactd) | false |
MerkleTree.New.High.fst | MerkleTree.New.High.mt_flush | val mt_flush:
#hsz:pos ->
mt:merkle_tree #hsz {mt_wf_elts mt /\ MT?.j mt > MT?.i mt} ->
GTot (fmt:merkle_tree{mt_wf_elts #hsz fmt}) | val mt_flush:
#hsz:pos ->
mt:merkle_tree #hsz {mt_wf_elts mt /\ MT?.j mt > MT?.i mt} ->
GTot (fmt:merkle_tree{mt_wf_elts #hsz fmt}) | let mt_flush #hsz mt =
mt_flush_to mt (MT?.j mt - 1) | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 31,
"end_line": 598,
"start_col": 0,
"start_line": 597
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | mt: MerkleTree.New.High.merkle_tree{MerkleTree.New.High.mt_wf_elts mt /\ MT?.j mt > MT?.i mt}
-> Prims.GTot (fmt: MerkleTree.New.High.merkle_tree{MerkleTree.New.High.mt_wf_elts fmt}) | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.pos",
"MerkleTree.New.High.merkle_tree",
"Prims.l_and",
"MerkleTree.New.High.mt_wf_elts",
"Prims.b2t",
"Prims.op_GreaterThan",
"MerkleTree.New.High.__proj__MT__item__j",
"MerkleTree.New.High.__proj__MT__item__i",
"MerkleTree.New.High.mt_flush_to",
"Prims.op_Subtraction"
] | [] | false | false | false | false | false | let mt_flush #hsz mt =
| mt_flush_to mt (MT?.j mt - 1) | false |
MerkleTree.New.High.fst | MerkleTree.New.High.mt_retract_to | val mt_retract_to:
#hsz:pos ->
mt:merkle_tree #hsz {mt_wf_elts mt} ->
r:nat{MT?.i mt <= r /\ r < MT?.j mt} ->
GTot (rmt:merkle_tree #hsz {mt_wf_elts rmt /\ MT?.i rmt = MT?.i mt /\ MT?.j rmt = r + 1}) | val mt_retract_to:
#hsz:pos ->
mt:merkle_tree #hsz {mt_wf_elts mt} ->
r:nat{MT?.i mt <= r /\ r < MT?.j mt} ->
GTot (rmt:merkle_tree #hsz {mt_wf_elts rmt /\ MT?.i rmt = MT?.i mt /\ MT?.j rmt = r + 1}) | let mt_retract_to #hsz mt r =
let nhs = mt_retract_to_ (MT?.hs mt) 0 (MT?.i mt) (r+1) (MT?.j mt) in
MT (MT?.i mt) (r+1) nhs false (MT?.rhs mt) (MT?.mroot mt) (MT?.hash_fun mt) | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 77,
"end_line": 645,
"start_col": 0,
"start_line": 643
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
mt: MerkleTree.New.High.merkle_tree{MerkleTree.New.High.mt_wf_elts mt} ->
r: Prims.nat{MT?.i mt <= r /\ r < MT?.j mt}
-> Prims.GTot
(rmt:
MerkleTree.New.High.merkle_tree
{MerkleTree.New.High.mt_wf_elts rmt /\ MT?.i rmt = MT?.i mt /\ MT?.j rmt = r + 1}) | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.pos",
"MerkleTree.New.High.merkle_tree",
"MerkleTree.New.High.mt_wf_elts",
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"MerkleTree.New.High.__proj__MT__item__i",
"Prims.op_LessThan",
"MerkleTree.New.High.__proj__MT__item__j",
"MerkleTree.New.High.MT",
"Prims.op_... | [] | false | false | false | false | false | let mt_retract_to #hsz mt r =
| let nhs = mt_retract_to_ (MT?.hs mt) 0 (MT?.i mt) (r + 1) (MT?.j mt) in
MT (MT?.i mt) (r + 1) nhs false (MT?.rhs mt) (MT?.mroot mt) (MT?.hash_fun mt) | false |
MerkleTree.New.High.fst | MerkleTree.New.High.mt_make_path_step | val mt_make_path_step:
#hsz:pos ->
lv:nat{lv <= 32} ->
hs:hashess #hsz {S.length hs = 32} ->
rhs:hashes #hsz {S.length rhs = 32} ->
i:nat ->
j:nat{
j <> 0 /\ i <= j /\ j < pow2 (32 - lv) /\
hs_wf_elts lv hs i j} ->
k:nat{i <= k && k <= j} ->
p:path #hsz ->
actd:bool ->
GTot (path #hsz) | val mt_make_path_step:
#hsz:pos ->
lv:nat{lv <= 32} ->
hs:hashess #hsz {S.length hs = 32} ->
rhs:hashes #hsz {S.length rhs = 32} ->
i:nat ->
j:nat{
j <> 0 /\ i <= j /\ j < pow2 (32 - lv) /\
hs_wf_elts lv hs i j} ->
k:nat{i <= k && k <= j} ->
p:path #hsz ->
actd:bool ->
GTot (path #hsz) | let mt_make_path_step #hsz lv hs rhs i j k p actd =
let ofs = offset_of i in
if k % 2 = 1
then path_insert p (S.index (S.index hs lv) (k - 1 - ofs))
else (if k = j then p
else if k + 1 = j
then (if actd
then path_insert p (S.index rhs lv)
else p)
else path_insert p (S.index (S.index hs lv... | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 64,
"end_line": 420,
"start_col": 0,
"start_line": 411
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
lv: Prims.nat{lv <= 32} ->
hs: MerkleTree.New.High.hashess{FStar.Seq.Base.length hs = 32} ->
rhs: MerkleTree.New.High.hashes{FStar.Seq.Base.length rhs = 32} ->
i: Prims.nat ->
j:
Prims.nat
{j <> 0 /\ i <= j /\ j < Prims.pow2 (32 - lv) /\ MerkleTree.New.High.hs_wf_elts lv hs i j} ->
... | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.pos",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"MerkleTree.New.High.hashess",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"MerkleTree.New.High.hashes",
"MerkleTree.New.High.hash",
"Prims.l_and",
"Prims.op_disEquality",
"Prims.op_LessThan",
"Prims.pow2",
... | [] | false | false | false | false | false | let mt_make_path_step #hsz lv hs rhs i j k p actd =
| let ofs = offset_of i in
if k % 2 = 1
then path_insert p (S.index (S.index hs lv) (k - 1 - ofs))
else
(if k = j
then p
else
if k + 1 = j
then (if actd then path_insert p (S.index rhs lv) else p)
else path_insert p (S.index (S.index hs lv) (k + 1 - ofs))) | false |
MerkleTree.New.High.fst | MerkleTree.New.High.construct_rhs | val construct_rhs:
#hsz:pos -> #f:MTS.hash_fun_t #hsz ->
lv:nat{lv <= 32} ->
hs:hashess #hsz {S.length hs = 32} ->
rhs:hashes #hsz {S.length rhs = 32} ->
i:nat ->
j:nat{
i <= j /\ j < pow2 (32 - lv) /\
hs_wf_elts #hsz lv hs i j} ->
acc:hash #hsz ->
actd:bool ->
GTot (crhs:hashes #hsz {S.length... | val construct_rhs:
#hsz:pos -> #f:MTS.hash_fun_t #hsz ->
lv:nat{lv <= 32} ->
hs:hashess #hsz {S.length hs = 32} ->
rhs:hashes #hsz {S.length rhs = 32} ->
i:nat ->
j:nat{
i <= j /\ j < pow2 (32 - lv) /\
hs_wf_elts #hsz lv hs i j} ->
acc:hash #hsz ->
actd:bool ->
GTot (crhs:hashes #hsz {S.length... | let rec construct_rhs #hsz #f lv hs rhs i j acc actd =
let ofs = offset_of i in
if j = 0 then (rhs, acc)
else
(if j % 2 = 0
then (construct_rhs #_ #f (lv + 1) hs rhs (i / 2) (j / 2) acc actd)
else (let nrhs = if actd then S.upd rhs lv acc else rhs in
let nacc = if actd
the... | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 73,
"end_line": 279,
"start_col": 0,
"start_line": 269
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
lv: Prims.nat{lv <= 32} ->
hs: MerkleTree.New.High.hashess{FStar.Seq.Base.length hs = 32} ->
rhs: MerkleTree.New.High.hashes{FStar.Seq.Base.length rhs = 32} ->
i: Prims.nat ->
j: Prims.nat{i <= j /\ j < Prims.pow2 (32 - lv) /\ MerkleTree.New.High.hs_wf_elts lv hs i j} ->
acc: MerkleTree.New.Hig... | Prims.GTot | [
"sometrivial",
""
] | [] | [
"Prims.pos",
"MerkleTree.Spec.hash_fun_t",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"MerkleTree.New.High.hashess",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"MerkleTree.New.High.hashes",
"MerkleTree.New.High.hash",
"Prims.l_and",
"Prims.op_LessThan",
"Prims.po... | [
"recursion"
] | false | false | false | false | false | let rec construct_rhs #hsz #f lv hs rhs i j acc actd =
| let ofs = offset_of i in
if j = 0
then (rhs, acc)
else
(if j % 2 = 0
then (construct_rhs #_ #f (lv + 1) hs rhs (i / 2) (j / 2) acc actd)
else
(let nrhs = if actd then S.upd rhs lv acc else rhs in
let nacc =
if actd
then f (S.index (S.index hs lv) (j - 1 - ofs)) acc
... | false |
MerkleTree.New.High.fst | MerkleTree.New.High.mt_flush_to | val mt_flush_to:
#hsz:pos ->
mt:merkle_tree #hsz {mt_wf_elts mt} ->
idx:nat{idx >= MT?.i mt /\ idx < MT?.j mt} ->
GTot (fmt:merkle_tree{mt_wf_elts #hsz fmt}) | val mt_flush_to:
#hsz:pos ->
mt:merkle_tree #hsz {mt_wf_elts mt} ->
idx:nat{idx >= MT?.i mt /\ idx < MT?.j mt} ->
GTot (fmt:merkle_tree{mt_wf_elts #hsz fmt}) | let mt_flush_to #hsz mt idx =
let fhs = mt_flush_to_ #hsz 0 (MT?.hs mt) (MT?.i mt) idx (MT?.j mt) in
MT idx (MT?.j mt) fhs (MT?.rhs_ok mt) (MT?.rhs mt) (MT?.mroot mt) (MT?.hash_fun mt) | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 85,
"end_line": 591,
"start_col": 0,
"start_line": 589
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
mt: MerkleTree.New.High.merkle_tree{MerkleTree.New.High.mt_wf_elts mt} ->
idx: Prims.nat{idx >= MT?.i mt /\ idx < MT?.j mt}
-> Prims.GTot (fmt: MerkleTree.New.High.merkle_tree{MerkleTree.New.High.mt_wf_elts fmt}) | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.pos",
"MerkleTree.New.High.merkle_tree",
"MerkleTree.New.High.mt_wf_elts",
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"MerkleTree.New.High.__proj__MT__item__i",
"Prims.op_LessThan",
"MerkleTree.New.High.__proj__MT__item__j",
"MerkleTree.New.High.MT",
"Merkle... | [] | false | false | false | false | false | let mt_flush_to #hsz mt idx =
| let fhs = mt_flush_to_ #hsz 0 (MT?.hs mt) (MT?.i mt) idx (MT?.j mt) in
MT idx (MT?.j mt) fhs (MT?.rhs_ok mt) (MT?.rhs mt) (MT?.mroot mt) (MT?.hash_fun mt) | false |
Hacl.K256.PrecompTable.fst | Hacl.K256.PrecompTable.precomp_g_pow2_64_table_w4 | val precomp_g_pow2_64_table_w4:
x:glbuffer uint64 240ul{witnessed x precomp_g_pow2_64_table_lseq_w4 /\ recallable x} | val precomp_g_pow2_64_table_w4:
x:glbuffer uint64 240ul{witnessed x precomp_g_pow2_64_table_lseq_w4 /\ recallable x} | let precomp_g_pow2_64_table_w4:
x:glbuffer uint64 240ul{witnessed x precomp_g_pow2_64_table_lseq_w4 /\ recallable x} =
createL_global precomp_g_pow2_64_table_list_w4 | {
"file_name": "code/k256/Hacl.K256.PrecompTable.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 48,
"end_line": 234,
"start_col": 0,
"start_line": 232
} | module Hacl.K256.PrecompTable
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module SPT = Hacl.Spec.PrecompBaseTable
module SPT256 = Hacl.Spec.Pr... | {
"checked_file": "/",
"dependencies": [
"Spec.K256.Lemmas.fsti.checked",
"Spec.K256.fst.checked",
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hac... | [
{
"abbrev": true,
"full_module": "Spec.K256.Lemmas",
"short_module": "SL"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.K256.PrecompTable",
"short_module": "SPTK"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.PrecompBaseTable256",
"short_module": "SPT256"
},
{
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x:
Lib.Buffer.glbuffer Lib.IntTypes.uint64 240ul
{ Lib.Buffer.witnessed x Hacl.K256.PrecompTable.precomp_g_pow2_64_table_lseq_w4 /\
Lib.Buffer.recallable x } | Prims.Tot | [
"total"
] | [] | [
"Lib.Buffer.createL_global",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U64",
"Lib.IntTypes.SEC",
"Hacl.K256.PrecompTable.precomp_g_pow2_64_table_list_w4",
"Lib.Buffer.glbuffer",
"Lib.IntTypes.size",
"FStar.Pervasives.normalize_term",
"Lib.IntTypes.size_nat",
"FStar.List.Tot.Base.length",
"Lib.IntTypes... | [] | false | false | false | false | false | let precomp_g_pow2_64_table_w4:x:
glbuffer uint64 240ul {witnessed x precomp_g_pow2_64_table_lseq_w4 /\ recallable x} =
| createL_global precomp_g_pow2_64_table_list_w4 | false |
MerkleTree.New.High.fst | MerkleTree.New.High.mt_get_path_ | val mt_get_path_:
#hsz:pos ->
lv:nat{lv <= 32} ->
hs:hashess #hsz {S.length hs = 32} ->
rhs:hashes #hsz {S.length rhs = 32} ->
i:nat ->
j:nat{
i <= j /\ j < pow2 (32 - lv) /\
hs_wf_elts lv hs i j} ->
k:nat{i <= k && k <= j} ->
p:path #hsz ->
actd:bool ->
GTot (np:path #hsz {S.length np = S.... | val mt_get_path_:
#hsz:pos ->
lv:nat{lv <= 32} ->
hs:hashess #hsz {S.length hs = 32} ->
rhs:hashes #hsz {S.length rhs = 32} ->
i:nat ->
j:nat{
i <= j /\ j < pow2 (32 - lv) /\
hs_wf_elts lv hs i j} ->
k:nat{i <= k && k <= j} ->
p:path #hsz ->
actd:bool ->
GTot (np:path #hsz {S.length np = S.... | let rec mt_get_path_ #hsz lv hs rhs i j k p actd =
let ofs = offset_of i in
if j = 0 then p
else
(let np = mt_make_path_step lv hs rhs i j k p actd in
mt_get_path_ (lv + 1) hs rhs (i / 2) (j / 2) (k / 2) np
(if j % 2 = 0 then actd else true)) | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 42,
"end_line": 444,
"start_col": 0,
"start_line": 438
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
lv: Prims.nat{lv <= 32} ->
hs: MerkleTree.New.High.hashess{FStar.Seq.Base.length hs = 32} ->
rhs: MerkleTree.New.High.hashes{FStar.Seq.Base.length rhs = 32} ->
i: Prims.nat ->
j: Prims.nat{i <= j /\ j < Prims.pow2 (32 - lv) /\ MerkleTree.New.High.hs_wf_elts lv hs i j} ->
k: Prims.nat{i <= k && ... | Prims.GTot | [
"sometrivial",
""
] | [] | [
"Prims.pos",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"MerkleTree.New.High.hashess",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"MerkleTree.New.High.hashes",
"MerkleTree.New.High.hash",
"Prims.l_and",
"Prims.op_LessThan",
"Prims.pow2",
"Prims.op_Subtraction",
... | [
"recursion"
] | false | false | false | false | false | let rec mt_get_path_ #hsz lv hs rhs i j k p actd =
| let ofs = offset_of i in
if j = 0
then p
else
(let np = mt_make_path_step lv hs rhs i j k p actd in
mt_get_path_ (lv + 1) hs rhs (i / 2) (j / 2) (k / 2) np (if j % 2 = 0 then actd else true)) | false |
MerkleTree.New.High.fst | MerkleTree.New.High.mt_verify | val mt_verify:
#hsz:pos -> #f:MTS.hash_fun_t #hsz ->
k:nat ->
j:nat{k < j} ->
p:path #hsz {S.length p = 1 + mt_path_length k j false} ->
rt:hash #hsz ->
GTot prop | val mt_verify:
#hsz:pos -> #f:MTS.hash_fun_t #hsz ->
k:nat ->
j:nat{k < j} ->
p:path #hsz {S.length p = 1 + mt_path_length k j false} ->
rt:hash #hsz ->
GTot prop | let mt_verify #_ #f k j p rt =
let crt = mt_verify_ #_ #f k j p 1 (S.index p 0) false in
crt == rt | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 11,
"end_line": 679,
"start_col": 0,
"start_line": 677
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
k: Prims.nat ->
j: Prims.nat{k < j} ->
p:
MerkleTree.New.High.path
{FStar.Seq.Base.length p = 1 + MerkleTree.New.High.mt_path_length k j false} ->
rt: MerkleTree.New.High.hash
-> Prims.GTot Prims.prop | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.pos",
"MerkleTree.Spec.hash_fun_t",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"MerkleTree.New.High.path",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"MerkleTree.New.High.hash",
"Prims.op_Addition",
"MerkleTree.New.High.mt_path_length",
"Prims.eq2",
"MerkleTree.N... | [] | false | false | false | false | true | let mt_verify #_ #f k j p rt =
| let crt = mt_verify_ #_ #f k j p 1 (S.index p 0) false in
crt == rt | false |
MerkleTree.New.High.fst | MerkleTree.New.High.mt_get_path | val mt_get_path:
#hsz:pos ->
mt:merkle_tree #hsz {mt_wf_elts mt} ->
idx:nat{MT?.i mt <= idx /\ idx < MT?.j mt} ->
drt:hash #hsz ->
GTot (nat *
(np:path #hsz {S.length np = 1 + mt_path_length idx (MT?.j mt) false}) *
hash #hsz) | val mt_get_path:
#hsz:pos ->
mt:merkle_tree #hsz {mt_wf_elts mt} ->
idx:nat{MT?.i mt <= idx /\ idx < MT?.j mt} ->
drt:hash #hsz ->
GTot (nat *
(np:path #hsz {S.length np = 1 + mt_path_length idx (MT?.j mt) false}) *
hash #hsz) | let mt_get_path #hsz mt idx drt =
let (umt, root) = mt_get_root mt drt in
let ofs = offset_of (MT?.i umt) in
let np = path_insert S.empty (S.index (S.index (MT?.hs umt) 0) (idx - ofs)) in
MT?.j umt,
mt_get_path_ 0 (MT?.hs umt) (MT?.rhs umt)
(MT?.i umt) (MT?.j umt) idx np false,
root | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 6,
"end_line": 536,
"start_col": 0,
"start_line": 529
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
mt: MerkleTree.New.High.merkle_tree{MerkleTree.New.High.mt_wf_elts mt} ->
idx: Prims.nat{MT?.i mt <= idx /\ idx < MT?.j mt} ->
drt: MerkleTree.New.High.hash
-> Prims.GTot
((Prims.nat *
np:
MerkleTree.New.High.path
{FStar.Seq.Base.length np = 1 + MerkleTree.New.High.mt_path_length ... | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.pos",
"MerkleTree.New.High.merkle_tree",
"MerkleTree.New.High.mt_wf_elts",
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"MerkleTree.New.High.__proj__MT__item__i",
"Prims.op_LessThan",
"MerkleTree.New.High.__proj__MT__item__j",
"MerkleTree.New.High.hash",
"FStar.P... | [] | false | false | false | false | false | let mt_get_path #hsz mt idx drt =
| let umt, root = mt_get_root mt drt in
let ofs = offset_of (MT?.i umt) in
let np = path_insert S.empty (S.index (S.index (MT?.hs umt) 0) (idx - ofs)) in
MT?.j umt, mt_get_path_ 0 (MT?.hs umt) (MT?.rhs umt) (MT?.i umt) (MT?.j umt) idx np false, root | false |
MerkleTree.New.High.fst | MerkleTree.New.High.mt_flush_to_ | val mt_flush_to_:
#hsz:pos ->
lv:nat{lv < 32} ->
hs:hashess #hsz {S.length hs = 32} ->
pi:nat ->
i:nat{i >= pi} ->
j:nat{
j >= i /\ j < pow2 (32 - lv) /\
hs_wf_elts #hsz lv hs pi j} ->
GTot (fhs:hashess{
S.length fhs = 32 /\
S.equal (S.slice hs 0 lv) (S.slice fhs 0 lv) /\
... | val mt_flush_to_:
#hsz:pos ->
lv:nat{lv < 32} ->
hs:hashess #hsz {S.length hs = 32} ->
pi:nat ->
i:nat{i >= pi} ->
j:nat{
j >= i /\ j < pow2 (32 - lv) /\
hs_wf_elts #hsz lv hs pi j} ->
GTot (fhs:hashess{
S.length fhs = 32 /\
S.equal (S.slice hs 0 lv) (S.slice fhs 0 lv) /\
... | let rec mt_flush_to_ #hsz lv hs pi i j =
let oi = offset_of i in
let opi = offset_of pi in
if oi = opi then hs
else (let ofs = oi - opi in
let hvec = S.index hs lv in
let flushed = S.slice hvec ofs (S.length hvec) in
let nhs = S.upd hs lv flushed in
hs_wf_elts_equal (lv + 1) hs nhs (... | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 58,
"end_line": 563,
"start_col": 0,
"start_line": 554
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
lv: Prims.nat{lv < 32} ->
hs: MerkleTree.New.High.hashess{FStar.Seq.Base.length hs = 32} ->
pi: Prims.nat ->
i: Prims.nat{i >= pi} ->
j: Prims.nat{j >= i /\ j < Prims.pow2 (32 - lv) /\ MerkleTree.New.High.hs_wf_elts lv hs pi j}
-> Prims.GTot
(fhs:
MerkleTree.New.High.hashess
{ F... | Prims.GTot | [
"sometrivial",
""
] | [] | [
"Prims.pos",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"MerkleTree.New.High.hashess",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"MerkleTree.New.High.hashes",
"Prims.op_GreaterThanOrEqual",
"Prims.l_and",
"Prims.pow2",
"Prims.op_Subtraction",
"MerkleTree.New.High.hs_wf... | [
"recursion"
] | false | false | false | false | false | let rec mt_flush_to_ #hsz lv hs pi i j =
| let oi = offset_of i in
let opi = offset_of pi in
if oi = opi
then hs
else
(let ofs = oi - opi in
let hvec = S.index hs lv in
let flushed = S.slice hvec ofs (S.length hvec) in
let nhs = S.upd hs lv flushed in
hs_wf_elts_equal (lv + 1) hs nhs (pi / 2) (j / 2);
mt_flush_to_ (lv + 1) nhs (pi / 2) (i ... | false |
MerkleTree.New.High.fst | MerkleTree.New.High.mt_get_path_slice | val mt_get_path_slice:
#hsz:pos ->
lv:nat{lv <= 32} ->
hs:hashess #hsz {S.length hs = 32} ->
rhs:hashes #hsz {S.length rhs = 32} ->
i:nat ->
j:nat{
i <= j /\ j < pow2 (32 - lv) /\
hs_wf_elts lv hs i j} ->
k:nat{i <= k && k <= j} ->
p:path #hsz ->
actd:bool ->
Lemma (requires True)
(... | val mt_get_path_slice:
#hsz:pos ->
lv:nat{lv <= 32} ->
hs:hashess #hsz {S.length hs = 32} ->
rhs:hashes #hsz {S.length rhs = 32} ->
i:nat ->
j:nat{
i <= j /\ j < pow2 (32 - lv) /\
hs_wf_elts lv hs i j} ->
k:nat{i <= k && k <= j} ->
p:path #hsz ->
actd:bool ->
Lemma (requires True)
(... | let mt_get_path_slice #hsz lv hs rhs i j k p actd =
mt_get_path_pull lv hs rhs i j k p actd | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 41,
"end_line": 519,
"start_col": 0,
"start_line": 518
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
lv: Prims.nat{lv <= 32} ->
hs: MerkleTree.New.High.hashess{FStar.Seq.Base.length hs = 32} ->
rhs: MerkleTree.New.High.hashes{FStar.Seq.Base.length rhs = 32} ->
i: Prims.nat ->
j: Prims.nat{i <= j /\ j < Prims.pow2 (32 - lv) /\ MerkleTree.New.High.hs_wf_elts lv hs i j} ->
k: Prims.nat{i <= k && ... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.pos",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"MerkleTree.New.High.hashess",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"MerkleTree.New.High.hashes",
"MerkleTree.New.High.hash",
"Prims.l_and",
"Prims.op_LessThan",
"Prims.pow2",
"Prims.op_Subtraction",
... | [] | true | false | true | false | false | let mt_get_path_slice #hsz lv hs rhs i j k p actd =
| mt_get_path_pull lv hs rhs i j k p actd | false |
MerkleTree.New.High.fst | MerkleTree.New.High.mt_verify_ | val mt_verify_:
#hsz:pos -> #f:MTS.hash_fun_t #hsz ->
k:nat ->
j:nat{k <= j} ->
p:path #hsz ->
ppos:nat ->
acc:hash #hsz ->
actd:bool{ppos + mt_path_length k j actd <= S.length p} ->
GTot (hash #hsz) | val mt_verify_:
#hsz:pos -> #f:MTS.hash_fun_t #hsz ->
k:nat ->
j:nat{k <= j} ->
p:path #hsz ->
ppos:nat ->
acc:hash #hsz ->
actd:bool{ppos + mt_path_length k j actd <= S.length p} ->
GTot (hash #hsz) | let rec mt_verify_ #hsz #f k j p ppos acc actd =
if j = 0 then acc
else (let nactd = actd || (j % 2 = 1) in
if k % 2 = 0
then (if j = k || (j = k + 1 && not actd)
then mt_verify_ #_ #f (k / 2) (j / 2) p ppos acc nactd
else (let nacc = f acc (S.index p ppos) in
mt_verify_ #_ #f (k / 2) (j ... | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 63,
"end_line": 668,
"start_col": 0,
"start_line": 659
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
k: Prims.nat ->
j: Prims.nat{k <= j} ->
p: MerkleTree.New.High.path ->
ppos: Prims.nat ->
acc: MerkleTree.New.High.hash ->
actd: Prims.bool{ppos + MerkleTree.New.High.mt_path_length k j actd <= FStar.Seq.Base.length p}
-> Prims.GTot MerkleTree.New.High.hash | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.pos",
"MerkleTree.Spec.hash_fun_t",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"MerkleTree.New.High.path",
"MerkleTree.New.High.hash",
"Prims.bool",
"Prims.op_Addition",
"MerkleTree.New.High.mt_path_length",
"FStar.Seq.Base.length",
"Prims.op_Equality",
"Prims.int",
"Prim... | [
"recursion"
] | false | false | false | false | false | let rec mt_verify_ #hsz #f k j p ppos acc actd =
| if j = 0
then acc
else
(let nactd = actd || (j % 2 = 1) in
if k % 2 = 0
then
(if j = k || (j = k + 1 && not actd)
then mt_verify_ #_ #f (k / 2) (j / 2) p ppos acc nactd
else
(let nacc = f acc (S.index p ppos) in
mt_verify_ #_ #f (k / 2) (j / 2) p (ppos + 1) nacc nac... | false |
MerkleTree.New.High.fst | MerkleTree.New.High.insert_ | val insert_:
#hsz:pos -> #f:MTS.hash_fun_t #hsz ->
lv:nat{lv < 32} ->
i:nat ->
j:nat{i <= j /\ j < pow2 (32 - lv) - 1} ->
hs:hashess #hsz {S.length hs = 32 /\ hs_wf_elts lv hs i j} ->
acc:hash #hsz ->
GTot (ihs:hashess #hsz {
S.length ihs = 32 /\
hs_wf_elts #hsz lv ihs i (j + 1) /\
... | val insert_:
#hsz:pos -> #f:MTS.hash_fun_t #hsz ->
lv:nat{lv < 32} ->
i:nat ->
j:nat{i <= j /\ j < pow2 (32 - lv) - 1} ->
hs:hashess #hsz {S.length hs = 32 /\ hs_wf_elts lv hs i j} ->
acc:hash #hsz ->
GTot (ihs:hashess #hsz {
S.length ihs = 32 /\
hs_wf_elts #hsz lv ihs i (j + 1) /\
... | let rec insert_ #hsz #f lv i j hs acc =
let ihs = hashess_insert #hsz lv i j hs acc in
assert (S.equal (S.slice hs 0 lv) (S.slice ihs 0 lv));
if j % 2 = 1 // S.length (S.index hs lv) > 0
then begin
remainder_2_1_div j;
let nacc = f (S.last (S.index hs lv)) acc in
let rihs = insert_ #hsz #f (lv + 1) ... | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 10,
"end_line": 201,
"start_col": 0,
"start_line": 185
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
lv: Prims.nat{lv < 32} ->
i: Prims.nat ->
j: Prims.nat{i <= j /\ j < Prims.pow2 (32 - lv) - 1} ->
hs:
MerkleTree.New.High.hashess
{FStar.Seq.Base.length hs = 32 /\ MerkleTree.New.High.hs_wf_elts lv hs i j} ->
acc: MerkleTree.New.High.hash
-> Prims.GTot
(ihs:
MerkleTree.New... | Prims.GTot | [
"sometrivial",
""
] | [] | [
"Prims.pos",
"MerkleTree.Spec.hash_fun_t",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.l_and",
"Prims.op_LessThanOrEqual",
"Prims.op_Subtraction",
"Prims.pow2",
"MerkleTree.New.High.hashess",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"MerkleTree.New.High.hashes",... | [
"recursion"
] | false | false | false | false | false | let rec insert_ #hsz #f lv i j hs acc =
| let ihs = hashess_insert #hsz lv i j hs acc in
assert (S.equal (S.slice hs 0 lv) (S.slice ihs 0 lv));
if j % 2 = 1
then
(remainder_2_1_div j;
let nacc = f (S.last (S.index hs lv)) acc in
let rihs = insert_ #hsz #f (lv + 1) (i / 2) (j / 2) ihs nacc in
assert (hs_wf_elts #hsz (lv + 1) rihs (i / 2) (j / 2 + ... | false |
MerkleTree.New.High.fst | MerkleTree.New.High.mt_retract_to_ | val mt_retract_to_:
#hsz:pos ->
hs:hashess #hsz {S.length hs = 32} ->
lv:nat{lv < S.length hs} ->
i:nat ->
s:nat -> // s is the first index excluded from nhs
j:nat{ i <= s /\ s <= j /\
j < pow2 (S.length hs - lv) /\
hs_wf_elts lv hs i j} ->
GTot (nhs:hashess #hsz {
S.length nhs... | val mt_retract_to_:
#hsz:pos ->
hs:hashess #hsz {S.length hs = 32} ->
lv:nat{lv < S.length hs} ->
i:nat ->
s:nat -> // s is the first index excluded from nhs
j:nat{ i <= s /\ s <= j /\
j < pow2 (S.length hs - lv) /\
hs_wf_elts lv hs i j} ->
GTot (nhs:hashess #hsz {
S.length nhs... | let rec mt_retract_to_ #hsz hs lv i s j =
if lv >= S.length hs then hs
else begin
let hvec = S.index hs lv in
let old_len = j - offset_of i in
let new_len = s - offset_of i in
assert (S.length hvec = old_len);
assert (new_len <= old_len);
assert (new_len <= S.length hvec);
let retracted ... | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 5,
"end_line": 634,
"start_col": 0,
"start_line": 618
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"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... | false |
hs: MerkleTree.New.High.hashess{FStar.Seq.Base.length hs = 32} ->
lv: Prims.nat{lv < FStar.Seq.Base.length hs} ->
i: Prims.nat ->
s: Prims.nat ->
j:
Prims.nat
{ i <= s /\ s <= j /\ j < Prims.pow2 (FStar.Seq.Base.length hs - lv) /\
MerkleTree.New.High.hs_wf_elts lv hs i j }
... | Prims.GTot | [
"sometrivial",
""
] | [] | [
"Prims.pos",
"MerkleTree.New.High.hashess",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"MerkleTree.New.High.hashes",
"Prims.nat",
"Prims.op_LessThan",
"Prims.l_and",
"Prims.op_LessThanOrEqual",
"Prims.pow2",
"Prims.op_Subtraction",
"MerkleTree.New.High.hs_wf_el... | [
"recursion"
] | false | false | false | false | false | let rec mt_retract_to_ #hsz hs lv i s j =
| if lv >= S.length hs
then hs
else
let hvec = S.index hs lv in
let old_len = j - offset_of i in
let new_len = s - offset_of i in
assert (S.length hvec = old_len);
assert (new_len <= old_len);
assert (new_len <= S.length hvec);
let retracted = S.slice hvec 0 new_len in
let nhs = S.upd hs lv retracted in
... | false |
MerkleTree.New.High.fst | MerkleTree.New.High.construct_rhs_unchanged | val construct_rhs_unchanged:
#hsz:pos -> #f:MTS.hash_fun_t #hsz ->
lv:nat{lv <= 32} ->
hs:hashess #hsz {S.length hs = 32} ->
rhs:hashes #hsz {S.length rhs = 32} ->
i:nat ->
j:nat{
i <= j /\ j < pow2 (32 - lv) /\
hs_wf_elts #hsz lv hs i j} ->
acc:hash #hsz ->
actd:bool ->
Lemma (requires True)
... | val construct_rhs_unchanged:
#hsz:pos -> #f:MTS.hash_fun_t #hsz ->
lv:nat{lv <= 32} ->
hs:hashess #hsz {S.length hs = 32} ->
rhs:hashes #hsz {S.length rhs = 32} ->
i:nat ->
j:nat{
i <= j /\ j < pow2 (32 - lv) /\
hs_wf_elts #hsz lv hs i j} ->
acc:hash #hsz ->
actd:bool ->
Lemma (requires True)
... | let rec construct_rhs_unchanged #hsz #f lv hs rhs i j acc actd =
let ofs = offset_of i in
if j = 0 then ()
else if j % 2 = 0
then (construct_rhs_unchanged #_ #f (lv + 1) hs rhs (i / 2) (j / 2) acc actd;
let rrhs = fst (construct_rhs #_ #f (lv + 1) hs rhs (i / 2) (j / 2) acc actd) in
assert (S.equa... | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 63,
"end_line": 310,
"start_col": 0,
"start_line": 296
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
lv: Prims.nat{lv <= 32} ->
hs: MerkleTree.New.High.hashess{FStar.Seq.Base.length hs = 32} ->
rhs: MerkleTree.New.High.hashes{FStar.Seq.Base.length rhs = 32} ->
i: Prims.nat ->
j: Prims.nat{i <= j /\ j < Prims.pow2 (32 - lv) /\ MerkleTree.New.High.hs_wf_elts lv hs i j} ->
acc: MerkleTree.New.Hig... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.pos",
"MerkleTree.Spec.hash_fun_t",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"MerkleTree.New.High.hashess",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"MerkleTree.New.High.hashes",
"MerkleTree.New.High.hash",
"Prims.l_and",
"Prims.op_LessThan",
"Prims.po... | [
"recursion"
] | false | false | true | false | false | let rec construct_rhs_unchanged #hsz #f lv hs rhs i j acc actd =
| let ofs = offset_of i in
if j = 0
then ()
else
if j % 2 = 0
then
(construct_rhs_unchanged #_ #f (lv + 1) hs rhs (i / 2) (j / 2) acc actd;
let rrhs = fst (construct_rhs #_ #f (lv + 1) hs rhs (i / 2) (j / 2) acc actd) in
assert (S.equal (S.slice rhs 0 lv) (S.slice rrhs 0 lv)))
else
(let nrhs = i... | false |
MerkleTree.New.High.fst | MerkleTree.New.High.mt_get_path_pull | val mt_get_path_pull:
#hsz:pos ->
lv:nat{lv <= 32} ->
hs:hashess #hsz {S.length hs = 32} ->
rhs:hashes #hsz {S.length rhs = 32} ->
i:nat ->
j:nat{
i <= j /\ j < pow2 (32 - lv) /\
hs_wf_elts lv hs i j} ->
k:nat{i <= k && k <= j} ->
p:path #hsz ->
actd:bool ->
Lemma (requires True)
(e... | val mt_get_path_pull:
#hsz:pos ->
lv:nat{lv <= 32} ->
hs:hashess #hsz {S.length hs = 32} ->
rhs:hashes #hsz {S.length rhs = 32} ->
i:nat ->
j:nat{
i <= j /\ j < pow2 (32 - lv) /\
hs_wf_elts lv hs i j} ->
k:nat{i <= k && k <= j} ->
p:path #hsz ->
actd:bool ->
Lemma (requires True)
(e... | let rec mt_get_path_pull #hsz lv hs rhs i j k p actd =
let ofs = offset_of i in
if j = 0 then ()
else
(let np = mt_make_path_step lv hs rhs i j k p actd in
let nactd = if j % 2 = 0 then actd else true in
mt_get_path_pull (lv + 1) hs rhs (i / 2) (j / 2) (k / 2) np nactd;
mt_get_path_pull (lv + 1) h... | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 61,
"end_line": 497,
"start_col": 0,
"start_line": 489
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
lv: Prims.nat{lv <= 32} ->
hs: MerkleTree.New.High.hashess{FStar.Seq.Base.length hs = 32} ->
rhs: MerkleTree.New.High.hashes{FStar.Seq.Base.length rhs = 32} ->
i: Prims.nat ->
j: Prims.nat{i <= j /\ j < Prims.pow2 (32 - lv) /\ MerkleTree.New.High.hs_wf_elts lv hs i j} ->
k: Prims.nat{i <= k && ... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.pos",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"MerkleTree.New.High.hashess",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"MerkleTree.New.High.hashes",
"MerkleTree.New.High.hash",
"Prims.l_and",
"Prims.op_LessThan",
"Prims.pow2",
"Prims.op_Subtraction",
... | [
"recursion"
] | false | false | true | false | false | let rec mt_get_path_pull #hsz lv hs rhs i j k p actd =
| let ofs = offset_of i in
if j = 0
then ()
else
(let np = mt_make_path_step lv hs rhs i j k p actd in
let nactd = if j % 2 = 0 then actd else true in
mt_get_path_pull (lv + 1) hs rhs (i / 2) (j / 2) (k / 2) np nactd;
mt_get_path_pull (lv + 1)
hs
rhs
(i / 2)
(j / 2)
(k / 2)
... | false |
MerkleTree.New.High.fst | MerkleTree.New.High.mt_get_path_unchanged | val mt_get_path_unchanged:
#hsz:pos ->
lv:nat{lv <= 32} ->
hs:hashess #hsz {S.length hs = 32} ->
rhs:hashes #hsz {S.length rhs = 32} ->
i:nat ->
j:nat{
i <= j /\ j < pow2 (32 - lv) /\
hs_wf_elts #hsz lv hs i j} ->
k:nat{i <= k && k <= j} ->
p:path #hsz ->
actd:bool ->
Lemma (requires True)
... | val mt_get_path_unchanged:
#hsz:pos ->
lv:nat{lv <= 32} ->
hs:hashess #hsz {S.length hs = 32} ->
rhs:hashes #hsz {S.length rhs = 32} ->
i:nat ->
j:nat{
i <= j /\ j < pow2 (32 - lv) /\
hs_wf_elts #hsz lv hs i j} ->
k:nat{i <= k && k <= j} ->
p:path #hsz ->
actd:bool ->
Lemma (requires True)
... | let rec mt_get_path_unchanged #hsz lv hs rhs i j k p actd =
let ofs = offset_of i in
if j = 0 then ()
else
(let np = mt_make_path_step lv hs rhs i j k p actd in
assert (S.equal p (S.slice np 0 (S.length p)));
mt_get_path_unchanged (lv + 1) hs rhs (i / 2) (j / 2) (k / 2) np
(if j % 2 = 0 then act... | {
"file_name": "src/MerkleTree.New.High.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 41,
"end_line": 469,
"start_col": 0,
"start_line": 462
} | module MerkleTree.New.High
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module U32 = FStar.UInt32
module U8 = FStar.UInt8
module MTS = MerkleTree.Spec
#set-options "--z3rlimit 10 --max_fuel 0 --max_ifuel 0"
type uint32_t = U32.t
type uint8_t = U8.t
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes{Seq... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
... | [
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
lv: Prims.nat{lv <= 32} ->
hs: MerkleTree.New.High.hashess{FStar.Seq.Base.length hs = 32} ->
rhs: MerkleTree.New.High.hashes{FStar.Seq.Base.length rhs = 32} ->
i: Prims.nat ->
j: Prims.nat{i <= j /\ j < Prims.pow2 (32 - lv) /\ MerkleTree.New.High.hs_wf_elts lv hs i j} ->
k: Prims.nat{i <= k && ... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.pos",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"MerkleTree.New.High.hashess",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"MerkleTree.New.High.hashes",
"MerkleTree.New.High.hash",
"Prims.l_and",
"Prims.op_LessThan",
"Prims.pow2",
"Prims.op_Subtraction",
... | [
"recursion"
] | false | false | true | false | false | let rec mt_get_path_unchanged #hsz lv hs rhs i j k p actd =
| let ofs = offset_of i in
if j = 0
then ()
else
(let np = mt_make_path_step lv hs rhs i j k p actd in
assert (S.equal p (S.slice np 0 (S.length p)));
mt_get_path_unchanged (lv + 1)
hs
rhs
(i / 2)
(j / 2)
(k / 2)
np
(if j % 2 = 0 then actd else true)) | false |
Hacl.Spec.P256.Montgomery.fst | Hacl.Spec.P256.Montgomery.mul_qmont_R_and_R_inv_is_one | val mul_qmont_R_and_R_inv_is_one: unit -> Lemma (qmont_R * qmont_R_inv % S.order = 1) | val mul_qmont_R_and_R_inv_is_one: unit -> Lemma (qmont_R * qmont_R_inv % S.order = 1) | let mul_qmont_R_and_R_inv_is_one () =
let d, k = SBML.eea_pow2_odd 256 S.order in
SBML.mont_preconditions_d 64 4 S.order;
assert (d * pow2 256 % S.order = 1);
Math.Lemmas.lemma_mod_mul_distr_l d (pow2 256) S.order;
assert (d % S.order * pow2 256 % S.order = 1) | {
"file_name": "code/ecdsap256/Hacl.Spec.P256.Montgomery.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 47,
"end_line": 244,
"start_col": 0,
"start_line": 239
} | module Hacl.Spec.P256.Montgomery
open FStar.Mul
open Lib.IntTypes
module S = Spec.P256
module M = Lib.NatMod
module BD = Hacl.Spec.Bignum.Definitions
module SBM = Hacl.Spec.Bignum.Montgomery
module SBML = Hacl.Spec.Montgomery.Lemmas
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
/// Montgomery arithmetic for a b... | {
"checked_file": "/",
"dependencies": [
"Spec.P256.Lemmas.fsti.checked",
"Spec.P256.fst.checked",
"prims.fst.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Montgomery.fsti.checked",
"Hacl.Spec.Bignum.Def... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "SBML"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "SBM"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "BD"
},
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures
Hacl.Spec.P256.Montgomery.qmont_R * Hacl.Spec.P256.Montgomery.qmont_R_inv %
Spec.P256.PointOps.order =
1) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.unit",
"Prims.int",
"Prims._assert",
"Prims.b2t",
"Prims.op_Equality",
"Prims.op_Modulus",
"FStar.Mul.op_Star",
"Spec.P256.PointOps.order",
"Prims.pow2",
"FStar.Math.Lemmas.lemma_mod_mul_distr_l",
"Hacl.Spec.Montgomery.Lemmas.mont_preconditions_d",
"FStar.Pervasives.Native.tuple2",
"H... | [] | false | false | true | false | false | let mul_qmont_R_and_R_inv_is_one () =
| let d, k = SBML.eea_pow2_odd 256 S.order in
SBML.mont_preconditions_d 64 4 S.order;
assert (d * pow2 256 % S.order = 1);
Math.Lemmas.lemma_mod_mul_distr_l d (pow2 256) S.order;
assert ((d % S.order) * pow2 256 % S.order = 1) | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_add_mod_n_u64 | val bn_add_mod_n_u64 (len: size_t{v len > 0}) : bn_add_mod_n_st U64 len | val bn_add_mod_n_u64 (len: size_t{v len > 0}) : bn_add_mod_n_st U64 len | let bn_add_mod_n_u64 (len:size_t{v len > 0}) : bn_add_mod_n_st U64 len = bn_add_mod_n len | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 89,
"end_line": 98,
"start_col": 0,
"start_line": 98
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0} -> Hacl.Bignum.bn_add_mod_n_st Lib.IntTypes.U64 len | Prims.Tot | [
"total"
] | [] | [
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_GreaterThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Bignum.bn_add_mod_n",
"Lib.IntTypes.U64",
"Hacl.Bignum.bn_add_mod_n_st"
] | [] | false | false | false | false | false | let bn_add_mod_n_u64 (len: size_t{v len > 0}) : bn_add_mod_n_st U64 len =
| bn_add_mod_n len | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_add_mod_n_u32 | val bn_add_mod_n_u32 (len: size_t{v len > 0}) : bn_add_mod_n_st U32 len | val bn_add_mod_n_u32 (len: size_t{v len > 0}) : bn_add_mod_n_st U32 len | let bn_add_mod_n_u32 (len:size_t{v len > 0}) : bn_add_mod_n_st U32 len = bn_add_mod_n len | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 89,
"end_line": 97,
"start_col": 0,
"start_line": 97
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0} -> Hacl.Bignum.bn_add_mod_n_st Lib.IntTypes.U32 len | Prims.Tot | [
"total"
] | [] | [
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_GreaterThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Bignum.bn_add_mod_n",
"Hacl.Bignum.bn_add_mod_n_st"
] | [] | false | false | false | false | false | let bn_add_mod_n_u32 (len: size_t{v len > 0}) : bn_add_mod_n_st U32 len =
| bn_add_mod_n len | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_sub | val bn_sub: #t:limb_t -> bn_sub_st t | val bn_sub: #t:limb_t -> bn_sub_st t | let bn_sub #t aLen a bLen b res =
Hacl.Bignum.Addition.bn_sub aLen a bLen b res | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 47,
"end_line": 23,
"start_col": 0,
"start_line": 22
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Bignum.bn_sub_st t | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Hacl.Bignum.Definitions.lbignum",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Bignum.Addition.bn_sub",
"Hacl.Spec.Bignum.Base.carry"
] | [] | false | false | false | false | false | let bn_sub #t aLen a bLen b res =
| Hacl.Bignum.Addition.bn_sub aLen a bLen b res | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_sub_mod_n_u64 | val bn_sub_mod_n_u64 (len: size_t{v len > 0}) : bn_sub_mod_n_st U64 len | val bn_sub_mod_n_u64 (len: size_t{v len > 0}) : bn_sub_mod_n_st U64 len | let bn_sub_mod_n_u64 (len:size_t{v len > 0}) : bn_sub_mod_n_st U64 len = bn_sub_mod_n len | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 89,
"end_line": 107,
"start_col": 0,
"start_line": 107
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0} -> Hacl.Bignum.bn_sub_mod_n_st Lib.IntTypes.U64 len | Prims.Tot | [
"total"
] | [] | [
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_GreaterThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Bignum.bn_sub_mod_n",
"Lib.IntTypes.U64",
"Hacl.Bignum.bn_sub_mod_n_st"
] | [] | false | false | false | false | false | let bn_sub_mod_n_u64 (len: size_t{v len > 0}) : bn_sub_mod_n_st U64 len =
| bn_sub_mod_n len | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_sub_mod_n_u32 | val bn_sub_mod_n_u32 (len: size_t{v len > 0}) : bn_sub_mod_n_st U32 len | val bn_sub_mod_n_u32 (len: size_t{v len > 0}) : bn_sub_mod_n_st U32 len | let bn_sub_mod_n_u32 (len:size_t{v len > 0}) : bn_sub_mod_n_st U32 len = bn_sub_mod_n len | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 89,
"end_line": 106,
"start_col": 0,
"start_line": 106
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0} -> Hacl.Bignum.bn_sub_mod_n_st Lib.IntTypes.U32 len | Prims.Tot | [
"total"
] | [] | [
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_GreaterThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Bignum.bn_sub_mod_n",
"Hacl.Bignum.bn_sub_mod_n_st"
] | [] | false | false | false | false | false | let bn_sub_mod_n_u32 (len: size_t{v len > 0}) : bn_sub_mod_n_st U32 len =
| bn_sub_mod_n len | false |
Benton2004.SmithVolpano.fsti | Benton2004.SmithVolpano.eval_equiv | val eval_equiv (#t: Type0) (c: context) (f: exp t) (s: seclevel) : GTot Type0 | val eval_equiv (#t: Type0) (c: context) (f: exp t) (s: seclevel) : GTot Type0 | let eval_equiv
(#t: Type0)
(c: context)
(f: exp t)
(s: seclevel)
: GTot Type0
= Benton2004.DDCC.eval_equiv (interp_context c) (interp_seclevel _ s) f f | {
"file_name": "examples/rel/Benton2004.SmithVolpano.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 73,
"end_line": 43,
"start_col": 0,
"start_line": 37
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"Benton2004.DDCC.fsti.checked"
],
"interface_file": false,
"source_file": "Benton2004.SmithVolpano.fsti"
} | [
{
"abbrev": false,
"full_module": "Benton2004.DDCC",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | c: Benton2004.SmithVolpano.context -> f: Benton2004.exp t -> s: Benton2004.SmithVolpano.seclevel
-> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"Benton2004.SmithVolpano.context",
"Benton2004.exp",
"Benton2004.SmithVolpano.seclevel",
"Benton2004.eval_equiv",
"Benton2004.SmithVolpano.interp_context",
"Benton2004.SmithVolpano.interp_seclevel"
] | [] | false | false | false | false | true | let eval_equiv (#t: Type0) (c: context) (f: exp t) (s: seclevel) : GTot Type0 =
| Benton2004.DDCC.eval_equiv (interp_context c) (interp_seclevel _ s) f f | false |
Benton2004.SmithVolpano.fsti | Benton2004.SmithVolpano.strong_sequential_noninterference | val strong_sequential_noninterference (gamma: context) (c: computation) : GTot Type0 | val strong_sequential_noninterference (gamma: context) (c: computation) : GTot Type0 | let strong_sequential_noninterference
(gamma: context)
(c: computation)
: GTot Type0
= exec_equiv gamma c Low | {
"file_name": "examples/rel/Benton2004.SmithVolpano.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 208,
"start_col": 0,
"start_line": 204
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"Benton2004.DDCC.fsti.checked"
],
"interface_file": false,
"source_file": "Benton2004.SmithVolpano.fsti"
} | [
{
"abbrev": false,
"full_module": "Benton2004.DDCC",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | gamma: Benton2004.SmithVolpano.context -> c: Benton2004.computation -> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"Benton2004.SmithVolpano.context",
"Benton2004.computation",
"Benton2004.SmithVolpano.exec_equiv",
"Benton2004.SmithVolpano.Low"
] | [] | false | false | false | false | true | let strong_sequential_noninterference (gamma: context) (c: computation) : GTot Type0 =
| exec_equiv gamma c Low | false |
Benton2004.SmithVolpano.fsti | Benton2004.SmithVolpano.fresh_in | val fresh_in (x: var) (gamma: context) : GTot Type0 | val fresh_in (x: var) (gamma: context) : GTot Type0 | let fresh_in (x: var) (gamma: context) : GTot Type0 =
List.Tot.mem x (List.Tot.map fst gamma) == false | {
"file_name": "examples/rel/Benton2004.SmithVolpano.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 50,
"end_line": 69,
"start_col": 0,
"start_line": 68
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"Benton2004.DDCC.fsti.checked"
],
"interface_file": false,
"source_file": "Benton2004.SmithVolpano.fsti"
} | [
{
"abbrev": false,
"full_module": "Benton2004.DDCC",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Benton2004.var -> gamma: Benton2004.SmithVolpano.context -> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"Benton2004.var",
"Benton2004.SmithVolpano.context",
"Prims.eq2",
"Prims.bool",
"FStar.List.Tot.Base.mem",
"FStar.List.Tot.Base.map",
"FStar.Pervasives.Native.tuple2",
"Benton2004.SmithVolpano.seclevel",
"FStar.Pervasives.Native.fst"
] | [] | false | false | false | false | true | let fresh_in (x: var) (gamma: context) : GTot Type0 =
| List.Tot.mem x (List.Tot.map fst gamma) == false | false |
Benton2004.SmithVolpano.fsti | Benton2004.SmithVolpano.interp_context | val interp_context (gamma: context)
: Ghost sttype
(requires True)
(ensures
(fun phi ->
forall x'. List.Tot.mem x' (List.Tot.map fst gamma) == false ==> x' `st_fresh_in` phi)) | val interp_context (gamma: context)
: Ghost sttype
(requires True)
(ensures
(fun phi ->
forall x'. List.Tot.mem x' (List.Tot.map fst gamma) == false ==> x' `st_fresh_in` phi)) | let rec interp_context
(gamma: context)
: Ghost sttype
(requires True)
(ensures (fun phi -> forall x' . List.Tot.mem x' (List.Tot.map fst gamma) == false ==> x' `st_fresh_in` phi))
= match gamma with
| [] -> st_nil
| (x, s) :: gamma' -> st_cons (interp_context gamma') x (interp_seclevel int s) | {
"file_name": "examples/rel/Benton2004.SmithVolpano.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 81,
"end_line": 35,
"start_col": 0,
"start_line": 28
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"Benton2004.DDCC.fsti.checked"
],
"interface_file": false,
"source_file": "Benton2004.SmithVolpano.fsti"
} | [
{
"abbrev": false,
"full_module": "Benton2004.DDCC",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | gamma: Benton2004.SmithVolpano.context -> Prims.Ghost Benton2004.DDCC.sttype | Prims.Ghost | [] | [] | [
"Benton2004.SmithVolpano.context",
"Benton2004.DDCC.st_nil",
"Benton2004.var",
"Benton2004.SmithVolpano.seclevel",
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"Benton2004.DDCC.st_cons",
"Benton2004.SmithVolpano.interp_context",
"Benton2004.SmithVolpano.interp_seclevel",
"Prims.int",
"Benton2... | [
"recursion"
] | false | false | false | false | false | let rec interp_context (gamma: context)
: Ghost sttype
(requires True)
(ensures
(fun phi ->
forall x'. List.Tot.mem x' (List.Tot.map fst gamma) == false ==> x' `st_fresh_in` phi)) =
| match gamma with
| [] -> st_nil
| (x, s) :: gamma' -> st_cons (interp_context gamma') x (interp_seclevel int s) | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_add | val bn_add: #t:limb_t -> bn_add_st t | val bn_add: #t:limb_t -> bn_add_st t | let bn_add #t aLen a bLen b res =
Hacl.Bignum.Addition.bn_add aLen a bLen b res | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 47,
"end_line": 20,
"start_col": 0,
"start_line": 19
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Bignum.bn_add_st t | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Hacl.Bignum.Definitions.lbignum",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Bignum.Addition.bn_add",
"Hacl.Spec.Bignum.Base.carry"
] | [] | false | false | false | false | false | let bn_add #t aLen a bLen b res =
| Hacl.Bignum.Addition.bn_add aLen a bLen b res | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_add1 | val bn_add1:
#t:limb_t
-> aLen:size_t{0 < v aLen}
-> a:lbignum t aLen
-> b1:limb t
-> res:lbignum t aLen ->
Stack (carry t)
(requires fun h ->
live h a /\ live h res /\ eq_or_disjoint a res)
(ensures fun h0 c_out h1 -> modifies (loc res) h0 h1 /\
(let c, r = S.bn_add1 (as_seq h0 a) b1 in
... | val bn_add1:
#t:limb_t
-> aLen:size_t{0 < v aLen}
-> a:lbignum t aLen
-> b1:limb t
-> res:lbignum t aLen ->
Stack (carry t)
(requires fun h ->
live h a /\ live h res /\ eq_or_disjoint a res)
(ensures fun h0 c_out h1 -> modifies (loc res) h0 h1 /\
(let c, r = S.bn_add1 (as_seq h0 a) b1 in
... | let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 44,
"end_line": 8,
"start_col": 0,
"start_line": 7
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0" | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
aLen: Lib.IntTypes.size_t{0 < Lib.IntTypes.v aLen} ->
a: Hacl.Bignum.Definitions.lbignum t aLen ->
b1: Hacl.Bignum.Definitions.limb t ->
res: Hacl.Bignum.Definitions.lbignum t aLen
-> FStar.HyperStack.ST.Stack (Hacl.Spec.Bignum.Base.carry t) | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Bignum.Definitions.lbignum",
"Hacl.Bignum.Definitions.limb",
"Hacl.Bignum.Addition.bn_add1",
"Hacl.Spec.Bignum.Base.carry"
] | [] | false | true | false | false | false | let bn_add1 #t aLen a b1 res =
| Hacl.Bignum.Addition.bn_add1 aLen a b1 res | false |
Benton2004.SmithVolpano.fsti | Benton2004.SmithVolpano.interp_seclevel | val interp_seclevel (t: Type0) (s: seclevel) : GTot (nstype t) | val interp_seclevel (t: Type0) (s: seclevel) : GTot (nstype t) | let interp_seclevel (t: Type0) (s: seclevel) : GTot (nstype t) =
match s with
| Low -> ns_delta
| High -> ns_t | {
"file_name": "examples/rel/Benton2004.SmithVolpano.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 16,
"end_line": 24,
"start_col": 0,
"start_line": 21
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"Benton2004.DDCC.fsti.checked"
],
"interface_file": false,
"source_file": "Benton2004.SmithVolpano.fsti"
} | [
{
"abbrev": false,
"full_module": "Benton2004.DDCC",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | t: Type0 -> s: Benton2004.SmithVolpano.seclevel -> Prims.GTot (Benton2004.DDCC.nstype t) | Prims.GTot | [
"sometrivial"
] | [] | [
"Benton2004.SmithVolpano.seclevel",
"Benton2004.DDCC.ns_delta",
"Benton2004.DDCC.ns_t",
"Benton2004.DDCC.nstype"
] | [] | false | false | false | false | false | let interp_seclevel (t: Type0) (s: seclevel) : GTot (nstype t) =
| match s with
| Low -> ns_delta
| High -> ns_t | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_add_mod_n | val bn_add_mod_n: #t:limb_t -> len:size_t{v len > 0} -> bn_add_mod_n_st t len | val bn_add_mod_n: #t:limb_t -> len:size_t{v len > 0} -> bn_add_mod_n_st t len | let bn_add_mod_n #t len n a b res =
let c0 = bn_add_eq_len len a b res in
bn_reduce_once len n c0 res | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 29,
"end_line": 35,
"start_col": 0,
"start_line": 33
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0} -> Hacl.Bignum.bn_add_mod_n_st t len | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_GreaterThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Bignum.Definitions.lbignum",
"Hacl.Bignum.bn_reduce_once",
"Prims.unit",
"Hacl.Spec.Bignum.Base.carry",
"Hacl.Bignum.bn_add_eq_len"
] | [] | false | false | false | false | false | let bn_add_mod_n #t len n a b res =
| let c0 = bn_add_eq_len len a b res in
bn_reduce_once len n c0 res | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_sub_eq_len | val bn_sub_eq_len: #t:limb_t -> len:size_t -> bn_sub_eq_len_st t len | val bn_sub_eq_len: #t:limb_t -> len:size_t -> bn_sub_eq_len_st t len | let bn_sub_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_sub_eq_len aLen a b res | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 49,
"end_line": 17,
"start_col": 0,
"start_line": 16
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | len: Lib.IntTypes.size_t -> Hacl.Bignum.bn_sub_eq_len_st t len | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Hacl.Bignum.Definitions.lbignum",
"Hacl.Bignum.Addition.bn_sub_eq_len",
"Hacl.Spec.Bignum.Base.carry"
] | [] | false | false | false | false | false | let bn_sub_eq_len #t aLen a b res =
| Hacl.Bignum.Addition.bn_sub_eq_len aLen a b res | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_add_eq_len | val bn_add_eq_len: #t:limb_t -> len:size_t -> bn_add_eq_len_st t len | val bn_add_eq_len: #t:limb_t -> len:size_t -> bn_add_eq_len_st t len | let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_len aLen a b res | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 49,
"end_line": 14,
"start_col": 0,
"start_line": 13
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | len: Lib.IntTypes.size_t -> Hacl.Bignum.bn_add_eq_len_st t len | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Hacl.Bignum.Definitions.lbignum",
"Hacl.Bignum.Addition.bn_add_eq_len",
"Hacl.Spec.Bignum.Base.carry"
] | [] | false | false | false | false | false | let bn_add_eq_len #t aLen a b res =
| Hacl.Bignum.Addition.bn_add_eq_len aLen a b res | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_sub1 | val bn_sub1:
#t:limb_t
-> aLen:size_t{0 < v aLen}
-> a:lbignum t aLen
-> b1:limb t
-> res:lbignum t aLen ->
Stack (carry t)
(requires fun h ->
live h a /\ live h res /\ eq_or_disjoint a res)
(ensures fun h0 c_out h1 -> modifies (loc res) h0 h1 /\
(let c, r = S.bn_sub1 (as_seq h0 a) b1 in
... | val bn_sub1:
#t:limb_t
-> aLen:size_t{0 < v aLen}
-> a:lbignum t aLen
-> b1:limb t
-> res:lbignum t aLen ->
Stack (carry t)
(requires fun h ->
live h a /\ live h res /\ eq_or_disjoint a res)
(ensures fun h0 c_out h1 -> modifies (loc res) h0 h1 /\
(let c, r = S.bn_sub1 (as_seq h0 a) b1 in
... | let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 44,
"end_line": 11,
"start_col": 0,
"start_line": 10
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
aLen: Lib.IntTypes.size_t{0 < Lib.IntTypes.v aLen} ->
a: Hacl.Bignum.Definitions.lbignum t aLen ->
b1: Hacl.Bignum.Definitions.limb t ->
res: Hacl.Bignum.Definitions.lbignum t aLen
-> FStar.HyperStack.ST.Stack (Hacl.Spec.Bignum.Base.carry t) | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Bignum.Definitions.lbignum",
"Hacl.Bignum.Definitions.limb",
"Hacl.Bignum.Addition.bn_sub1",
"Hacl.Spec.Bignum.Base.carry"
] | [] | false | true | false | false | false | let bn_sub1 #t aLen a b1 res =
| Hacl.Bignum.Addition.bn_sub1 aLen a b1 res | false |
StRel.fst | StRel.f1_hp | val f1_hp : heap -> ref int -> GTot (heap * int) | val f1_hp : heap -> ref int -> GTot (heap * int) | let f1_hp h x = h, sel h x | {
"file_name": "examples/rel/StRel.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 26,
"end_line": 25,
"start_col": 0,
"start_line": 25
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"Rel.fst.checked",
"prims.fst.checked",
"FStar.ST.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "StRel.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Heap",
"short_module": null
},
{
"abbrev": false,
"full_module": "Rel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | h: FStar.Monotonic.Heap.heap -> x: FStar.ST.ref Prims.int
-> Prims.GTot (FStar.Monotonic.Heap.heap * Prims.int) | Prims.GTot | [
"sometrivial"
] | [] | [
"FStar.Monotonic.Heap.heap",
"FStar.ST.ref",
"Prims.int",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Monotonic.Heap.sel",
"FStar.Heap.trivial_preorder",
"FStar.Pervasives.Native.tuple2"
] | [] | false | false | false | false | false | let f1_hp h x =
| h, sel h x | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_mul | val bn_mul:
#t:limb_t
-> aLen:size_t
-> bLen:size_t{v aLen + v bLen <= max_size_t}
-> a:lbignum t aLen ->
bn_mul_st t aLen bLen a | val bn_mul:
#t:limb_t
-> aLen:size_t
-> bLen:size_t{v aLen + v bLen <= max_size_t}
-> a:lbignum t aLen ->
bn_mul_st t aLen bLen a | let bn_mul #t aLen bLen a b res =
Hacl.Bignum.Multiplication.bn_mul aLen a bLen b res | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 53,
"end_line": 56,
"start_col": 0,
"start_line": 55
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
aLen: Lib.IntTypes.size_t ->
bLen: Lib.IntTypes.size_t{Lib.IntTypes.v aLen + Lib.IntTypes.v bLen <= Lib.IntTypes.max_size_t} ->
a: Hacl.Bignum.Definitions.lbignum t aLen
-> Hacl.Bignum.bn_mul_st t aLen bLen a | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Lib.IntTypes.max_size_t",
"Hacl.Bignum.Definitions.lbignum",
"Lib.IntTypes.op_Plus_Bang",
"Hacl.Bignum.Multiplicatio... | [] | false | false | false | false | false | let bn_mul #t aLen bLen a b res =
| Hacl.Bignum.Multiplication.bn_mul aLen a bLen b res | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_sqr | val bn_sqr:
#t:limb_t
-> len:size_t{0 < v len /\ v len + v len <= max_size_t}
-> a:lbignum t len ->
bn_sqr_st t len a | val bn_sqr:
#t:limb_t
-> len:size_t{0 < v len /\ v len + v len <= max_size_t}
-> a:lbignum t len ->
bn_sqr_st t len a | let bn_sqr #t len a res =
let h0 = ST.get () in
Hacl.Spec.Bignum.bn_sqr_lemma (as_seq h0 a);
Hacl.Bignum.Multiplication.bn_sqr len a res | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 45,
"end_line": 66,
"start_col": 0,
"start_line": 63
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
len:
Lib.IntTypes.size_t
{ 0 < Lib.IntTypes.v len /\
Lib.IntTypes.v len + Lib.IntTypes.v len <= Lib.IntTypes.max_size_t } ->
a: Hacl.Bignum.Definitions.lbignum t len
-> Hacl.Bignum.bn_sqr_st t len a | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Lib.IntTypes.max_size_t",
"Hacl.Bignum.Definitions.lbignum",
"Lib.IntTypes.op_... | [] | false | false | false | false | false | let bn_sqr #t len a res =
| let h0 = ST.get () in
Hacl.Spec.Bignum.bn_sqr_lemma (as_seq h0 a);
Hacl.Bignum.Multiplication.bn_sqr len a res | false |
StRel.fst | StRel.f2_hp | val f2_hp : heap -> ref int -> Tot (heap * int) | val f2_hp : heap -> ref int -> Tot (heap * int) | let f2_hp h x = h, 0 | {
"file_name": "examples/rel/StRel.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 20,
"end_line": 28,
"start_col": 0,
"start_line": 28
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"Rel.fst.checked",
"prims.fst.checked",
"FStar.ST.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "StRel.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Heap",
"short_module": null
},
{
"abbrev": false,
"full_module": "Rel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | h: FStar.Monotonic.Heap.heap -> x: FStar.ST.ref Prims.int -> FStar.Monotonic.Heap.heap * Prims.int | Prims.Tot | [
"total"
] | [] | [
"FStar.Monotonic.Heap.heap",
"FStar.ST.ref",
"Prims.int",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.tuple2"
] | [] | false | false | false | true | false | let f2_hp h x =
| h, 0 | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_karatsuba_mul | val bn_karatsuba_mul:
#t:limb_t
-> len:size_t{0 < v len /\ 4 * v len <= max_size_t}
-> a:lbignum t len ->
bn_karatsuba_mul_st t len a | val bn_karatsuba_mul:
#t:limb_t
-> len:size_t{0 < v len /\ 4 * v len <= max_size_t}
-> a:lbignum t len ->
bn_karatsuba_mul_st t len a | let bn_karatsuba_mul #t len a b res =
let h0 = ST.get () in
Hacl.Spec.Bignum.bn_karatsuba_mul_lemma (as_seq h0 a) (as_seq h0 b);
Hacl.Bignum.Karatsuba.bn_karatsuba_mul len a b res | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 52,
"end_line": 53,
"start_col": 0,
"start_line": 50
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
len:
Lib.IntTypes.size_t
{0 < Lib.IntTypes.v len /\ 4 * Lib.IntTypes.v len <= Lib.IntTypes.max_size_t} ->
a: Hacl.Bignum.Definitions.lbignum t len
-> Hacl.Bignum.bn_karatsuba_mul_st t len a | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.max_size_t",
"Hacl.Bignum.Definitions.lbignum",
"Lib.IntTypes.op_... | [] | false | false | false | false | false | let bn_karatsuba_mul #t len a b res =
| let h0 = ST.get () in
Hacl.Spec.Bignum.bn_karatsuba_mul_lemma (as_seq h0 a) (as_seq h0 b);
Hacl.Bignum.Karatsuba.bn_karatsuba_mul len a b res | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_mul1_lshift_add_in_place | val bn_mul1_lshift_add_in_place:
#t:limb_t
-> aLen:size_t
-> a:lbignum t aLen
-> b:limb t
-> resLen:size_t
-> j:size_t{v j + v aLen <= v resLen}
-> res:lbignum t resLen ->
Stack (limb t)
(requires fun h -> live h a /\ live h res /\ disjoint res a)
(ensures fun h0 c_out h1 -> modifies (loc res) h0... | val bn_mul1_lshift_add_in_place:
#t:limb_t
-> aLen:size_t
-> a:lbignum t aLen
-> b:limb t
-> resLen:size_t
-> j:size_t{v j + v aLen <= v resLen}
-> res:lbignum t resLen ->
Stack (limb t)
(requires fun h -> live h a /\ live h res /\ disjoint res a)
(ensures fun h0 c_out h1 -> modifies (loc res) h0... | let bn_mul1_lshift_add_in_place #t aLen a b j res =
Hacl.Bignum.Multiplication.bn_mul1_lshift_add aLen a b j res | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 62,
"end_line": 69,
"start_col": 0,
"start_line": 68
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
aLen: Lib.IntTypes.size_t ->
a: Hacl.Bignum.Definitions.lbignum t aLen ->
b: Hacl.Bignum.Definitions.limb t ->
resLen: Lib.IntTypes.size_t ->
j: Lib.IntTypes.size_t{Lib.IntTypes.v j + Lib.IntTypes.v aLen <= Lib.IntTypes.v resLen} ->
res: Hacl.Bignum.Definitions.lbignum t resLen
-> FStar.Hyper... | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Hacl.Bignum.Definitions.lbignum",
"Hacl.Bignum.Definitions.limb",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Bignum.Multiplication.bn_mul1_lshift_add",
"... | [] | false | true | false | false | false | let bn_mul1_lshift_add_in_place #t aLen a b j res =
| Hacl.Bignum.Multiplication.bn_mul1_lshift_add aLen a b j res | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_karatsuba_sqr | val bn_karatsuba_sqr:
#t:limb_t
-> len:size_t{0 < v len /\ 4 * v len <= max_size_t}
-> a:lbignum t len ->
bn_karatsuba_sqr_st t len a | val bn_karatsuba_sqr:
#t:limb_t
-> len:size_t{0 < v len /\ 4 * v len <= max_size_t}
-> a:lbignum t len ->
bn_karatsuba_sqr_st t len a | let bn_karatsuba_sqr #t len a res =
let h0 = ST.get () in
Hacl.Spec.Bignum.bn_karatsuba_sqr_lemma (as_seq h0 a);
Hacl.Bignum.Karatsuba.bn_karatsuba_sqr len a res | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 50,
"end_line": 61,
"start_col": 0,
"start_line": 58
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
len:
Lib.IntTypes.size_t
{0 < Lib.IntTypes.v len /\ 4 * Lib.IntTypes.v len <= Lib.IntTypes.max_size_t} ->
a: Hacl.Bignum.Definitions.lbignum t len
-> Hacl.Bignum.bn_karatsuba_sqr_st t len a | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.max_size_t",
"Hacl.Bignum.Definitions.lbignum",
"Lib.IntTypes.op_... | [] | false | false | false | false | false | let bn_karatsuba_sqr #t len a res =
| let h0 = ST.get () in
Hacl.Spec.Bignum.bn_karatsuba_sqr_lemma (as_seq h0 a);
Hacl.Bignum.Karatsuba.bn_karatsuba_sqr len a res | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_mul1 | val bn_mul1:
#t:limb_t
-> aLen:size_t
-> a:lbignum t aLen
-> l:limb t
-> res:lbignum t aLen ->
Stack (limb t)
(requires fun h ->
live h a /\ live h res /\ eq_or_disjoint res a)
(ensures fun h0 c_out h1 -> modifies (loc res) h0 h1 /\
(c_out, as_seq h1 res) == S.bn_mul1 (as_seq h0 a) l) | val bn_mul1:
#t:limb_t
-> aLen:size_t
-> a:lbignum t aLen
-> l:limb t
-> res:lbignum t aLen ->
Stack (limb t)
(requires fun h ->
live h a /\ live h res /\ eq_or_disjoint res a)
(ensures fun h0 c_out h1 -> modifies (loc res) h0 h1 /\
(c_out, as_seq h1 res) == S.bn_mul1 (as_seq h0 a) l) | let bn_mul1 #t aLen a l res =
Hacl.Bignum.Multiplication.bn_mul1 #t aLen a l res | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 52,
"end_line": 48,
"start_col": 0,
"start_line": 47
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
aLen: Lib.IntTypes.size_t ->
a: Hacl.Bignum.Definitions.lbignum t aLen ->
l: Hacl.Bignum.Definitions.limb t ->
res: Hacl.Bignum.Definitions.lbignum t aLen
-> FStar.HyperStack.ST.Stack (Hacl.Bignum.Definitions.limb t) | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Hacl.Bignum.Definitions.lbignum",
"Hacl.Bignum.Definitions.limb",
"Hacl.Bignum.Multiplication.bn_mul1"
] | [] | false | true | false | false | false | let bn_mul1 #t aLen a l res =
| Hacl.Bignum.Multiplication.bn_mul1 #t aLen a l res | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_get_bits | val bn_get_bits:
#t:limb_t
-> len:size_t
-> b:lbignum t len
-> i:size_t
-> l:size_t{v l < bits t /\ v i / bits t < v len} ->
Stack (limb t)
(requires fun h -> live h b)
(ensures fun h0 r h1 -> h0 == h1 /\
r == S.bn_get_bits (as_seq h0 b) (v i) (v l)) | val bn_get_bits:
#t:limb_t
-> len:size_t
-> b:lbignum t len
-> i:size_t
-> l:size_t{v l < bits t /\ v i / bits t < v len} ->
Stack (limb t)
(requires fun h -> live h b)
(ensures fun h0 r h1 -> h0 == h1 /\
r == S.bn_get_bits (as_seq h0 b) (v i) (v l)) | let bn_get_bits #t len b i l =
Hacl.Bignum.Lib.bn_get_bits len b i l | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 39,
"end_line": 87,
"start_col": 0,
"start_line": 86
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
len: Lib.IntTypes.size_t ->
b: Hacl.Bignum.Definitions.lbignum t len ->
i: Lib.IntTypes.size_t ->
l:
Lib.IntTypes.size_t
{ Lib.IntTypes.v l < Lib.IntTypes.bits t /\
Lib.IntTypes.v i / Lib.IntTypes.bits t < Lib.IntTypes.v len }
-> FStar.HyperStack.ST.Stack (Hacl.Bignum.Definiti... | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Hacl.Bignum.Definitions.lbignum",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Lib.IntTypes.bits",
"Prims.op_Division",
"Hacl.Bignum.Lib.bn_get_bits",
"Hacl.Bignum.Definit... | [] | false | true | false | false | false | let bn_get_bits #t len b i l =
| Hacl.Bignum.Lib.bn_get_bits len b i l | false |
StRel.fst | StRel.glift | val glift : #t:Type -> #t2:Type
-> f:(t -> GTot t2) -> rel t
-> GTot (rel t2) | val glift : #t:Type -> #t2:Type
-> f:(t -> GTot t2) -> rel t
-> GTot (rel t2) | let glift #t #t2 f (R x y) = R (f x) (f y) | {
"file_name": "examples/rel/StRel.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 42,
"end_line": 44,
"start_col": 0,
"start_line": 44
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"Rel.fst.checked",
"prims.fst.checked",
"FStar.ST.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "StRel.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Heap",
"short_module": null
},
{
"abbrev": false,
"full_module": "Rel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f: (_: t -> Prims.GTot t2) -> _: Rel.rel t -> Prims.GTot (Rel.rel t2) | Prims.GTot | [
"sometrivial"
] | [] | [
"Rel.rel",
"Rel.R"
] | [] | false | false | false | false | false | let glift #t #t2 f (R x y) =
| R (f x) (f y) | false |
StRel.fst | StRel.glift2 | val glift2 : #t:Type -> #t2:Type -> #t3:Type
-> f:(t -> t2 -> GTot t3) -> rel t -> rel t2
-> GTot (rel t3) | val glift2 : #t:Type -> #t2:Type -> #t3:Type
-> f:(t -> t2 -> GTot t3) -> rel t -> rel t2
-> GTot (rel t3) | let glift2 #t #t2 #t3 f (R x y) (R x2 y2) = R (f x x2) (f y y2) | {
"file_name": "examples/rel/StRel.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 63,
"end_line": 49,
"start_col": 0,
"start_line": 49
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"Rel.fst.checked",
"prims.fst.checked",
"FStar.ST.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "StRel.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Heap",
"short_module": null
},
{
"abbrev": false,
"full_module": "Rel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f: (_: t -> _: t2 -> Prims.GTot t3) -> _: Rel.rel t -> _: Rel.rel t2 -> Prims.GTot (Rel.rel t3) | Prims.GTot | [
"sometrivial"
] | [] | [
"Rel.rel",
"FStar.Pervasives.Native.Mktuple2",
"Rel.R"
] | [] | false | false | false | false | false | let glift2 #t #t2 #t3 f (R x y) (R x2 y2) =
| R (f x x2) (f y y2) | false |
Hacl.Spec.FFDHE.Lemmas.fst | Hacl.Spec.FFDHE.Lemmas.ffdhe_p_bits_lemma | val ffdhe_p_bits_lemma: a:ffdhe_alg -> Lemma
(let ffdhe_p = get_ffdhe_params a in
let len = ffdhe_len a in
let p = Mk_ffdhe_params?.ffdhe_p ffdhe_p in
let p_n = nat_from_bytes_be p in
pow2 (8 * len - 1) < p_n) | val ffdhe_p_bits_lemma: a:ffdhe_alg -> Lemma
(let ffdhe_p = get_ffdhe_params a in
let len = ffdhe_len a in
let p = Mk_ffdhe_params?.ffdhe_p ffdhe_p in
let p_n = nat_from_bytes_be p in
pow2 (8 * len - 1) < p_n) | let ffdhe_p_bits_lemma a =
let ffdhe_p = get_ffdhe_params a in
let len = ffdhe_len a in
let p = Mk_ffdhe_params?.ffdhe_p ffdhe_p in
let p_n = nat_from_bytes_be p in
nat_from_intseq_be_slice_lemma p 1;
assert (p_n == nat_from_bytes_be (slice p 1 len) + pow2 (8 * (len - 1)) * nat_from_bytes_be (slice p 0 1))... | {
"file_name": "code/ffdhe/Hacl.Spec.FFDHE.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 17,
"end_line": 104,
"start_col": 0,
"start_line": 91
} | module Hacl.Spec.FFDHE.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.FFDHE
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val ffdhe_p_lemma_len: a:ffdhe_alg -> Lemma
(let ffdhe_p = get_ffdhe_params a in
let p = Mk_ffdhe_params?.ffdhe_p ffdhe_p in
Seq.index p 0 == 0... | {
"checked_file": "/",
"dependencies": [
"Spec.FFDHE.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.... | [
{
"abbrev": false,
"full_module": "Spec.FFDHE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "L... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.FFDHE.ffdhe_alg
-> FStar.Pervasives.Lemma
(ensures
(let ffdhe_p = Spec.FFDHE.get_ffdhe_params a in
let len = Spec.FFDHE.ffdhe_len a in
let p = Mk_ffdhe_params?.ffdhe_p ffdhe_p in
let p_n = Lib.ByteSequence.nat_from_bytes_be p in
Prims.pow2 (8 * len - 1) < p_n)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Spec.FFDHE.ffdhe_alg",
"Hacl.Spec.FFDHE.Lemmas.pow2_lt_len",
"Prims.unit",
"Prims._assert",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Prims.pow2",
"Prims.op_Subtraction",
"Hacl.Spec.FFDHE.Lemmas.ffdhe_p_lemma_len",
"Lib.IntTypes.v",
"Lib.IntTypes.U8",
"Lib.IntTypes.PUB"... | [] | true | false | true | false | false | let ffdhe_p_bits_lemma a =
| let ffdhe_p = get_ffdhe_params a in
let len = ffdhe_len a in
let p = Mk_ffdhe_params?.ffdhe_p ffdhe_p in
let p_n = nat_from_bytes_be p in
nat_from_intseq_be_slice_lemma p 1;
assert (p_n ==
nat_from_bytes_be (slice p 1 len) + pow2 (8 * (len - 1)) * nat_from_bytes_be (slice p 0 1));
nat_from_intseq_be_lemma0 (slice p... | false |
Hacl.Bignum.fst | Hacl.Bignum.cswap2 | val cswap2:
#t:limb_t
-> len:size_t
-> bit:limb t
-> b1:lbignum t len
-> b2:lbignum t len ->
Stack unit
(requires fun h -> live h b1 /\ live h b2 /\ disjoint b1 b2)
(ensures fun h0 _ h1 -> modifies (loc b1 |+| loc b2) h0 h1 /\
(as_seq h1 b1, as_seq h1 b2) == S.cswap2 bit (as_seq h0 b1) (as_seq h0... | val cswap2:
#t:limb_t
-> len:size_t
-> bit:limb t
-> b1:lbignum t len
-> b2:lbignum t len ->
Stack unit
(requires fun h -> live h b1 /\ live h b2 /\ disjoint b1 b2)
(ensures fun h0 _ h1 -> modifies (loc b1 |+| loc b2) h0 h1 /\
(as_seq h1 b1, as_seq h1 b2) == S.cswap2 bit (as_seq h0 b1) (as_seq h0... | let cswap2 #t len bit b1 b2 =
Hacl.Bignum.Lib.cswap2_st len bit b1 b2 | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 41,
"end_line": 95,
"start_col": 0,
"start_line": 94
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
len: Lib.IntTypes.size_t ->
bit: Hacl.Bignum.Definitions.limb t ->
b1: Hacl.Bignum.Definitions.lbignum t len ->
b2: Hacl.Bignum.Definitions.lbignum t len
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Hacl.Bignum.Definitions.limb",
"Hacl.Bignum.Definitions.lbignum",
"Hacl.Bignum.Lib.cswap2_st",
"Prims.unit"
] | [] | false | true | false | false | false | let cswap2 #t len bit b1 b2 =
| Hacl.Bignum.Lib.cswap2_st len bit b1 b2 | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_sub_mod_n_ | val bn_sub_mod_n_ (#t: limb_t) (len: size_t{v len > 0}) : bn_sub_mod_n_st t len | val bn_sub_mod_n_ (#t: limb_t) (len: size_t{v len > 0}) : bn_sub_mod_n_st t len | let bn_sub_mod_n_ (#t:limb_t) (len:size_t{v len > 0}) : bn_sub_mod_n_st t len =
match t with
| U32 -> bn_sub_mod_n_u32 len
| U64 -> bn_sub_mod_n_u64 len | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 31,
"end_line": 113,
"start_col": 0,
"start_line": 110
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0} -> Hacl.Bignum.bn_sub_mod_n_st t len | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_GreaterThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Bignum.bn_sub_mod_n_u32",
"Hacl.Bignum.bn_sub_mod_n_u64",
"Hacl.Bignum.bn_sub_mod_n_st"
] | [] | false | false | false | false | false | let bn_sub_mod_n_ (#t: limb_t) (len: size_t{v len > 0}) : bn_sub_mod_n_st t len =
| match t with
| U32 -> bn_sub_mod_n_u32 len
| U64 -> bn_sub_mod_n_u64 len | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_add_mod_n_ | val bn_add_mod_n_ (#t: limb_t) (len: size_t{v len > 0}) : bn_add_mod_n_st t len | val bn_add_mod_n_ (#t: limb_t) (len: size_t{v len > 0}) : bn_add_mod_n_st t len | let bn_add_mod_n_ (#t:limb_t) (len:size_t{v len > 0}) : bn_add_mod_n_st t len =
match t with
| U32 -> bn_add_mod_n_u32 len
| U64 -> bn_add_mod_n_u64 len | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 31,
"end_line": 104,
"start_col": 0,
"start_line": 101
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0} -> Hacl.Bignum.bn_add_mod_n_st t len | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_GreaterThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Bignum.bn_add_mod_n_u32",
"Hacl.Bignum.bn_add_mod_n_u64",
"Hacl.Bignum.bn_add_mod_n_st"
] | [] | false | false | false | false | false | let bn_add_mod_n_ (#t: limb_t) (len: size_t{v len > 0}) : bn_add_mod_n_st t len =
| match t with
| U32 -> bn_add_mod_n_u32 len
| U64 -> bn_add_mod_n_u64 len | false |
StRel.fst | StRel.f1 | val f1 : x:(ref int) -> ST int (requires (fun h -> True))
(ensures (fun h r h' -> fst (f1_hp h x) == h'
/\ snd (f1_hp h x) == r)) | val f1 : x:(ref int) -> ST int (requires (fun h -> True))
(ensures (fun h r h' -> fst (f1_hp h x) == h'
/\ snd (f1_hp h x) == r)) | let f1 x = !x | {
"file_name": "examples/rel/StRel.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 13,
"end_line": 34,
"start_col": 0,
"start_line": 34
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"Rel.fst.checked",
"prims.fst.checked",
"FStar.ST.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "StRel.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Heap",
"short_module": null
},
{
"abbrev": false,
"full_module": "Rel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: FStar.ST.ref Prims.int -> FStar.ST.ST Prims.int | FStar.ST.ST | [] | [] | [
"FStar.ST.ref",
"Prims.int",
"FStar.ST.op_Bang",
"FStar.Heap.trivial_preorder"
] | [] | false | true | false | false | false | let f1 x =
| !x | false |
StRel.fst | StRel.f2 | val f2 : x:(ref int) -> ST int (requires (fun h -> True))
(ensures (fun h r h' -> fst (f2_hp h x) == h'
/\ snd (f2_hp h x) == r)) | val f2 : x:(ref int) -> ST int (requires (fun h -> True))
(ensures (fun h r h' -> fst (f2_hp h x) == h'
/\ snd (f2_hp h x) == r)) | let f2 x = 0 | {
"file_name": "examples/rel/StRel.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 12,
"end_line": 39,
"start_col": 0,
"start_line": 39
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"Rel.fst.checked",
"prims.fst.checked",
"FStar.ST.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "StRel.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Heap",
"short_module": null
},
{
"abbrev": false,
"full_module": "Rel",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: FStar.ST.ref Prims.int -> FStar.ST.ST Prims.int | FStar.ST.ST | [] | [] | [
"FStar.ST.ref",
"Prims.int"
] | [] | false | true | false | false | false | let f2 x =
| 0 | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_rshift | val bn_rshift:
#t:limb_t
-> len:size_t
-> b:lbignum t len
-> i:size_t{v i < v len}
-> res:lbignum t (len -! i) ->
Stack unit
(requires fun h -> live h b /\ live h res /\ disjoint res b)
(ensures fun h0 _ h1 -> modifies (loc res) h0 h1 /\
as_seq h1 res == S.bn_rshift (as_seq h0 b) (v i)) | val bn_rshift:
#t:limb_t
-> len:size_t
-> b:lbignum t len
-> i:size_t{v i < v len}
-> res:lbignum t (len -! i) ->
Stack unit
(requires fun h -> live h b /\ live h res /\ disjoint res b)
(ensures fun h0 _ h1 -> modifies (loc res) h0 h1 /\
as_seq h1 res == S.bn_rshift (as_seq h0 b) (v i)) | let bn_rshift #t len b i res =
copy res (sub b i (len -! i)) | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 31,
"end_line": 72,
"start_col": 0,
"start_line": 71
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
len: Lib.IntTypes.size_t ->
b: Hacl.Bignum.Definitions.lbignum t len ->
i: Lib.IntTypes.size_t{Lib.IntTypes.v i < Lib.IntTypes.v len} ->
res: Hacl.Bignum.Definitions.lbignum t (len -! i)
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Hacl.Bignum.Definitions.lbignum",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Lib.IntTypes.op_Subtraction_Bang",
"Lib.Buffer.copy",
"Lib.Buffer.MUT",
"Hacl.Bignum.Definitions.limb",
"Pr... | [] | false | true | false | false | false | let bn_rshift #t len b i res =
| copy res (sub b i (len -! i)) | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_eq_mask | val bn_eq_mask: #t:limb_t -> len:size_t -> bn_eq_mask_st t len | val bn_eq_mask: #t:limb_t -> len:size_t -> bn_eq_mask_st t len | let bn_eq_mask #t len a b =
Hacl.Bignum.Comparison.bn_eq_mask len a b | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 43,
"end_line": 136,
"start_col": 0,
"start_line": 135
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | len: Lib.IntTypes.size_t -> Hacl.Bignum.bn_eq_mask_st t len | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Hacl.Bignum.Definitions.lbignum",
"Hacl.Bignum.Comparison.bn_eq_mask",
"Hacl.Bignum.Definitions.limb"
] | [] | false | false | false | false | false | let bn_eq_mask #t len a b =
| Hacl.Bignum.Comparison.bn_eq_mask len a b | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_is_odd | val bn_is_odd:
#t:limb_t
-> len:size_t{v len > 0}
-> a:lbignum t len ->
Stack (limb t)
(requires fun h -> live h a)
(ensures fun h0 r h1 -> modifies0 h0 h1 /\
r == S.bn_is_odd (as_seq h0 a)) | val bn_is_odd:
#t:limb_t
-> len:size_t{v len > 0}
-> a:lbignum t len ->
Stack (limb t)
(requires fun h -> live h a)
(ensures fun h0 r h1 -> modifies0 h0 h1 /\
r == S.bn_is_odd (as_seq h0 a)) | let bn_is_odd #t len a =
Hacl.Bignum.Comparison.bn_is_odd len a | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 40,
"end_line": 133,
"start_col": 0,
"start_line": 132
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0} -> a: Hacl.Bignum.Definitions.lbignum t len
-> FStar.HyperStack.ST.Stack (Hacl.Bignum.Definitions.limb t) | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_GreaterThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Bignum.Definitions.lbignum",
"Hacl.Bignum.Comparison.bn_is_odd",
"Hacl.Bignum.Definitions.limb"
] | [] | false | true | false | false | false | let bn_is_odd #t len a =
| Hacl.Bignum.Comparison.bn_is_odd len a | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_set_ith_bit | val bn_set_ith_bit:
#t:limb_t
-> len:size_t
-> b:lbignum t len
-> i:size_t{v i / bits t < v len} ->
Stack unit
(requires fun h -> live h b)
(ensures fun h0 _ h1 -> modifies (loc b) h0 h1 /\
as_seq h1 b == S.bn_set_ith_bit (as_seq h0 b) (v i)) | val bn_set_ith_bit:
#t:limb_t
-> len:size_t
-> b:lbignum t len
-> i:size_t{v i / bits t < v len} ->
Stack unit
(requires fun h -> live h b)
(ensures fun h0 _ h1 -> modifies (loc b) h0 h1 /\
as_seq h1 b == S.bn_set_ith_bit (as_seq h0 b) (v i)) | let bn_set_ith_bit #t len input ind =
Hacl.Bignum.Lib.bn_set_ith_bit len input ind | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 46,
"end_line": 90,
"start_col": 0,
"start_line": 89
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
len: Lib.IntTypes.size_t ->
b: Hacl.Bignum.Definitions.lbignum t len ->
i: Lib.IntTypes.size_t{Lib.IntTypes.v i / Lib.IntTypes.bits t < Lib.IntTypes.v len}
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Hacl.Bignum.Definitions.lbignum",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.op_Division",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Lib.IntTypes.bits",
"Hacl.Bignum.Lib.bn_set_ith_bit",
"Prims.unit"
] | [] | false | true | false | false | false | let bn_set_ith_bit #t len input ind =
| Hacl.Bignum.Lib.bn_set_ith_bit len input ind | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_lt_mask | val bn_lt_mask: #t:limb_t -> len:size_t -> bn_lt_mask_st t len | val bn_lt_mask: #t:limb_t -> len:size_t -> bn_lt_mask_st t len | let bn_lt_mask #t len a b =
Hacl.Bignum.Comparison.bn_lt_mask len a b | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 43,
"end_line": 142,
"start_col": 0,
"start_line": 141
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | len: Lib.IntTypes.size_t -> Hacl.Bignum.bn_lt_mask_st t len | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Hacl.Bignum.Definitions.lbignum",
"Hacl.Bignum.Comparison.bn_lt_mask",
"Hacl.Bignum.Definitions.limb"
] | [] | false | false | false | false | false | let bn_lt_mask #t len a b =
| Hacl.Bignum.Comparison.bn_lt_mask len a b | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_reduce_once | val bn_reduce_once:
#t:limb_t
-> aLen:size_t{v aLen > 0}
-> n:lbignum t aLen
-> c:carry t
-> a:lbignum t aLen ->
Stack unit
(requires fun h -> live h a /\ live h n /\ disjoint a n)
(ensures fun h0 c_out h1 -> modifies (loc a) h0 h1 /\
as_seq h1 a == S.bn_reduce_once (as_seq h0 n) c (as_seq h0 a)) | val bn_reduce_once:
#t:limb_t
-> aLen:size_t{v aLen > 0}
-> n:lbignum t aLen
-> c:carry t
-> a:lbignum t aLen ->
Stack unit
(requires fun h -> live h a /\ live h n /\ disjoint a n)
(ensures fun h0 c_out h1 -> modifies (loc a) h0 h1 /\
as_seq h1 a == S.bn_reduce_once (as_seq h0 n) c (as_seq h0 a)) | let bn_reduce_once #t len n c0 res =
push_frame ();
let tmp = create len (uint #t 0) in
let c1 = bn_sub_eq_len len res n tmp in
let c = c0 -. c1 in
map2T len res (mask_select c) res tmp;
pop_frame() | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 13,
"end_line": 31,
"start_col": 0,
"start_line": 25
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
aLen: Lib.IntTypes.size_t{Lib.IntTypes.v aLen > 0} ->
n: Hacl.Bignum.Definitions.lbignum t aLen ->
c: Hacl.Spec.Bignum.Base.carry t ->
a: Hacl.Bignum.Definitions.lbignum t aLen
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_GreaterThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Bignum.Definitions.lbignum",
"Hacl.Spec.Bignum.Base.carry",
"FStar.HyperStack.ST.pop_frame",
"Prims.unit",
"Lib.Buffer.map2T",
"Lib.Bu... | [] | false | true | false | false | false | let bn_reduce_once #t len n c0 res =
| push_frame ();
let tmp = create len (uint #t 0) in
let c1 = bn_sub_eq_len len res n tmp in
let c = c0 -. c1 in
map2T len res (mask_select c) res tmp;
pop_frame () | false |
Hacl.Bignum.fst | Hacl.Bignum.mk_runtime_bn | val mk_runtime_bn: t:limb_t -> len:meta_len t -> bn t | val mk_runtime_bn: t:limb_t -> len:meta_len t -> bn t | let mk_runtime_bn (t:limb_t) (len:meta_len t) : bn t = {
len = len;
add = Hacl.Bignum.Addition.bn_add_eq_len_u len;
sub = Hacl.Bignum.Addition.bn_sub_eq_len_u len;
add_mod_n = bn_add_mod_n_ len;
sub_mod_n = bn_sub_mod_n_ len;
mul = bn_karatsuba_mul len;
sqr = bn_karatsuba_sqr len;
} | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 1,
"end_line": 126,
"start_col": 0,
"start_line": 118
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | t: Hacl.Bignum.Definitions.limb_t -> len: Hacl.Bignum.meta_len t -> Hacl.Bignum.bn t | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Hacl.Bignum.meta_len",
"Hacl.Bignum.Mkbn",
"Hacl.Bignum.Addition.bn_add_eq_len_u",
"Hacl.Bignum.Addition.bn_sub_eq_len_u",
"Hacl.Bignum.bn_add_mod_n_",
"Hacl.Bignum.bn_sub_mod_n_",
"Hacl.Bignum.bn_karatsuba_mul",
"Hacl.Bignum.bn_karatsuba_sqr",
"Hacl.Bignum.bn"
] | [] | false | false | false | false | false | let mk_runtime_bn (t: limb_t) (len: meta_len t) : bn t =
| {
len = len;
add = Hacl.Bignum.Addition.bn_add_eq_len_u len;
sub = Hacl.Bignum.Addition.bn_sub_eq_len_u len;
add_mod_n = bn_add_mod_n_ len;
sub_mod_n = bn_sub_mod_n_ len;
mul = bn_karatsuba_mul len;
sqr = bn_karatsuba_sqr len
} | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_is_zero_mask | val bn_is_zero_mask:
#t:limb_t
-> len:size_t{v len > 0}
-> a:lbignum t len ->
Stack (limb t)
(requires fun h -> live h a)
(ensures fun h0 r h1 -> modifies0 h0 h1 /\
r == S.bn_is_zero_mask (as_seq h0 a)) | val bn_is_zero_mask:
#t:limb_t
-> len:size_t{v len > 0}
-> a:lbignum t len ->
Stack (limb t)
(requires fun h -> live h a)
(ensures fun h0 r h1 -> modifies0 h0 h1 /\
r == S.bn_is_zero_mask (as_seq h0 a)) | let bn_is_zero_mask #t len b =
Hacl.Bignum.Comparison.bn_is_zero_mask len b | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 46,
"end_line": 139,
"start_col": 0,
"start_line": 138
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0} -> a: Hacl.Bignum.Definitions.lbignum t len
-> FStar.HyperStack.ST.Stack (Hacl.Bignum.Definitions.limb t) | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_GreaterThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Bignum.Definitions.lbignum",
"Hacl.Bignum.Comparison.bn_is_zero_mask",
"Hacl.Bignum.Definitions.limb"
] | [] | false | true | false | false | false | let bn_is_zero_mask #t len b =
| Hacl.Bignum.Comparison.bn_is_zero_mask len b | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_get_ith_bit | val bn_get_ith_bit:
#t:limb_t
-> len:size_t
-> b:lbignum t len
-> i:size_t{v i / bits t < v len} ->
Stack (limb t)
(requires fun h -> live h b)
(ensures fun h0 r h1 -> h0 == h1 /\
r == S.bn_get_ith_bit (as_seq h0 b) (v i)) | val bn_get_ith_bit:
#t:limb_t
-> len:size_t
-> b:lbignum t len
-> i:size_t{v i / bits t < v len} ->
Stack (limb t)
(requires fun h -> live h b)
(ensures fun h0 r h1 -> h0 == h1 /\
r == S.bn_get_ith_bit (as_seq h0 b) (v i)) | let bn_get_ith_bit #t len input ind =
Hacl.Bignum.Lib.bn_get_ith_bit len input ind | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 46,
"end_line": 84,
"start_col": 0,
"start_line": 83
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
len: Lib.IntTypes.size_t ->
b: Hacl.Bignum.Definitions.lbignum t len ->
i: Lib.IntTypes.size_t{Lib.IntTypes.v i / Lib.IntTypes.bits t < Lib.IntTypes.v len}
-> FStar.HyperStack.ST.Stack (Hacl.Bignum.Definitions.limb t) | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Hacl.Bignum.Definitions.lbignum",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.op_Division",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Lib.IntTypes.bits",
"Hacl.Bignum.Lib.bn_get_ith_bit",
"Hacl.Bignum.Definitions.limb"
] | [] | false | true | false | false | false | let bn_get_ith_bit #t len input ind =
| Hacl.Bignum.Lib.bn_get_ith_bit len input ind | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_lt_pow2_mask | val bn_lt_pow2_mask:
#t:limb_t
-> len:size_t{0 < v len /\ bits t * v len <= max_size_t}
-> b:lbignum t len
-> x:size_t{v x < bits t * v len} ->
Stack (limb t)
(requires fun h -> live h b)
(ensures fun h0 r h1 -> modifies0 h0 h1 /\
r == S.bn_lt_pow2_mask (as_seq h0 b) (v x)) | val bn_lt_pow2_mask:
#t:limb_t
-> len:size_t{0 < v len /\ bits t * v len <= max_size_t}
-> b:lbignum t len
-> x:size_t{v x < bits t * v len} ->
Stack (limb t)
(requires fun h -> live h b)
(ensures fun h0 r h1 -> modifies0 h0 h1 /\
r == S.bn_lt_pow2_mask (as_seq h0 b) (v x)) | let bn_lt_pow2_mask #t len b x =
Hacl.Bignum.Comparison.bn_lt_pow2_mask len b x | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 48,
"end_line": 145,
"start_col": 0,
"start_line": 144
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
len:
Lib.IntTypes.size_t
{ 0 < Lib.IntTypes.v len /\
Lib.IntTypes.bits t * Lib.IntTypes.v len <= Lib.IntTypes.max_size_t } ->
b: Hacl.Bignum.Definitions.lbignum t len ->
x: Lib.IntTypes.size_t{Lib.IntTypes.v x < Lib.IntTypes.bits t * Lib.IntTypes.v len}
-> FStar.HyperStack.ST.Stac... | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.bits",
"Lib.IntTypes.max_size_t",
"Hacl.Bignum.Definitions.lbignu... | [] | false | true | false | false | false | let bn_lt_pow2_mask #t len b x =
| Hacl.Bignum.Comparison.bn_lt_pow2_mask len b x | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_gt_pow2_mask | val bn_gt_pow2_mask:
#t:limb_t
-> len:size_t{0 < v len /\ bits t * v len <= max_size_t}
-> b:lbignum t len
-> x:size_t{v x < bits t * v len} ->
Stack (limb t)
(requires fun h -> live h b)
(ensures fun h0 r h1 -> modifies0 h0 h1 /\
r == S.bn_gt_pow2_mask (as_seq h0 b) (v x)) | val bn_gt_pow2_mask:
#t:limb_t
-> len:size_t{0 < v len /\ bits t * v len <= max_size_t}
-> b:lbignum t len
-> x:size_t{v x < bits t * v len} ->
Stack (limb t)
(requires fun h -> live h b)
(ensures fun h0 r h1 -> modifies0 h0 h1 /\
r == S.bn_gt_pow2_mask (as_seq h0 b) (v x)) | let bn_gt_pow2_mask #t len b x =
Hacl.Bignum.Comparison.bn_gt_pow2_mask len b x | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 48,
"end_line": 148,
"start_col": 0,
"start_line": 147
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
len:
Lib.IntTypes.size_t
{ 0 < Lib.IntTypes.v len /\
Lib.IntTypes.bits t * Lib.IntTypes.v len <= Lib.IntTypes.max_size_t } ->
b: Hacl.Bignum.Definitions.lbignum t len ->
x: Lib.IntTypes.size_t{Lib.IntTypes.v x < Lib.IntTypes.bits t * Lib.IntTypes.v len}
-> FStar.HyperStack.ST.Stac... | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.bits",
"Lib.IntTypes.max_size_t",
"Hacl.Bignum.Definitions.lbignu... | [] | false | true | false | false | false | let bn_gt_pow2_mask #t len b x =
| Hacl.Bignum.Comparison.bn_gt_pow2_mask len b x | false |
Hacl.Spec.FFDHE.Lemmas.fst | Hacl.Spec.FFDHE.Lemmas.pow2_lt_len | val pow2_lt_len: len:size_pos -> Lemma (pow2 (8 * len - 1) < pow2 (8 * (len - 1)) * (pow2 8 - 1)) | val pow2_lt_len: len:size_pos -> Lemma (pow2 (8 * len - 1) < pow2 (8 * (len - 1)) * (pow2 8 - 1)) | let pow2_lt_len len =
let a = pow2 (8 * len - 1) in
let b = pow2 (8 * (len - 1)) * (pow2 8 - 1) in
calc (==) {
b / a;
(==) { Math.Lemmas.pow2_plus (8 * len - 8) 7 }
b / (pow2 (8 * len - 8) * pow2 7);
(==) { Math.Lemmas.division_multiplication_lemma b (pow2 (8 * len - 8)) (pow2 7) }
b / pow2 (8... | {
"file_name": "code/ffdhe/Hacl.Spec.FFDHE.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 81,
"start_col": 0,
"start_line": 48
} | module Hacl.Spec.FFDHE.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.FFDHE
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val ffdhe_p_lemma_len: a:ffdhe_alg -> Lemma
(let ffdhe_p = get_ffdhe_params a in
let p = Mk_ffdhe_params?.ffdhe_p ffdhe_p in
Seq.index p 0 == 0... | {
"checked_file": "/",
"dependencies": [
"Spec.FFDHE.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.... | [
{
"abbrev": false,
"full_module": "Spec.FFDHE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "L... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | len: Lib.IntTypes.size_pos
-> FStar.Pervasives.Lemma
(ensures Prims.pow2 (8 * len - 1) < Prims.pow2 (8 * (len - 1)) * (Prims.pow2 8 - 1)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Lib.IntTypes.size_pos",
"Prims._assert",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.unit",
"FStar.Calc.calc_finish",
"Prims.int",
"Prims.op_GreaterThan",
"Prims.op_Modulus",
"FStar.Mul.op_Star",
"Prims.pow2",
"Prims.op_Subtraction",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.eq2",
... | [] | false | false | true | false | false | let pow2_lt_len len =
| let a = pow2 (8 * len - 1) in
let b = pow2 (8 * (len - 1)) * (pow2 8 - 1) in
calc ( == ) {
b / a;
( == ) { Math.Lemmas.pow2_plus (8 * len - 8) 7 }
b / (pow2 (8 * len - 8) * pow2 7);
( == ) { Math.Lemmas.division_multiplication_lemma b (pow2 (8 * len - 8)) (pow2 7) }
b / pow2 (8 * len - 8) / pow2 7;
( == ) {... | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_from_uint | val bn_from_uint:
#t:limb_t
-> len:size_t{0 < v len}
-> x:limb t
-> b:lbignum t len ->
Stack unit
(requires fun h -> live h b)
(ensures fun h0 _ h1 -> modifies (loc b) h0 h1 /\
as_seq h1 b == S.bn_from_uint (v len) x) | val bn_from_uint:
#t:limb_t
-> len:size_t{0 < v len}
-> x:limb t
-> b:lbignum t len ->
Stack unit
(requires fun h -> live h b)
(ensures fun h0 _ h1 -> modifies (loc b) h0 h1 /\
as_seq h1 b == S.bn_from_uint (v len) x) | let bn_from_uint #t len x b =
Hacl.Bignum.Convert.bn_from_uint len x b | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 42,
"end_line": 153,
"start_col": 0,
"start_line": 152
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
len: Lib.IntTypes.size_t{0 < Lib.IntTypes.v len} ->
x: Hacl.Bignum.Definitions.limb t ->
b: Hacl.Bignum.Definitions.lbignum t len
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Bignum.Definitions.limb",
"Hacl.Bignum.Definitions.lbignum",
"Hacl.Bignum.Convert.bn_from_uint",
"Prims.unit"
] | [] | false | true | false | false | false | let bn_from_uint #t len x b =
| Hacl.Bignum.Convert.bn_from_uint len x b | false |
Hacl.Impl.Ed25519.Ladder.fst | Hacl.Impl.Ed25519.Ladder.point_mul_g_double_vartime_aux | val point_mul_g_double_vartime_aux:
out:point
-> scalar1:lbuffer uint8 32ul -> q1:point
-> scalar2:lbuffer uint8 32ul -> q2:point
-> bscalar1:lbuffer uint64 4ul
-> bscalar2:lbuffer uint64 4ul ->
Stack unit
(requires fun h ->
live h out /\ live h scalar1 /\ live h q1 /\
live h scalar2 /\ live h q... | val point_mul_g_double_vartime_aux:
out:point
-> scalar1:lbuffer uint8 32ul -> q1:point
-> scalar2:lbuffer uint8 32ul -> q2:point
-> bscalar1:lbuffer uint64 4ul
-> bscalar2:lbuffer uint64 4ul ->
Stack unit
(requires fun h ->
live h out /\ live h scalar1 /\ live h q1 /\
live h scalar2 /\ live h q... | let point_mul_g_double_vartime_aux out scalar1 q1 scalar2 q2 bscalar1 bscalar2 =
let h0 = ST.get () in
convert_scalar scalar1 bscalar1;
convert_scalar scalar2 bscalar2;
let h1 = ST.get () in
assert (BD.bn_v h1 bscalar1 == BSeq.nat_from_bytes_le (as_seq h0 scalar1));
assert (BD.bn_v h1 bscalar2 == BSeq.nat_f... | {
"file_name": "code/ed25519/Hacl.Impl.Ed25519.Ladder.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 62,
"end_line": 374,
"start_col": 0,
"start_line": 367
} | module Hacl.Impl.Ed25519.Ladder
module ST = FStar.HyperStack.ST
open FStar.HyperStack.All
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Hacl.Bignum25519
module F51 = Hacl.Impl.Ed25519.Field51
module BSeq = Lib.ByteSequence
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module BE = Hacl.Impl... | {
"checked_file": "/",
"dependencies": [
"Spec.Exponentiation.fsti.checked",
"Spec.Ed25519.Lemmas.fsti.checked",
"Spec.Ed25519.fst.checked",
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.ByteSequence.fsti.chec... | [
{
"abbrev": false,
"full_module": "Hacl.Ed25519.PrecompTable",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Ed25519.Group",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Ed25519.PointConstants",
"short_module": null
},
{
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
out: Hacl.Bignum25519.point ->
scalar1: Lib.Buffer.lbuffer Lib.IntTypes.uint8 32ul ->
q1: Hacl.Bignum25519.point ->
scalar2: Lib.Buffer.lbuffer Lib.IntTypes.uint8 32ul ->
q2: Hacl.Bignum25519.point ->
bscalar1: Lib.Buffer.lbuffer Lib.IntTypes.uint64 4ul ->
bscalar2: Lib.Buffer.lbuffer Lib.I... | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Bignum25519.point",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"FStar.UInt32.__uint_to_t",
"Lib.IntTypes.uint64",
"Hacl.Impl.Ed25519.Ladder.point_mul_g_double_vartime_table",
"Prims.unit",
"Prims._assert",
"Prims.eq2",
"Prims.nat",
"Hacl.Bignum.Definitions.bn_v",
"Lib.IntTypes.U64",
"... | [] | false | true | false | false | false | let point_mul_g_double_vartime_aux out scalar1 q1 scalar2 q2 bscalar1 bscalar2 =
| let h0 = ST.get () in
convert_scalar scalar1 bscalar1;
convert_scalar scalar2 bscalar2;
let h1 = ST.get () in
assert (BD.bn_v h1 bscalar1 == BSeq.nat_from_bytes_le (as_seq h0 scalar1));
assert (BD.bn_v h1 bscalar2 == BSeq.nat_from_bytes_le (as_seq h0 scalar2));
point_mul_g_double_vartime_table out bscalar1 q1 bscalar2 ... | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_sub_mod_n | val bn_sub_mod_n: #t:limb_t -> len:size_t{v len > 0} -> bn_sub_mod_n_st t len | val bn_sub_mod_n: #t:limb_t -> len:size_t{v len > 0} -> bn_sub_mod_n_st t len | let bn_sub_mod_n #t len n a b res =
push_frame ();
let c0 = bn_sub_eq_len len a b res in
let tmp = create len (uint #t 0) in
let c1 = bn_add_eq_len len res n tmp in
LowStar.Ignore.ignore c1;
let c = uint #t 0 -. c0 in
map2T len res (mask_select c) tmp res;
pop_frame () | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 14,
"end_line": 45,
"start_col": 0,
"start_line": 37
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0} -> Hacl.Bignum.bn_sub_mod_n_st t len | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_GreaterThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Bignum.Definitions.lbignum",
"FStar.HyperStack.ST.pop_frame",
"Prims.unit",
"Lib.Buffer.map2T",
"Lib.Buffer.MUT",
"Hacl.Bignum.Definit... | [] | false | false | false | false | false | let bn_sub_mod_n #t len n a b res =
| push_frame ();
let c0 = bn_sub_eq_len len a b res in
let tmp = create len (uint #t 0) in
let c1 = bn_add_eq_len len res n tmp in
LowStar.Ignore.ignore c1;
let c = uint #t 0 -. c0 in
map2T len res (mask_select c) tmp res;
pop_frame () | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_to_bytes_le | val bn_to_bytes_le:
#t:limb_t
-> len:size_t{0 < v len /\ numbytes t * v (blocks len (size (numbytes t))) <= max_size_t}
-> b:lbignum t (blocks len (size (numbytes t)))
-> res:lbuffer uint8 len ->
Stack unit
(requires fun h -> live h b /\ live h res /\ disjoint res b)
(ensures fun h0 _ h1 -> modifies (l... | val bn_to_bytes_le:
#t:limb_t
-> len:size_t{0 < v len /\ numbytes t * v (blocks len (size (numbytes t))) <= max_size_t}
-> b:lbignum t (blocks len (size (numbytes t)))
-> res:lbuffer uint8 len ->
Stack unit
(requires fun h -> live h b /\ live h res /\ disjoint res b)
(ensures fun h0 _ h1 -> modifies (l... | let bn_to_bytes_le #t len b res =
Hacl.Bignum.Convert.bn_to_bytes_le len b res | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 46,
"end_line": 165,
"start_col": 0,
"start_line": 164
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
len:
Lib.IntTypes.size_t
{ 0 < Lib.IntTypes.v len /\
Lib.IntTypes.numbytes t *
Lib.IntTypes.v (Hacl.Bignum.Definitions.blocks len
(Lib.IntTypes.size (Lib.IntTypes.numbytes t))) <=
Lib.IntTypes.max_size_t } ->
b:
Hacl.Bignum.Definitions.lbignum t... | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.numbytes",
"Hacl.Bignum.Definitions.blocks",
"Lib.IntTypes.size",... | [] | false | true | false | false | false | let bn_to_bytes_le #t len b res =
| Hacl.Bignum.Convert.bn_to_bytes_le len b res | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_from_bytes_be | val bn_from_bytes_be:
#t:limb_t
-> len:size_t{0 < v len /\ numbytes t * v (blocks len (size (numbytes t))) <= max_size_t}
-> b:lbuffer uint8 len
-> res:lbignum t (blocks len (size (numbytes t))) ->
Stack unit
(requires fun h -> live h b /\ live h res /\ disjoint res b)
(ensures fun h0 _ h1 -> modifies ... | val bn_from_bytes_be:
#t:limb_t
-> len:size_t{0 < v len /\ numbytes t * v (blocks len (size (numbytes t))) <= max_size_t}
-> b:lbuffer uint8 len
-> res:lbignum t (blocks len (size (numbytes t))) ->
Stack unit
(requires fun h -> live h b /\ live h res /\ disjoint res b)
(ensures fun h0 _ h1 -> modifies ... | let bn_from_bytes_be #t len b res =
Hacl.Bignum.Convert.bn_from_bytes_be len b res | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 48,
"end_line": 156,
"start_col": 0,
"start_line": 155
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
len:
Lib.IntTypes.size_t
{ 0 < Lib.IntTypes.v len /\
Lib.IntTypes.numbytes t *
Lib.IntTypes.v (Hacl.Bignum.Definitions.blocks len
(Lib.IntTypes.size (Lib.IntTypes.numbytes t))) <=
Lib.IntTypes.max_size_t } ->
b: Lib.Buffer.lbuffer Lib.IntTypes.uint8 l... | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.numbytes",
"Hacl.Bignum.Definitions.blocks",
"Lib.IntTypes.size",... | [] | false | true | false | false | false | let bn_from_bytes_be #t len b res =
| Hacl.Bignum.Convert.bn_from_bytes_be len b res | false |
Hacl.Bignum.fst | Hacl.Bignum.bn_to_bytes_be | val bn_to_bytes_be:
#t:limb_t
-> len:size_t{0 < v len /\ numbytes t * v (blocks len (size (numbytes t))) <= max_size_t}
-> b:lbignum t (blocks len (size (numbytes t)))
-> res:lbuffer uint8 len ->
Stack unit
(requires fun h -> live h b /\ live h res /\ disjoint res b)
(ensures fun h0 _ h1 -> modifies (l... | val bn_to_bytes_be:
#t:limb_t
-> len:size_t{0 < v len /\ numbytes t * v (blocks len (size (numbytes t))) <= max_size_t}
-> b:lbignum t (blocks len (size (numbytes t)))
-> res:lbuffer uint8 len ->
Stack unit
(requires fun h -> live h b /\ live h res /\ disjoint res b)
(ensures fun h0 _ h1 -> modifies (l... | let bn_to_bytes_be #t len b res =
Hacl.Bignum.Convert.bn_to_bytes_be len b res | {
"file_name": "code/bignum/Hacl.Bignum.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 46,
"end_line": 159,
"start_col": 0,
"start_line": 158
} | module Hacl.Bignum
friend Hacl.Spec.Bignum
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_add1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_add1 aLen a b1 res
let bn_sub1 #t aLen a b1 res =
Hacl.Bignum.Addition.bn_sub1 aLen a b1 res
let bn_add_eq_len #t aLen a b res =
Hacl.Bignum.Addition.bn_add_eq_l... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Ignore.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Hacl.Spec.Bignum.fst.checked",
"Hacl.Bignum.Multiplication.fst.checked",
"Hacl.Bignum.Lib.fst.checked",
"Hacl.Bignum.Karatsuba.fst.checked",
"Hacl.Bignum.Conve... | [
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "S"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
len:
Lib.IntTypes.size_t
{ 0 < Lib.IntTypes.v len /\
Lib.IntTypes.numbytes t *
Lib.IntTypes.v (Hacl.Bignum.Definitions.blocks len
(Lib.IntTypes.size (Lib.IntTypes.numbytes t))) <=
Lib.IntTypes.max_size_t } ->
b:
Hacl.Bignum.Definitions.lbignum t... | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.numbytes",
"Hacl.Bignum.Definitions.blocks",
"Lib.IntTypes.size",... | [] | false | true | false | false | false | let bn_to_bytes_be #t len b res =
| Hacl.Bignum.Convert.bn_to_bytes_be len b res | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.