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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Vale.Poly1305.Util.fsti | Vale.Poly1305.Util.seqTo128 | val seqTo128 (s: Seq.seq nat64) : t_seqTo128 | val seqTo128 (s: Seq.seq nat64) : t_seqTo128 | let seqTo128 (s:Seq.seq nat64) : t_seqTo128 =
let f (i:int) : nat128 =
if 0 <= i && i < Seq.length s / 2 then
(Seq.index s (2 * i)) + 0x10000000000000000 * (Seq.index s (2 * i + 1))
else
42
in f | {
"file_name": "vale/code/crypto/poly1305/x64/Vale.Poly1305.Util.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 6,
"end_line": 36,
"start_col": 0,
"start_line": 30
} | module Vale.Poly1305.Util
open FStar.Mul
open Vale.Def.Prop_s
open Vale.Def.Opaque_s
open Vale.Poly1305.Spec_s
open Vale.X64.Machine_s
open Vale.Poly1305.Math
open Vale.X64.State
open Vale.X64.Decls
open Vale.Def.Opaque_s
open Vale.X64.Memory
let rec poly1305_heap_blocks'
(h:int) (pad:int) (r:int) (s:Seq.seq nat6... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Poly1305.Spec_s.fst.checked",
"Vale.Poly1305.Math.fsti.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Def.Opa... | [
{
"abbrev": false,
"full_module": "Vale.X64.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Opaque_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Decls",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: FStar.Seq.Base.seq Vale.X64.Memory.nat64 -> Vale.Poly1305.Util.t_seqTo128 | Prims.Tot | [
"total"
] | [] | [
"FStar.Seq.Base.seq",
"Vale.X64.Memory.nat64",
"Prims.int",
"Vale.Def.Words_s.nat128",
"Prims.op_AmpAmp",
"Prims.op_LessThanOrEqual",
"Prims.op_LessThan",
"Prims.op_Division",
"FStar.Seq.Base.length",
"Prims.op_Addition",
"FStar.Seq.Base.index",
"FStar.Mul.op_Star",
"Prims.bool",
"Vale.X64... | [] | false | false | false | true | false | let seqTo128 (s: Seq.seq nat64) : t_seqTo128 =
| let f (i: int) : nat128 =
if 0 <= i && i < Seq.length s / 2
then (Seq.index s (2 * i)) + 0x10000000000000000 * (Seq.index s (2 * i + 1))
else 42
in
f | false |
Hacl.Spec.Bignum.ModInvLimb.fst | Hacl.Spec.Bignum.ModInvLimb.mod_inv_limb_f | val mod_inv_limb_f:
#t:limb_t
-> alpha:limb t
-> beta:limb t
-> i:nat{i < bits t}
-> tuple2 (limb t) (limb t) ->
tuple2 (limb t) (limb t) | val mod_inv_limb_f:
#t:limb_t
-> alpha:limb t
-> beta:limb t
-> i:nat{i < bits t}
-> tuple2 (limb t) (limb t) ->
tuple2 (limb t) (limb t) | let mod_inv_limb_f #t alpha beta i (ub, vb) =
let u_is_odd = uint #t 0 -. (ub &. uint #t 1) in
let beta_if_u_is_odd = beta &. u_is_odd in
let u = ((ub ^. beta_if_u_is_odd) >>. 1ul) +. (ub &. beta_if_u_is_odd) in
let alpha_if_u_is_odd = alpha &. u_is_odd in
let v = (vb >>. 1ul) +. alpha_if_u_is_odd in
(u, v... | {
"file_name": "code/bignum/Hacl.Spec.Bignum.ModInvLimb.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 8,
"end_line": 32,
"start_col": 0,
"start_line": 25
} | module Hacl.Spec.Bignum.ModInvLimb
open FStar.Mul
open Lib.IntTypes
open Lib.LoopCombinators
open Hacl.Spec.Bignum.Definitions
module M = Hacl.Spec.Montgomery.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
the modular inverse function was taken from
https://github.com/google/boringssl/blob/master/cry... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Perva... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abb... | {
"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 |
alpha: Hacl.Spec.Bignum.Definitions.limb t ->
beta: Hacl.Spec.Bignum.Definitions.limb t ->
i: Prims.nat{i < Lib.IntTypes.bits t} ->
_: (Hacl.Spec.Bignum.Definitions.limb t * Hacl.Spec.Bignum.Definitions.limb t)
-> Hacl.Spec.Bignum.Definitions.limb t * Hacl.Spec.Bignum.Definitions.limb t | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.Definitions.limb",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.bits",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.Mktuple2",
"Lib.IntTypes.int_t",
"Lib.IntTypes.SEC",
"Lib.IntTypes.op_Plus_Dot",
"Lib.IntTy... | [] | false | false | false | false | false | let mod_inv_limb_f #t alpha beta i (ub, vb) =
| let u_is_odd = uint #t 0 -. (ub &. uint #t 1) in
let beta_if_u_is_odd = beta &. u_is_odd in
let u = ((ub ^. beta_if_u_is_odd) >>. 1ul) +. (ub &. beta_if_u_is_odd) in
let alpha_if_u_is_odd = alpha &. u_is_odd in
let v = (vb >>. 1ul) +. alpha_if_u_is_odd in
(u, v) | false |
Hacl.Impl.PrecompTable.fsti | Hacl.Impl.PrecompTable.lprecomp_get_st | val lprecomp_get_st : a_t: Hacl.Impl.Exponentiation.Definitions.inttype_a ->
len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0} ->
ctx_len: Lib.IntTypes.size_t ->
k: Hacl.Impl.Exponentiation.Definitions.concrete_ops a_t len ctx_len
-> Type0 | let lprecomp_get_st
(a_t:inttype_a)
(len:size_t{v len > 0})
(ctx_len:size_t)
(k:concrete_ops a_t len ctx_len) =
a:Ghost.erased (LSeq.lseq (uint_t a_t SEC) (v len))
-> table_len:size_t{1 < v table_len /\ v table_len * v len <= max_size_t}
-> table:clbuffer (uint_t a_t SEC) (table_len *! len)
-> bits_l:... | {
"file_name": "code/bignum/Hacl.Impl.PrecompTable.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 81,
"end_line": 111,
"start_col": 0,
"start_line": 93
} | module Hacl.Impl.PrecompTable
open FStar.Mul
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 S = Lib.Exponentiation.Definition
module BD = Hacl.Bignum.Definitions
include Hacl.Impl.Exponentiation.Defi... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.Definition.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.Exponentiation.Definitions.fst.checked",
"Hacl.Bignum.Definitions.fst.checked",
... | [
{
"abbrev": true,
"full_module": "Lib.Exponentiation.Definition",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.PrecompTable",
"short_module": "PT"
},
{
"abbrev": true,
"full_module": "Hacl.Bignum.Definitions",
"short_module": "BD"
},
{
"abbre... | {
"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_t: Hacl.Impl.Exponentiation.Definitions.inttype_a ->
len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0} ->
ctx_len: Lib.IntTypes.size_t ->
k: Hacl.Impl.Exponentiation.Definitions.concrete_ops a_t len ctx_len
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Exponentiation.Definitions.inttype_a",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_GreaterThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Impl.Exponentiation.Definitions.concrete_ops",
"FStar.Ghost.erased",
"Lib.Sequence.lseq",
"Lib.IntTypes.uint_t",
"Lib.In... | [] | false | false | false | false | true | let lprecomp_get_st
(a_t: inttype_a)
(len: size_t{v len > 0})
(ctx_len: size_t)
(k: concrete_ops a_t len ctx_len)
=
|
a: Ghost.erased (LSeq.lseq (uint_t a_t SEC) (v len)) ->
table_len: size_t{1 < v table_len /\ v table_len * v len <= max_size_t} ->
table: clbuffer (uint_t a_t SEC) (table_len *! len) ->
bits_l: uint_t a_t SEC {v bits_l < v table_len} ->
tmp: lbuffer (uint_t a_t SEC) len
-> Stack unit
(requi... | false | |
Hacl.Spec.Bignum.ModInvLimb.fst | Hacl.Spec.Bignum.ModInvLimb.mod_inv_limb | val mod_inv_limb: #t:limb_t -> n0:limb t -> limb t | val mod_inv_limb: #t:limb_t -> n0:limb t -> limb t | let mod_inv_limb #t n0 =
let alpha = uint #t 1 <<. size (bits t - 1) in
let beta = n0 in
let (u, v) = repeat_gen (bits t) (mod_inv_limb_t t) (mod_inv_limb_f alpha beta) (uint #t 1, uint #t 0) in
v | {
"file_name": "code/bignum/Hacl.Spec.Bignum.ModInvLimb.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 40,
"start_col": 0,
"start_line": 36
} | module Hacl.Spec.Bignum.ModInvLimb
open FStar.Mul
open Lib.IntTypes
open Lib.LoopCombinators
open Hacl.Spec.Bignum.Definitions
module M = Hacl.Spec.Montgomery.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
the modular inverse function was taken from
https://github.com/google/boringssl/blob/master/cry... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Perva... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abb... | {
"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 | n0: Hacl.Spec.Bignum.Definitions.limb t -> Hacl.Spec.Bignum.Definitions.limb t | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.Definitions.limb",
"Hacl.Spec.Bignum.ModInvLimb.mod_inv_limb_t",
"Lib.IntTypes.bits",
"Lib.LoopCombinators.repeat_gen",
"Hacl.Spec.Bignum.ModInvLimb.mod_inv_limb_f",
"FStar.Pervasives.Native.Mktuple2",
"Lib.IntTypes.uint",
"Lib.IntTypes.SEC",
... | [] | false | false | false | false | false | let mod_inv_limb #t n0 =
| let alpha = uint #t 1 <<. size (bits t - 1) in
let beta = n0 in
let u, v =
repeat_gen (bits t) (mod_inv_limb_t t) (mod_inv_limb_f alpha beta) (uint #t 1, uint #t 0)
in
v | false |
Hacl.Impl.PrecompTable.fsti | Hacl.Impl.PrecompTable.precomp_table_inv | val precomp_table_inv
(#a_t: inttype_a)
(len: size_t{v len > 0})
(ctx_len: size_t)
(k: concrete_ops a_t len ctx_len)
(a: LSeq.lseq (uint_t a_t SEC) (v len))
(table_len: size_t{v table_len * v len <= max_size_t})
(table: LSeq.lseq (uint_t a_t SEC) (v table_len * v len))
(j... | val precomp_table_inv
(#a_t: inttype_a)
(len: size_t{v len > 0})
(ctx_len: size_t)
(k: concrete_ops a_t len ctx_len)
(a: LSeq.lseq (uint_t a_t SEC) (v len))
(table_len: size_t{v table_len * v len <= max_size_t})
(table: LSeq.lseq (uint_t a_t SEC) (v table_len * v len))
(j... | let precomp_table_inv
(#a_t:inttype_a)
(len:size_t{v len > 0})
(ctx_len:size_t)
(k:concrete_ops a_t len ctx_len)
(a:LSeq.lseq (uint_t a_t SEC) (v len))
(table_len:size_t{v table_len * v len <= max_size_t})
(table:LSeq.lseq (uint_t a_t SEC) (v table_len * v len))
(j:nat{j < v table_len}) : Type0
=
let... | {
"file_name": "code/bignum/Hacl.Impl.PrecompTable.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 56,
"end_line": 68,
"start_col": 0,
"start_line": 56
} | module Hacl.Impl.PrecompTable
open FStar.Mul
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 S = Lib.Exponentiation.Definition
module BD = Hacl.Bignum.Definitions
include Hacl.Impl.Exponentiation.Defi... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.Definition.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.Exponentiation.Definitions.fst.checked",
"Hacl.Bignum.Definitions.fst.checked",
... | [
{
"abbrev": true,
"full_module": "Lib.Exponentiation.Definition",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.PrecompTable",
"short_module": "PT"
},
{
"abbrev": true,
"full_module": "Hacl.Bignum.Definitions",
"short_module": "BD"
},
{
"abbre... | {
"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} ->
ctx_len: Lib.IntTypes.size_t ->
k: Hacl.Impl.Exponentiation.Definitions.concrete_ops a_t len ctx_len ->
a: Lib.Sequence.lseq (Lib.IntTypes.uint_t a_t Lib.IntTypes.SEC) (Lib.IntTypes.v len) ->
table_len:
Lib.IntTypes.size_t{Lib.IntTypes.v tab... | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Exponentiation.Definitions.inttype_a",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_GreaterThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Impl.Exponentiation.Definitions.concrete_ops",
"Lib.Sequence.lseq",
"Lib.IntTypes.uint_t",
"Lib.IntTypes.SEC",
"Prims.op... | [] | false | false | false | false | true | let precomp_table_inv
(#a_t: inttype_a)
(len: size_t{v len > 0})
(ctx_len: size_t)
(k: concrete_ops a_t len ctx_len)
(a: LSeq.lseq (uint_t a_t SEC) (v len))
(table_len: size_t{v table_len * v len <= max_size_t})
(table: LSeq.lseq (uint_t a_t SEC) (v table_len * v len))
(j... | let bj = spec_table_sub_len (v len) (v table_len) table j in
k.to.linv bj /\ k.to.linv a /\ k.to.refl bj == S.pow k.to.comm_monoid (k.to.refl a) j | false |
Hacl.Impl.PrecompTable.fsti | Hacl.Impl.PrecompTable.spec_table_sub_len | val spec_table_sub_len
(#t: BD.limb_t)
(len: pos)
(table_len: size_nat{table_len * len <= max_size_t})
(table: LSeq.lseq (uint_t t SEC) (table_len * len))
(i: nat{i < table_len})
: LSeq.lseq (uint_t t SEC) len | val spec_table_sub_len
(#t: BD.limb_t)
(len: pos)
(table_len: size_nat{table_len * len <= max_size_t})
(table: LSeq.lseq (uint_t t SEC) (table_len * len))
(i: nat{i < table_len})
: LSeq.lseq (uint_t t SEC) len | let spec_table_sub_len
(#t:BD.limb_t)
(len:pos)
(table_len:size_nat{table_len * len <= max_size_t})
(table:LSeq.lseq (uint_t t SEC) (table_len * len))
(i:nat{i < table_len}) : LSeq.lseq (uint_t t SEC) len =
lemma_table_sub_len len table_len i;
LSeq.sub table (i * len) len | {
"file_name": "code/bignum/Hacl.Impl.PrecompTable.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 30,
"end_line": 34,
"start_col": 0,
"start_line": 26
} | module Hacl.Impl.PrecompTable
open FStar.Mul
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 S = Lib.Exponentiation.Definition
module BD = Hacl.Bignum.Definitions
include Hacl.Impl.Exponentiation.Defi... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.Definition.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.Exponentiation.Definitions.fst.checked",
"Hacl.Bignum.Definitions.fst.checked",
... | [
{
"abbrev": true,
"full_module": "Lib.Exponentiation.Definition",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.PrecompTable",
"short_module": "PT"
},
{
"abbrev": true,
"full_module": "Hacl.Bignum.Definitions",
"short_module": "BD"
},
{
"abbre... | {
"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: Prims.pos ->
table_len: Lib.IntTypes.size_nat{table_len * len <= Lib.IntTypes.max_size_t} ->
table: Lib.Sequence.lseq (Lib.IntTypes.uint_t t Lib.IntTypes.SEC) (table_len * len) ->
i: Prims.nat{i < table_len}
-> Lib.Sequence.lseq (Lib.IntTypes.uint_t t Lib.IntTypes.SEC) len | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Prims.pos",
"Lib.IntTypes.size_nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.max_size_t",
"Lib.Sequence.lseq",
"Lib.IntTypes.uint_t",
"Lib.IntTypes.SEC",
"Prims.nat",
"Prims.op_LessThan",
"Lib.Sequence.sub",
"Prims.unit... | [] | false | false | false | false | false | let spec_table_sub_len
(#t: BD.limb_t)
(len: pos)
(table_len: size_nat{table_len * len <= max_size_t})
(table: LSeq.lseq (uint_t t SEC) (table_len * len))
(i: nat{i < table_len})
: LSeq.lseq (uint_t t SEC) len =
| lemma_table_sub_len len table_len i;
LSeq.sub table (i * len) len | false |
Hacl.Impl.Chacha20.Core32.fst | Hacl.Impl.Chacha20.Core32.state | val state : Type0 | let state = lbuffer uint32 16ul | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Core32.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 31,
"end_line": 15,
"start_col": 0,
"start_line": 15
} | module Hacl.Impl.Chacha20.Core32
open FStar.HyperStack
open FStar.HyperStack.All
open Lib.IntTypes
open Lib.Sequence
open Lib.Buffer
open Lib.ByteBuffer
module ST = FStar.HyperStack.ST
module Spec = Spec.Chacha20 | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.... | [
{
"abbrev": true,
"full_module": "Spec.Chacha20",
"short_module": "Spec"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint32",
"FStar.UInt32.__uint_to_t"
] | [] | false | false | false | true | true | let state =
| lbuffer uint32 16ul | false | |
Hacl.Impl.Chacha20.Core32.fst | Hacl.Impl.Chacha20.Core32.index | val index : Type0 | let index = i:size_t{size_v i < 16} | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Core32.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 35,
"end_line": 16,
"start_col": 0,
"start_line": 16
} | module Hacl.Impl.Chacha20.Core32
open FStar.HyperStack
open FStar.HyperStack.All
open Lib.IntTypes
open Lib.Sequence
open Lib.Buffer
open Lib.ByteBuffer
module ST = FStar.HyperStack.ST
module Spec = Spec.Chacha20 | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.... | [
{
"abbrev": true,
"full_module": "Spec.Chacha20",
"short_module": "Spec"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.size_v"
] | [] | false | false | false | true | true | let index =
| i: size_t{size_v i < 16} | false | |
Hacl.Spec.Bignum.ModInvLimb.fst | Hacl.Spec.Bignum.ModInvLimb.x_if_u_is_odd | val x_if_u_is_odd: #t:limb_t -> x:limb t -> u:limb t ->
Lemma (let u_is_odd = uint #t 0 -. (u &. uint #t 1) in
v (x &. u_is_odd) == (if v u % 2 = 0 then 0 else v x)) | val x_if_u_is_odd: #t:limb_t -> x:limb t -> u:limb t ->
Lemma (let u_is_odd = uint #t 0 -. (u &. uint #t 1) in
v (x &. u_is_odd) == (if v u % 2 = 0 then 0 else v x)) | let x_if_u_is_odd #t x u =
let u_is_odd = uint #t 0 -. (u &. uint #t 1) in
logand_mask u (uint #t 1) 1;
assert (v (u &. uint #t 1) == v u % 2);
assert (v u_is_odd == (- v u % 2) % pow2 (bits t));
assert (v u_is_odd == (if v u % 2 = 0 then 0 else pow2 (bits t) - 1));
if v u % 2 = 0 then
logand_zeros x
... | {
"file_name": "code/bignum/Hacl.Spec.Bignum.ModInvLimb.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 17,
"end_line": 62,
"start_col": 0,
"start_line": 53
} | module Hacl.Spec.Bignum.ModInvLimb
open FStar.Mul
open Lib.IntTypes
open Lib.LoopCombinators
open Hacl.Spec.Bignum.Definitions
module M = Hacl.Spec.Montgomery.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
the modular inverse function was taken from
https://github.com/google/boringssl/blob/master/cry... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Perva... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abb... | {
"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: Hacl.Spec.Bignum.Definitions.limb t -> u51: Hacl.Spec.Bignum.Definitions.limb t
-> FStar.Pervasives.Lemma
(ensures
(let u_is_odd = Lib.IntTypes.uint 0 -. (u51 &. Lib.IntTypes.uint 1) in
Lib.IntTypes.v (x &. u_is_odd) ==
(match Lib.IntTypes.v u51 % 2 = 0 with
| true -> 0
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.Definitions.limb",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Lib.IntTypes.v",
"Lib.IntTypes.SEC",
"Lib.IntTypes.logand_zeros",
"Prims.bool",
"Lib.IntTypes.logand_ones",
"Prims.unit",
"Prims._assert",
"Prims.eq2",
"Prims.... | [] | false | false | true | false | false | let x_if_u_is_odd #t x u =
| let u_is_odd = uint #t 0 -. (u &. uint #t 1) in
logand_mask u (uint #t 1) 1;
assert (v (u &. uint #t 1) == v u % 2);
assert (v u_is_odd == (- v u % 2) % pow2 (bits t));
assert (v u_is_odd == (if v u % 2 = 0 then 0 else pow2 (bits t) - 1));
if v u % 2 = 0 then logand_zeros x else logand_ones x | false |
Steel.ST.GenElim1.fst | Steel.ST.GenElim1.gen_elim' | val gen_elim'
(#opened: _)
(enable_nondep_opt: bool)
(p: vprop)
(a: Type)
(q: Ghost.erased a -> Tot vprop)
(post: Ghost.erased a -> Tot prop)
(sq: squash (gen_elim_prop_placeholder enable_nondep_opt p a q post))
(_: unit)
: STGhost (Ghost.erased a) opened p (fun x -> guard_vprop (q x)) (gen_elim_prop en... | val gen_elim'
(#opened: _)
(enable_nondep_opt: bool)
(p: vprop)
(a: Type)
(q: Ghost.erased a -> Tot vprop)
(post: Ghost.erased a -> Tot prop)
(sq: squash (gen_elim_prop_placeholder enable_nondep_opt p a q post))
(_: unit)
: STGhost (Ghost.erased a) opened p (fun x -> guard_vprop (q x)) (gen_elim_prop en... | let gen_elim'
#opened enable_nondep_opt p a q post _ ()
=
let (i, j) = gen_elim_prop_elim enable_nondep_opt p a q post in
rewrite p (compute_gen_elim_p i);
let res' = compute_gen_elim_nondep_correct i j () _ in
let res : Ghost.erased a = Ghost.hide (coerce_with_smt (Ghost.reveal res')) in
rewrite (compute_g... | {
"file_name": "lib/steel/Steel.ST.GenElim1.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 5,
"end_line": 839,
"start_col": 0,
"start_line": 831
} | module Steel.ST.GenElim1
let gen_elim_f
(p: vprop)
(a: Type)
(q: (a -> vprop))
(post: (a -> prop))
: Tot Type
= ((opened: inames) -> STGhost a opened p q True post)
module U = FStar.Universe
let gen_unit_elim_t (i: gen_unit_elim_i) : Tot Type =
gen_elim_f (compute_gen_unit_elim_p i) (U.raise_t u#_ u#1 unit... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Steel.ST.GenElim1.f... | [
{
"abbrev": true,
"full_module": "FStar.Universe",
"short_module": "U"
},
{
"abbrev": true,
"full_module": "FStar.Tactics",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim1.Base",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"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 |
enable_nondep_opt: Prims.bool ->
p: Steel.Effect.Common.vprop ->
a: Type ->
q: (_: FStar.Ghost.erased a -> Steel.Effect.Common.vprop) ->
post: (_: FStar.Ghost.erased a -> Prims.prop) ->
sq: Prims.squash (Steel.ST.GenElim1.Base.gen_elim_prop_placeholder enable_nondep_opt p a q post) ->
_: Pr... | Steel.ST.Effect.Ghost.STGhost | [] | [] | [
"Steel.Memory.inames",
"Prims.bool",
"Steel.Effect.Common.vprop",
"FStar.Ghost.erased",
"Prims.prop",
"Prims.squash",
"Steel.ST.GenElim1.Base.gen_elim_prop_placeholder",
"Prims.unit",
"Steel.ST.GenElim1.Base.gen_elim_i",
"Steel.ST.GenElim1.Base.gen_elim_nondep_t",
"Steel.ST.Util.rewrite",
"Ste... | [] | false | true | false | false | false | let gen_elim' #opened enable_nondep_opt p a q post _ () =
| let i, j = gen_elim_prop_elim enable_nondep_opt p a q post in
rewrite p (compute_gen_elim_p i);
let res' = compute_gen_elim_nondep_correct i j () _ in
let res:Ghost.erased a = Ghost.hide (coerce_with_smt (Ghost.reveal res')) in
rewrite (compute_gen_elim_nondep_q i j res') (guard_vprop (q res));
res | false |
Steel.ST.GenElim1.fst | Steel.ST.GenElim1.compute_gen_elim_f_star_l | val compute_gen_elim_f_star_l (i1: gen_elim_i) (f1: gen_elim_t i1) (i2: gen_unit_elim_i)
: GTot (gen_elim_t (GEStarL i1 i2)) | val compute_gen_elim_f_star_l (i1: gen_elim_i) (f1: gen_elim_t i1) (i2: gen_unit_elim_i)
: GTot (gen_elim_t (GEStarL i1 i2)) | let compute_gen_elim_f_star_l
(i1: gen_elim_i)
(f1: gen_elim_t i1)
(i2: gen_unit_elim_i)
: GTot (gen_elim_t (GEStarL i1 i2))
= let f2 = compute_gen_unit_elim_f i2 in
fun _ ->
rewrite (compute_gen_elim_p (GEStarL i1 i2)) (compute_gen_elim_p i1 `star` compute_gen_unit_elim_p i2);
let res = f1 _ in
let _ = f... | {
"file_name": "lib/steel/Steel.ST.GenElim1.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 6,
"end_line": 69,
"start_col": 0,
"start_line": 57
} | module Steel.ST.GenElim1
let gen_elim_f
(p: vprop)
(a: Type)
(q: (a -> vprop))
(post: (a -> prop))
: Tot Type
= ((opened: inames) -> STGhost a opened p q True post)
module U = FStar.Universe
let gen_unit_elim_t (i: gen_unit_elim_i) : Tot Type =
gen_elim_f (compute_gen_unit_elim_p i) (U.raise_t u#_ u#1 unit... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Steel.ST.GenElim1.f... | [
{
"abbrev": true,
"full_module": "FStar.Universe",
"short_module": "U"
},
{
"abbrev": true,
"full_module": "FStar.Tactics",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim1.Base",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"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 |
i1: Steel.ST.GenElim1.Base.gen_elim_i ->
f1: Steel.ST.GenElim1.gen_elim_t i1 ->
i2: Steel.ST.GenElim1.Base.gen_unit_elim_i
-> Prims.GTot (Steel.ST.GenElim1.gen_elim_t (Steel.ST.GenElim1.Base.GEStarL i1 i2)) | Prims.GTot | [
"sometrivial"
] | [] | [
"Steel.ST.GenElim1.Base.gen_elim_i",
"Steel.ST.GenElim1.gen_elim_t",
"Steel.ST.GenElim1.Base.gen_unit_elim_i",
"Steel.Memory.inames",
"Steel.ST.GenElim1.Base.compute_gen_elim_a",
"Steel.ST.GenElim1.Base.GEStarL",
"Prims.unit",
"Steel.ST.Util.rewrite",
"Steel.Effect.Common.star",
"Steel.ST.GenElim1... | [] | false | false | false | false | false | let compute_gen_elim_f_star_l (i1: gen_elim_i) (f1: gen_elim_t i1) (i2: gen_unit_elim_i)
: GTot (gen_elim_t (GEStarL i1 i2)) =
| let f2 = compute_gen_unit_elim_f i2 in
fun _ ->
rewrite (compute_gen_elim_p (GEStarL i1 i2))
((compute_gen_elim_p i1) `star` (compute_gen_unit_elim_p i2));
let res = f1 _ in
let _ = f2 _ in
let res':compute_gen_elim_a (GEStarL i1 i2) = coerce_with_trefl res in
rewrite ((compute_gen_elim_q i1 res) `star` (... | false |
Steel.ST.GenElim1.fst | Steel.ST.GenElim1.compute_gen_elim_f_exists_unit1 | val compute_gen_elim_f_exists_unit1 (a: Type) (body: (a -> gen_unit_elim_i))
: Tot (gen_elim_t (GEExistsUnit1 body)) | val compute_gen_elim_f_exists_unit1 (a: Type) (body: (a -> gen_unit_elim_i))
: Tot (gen_elim_t (GEExistsUnit1 body)) | let compute_gen_elim_f_exists_unit1
(a: Type)
(body: a -> gen_unit_elim_i)
: Tot (gen_elim_t (GEExistsUnit1 body))
= fun _ ->
rewrite_with_trefl (compute_gen_elim_p (GEExistsUnit1 body)) (exists_ (fun x -> compute_gen_unit_elim_p (body x)));
let gres = elim_exists () in
let _ = compute_gen_unit_elim_f (body g... | {
"file_name": "lib/steel/Steel.ST.GenElim1.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 5,
"end_line": 164,
"start_col": 0,
"start_line": 154
} | module Steel.ST.GenElim1
let gen_elim_f
(p: vprop)
(a: Type)
(q: (a -> vprop))
(post: (a -> prop))
: Tot Type
= ((opened: inames) -> STGhost a opened p q True post)
module U = FStar.Universe
let gen_unit_elim_t (i: gen_unit_elim_i) : Tot Type =
gen_elim_f (compute_gen_unit_elim_p i) (U.raise_t u#_ u#1 unit... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Steel.ST.GenElim1.f... | [
{
"abbrev": true,
"full_module": "FStar.Universe",
"short_module": "U"
},
{
"abbrev": true,
"full_module": "FStar.Tactics",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim1.Base",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Type -> body: (_: a -> Steel.ST.GenElim1.Base.gen_unit_elim_i)
-> Steel.ST.GenElim1.gen_elim_t (Steel.ST.GenElim1.Base.GEExistsUnit1 body) | Prims.Tot | [
"total"
] | [] | [
"Steel.ST.GenElim1.Base.gen_unit_elim_i",
"Steel.Memory.inames",
"Steel.ST.GenElim1.Base.compute_gen_elim_a",
"Steel.ST.GenElim1.Base.GEExistsUnit1",
"Prims.unit",
"Steel.ST.Util.rewrite",
"Steel.ST.GenElim1.Base.compute_gen_unit_elim_q",
"FStar.Ghost.reveal",
"Steel.ST.GenElim1.Base.compute_gen_eli... | [] | false | false | false | false | false | let compute_gen_elim_f_exists_unit1 (a: Type) (body: (a -> gen_unit_elim_i))
: Tot (gen_elim_t (GEExistsUnit1 body)) =
| fun _ ->
rewrite_with_trefl (compute_gen_elim_p (GEExistsUnit1 body))
(exists_ (fun x -> compute_gen_unit_elim_p (body x)));
let gres = elim_exists () in
let _ = compute_gen_unit_elim_f (body gres) _ in
let res:compute_gen_elim_a (GEExistsUnit1 body) = coerce_with_trefl (Ghost.reveal gres) in
rewrite (com... | false |
Steel.ST.GenElim1.fst | Steel.ST.GenElim1.compute_gen_elim_f_exists1 | val compute_gen_elim_f_exists1
(a: Type)
(body: (a -> gen_elim_i))
(f: (x: a -> GTot (gen_elim_t (body x))))
: Tot (gen_elim_t (GEExists1 body)) | val compute_gen_elim_f_exists1
(a: Type)
(body: (a -> gen_elim_i))
(f: (x: a -> GTot (gen_elim_t (body x))))
: Tot (gen_elim_t (GEExists1 body)) | let compute_gen_elim_f_exists1
(a: Type)
(body: a -> gen_elim_i)
(f: (x: a) -> GTot (gen_elim_t (body x)))
: Tot (gen_elim_t (GEExists1 body))
= fun _ ->
rewrite_with_trefl (compute_gen_elim_p (GEExists1 body)) (exists_ (fun x -> compute_gen_elim_p (body x)));
let gres1 = elim_exists () in
let gres2 = f gre... | {
"file_name": "lib/steel/Steel.ST.GenElim1.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 5,
"end_line": 177,
"start_col": 0,
"start_line": 166
} | module Steel.ST.GenElim1
let gen_elim_f
(p: vprop)
(a: Type)
(q: (a -> vprop))
(post: (a -> prop))
: Tot Type
= ((opened: inames) -> STGhost a opened p q True post)
module U = FStar.Universe
let gen_unit_elim_t (i: gen_unit_elim_i) : Tot Type =
gen_elim_f (compute_gen_unit_elim_p i) (U.raise_t u#_ u#1 unit... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Steel.ST.GenElim1.f... | [
{
"abbrev": true,
"full_module": "FStar.Universe",
"short_module": "U"
},
{
"abbrev": true,
"full_module": "FStar.Tactics",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim1.Base",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
a: Type ->
body: (_: a -> Steel.ST.GenElim1.Base.gen_elim_i) ->
f: (x: a -> Prims.GTot (Steel.ST.GenElim1.gen_elim_t (body x)))
-> Steel.ST.GenElim1.gen_elim_t (Steel.ST.GenElim1.Base.GEExists1 body) | Prims.Tot | [
"total"
] | [] | [
"Steel.ST.GenElim1.Base.gen_elim_i",
"Steel.ST.GenElim1.gen_elim_t",
"Steel.Memory.inames",
"Steel.ST.GenElim1.Base.compute_gen_elim_a",
"Steel.ST.GenElim1.Base.GEExists1",
"Prims.unit",
"Steel.ST.Util.rewrite",
"Steel.ST.GenElim1.Base.compute_gen_elim_q",
"FStar.Ghost.reveal",
"Steel.ST.GenElim1.... | [] | false | false | false | false | false | let compute_gen_elim_f_exists1
(a: Type)
(body: (a -> gen_elim_i))
(f: (x: a -> GTot (gen_elim_t (body x))))
: Tot (gen_elim_t (GEExists1 body)) =
| fun _ ->
rewrite_with_trefl (compute_gen_elim_p (GEExists1 body))
(exists_ (fun x -> compute_gen_elim_p (body x)));
let gres1 = elim_exists () in
let gres2 = f gres1 _ in
let res:compute_gen_elim_a (GEExists1 body) =
coerce_with_trefl (Mkdtuple2 #a
#(fun x -> compute_gen_elim_a (body x))
... | false |
Hacl.Spec.Bignum.ModInvLimb.fst | Hacl.Spec.Bignum.ModInvLimb.bn_mod_inv_limb_lemma | val bn_mod_inv_limb_lemma: #t:limb_t -> #nLen:size_pos -> n:lbignum t nLen -> Lemma
(requires 1 < bn_v n /\ bn_v n % 2 = 1)
(ensures (let mu = mod_inv_limb (Lib.Sequence.index n 0) in
(1 + bn_v n * v mu) % pow2 (bits t) == 0)) | val bn_mod_inv_limb_lemma: #t:limb_t -> #nLen:size_pos -> n:lbignum t nLen -> Lemma
(requires 1 < bn_v n /\ bn_v n % 2 = 1)
(ensures (let mu = mod_inv_limb (Lib.Sequence.index n 0) in
(1 + bn_v n * v mu) % pow2 (bits t) == 0)) | let bn_mod_inv_limb_lemma #t #nLen n =
let n0 = Lib.Sequence.index n 0 in
let mu = mod_inv_limb n0 in
bn_eval_index n 0;
assert (bn_v n % pow2 (bits t) == v n0);
Math.Lemmas.pow2_modulo_modulo_lemma_1 (bn_v n) 2 (bits t);
assert (v n0 % 2 = 1); // since bn_v n % 2 = 1
mod_inv_limb_lemma n0;
assert ((1 +... | {
"file_name": "code/bignum/Hacl.Spec.Bignum.ModInvLimb.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 50,
"end_line": 279,
"start_col": 0,
"start_line": 270
} | module Hacl.Spec.Bignum.ModInvLimb
open FStar.Mul
open Lib.IntTypes
open Lib.LoopCombinators
open Hacl.Spec.Bignum.Definitions
module M = Hacl.Spec.Montgomery.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
the modular inverse function was taken from
https://github.com/google/boringssl/blob/master/cry... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Perva... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abb... | {
"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 | n: Hacl.Spec.Bignum.Definitions.lbignum t nLen
-> FStar.Pervasives.Lemma
(requires
1 < Hacl.Spec.Bignum.Definitions.bn_v n /\ Hacl.Spec.Bignum.Definitions.bn_v n % 2 = 1)
(ensures
(let mu = Hacl.Spec.Bignum.ModInvLimb.mod_inv_limb (Lib.Sequence.index n 0) in
(1 + Hacl.Spec.Bignum... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_pos",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Hacl.Spec.Montgomery.Lemmas.mont_preconditions_n0",
"Lib.IntTypes.bits",
"Hacl.Spec.Bignum.Definitions.bn_v",
"Lib.IntTypes.v",
"Lib.IntTypes.SEC",
"Prims.unit",
"Prims._assert",
"Prims.eq2",... | [] | true | false | true | false | false | let bn_mod_inv_limb_lemma #t #nLen n =
| let n0 = Lib.Sequence.index n 0 in
let mu = mod_inv_limb n0 in
bn_eval_index n 0;
assert (bn_v n % pow2 (bits t) == v n0);
Math.Lemmas.pow2_modulo_modulo_lemma_1 (bn_v n) 2 (bits t);
assert (v n0 % 2 = 1);
mod_inv_limb_lemma n0;
assert ((1 + (bn_v n % pow2 (bits t)) * v mu) % pow2 (bits t) == 0);
M.mont_preconditions_n... | false |
Hacl.Spec.Bignum.ModInvLimb.fst | Hacl.Spec.Bignum.ModInvLimb.mod_inv_limb_inv_step_even | val mod_inv_limb_inv_step_even:
#t:limb_t -> n0:limb t
-> i:pos{i <= bits t} -> ub0:limb t -> vb0:limb t -> Lemma
(requires
(let alpha = uint #t #SEC 1 <<. size (bits t - 1) in let beta = n0 in
v n0 % 2 = 1 /\ v ub0 % 2 = 0 /\
pow2 (bits t - i + 1) == v ub0 * 2 * v alpha - v vb0 * v beta))
(ensures... | val mod_inv_limb_inv_step_even:
#t:limb_t -> n0:limb t
-> i:pos{i <= bits t} -> ub0:limb t -> vb0:limb t -> Lemma
(requires
(let alpha = uint #t #SEC 1 <<. size (bits t - 1) in let beta = n0 in
v n0 % 2 = 1 /\ v ub0 % 2 = 0 /\
pow2 (bits t - i + 1) == v ub0 * 2 * v alpha - v vb0 * v beta))
(ensures... | let mod_inv_limb_inv_step_even #t n0 i ub0 vb0 =
let pbits = bits t in
let alpha = uint #t #SEC 1 <<. size (bits t - 1) in let beta = n0 in
let ub = v ub0 / 2 % pow2 pbits in
let vb = v vb0 / 2 % pow2 pbits in
Math.Lemmas.small_mod (v ub0 / 2) (pow2 pbits);
Math.Lemmas.small_mod (v vb0 / 2) (pow2 pbits);
... | {
"file_name": "code/bignum/Hacl.Spec.Bignum.ModInvLimb.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 71,
"end_line": 129,
"start_col": 0,
"start_line": 107
} | module Hacl.Spec.Bignum.ModInvLimb
open FStar.Mul
open Lib.IntTypes
open Lib.LoopCombinators
open Hacl.Spec.Bignum.Definitions
module M = Hacl.Spec.Montgomery.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
the modular inverse function was taken from
https://github.com/google/boringssl/blob/master/cry... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Perva... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abb... | {
"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 |
n0: Hacl.Spec.Bignum.Definitions.limb t ->
i: Prims.pos{i <= Lib.IntTypes.bits t} ->
ub0: Hacl.Spec.Bignum.Definitions.limb t ->
vb0: Hacl.Spec.Bignum.Definitions.limb t
-> FStar.Pervasives.Lemma
(requires
(let alpha = Lib.IntTypes.uint 1 <<. Lib.IntTypes.size (Lib.IntTypes.bits t - 1) ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.Definitions.limb",
"Prims.pos",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Lib.IntTypes.bits",
"Prims._assert",
"Prims.eq2",
"Prims.int",
"FStar.Mul.op_Star",
"Prims.op_Subtraction",
"Lib.IntTypes.v",
"Lib.IntTypes.SEC",
"Prims.pow2",... | [] | false | false | true | false | false | let mod_inv_limb_inv_step_even #t n0 i ub0 vb0 =
| let pbits = bits t in
let alpha = uint #t #SEC 1 <<. size (bits t - 1) in
let beta = n0 in
let ub = v ub0 / 2 % pow2 pbits in
let vb = v vb0 / 2 % pow2 pbits in
Math.Lemmas.small_mod (v ub0 / 2) (pow2 pbits);
Math.Lemmas.small_mod (v vb0 / 2) (pow2 pbits);
assert ((ub * 2) * v alpha - vb * v beta == ((v ub0 / 2) * 2) *... | false |
CBOR.Spec.Map.fst | CBOR.Spec.Map.list_sorted_cons_elim | val list_sorted_cons_elim
(#t1: Type)
(key_order:
(t1 -> t1 -> bool){forall x y z. (key_order x y /\ key_order y z) ==> key_order x z})
(a: t1)
(q: list t1)
: Lemma (requires (List.Tot.sorted key_order (a :: q)))
(ensures (List.Tot.for_all (key_order a) q))
(decreases q... | val list_sorted_cons_elim
(#t1: Type)
(key_order:
(t1 -> t1 -> bool){forall x y z. (key_order x y /\ key_order y z) ==> key_order x z})
(a: t1)
(q: list t1)
: Lemma (requires (List.Tot.sorted key_order (a :: q)))
(ensures (List.Tot.for_all (key_order a) q))
(decreases q... | let rec list_sorted_cons_elim
(#t1: Type)
(key_order: t1 -> t1 -> bool {
forall x y z . (key_order x y /\ key_order y z) ==> key_order x z
})
(a: t1)
(q: list t1)
: Lemma
(requires (List.Tot.sorted key_order (a :: q)))
(ensures (List.Tot.for_all (key_order a) q))
(decreases q)
= match q with
| [] ... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CBOR.Spec.Map.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 53,
"end_line": 47,
"start_col": 0,
"start_line": 32
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked",
"CBOR.Spec.Type.fsti.checked"
],
"interface_fi... | [
{
"abbrev": false,
"full_module": "CBOR.Spec.Type",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.P... | {
"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 |
key_order:
(_: t1 -> _: t1 -> Prims.bool)
{forall (x: t1) (y: t1) (z: t1). key_order x y /\ key_order y z ==> key_order x z} ->
a: t1 ->
q: Prims.list t1
-> FStar.Pervasives.Lemma (requires FStar.List.Tot.Properties.sorted key_order (a :: q))
(ensures FStar.List.Tot.Base.for_all (key_... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.bool",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.l_and",
"Prims.b2t",
"Prims.list",
"CBOR.Spec.Map.list_for_all_weaken",
"Prims.unit",
"CBOR.Spec.Map.list_sorted_cons_elim",
"FStar.List.Tot.Properties.sorted",
"Prims.Cons",
"Prims.squash",
"FStar.List.Tot.Base.for_all",
"Prims.Nil",
... | [
"recursion"
] | false | false | true | false | false | let rec list_sorted_cons_elim
(#t1: Type)
(key_order:
(t1 -> t1 -> bool){forall x y z. (key_order x y /\ key_order y z) ==> key_order x z})
(a: t1)
(q: list t1)
: Lemma (requires (List.Tot.sorted key_order (a :: q)))
(ensures (List.Tot.for_all (key_order a) q))
(decreas... | match q with
| [] -> ()
| b :: r ->
list_sorted_cons_elim key_order b r;
list_for_all_weaken (key_order b) (key_order a) r | false |
CBOR.Spec.Map.fst | CBOR.Spec.Map.list_for_all_weaken | val list_for_all_weaken
(#t: Type)
(p1: (t -> bool))
(p2: (t -> bool){forall x. p1 x ==> p2 x})
(l: list t)
: Lemma (requires (List.Tot.for_all p1 l)) (ensures (List.Tot.for_all p2 l)) | val list_for_all_weaken
(#t: Type)
(p1: (t -> bool))
(p2: (t -> bool){forall x. p1 x ==> p2 x})
(l: list t)
: Lemma (requires (List.Tot.for_all p1 l)) (ensures (List.Tot.for_all p2 l)) | let rec list_for_all_weaken
(#t: Type)
(p1: t -> bool)
(p2: t -> bool { forall x . p1 x ==> p2 x })
(l: list t)
: Lemma
(requires (List.Tot.for_all p1 l))
(ensures (List.Tot.for_all p2 l))
= match l with
| [] -> ()
| _ :: q -> list_for_all_weaken p1 p2 q | {
"file_name": "share/steel/examples/pulse/dice/cbor/CBOR.Spec.Map.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 41,
"end_line": 30,
"start_col": 0,
"start_line": 20
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked",
"CBOR.Spec.Type.fsti.checked"
],
"interface_fi... | [
{
"abbrev": false,
"full_module": "CBOR.Spec.Type",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.P... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
p1: (_: t -> Prims.bool) ->
p2: (_: t -> Prims.bool){forall (x: t). p1 x ==> p2 x} ->
l: Prims.list t
-> FStar.Pervasives.Lemma (requires FStar.List.Tot.Base.for_all p1 l)
(ensures FStar.List.Tot.Base.for_all p2 l) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.bool",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.b2t",
"Prims.list",
"CBOR.Spec.Map.list_for_all_weaken",
"Prims.unit",
"FStar.List.Tot.Base.for_all",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [
"recursion"
] | false | false | true | false | false | let rec list_for_all_weaken
(#t: Type)
(p1: (t -> bool))
(p2: (t -> bool){forall x. p1 x ==> p2 x})
(l: list t)
: Lemma (requires (List.Tot.for_all p1 l)) (ensures (List.Tot.for_all p2 l)) =
| match l with
| [] -> ()
| _ :: q -> list_for_all_weaken p1 p2 q | false |
CBOR.Spec.Map.fst | CBOR.Spec.Map.list_sorted_map_entry_order_lt_tail | val list_sorted_map_entry_order_lt_tail
(#t1 #t2: Type)
(key_order:
(t1 -> t1 -> bool){(forall x y z. (key_order x y /\ key_order y z) ==> key_order x z)})
(a: (t1 & t2))
(l: list (t1 & t2))
(k: t1)
: Lemma
(requires
(List.Tot.sorted (map_entry_order key_order _... | val list_sorted_map_entry_order_lt_tail
(#t1 #t2: Type)
(key_order:
(t1 -> t1 -> bool){(forall x y z. (key_order x y /\ key_order y z) ==> key_order x z)})
(a: (t1 & t2))
(l: list (t1 & t2))
(k: t1)
: Lemma
(requires
(List.Tot.sorted (map_entry_order key_order _... | let rec list_sorted_map_entry_order_lt_tail
(#t1 #t2: Type)
(key_order: t1 -> t1 -> bool {
(forall x y z . (key_order x y /\ key_order y z) ==> key_order x z)
})
(a: (t1 & t2))
(l: list (t1 & t2))
(k: t1)
: Lemma
(requires (List.Tot.sorted (map_entry_order key_order _) (a :: l) /\ List.Tot.memP k (Lis... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CBOR.Spec.Map.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 58,
"end_line": 64,
"start_col": 0,
"start_line": 49
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked",
"CBOR.Spec.Type.fsti.checked"
],
"interface_fi... | [
{
"abbrev": false,
"full_module": "CBOR.Spec.Type",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.P... | {
"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 |
key_order:
(_: t1 -> _: t1 -> Prims.bool)
{forall (x: t1) (y: t1) (z: t1). key_order x y /\ key_order y z ==> key_order x z} ->
a: (t1 * t2) ->
l: Prims.list (t1 * t2) ->
k: t1
-> FStar.Pervasives.Lemma
(requires
FStar.List.Tot.Properties.sorted (CBOR.Spec.Type.map_entry_o... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.bool",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.l_and",
"Prims.b2t",
"FStar.Pervasives.Native.tuple2",
"Prims.list",
"FStar.StrongExcludedMiddle.strong_excluded_middle",
"Prims.eq2",
"FStar.Pervasives.Native.fst",
"CBOR.Spec.Map.list_sorted_map_entry_order_lt_tail",
"Prims.unit",
"FSta... | [
"recursion"
] | false | false | true | false | false | let rec list_sorted_map_entry_order_lt_tail
(#t1 #t2: Type)
(key_order:
(t1 -> t1 -> bool){(forall x y z. (key_order x y /\ key_order y z) ==> key_order x z)})
(a: (t1 & t2))
(l: list (t1 & t2))
(k: t1)
: Lemma
(requires
(List.Tot.sorted (map_entry_order key_ord... | let b :: q = l in
if FStar.StrongExcludedMiddle.strong_excluded_middle (k == fst b)
then ()
else list_sorted_map_entry_order_lt_tail key_order b q k | false |
Hacl.Spec.Bignum.ModInvLimb.fst | Hacl.Spec.Bignum.ModInvLimb.mod_inv_limb_lemma | val mod_inv_limb_lemma: #t:limb_t -> n0:limb t -> Lemma
(requires v n0 % 2 == 1)
(ensures (1 + v n0 * v (mod_inv_limb n0)) % pow2 (bits t) == 0) | val mod_inv_limb_lemma: #t:limb_t -> n0:limb t -> Lemma
(requires v n0 % 2 == 1)
(ensures (1 + v n0 * v (mod_inv_limb n0)) % pow2 (bits t) == 0) | let mod_inv_limb_lemma #t n0 =
let pbits = bits t in
let alpha = uint #t #SEC 1 <<. size (bits t - 1) in
let beta = n0 in
let (ub, vb) = repeat_gen pbits (mod_inv_limb_t t) (mod_inv_limb_f alpha beta) (uint #t 1, uint #t 0) in
mod_inv_limb_inv n0 pbits;
calc (==) {
(1 + v vb * v n0) % pow2 pbits;
(=... | {
"file_name": "code/bignum/Hacl.Spec.Bignum.ModInvLimb.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 46,
"end_line": 267,
"start_col": 0,
"start_line": 252
} | module Hacl.Spec.Bignum.ModInvLimb
open FStar.Mul
open Lib.IntTypes
open Lib.LoopCombinators
open Hacl.Spec.Bignum.Definitions
module M = Hacl.Spec.Montgomery.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
the modular inverse function was taken from
https://github.com/google/boringssl/blob/master/cry... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Perva... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abb... | {
"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 | n0: Hacl.Spec.Bignum.Definitions.limb t
-> FStar.Pervasives.Lemma (requires Lib.IntTypes.v n0 % 2 == 1)
(ensures
(1 + Lib.IntTypes.v n0 * Lib.IntTypes.v (Hacl.Spec.Bignum.ModInvLimb.mod_inv_limb n0)) %
Prims.pow2 (Lib.IntTypes.bits t) ==
0) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.Definitions.limb",
"Prims._assert",
"Prims.eq2",
"Prims.int",
"Prims.op_Modulus",
"Prims.op_Addition",
"FStar.Mul.op_Star",
"Lib.IntTypes.v",
"Lib.IntTypes.SEC",
"Prims.pow2",
"Prims.unit",
"FStar.Calc.calc_finish",
"Prims.Cons",
"... | [] | false | false | true | false | false | let mod_inv_limb_lemma #t n0 =
| let pbits = bits t in
let alpha = uint #t #SEC 1 <<. size (bits t - 1) in
let beta = n0 in
let ub, vb =
repeat_gen pbits (mod_inv_limb_t t) (mod_inv_limb_f alpha beta) (uint #t 1, uint #t 0)
in
mod_inv_limb_inv n0 pbits;
calc ( == ) {
(1 + v vb * v n0) % pow2 pbits;
( == ) { () }
((v ub * 2) * v alpha) % pow2 p... | false |
Hacl.Spec.Bignum.ModInvLimb.fst | Hacl.Spec.Bignum.ModInvLimb.mod_inv_limb_inv_step | val mod_inv_limb_inv_step:
#t:limb_t -> n0:limb t
-> i:pos{i <= bits t} -> ub0:limb t -> vb0:limb t -> Lemma
(requires
(let alpha = uint #t #SEC 1 <<. size (bits t - 1) in let beta = n0 in
v n0 % 2 = 1 /\ pow2 (bits t - i + 1) == v ub0 * 2 * v alpha - v vb0 * v beta))
(ensures
(let alpha = uint #t #... | val mod_inv_limb_inv_step:
#t:limb_t -> n0:limb t
-> i:pos{i <= bits t} -> ub0:limb t -> vb0:limb t -> Lemma
(requires
(let alpha = uint #t #SEC 1 <<. size (bits t - 1) in let beta = n0 in
v n0 % 2 = 1 /\ pow2 (bits t - i + 1) == v ub0 * 2 * v alpha - v vb0 * v beta))
(ensures
(let alpha = uint #t #... | let mod_inv_limb_inv_step #t n0 i ub0 vb0 =
let pbits = bits t in
let alpha = uint #t #SEC 1 <<. size (bits t - 1) in
let beta = n0 in
let u_is_odd = uint #t 0 -. (ub0 &. uint #t 1) in
let beta_if_u_is_odd = beta &. u_is_odd in
let ub = ((ub0 ^. beta_if_u_is_odd) >>. 1ul) +. (ub0 &. beta_if_u_is_odd) in
... | {
"file_name": "code/bignum/Hacl.Spec.Bignum.ModInvLimb.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 42,
"end_line": 225,
"start_col": 0,
"start_line": 196
} | module Hacl.Spec.Bignum.ModInvLimb
open FStar.Mul
open Lib.IntTypes
open Lib.LoopCombinators
open Hacl.Spec.Bignum.Definitions
module M = Hacl.Spec.Montgomery.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
the modular inverse function was taken from
https://github.com/google/boringssl/blob/master/cry... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Perva... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abb... | {
"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 |
n0: Hacl.Spec.Bignum.Definitions.limb t ->
i: Prims.pos{i <= Lib.IntTypes.bits t} ->
ub0: Hacl.Spec.Bignum.Definitions.limb t ->
vb0: Hacl.Spec.Bignum.Definitions.limb t
-> FStar.Pervasives.Lemma
(requires
(let alpha = Lib.IntTypes.uint 1 <<. Lib.IntTypes.size (Lib.IntTypes.bits t - 1) ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.Definitions.limb",
"Prims.pos",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Lib.IntTypes.bits",
"FStar.Math.Lemmas.pow2_minus",
"Prims.op_Addition",
"Prims.op_Subtraction",
"Prims.unit",
"FStar.Math.Lemmas.cancel_mul_div",
"FStar.Mul.op_St... | [] | false | false | true | false | false | let mod_inv_limb_inv_step #t n0 i ub0 vb0 =
| let pbits = bits t in
let alpha = uint #t #SEC 1 <<. size (bits t - 1) in
let beta = n0 in
let u_is_odd = uint #t 0 -. (ub0 &. uint #t 1) in
let beta_if_u_is_odd = beta &. u_is_odd in
let ub = ((ub0 ^. beta_if_u_is_odd) >>. 1ul) +. (ub0 &. beta_if_u_is_odd) in
let alpha_if_u_is_odd = alpha &. u_is_odd in
let vb = (vb0 ... | false |
CBOR.Spec.Map.fst | CBOR.Spec.Map.list_tot_for_all_order_trans | val list_tot_for_all_order_trans
(#t1: Type)
(order:
(t1 -> t1 -> bool)
{ (forall x. order x x == false) /\
(forall x y z. (order x y /\ order y z) ==> order x z) })
(k1v1 k2v2: _)
(l1: list t1)
: Lemma (requires (order k1v1 k2v2 /\ List.Tot.for_all (order... | val list_tot_for_all_order_trans
(#t1: Type)
(order:
(t1 -> t1 -> bool)
{ (forall x. order x x == false) /\
(forall x y z. (order x y /\ order y z) ==> order x z) })
(k1v1 k2v2: _)
(l1: list t1)
: Lemma (requires (order k1v1 k2v2 /\ List.Tot.for_all (order... | let rec list_tot_for_all_order_trans
(#t1: Type)
(order: t1 -> t1 -> bool {
(forall x . order x x == false) /\
(forall x y z . (order x y /\ order y z) ==> order x z)
})
(k1v1: _)
(k2v2: _)
(l1: list t1)
: Lemma
(requires (order k1v1 k2v2 /\
List.Tot.for_all (order k2v2) l1
... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CBOR.Spec.Map.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 60,
"end_line": 114,
"start_col": 0,
"start_line": 95
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked",
"CBOR.Spec.Type.fsti.checked"
],
"interface_fi... | [
{
"abbrev": false,
"full_module": "CBOR.Spec.Type",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.P... | {
"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 |
order:
(_: t1 -> _: t1 -> Prims.bool)
{ (forall (x: t1). order x x == false) /\
(forall (x: t1) (y: t1) (z: t1). order x y /\ order y z ==> order x z) } ->
k1v1: t1 ->
k2v2: t1 ->
l1: Prims.list t1
-> FStar.Pervasives.Lemma
(requires order k1v1 k2v2 /\ FStar.List.Tot.Bas... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.bool",
"Prims.l_and",
"Prims.l_Forall",
"Prims.eq2",
"Prims.l_imp",
"Prims.b2t",
"Prims.list",
"CBOR.Spec.Map.list_tot_for_all_order_trans",
"Prims.unit",
"FStar.List.Tot.Base.for_all",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [
"recursion"
] | false | false | true | false | false | let rec list_tot_for_all_order_trans
(#t1: Type)
(order:
(t1 -> t1 -> bool)
{ (forall x. order x x == false) /\
(forall x y z. (order x y /\ order y z) ==> order x z) })
(k1v1 k2v2: _)
(l1: list t1)
: Lemma (requires (order k1v1 k2v2 /\ List.Tot.for_all (o... | match l1 with
| [] -> ()
| _ :: q -> list_tot_for_all_order_trans order k1v1 k2v2 q | false |
CBOR.Spec.Map.fst | CBOR.Spec.Map.list_ghost_assoc | val list_ghost_assoc (#key #value: Type) (k: key) (m: list (key & value))
: GTot (option value) (decreases m) | val list_ghost_assoc (#key #value: Type) (k: key) (m: list (key & value))
: GTot (option value) (decreases m) | let rec list_ghost_assoc
(#key: Type)
(#value: Type)
(k: key)
(m: list (key & value))
: GTot (option value)
(decreases m)
= match m with
| [] -> None
| (k', v') :: m' ->
if FStar.StrongExcludedMiddle.strong_excluded_middle (k == k')
then Some v'
else list_ghost_assoc k m' | {
"file_name": "share/steel/examples/pulse/dice/cbor/CBOR.Spec.Map.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 30,
"end_line": 128,
"start_col": 0,
"start_line": 116
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked",
"CBOR.Spec.Type.fsti.checked"
],
"interface_fi... | [
{
"abbrev": false,
"full_module": "CBOR.Spec.Type",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.P... | {
"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 | k: key -> m: Prims.list (key * value) -> Prims.GTot (FStar.Pervasives.Native.option value) | Prims.GTot | [
"sometrivial",
""
] | [] | [
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.None",
"FStar.StrongExcludedMiddle.strong_excluded_middle",
"Prims.eq2",
"FStar.Pervasives.Native.Some",
"Prims.bool",
"CBOR.Spec.Map.list_ghost_assoc",
"FStar.Pervasives.Native.option"
] | [
"recursion"
] | false | false | false | false | false | let rec list_ghost_assoc (#key #value: Type) (k: key) (m: list (key & value))
: GTot (option value) (decreases m) =
| match m with
| [] -> None
| (k', v') :: m' ->
if FStar.StrongExcludedMiddle.strong_excluded_middle (k == k')
then Some v'
else list_ghost_assoc k m' | false |
Hacl.Impl.Chacha20.Core32.fst | Hacl.Impl.Chacha20.Core32.copy_state | val copy_state:
st:state
-> ost:state ->
Stack unit
(requires fun h -> live h st /\ live h ost /\ disjoint st ost)
(ensures fun h0 _ h1 -> modifies (loc st) h0 h1 /\
as_seq h1 st == as_seq h0 ost) | val copy_state:
st:state
-> ost:state ->
Stack unit
(requires fun h -> live h st /\ live h ost /\ disjoint st ost)
(ensures fun h0 _ h1 -> modifies (loc st) h0 h1 /\
as_seq h1 st == as_seq h0 ost) | let copy_state st ost = copy #MUT #uint32 #(size 16) st ost | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Core32.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 59,
"end_line": 90,
"start_col": 0,
"start_line": 90
} | module Hacl.Impl.Chacha20.Core32
open FStar.HyperStack
open FStar.HyperStack.All
open Lib.IntTypes
open Lib.Sequence
open Lib.Buffer
open Lib.ByteBuffer
module ST = FStar.HyperStack.ST
module Spec = Spec.Chacha20
let state = lbuffer uint32 16ul
let index = i:size_t{size_v i < 16}
inline_for_extraction
val create... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.... | [
{
"abbrev": true,
"full_module": "Spec.Chacha20",
"short_module": "Spec"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | st: Hacl.Impl.Chacha20.Core32.state -> ost: Hacl.Impl.Chacha20.Core32.state
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Impl.Chacha20.Core32.state",
"Lib.Buffer.copy",
"Lib.Buffer.MUT",
"Lib.IntTypes.uint32",
"Lib.IntTypes.size",
"Prims.unit"
] | [] | false | true | false | false | false | let copy_state st ost =
| copy #MUT #uint32 #(size 16) st ost | false |
Hacl.Spec.Bignum.ModInvLimb.fst | Hacl.Spec.Bignum.ModInvLimb.mod_inv_limb_inv | val mod_inv_limb_inv: #t:limb_t -> n0:limb t -> i:nat{i <= bits t} -> Lemma
(requires v n0 % 2 = 1)
(ensures
(let alpha = uint #t #SEC 1 <<. size (bits t - 1) in
let beta = n0 in
let (ub, vb) = repeat_gen i (mod_inv_limb_t t) (mod_inv_limb_f alpha beta) (uint #t 1, uint #t 0) in
pow2 (bits t - i) == ... | val mod_inv_limb_inv: #t:limb_t -> n0:limb t -> i:nat{i <= bits t} -> Lemma
(requires v n0 % 2 = 1)
(ensures
(let alpha = uint #t #SEC 1 <<. size (bits t - 1) in
let beta = n0 in
let (ub, vb) = repeat_gen i (mod_inv_limb_t t) (mod_inv_limb_f alpha beta) (uint #t 1, uint #t 0) in
pow2 (bits t - i) == ... | let rec mod_inv_limb_inv #t n0 i =
let alpha = uint #t #SEC 1 <<. size (bits t - 1) in
let beta = n0 in
let (ub, vb) = repeat_gen i (mod_inv_limb_t t) (mod_inv_limb_f alpha beta) (uint #t 1, uint #t 0) in
if i = 0 then
eq_repeat_gen0 i (mod_inv_limb_t t) (mod_inv_limb_f alpha beta) (uint #t 1, uint #t 0)
... | {
"file_name": "code/bignum/Hacl.Spec.Bignum.ModInvLimb.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 10,
"end_line": 249,
"start_col": 0,
"start_line": 236
} | module Hacl.Spec.Bignum.ModInvLimb
open FStar.Mul
open Lib.IntTypes
open Lib.LoopCombinators
open Hacl.Spec.Bignum.Definitions
module M = Hacl.Spec.Montgomery.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
the modular inverse function was taken from
https://github.com/google/boringssl/blob/master/cry... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Perva... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abb... | {
"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 | n0: Hacl.Spec.Bignum.Definitions.limb t -> i: Prims.nat{i <= Lib.IntTypes.bits t}
-> FStar.Pervasives.Lemma (requires Lib.IntTypes.v n0 % 2 = 1)
(ensures
(let alpha = Lib.IntTypes.uint 1 <<. Lib.IntTypes.size (Lib.IntTypes.bits t - 1) in
let beta = n0 in
let _ =
Lib.LoopC... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.Definitions.limb",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Lib.IntTypes.bits",
"Prims.op_Equality",
"Prims.int",
"Lib.LoopCombinators.eq_repeat_gen0",
"Hacl.Spec.Bignum.ModInvLimb.mod_inv_limb_t",
"Hacl.Spec.Bignum.ModInvLim... | [
"recursion"
] | false | false | true | false | false | let rec mod_inv_limb_inv #t n0 i =
| let alpha = uint #t #SEC 1 <<. size (bits t - 1) in
let beta = n0 in
let ub, vb = repeat_gen i (mod_inv_limb_t t) (mod_inv_limb_f alpha beta) (uint #t 1, uint #t 0) in
if i = 0
then eq_repeat_gen0 i (mod_inv_limb_t t) (mod_inv_limb_f alpha beta) (uint #t 1, uint #t 0)
else
let ub0, vb0 =
repeat_gen (i - 1) (mod_i... | false |
Hacl.Impl.Chacha20.Core32.fst | Hacl.Impl.Chacha20.Core32.load_state | val load_state:
st:state
-> b:lbuffer uint8 64ul ->
Stack unit
(requires fun h -> live h st /\ live h b /\ disjoint st b)
(ensures fun h0 _ h1 -> modifies (loc st) h0 h1 /\
as_seq h1 st == Lib.ByteSequence.uints_from_bytes_le (as_seq h0 b)) | val load_state:
st:state
-> b:lbuffer uint8 64ul ->
Stack unit
(requires fun h -> live h st /\ live h b /\ disjoint st b)
(ensures fun h0 _ h1 -> modifies (loc st) h0 h1 /\
as_seq h1 st == Lib.ByteSequence.uints_from_bytes_le (as_seq h0 b)) | let load_state st b =
uints_from_bytes_le st b | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Core32.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 26,
"end_line": 40,
"start_col": 0,
"start_line": 39
} | module Hacl.Impl.Chacha20.Core32
open FStar.HyperStack
open FStar.HyperStack.All
open Lib.IntTypes
open Lib.Sequence
open Lib.Buffer
open Lib.ByteBuffer
module ST = FStar.HyperStack.ST
module Spec = Spec.Chacha20
let state = lbuffer uint32 16ul
let index = i:size_t{size_v i < 16}
inline_for_extraction
val create... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.... | [
{
"abbrev": true,
"full_module": "Spec.Chacha20",
"short_module": "Spec"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | st: Hacl.Impl.Chacha20.Core32.state -> b: Lib.Buffer.lbuffer Lib.IntTypes.uint8 64ul
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Impl.Chacha20.Core32.state",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"FStar.UInt32.__uint_to_t",
"Lib.ByteBuffer.uints_from_bytes_le",
"Lib.IntTypes.U32",
"Lib.IntTypes.SEC",
"Prims.unit"
] | [] | false | true | false | false | false | let load_state st b =
| uints_from_bytes_le st b | false |
Hacl.Streaming.Poly1305_256.fsti | Hacl.Streaming.Poly1305_256.malloc | val malloc : Hacl.Streaming.Functor.malloc_st (Hacl.Streaming.Poly1305.poly1305 Hacl.Impl.Poly1305.Fields.M256)
()
(Hacl.Streaming.Poly1305.t Hacl.Impl.Poly1305.Fields.M256)
(Stateful?.s Hacl.Streaming.Poly1305.poly1305_key ()) | let malloc = F.malloc (poly1305 M256) () (t M256) (poly1305_key.I.s ()) | {
"file_name": "code/streaming/Hacl.Streaming.Poly1305_256.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 71,
"end_line": 17,
"start_col": 0,
"start_line": 17
} | module Hacl.Streaming.Poly1305_256
module G = FStar.Ghost
module F = Hacl.Streaming.Functor
module I = Hacl.Streaming.Interface
open Hacl.Impl.Poly1305.Fields
open Hacl.Streaming.Poly1305
#set-options "--fuel 0 --ifuel 0 --z3rlimit 100"
/// Type abbreviation - makes KaRaMeL use pretty names in the generated code
le... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Hacl.Streaming.Poly1305.fst.checked",
"Hacl.Streaming.Interface.fsti.checked",
"Hacl.Streaming.Functor.fsti.checked",
"Hacl.Impl.Poly1305.Fields.fst.checked",
"Hacl.Impl.Poly1305.fsti.checked",
"FStar.Pervasives.fsti.checked"... | [
{
"abbrev": false,
"full_module": "Hacl.Streaming.Poly1305",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Poly1305.Fields",
"short_module": null
},
{
"abbrev": true,
"full_module": "Hacl.Streaming.Interface",
"short_module": "I"
},
{
"abbre... | {
"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.Streaming.Functor.malloc_st (Hacl.Streaming.Poly1305.poly1305 Hacl.Impl.Poly1305.Fields.M256)
()
(Hacl.Streaming.Poly1305.t Hacl.Impl.Poly1305.Fields.M256)
(Stateful?.s Hacl.Streaming.Poly1305.poly1305_key ()) | Prims.Tot | [
"total"
] | [] | [
"Hacl.Streaming.Functor.malloc",
"Prims.unit",
"Hacl.Streaming.Poly1305.poly1305",
"Hacl.Impl.Poly1305.Fields.M256",
"Hacl.Streaming.Poly1305.t",
"Hacl.Streaming.Interface.__proj__Stateful__item__s",
"Hacl.Streaming.Poly1305.poly1305_key"
] | [] | false | false | false | false | false | let malloc =
| F.malloc (poly1305 M256) () (t M256) (poly1305_key.I.s ()) | false | |
CBOR.Spec.Map.fst | CBOR.Spec.Map.list_sorted_map_entry_order_not_memP_tail | val list_sorted_map_entry_order_not_memP_tail
(#t1 #t2: Type)
(key_order:
(t1 -> t1 -> bool)
{ (forall x. key_order x x == false) /\
(forall x y z. (key_order x y /\ key_order y z) ==> key_order x z) })
(a: (t1 & t2))
(l: list (t1 & t2))
: Lemma (requires ... | val list_sorted_map_entry_order_not_memP_tail
(#t1 #t2: Type)
(key_order:
(t1 -> t1 -> bool)
{ (forall x. key_order x x == false) /\
(forall x y z. (key_order x y /\ key_order y z) ==> key_order x z) })
(a: (t1 & t2))
(l: list (t1 & t2))
: Lemma (requires ... | let list_sorted_map_entry_order_not_memP_tail
(#t1 #t2: Type)
(key_order: t1 -> t1 -> bool {
(forall x . key_order x x == false) /\
(forall x y z . (key_order x y /\ key_order y z) ==> key_order x z)
})
(a: (t1 & t2))
(l: list (t1 & t2))
: Lemma
(requires (List.Tot.sorted (map_entry_order key_order ... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CBOR.Spec.Map.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 85,
"end_line": 77,
"start_col": 0,
"start_line": 66
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked",
"CBOR.Spec.Type.fsti.checked"
],
"interface_fi... | [
{
"abbrev": false,
"full_module": "CBOR.Spec.Type",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.P... | {
"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 |
key_order:
(_: t1 -> _: t1 -> Prims.bool)
{ (forall (x: t1). key_order x x == false) /\
(forall (x: t1) (y: t1) (z: t1). key_order x y /\ key_order y z ==> key_order x z) } ->
a: (t1 * t2) ->
l: Prims.list (t1 * t2)
-> FStar.Pervasives.Lemma
(requires
FStar.List.Tot.... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.bool",
"Prims.l_and",
"Prims.l_Forall",
"Prims.eq2",
"Prims.l_imp",
"Prims.b2t",
"FStar.Pervasives.Native.tuple2",
"Prims.list",
"FStar.Classical.move_requires",
"FStar.List.Tot.Properties.sorted",
"CBOR.Spec.Type.map_entry_order",
"Prims.Cons",
"FStar.List.Tot.Base.memP",
"FStar.Li... | [] | false | false | true | false | false | let list_sorted_map_entry_order_not_memP_tail
(#t1 #t2: Type)
(key_order:
(t1 -> t1 -> bool)
{ (forall x. key_order x x == false) /\
(forall x y z. (key_order x y /\ key_order y z) ==> key_order x z) })
(a: (t1 & t2))
(l: list (t1 & t2))
: Lemma (requires ... | Classical.move_requires (list_sorted_map_entry_order_lt_tail key_order a l) (fst a) | false |
Hacl.Impl.Chacha20.Core32.fst | Hacl.Impl.Chacha20.Core32.incr_counter | val incr_counter:
st:state ->
Stack unit
(requires fun h -> live h st)
(ensures fun h0 _ h1 -> modifies (loc st) h0 h1) | val incr_counter:
st:state ->
Stack unit
(requires fun h -> live h st)
(ensures fun h0 _ h1 -> modifies (loc st) h0 h1) | let incr_counter st =
let c = st.(size 12) in
st.(size 12) <- c +. u32 1 | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Core32.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 28,
"end_line": 78,
"start_col": 0,
"start_line": 76
} | module Hacl.Impl.Chacha20.Core32
open FStar.HyperStack
open FStar.HyperStack.All
open Lib.IntTypes
open Lib.Sequence
open Lib.Buffer
open Lib.ByteBuffer
module ST = FStar.HyperStack.ST
module Spec = Spec.Chacha20
let state = lbuffer uint32 16ul
let index = i:size_t{size_v i < 16}
inline_for_extraction
val create... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.... | [
{
"abbrev": true,
"full_module": "Spec.Chacha20",
"short_module": "Spec"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | st: Hacl.Impl.Chacha20.Core32.state -> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Impl.Chacha20.Core32.state",
"Lib.Buffer.op_Array_Assignment",
"Lib.IntTypes.uint32",
"FStar.UInt32.__uint_to_t",
"Lib.IntTypes.size",
"Lib.IntTypes.op_Plus_Dot",
"Lib.IntTypes.U32",
"Lib.IntTypes.SEC",
"Lib.IntTypes.u32",
"Prims.unit",
"Lib.IntTypes.int_t",
"Lib.Buffer.op_Array_Access",... | [] | false | true | false | false | false | let incr_counter st =
| let c = st.(size 12) in
st.(size 12) <- c +. u32 1 | false |
CBOR.Spec.Map.fst | CBOR.Spec.Map.list_sorted_map_entry_order_no_repeats | val list_sorted_map_entry_order_no_repeats
(#t1 #t2: Type)
(key_order:
(t1 -> t1 -> bool)
{ (forall x. key_order x x == false) /\
(forall x y z. (key_order x y /\ key_order y z) ==> key_order x z) })
(l: list (t1 & t2))
: Lemma (requires (List.Tot.sorted (map_en... | val list_sorted_map_entry_order_no_repeats
(#t1 #t2: Type)
(key_order:
(t1 -> t1 -> bool)
{ (forall x. key_order x x == false) /\
(forall x y z. (key_order x y /\ key_order y z) ==> key_order x z) })
(l: list (t1 & t2))
: Lemma (requires (List.Tot.sorted (map_en... | let rec list_sorted_map_entry_order_no_repeats
(#t1 #t2: Type)
(key_order: t1 -> t1 -> bool {
(forall x . key_order x x == false) /\
(forall x y z . (key_order x y /\ key_order y z) ==> key_order x z)
})
(l: list (t1 & t2))
: Lemma
(requires (List.Tot.sorted (map_entry_order key_order _) l))
(ensure... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CBOR.Spec.Map.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 59,
"end_line": 93,
"start_col": 0,
"start_line": 79
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked",
"CBOR.Spec.Type.fsti.checked"
],
"interface_fi... | [
{
"abbrev": false,
"full_module": "CBOR.Spec.Type",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.P... | {
"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 |
key_order:
(_: t1 -> _: t1 -> Prims.bool)
{ (forall (x: t1). key_order x x == false) /\
(forall (x: t1) (y: t1) (z: t1). key_order x y /\ key_order y z ==> key_order x z) } ->
l: Prims.list (t1 * t2)
-> FStar.Pervasives.Lemma
(requires FStar.List.Tot.Properties.sorted (CBOR.Spec... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.bool",
"Prims.l_and",
"Prims.l_Forall",
"Prims.eq2",
"Prims.l_imp",
"Prims.b2t",
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"CBOR.Spec.Map.list_sorted_map_entry_order_not_memP_tail",
"Prims.unit",
"CBOR.Spec.Map.list_sorted_map_entry_order_no_repeats",
"FStar.List.Tot.Properties.so... | [
"recursion"
] | false | false | true | false | false | let rec list_sorted_map_entry_order_no_repeats
(#t1 #t2: Type)
(key_order:
(t1 -> t1 -> bool)
{ (forall x. key_order x x == false) /\
(forall x y z. (key_order x y /\ key_order y z) ==> key_order x z) })
(l: list (t1 & t2))
: Lemma (requires (List.Tot.sorted (ma... | match l with
| [] -> ()
| a :: q ->
list_sorted_map_entry_order_no_repeats key_order q;
list_sorted_map_entry_order_not_memP_tail key_order a q | false |
CBOR.Spec.Map.fst | CBOR.Spec.Map.list_ghost_assoc_append | val list_ghost_assoc_append (#tk #tv: Type) (k: tk) (l1 l2: list (tk & tv))
: Lemma
(ensures
(list_ghost_assoc k (l1 `List.Tot.append` l2) ==
(match list_ghost_assoc k l1 with
| Some v -> Some v
| None -> list_ghost_assoc k l2))) (decreases l1) | val list_ghost_assoc_append (#tk #tv: Type) (k: tk) (l1 l2: list (tk & tv))
: Lemma
(ensures
(list_ghost_assoc k (l1 `List.Tot.append` l2) ==
(match list_ghost_assoc k l1 with
| Some v -> Some v
| None -> list_ghost_assoc k l2))) (decreases l1) | let rec list_ghost_assoc_append
(#tk #tv: Type)
(k: tk)
(l1 l2: list (tk & tv))
: Lemma
(ensures (list_ghost_assoc k (l1 `List.Tot.append` l2) == (
match list_ghost_assoc k l1 with
| Some v -> Some v
| None -> list_ghost_assoc k l2
)))
(decreases l1)
= match l1 with
| [] ... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CBOR.Spec.Map.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 40,
"end_line": 146,
"start_col": 0,
"start_line": 130
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked",
"CBOR.Spec.Type.fsti.checked"
],
"interface_fi... | [
{
"abbrev": false,
"full_module": "CBOR.Spec.Type",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.P... | {
"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 | k: tk -> l1: Prims.list (tk * tv) -> l2: Prims.list (tk * tv)
-> FStar.Pervasives.Lemma
(ensures
CBOR.Spec.Map.list_ghost_assoc k (l1 @ l2) ==
(match CBOR.Spec.Map.list_ghost_assoc k l1 with
| FStar.Pervasives.Native.Some #_ v -> FStar.Pervasives.Native.Some v
| FStar.Pervasi... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"FStar.StrongExcludedMiddle.strong_excluded_middle",
"Prims.eq2",
"Prims.bool",
"CBOR.Spec.Map.list_ghost_assoc_append",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"FStar.Pervasives.Native.option",
"CBOR.Spec.Map.list_ghost_assoc",
"FStar.List... | [
"recursion"
] | false | false | true | false | false | let rec list_ghost_assoc_append (#tk #tv: Type) (k: tk) (l1 l2: list (tk & tv))
: Lemma
(ensures
(list_ghost_assoc k (l1 `List.Tot.append` l2) ==
(match list_ghost_assoc k l1 with
| Some v -> Some v
| None -> list_ghost_assoc k l2))) (decreases l1) =
| match l1 with
| [] -> ()
| (k1, _) :: q1 ->
if FStar.StrongExcludedMiddle.strong_excluded_middle (k == k1)
then ()
else list_ghost_assoc_append k q1 l2 | false |
Hacl.Impl.Chacha20.Core32.fst | Hacl.Impl.Chacha20.Core32.sum_state | val sum_state:
st:state
-> ost:state ->
Stack unit
(requires fun h -> live h st /\ live h ost /\ eq_or_disjoint st ost)
(ensures fun h0 _ h1 -> modifies (loc st) h0 h1 /\
as_seq h1 st == Spec.sum_state (as_seq h0 st) (as_seq h0 ost)) | val sum_state:
st:state
-> ost:state ->
Stack unit
(requires fun h -> live h st /\ live h ost /\ eq_or_disjoint st ost)
(ensures fun h0 _ h1 -> modifies (loc st) h0 h1 /\
as_seq h1 st == Spec.sum_state (as_seq h0 st) (as_seq h0 ost)) | let sum_state st ost = map2T #MUT #MUT #uint32 #uint32 #uint32 (size 16) st ( +. ) st ost | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Core32.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 90,
"end_line": 102,
"start_col": 0,
"start_line": 102
} | module Hacl.Impl.Chacha20.Core32
open FStar.HyperStack
open FStar.HyperStack.All
open Lib.IntTypes
open Lib.Sequence
open Lib.Buffer
open Lib.ByteBuffer
module ST = FStar.HyperStack.ST
module Spec = Spec.Chacha20
let state = lbuffer uint32 16ul
let index = i:size_t{size_v i < 16}
inline_for_extraction
val create... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.... | [
{
"abbrev": true,
"full_module": "Spec.Chacha20",
"short_module": "Spec"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | st: Hacl.Impl.Chacha20.Core32.state -> ost: Hacl.Impl.Chacha20.Core32.state
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Impl.Chacha20.Core32.state",
"Lib.Buffer.map2T",
"Lib.Buffer.MUT",
"Lib.IntTypes.uint32",
"Lib.IntTypes.size",
"Lib.IntTypes.op_Plus_Dot",
"Lib.IntTypes.U32",
"Lib.IntTypes.SEC",
"Prims.unit"
] | [] | false | true | false | false | false | let sum_state st ost =
| map2T #MUT #MUT #uint32 #uint32 #uint32 (size 16) st ( +. ) st ost | false |
Hacl.Streaming.Poly1305_256.fsti | Hacl.Streaming.Poly1305_256.alloca | val alloca : Hacl.Streaming.Functor.alloca_st (Hacl.Streaming.Poly1305.poly1305 Hacl.Impl.Poly1305.Fields.M256)
()
(Hacl.Streaming.Poly1305.t Hacl.Impl.Poly1305.Fields.M256)
(Stateful?.s Hacl.Streaming.Poly1305.poly1305_key ()) | let alloca = F.alloca (poly1305 M256) () (t M256) (poly1305_key.I.s ()) | {
"file_name": "code/streaming/Hacl.Streaming.Poly1305_256.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 71,
"end_line": 16,
"start_col": 0,
"start_line": 16
} | module Hacl.Streaming.Poly1305_256
module G = FStar.Ghost
module F = Hacl.Streaming.Functor
module I = Hacl.Streaming.Interface
open Hacl.Impl.Poly1305.Fields
open Hacl.Streaming.Poly1305
#set-options "--fuel 0 --ifuel 0 --z3rlimit 100"
/// Type abbreviation - makes KaRaMeL use pretty names in the generated code
le... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Hacl.Streaming.Poly1305.fst.checked",
"Hacl.Streaming.Interface.fsti.checked",
"Hacl.Streaming.Functor.fsti.checked",
"Hacl.Impl.Poly1305.Fields.fst.checked",
"Hacl.Impl.Poly1305.fsti.checked",
"FStar.Pervasives.fsti.checked"... | [
{
"abbrev": false,
"full_module": "Hacl.Streaming.Poly1305",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Poly1305.Fields",
"short_module": null
},
{
"abbrev": true,
"full_module": "Hacl.Streaming.Interface",
"short_module": "I"
},
{
"abbre... | {
"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.Streaming.Functor.alloca_st (Hacl.Streaming.Poly1305.poly1305 Hacl.Impl.Poly1305.Fields.M256)
()
(Hacl.Streaming.Poly1305.t Hacl.Impl.Poly1305.Fields.M256)
(Stateful?.s Hacl.Streaming.Poly1305.poly1305_key ()) | Prims.Tot | [
"total"
] | [] | [
"Hacl.Streaming.Functor.alloca",
"Prims.unit",
"Hacl.Streaming.Poly1305.poly1305",
"Hacl.Impl.Poly1305.Fields.M256",
"Hacl.Streaming.Poly1305.t",
"Hacl.Streaming.Interface.__proj__Stateful__item__s",
"Hacl.Streaming.Poly1305.poly1305_key"
] | [] | false | false | false | false | false | let alloca =
| F.alloca (poly1305 M256) () (t M256) (poly1305_key.I.s ()) | false | |
Hacl.Streaming.Poly1305_256.fsti | Hacl.Streaming.Poly1305_256.digest | val digest : Hacl.Streaming.Functor.digest_st (Hacl.Streaming.Poly1305.poly1305 Hacl.Impl.Poly1305.Fields.M256)
()
(Hacl.Streaming.Poly1305.t Hacl.Impl.Poly1305.Fields.M256)
(Stateful?.s Hacl.Streaming.Poly1305.poly1305_key ()) | let digest = F.digest (poly1305 M256) () (t M256) (poly1305_key.I.s ()) | {
"file_name": "code/streaming/Hacl.Streaming.Poly1305_256.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 71,
"end_line": 21,
"start_col": 0,
"start_line": 21
} | module Hacl.Streaming.Poly1305_256
module G = FStar.Ghost
module F = Hacl.Streaming.Functor
module I = Hacl.Streaming.Interface
open Hacl.Impl.Poly1305.Fields
open Hacl.Streaming.Poly1305
#set-options "--fuel 0 --ifuel 0 --z3rlimit 100"
/// Type abbreviation - makes KaRaMeL use pretty names in the generated code
le... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Hacl.Streaming.Poly1305.fst.checked",
"Hacl.Streaming.Interface.fsti.checked",
"Hacl.Streaming.Functor.fsti.checked",
"Hacl.Impl.Poly1305.Fields.fst.checked",
"Hacl.Impl.Poly1305.fsti.checked",
"FStar.Pervasives.fsti.checked"... | [
{
"abbrev": false,
"full_module": "Hacl.Streaming.Poly1305",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Poly1305.Fields",
"short_module": null
},
{
"abbrev": true,
"full_module": "Hacl.Streaming.Interface",
"short_module": "I"
},
{
"abbre... | {
"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.Streaming.Functor.digest_st (Hacl.Streaming.Poly1305.poly1305 Hacl.Impl.Poly1305.Fields.M256)
()
(Hacl.Streaming.Poly1305.t Hacl.Impl.Poly1305.Fields.M256)
(Stateful?.s Hacl.Streaming.Poly1305.poly1305_key ()) | Prims.Tot | [
"total"
] | [] | [
"Hacl.Streaming.Functor.digest",
"Prims.unit",
"Hacl.Streaming.Poly1305.poly1305",
"Hacl.Impl.Poly1305.Fields.M256",
"Hacl.Streaming.Poly1305.t",
"Hacl.Streaming.Interface.__proj__Stateful__item__s",
"Hacl.Streaming.Poly1305.poly1305_key"
] | [] | false | false | false | false | false | let digest =
| F.digest (poly1305 M256) () (t M256) (poly1305_key.I.s ()) | false | |
Hacl.Streaming.Poly1305_256.fsti | Hacl.Streaming.Poly1305_256.free | val free : Hacl.Streaming.Functor.free_st (Hacl.Streaming.Poly1305.poly1305 Hacl.Impl.Poly1305.Fields.M256)
(FStar.Ghost.reveal (FStar.Ghost.hide ()))
(Hacl.Streaming.Poly1305.t Hacl.Impl.Poly1305.Fields.M256)
(Stateful?.s Hacl.Streaming.Poly1305.poly1305_key ()) | let free = F.free (poly1305 M256) (G.hide ()) (t M256) (poly1305_key.I.s ()) | {
"file_name": "code/streaming/Hacl.Streaming.Poly1305_256.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 76,
"end_line": 22,
"start_col": 0,
"start_line": 22
} | module Hacl.Streaming.Poly1305_256
module G = FStar.Ghost
module F = Hacl.Streaming.Functor
module I = Hacl.Streaming.Interface
open Hacl.Impl.Poly1305.Fields
open Hacl.Streaming.Poly1305
#set-options "--fuel 0 --ifuel 0 --z3rlimit 100"
/// Type abbreviation - makes KaRaMeL use pretty names in the generated code
le... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Hacl.Streaming.Poly1305.fst.checked",
"Hacl.Streaming.Interface.fsti.checked",
"Hacl.Streaming.Functor.fsti.checked",
"Hacl.Impl.Poly1305.Fields.fst.checked",
"Hacl.Impl.Poly1305.fsti.checked",
"FStar.Pervasives.fsti.checked"... | [
{
"abbrev": false,
"full_module": "Hacl.Streaming.Poly1305",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Poly1305.Fields",
"short_module": null
},
{
"abbrev": true,
"full_module": "Hacl.Streaming.Interface",
"short_module": "I"
},
{
"abbre... | {
"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.Streaming.Functor.free_st (Hacl.Streaming.Poly1305.poly1305 Hacl.Impl.Poly1305.Fields.M256)
(FStar.Ghost.reveal (FStar.Ghost.hide ()))
(Hacl.Streaming.Poly1305.t Hacl.Impl.Poly1305.Fields.M256)
(Stateful?.s Hacl.Streaming.Poly1305.poly1305_key ()) | Prims.Tot | [
"total"
] | [] | [
"Hacl.Streaming.Functor.free",
"Prims.unit",
"Hacl.Streaming.Poly1305.poly1305",
"Hacl.Impl.Poly1305.Fields.M256",
"FStar.Ghost.hide",
"Hacl.Streaming.Poly1305.t",
"Hacl.Streaming.Interface.__proj__Stateful__item__s",
"Hacl.Streaming.Poly1305.poly1305_key"
] | [] | false | false | false | false | false | let free =
| F.free (poly1305 M256) (G.hide ()) (t M256) (poly1305_key.I.s ()) | false | |
Hacl.Impl.Chacha20.Core32.fst | Hacl.Impl.Chacha20.Core32.create_state | val create_state: unit ->
StackInline state
(requires fun h -> True)
(ensures fun h0 r h1 -> live h1 r /\
as_seq h1 r == Seq.create 16 (u32 0) /\
stack_allocated r h0 h1 (Seq.create 16 (u32 0))) | val create_state: unit ->
StackInline state
(requires fun h -> True)
(ensures fun h0 r h1 -> live h1 r /\
as_seq h1 r == Seq.create 16 (u32 0) /\
stack_allocated r h0 h1 (Seq.create 16 (u32 0))) | let create_state () = create (size 16) (u32 0) | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Core32.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 46,
"end_line": 27,
"start_col": 0,
"start_line": 27
} | module Hacl.Impl.Chacha20.Core32
open FStar.HyperStack
open FStar.HyperStack.All
open Lib.IntTypes
open Lib.Sequence
open Lib.Buffer
open Lib.ByteBuffer
module ST = FStar.HyperStack.ST
module Spec = Spec.Chacha20
let state = lbuffer uint32 16ul
let index = i:size_t{size_v i < 16}
inline_for_extraction
val create... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.... | [
{
"abbrev": true,
"full_module": "Spec.Chacha20",
"short_module": "Spec"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> FStar.HyperStack.ST.StackInline Hacl.Impl.Chacha20.Core32.state | FStar.HyperStack.ST.StackInline | [] | [] | [
"Prims.unit",
"Lib.Buffer.create",
"Lib.IntTypes.uint32",
"Lib.IntTypes.size",
"Lib.IntTypes.u32",
"Lib.Buffer.lbuffer",
"Hacl.Impl.Chacha20.Core32.state"
] | [] | false | true | false | false | false | let create_state () =
| create (size 16) (u32 0) | false |
Hacl.Streaming.Poly1305_256.fsti | Hacl.Streaming.Poly1305_256.reset | val reset : Hacl.Streaming.Functor.reset_st (Hacl.Streaming.Poly1305.poly1305 Hacl.Impl.Poly1305.Fields.M256)
(FStar.Ghost.hide (FStar.Ghost.reveal (FStar.Ghost.hide ())))
(Hacl.Streaming.Poly1305.t Hacl.Impl.Poly1305.Fields.M256)
(Stateful?.s Hacl.Streaming.Poly1305.poly1305_key ()) | let reset = F.reset (poly1305 M256) (G.hide ()) (t M256) (poly1305_key.I.s ()) | {
"file_name": "code/streaming/Hacl.Streaming.Poly1305_256.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 78,
"end_line": 18,
"start_col": 0,
"start_line": 18
} | module Hacl.Streaming.Poly1305_256
module G = FStar.Ghost
module F = Hacl.Streaming.Functor
module I = Hacl.Streaming.Interface
open Hacl.Impl.Poly1305.Fields
open Hacl.Streaming.Poly1305
#set-options "--fuel 0 --ifuel 0 --z3rlimit 100"
/// Type abbreviation - makes KaRaMeL use pretty names in the generated code
le... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Hacl.Streaming.Poly1305.fst.checked",
"Hacl.Streaming.Interface.fsti.checked",
"Hacl.Streaming.Functor.fsti.checked",
"Hacl.Impl.Poly1305.Fields.fst.checked",
"Hacl.Impl.Poly1305.fsti.checked",
"FStar.Pervasives.fsti.checked"... | [
{
"abbrev": false,
"full_module": "Hacl.Streaming.Poly1305",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Poly1305.Fields",
"short_module": null
},
{
"abbrev": true,
"full_module": "Hacl.Streaming.Interface",
"short_module": "I"
},
{
"abbre... | {
"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.Streaming.Functor.reset_st (Hacl.Streaming.Poly1305.poly1305 Hacl.Impl.Poly1305.Fields.M256)
(FStar.Ghost.hide (FStar.Ghost.reveal (FStar.Ghost.hide ())))
(Hacl.Streaming.Poly1305.t Hacl.Impl.Poly1305.Fields.M256)
(Stateful?.s Hacl.Streaming.Poly1305.poly1305_key ()) | Prims.Tot | [
"total"
] | [] | [
"Hacl.Streaming.Functor.reset",
"Prims.unit",
"Hacl.Streaming.Poly1305.poly1305",
"Hacl.Impl.Poly1305.Fields.M256",
"FStar.Ghost.hide",
"Hacl.Streaming.Poly1305.t",
"Hacl.Streaming.Interface.__proj__Stateful__item__s",
"Hacl.Streaming.Poly1305.poly1305_key"
] | [] | false | false | false | false | false | let reset =
| F.reset (poly1305 M256) (G.hide ()) (t M256) (poly1305_key.I.s ()) | false | |
Hacl.Impl.Chacha20.Core32.fst | Hacl.Impl.Chacha20.Core32.line | val line:
st:state
-> a:index
-> b:index
-> d:index
-> r:rotval U32 ->
Stack unit
(requires fun h -> live h st /\ v a <> v d)
(ensures fun h0 _ h1 -> modifies (loc st) h0 h1 /\
as_seq h1 st == Spec.line (v a) (v b) (v d) r (as_seq h0 st)) | val line:
st:state
-> a:index
-> b:index
-> d:index
-> r:rotval U32 ->
Stack unit
(requires fun h -> live h st /\ v a <> v d)
(ensures fun h0 _ h1 -> modifies (loc st) h0 h1 /\
as_seq h1 st == Spec.line (v a) (v b) (v d) r (as_seq h0 st)) | let line st a b d r =
let sta = st.(a) in
let stb = st.(b) in
let std = st.(d) in
let sta = sta +. stb in
let std = std ^. sta in
let std = rotate_left std r in
st.(a) <- sta;
st.(d) <- std | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Core32.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 15,
"end_line": 144,
"start_col": 0,
"start_line": 136
} | module Hacl.Impl.Chacha20.Core32
open FStar.HyperStack
open FStar.HyperStack.All
open Lib.IntTypes
open Lib.Sequence
open Lib.Buffer
open Lib.ByteBuffer
module ST = FStar.HyperStack.ST
module Spec = Spec.Chacha20
let state = lbuffer uint32 16ul
let index = i:size_t{size_v i < 16}
inline_for_extraction
val create... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.... | [
{
"abbrev": true,
"full_module": "Spec.Chacha20",
"short_module": "Spec"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
st: Hacl.Impl.Chacha20.Core32.state ->
a: Hacl.Impl.Chacha20.Core32.index ->
b: Hacl.Impl.Chacha20.Core32.index ->
d: Hacl.Impl.Chacha20.Core32.index ->
r: Lib.IntTypes.rotval Lib.IntTypes.U32
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Impl.Chacha20.Core32.state",
"Hacl.Impl.Chacha20.Core32.index",
"Lib.IntTypes.rotval",
"Lib.IntTypes.U32",
"Lib.Buffer.op_Array_Assignment",
"Lib.IntTypes.uint32",
"FStar.UInt32.__uint_to_t",
"Prims.unit",
"Lib.IntTypes.int_t",
"Lib.IntTypes.SEC",
"Lib.IntTypes.rotate_left",
"Lib.IntType... | [] | false | true | false | false | false | let line st a b d r =
| let sta = st.(a) in
let stb = st.(b) in
let std = st.(d) in
let sta = sta +. stb in
let std = std ^. sta in
let std = rotate_left std r in
st.(a) <- sta;
st.(d) <- std | false |
CBOR.Spec.Map.fst | CBOR.Spec.Map.list_sorted_order_elim | val list_sorted_order_elim
(#t: Type)
(order: (t -> t -> bool))
(l0: list t)
(a1: t)
(l1: list t)
(a2: t)
(l2: list t)
: Lemma
(requires
((forall x y z. (order x y /\ order y z) ==> order x z) /\
List.Tot.sorted order (l0 `List.Tot.append` (a1 :: (l1... | val list_sorted_order_elim
(#t: Type)
(order: (t -> t -> bool))
(l0: list t)
(a1: t)
(l1: list t)
(a2: t)
(l2: list t)
: Lemma
(requires
((forall x y z. (order x y /\ order y z) ==> order x z) /\
List.Tot.sorted order (l0 `List.Tot.append` (a1 :: (l1... | let rec list_sorted_order_elim
(#t: Type)
(order: t -> t -> bool)
(l0: list t)
(a1: t)
(l1: list t)
(a2: t)
(l2: list t)
: Lemma
(requires (
(forall x y z . (order x y /\ order y z) ==> order x z) /\
List.Tot.sorted order (l0 `List.Tot.append` (a1 :: (l1 `List.Tot.append` (a2 :: l2))))
))
(e... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CBOR.Spec.Map.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 48,
"end_line": 312,
"start_col": 0,
"start_line": 289
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked",
"CBOR.Spec.Type.fsti.checked"
],
"interface_fi... | [
{
"abbrev": false,
"full_module": "CBOR.Spec.Type",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.P... | {
"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 |
order: (_: t -> _: t -> Prims.bool) ->
l0: Prims.list t ->
a1: t ->
l1: Prims.list t ->
a2: t ->
l2: Prims.list t
-> FStar.Pervasives.Lemma
(requires
(forall (x: t) (y: t) (z: t). order x y /\ order y z ==> order x z) /\
FStar.List.Tot.Properties.sorted order (l0 @ a1 ::... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.bool",
"Prims.list",
"CBOR.Spec.Map.list_sorted_order_elim",
"Prims.Nil",
"Prims.unit",
"Prims.l_and",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.b2t",
"FStar.List.Tot.Properties.sorted",
"FStar.List.Tot.Base.append",
"Prims.Cons",
"Prims.squash",
"Prims.eq2",
"FStar.Pervasives.patte... | [
"recursion"
] | false | false | true | false | false | let rec list_sorted_order_elim
(#t: Type)
(order: (t -> t -> bool))
(l0: list t)
(a1: t)
(l1: list t)
(a2: t)
(l2: list t)
: Lemma
(requires
((forall x y z. (order x y /\ order y z) ==> order x z) /\
List.Tot.sorted order (l0 `List.Tot.append` (a1 ::... | match l0 with
| [] ->
(match l1 with
| [] -> ()
| a1' :: l1' -> list_sorted_order_elim order [] a1' l1' a2 l2)
| a0 :: l0' -> list_sorted_order_elim order l0' a1 l1 a2 l2 | false |
CBOR.Spec.Map.fst | CBOR.Spec.Map.list_ghost_assoc_no_repeats_equiv' | val list_ghost_assoc_no_repeats_equiv' (#tk #tv: Type) (l1 l2: list (tk & tv)) (k: tk)
: Lemma
(requires
(List.Tot.no_repeats_p (List.Tot.map fst l1) /\ List.Tot.no_repeats_p (List.Tot.map fst l2) /\
(forall kv. List.Tot.memP kv l1 <==> List.Tot.memP kv l2)))
(ensures (list_ghost_assoc... | val list_ghost_assoc_no_repeats_equiv' (#tk #tv: Type) (l1 l2: list (tk & tv)) (k: tk)
: Lemma
(requires
(List.Tot.no_repeats_p (List.Tot.map fst l1) /\ List.Tot.no_repeats_p (List.Tot.map fst l2) /\
(forall kv. List.Tot.memP kv l1 <==> List.Tot.memP kv l2)))
(ensures (list_ghost_assoc... | let list_ghost_assoc_no_repeats_equiv'
(#tk #tv: Type)
(l1 l2: list (tk & tv))
(k: tk)
: Lemma
(requires (
List.Tot.no_repeats_p (List.Tot.map fst l1) /\
List.Tot.no_repeats_p (List.Tot.map fst l2) /\
(forall kv . List.Tot.memP kv l1 <==> List.Tot.memP kv l2)
))
(ensures (list_ghost_assoc k l1 =... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CBOR.Spec.Map.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 42,
"end_line": 214,
"start_col": 0,
"start_line": 193
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked",
"CBOR.Spec.Type.fsti.checked"
],
"interface_fi... | [
{
"abbrev": false,
"full_module": "CBOR.Spec.Type",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.P... | {
"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 | l1: Prims.list (tk * tv) -> l2: Prims.list (tk * tv) -> k: tk
-> FStar.Pervasives.Lemma
(requires
FStar.List.Tot.Base.no_repeats_p (FStar.List.Tot.Base.map FStar.Pervasives.Native.fst l1) /\
FStar.List.Tot.Base.no_repeats_p (FStar.List.Tot.Base.map FStar.Pervasives.Native.fst l2) /\
(for... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"CBOR.Spec.Map.list_ghost_assoc",
"CBOR.Spec.Map.list_ghost_assoc_no_repeats_mem",
"Prims.unit",
"Prims.l_and",
"FStar.List.Tot.Base.no_repeats_p",
"FStar.List.Tot.Base.map",
"FStar.Pervasives.Native.fst",
"Prims.l_Forall",
"Prims.l_iff",
"FStar.... | [] | false | false | true | false | false | let list_ghost_assoc_no_repeats_equiv' (#tk #tv: Type) (l1 l2: list (tk & tv)) (k: tk)
: Lemma
(requires
(List.Tot.no_repeats_p (List.Tot.map fst l1) /\ List.Tot.no_repeats_p (List.Tot.map fst l2) /\
(forall kv. List.Tot.memP kv l1 <==> List.Tot.memP kv l2)))
(ensures (list_ghost_assoc... | match list_ghost_assoc k l1 with
| None ->
(match list_ghost_assoc k l2 with
| None -> ()
| Some v ->
list_ghost_assoc_no_repeats_mem l2 k v;
list_ghost_assoc_no_repeats_mem l1 k v)
| Some v ->
list_ghost_assoc_no_repeats_mem l1 k v;
list_ghost_assoc_no_repeats_mem l2 k v | false |
CBOR.Spec.Map.fst | CBOR.Spec.Map.list_ghost_assoc_no_repeats_mem_elim | val list_ghost_assoc_no_repeats_mem_elim (#tk #tv: Type) (k: tk) (v: tv) (l: list (tk & tv))
: Lemma (requires (List.Tot.no_repeats_p (List.Tot.map fst l) /\ List.Tot.memP (k, v) l))
(ensures (list_ghost_assoc k l == Some v))
(decreases l) | val list_ghost_assoc_no_repeats_mem_elim (#tk #tv: Type) (k: tk) (v: tv) (l: list (tk & tv))
: Lemma (requires (List.Tot.no_repeats_p (List.Tot.map fst l) /\ List.Tot.memP (k, v) l))
(ensures (list_ghost_assoc k l == Some v))
(decreases l) | let rec list_ghost_assoc_no_repeats_mem_elim
(#tk #tv: Type)
(k: tk)
(v: tv)
(l: list (tk & tv))
: Lemma
(requires (
List.Tot.no_repeats_p (List.Tot.map fst l) /\
List.Tot.memP (k, v) l
))
(ensures (list_ghost_assoc k l == Some v))
(decreases l)
= List.Tot.memP_map_intro fst (k, v) l;
let (k',... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CBOR.Spec.Map.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 50,
"end_line": 181,
"start_col": 0,
"start_line": 162
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked",
"CBOR.Spec.Type.fsti.checked"
],
"interface_fi... | [
{
"abbrev": false,
"full_module": "CBOR.Spec.Type",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.P... | {
"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 | k: tk -> v: tv -> l: Prims.list (tk * tv)
-> FStar.Pervasives.Lemma
(requires
FStar.List.Tot.Base.no_repeats_p (FStar.List.Tot.Base.map FStar.Pervasives.Native.fst l) /\
FStar.List.Tot.Base.memP (k, v) l)
(ensures CBOR.Spec.Map.list_ghost_assoc k l == FStar.Pervasives.Native.Some v)
... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"FStar.StrongExcludedMiddle.strong_excluded_middle",
"Prims.eq2",
"Prims.bool",
"FStar.List.Tot.Properties.memP_map_intro",
"FStar.Pervasives.Native.fst",
"FStar.Pervasives.Native.Mktuple2",
"Prims.unit",
"CBOR.Spec.Map.list_ghost_assoc_no_repeats_me... | [
"recursion"
] | false | false | true | false | false | let rec list_ghost_assoc_no_repeats_mem_elim (#tk #tv: Type) (k: tk) (v: tv) (l: list (tk & tv))
: Lemma (requires (List.Tot.no_repeats_p (List.Tot.map fst l) /\ List.Tot.memP (k, v) l))
(ensures (list_ghost_assoc k l == Some v))
(decreases l) =
| List.Tot.memP_map_intro fst (k, v) l;
let (k', v') :: l' = l in
if FStar.StrongExcludedMiddle.strong_excluded_middle (k == k')
then
if FStar.StrongExcludedMiddle.strong_excluded_middle (v == v')
then ()
else List.Tot.memP_map_intro fst (k, v) l'
else list_ghost_assoc_no_repeats_mem_elim k v l' | false |
Steel.ST.GenElim1.fst | Steel.ST.GenElim1.compute_gen_elim_f_exists0 | val compute_gen_elim_f_exists0
(a: Type0)
(body: (a -> gen_elim_i))
(f: (x: a -> GTot (gen_elim_t (body x))))
: Tot (gen_elim_t (GEExists0 body)) | val compute_gen_elim_f_exists0
(a: Type0)
(body: (a -> gen_elim_i))
(f: (x: a -> GTot (gen_elim_t (body x))))
: Tot (gen_elim_t (GEExists0 body)) | let compute_gen_elim_f_exists0
(a: Type0)
(body: a -> gen_elim_i)
(f: (x: a) -> GTot (gen_elim_t (body x)))
: Tot (gen_elim_t (GEExists0 body))
= fun _ ->
rewrite_with_trefl (compute_gen_elim_p (GEExists0 body)) (exists_ (fun x -> compute_gen_elim_p (body x)));
let gres1 = elim_exists () in
let gres2 = f gr... | {
"file_name": "lib/steel/Steel.ST.GenElim1.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 5,
"end_line": 141,
"start_col": 0,
"start_line": 130
} | module Steel.ST.GenElim1
let gen_elim_f
(p: vprop)
(a: Type)
(q: (a -> vprop))
(post: (a -> prop))
: Tot Type
= ((opened: inames) -> STGhost a opened p q True post)
module U = FStar.Universe
let gen_unit_elim_t (i: gen_unit_elim_i) : Tot Type =
gen_elim_f (compute_gen_unit_elim_p i) (U.raise_t u#_ u#1 unit... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Steel.ST.GenElim1.f... | [
{
"abbrev": true,
"full_module": "FStar.Universe",
"short_module": "U"
},
{
"abbrev": true,
"full_module": "FStar.Tactics",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim1.Base",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
a: Type0 ->
body: (_: a -> Steel.ST.GenElim1.Base.gen_elim_i) ->
f: (x: a -> Prims.GTot (Steel.ST.GenElim1.gen_elim_t (body x)))
-> Steel.ST.GenElim1.gen_elim_t (Steel.ST.GenElim1.Base.GEExists0 body) | Prims.Tot | [
"total"
] | [] | [
"Steel.ST.GenElim1.Base.gen_elim_i",
"Steel.ST.GenElim1.gen_elim_t",
"Steel.Memory.inames",
"Steel.ST.GenElim1.Base.compute_gen_elim_a",
"Steel.ST.GenElim1.Base.GEExists0",
"Prims.unit",
"Steel.ST.Util.rewrite",
"Steel.ST.GenElim1.Base.compute_gen_elim_q",
"FStar.Ghost.reveal",
"Steel.ST.GenElim1.... | [] | false | false | false | false | false | let compute_gen_elim_f_exists0
(a: Type0)
(body: (a -> gen_elim_i))
(f: (x: a -> GTot (gen_elim_t (body x))))
: Tot (gen_elim_t (GEExists0 body)) =
| fun _ ->
rewrite_with_trefl (compute_gen_elim_p (GEExists0 body))
(exists_ (fun x -> compute_gen_elim_p (body x)));
let gres1 = elim_exists () in
let gres2 = f gres1 _ in
let res:compute_gen_elim_a (GEExists0 body) =
coerce_with_trefl (Mkdtuple2 #a
#(fun x -> compute_gen_elim_a (body x))
... | false |
CBOR.Spec.Map.fst | CBOR.Spec.Map.list_ghost_assoc_mem_intro | val list_ghost_assoc_mem_intro (#tk #tv: Type) (k: tk) (v: tv) (l: list (tk & tv))
: Lemma (requires (list_ghost_assoc k l == Some v))
(ensures (List.Tot.memP (k, v) l))
(decreases l) | val list_ghost_assoc_mem_intro (#tk #tv: Type) (k: tk) (v: tv) (l: list (tk & tv))
: Lemma (requires (list_ghost_assoc k l == Some v))
(ensures (List.Tot.memP (k, v) l))
(decreases l) | let rec list_ghost_assoc_mem_intro
(#tk #tv: Type)
(k: tk)
(v: tv)
(l: list (tk & tv))
: Lemma
(requires (list_ghost_assoc k l == Some v))
(ensures (List.Tot.memP (k, v) l))
(decreases l)
= let (k', v') :: l' = l in
if FStar.StrongExcludedMiddle.strong_excluded_middle (k == k')
then ()
else list_gho... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CBOR.Spec.Map.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 40,
"end_line": 160,
"start_col": 0,
"start_line": 148
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked",
"CBOR.Spec.Type.fsti.checked"
],
"interface_fi... | [
{
"abbrev": false,
"full_module": "CBOR.Spec.Type",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.P... | {
"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 | k: tk -> v: tv -> l: Prims.list (tk * tv)
-> FStar.Pervasives.Lemma
(requires CBOR.Spec.Map.list_ghost_assoc k l == FStar.Pervasives.Native.Some v)
(ensures FStar.List.Tot.Base.memP (k, v) l)
(decreases l) | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"FStar.StrongExcludedMiddle.strong_excluded_middle",
"Prims.eq2",
"Prims.bool",
"CBOR.Spec.Map.list_ghost_assoc_mem_intro",
"Prims.unit",
"FStar.Pervasives.Native.option",
"CBOR.Spec.Map.list_ghost_assoc",
"FStar.Pervasives.Native.Some",
"Prims.squ... | [
"recursion"
] | false | false | true | false | false | let rec list_ghost_assoc_mem_intro (#tk #tv: Type) (k: tk) (v: tv) (l: list (tk & tv))
: Lemma (requires (list_ghost_assoc k l == Some v))
(ensures (List.Tot.memP (k, v) l))
(decreases l) =
| let (k', v') :: l' = l in
if FStar.StrongExcludedMiddle.strong_excluded_middle (k == k')
then ()
else list_ghost_assoc_mem_intro k v l' | false |
Hacl.Impl.Chacha20.Core32.fst | Hacl.Impl.Chacha20.Core32.set_counter | val set_counter:
st:state
-> c:size_t ->
Stack unit
(requires fun h -> live h st)
(ensures fun h0 _ h1 -> modifies (loc st) h0 h1 /\
as_seq h1 st == Seq.upd (as_seq h0 st) 12 (size_to_uint32 c)) | val set_counter:
st:state
-> c:size_t ->
Stack unit
(requires fun h -> live h st)
(ensures fun h0 _ h1 -> modifies (loc st) h0 h1 /\
as_seq h1 st == Seq.upd (as_seq h0 st) 12 (size_to_uint32 c)) | let set_counter st c =
st.(size 12) <- size_to_uint32 c | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Core32.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 34,
"end_line": 66,
"start_col": 0,
"start_line": 65
} | module Hacl.Impl.Chacha20.Core32
open FStar.HyperStack
open FStar.HyperStack.All
open Lib.IntTypes
open Lib.Sequence
open Lib.Buffer
open Lib.ByteBuffer
module ST = FStar.HyperStack.ST
module Spec = Spec.Chacha20
let state = lbuffer uint32 16ul
let index = i:size_t{size_v i < 16}
inline_for_extraction
val create... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.... | [
{
"abbrev": true,
"full_module": "Spec.Chacha20",
"short_module": "Spec"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | st: Hacl.Impl.Chacha20.Core32.state -> c: Lib.IntTypes.size_t
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Impl.Chacha20.Core32.state",
"Lib.IntTypes.size_t",
"Lib.Buffer.op_Array_Assignment",
"Lib.IntTypes.uint32",
"FStar.UInt32.__uint_to_t",
"Lib.IntTypes.size",
"Lib.IntTypes.size_to_uint32",
"Prims.unit"
] | [] | false | true | false | false | false | let set_counter st c =
| st.(size 12) <- size_to_uint32 c | false |
Hacl.Impl.Chacha20.Core32.fst | Hacl.Impl.Chacha20.Core32.quarter_round | val quarter_round:
st:state
-> a:index
-> b:index
-> c:index
-> d:index ->
Stack unit
(requires fun h -> live h st /\ v a <> v d /\ v c <> v b)
(ensures fun h0 _ h1 -> modifies (loc st) h0 h1 /\
as_seq h1 st == Spec.quarter_round (v a) (v b) (v c) (v d) (as_seq h0 st)) | val quarter_round:
st:state
-> a:index
-> b:index
-> c:index
-> d:index ->
Stack unit
(requires fun h -> live h st /\ v a <> v d /\ v c <> v b)
(ensures fun h0 _ h1 -> modifies (loc st) h0 h1 /\
as_seq h1 st == Spec.quarter_round (v a) (v b) (v c) (v d) (as_seq h0 st)) | let quarter_round st a b c d =
line st a b d (size 16);
line st c d b (size 12);
line st a b d (size 8);
line st c d b (size 7) | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Core32.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 24,
"end_line": 163,
"start_col": 0,
"start_line": 159
} | module Hacl.Impl.Chacha20.Core32
open FStar.HyperStack
open FStar.HyperStack.All
open Lib.IntTypes
open Lib.Sequence
open Lib.Buffer
open Lib.ByteBuffer
module ST = FStar.HyperStack.ST
module Spec = Spec.Chacha20
let state = lbuffer uint32 16ul
let index = i:size_t{size_v i < 16}
inline_for_extraction
val create... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.... | [
{
"abbrev": true,
"full_module": "Spec.Chacha20",
"short_module": "Spec"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
st: Hacl.Impl.Chacha20.Core32.state ->
a: Hacl.Impl.Chacha20.Core32.index ->
b: Hacl.Impl.Chacha20.Core32.index ->
c: Hacl.Impl.Chacha20.Core32.index ->
d: Hacl.Impl.Chacha20.Core32.index
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Impl.Chacha20.Core32.state",
"Hacl.Impl.Chacha20.Core32.index",
"Hacl.Impl.Chacha20.Core32.line",
"Lib.IntTypes.size",
"Prims.unit"
] | [] | false | true | false | false | false | let quarter_round st a b c d =
| line st a b d (size 16);
line st c d b (size 12);
line st a b d (size 8);
line st c d b (size 7) | false |
Hacl.Impl.Chacha20.Core32.fst | Hacl.Impl.Chacha20.Core32.store_state | val store_state:
b:lbuffer uint8 64ul
-> st:state ->
Stack unit
(requires fun h -> live h st /\ live h b /\ disjoint st b)
(ensures fun h0 _ h1 -> modifies (loc b) h0 h1 /\
as_seq h1 b == Lib.ByteSequence.uints_to_bytes_le (as_seq h0 st)) | val store_state:
b:lbuffer uint8 64ul
-> st:state ->
Stack unit
(requires fun h -> live h st /\ live h b /\ disjoint st b)
(ensures fun h0 _ h1 -> modifies (loc b) h0 h1 /\
as_seq h1 b == Lib.ByteSequence.uints_to_bytes_le (as_seq h0 st)) | let store_state st b =
uints_to_bytes_le 16ul st b | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Core32.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 29,
"end_line": 53,
"start_col": 0,
"start_line": 52
} | module Hacl.Impl.Chacha20.Core32
open FStar.HyperStack
open FStar.HyperStack.All
open Lib.IntTypes
open Lib.Sequence
open Lib.Buffer
open Lib.ByteBuffer
module ST = FStar.HyperStack.ST
module Spec = Spec.Chacha20
let state = lbuffer uint32 16ul
let index = i:size_t{size_v i < 16}
inline_for_extraction
val create... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.... | [
{
"abbrev": true,
"full_module": "Spec.Chacha20",
"short_module": "Spec"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | b: Lib.Buffer.lbuffer Lib.IntTypes.uint8 64ul -> st: Hacl.Impl.Chacha20.Core32.state
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"FStar.UInt32.__uint_to_t",
"Hacl.Impl.Chacha20.Core32.state",
"Lib.ByteBuffer.uints_to_bytes_le",
"Lib.IntTypes.U32",
"Lib.IntTypes.SEC",
"Prims.unit"
] | [] | false | true | false | false | false | let store_state st b =
| uints_to_bytes_le 16ul st b | false |
CBOR.Spec.Map.fst | CBOR.Spec.Map.list_ghost_assoc_no_repeats_equiv | val list_ghost_assoc_no_repeats_equiv (#tk #tv: Type) (l1 l2: list (tk & tv))
: Lemma
(requires
(List.Tot.no_repeats_p (List.Tot.map fst l1) /\ List.Tot.no_repeats_p (List.Tot.map fst l2) /\
(forall kv. List.Tot.memP kv l1 <==> List.Tot.memP kv l2)))
(ensures (forall k. list_ghost_asso... | val list_ghost_assoc_no_repeats_equiv (#tk #tv: Type) (l1 l2: list (tk & tv))
: Lemma
(requires
(List.Tot.no_repeats_p (List.Tot.map fst l1) /\ List.Tot.no_repeats_p (List.Tot.map fst l2) /\
(forall kv. List.Tot.memP kv l1 <==> List.Tot.memP kv l2)))
(ensures (forall k. list_ghost_asso... | let list_ghost_assoc_no_repeats_equiv
(#tk #tv: Type)
(l1 l2: list (tk & tv))
: Lemma
(requires (
List.Tot.no_repeats_p (List.Tot.map fst l1) /\
List.Tot.no_repeats_p (List.Tot.map fst l2) /\
(forall kv . List.Tot.memP kv l1 <==> List.Tot.memP kv l2)
))
(ensures (forall k . list_ghost_assoc k l1 =... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CBOR.Spec.Map.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 93,
"end_line": 226,
"start_col": 0,
"start_line": 216
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked",
"CBOR.Spec.Type.fsti.checked"
],
"interface_fi... | [
{
"abbrev": false,
"full_module": "CBOR.Spec.Type",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.P... | {
"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 | l1: Prims.list (tk * tv) -> l2: Prims.list (tk * tv)
-> FStar.Pervasives.Lemma
(requires
FStar.List.Tot.Base.no_repeats_p (FStar.List.Tot.Base.map FStar.Pervasives.Native.fst l1) /\
FStar.List.Tot.Base.no_repeats_p (FStar.List.Tot.Base.map FStar.Pervasives.Native.fst l2) /\
(forall (kv: ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"FStar.Classical.forall_intro",
"Prims.l_imp",
"Prims.l_and",
"FStar.List.Tot.Base.no_repeats_p",
"FStar.List.Tot.Base.map",
"FStar.Pervasives.Native.fst",
"Prims.l_Forall",
"Prims.l_iff",
"FStar.List.Tot.Base.memP",
"Prims.eq2",
"FStar.Pervasi... | [] | false | false | true | false | false | let list_ghost_assoc_no_repeats_equiv (#tk #tv: Type) (l1 l2: list (tk & tv))
: Lemma
(requires
(List.Tot.no_repeats_p (List.Tot.map fst l1) /\ List.Tot.no_repeats_p (List.Tot.map fst l2) /\
(forall kv. List.Tot.memP kv l1 <==> List.Tot.memP kv l2)))
(ensures (forall k. list_ghost_asso... | Classical.forall_intro (Classical.move_requires (list_ghost_assoc_no_repeats_equiv' l1 l2)) | false |
Steel.ST.GenElim1.fst | Steel.ST.GenElim1.compute_gen_elim_f_star | val compute_gen_elim_f_star
(i1: gen_elim_i)
(f1: gen_elim_t i1)
(i2: gen_elim_i)
(f2: gen_elim_t i2)
: GTot (gen_elim_t (GEStar i1 i2)) | val compute_gen_elim_f_star
(i1: gen_elim_i)
(f1: gen_elim_t i1)
(i2: gen_elim_i)
(f2: gen_elim_t i2)
: GTot (gen_elim_t (GEStar i1 i2)) | let compute_gen_elim_f_star
(i1: gen_elim_i)
(f1: gen_elim_t i1)
(i2: gen_elim_i)
(f2: gen_elim_t i2)
: GTot (gen_elim_t (GEStar i1 i2))
= fun _ ->
rewrite (compute_gen_elim_p (GEStar i1 i2)) (compute_gen_elim_p i1 `star` compute_gen_elim_p i2);
let res1 = f1 _ in
let res2 = f2 _ in
let res : compute_ge... | {
"file_name": "lib/steel/Steel.ST.GenElim1.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 5,
"end_line": 97,
"start_col": 0,
"start_line": 85
} | module Steel.ST.GenElim1
let gen_elim_f
(p: vprop)
(a: Type)
(q: (a -> vprop))
(post: (a -> prop))
: Tot Type
= ((opened: inames) -> STGhost a opened p q True post)
module U = FStar.Universe
let gen_unit_elim_t (i: gen_unit_elim_i) : Tot Type =
gen_elim_f (compute_gen_unit_elim_p i) (U.raise_t u#_ u#1 unit... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Steel.ST.GenElim1.f... | [
{
"abbrev": true,
"full_module": "FStar.Universe",
"short_module": "U"
},
{
"abbrev": true,
"full_module": "FStar.Tactics",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim1.Base",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"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 |
i1: Steel.ST.GenElim1.Base.gen_elim_i ->
f1: Steel.ST.GenElim1.gen_elim_t i1 ->
i2: Steel.ST.GenElim1.Base.gen_elim_i ->
f2: Steel.ST.GenElim1.gen_elim_t i2
-> Prims.GTot (Steel.ST.GenElim1.gen_elim_t (Steel.ST.GenElim1.Base.GEStar i1 i2)) | Prims.GTot | [
"sometrivial"
] | [] | [
"Steel.ST.GenElim1.Base.gen_elim_i",
"Steel.ST.GenElim1.gen_elim_t",
"Steel.Memory.inames",
"Steel.ST.GenElim1.Base.compute_gen_elim_a",
"Steel.ST.GenElim1.Base.GEStar",
"Prims.unit",
"Steel.ST.Util.rewrite",
"Steel.Effect.Common.star",
"Steel.ST.GenElim1.Base.compute_gen_elim_q",
"Steel.ST.GenEli... | [] | false | false | false | false | false | let compute_gen_elim_f_star
(i1: gen_elim_i)
(f1: gen_elim_t i1)
(i2: gen_elim_i)
(f2: gen_elim_t i2)
: GTot (gen_elim_t (GEStar i1 i2)) =
| fun _ ->
rewrite (compute_gen_elim_p (GEStar i1 i2))
((compute_gen_elim_p i1) `star` (compute_gen_elim_p i2));
let res1 = f1 _ in
let res2 = f2 _ in
let res:compute_gen_elim_a (GEStar i1 i2) = coerce_with_trefl (res1, res2) in
rewrite ((compute_gen_elim_q i1 res1) `star` (compute_gen_elim_q i2 res2))
... | false |
CBOR.Spec.Map.fst | CBOR.Spec.Map.list_sorted_append_chunk_elim | val list_sorted_append_chunk_elim (#t: Type) (order: (t -> t -> bool)) (l1 l2 l3: list t)
: Lemma
(requires
((forall x y z. (order x y /\ order y z) ==> order x z) /\
List.Tot.sorted order (l1 `List.Tot.append` (l2 `List.Tot.append` l3))))
(ensures (List.Tot.sorted order (l1 `List.Tot.... | val list_sorted_append_chunk_elim (#t: Type) (order: (t -> t -> bool)) (l1 l2 l3: list t)
: Lemma
(requires
((forall x y z. (order x y /\ order y z) ==> order x z) /\
List.Tot.sorted order (l1 `List.Tot.append` (l2 `List.Tot.append` l3))))
(ensures (List.Tot.sorted order (l1 `List.Tot.... | let rec list_sorted_append_chunk_elim
(#t: Type)
(order: t -> t -> bool)
(l1 l2 l3: list t)
: Lemma
(requires (
(forall x y z . (order x y /\ order y z) ==> order x z) /\
List.Tot.sorted order (l1 `List.Tot.append` (l2 `List.Tot.append` l3))
))
(ensures (
List.Tot.sorted order (l1 `List.Tot.appe... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CBOR.Spec.Map.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 61,
"end_line": 336,
"start_col": 0,
"start_line": 314
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked",
"CBOR.Spec.Type.fsti.checked"
],
"interface_fi... | [
{
"abbrev": false,
"full_module": "CBOR.Spec.Type",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.P... | {
"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 | order: (_: t -> _: t -> Prims.bool) -> l1: Prims.list t -> l2: Prims.list t -> l3: Prims.list t
-> FStar.Pervasives.Lemma
(requires
(forall (x: t) (y: t) (z: t). order x y /\ order y z ==> order x z) /\
FStar.List.Tot.Properties.sorted order (l1 @ l2 @ l3))
(ensures FStar.List.Tot.Properti... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.bool",
"Prims.list",
"CBOR.Spec.Map.list_sorted_append_elim",
"CBOR.Spec.Map.list_sorted_order_elim",
"Prims.Nil",
"Prims.unit",
"CBOR.Spec.Map.list_sorted_append_chunk_elim",
"Prims.l_and",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.b2t",
"FStar.List.Tot.Properties.sorted",
"FStar.List.... | [
"recursion"
] | false | false | true | false | false | let rec list_sorted_append_chunk_elim (#t: Type) (order: (t -> t -> bool)) (l1 l2 l3: list t)
: Lemma
(requires
((forall x y z. (order x y /\ order y z) ==> order x z) /\
List.Tot.sorted order (l1 `List.Tot.append` (l2 `List.Tot.append` l3))))
(ensures (List.Tot.sorted order (l1 `List.... | match l1 with
| [] -> list_sorted_append_elim order l2 l3
| [a] ->
(match l3 with
| [] -> ()
| b :: q ->
list_sorted_append_elim order l2 l3;
list_sorted_order_elim order [] a l2 b q)
| _ :: l1' -> list_sorted_append_chunk_elim order l1' l2 l3 | false |
CBOR.Spec.Map.fst | CBOR.Spec.Map.list_ghost_assoc_no_repeats_mem | val list_ghost_assoc_no_repeats_mem (#tk #tv: Type) (l: list (tk & tv)) (k: tk) (v: tv)
: Lemma
(ensures
(List.Tot.no_repeats_p (List.Tot.map fst l) ==>
(list_ghost_assoc k l == Some v <==> List.Tot.memP (k, v) l))) | val list_ghost_assoc_no_repeats_mem (#tk #tv: Type) (l: list (tk & tv)) (k: tk) (v: tv)
: Lemma
(ensures
(List.Tot.no_repeats_p (List.Tot.map fst l) ==>
(list_ghost_assoc k l == Some v <==> List.Tot.memP (k, v) l))) | let list_ghost_assoc_no_repeats_mem
(#tk #tv: Type)
(l: list (tk & tv))
(k: tk)
(v: tv)
: Lemma
(ensures (List.Tot.no_repeats_p (List.Tot.map fst l) ==> (list_ghost_assoc k l == Some v <==> List.Tot.memP (k, v) l)))
= Classical.move_requires (list_ghost_assoc_no_repeats_mem_elim k v) l;
Classical.move_requi... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CBOR.Spec.Map.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 60,
"end_line": 191,
"start_col": 0,
"start_line": 183
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked",
"CBOR.Spec.Type.fsti.checked"
],
"interface_fi... | [
{
"abbrev": false,
"full_module": "CBOR.Spec.Type",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.P... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | l: Prims.list (tk * tv) -> k: tk -> v: tv
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.no_repeats_p (FStar.List.Tot.Base.map FStar.Pervasives.Native.fst l) ==>
(CBOR.Spec.Map.list_ghost_assoc k l == FStar.Pervasives.Native.Some v <==>
FStar.List.Tot.Base.memP (k, v) l)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"FStar.Classical.move_requires",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"CBOR.Spec.Map.list_ghost_assoc",
"FStar.Pervasives.Native.Some",
"FStar.List.Tot.Base.memP",
"FStar.Pervasives.Native.Mktuple2",
"CBOR.Spec.Map.list_ghost_assoc_mem_intr... | [] | false | false | true | false | false | let list_ghost_assoc_no_repeats_mem (#tk #tv: Type) (l: list (tk & tv)) (k: tk) (v: tv)
: Lemma
(ensures
(List.Tot.no_repeats_p (List.Tot.map fst l) ==>
(list_ghost_assoc k l == Some v <==> List.Tot.memP (k, v) l))) =
| Classical.move_requires (list_ghost_assoc_no_repeats_mem_elim k v) l;
Classical.move_requires (list_ghost_assoc_mem_intro k v) l | false |
Hacl.Streaming.Poly1305_256.fsti | Hacl.Streaming.Poly1305_256.update | val update : Hacl.Streaming.Functor.update_st (Hacl.Streaming.Poly1305.poly1305 Hacl.Impl.Poly1305.Fields.M256)
(FStar.Ghost.reveal (FStar.Ghost.hide ()))
(Hacl.Streaming.Poly1305.t Hacl.Impl.Poly1305.Fields.M256)
(Stateful?.s Hacl.Streaming.Poly1305.poly1305_key ()) | let update = F.update (poly1305 M256) (G.hide ()) (t M256) (poly1305_key.I.s ()) | {
"file_name": "code/streaming/Hacl.Streaming.Poly1305_256.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 80,
"end_line": 20,
"start_col": 0,
"start_line": 20
} | module Hacl.Streaming.Poly1305_256
module G = FStar.Ghost
module F = Hacl.Streaming.Functor
module I = Hacl.Streaming.Interface
open Hacl.Impl.Poly1305.Fields
open Hacl.Streaming.Poly1305
#set-options "--fuel 0 --ifuel 0 --z3rlimit 100"
/// Type abbreviation - makes KaRaMeL use pretty names in the generated code
le... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Hacl.Streaming.Poly1305.fst.checked",
"Hacl.Streaming.Interface.fsti.checked",
"Hacl.Streaming.Functor.fsti.checked",
"Hacl.Impl.Poly1305.Fields.fst.checked",
"Hacl.Impl.Poly1305.fsti.checked",
"FStar.Pervasives.fsti.checked"... | [
{
"abbrev": false,
"full_module": "Hacl.Streaming.Poly1305",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Poly1305.Fields",
"short_module": null
},
{
"abbrev": true,
"full_module": "Hacl.Streaming.Interface",
"short_module": "I"
},
{
"abbre... | {
"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.Streaming.Functor.update_st (Hacl.Streaming.Poly1305.poly1305 Hacl.Impl.Poly1305.Fields.M256)
(FStar.Ghost.reveal (FStar.Ghost.hide ()))
(Hacl.Streaming.Poly1305.t Hacl.Impl.Poly1305.Fields.M256)
(Stateful?.s Hacl.Streaming.Poly1305.poly1305_key ()) | Prims.Tot | [
"total"
] | [] | [
"Hacl.Streaming.Functor.update",
"Prims.unit",
"Hacl.Streaming.Poly1305.poly1305",
"Hacl.Impl.Poly1305.Fields.M256",
"FStar.Ghost.hide",
"Hacl.Streaming.Poly1305.t",
"Hacl.Streaming.Interface.__proj__Stateful__item__s",
"Hacl.Streaming.Poly1305.poly1305_key"
] | [] | false | false | false | false | false | let update =
| F.update (poly1305 M256) (G.hide ()) (t M256) (poly1305_key.I.s ()) | false | |
CBOR.Spec.Map.fst | CBOR.Spec.Map.list_splitAt_append | val list_splitAt_append (#t: Type) (n: nat) (l: list t)
: Lemma
(ensures
(let l1, l2 = List.Tot.splitAt n l in
l == l1 `List.Tot.append` l2)) [SMTPat (List.Tot.splitAt n l)] | val list_splitAt_append (#t: Type) (n: nat) (l: list t)
: Lemma
(ensures
(let l1, l2 = List.Tot.splitAt n l in
l == l1 `List.Tot.append` l2)) [SMTPat (List.Tot.splitAt n l)] | let rec list_splitAt_append
(#t: Type)
(n: nat)
(l: list t)
: Lemma
(ensures (let (l1, l2) = List.Tot.splitAt n l in
l == l1 `List.Tot.append` l2
))
[SMTPat (List.Tot.splitAt n l)]
= match l with
| [] -> ()
| a :: q ->
if n = 0 then () else list_splitAt_append (n - 1) q | {
"file_name": "share/steel/examples/pulse/dice/cbor/CBOR.Spec.Map.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 55,
"end_line": 433,
"start_col": 0,
"start_line": 421
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked",
"CBOR.Spec.Type.fsti.checked"
],
"interface_fi... | [
{
"abbrev": false,
"full_module": "CBOR.Spec.Type",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.P... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | n: Prims.nat -> l: Prims.list t
-> FStar.Pervasives.Lemma
(ensures
(let _ = FStar.List.Tot.Base.splitAt n l in
(let FStar.Pervasives.Native.Mktuple2 #_ #_ l1 l2 = _ in
l == l1 @ l2)
<:
Type0)) [SMTPat (FStar.List.Tot.Base.splitAt n l)] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"Prims.list",
"Prims.op_Equality",
"Prims.int",
"Prims.bool",
"CBOR.Spec.Map.list_splitAt_append",
"Prims.op_Subtraction",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"FStar.List.Tot.Base.append",
"FStar.Pervasives.Native.tuple2",
"FStar.List.Tot.Base.splitAt",
... | [
"recursion"
] | false | false | true | false | false | let rec list_splitAt_append (#t: Type) (n: nat) (l: list t)
: Lemma
(ensures
(let l1, l2 = List.Tot.splitAt n l in
l == l1 `List.Tot.append` l2)) [SMTPat (List.Tot.splitAt n l)] =
| match l with
| [] -> ()
| a :: q -> if n = 0 then () else list_splitAt_append (n - 1) q | false |
CBOR.Spec.Map.fst | CBOR.Spec.Map.list_sorted_append_elim | val list_sorted_append_elim (#t: Type) (order: (t -> t -> bool)) (l1 l2: list t)
: Lemma (requires (List.Tot.sorted order (l1 `List.Tot.append` l2)))
(ensures (List.Tot.sorted order l1 /\ List.Tot.sorted order l2))
(decreases l1) | val list_sorted_append_elim (#t: Type) (order: (t -> t -> bool)) (l1 l2: list t)
: Lemma (requires (List.Tot.sorted order (l1 `List.Tot.append` l2)))
(ensures (List.Tot.sorted order l1 /\ List.Tot.sorted order l2))
(decreases l1) | let rec list_sorted_append_elim
(#t: Type)
(order: t -> t -> bool)
(l1 l2: list t)
: Lemma
(requires (List.Tot.sorted order (l1 `List.Tot.append` l2)))
(ensures (
List.Tot.sorted order l1 /\
List.Tot.sorted order l2
))
(decreases l1)
= match l1 with
| [] -> ()
| [_] -> ()
| a :: b :: q ->
... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CBOR.Spec.Map.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 45,
"end_line": 268,
"start_col": 0,
"start_line": 253
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked",
"CBOR.Spec.Type.fsti.checked"
],
"interface_fi... | [
{
"abbrev": false,
"full_module": "CBOR.Spec.Type",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.P... | {
"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 | order: (_: t -> _: t -> Prims.bool) -> l1: Prims.list t -> l2: Prims.list t
-> FStar.Pervasives.Lemma (requires FStar.List.Tot.Properties.sorted order (l1 @ l2))
(ensures
FStar.List.Tot.Properties.sorted order l1 /\ FStar.List.Tot.Properties.sorted order l2)
(decreases l1) | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.bool",
"Prims.list",
"CBOR.Spec.Map.list_sorted_append_elim",
"Prims.Cons",
"Prims.unit",
"Prims.b2t",
"FStar.List.Tot.Properties.sorted",
"FStar.List.Tot.Base.append",
"Prims.squash",
"Prims.l_and",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [
"recursion"
] | false | false | true | false | false | let rec list_sorted_append_elim (#t: Type) (order: (t -> t -> bool)) (l1 l2: list t)
: Lemma (requires (List.Tot.sorted order (l1 `List.Tot.append` l2)))
(ensures (List.Tot.sorted order l1 /\ List.Tot.sorted order l2))
(decreases l1) =
| match l1 with
| [] -> ()
| [_] -> ()
| a :: b :: q -> list_sorted_append_elim order (b :: q) l2 | false |
Hacl.Streaming.Poly1305_256.fsti | Hacl.Streaming.Poly1305_256.state_t | val state_t : Type0 | let state_t = F.state_s (poly1305 M256) () (t M256) (poly1305_key.I.s ()) | {
"file_name": "code/streaming/Hacl.Streaming.Poly1305_256.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 73,
"end_line": 13,
"start_col": 0,
"start_line": 13
} | module Hacl.Streaming.Poly1305_256
module G = FStar.Ghost
module F = Hacl.Streaming.Functor
module I = Hacl.Streaming.Interface
open Hacl.Impl.Poly1305.Fields
open Hacl.Streaming.Poly1305
#set-options "--fuel 0 --ifuel 0 --z3rlimit 100" | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Hacl.Streaming.Poly1305.fst.checked",
"Hacl.Streaming.Interface.fsti.checked",
"Hacl.Streaming.Functor.fsti.checked",
"Hacl.Impl.Poly1305.Fields.fst.checked",
"Hacl.Impl.Poly1305.fsti.checked",
"FStar.Pervasives.fsti.checked"... | [
{
"abbrev": false,
"full_module": "Hacl.Streaming.Poly1305",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Poly1305.Fields",
"short_module": null
},
{
"abbrev": true,
"full_module": "Hacl.Streaming.Interface",
"short_module": "I"
},
{
"abbre... | {
"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 | Type0 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Streaming.Functor.state_s",
"Prims.unit",
"Hacl.Streaming.Poly1305.poly1305",
"Hacl.Impl.Poly1305.Fields.M256",
"Hacl.Streaming.Poly1305.t",
"Hacl.Streaming.Interface.__proj__Stateful__item__s",
"Hacl.Streaming.Poly1305.poly1305_key"
] | [] | false | false | false | true | true | let state_t =
| F.state_s (poly1305 M256) () (t M256) (poly1305_key.I.s ()) | false | |
CBOR.Spec.Map.fst | CBOR.Spec.Map.list_sorted_append_chunk_intro | val list_sorted_append_chunk_intro (#t: Type) (order: (t -> t -> bool)) (l1 l2 l3: list t)
: Lemma
(requires
(List.Tot.sorted order (l1 `List.Tot.append` l2) /\
List.Tot.sorted order (l2 `List.Tot.append` l3) /\ Cons? l2))
(ensures (List.Tot.sorted order (l1 `List.Tot.append` (l2 `List... | val list_sorted_append_chunk_intro (#t: Type) (order: (t -> t -> bool)) (l1 l2 l3: list t)
: Lemma
(requires
(List.Tot.sorted order (l1 `List.Tot.append` l2) /\
List.Tot.sorted order (l2 `List.Tot.append` l3) /\ Cons? l2))
(ensures (List.Tot.sorted order (l1 `List.Tot.append` (l2 `List... | let rec list_sorted_append_chunk_intro
(#t: Type)
(order: t -> t -> bool)
(l1 l2 l3: list t)
: Lemma
(requires (
List.Tot.sorted order (l1 `List.Tot.append` l2) /\
List.Tot.sorted order (l2 `List.Tot.append` l3) /\
Cons? l2
))
(ensures (
List.Tot.sorted order (l1 `List.Tot.append` (l2 `List.... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CBOR.Spec.Map.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 62,
"end_line": 287,
"start_col": 0,
"start_line": 270
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked",
"CBOR.Spec.Type.fsti.checked"
],
"interface_fi... | [
{
"abbrev": false,
"full_module": "CBOR.Spec.Type",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.P... | {
"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 | order: (_: t -> _: t -> Prims.bool) -> l1: Prims.list t -> l2: Prims.list t -> l3: Prims.list t
-> FStar.Pervasives.Lemma
(requires
FStar.List.Tot.Properties.sorted order (l1 @ l2) /\
FStar.List.Tot.Properties.sorted order (l2 @ l3) /\ Cons? l2)
(ensures FStar.List.Tot.Properties.sorted or... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.bool",
"Prims.list",
"CBOR.Spec.Map.list_sorted_append_chunk_intro",
"Prims.unit",
"Prims.l_and",
"Prims.b2t",
"FStar.List.Tot.Properties.sorted",
"FStar.List.Tot.Base.append",
"Prims.uu___is_Cons",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [
"recursion"
] | false | false | true | false | false | let rec list_sorted_append_chunk_intro (#t: Type) (order: (t -> t -> bool)) (l1 l2 l3: list t)
: Lemma
(requires
(List.Tot.sorted order (l1 `List.Tot.append` l2) /\
List.Tot.sorted order (l2 `List.Tot.append` l3) /\ Cons? l2))
(ensures (List.Tot.sorted order (l1 `List.Tot.append` (l2 `... | match l1 with
| [] -> ()
| [a] -> ()
| a :: l1' -> list_sorted_append_chunk_intro order l1' l2 l3 | false |
CBOR.Spec.Map.fst | CBOR.Spec.Map.map_sort | val map_sort (#t1 #t2: Type) (key_compare: (t1 -> t1 -> int)) (l: list (t1 & t2))
: Tot (bool & list (t1 & t2)) (decreases (List.Tot.length l)) | val map_sort (#t1 #t2: Type) (key_compare: (t1 -> t1 -> int)) (l: list (t1 & t2))
: Tot (bool & list (t1 & t2)) (decreases (List.Tot.length l)) | let rec map_sort
(#t1 #t2: Type)
(key_compare: t1 -> t1 -> int)
(l: list (t1 & t2))
: Tot (bool & list (t1 & t2))
(decreases (List.Tot.length l))
= let len = List.Tot.length l in
if len < 2
then (true, l)
else
let (l1, l2) = List.Tot.splitAt (len / 2) l in
let (res, l1') = map_sort key_compare l1 ... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CBOR.Spec.Map.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 48,
"end_line": 454,
"start_col": 0,
"start_line": 436
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked",
"CBOR.Spec.Type.fsti.checked"
],
"interface_fi... | [
{
"abbrev": false,
"full_module": "CBOR.Spec.Type",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.P... | {
"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 | key_compare: (_: t1 -> _: t1 -> Prims.int) -> l: Prims.list (t1 * t2)
-> Prims.Tot (Prims.bool * Prims.list (t1 * t2)) | Prims.Tot | [
"total",
""
] | [] | [
"Prims.int",
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"Prims.op_LessThan",
"FStar.Pervasives.Native.Mktuple2",
"Prims.bool",
"Prims.op_Negation",
"FStar.List.Tot.Base.append",
"CBOR.Spec.Map.map_sort_merge",
"Prims.Nil",
"CBOR.Spec.Map.map_sort",
"FStar.List.Tot.Base.splitAt",
"Prims.... | [
"recursion"
] | false | false | false | true | false | let rec map_sort (#t1 #t2: Type) (key_compare: (t1 -> t1 -> int)) (l: list (t1 & t2))
: Tot (bool & list (t1 & t2)) (decreases (List.Tot.length l)) =
| let len = List.Tot.length l in
if len < 2
then (true, l)
else
let l1, l2 = List.Tot.splitAt (len / 2) l in
let res, l1' = map_sort key_compare l1 in
if not res
then (false, l1' `List.Tot.append` l2)
else
let res, l2' = map_sort key_compare l2 in
if not res then (false, l1' `List.Tot.append` l2') else ... | false |
CBOR.Spec.Map.fst | CBOR.Spec.Map.list_splitAt_length | val list_splitAt_length (#t: Type) (n: nat) (l: list t)
: Lemma (requires (List.Tot.length l >= n))
(ensures
(let l1, l2 = List.Tot.splitAt n l in
List.Tot.length l1 == n /\ List.Tot.length l1 + List.Tot.length l2 == List.Tot.length l))
[SMTPat (List.Tot.splitAt n l)] | val list_splitAt_length (#t: Type) (n: nat) (l: list t)
: Lemma (requires (List.Tot.length l >= n))
(ensures
(let l1, l2 = List.Tot.splitAt n l in
List.Tot.length l1 == n /\ List.Tot.length l1 + List.Tot.length l2 == List.Tot.length l))
[SMTPat (List.Tot.splitAt n l)] | let rec list_splitAt_length
(#t: Type)
(n: nat)
(l: list t)
: Lemma
(requires (List.Tot.length l >= n))
(ensures (
let (l1, l2) = List.Tot.splitAt n l in
List.Tot.length l1 == n /\
List.Tot.length l1 + List.Tot.length l2 == List.Tot.length l
))
[SMTPat (List.Tot.splitAt n l)]
= if n = 0 then (... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CBOR.Spec.Map.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 67,
"end_line": 419,
"start_col": 0,
"start_line": 407
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked",
"CBOR.Spec.Type.fsti.checked"
],
"interface_fi... | [
{
"abbrev": false,
"full_module": "CBOR.Spec.Type",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.P... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | n: Prims.nat -> l: Prims.list t
-> FStar.Pervasives.Lemma (requires FStar.List.Tot.Base.length l >= n)
(ensures
(let _ = FStar.List.Tot.Base.splitAt n l in
(let FStar.Pervasives.Native.Mktuple2 #_ #_ l1 l2 = _ in
FStar.List.Tot.Base.length l1 == n /\
FStar.List.Tot.Base... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"Prims.list",
"Prims.op_Equality",
"Prims.int",
"Prims.bool",
"CBOR.Spec.Map.list_splitAt_length",
"Prims.op_Subtraction",
"FStar.List.Tot.Base.tl",
"Prims.unit",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"FStar.List.Tot.Base.length",
"Prims.squash",
"Prims.l_and",
"Prims.... | [
"recursion"
] | false | false | true | false | false | let rec list_splitAt_length (#t: Type) (n: nat) (l: list t)
: Lemma (requires (List.Tot.length l >= n))
(ensures
(let l1, l2 = List.Tot.splitAt n l in
List.Tot.length l1 == n /\ List.Tot.length l1 + List.Tot.length l2 == List.Tot.length l))
[SMTPat (List.Tot.splitAt n l)] =
| if n = 0 then () else list_splitAt_length (n - 1) (List.Tot.tl l) | false |
CBOR.Spec.Map.fst | CBOR.Spec.Map.list_memP_map_forall | val list_memP_map_forall (#t1 #t2: Type) (f: (t1 -> t2)) (l: list t1)
: Lemma
(forall y. List.Tot.memP y (List.Tot.map f l) <==> (exists x. List.Tot.memP x l /\ y == f x)) | val list_memP_map_forall (#t1 #t2: Type) (f: (t1 -> t2)) (l: list t1)
: Lemma
(forall y. List.Tot.memP y (List.Tot.map f l) <==> (exists x. List.Tot.memP x l /\ y == f x)) | let list_memP_map_forall
(#t1 #t2: Type)
(f: t1 -> t2)
(l: list t1)
: Lemma
(forall y . List.Tot.memP y (List.Tot.map f l) <==> (exists x . List.Tot.memP x l /\ y == f x))
= Classical.forall_intro (fun y -> List.Tot.memP_map_elim f y l);
Classical.forall_intro (fun x -> List.Tot.memP_map_intro f x l) | {
"file_name": "share/steel/examples/pulse/dice/cbor/CBOR.Spec.Map.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 65,
"end_line": 463,
"start_col": 0,
"start_line": 456
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked",
"CBOR.Spec.Type.fsti.checked"
],
"interface_fi... | [
{
"abbrev": false,
"full_module": "CBOR.Spec.Type",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.P... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f: (_: t1 -> t2) -> l: Prims.list t1
-> FStar.Pervasives.Lemma
(ensures
forall (y: t2).
FStar.List.Tot.Base.memP y (FStar.List.Tot.Base.map f l) <==>
(exists (x: t1). FStar.List.Tot.Base.memP x l /\ y == f x)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"FStar.Classical.forall_intro",
"Prims.l_imp",
"FStar.List.Tot.Base.memP",
"FStar.List.Tot.Base.map",
"FStar.List.Tot.Properties.memP_map_intro",
"Prims.unit",
"Prims.l_Exists",
"Prims.l_and",
"Prims.eq2",
"FStar.List.Tot.Properties.memP_map_elim",
"Prims.l_True",
"Prims.squash... | [] | false | false | true | false | false | let list_memP_map_forall (#t1 #t2: Type) (f: (t1 -> t2)) (l: list t1)
: Lemma
(forall y. List.Tot.memP y (List.Tot.map f l) <==> (exists x. List.Tot.memP x l /\ y == f x)) =
| Classical.forall_intro (fun y -> List.Tot.memP_map_elim f y l);
Classical.forall_intro (fun x -> List.Tot.memP_map_intro f x l) | false |
CBOR.Spec.Map.fst | CBOR.Spec.Map.map_sort_merge | val map_sort_merge (#t1 #t2: Type) (key_compare: (t1 -> t1 -> int)) (accu l1 l2: list (t1 & t2))
: Tot (bool & list (t1 & t2)) (decreases (List.Tot.length l1 + List.Tot.length l2)) | val map_sort_merge (#t1 #t2: Type) (key_compare: (t1 -> t1 -> int)) (accu l1 l2: list (t1 & t2))
: Tot (bool & list (t1 & t2)) (decreases (List.Tot.length l1 + List.Tot.length l2)) | let rec map_sort_merge
(#t1 #t2: Type)
(key_compare: t1 -> t1 -> int)
(accu: list (t1 & t2))
(l1: list (t1 & t2))
(l2: list (t1 & t2))
: Tot (bool & list (t1 & t2))
(decreases (List.Tot.length l1 + List.Tot.length l2))
= match l1, l2 with
| (k1, v1) :: l1', (k2, v2) :: l2' ->
begin let c = key_compar... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CBOR.Spec.Map.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 46,
"end_line": 251,
"start_col": 0,
"start_line": 229
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked",
"CBOR.Spec.Type.fsti.checked"
],
"interface_fi... | [
{
"abbrev": false,
"full_module": "CBOR.Spec.Type",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.P... | {
"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 |
key_compare: (_: t1 -> _: t1 -> Prims.int) ->
accu: Prims.list (t1 * t2) ->
l1: Prims.list (t1 * t2) ->
l2: Prims.list (t1 * t2)
-> Prims.Tot (Prims.bool * Prims.list (t1 * t2)) | Prims.Tot | [
"total",
""
] | [] | [
"Prims.int",
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.Mktuple2",
"Prims.op_Equality",
"Prims.bool",
"FStar.List.Tot.Base.append",
"Prims.op_LessThan",
"CBOR.Spec.Map.map_sort_merge",
"Prims.Cons",
"Prims.Nil"
] | [
"recursion"
] | false | false | false | true | false | let rec map_sort_merge (#t1 #t2: Type) (key_compare: (t1 -> t1 -> int)) (accu l1 l2: list (t1 & t2))
: Tot (bool & list (t1 & t2)) (decreases (List.Tot.length l1 + List.Tot.length l2)) =
| match l1, l2 with
| (k1, v1) :: l1', (k2, v2) :: l2' ->
let c = key_compare k1 k2 in
if c = 0
then (false, accu `List.Tot.append` (l1 `List.Tot.append` l2))
else
if c < 0
then map_sort_merge key_compare (accu `List.Tot.append` [(k1, v1)]) l1' l2
else map_sort_merge key_compare (accu `List.Tot.append... | false |
Hacl.Spec.Bignum.ModInvLimb.fst | Hacl.Spec.Bignum.ModInvLimb.mod_inv_limb_inv_step_odd | val mod_inv_limb_inv_step_odd:
#t:limb_t -> n0:limb t
-> i:pos{i <= bits t} -> ub0:limb t -> vb0:limb t -> Lemma
(requires
(let alpha = uint #t #SEC 1 <<. size (bits t - 1) in let beta = n0 in
v n0 % 2 = 1 /\ v ub0 % 2 = 1 /\
pow2 (bits t - i + 1) == v ub0 * 2 * v alpha - v vb0 * v beta))
(ensures
... | val mod_inv_limb_inv_step_odd:
#t:limb_t -> n0:limb t
-> i:pos{i <= bits t} -> ub0:limb t -> vb0:limb t -> Lemma
(requires
(let alpha = uint #t #SEC 1 <<. size (bits t - 1) in let beta = n0 in
v n0 % 2 = 1 /\ v ub0 % 2 = 1 /\
pow2 (bits t - i + 1) == v ub0 * 2 * v alpha - v vb0 * v beta))
(ensures
... | let mod_inv_limb_inv_step_odd #t n0 i ub0 vb0 =
let pbits = bits t in
let alpha = uint #t #SEC 1 <<. size (bits t - 1) in let beta = n0 in
let ub = (v ub0 + v beta) / 2 % pow2 pbits in
let vb = (v vb0 / 2 + v alpha) % pow2 pbits in
calc (==) {
2 * (ub * 2 * v alpha - vb * v beta);
(==) { Math.Lemmas.... | {
"file_name": "code/bignum/Hacl.Spec.Bignum.ModInvLimb.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 71,
"end_line": 181,
"start_col": 0,
"start_line": 146
} | module Hacl.Spec.Bignum.ModInvLimb
open FStar.Mul
open Lib.IntTypes
open Lib.LoopCombinators
open Hacl.Spec.Bignum.Definitions
module M = Hacl.Spec.Montgomery.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
the modular inverse function was taken from
https://github.com/google/boringssl/blob/master/cry... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Perva... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abb... | {
"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 |
n0: Hacl.Spec.Bignum.Definitions.limb t ->
i: Prims.pos{i <= Lib.IntTypes.bits t} ->
ub0: Hacl.Spec.Bignum.Definitions.limb t ->
vb0: Hacl.Spec.Bignum.Definitions.limb t
-> FStar.Pervasives.Lemma
(requires
(let alpha = Lib.IntTypes.uint 1 <<. Lib.IntTypes.size (Lib.IntTypes.bits t - 1) ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.Definitions.limb",
"Prims.pos",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Lib.IntTypes.bits",
"Prims._assert",
"Prims.eq2",
"Prims.int",
"FStar.Mul.op_Star",
"Prims.op_Subtraction",
"Lib.IntTypes.v",
"Lib.IntTypes.SEC",
"Prims.pow2",... | [] | false | false | true | false | false | let mod_inv_limb_inv_step_odd #t n0 i ub0 vb0 =
| let pbits = bits t in
let alpha = uint #t #SEC 1 <<. size (bits t - 1) in
let beta = n0 in
let ub = (v ub0 + v beta) / 2 % pow2 pbits in
let vb = (v vb0 / 2 + v alpha) % pow2 pbits in
calc ( == ) {
2 * ((ub * 2) * v alpha - vb * v beta);
( == ) { Math.Lemmas.small_mod ((v ub0 + v beta) / 2) (pow2 pbits) }
2 * (((... | false |
Hacl.Impl.Chacha20.Core32.fst | Hacl.Impl.Chacha20.Core32.xor_block | val xor_block:
o:lbuffer uint8 64ul
-> st:state
-> b:lbuffer uint8 64ul ->
Stack unit
(requires fun h -> live h o /\ live h st /\ live h b)
(ensures fun h0 _ h1 -> modifies (loc o) h0 h1 /\
as_seq h1 o == Spec.xor_block (as_seq h0 st) (as_seq h0 b)) | val xor_block:
o:lbuffer uint8 64ul
-> st:state
-> b:lbuffer uint8 64ul ->
Stack unit
(requires fun h -> live h o /\ live h st /\ live h b)
(ensures fun h0 _ h1 -> modifies (loc o) h0 h1 /\
as_seq h1 o == Spec.xor_block (as_seq h0 st) (as_seq h0 b)) | let xor_block o st b =
push_frame();
let bl = create_state() in
load_state bl b;
map2T (size 16) bl ( ^. ) bl st;
store_state o bl;
pop_frame() | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Core32.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 13,
"end_line": 121,
"start_col": 0,
"start_line": 115
} | module Hacl.Impl.Chacha20.Core32
open FStar.HyperStack
open FStar.HyperStack.All
open Lib.IntTypes
open Lib.Sequence
open Lib.Buffer
open Lib.ByteBuffer
module ST = FStar.HyperStack.ST
module Spec = Spec.Chacha20
let state = lbuffer uint32 16ul
let index = i:size_t{size_v i < 16}
inline_for_extraction
val create... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.... | [
{
"abbrev": true,
"full_module": "Spec.Chacha20",
"short_module": "Spec"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
o: Lib.Buffer.lbuffer Lib.IntTypes.uint8 64ul ->
st: Hacl.Impl.Chacha20.Core32.state ->
b: Lib.Buffer.lbuffer Lib.IntTypes.uint8 64ul
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"FStar.UInt32.__uint_to_t",
"Hacl.Impl.Chacha20.Core32.state",
"FStar.HyperStack.ST.pop_frame",
"Prims.unit",
"Hacl.Impl.Chacha20.Core32.store_state",
"Lib.Buffer.map2T",
"Lib.Buffer.MUT",
"Lib.IntTypes.uint32",
"Lib.IntTypes.size",
"Lib.IntTypes.op_... | [] | false | true | false | false | false | let xor_block o st b =
| push_frame ();
let bl = create_state () in
load_state bl b;
map2T (size 16) bl ( ^. ) bl st;
store_state o bl;
pop_frame () | false |
Vale.AES.PPC64LE.AES256.fsti | Vale.AES.PPC64LE.AES256.va_wp_AES256EncryptBlock_6way | val va_wp_AES256EncryptBlock_6way
(in1 in2 in3 in4 in5 in6: quad32)
(key: (seq nat32))
(round_keys: (seq quad32))
(keys_buffer: buffer128)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 | val va_wp_AES256EncryptBlock_6way
(in1 in2 in3 in4 in5 in6: quad32)
(key: (seq nat32))
(round_keys: (seq quad32))
(keys_buffer: buffer128)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 | let va_wp_AES256EncryptBlock_6way (in1:quad32) (in2:quad32) (in3:quad32) (in4:quad32) (in5:quad32)
(in6:quad32) (key:(seq nat32)) (round_keys:(seq quad32)) (keys_buffer:buffer128) (va_s0:va_state)
(va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.AES.AES_BE_s.is_aes_key_word AES_256 key /\ FSt... | {
"file_name": "obj/Vale.AES.PPC64LE.AES256.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 76,
"end_line": 212,
"start_col": 0,
"start_line": 191
} | module Vale.AES.PPC64LE.AES256
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_BE_s
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.Memory
open Vale.PPC64LE.State
open Vale.PPC64LE.Decls
open Vale.PPC64LE.InsBasic
open Vale.PPC64LE.InsMem
open Vale.PPC64LE.InsVector
open Vale.PPC64LE.QuickCo... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES256_helpers_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCodes",
"short_module": null
},
{
"abbrev": fa... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
in1: Vale.PPC64LE.Memory.quad32 ->
in2: Vale.PPC64LE.Memory.quad32 ->
in3: Vale.PPC64LE.Memory.quad32 ->
in4: Vale.PPC64LE.Memory.quad32 ->
in5: Vale.PPC64LE.Memory.quad32 ->
in6: Vale.PPC64LE.Memory.quad32 ->
key: FStar.Seq.Base.seq Vale.PPC64LE.Memory.nat32 ->
round_keys: FStar.Seq.Ba... | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.Memory.quad32",
"FStar.Seq.Base.seq",
"Vale.PPC64LE.Memory.nat32",
"Vale.PPC64LE.Memory.buffer128",
"Vale.PPC64LE.Decls.va_state",
"Prims.unit",
"Prims.l_and",
"Prims.b2t",
"Vale.PPC64LE.Decls.va_get_ok",
"Vale.AES.AES_BE_s.is_aes_key_word",
"Vale.AES.AES_common_s.AES_256",
"Prim... | [] | false | false | false | true | true | let va_wp_AES256EncryptBlock_6way
(in1 in2 in3 in4 in5 in6: quad32)
(key: (seq nat32))
(round_keys: (seq quad32))
(keys_buffer: buffer128)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 =
| (va_get_ok va_s0 /\ Vale.AES.AES_BE_s.is_aes_key_word AES_256 key /\
FStar.Seq.Base.length #quad32 round_keys == 15 /\
round_keys == Vale.AES.AES_BE_s.key_to_round_keys_word AES_256 key /\ va_get_vec 0 va_s0 == in1 /\
va_get_vec 1 va_s0 == in2 /\ va_get_vec 2 va_s0 == in3 /\ va_get_vec 3 va_s0 == in4 /\
va_get_... | false |
Vale.AES.PPC64LE.AES256.fsti | Vale.AES.PPC64LE.AES256.va_wp_KeyExpansion256Stdcall | val va_wp_KeyExpansion256Stdcall
(input_key_b output_key_expansion_b: buffer128)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 | val va_wp_KeyExpansion256Stdcall
(input_key_b output_key_expansion_b: buffer128)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 | let va_wp_KeyExpansion256Stdcall (input_key_b:buffer128) (output_key_expansion_b:buffer128)
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ (let (key:(FStar.Seq.Base.seq Vale.Def.Types_s.nat32)) =
Vale.AES.AES256_helpers_BE.make_AES256_key (Vale.Def.Types_s.reverse_bytes_quad32... | {
"file_name": "obj/Vale.AES.PPC64LE.AES256.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 91,
"start_col": 0,
"start_line": 59
} | module Vale.AES.PPC64LE.AES256
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_BE_s
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.Memory
open Vale.PPC64LE.State
open Vale.PPC64LE.Decls
open Vale.PPC64LE.InsBasic
open Vale.PPC64LE.InsMem
open Vale.PPC64LE.InsVector
open Vale.PPC64LE.QuickCo... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES256_helpers_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCodes",
"short_module": null
},
{
"abbrev": fa... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
input_key_b: Vale.PPC64LE.Memory.buffer128 ->
output_key_expansion_b: Vale.PPC64LE.Memory.buffer128 ->
va_s0: Vale.PPC64LE.Decls.va_state ->
va_k: (_: Vale.PPC64LE.Decls.va_state -> _: Prims.unit -> Type0)
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.Memory.buffer128",
"Vale.PPC64LE.Decls.va_state",
"Prims.unit",
"Prims.l_and",
"Prims.b2t",
"Vale.PPC64LE.Decls.va_get_ok",
"Vale.PPC64LE.Decls.validSrcAddrs128",
"Vale.PPC64LE.Decls.va_get_mem_heaplet",
"Vale.PPC64LE.Decls.va_get_reg",
"Vale.PPC64LE.Decls.va_get_mem_layout",
"Vale... | [] | false | false | false | true | true | let va_wp_KeyExpansion256Stdcall
(input_key_b output_key_expansion_b: buffer128)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 =
| (va_get_ok va_s0 /\
(let key:(FStar.Seq.Base.seq Vale.Def.Types_s.nat32) =
Vale.AES.AES256_helpers_BE.make_AES256_key (Vale.Def.Types_s.reverse_bytes_quad32 (Vale.PPC64LE.Decls.buffer128_read
input_key_b
0
(va_get_mem_heaplet 0 va_s0)))
(Vale.Def.Types_s.r... | false |
Steel.ST.GenElim1.fst | Steel.ST.GenElim1.tele_star_vprop_correct_ret | val tele_star_vprop_correct_ret (v': vprop) (p': prop) (v: vprop) (p: prop)
: Tot
(vprop_rewrite (((tele_p (TRet v' p')) `star` v) `star` (pure p))
(tele_p (tele_star_vprop (TRet v' p') v p))) | val tele_star_vprop_correct_ret (v': vprop) (p': prop) (v: vprop) (p: prop)
: Tot
(vprop_rewrite (((tele_p (TRet v' p')) `star` v) `star` (pure p))
(tele_p (tele_star_vprop (TRet v' p') v p))) | let tele_star_vprop_correct_ret
(v': vprop) (p': prop) (v: vprop) (p: prop)
: Tot (vprop_rewrite (tele_p (TRet v' p') `star` v `star` pure p) (tele_p (tele_star_vprop (TRet v' p') v p)))
= fun _ ->
elim_pure p;
rewrite (tele_p _) (v' `star` pure p');
elim_pure p';
intro_pure (p /\ p');
rewrite ((v... | {
"file_name": "lib/steel/Steel.ST.GenElim1.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 60,
"end_line": 222,
"start_col": 0,
"start_line": 214
} | module Steel.ST.GenElim1
let gen_elim_f
(p: vprop)
(a: Type)
(q: (a -> vprop))
(post: (a -> prop))
: Tot Type
= ((opened: inames) -> STGhost a opened p q True post)
module U = FStar.Universe
let gen_unit_elim_t (i: gen_unit_elim_i) : Tot Type =
gen_elim_f (compute_gen_unit_elim_p i) (U.raise_t u#_ u#1 unit... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Steel.ST.GenElim1.f... | [
{
"abbrev": true,
"full_module": "FStar.Universe",
"short_module": "U"
},
{
"abbrev": true,
"full_module": "FStar.Tactics",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim1.Base",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"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 | v': Steel.Effect.Common.vprop -> p': Prims.prop -> v: Steel.Effect.Common.vprop -> p: Prims.prop
-> Steel.ST.GenElim1.vprop_rewrite (Steel.Effect.Common.star (Steel.Effect.Common.star (Steel.ST.GenElim1.tele_p
(Steel.ST.GenElim1.Base.TRet v' p'))
v)
(Steel.ST.Util.pure p))
... | Prims.Tot | [
"total"
] | [] | [
"Steel.Effect.Common.vprop",
"Prims.prop",
"Steel.Memory.inames",
"Steel.ST.Util.rewrite",
"Steel.Effect.Common.star",
"Steel.ST.Util.pure",
"Prims.l_and",
"Steel.ST.GenElim1.tele_p",
"Steel.ST.GenElim1.Base.tele_star_vprop",
"Steel.ST.GenElim1.Base.TRet",
"Prims.unit",
"Steel.ST.Util.intro_pu... | [] | false | false | false | false | false | let tele_star_vprop_correct_ret (v': vprop) (p': prop) (v: vprop) (p: prop)
: Tot
(vprop_rewrite (((tele_p (TRet v' p')) `star` v) `star` (pure p))
(tele_p (tele_star_vprop (TRet v' p') v p))) =
| fun _ ->
elim_pure p;
rewrite (tele_p _) (v' `star` (pure p'));
elim_pure p';
intro_pure (p /\ p');
rewrite ((v `star` v') `star` (pure (p /\ p'))) (tele_p _) | false |
Vale.AES.PPC64LE.AES256.fsti | Vale.AES.PPC64LE.AES256.va_wp_AES256EncryptBlock | val va_wp_AES256EncryptBlock
(input: quad32)
(key: (seq nat32))
(round_keys: (seq quad32))
(keys_buffer: buffer128)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 | val va_wp_AES256EncryptBlock
(input: quad32)
(key: (seq nat32))
(round_keys: (seq quad32))
(keys_buffer: buffer128)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 | let va_wp_AES256EncryptBlock (input:quad32) (key:(seq nat32)) (round_keys:(seq quad32))
(keys_buffer:buffer128) (va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.AES.AES_BE_s.is_aes_key_word AES_256 key /\ FStar.Seq.Base.length
#quad32 round_keys == 15 /\ round_keys == Vale.... | {
"file_name": "obj/Vale.AES.PPC64LE.AES256.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 81,
"end_line": 144,
"start_col": 0,
"start_line": 132
} | module Vale.AES.PPC64LE.AES256
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_BE_s
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.Memory
open Vale.PPC64LE.State
open Vale.PPC64LE.Decls
open Vale.PPC64LE.InsBasic
open Vale.PPC64LE.InsMem
open Vale.PPC64LE.InsVector
open Vale.PPC64LE.QuickCo... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES256_helpers_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCodes",
"short_module": null
},
{
"abbrev": fa... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
input: Vale.PPC64LE.Memory.quad32 ->
key: FStar.Seq.Base.seq Vale.PPC64LE.Memory.nat32 ->
round_keys: FStar.Seq.Base.seq Vale.PPC64LE.Memory.quad32 ->
keys_buffer: Vale.PPC64LE.Memory.buffer128 ->
va_s0: Vale.PPC64LE.Decls.va_state ->
va_k: (_: Vale.PPC64LE.Decls.va_state -> _: Prims.unit -> Ty... | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.Memory.quad32",
"FStar.Seq.Base.seq",
"Vale.PPC64LE.Memory.nat32",
"Vale.PPC64LE.Memory.buffer128",
"Vale.PPC64LE.Decls.va_state",
"Prims.unit",
"Prims.l_and",
"Prims.b2t",
"Vale.PPC64LE.Decls.va_get_ok",
"Vale.AES.AES_BE_s.is_aes_key_word",
"Vale.AES.AES_common_s.AES_256",
"Prim... | [] | false | false | false | true | true | let va_wp_AES256EncryptBlock
(input: quad32)
(key: (seq nat32))
(round_keys: (seq quad32))
(keys_buffer: buffer128)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 =
| (va_get_ok va_s0 /\ Vale.AES.AES_BE_s.is_aes_key_word AES_256 key /\
FStar.Seq.Base.length #quad32 round_keys == 15 /\
round_keys == Vale.AES.AES_BE_s.key_to_round_keys_word AES_256 key /\ va_get_vec 0 va_s0 == input /\
va_get_reg 4 va_s0 ==
Vale.PPC64LE.Memory.buffer_addr #Vale.PPC64LE.Memory.vuint128
keys... | false |
Vale.AES.PPC64LE.AES256.fsti | Vale.AES.PPC64LE.AES256.va_quick_KeyExpansion256Stdcall | val va_quick_KeyExpansion256Stdcall (input_key_b output_key_expansion_b: buffer128)
: (va_quickCode unit (va_code_KeyExpansion256Stdcall ())) | val va_quick_KeyExpansion256Stdcall (input_key_b output_key_expansion_b: buffer128)
: (va_quickCode unit (va_code_KeyExpansion256Stdcall ())) | let va_quick_KeyExpansion256Stdcall (input_key_b:buffer128) (output_key_expansion_b:buffer128) :
(va_quickCode unit (va_code_KeyExpansion256Stdcall ())) =
(va_QProc (va_code_KeyExpansion256Stdcall ()) ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3;
va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10; va_Mod_mem... | {
"file_name": "obj/Vale.AES.PPC64LE.AES256.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 75,
"end_line": 107,
"start_col": 0,
"start_line": 102
} | module Vale.AES.PPC64LE.AES256
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_BE_s
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.Memory
open Vale.PPC64LE.State
open Vale.PPC64LE.Decls
open Vale.PPC64LE.InsBasic
open Vale.PPC64LE.InsMem
open Vale.PPC64LE.InsVector
open Vale.PPC64LE.QuickCo... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES256_helpers_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCodes",
"short_module": null
},
{
"abbrev": fa... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | input_key_b: Vale.PPC64LE.Memory.buffer128 -> output_key_expansion_b: Vale.PPC64LE.Memory.buffer128
-> Vale.PPC64LE.QuickCode.va_quickCode Prims.unit
(Vale.AES.PPC64LE.AES256.va_code_KeyExpansion256Stdcall ()) | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.Memory.buffer128",
"Vale.PPC64LE.QuickCode.va_QProc",
"Prims.unit",
"Vale.AES.PPC64LE.AES256.va_code_KeyExpansion256Stdcall",
"Prims.Cons",
"Vale.PPC64LE.QuickCode.mod_t",
"Vale.PPC64LE.QuickCode.va_Mod_vec",
"Vale.PPC64LE.QuickCode.va_Mod_reg",
"Vale.PPC64LE.QuickCode.va_Mod_mem_heapl... | [] | false | false | false | false | false | let va_quick_KeyExpansion256Stdcall (input_key_b output_key_expansion_b: buffer128)
: (va_quickCode unit (va_code_KeyExpansion256Stdcall ())) =
| (va_QProc (va_code_KeyExpansion256Stdcall ())
([
va_Mod_vec 5;
va_Mod_vec 4;
va_Mod_vec 3;
va_Mod_vec 2;
va_Mod_vec 1;
va_Mod_vec 0;
va_Mod_reg 10;
va_Mod_mem_heaplet 1;
va_Mod_mem
])
(va_wp_KeyExpansion256Stdcall input_key_b output_k... | false |
Vale.AES.PPC64LE.AES256.fsti | Vale.AES.PPC64LE.AES256.va_quick_AES256EncryptBlock | val va_quick_AES256EncryptBlock
(input: quad32)
(key: (seq nat32))
(round_keys: (seq quad32))
(keys_buffer: buffer128)
: (va_quickCode unit (va_code_AES256EncryptBlock ())) | val va_quick_AES256EncryptBlock
(input: quad32)
(key: (seq nat32))
(round_keys: (seq quad32))
(keys_buffer: buffer128)
: (va_quickCode unit (va_code_AES256EncryptBlock ())) | let va_quick_AES256EncryptBlock (input:quad32) (key:(seq nat32)) (round_keys:(seq quad32))
(keys_buffer:buffer128) : (va_quickCode unit (va_code_AES256EncryptBlock ())) =
(va_QProc (va_code_AES256EncryptBlock ()) ([va_Mod_vec 2; va_Mod_vec 0; va_Mod_reg 10])
(va_wp_AES256EncryptBlock input key round_keys keys_b... | {
"file_name": "obj/Vale.AES.PPC64LE.AES256.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 38,
"end_line": 158,
"start_col": 0,
"start_line": 154
} | module Vale.AES.PPC64LE.AES256
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_BE_s
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.Memory
open Vale.PPC64LE.State
open Vale.PPC64LE.Decls
open Vale.PPC64LE.InsBasic
open Vale.PPC64LE.InsMem
open Vale.PPC64LE.InsVector
open Vale.PPC64LE.QuickCo... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES256_helpers_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCodes",
"short_module": null
},
{
"abbrev": fa... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
input: Vale.PPC64LE.Memory.quad32 ->
key: FStar.Seq.Base.seq Vale.PPC64LE.Memory.nat32 ->
round_keys: FStar.Seq.Base.seq Vale.PPC64LE.Memory.quad32 ->
keys_buffer: Vale.PPC64LE.Memory.buffer128
-> Vale.PPC64LE.QuickCode.va_quickCode Prims.unit
(Vale.AES.PPC64LE.AES256.va_code_AES256EncryptBlock... | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.Memory.quad32",
"FStar.Seq.Base.seq",
"Vale.PPC64LE.Memory.nat32",
"Vale.PPC64LE.Memory.buffer128",
"Vale.PPC64LE.QuickCode.va_QProc",
"Prims.unit",
"Vale.AES.PPC64LE.AES256.va_code_AES256EncryptBlock",
"Prims.Cons",
"Vale.PPC64LE.QuickCode.mod_t",
"Vale.PPC64LE.QuickCode.va_Mod_vec"... | [] | false | false | false | false | false | let va_quick_AES256EncryptBlock
(input: quad32)
(key: (seq nat32))
(round_keys: (seq quad32))
(keys_buffer: buffer128)
: (va_quickCode unit (va_code_AES256EncryptBlock ())) =
| (va_QProc (va_code_AES256EncryptBlock ())
([va_Mod_vec 2; va_Mod_vec 0; va_Mod_reg 10])
(va_wp_AES256EncryptBlock input key round_keys keys_buffer)
(va_wpProof_AES256EncryptBlock input key round_keys keys_buffer)) | false |
CBOR.Spec.Map.fst | CBOR.Spec.Map.map_sort_merge_correct | val map_sort_merge_correct
(#t1 #t2: Type)
(key_order: (t1 -> t1 -> bool))
(key_compare: (t1 -> t1 -> int))
(accu l1 l2: list (t1 & t2))
: Lemma
(requires
((forall x. key_order x x == false) /\
(forall x y z. (key_order x y /\ key_order y z) ==> key_order x z) /\
... | val map_sort_merge_correct
(#t1 #t2: Type)
(key_order: (t1 -> t1 -> bool))
(key_compare: (t1 -> t1 -> int))
(accu l1 l2: list (t1 & t2))
: Lemma
(requires
((forall x. key_order x x == false) /\
(forall x y z. (key_order x y /\ key_order y z) ==> key_order x z) /\
... | let rec map_sort_merge_correct
(#t1 #t2: Type)
(key_order: t1 -> t1 -> bool)
(key_compare: t1 -> t1 -> int)
(accu: list (t1 & t2))
(l1: list (t1 & t2))
(l2: list (t1 & t2))
: Lemma
(requires (
(forall x . key_order x x == false) /\
(forall x y z . (key_order x y /\ key_order y z) ==> key_order x z... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CBOR.Spec.Map.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 7,
"end_line": 405,
"start_col": 0,
"start_line": 338
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked",
"CBOR.Spec.Type.fsti.checked"
],
"interface_fi... | [
{
"abbrev": false,
"full_module": "CBOR.Spec.Type",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.P... | {
"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 |
key_order: (_: t1 -> _: t1 -> Prims.bool) ->
key_compare: (_: t1 -> _: t1 -> Prims.int) ->
accu: Prims.list (t1 * t2) ->
l1: Prims.list (t1 * t2) ->
l2: Prims.list (t1 * t2)
-> FStar.Pervasives.Lemma
(requires
(forall (x: t1). key_order x x == false) /\
(forall (x: t1) (y: t... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.bool",
"Prims.int",
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.Mktuple2",
"FStar.List.Tot.Properties.append_l_nil",
"Prims.op_Equality",
"FStar.List.Tot.Properties.no_repeats_p_false_intro",
"FStar.List.Tot.Base.map",
"FStar.Pervasives.Native.fst",
"Prims.Con... | [
"recursion"
] | false | false | true | false | false | let rec map_sort_merge_correct
(#t1 #t2: Type)
(key_order: (t1 -> t1 -> bool))
(key_compare: (t1 -> t1 -> int))
(accu l1 l2: list (t1 & t2))
: Lemma
(requires
((forall x. key_order x x == false) /\
(forall x y z. (key_order x y /\ key_order y z) ==> key_order x z) /\
... | match l1, l2 with
| [], _ -> ()
| _, [] -> List.Tot.append_l_nil l1
| (k1, v1) :: l1', (k2, v2) :: l2' ->
List.Tot.map_append fst l1 l2;
List.Tot.map_append fst accu (l1 `List.Tot.append` l2);
let c = key_compare k1 k2 in
if c = 0
then
List.Tot.no_repeats_p_false_intro (List.Tot.map fst accu)
[k1]
... | false |
Vale.AES.PPC64LE.AES256.fsti | Vale.AES.PPC64LE.AES256.va_quick_AES256EncryptBlock_6way | val va_quick_AES256EncryptBlock_6way
(in1 in2 in3 in4 in5 in6: quad32)
(key: (seq nat32))
(round_keys: (seq quad32))
(keys_buffer: buffer128)
: (va_quickCode unit (va_code_AES256EncryptBlock_6way ())) | val va_quick_AES256EncryptBlock_6way
(in1 in2 in3 in4 in5 in6: quad32)
(key: (seq nat32))
(round_keys: (seq quad32))
(keys_buffer: buffer128)
: (va_quickCode unit (va_code_AES256EncryptBlock_6way ())) | let va_quick_AES256EncryptBlock_6way (in1:quad32) (in2:quad32) (in3:quad32) (in4:quad32)
(in5:quad32) (in6:quad32) (key:(seq nat32)) (round_keys:(seq quad32)) (keys_buffer:buffer128) :
(va_quickCode unit (va_code_AES256EncryptBlock_6way ())) =
(va_QProc (va_code_AES256EncryptBlock_6way ()) ([va_Mod_vec 6; va_Mod_... | {
"file_name": "obj/Vale.AES.PPC64LE.AES256.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 92,
"end_line": 230,
"start_col": 0,
"start_line": 224
} | module Vale.AES.PPC64LE.AES256
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_BE_s
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.Memory
open Vale.PPC64LE.State
open Vale.PPC64LE.Decls
open Vale.PPC64LE.InsBasic
open Vale.PPC64LE.InsMem
open Vale.PPC64LE.InsVector
open Vale.PPC64LE.QuickCo... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES256_helpers_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCodes",
"short_module": null
},
{
"abbrev": fa... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
in1: Vale.PPC64LE.Memory.quad32 ->
in2: Vale.PPC64LE.Memory.quad32 ->
in3: Vale.PPC64LE.Memory.quad32 ->
in4: Vale.PPC64LE.Memory.quad32 ->
in5: Vale.PPC64LE.Memory.quad32 ->
in6: Vale.PPC64LE.Memory.quad32 ->
key: FStar.Seq.Base.seq Vale.PPC64LE.Memory.nat32 ->
round_keys: FStar.Seq.Ba... | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.Memory.quad32",
"FStar.Seq.Base.seq",
"Vale.PPC64LE.Memory.nat32",
"Vale.PPC64LE.Memory.buffer128",
"Vale.PPC64LE.QuickCode.va_QProc",
"Prims.unit",
"Vale.AES.PPC64LE.AES256.va_code_AES256EncryptBlock_6way",
"Prims.Cons",
"Vale.PPC64LE.QuickCode.mod_t",
"Vale.PPC64LE.QuickCode.va_Mod... | [] | false | false | false | false | false | let va_quick_AES256EncryptBlock_6way
(in1 in2 in3 in4 in5 in6: quad32)
(key: (seq nat32))
(round_keys: (seq quad32))
(keys_buffer: buffer128)
: (va_quickCode unit (va_code_AES256EncryptBlock_6way ())) =
| (va_QProc (va_code_AES256EncryptBlock_6way ())
([
va_Mod_vec 6;
va_Mod_vec 5;
va_Mod_vec 4;
va_Mod_vec 3;
va_Mod_vec 2;
va_Mod_vec 1;
va_Mod_vec 0;
va_Mod_reg 10
])
(va_wp_AES256EncryptBlock_6way in1 in2 in3 in4 in5 in6 key round_keys keys_bu... | false |
Hacl.Impl.Chacha20.Core32.fst | Hacl.Impl.Chacha20.Core32.double_round | val double_round:
st:state ->
Stack unit
(requires fun h -> live h st)
(ensures fun h0 _ h1 -> modifies (loc st) h0 h1 /\
as_seq h1 st == Spec.double_round (as_seq h0 st)) | val double_round:
st:state ->
Stack unit
(requires fun h -> live h st)
(ensures fun h0 _ h1 -> modifies (loc st) h0 h1 /\
as_seq h1 st == Spec.double_round (as_seq h0 st)) | let double_round st =
quarter_round st (size 0) (size 4) (size 8) (size 12);
quarter_round st (size 1) (size 5) (size 9) (size 13);
quarter_round st (size 2) (size 6) (size 10) (size 14);
quarter_round st (size 3) (size 7) (size 11) (size 15);
quarter_round st (size 0) (size 5) (size 10) (size 15);
quarter... | {
"file_name": "code/chacha20/Hacl.Impl.Chacha20.Core32.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 55,
"end_line": 185,
"start_col": 0,
"start_line": 176
} | module Hacl.Impl.Chacha20.Core32
open FStar.HyperStack
open FStar.HyperStack.All
open Lib.IntTypes
open Lib.Sequence
open Lib.Buffer
open Lib.ByteBuffer
module ST = FStar.HyperStack.ST
module Spec = Spec.Chacha20
let state = lbuffer uint32 16ul
let index = i:size_t{size_v i < 16}
inline_for_extraction
val create... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.... | [
{
"abbrev": true,
"full_module": "Spec.Chacha20",
"short_module": "Spec"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | st: Hacl.Impl.Chacha20.Core32.state -> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Impl.Chacha20.Core32.state",
"Hacl.Impl.Chacha20.Core32.quarter_round",
"Lib.IntTypes.size",
"Prims.unit"
] | [] | false | true | false | false | false | let double_round st =
| quarter_round st (size 0) (size 4) (size 8) (size 12);
quarter_round st (size 1) (size 5) (size 9) (size 13);
quarter_round st (size 2) (size 6) (size 10) (size 14);
quarter_round st (size 3) (size 7) (size 11) (size 15);
quarter_round st (size 0) (size 5) (size 10) (size 15);
quarter_round st (size 1) (size 6) (size 1... | false |
Steel.ST.GenElim1.fst | Steel.ST.GenElim1.compute_gen_elim_tele_correct_exists_no_abs0 | val compute_gen_elim_tele_correct_exists_no_abs0 (ty: _) (body: (ty -> vprop))
: Tot (ge_to_tele_t (GEExistsNoAbs0 #ty body)) | val compute_gen_elim_tele_correct_exists_no_abs0 (ty: _) (body: (ty -> vprop))
: Tot (ge_to_tele_t (GEExistsNoAbs0 #ty body)) | let compute_gen_elim_tele_correct_exists_no_abs0
(ty: _)
(body: ty -> vprop)
: Tot (ge_to_tele_t (GEExistsNoAbs0 #ty body))
= fun _ ->
rewrite_with_trefl (compute_gen_elim_p _) (exists_ body);
let x = elim_exists' () in
intro_pure True;
rewrite (body x) (body (U.downgrade_val (U.raise_val x)));
intro_exis... | {
"file_name": "lib/steel/Steel.ST.GenElim1.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 43,
"end_line": 352,
"start_col": 0,
"start_line": 342
} | module Steel.ST.GenElim1
let gen_elim_f
(p: vprop)
(a: Type)
(q: (a -> vprop))
(post: (a -> prop))
: Tot Type
= ((opened: inames) -> STGhost a opened p q True post)
module U = FStar.Universe
let gen_unit_elim_t (i: gen_unit_elim_i) : Tot Type =
gen_elim_f (compute_gen_unit_elim_p i) (U.raise_t u#_ u#1 unit... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Steel.ST.GenElim1.f... | [
{
"abbrev": true,
"full_module": "FStar.Universe",
"short_module": "U"
},
{
"abbrev": true,
"full_module": "FStar.Tactics",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim1.Base",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"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 | ty: Type0 -> body: (_: ty -> Steel.Effect.Common.vprop)
-> Steel.ST.GenElim1.ge_to_tele_t (Steel.ST.GenElim1.Base.GEExistsNoAbs0 body) | Prims.Tot | [
"total"
] | [] | [
"Steel.Effect.Common.vprop",
"Steel.Memory.inames",
"Steel.ST.GenElim1.rewrite_with_trefl",
"Steel.ST.Util.exists_",
"FStar.Universe.raise_t",
"Steel.Effect.Common.star",
"FStar.Universe.downgrade_val",
"Steel.ST.Util.pure",
"Prims.l_True",
"Steel.ST.GenElim1.tele_p",
"Steel.ST.GenElim1.Base.com... | [] | false | false | false | false | false | let compute_gen_elim_tele_correct_exists_no_abs0 (ty: _) (body: (ty -> vprop))
: Tot (ge_to_tele_t (GEExistsNoAbs0 #ty body)) =
| fun _ ->
rewrite_with_trefl (compute_gen_elim_p _) (exists_ body);
let x = elim_exists' () in
intro_pure True;
rewrite (body x) (body (U.downgrade_val (U.raise_val x)));
intro_exists (U.raise_val u#0 u#1 x) (fun x -> (body (U.downgrade_val x)) `star` (pure True));
rewrite_with_trefl (exists_ _) (tele_p _) | false |
Hacl.Impl.Ed25519.PointCompress.fst | Hacl.Impl.Ed25519.PointCompress.lemma_fits_in_prime_last_byte | val lemma_fits_in_prime_last_byte (b: lbytes 32)
: Lemma (requires nat_from_bytes_le b < Spec.Curve25519.prime)
(ensures v (Seq.index b 31) < pow2 7) | val lemma_fits_in_prime_last_byte (b: lbytes 32)
: Lemma (requires nat_from_bytes_le b < Spec.Curve25519.prime)
(ensures v (Seq.index b 31) < pow2 7) | let lemma_fits_in_prime_last_byte (b:lbytes 32) : Lemma
(requires nat_from_bytes_le b < Spec.Curve25519.prime)
(ensures v (Seq.index b 31) < pow2 7)
= calc (==) {
nat_from_bytes_le b <: nat;
(==) { nat_from_intseq_le_slice_lemma b 31 }
nat_from_intseq_le (Seq.slice b 0 31) +
pow2 (31 * 8) *... | {
"file_name": "code/ed25519/Hacl.Impl.Ed25519.PointCompress.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 35,
"end_line": 65,
"start_col": 0,
"start_line": 36
} | module Hacl.Impl.Ed25519.PointCompress
module ST = FStar.HyperStack.ST
open FStar.HyperStack.All
open FStar.Mul
open Lib.IntTypes
open Lib.ByteSequence
open Lib.Buffer
open Hacl.Bignum25519
module F51 = Hacl.Impl.Ed25519.Field51
#set-options "--z3rlimit 20 --max_fuel 0 --max_ifuel 0"
inline_for_extraction noextr... | {
"checked_file": "/",
"dependencies": [
"Spec.Ed25519.fst.checked",
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.Compatibility.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.Ed25519.Field51.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Ed25519.Field51",
"short_module": "F51"
},
{
"abbrev": false,
"full_module": "Hacl.Bignum25519",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | b: Lib.ByteSequence.lbytes 32
-> FStar.Pervasives.Lemma (requires Lib.ByteSequence.nat_from_bytes_le b < Spec.Curve25519.prime)
(ensures Lib.IntTypes.v (FStar.Seq.Base.index b 31) < Prims.pow2 7) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Lib.ByteSequence.lbytes",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"Prims.int",
"Prims.op_Subtraction",
"FStar.Mul.op_Star",
"Prims.unit",
"FStar.Calc.calc_finish",
"Prims.op_Division",
"Prims.pow2",
"Lib.IntTypes.v",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"FStar.Seq.Base.index",
"L... | [] | false | false | true | false | false | let lemma_fits_in_prime_last_byte (b: lbytes 32)
: Lemma (requires nat_from_bytes_le b < Spec.Curve25519.prime)
(ensures v (Seq.index b 31) < pow2 7) =
| calc ( == ) {
nat_from_bytes_le b <: nat;
( == ) { nat_from_intseq_le_slice_lemma b 31 }
nat_from_intseq_le (Seq.slice b 0 31) + pow2 (31 * 8) * nat_from_intseq_le (Seq.slice b 31 32);
( == ) { nat_from_intseq_le_lemma0 (Seq.slice b 31 32) }
nat_from_intseq_le (Seq.slice b 0 31) + pow2 (31 * 8) * v (Seq.index... | false |
Steel.ST.GenElim1.fst | Steel.ST.GenElim1.compute_gen_elim_tele_correct_exists_unit1 | val compute_gen_elim_tele_correct_exists_unit1 (ty: _) (body: (ty -> gen_unit_elim_i))
: Tot (ge_to_tele_t (GEExistsUnit1 #ty body)) | val compute_gen_elim_tele_correct_exists_unit1 (ty: _) (body: (ty -> gen_unit_elim_i))
: Tot (ge_to_tele_t (GEExistsUnit1 #ty body)) | let compute_gen_elim_tele_correct_exists_unit1
(ty: _)
(body: ty -> gen_unit_elim_i)
: Tot (ge_to_tele_t (GEExistsUnit1 #ty body))
= fun _ ->
rewrite_with_trefl (compute_gen_elim_p _) (exists_ (fun x -> compute_gen_unit_elim_p (body x)));
let x = elim_exists' () in
let _ = compute_gen_unit_elim_f (body x) _ i... | {
"file_name": "lib/steel/Steel.ST.GenElim1.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 43,
"end_line": 401,
"start_col": 0,
"start_line": 391
} | module Steel.ST.GenElim1
let gen_elim_f
(p: vprop)
(a: Type)
(q: (a -> vprop))
(post: (a -> prop))
: Tot Type
= ((opened: inames) -> STGhost a opened p q True post)
module U = FStar.Universe
let gen_unit_elim_t (i: gen_unit_elim_i) : Tot Type =
gen_elim_f (compute_gen_unit_elim_p i) (U.raise_t u#_ u#1 unit... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Steel.ST.GenElim1.f... | [
{
"abbrev": true,
"full_module": "FStar.Universe",
"short_module": "U"
},
{
"abbrev": true,
"full_module": "FStar.Tactics",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim1.Base",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"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 | ty: Type -> body: (_: ty -> Steel.ST.GenElim1.Base.gen_unit_elim_i)
-> Steel.ST.GenElim1.ge_to_tele_t (Steel.ST.GenElim1.Base.GEExistsUnit1 body) | Prims.Tot | [
"total"
] | [] | [
"Steel.ST.GenElim1.Base.gen_unit_elim_i",
"Steel.Memory.inames",
"Steel.ST.GenElim1.rewrite_with_trefl",
"Steel.ST.Util.exists_",
"Steel.Effect.Common.star",
"Steel.ST.GenElim1.Base.compute_gen_unit_elim_q",
"Steel.ST.Util.pure",
"Steel.ST.GenElim1.Base.compute_gen_unit_elim_post",
"Steel.Effect.Com... | [] | false | false | false | false | false | let compute_gen_elim_tele_correct_exists_unit1 (ty: _) (body: (ty -> gen_unit_elim_i))
: Tot (ge_to_tele_t (GEExistsUnit1 #ty body)) =
| fun _ ->
rewrite_with_trefl (compute_gen_elim_p _) (exists_ (fun x -> compute_gen_unit_elim_p (body x)));
let x = elim_exists' () in
let _ = compute_gen_unit_elim_f (body x) _ in
intro_pure (compute_gen_unit_elim_post (body x));
intro_exists x
(fun x -> (compute_gen_unit_elim_q (body x)) `star` (pure (com... | false |
Steel.ST.GenElim1.fst | Steel.ST.GenElim1.compute_gen_elim_tele_correct_exists0 | val compute_gen_elim_tele_correct_exists0
(ty: _)
(body: (ty -> gen_elim_i))
(ih: (x: ty -> GTot (ge_to_tele_t (body x))))
: Tot (ge_to_tele_t (GEExists0 #ty body)) | val compute_gen_elim_tele_correct_exists0
(ty: _)
(body: (ty -> gen_elim_i))
(ih: (x: ty -> GTot (ge_to_tele_t (body x))))
: Tot (ge_to_tele_t (GEExists0 #ty body)) | let compute_gen_elim_tele_correct_exists0
(ty: _)
(body: ty -> gen_elim_i)
(ih: (x: ty) -> GTot (ge_to_tele_t (body x)))
: Tot (ge_to_tele_t (GEExists0 #ty body))
= fun _ ->
rewrite_with_trefl (compute_gen_elim_p _) (exists_ (fun x -> compute_gen_elim_p (body x)));
let x = elim_exists' () in
ih x _;
rewri... | {
"file_name": "lib/steel/Steel.ST.GenElim1.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 43,
"end_line": 378,
"start_col": 0,
"start_line": 367
} | module Steel.ST.GenElim1
let gen_elim_f
(p: vprop)
(a: Type)
(q: (a -> vprop))
(post: (a -> prop))
: Tot Type
= ((opened: inames) -> STGhost a opened p q True post)
module U = FStar.Universe
let gen_unit_elim_t (i: gen_unit_elim_i) : Tot Type =
gen_elim_f (compute_gen_unit_elim_p i) (U.raise_t u#_ u#1 unit... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Steel.ST.GenElim1.f... | [
{
"abbrev": true,
"full_module": "FStar.Universe",
"short_module": "U"
},
{
"abbrev": true,
"full_module": "FStar.Tactics",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim1.Base",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"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 |
ty: Type0 ->
body: (_: ty -> Steel.ST.GenElim1.Base.gen_elim_i) ->
ih: (x: ty -> Prims.GTot (Steel.ST.GenElim1.ge_to_tele_t (body x)))
-> Steel.ST.GenElim1.ge_to_tele_t (Steel.ST.GenElim1.Base.GEExists0 body) | Prims.Tot | [
"total"
] | [] | [
"Steel.ST.GenElim1.Base.gen_elim_i",
"Steel.ST.GenElim1.ge_to_tele_t",
"Steel.Memory.inames",
"Steel.ST.GenElim1.rewrite_with_trefl",
"Steel.ST.Util.exists_",
"FStar.Universe.raise_t",
"Steel.ST.GenElim1.tele_p",
"Steel.ST.GenElim1.Base.compute_gen_elim_tele",
"FStar.Universe.downgrade_val",
"Stee... | [] | false | false | false | false | false | let compute_gen_elim_tele_correct_exists0
(ty: _)
(body: (ty -> gen_elim_i))
(ih: (x: ty -> GTot (ge_to_tele_t (body x))))
: Tot (ge_to_tele_t (GEExists0 #ty body)) =
| fun _ ->
rewrite_with_trefl (compute_gen_elim_p _) (exists_ (fun x -> compute_gen_elim_p (body x)));
let x = elim_exists' () in
ih x _;
rewrite (tele_p (compute_gen_elim_tele (body x)))
(tele_p (compute_gen_elim_tele (body (U.downgrade_val (U.raise_val u#0 u#1 x)))));
intro_exists (U.raise_val u#0 u#1 x)
... | false |
Hacl.Impl.Ed25519.PointCompress.fst | Hacl.Impl.Ed25519.PointCompress.add_sign | val add_sign:
out:lbuffer uint8 32ul
-> x:uint64{v x < 2} ->
Stack unit
(requires fun h -> live h out /\ nat_from_bytes_le (as_seq h out) < Spec.Curve25519.prime)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
nat_from_bytes_le (as_seq h1 out) == nat_from_bytes_le (as_seq h0 out) + pow2 255 ... | val add_sign:
out:lbuffer uint8 32ul
-> x:uint64{v x < 2} ->
Stack unit
(requires fun h -> live h out /\ nat_from_bytes_le (as_seq h out) < Spec.Curve25519.prime)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
nat_from_bytes_le (as_seq h1 out) == nat_from_bytes_le (as_seq h0 out) + pow2 255 ... | let add_sign out x =
(**) let h0 = ST.get() in
let xbyte = to_u8 x in
let o31 = out.(31ul) in
(**) FStar.Math.Lemmas.lemma_mult_le_left (pow2 7) (v x) 1;
(**) assert (pow2 7 * (v x) <= pow2 7);
(**) assert_norm (pow2 7 < pow2 8);
(**) assert (v (xbyte <<. 7ul) == pow2 7 * (v x));
out.(31ul) <- o31 +. (x... | {
"file_name": "code/ed25519/Hacl.Impl.Ed25519.PointCompress.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 8,
"end_line": 129,
"start_col": 0,
"start_line": 76
} | module Hacl.Impl.Ed25519.PointCompress
module ST = FStar.HyperStack.ST
open FStar.HyperStack.All
open FStar.Mul
open Lib.IntTypes
open Lib.ByteSequence
open Lib.Buffer
open Hacl.Bignum25519
module F51 = Hacl.Impl.Ed25519.Field51
#set-options "--z3rlimit 20 --max_fuel 0 --max_ifuel 0"
inline_for_extraction noextr... | {
"checked_file": "/",
"dependencies": [
"Spec.Ed25519.fst.checked",
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.Compatibility.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.Ed25519.Field51.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Ed25519.Field51",
"short_module": "F51"
},
{
"abbrev": false,
"full_module": "Hacl.Bignum25519",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"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 | out: Lib.Buffer.lbuffer Lib.IntTypes.uint8 32ul -> x: Lib.IntTypes.uint64{Lib.IntTypes.v x < 2}
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"FStar.UInt32.__uint_to_t",
"Lib.IntTypes.uint64",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U64",
"Lib.IntTypes.SEC",
"FStar.Calc.calc_finish",
"Prims.nat",
"Prims.eq2",
"Lib.ByteSequence.nat_from_intseq_le",
"Lib.IntType... | [] | false | true | false | false | false | let add_sign out x =
| let h0 = ST.get () in
let xbyte = to_u8 x in
let o31 = out.(31ul) in
FStar.Math.Lemmas.lemma_mult_le_left (pow2 7) (v x) 1;
assert (pow2 7 * (v x) <= pow2 7);
assert_norm (pow2 7 < pow2 8);
assert (v (xbyte <<. 7ul) == pow2 7 * (v x));
out.(31ul) <- o31 +. (xbyte <<. 7ul);
let h1 = ST.get () in
calc ( == ) {
nat_from... | false |
Steel.ST.GenElim1.fst | Steel.ST.GenElim1.compute_gen_elim_tele_correct_star_l | val compute_gen_elim_tele_correct_star_l (l: gen_elim_i) (ihl: ge_to_tele_t l) (ru: gen_unit_elim_i)
: Tot (ge_to_tele_t (GEStarL l ru)) | val compute_gen_elim_tele_correct_star_l (l: gen_elim_i) (ihl: ge_to_tele_t l) (ru: gen_unit_elim_i)
: Tot (ge_to_tele_t (GEStarL l ru)) | let compute_gen_elim_tele_correct_star_l
(l: gen_elim_i)
(ihl: ge_to_tele_t l)
(ru: gen_unit_elim_i)
: Tot (ge_to_tele_t (GEStarL l ru))
= fun _ ->
rewrite_with_trefl (compute_gen_elim_p _) (compute_gen_elim_p l `star` compute_gen_unit_elim_p ru);
ihl _;
let _ = compute_gen_unit_elim_f ru _ in
intro_pure ... | {
"file_name": "lib/steel/Steel.ST.GenElim1.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 42,
"end_line": 314,
"start_col": 0,
"start_line": 303
} | module Steel.ST.GenElim1
let gen_elim_f
(p: vprop)
(a: Type)
(q: (a -> vprop))
(post: (a -> prop))
: Tot Type
= ((opened: inames) -> STGhost a opened p q True post)
module U = FStar.Universe
let gen_unit_elim_t (i: gen_unit_elim_i) : Tot Type =
gen_elim_f (compute_gen_unit_elim_p i) (U.raise_t u#_ u#1 unit... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Steel.ST.GenElim1.f... | [
{
"abbrev": true,
"full_module": "FStar.Universe",
"short_module": "U"
},
{
"abbrev": true,
"full_module": "FStar.Tactics",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim1.Base",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
l: Steel.ST.GenElim1.Base.gen_elim_i ->
ihl: Steel.ST.GenElim1.ge_to_tele_t l ->
ru: Steel.ST.GenElim1.Base.gen_unit_elim_i
-> Steel.ST.GenElim1.ge_to_tele_t (Steel.ST.GenElim1.Base.GEStarL l ru) | Prims.Tot | [
"total"
] | [] | [
"Steel.ST.GenElim1.Base.gen_elim_i",
"Steel.ST.GenElim1.ge_to_tele_t",
"Steel.ST.GenElim1.Base.gen_unit_elim_i",
"Steel.Memory.inames",
"Steel.ST.GenElim1.rewrite_with_trefl",
"Steel.ST.GenElim1.tele_p",
"Steel.ST.GenElim1.Base.tele_star_vprop",
"Steel.ST.GenElim1.Base.compute_gen_elim_tele",
"Steel... | [] | false | false | false | false | false | let compute_gen_elim_tele_correct_star_l (l: gen_elim_i) (ihl: ge_to_tele_t l) (ru: gen_unit_elim_i)
: Tot (ge_to_tele_t (GEStarL l ru)) =
| fun _ ->
rewrite_with_trefl (compute_gen_elim_p _)
((compute_gen_elim_p l) `star` (compute_gen_unit_elim_p ru));
ihl _;
let _ = compute_gen_unit_elim_f ru _ in
intro_pure (compute_gen_unit_elim_post ru);
tele_star_vprop_correct _ _ _ _;
rewrite_with_trefl (tele_p _) (tele_p _) | false |
Steel.ST.GenElim1.fst | Steel.ST.GenElim1.compute_gen_elim_tele_correct_star_r | val compute_gen_elim_tele_correct_star_r (lu: gen_unit_elim_i) (r: gen_elim_i) (ihr: ge_to_tele_t r)
: Tot (ge_to_tele_t (GEStarR lu r)) | val compute_gen_elim_tele_correct_star_r (lu: gen_unit_elim_i) (r: gen_elim_i) (ihr: ge_to_tele_t r)
: Tot (ge_to_tele_t (GEStarR lu r)) | let compute_gen_elim_tele_correct_star_r
(lu: gen_unit_elim_i)
(r: gen_elim_i)
(ihr: ge_to_tele_t r)
: Tot (ge_to_tele_t (GEStarR lu r))
= fun _ ->
rewrite_with_trefl (compute_gen_elim_p _) (compute_gen_unit_elim_p lu `star` compute_gen_elim_p r);
ihr _;
let _ = compute_gen_unit_elim_f lu _ in
intro_pure ... | {
"file_name": "lib/steel/Steel.ST.GenElim1.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 42,
"end_line": 327,
"start_col": 0,
"start_line": 316
} | module Steel.ST.GenElim1
let gen_elim_f
(p: vprop)
(a: Type)
(q: (a -> vprop))
(post: (a -> prop))
: Tot Type
= ((opened: inames) -> STGhost a opened p q True post)
module U = FStar.Universe
let gen_unit_elim_t (i: gen_unit_elim_i) : Tot Type =
gen_elim_f (compute_gen_unit_elim_p i) (U.raise_t u#_ u#1 unit... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Steel.ST.GenElim1.f... | [
{
"abbrev": true,
"full_module": "FStar.Universe",
"short_module": "U"
},
{
"abbrev": true,
"full_module": "FStar.Tactics",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim1.Base",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"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 |
lu: Steel.ST.GenElim1.Base.gen_unit_elim_i ->
r: Steel.ST.GenElim1.Base.gen_elim_i ->
ihr: Steel.ST.GenElim1.ge_to_tele_t r
-> Steel.ST.GenElim1.ge_to_tele_t (Steel.ST.GenElim1.Base.GEStarR lu r) | Prims.Tot | [
"total"
] | [] | [
"Steel.ST.GenElim1.Base.gen_unit_elim_i",
"Steel.ST.GenElim1.Base.gen_elim_i",
"Steel.ST.GenElim1.ge_to_tele_t",
"Steel.Memory.inames",
"Steel.ST.GenElim1.rewrite_with_trefl",
"Steel.ST.GenElim1.tele_p",
"Steel.ST.GenElim1.Base.tele_star_vprop",
"Steel.ST.GenElim1.Base.compute_gen_elim_tele",
"Steel... | [] | false | false | false | false | false | let compute_gen_elim_tele_correct_star_r (lu: gen_unit_elim_i) (r: gen_elim_i) (ihr: ge_to_tele_t r)
: Tot (ge_to_tele_t (GEStarR lu r)) =
| fun _ ->
rewrite_with_trefl (compute_gen_elim_p _)
((compute_gen_unit_elim_p lu) `star` (compute_gen_elim_p r));
ihr _;
let _ = compute_gen_unit_elim_f lu _ in
intro_pure (compute_gen_unit_elim_post lu);
tele_star_vprop_correct _ _ _ _;
rewrite_with_trefl (tele_p _) (tele_p _) | false |
CBOR.Spec.Map.fst | CBOR.Spec.Map.map_sort_correct | val map_sort_correct
(#t1 #t2: Type)
(key_order: (t1 -> t1 -> bool))
(key_compare: (t1 -> t1 -> int))
(l: list (t1 & t2))
: Lemma
(requires
((forall x. key_order x x == false) /\
(forall x y z. (key_order x y /\ key_order y z) ==> key_order x z) /\
(forall x... | val map_sort_correct
(#t1 #t2: Type)
(key_order: (t1 -> t1 -> bool))
(key_compare: (t1 -> t1 -> int))
(l: list (t1 & t2))
: Lemma
(requires
((forall x. key_order x x == false) /\
(forall x y z. (key_order x y /\ key_order y z) ==> key_order x z) /\
(forall x... | let rec map_sort_correct
(#t1 #t2: Type)
(key_order: t1 -> t1 -> bool)
(key_compare: t1 -> t1 -> int)
(l: list (t1 & t2))
: Lemma
(requires (
(forall x . key_order x x == false) /\
(forall x y z . (key_order x y /\ key_order y z) ==> key_order x z) /\
(forall x y . key_order x y == (key_compare x ... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CBOR.Spec.Map.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 5,
"end_line": 538,
"start_col": 0,
"start_line": 468
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked",
"CBOR.Spec.Type.fsti.checked"
],
"interface_fi... | [
{
"abbrev": false,
"full_module": "CBOR.Spec.Type",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.P... | {
"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 |
key_order: (_: t1 -> _: t1 -> Prims.bool) ->
key_compare: (_: t1 -> _: t1 -> Prims.int) ->
l: Prims.list (t1 * t2)
-> FStar.Pervasives.Lemma
(requires
(forall (x: t1). key_order x x == false) /\
(forall (x: t1) (y: t1) (z: t1). key_order x y /\ key_order y z ==> key_order x z) /\
... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.bool",
"Prims.int",
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"Prims.op_LessThan",
"Prims.op_Negation",
"Prims._assert",
"Prims.l_Forall",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"CBOR.Spec.Map.list_ghost_assoc",
"Prims.unit",
"CBOR.Spec.Map.list_ghost_assoc_no_repeats_eq... | [
"recursion"
] | false | false | true | false | false | let rec map_sort_correct
(#t1 #t2: Type)
(key_order: (t1 -> t1 -> bool))
(key_compare: (t1 -> t1 -> int))
(l: list (t1 & t2))
: Lemma
(requires
((forall x. key_order x x == false) /\
(forall x y z. (key_order x y /\ key_order y z) ==> key_order x z) /\
(fora... | let len = List.Tot.length l in
if len < 2
then ()
else
let l1, l2 = List.Tot.splitAt (len / 2) l in
List.Tot.append_memP_forall l1 l2;
List.Tot.map_append fst l1 l2;
List.Tot.no_repeats_p_append (List.Tot.map fst l1) (List.Tot.map fst l2);
List.Tot.append_memP_forall (List.Tot.map fst l1) (List.Tot.map fst l2... | false |
Steel.ST.GenElim1.fst | Steel.ST.GenElim1.compute_gen_elim_nondep_correct1 | val compute_gen_elim_nondep_correct1 (i0: gen_elim_i) (t1: Type)
: Tot (compute_gen_elim_nondep_correct_t i0 [t1]) | val compute_gen_elim_nondep_correct1 (i0: gen_elim_i) (t1: Type)
: Tot (compute_gen_elim_nondep_correct_t i0 [t1]) | let compute_gen_elim_nondep_correct1
(i0: gen_elim_i)
(t1: Type)
: Tot (compute_gen_elim_nondep_correct_t i0 [t1])
= fun q post intro _ ->
intro _;
rewrite_with_trefl (gen_elim_nondep_p _ _ _) (exists_ (fun x1 -> q x1 (U.raise_val ()) `star` pure (post x1 (U.raise_val ()))));
let res = elim_exists' () i... | {
"file_name": "lib/steel/Steel.ST.GenElim1.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 7,
"end_line": 497,
"start_col": 0,
"start_line": 487
} | module Steel.ST.GenElim1
let gen_elim_f
(p: vprop)
(a: Type)
(q: (a -> vprop))
(post: (a -> prop))
: Tot Type
= ((opened: inames) -> STGhost a opened p q True post)
module U = FStar.Universe
let gen_unit_elim_t (i: gen_unit_elim_i) : Tot Type =
gen_elim_f (compute_gen_unit_elim_p i) (U.raise_t u#_ u#1 unit... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Steel.ST.GenElim1.f... | [
{
"abbrev": true,
"full_module": "FStar.Universe",
"short_module": "U"
},
{
"abbrev": true,
"full_module": "FStar.Tactics",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim1.Base",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"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 | i0: Steel.ST.GenElim1.Base.gen_elim_i -> t1: Type
-> Steel.ST.GenElim1.compute_gen_elim_nondep_correct_t i0 [t1] | Prims.Tot | [
"total"
] | [] | [
"Steel.ST.GenElim1.Base.gen_elim_i",
"Steel.ST.GenElim1.Base.curried_function_type",
"Prims.Cons",
"Prims.Nil",
"FStar.Universe.raise_t",
"Prims.unit",
"Steel.Effect.Common.vprop",
"Prims.prop",
"Steel.ST.GenElim1.vprop_rewrite",
"Steel.ST.GenElim1.Base.compute_gen_elim_p",
"Steel.ST.GenElim1.ge... | [] | false | false | false | false | false | let compute_gen_elim_nondep_correct1 (i0: gen_elim_i) (t1: Type)
: Tot (compute_gen_elim_nondep_correct_t i0 [t1]) =
| fun q post intro _ ->
intro _;
rewrite_with_trefl (gen_elim_nondep_p _ _ _)
(exists_ (fun x1 -> (q x1 (U.raise_val ())) `star` (pure (post x1 (U.raise_val ())))));
let res = elim_exists' () in
elim_pure _;
rewrite_with_trefl (q _ (U.raise_val ()))
(compute_uncurry _ (fun _ -> compute_gen_elim_p' i0) _... | false |
Steel.Primitive.ForkJoin.fst | Steel.Primitive.ForkJoin.maybe_p | val maybe_p : p: Steel.Effect.Common.vprop -> v: Prims.bool -> Steel.Effect.Common.vprop | let maybe_p (p:vprop) (v:bool) = if v then p else emp | {
"file_name": "lib/steel/Steel.Primitive.ForkJoin.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 53,
"end_line": 28,
"start_col": 0,
"start_line": 28
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Steel.SpinLock.fsti.checked",
"Steel.Reference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.... | [
{
"abbrev": false,
"full_module": "Steel.Reference",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"short_module": null
},
{
"abbrev": true,
"full_module": "Steel.SpinLock",
"short_module": "L"
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: Steel.Effect.Common.vprop -> v: Prims.bool -> Steel.Effect.Common.vprop | Prims.Tot | [
"total"
] | [] | [
"Steel.Effect.Common.vprop",
"Prims.bool",
"Steel.Effect.Common.emp"
] | [] | false | false | false | true | false | let maybe_p (p: vprop) (v: bool) =
| if v then p else emp | false | |
Steel.Primitive.ForkJoin.fst | Steel.Primitive.ForkJoin.lock_inv_pred | val lock_inv_pred (r: ref bool) (p: vprop) (v: bool) : vprop | val lock_inv_pred (r: ref bool) (p: vprop) (v: bool) : vprop | let lock_inv_pred (r:ref bool) (p:vprop) (v:bool) : vprop =
pts_to r full_perm v `star` maybe_p p v | {
"file_name": "lib/steel/Steel.Primitive.ForkJoin.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 41,
"end_line": 32,
"start_col": 0,
"start_line": 31
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Steel.SpinLock.fsti.checked",
"Steel.Reference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.... | [
{
"abbrev": false,
"full_module": "Steel.Reference",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"short_module": null
},
{
"abbrev": true,
"full_module": "Steel.SpinLock",
"short_module": "L"
},
{
"abbrev": false,
"f... | {
"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 | r: Steel.Reference.ref Prims.bool -> p: Steel.Effect.Common.vprop -> v: Prims.bool
-> Steel.Effect.Common.vprop | Prims.Tot | [
"total"
] | [] | [
"Steel.Reference.ref",
"Prims.bool",
"Steel.Effect.Common.vprop",
"Steel.Effect.Common.star",
"Steel.Reference.pts_to",
"Steel.FractionalPermission.full_perm",
"Steel.Primitive.ForkJoin.maybe_p"
] | [] | false | false | false | true | false | let lock_inv_pred (r: ref bool) (p: vprop) (v: bool) : vprop =
| (pts_to r full_perm v) `star` (maybe_p p v) | false |
Steel.Primitive.ForkJoin.fst | Steel.Primitive.ForkJoin.lock_inv | val lock_inv (r: ref bool) (p: vprop) : vprop | val lock_inv (r: ref bool) (p: vprop) : vprop | let lock_inv (r:ref bool) (p:vprop)
: vprop
= h_exists (lock_inv_pred r p) | {
"file_name": "lib/steel/Steel.Primitive.ForkJoin.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 32,
"end_line": 36,
"start_col": 0,
"start_line": 34
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Steel.SpinLock.fsti.checked",
"Steel.Reference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.... | [
{
"abbrev": false,
"full_module": "Steel.Reference",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"short_module": null
},
{
"abbrev": true,
"full_module": "Steel.SpinLock",
"short_module": "L"
},
{
"abbrev": false,
"f... | {
"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 | r: Steel.Reference.ref Prims.bool -> p: Steel.Effect.Common.vprop -> Steel.Effect.Common.vprop | Prims.Tot | [
"total"
] | [] | [
"Steel.Reference.ref",
"Prims.bool",
"Steel.Effect.Common.vprop",
"Steel.Effect.Atomic.h_exists",
"Steel.Primitive.ForkJoin.lock_inv_pred"
] | [] | false | false | false | true | false | let lock_inv (r: ref bool) (p: vprop) : vprop =
| h_exists (lock_inv_pred r p) | false |
MerkleTree.New.High.Correct.Rhs.fst | MerkleTree.New.High.Correct.Rhs.construct_rhs_acc_consistent | val construct_rhs_acc_consistent:
#hsz:pos -> #f:MTS.hash_fun_t #hsz ->
lv:nat{lv <= 32} ->
i:nat ->
j:nat{i <= j /\ j < pow2 (32 - lv)} ->
olds:hashess #hsz {S.length olds = 32 /\ mt_olds_inv #hsz lv i olds} ->
hs:hashess #hsz {S.length hs = 32 /\ hs_wf_elts lv hs i j} ->
rhs:hashes #hsz {S.length rhs = ... | val construct_rhs_acc_consistent:
#hsz:pos -> #f:MTS.hash_fun_t #hsz ->
lv:nat{lv <= 32} ->
i:nat ->
j:nat{i <= j /\ j < pow2 (32 - lv)} ->
olds:hashess #hsz {S.length olds = 32 /\ mt_olds_inv #hsz lv i olds} ->
hs:hashess #hsz {S.length hs = 32 /\ hs_wf_elts lv hs i j} ->
rhs:hashes #hsz {S.length rhs = ... | let rec construct_rhs_acc_consistent #hsz #f lv i j olds hs rhs acc actd =
assert (j < pow2 (32 - lv));
assert (j <> 0 ==> j / 2 < pow2 (32 - (lv + 1)));
log2c_bound j (32 - lv);
mt_olds_hs_lth_inv_ok #_ #f lv i j olds hs;
mt_hashes_lth_inv_log_converted_ #_ #f lv j (merge_hs #_ #f olds hs);
let rrf = const... | {
"file_name": "src/MerkleTree.New.High.Correct.Rhs.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 5,
"end_line": 314,
"start_col": 0,
"start_line": 235
} | module MerkleTree.New.High.Correct.Rhs
open FStar.Classical
open FStar.Ghost
open FStar.Seq
module S = FStar.Seq
module MTS = MerkleTree.Spec
open MerkleTree.New.High
open MerkleTree.New.High.Correct.Base
#set-options "--z3rlimit 10 --initial_fuel 1 --max_fuel 1 --initial_ifuel 0 --max_ifuel 0"
/// Correctness of... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MerkleTree.Spec.fst.checked",
"MerkleTree.New.High.Correct.Base.fst.checked",
"MerkleTree.New.High.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghos... | [
{
"abbrev": false,
"full_module": "MerkleTree.New.High.Correct.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "MerkleTree.New.High",
"short_module": null
},
{
"abbrev": true,
"full_module": "MerkleTree.Spec",
"short_module": "MTS"
},
{
"abbrev": ... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 3,
"quake_keep": false,
"quake_lo": 1,
"retry": true,
"reuse_hint_for": null,
"smtencoding_eli... | false |
lv: Prims.nat{lv <= 32} ->
i: Prims.nat ->
j: Prims.nat{i <= j /\ j < Prims.pow2 (32 - lv)} ->
olds:
MerkleTree.New.High.hashess
{FStar.Seq.Base.length olds = 32 /\ MerkleTree.New.High.Correct.Base.mt_olds_inv lv i olds} ->
hs:
MerkleTree.New.High.hashess
{FStar.Seq.Base... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.pos",
"MerkleTree.Spec.hash_fun_t",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.l_and",
"Prims.op_LessThan",
"Prims.pow2",
"Prims.op_Subtraction",
"MerkleTree.New.High.hashess",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"MerkleTree.New.High.hashes",... | [
"recursion"
] | false | false | true | false | false | let rec construct_rhs_acc_consistent #hsz #f lv i j olds hs rhs acc actd =
| assert (j < pow2 (32 - lv));
assert (j <> 0 ==> j / 2 < pow2 (32 - (lv + 1)));
log2c_bound j (32 - lv);
mt_olds_hs_lth_inv_ok #_ #f lv i j olds hs;
mt_hashes_lth_inv_log_converted_ #_ #f lv j (merge_hs #_ #f olds hs);
let rrf = construct_rhs_acc #_ #f j (S.slice (merge_hs #_ #f olds hs) lv (lv + log2c j)) acc actd in
l... | false |
Hacl.Impl.Frodo.Sample.fst | Hacl.Impl.Frodo.Sample.frodo_sample_st | val frodo_sample_st : a: Spec.Frodo.Params.frodo_alg -> Type0 | let frodo_sample_st (a:FP.frodo_alg) =
r:uint16
-> Stack uint16
(requires fun h -> True)
(ensures fun h0 res h1 -> modifies0 h0 h1 /\
res == S.frodo_sample a r) | {
"file_name": "code/frodo/Hacl.Impl.Frodo.Sample.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 32,
"end_line": 60,
"start_col": 0,
"start_line": 55
} | module Hacl.Impl.Frodo.Sample
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Hacl.Impl.Matrix
open Hacl.Impl.Frodo.Params
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
module Lemmas = Spec.Frod... | {
"checked_file": "/",
"dependencies": [
"Spec.Frodo.Sample.fst.checked",
"Spec.Frodo.Params.fst.checked",
"Spec.Frodo.Lemmas.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.Loops.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Frodo.Params",
"short_module": "FP"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.Sample",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.Lemmas",
"short_module": "Lemmas"
},
{
"abbrev": true,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.Frodo.Params.frodo_alg -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Spec.Frodo.Params.frodo_alg",
"Lib.IntTypes.uint16",
"FStar.Monotonic.HyperStack.mem",
"Prims.l_True",
"Prims.l_and",
"Lib.Buffer.modifies0",
"Prims.eq2",
"Spec.Frodo.Sample.frodo_sample"
] | [] | false | false | false | true | true | let frodo_sample_st (a: FP.frodo_alg) =
| r: uint16
-> Stack uint16
(requires fun h -> True)
(ensures fun h0 res h1 -> modifies0 h0 h1 /\ res == S.frodo_sample a r) | false | |
Hacl.Impl.Frodo.Sample.fst | Hacl.Impl.Frodo.Sample.frodo_sample_matrix64 | val frodo_sample_matrix64:frodo_sample_matrix_st FP.Frodo64 | val frodo_sample_matrix64:frodo_sample_matrix_st FP.Frodo64 | let frodo_sample_matrix64 : frodo_sample_matrix_st FP.Frodo64 =
frodo_sample_matrix_ FP.Frodo64 (frodo_sample FP.Frodo64) | {
"file_name": "code/frodo/Hacl.Impl.Frodo.Sample.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 59,
"end_line": 161,
"start_col": 0,
"start_line": 160
} | module Hacl.Impl.Frodo.Sample
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Hacl.Impl.Matrix
open Hacl.Impl.Frodo.Params
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
module Lemmas = Spec.Frod... | {
"checked_file": "/",
"dependencies": [
"Spec.Frodo.Sample.fst.checked",
"Spec.Frodo.Params.fst.checked",
"Spec.Frodo.Lemmas.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.Loops.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Frodo.Params",
"short_module": "FP"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.Sample",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.Lemmas",
"short_module": "Lemmas"
},
{
"abbrev": true,
"full... | {
"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.Impl.Frodo.Sample.frodo_sample_matrix_st Spec.Frodo.Params.Frodo64 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Frodo.Sample.frodo_sample_matrix_",
"Spec.Frodo.Params.Frodo64",
"Hacl.Impl.Frodo.Sample.frodo_sample"
] | [] | false | false | false | true | false | let frodo_sample_matrix64:frodo_sample_matrix_st FP.Frodo64 =
| frodo_sample_matrix_ FP.Frodo64 (frodo_sample FP.Frodo64) | false |
Hacl.Impl.Frodo.Sample.fst | Hacl.Impl.Frodo.Sample.frodo_sample_matrix640 | val frodo_sample_matrix640:frodo_sample_matrix_st FP.Frodo640 | val frodo_sample_matrix640:frodo_sample_matrix_st FP.Frodo640 | let frodo_sample_matrix640 : frodo_sample_matrix_st FP.Frodo640 =
frodo_sample_matrix_ FP.Frodo640 (frodo_sample FP.Frodo640) | {
"file_name": "code/frodo/Hacl.Impl.Frodo.Sample.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 61,
"end_line": 164,
"start_col": 0,
"start_line": 163
} | module Hacl.Impl.Frodo.Sample
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Hacl.Impl.Matrix
open Hacl.Impl.Frodo.Params
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
module Lemmas = Spec.Frod... | {
"checked_file": "/",
"dependencies": [
"Spec.Frodo.Sample.fst.checked",
"Spec.Frodo.Params.fst.checked",
"Spec.Frodo.Lemmas.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.Loops.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Frodo.Params",
"short_module": "FP"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.Sample",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.Lemmas",
"short_module": "Lemmas"
},
{
"abbrev": true,
"full... | {
"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.Impl.Frodo.Sample.frodo_sample_matrix_st Spec.Frodo.Params.Frodo640 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Frodo.Sample.frodo_sample_matrix_",
"Spec.Frodo.Params.Frodo640",
"Hacl.Impl.Frodo.Sample.frodo_sample"
] | [] | false | false | false | true | false | let frodo_sample_matrix640:frodo_sample_matrix_st FP.Frodo640 =
| frodo_sample_matrix_ FP.Frodo640 (frodo_sample FP.Frodo640) | false |
Hacl.Impl.Frodo.Sample.fst | Hacl.Impl.Frodo.Sample.frodo_sample_res | val frodo_sample_res:
a:FP.frodo_alg
-> sign:uint16{v sign <= 1}
-> sample:uint16{v sample < v (cdf_table_len a)}
-> res:uint16{res == S.frodo_sample_res a sign (v sample)} | val frodo_sample_res:
a:FP.frodo_alg
-> sign:uint16{v sign <= 1}
-> sample:uint16{v sample < v (cdf_table_len a)}
-> res:uint16{res == S.frodo_sample_res a sign (v sample)} | let frodo_sample_res a sign sample =
Lemmas.lemma_frodo_sample2 sign sample;
((lognot sign +. u16 1) ^. sample) +. sign | {
"file_name": "code/frodo/Hacl.Impl.Frodo.Sample.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 44,
"end_line": 51,
"start_col": 0,
"start_line": 49
} | module Hacl.Impl.Frodo.Sample
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Hacl.Impl.Matrix
open Hacl.Impl.Frodo.Params
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
module Lemmas = Spec.Frod... | {
"checked_file": "/",
"dependencies": [
"Spec.Frodo.Sample.fst.checked",
"Spec.Frodo.Params.fst.checked",
"Spec.Frodo.Lemmas.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.Loops.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Frodo.Params",
"short_module": "FP"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.Sample",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.Lemmas",
"short_module": "Lemmas"
},
{
"abbrev": true,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
a: Spec.Frodo.Params.frodo_alg ->
sign: Lib.IntTypes.uint16{Lib.IntTypes.v sign <= 1} ->
sample:
Lib.IntTypes.uint16
{Lib.IntTypes.v sample < Lib.IntTypes.v (Hacl.Impl.Frodo.Params.cdf_table_len a)}
-> res:
Lib.IntTypes.uint16{res == Spec.Frodo.Sample.frodo_sample_res a sign (Lib.IntTyp... | Prims.Tot | [
"total"
] | [] | [
"Spec.Frodo.Params.frodo_alg",
"Lib.IntTypes.uint16",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Lib.IntTypes.v",
"Lib.IntTypes.U16",
"Lib.IntTypes.SEC",
"Prims.op_LessThan",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Impl.Frodo.Params.cdf_table_len",
"Lib.IntTypes.op_Plus_Dot",
"Lib.IntTy... | [] | false | false | false | false | false | let frodo_sample_res a sign sample =
| Lemmas.lemma_frodo_sample2 sign sample;
((lognot sign +. u16 1) ^. sample) +. sign | false |
Hacl.Impl.Frodo.Sample.fst | Hacl.Impl.Frodo.Sample.frodo_sample_matrix976 | val frodo_sample_matrix976:frodo_sample_matrix_st FP.Frodo976 | val frodo_sample_matrix976:frodo_sample_matrix_st FP.Frodo976 | let frodo_sample_matrix976 : frodo_sample_matrix_st FP.Frodo976 =
frodo_sample_matrix_ FP.Frodo976 (frodo_sample FP.Frodo976) | {
"file_name": "code/frodo/Hacl.Impl.Frodo.Sample.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 61,
"end_line": 167,
"start_col": 0,
"start_line": 166
} | module Hacl.Impl.Frodo.Sample
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Hacl.Impl.Matrix
open Hacl.Impl.Frodo.Params
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
module Lemmas = Spec.Frod... | {
"checked_file": "/",
"dependencies": [
"Spec.Frodo.Sample.fst.checked",
"Spec.Frodo.Params.fst.checked",
"Spec.Frodo.Lemmas.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.Loops.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Frodo.Params",
"short_module": "FP"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.Sample",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.Lemmas",
"short_module": "Lemmas"
},
{
"abbrev": true,
"full... | {
"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.Impl.Frodo.Sample.frodo_sample_matrix_st Spec.Frodo.Params.Frodo976 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Frodo.Sample.frodo_sample_matrix_",
"Spec.Frodo.Params.Frodo976",
"Hacl.Impl.Frodo.Sample.frodo_sample"
] | [] | false | false | false | true | false | let frodo_sample_matrix976:frodo_sample_matrix_st FP.Frodo976 =
| frodo_sample_matrix_ FP.Frodo976 (frodo_sample FP.Frodo976) | false |
FStar.SizeT.fst | FStar.SizeT.fits | val fits (x: nat) : Tot prop | val fits (x: nat) : Tot prop | let fits x =
FStar.UInt.fits x U64.n == true /\
x < bound | {
"file_name": "ulib/FStar.SizeT.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 11,
"end_line": 17,
"start_col": 0,
"start_line": 15
} | module FStar.SizeT
open FStar.Ghost
module I64 = FStar.Int64
(* This is only intended as a model, but will be extracted natively by Krml
with the correct C semantics *)
(* We assume the existence of some lower bound on the size,
where the bound is at least 2^16 *)
assume
val bound : x:erased nat { x >= pow2 16 ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Int64.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": true,
"source_file": "FS... | [
{
"abbrev": true,
"full_module": "FStar.Int64",
"short_module": "I64"
},
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Prims.nat -> Prims.prop | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.l_and",
"Prims.eq2",
"Prims.bool",
"FStar.UInt.fits",
"FStar.UInt64.n",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Ghost.reveal",
"FStar.SizeT.bound",
"Prims.prop"
] | [] | false | false | false | true | true | let fits x =
| FStar.UInt.fits x U64.n == true /\ x < bound | false |
Hacl.Impl.Frodo.Sample.fst | Hacl.Impl.Frodo.Sample.frodo_sample_matrix1344 | val frodo_sample_matrix1344:frodo_sample_matrix_st FP.Frodo1344 | val frodo_sample_matrix1344:frodo_sample_matrix_st FP.Frodo1344 | let frodo_sample_matrix1344 : frodo_sample_matrix_st FP.Frodo1344=
frodo_sample_matrix_ FP.Frodo1344 (frodo_sample FP.Frodo1344) | {
"file_name": "code/frodo/Hacl.Impl.Frodo.Sample.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 63,
"end_line": 170,
"start_col": 0,
"start_line": 169
} | module Hacl.Impl.Frodo.Sample
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Hacl.Impl.Matrix
open Hacl.Impl.Frodo.Params
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
module Lemmas = Spec.Frod... | {
"checked_file": "/",
"dependencies": [
"Spec.Frodo.Sample.fst.checked",
"Spec.Frodo.Params.fst.checked",
"Spec.Frodo.Lemmas.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.Loops.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Frodo.Params",
"short_module": "FP"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.Sample",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.Lemmas",
"short_module": "Lemmas"
},
{
"abbrev": true,
"full... | {
"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.Impl.Frodo.Sample.frodo_sample_matrix_st Spec.Frodo.Params.Frodo1344 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Frodo.Sample.frodo_sample_matrix_",
"Spec.Frodo.Params.Frodo1344",
"Hacl.Impl.Frodo.Sample.frodo_sample"
] | [] | false | false | false | true | false | let frodo_sample_matrix1344:frodo_sample_matrix_st FP.Frodo1344 =
| frodo_sample_matrix_ FP.Frodo1344 (frodo_sample FP.Frodo1344) | false |
Hacl.Impl.Frodo.Sample.fst | Hacl.Impl.Frodo.Sample.frodo_sample_f | val frodo_sample_f:
a:FP.frodo_alg
-> t:uint16{uint_v t < pow2 15}
-> i:size_t{v i < v (cdf_table_len a)}
-> Stack uint16
(requires fun h -> True)
(ensures fun h0 r h1 -> modifies0 h0 h1 /\
v r == S.frodo_sample_f a t (v i)) | val frodo_sample_f:
a:FP.frodo_alg
-> t:uint16{uint_v t < pow2 15}
-> i:size_t{v i < v (cdf_table_len a)}
-> Stack uint16
(requires fun h -> True)
(ensures fun h0 r h1 -> modifies0 h0 h1 /\
v r == S.frodo_sample_f a t (v i)) | let frodo_sample_f a t i =
recall_contents (cdf_table a) (FP.cdf_table a);
let ti = index (cdf_table a) i in
FP.lemma_cdf_list a (v i);
Lemmas.lemma_frodo_sample t ti;
to_u16 (to_u32 (ti -. t)) >>. 15ul | {
"file_name": "code/frodo/Hacl.Impl.Frodo.Sample.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 36,
"end_line": 39,
"start_col": 0,
"start_line": 34
} | module Hacl.Impl.Frodo.Sample
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Hacl.Impl.Matrix
open Hacl.Impl.Frodo.Params
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
module Lemmas = Spec.Frod... | {
"checked_file": "/",
"dependencies": [
"Spec.Frodo.Sample.fst.checked",
"Spec.Frodo.Params.fst.checked",
"Spec.Frodo.Lemmas.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.Loops.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Frodo.Params",
"short_module": "FP"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.Sample",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.Lemmas",
"short_module": "Lemmas"
},
{
"abbrev": true,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
a: Spec.Frodo.Params.frodo_alg ->
t: Lib.IntTypes.uint16{Lib.IntTypes.uint_v t < Prims.pow2 15} ->
i:
Lib.IntTypes.size_t
{Lib.IntTypes.v i < Lib.IntTypes.v (Hacl.Impl.Frodo.Params.cdf_table_len a)}
-> FStar.HyperStack.ST.Stack Lib.IntTypes.uint16 | FStar.HyperStack.ST.Stack | [] | [] | [
"Spec.Frodo.Params.frodo_alg",
"Lib.IntTypes.uint16",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.uint_v",
"Lib.IntTypes.U16",
"Lib.IntTypes.SEC",
"Prims.pow2",
"Lib.IntTypes.size_t",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Impl.Frodo.Params.cdf_table_len",
"Lib... | [] | false | true | false | false | false | let frodo_sample_f a t i =
| recall_contents (cdf_table a) (FP.cdf_table a);
let ti = index (cdf_table a) i in
FP.lemma_cdf_list a (v i);
Lemmas.lemma_frodo_sample t ti;
to_u16 (to_u32 (ti -. t)) >>. 15ul | false |
Hacl.Impl.Frodo.Sample.fst | Hacl.Impl.Frodo.Sample.frodo_sample_matrix_st | val frodo_sample_matrix_st : a: Spec.Frodo.Params.frodo_alg -> Type0 | let frodo_sample_matrix_st (a:FP.frodo_alg) =
n1:size_t
-> n2:size_t{0 < 2 * v n1 * v n2 /\ 2 * v n1 * v n2 <= max_size_t}
-> r:lbytes (2ul *! n1 *! n2)
-> res:matrix_t n1 n2
-> Stack unit
(requires fun h ->
live h r /\ live h res /\ disjoint r res)
(ensures fun h0 r_ h1 -> modifies1 res h0 h... | {
"file_name": "code/frodo/Hacl.Impl.Frodo.Sample.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 78,
"end_line": 136,
"start_col": 0,
"start_line": 127
} | module Hacl.Impl.Frodo.Sample
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Hacl.Impl.Matrix
open Hacl.Impl.Frodo.Params
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
module Lemmas = Spec.Frod... | {
"checked_file": "/",
"dependencies": [
"Spec.Frodo.Sample.fst.checked",
"Spec.Frodo.Params.fst.checked",
"Spec.Frodo.Lemmas.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.Loops.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Frodo.Params",
"short_module": "FP"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.Sample",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.Lemmas",
"short_module": "Lemmas"
},
{
"abbrev": true,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.Frodo.Params.frodo_alg -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Spec.Frodo.Params.frodo_alg",
"Lib.IntTypes.size_t",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Mul.op_Star",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Prims.op_LessThanOrEqual",
"Lib.IntTypes.max_size_t",
"Hacl.Impl.Matrix.lbytes",
"Lib.IntTypes.op_Star_Bang",... | [] | false | false | false | true | true | let frodo_sample_matrix_st (a: FP.frodo_alg) =
|
n1: size_t ->
n2: size_t{0 < (2 * v n1) * v n2 /\ (2 * v n1) * v n2 <= max_size_t} ->
r: lbytes (2ul *! n1 *! n2) ->
res: matrix_t n1 n2
-> Stack unit
(requires fun h -> live h r /\ live h res /\ disjoint r res)
(ensures
fun h0 r_ h1 ->
modifies1 res h0 h1 /\
a... | false | |
FStar.SizeT.fst | FStar.SizeT.t | val t : eqtype | val t : eqtype | let t = x:U64.t { U64.v x < bound } | {
"file_name": "ulib/FStar.SizeT.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 35,
"end_line": 13,
"start_col": 0,
"start_line": 13
} | module FStar.SizeT
open FStar.Ghost
module I64 = FStar.Int64
(* This is only intended as a model, but will be extracted natively by Krml
with the correct C semantics *)
(* We assume the existence of some lower bound on the size,
where the bound is at least 2^16 *)
assume
val bound : x:erased nat { x >= pow2 16 ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Int64.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": true,
"source_file": "FS... | [
{
"abbrev": true,
"full_module": "FStar.Int64",
"short_module": "I64"
},
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Prims.eqtype | Prims.Tot | [
"total"
] | [] | [
"FStar.UInt64.t",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.UInt64.v",
"FStar.Ghost.reveal",
"Prims.nat",
"FStar.SizeT.bound"
] | [] | false | false | false | true | false | let t =
| x: U64.t{U64.v x < bound} | false |
FStar.SizeT.fst | FStar.SizeT.fits_u32 | val fits_u32 : prop | val fits_u32 : prop | let fits_u32 = (reveal bound >= pow2 32) == true | {
"file_name": "ulib/FStar.SizeT.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 48,
"end_line": 35,
"start_col": 0,
"start_line": 35
} | module FStar.SizeT
open FStar.Ghost
module I64 = FStar.Int64
(* This is only intended as a model, but will be extracted natively by Krml
with the correct C semantics *)
(* We assume the existence of some lower bound on the size,
where the bound is at least 2^16 *)
assume
val bound : x:erased nat { x >= pow2 16 ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Int64.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": true,
"source_file": "FS... | [
{
"abbrev": true,
"full_module": "FStar.Int64",
"short_module": "I64"
},
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Prims.prop | Prims.Tot | [
"total"
] | [] | [
"Prims.eq2",
"Prims.bool",
"Prims.op_GreaterThanOrEqual",
"FStar.Ghost.reveal",
"Prims.nat",
"FStar.SizeT.bound",
"Prims.pow2"
] | [] | false | false | false | true | true | let fits_u32 =
| (reveal bound >= pow2 32) == true | false |
FStar.SizeT.fst | FStar.SizeT.v | val v (x: t) : Pure nat
(requires True)
(ensures (fun y -> fits y)) | val v (x: t) : Pure nat
(requires True)
(ensures (fun y -> fits y)) | let v x =
U64.v x | {
"file_name": "ulib/FStar.SizeT.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 9,
"end_line": 22,
"start_col": 0,
"start_line": 21
} | module FStar.SizeT
open FStar.Ghost
module I64 = FStar.Int64
(* This is only intended as a model, but will be extracted natively by Krml
with the correct C semantics *)
(* We assume the existence of some lower bound on the size,
where the bound is at least 2^16 *)
assume
val bound : x:erased nat { x >= pow2 16 ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Int64.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": true,
"source_file": "FS... | [
{
"abbrev": true,
"full_module": "FStar.Int64",
"short_module": "I64"
},
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"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.SizeT.t -> Prims.Pure Prims.nat | Prims.Pure | [] | [] | [
"FStar.SizeT.t",
"FStar.UInt64.v",
"Prims.nat"
] | [] | false | false | false | false | false | let v x =
| U64.v x | false |
Steel.ST.C.Types.Scalar.fsti | Steel.ST.C.Types.Scalar.read | val read (#t: Type) (#v: Ghost.erased (scalar_t t)) (r: ref (scalar t))
: ST t
(pts_to r v)
(fun _ -> pts_to r v)
(exists v0 p. Ghost.reveal v == mk_fraction (scalar t) (mk_scalar v0) p)
(fun v1 -> forall v0 p. Ghost.reveal v == mk_fraction (scalar t) (mk_scalar v0) p ==> v0 == v1
) | val read (#t: Type) (#v: Ghost.erased (scalar_t t)) (r: ref (scalar t))
: ST t
(pts_to r v)
(fun _ -> pts_to r v)
(exists v0 p. Ghost.reveal v == mk_fraction (scalar t) (mk_scalar v0) p)
(fun v1 -> forall v0 p. Ghost.reveal v == mk_fraction (scalar t) (mk_scalar v0) p ==> v0 == v1
) | let read (#t: Type) (#v: Ghost.erased (scalar_t t)) (r: ref (scalar t)) : ST t
(pts_to r v)
(fun _ -> pts_to r v)
(exists v0 p . Ghost.reveal v == mk_fraction (scalar t) (mk_scalar v0) p)
(fun v1 -> forall v0 p . (* {:pattern (mk_fraction (scalar t) (mk_scalar v0) p)} *) Ghost.reveal v == mk_fraction (scalar t)... | {
"file_name": "lib/steel/c/Steel.ST.C.Types.Scalar.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 11,
"end_line": 126,
"start_col": 0,
"start_line": 106
} | module Steel.ST.C.Types.Scalar
open Steel.ST.Util
include Steel.ST.C.Types.Base
module P = Steel.FractionalPermission
// To be extracted as: t
[@@noextract_to "krml"] // primitive
val scalar_t ( [@@@strictly_positive] t: Type0) : Type0
[@@noextract_to "krml"] // proof-only
val scalar (t: Type) : typedef (scalar_t t)
... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.Util.fsti.checked",
"Steel.ST.C.Types.Base.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.... | [
{
"abbrev": true,
"full_module": "Steel.FractionalPermission",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Steel.ST.C.Types.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.ST.Util",
"short_module": null
},
{
"abbrev": false,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: Steel.ST.C.Types.Base.ref (Steel.ST.C.Types.Scalar.scalar t) -> Steel.ST.Effect.ST t | Steel.ST.Effect.ST | [] | [] | [
"FStar.Ghost.erased",
"Steel.ST.C.Types.Scalar.scalar_t",
"Steel.ST.C.Types.Base.ref",
"Steel.ST.C.Types.Scalar.scalar",
"Steel.ST.Util.return",
"FStar.Ghost.hide",
"FStar.Set.set",
"Steel.Memory.iname",
"FStar.Set.empty",
"Steel.ST.C.Types.Base.pts_to",
"Steel.Effect.Common.vprop",
"Prims.uni... | [] | false | true | false | false | false | let read (#t: Type) (#v: Ghost.erased (scalar_t t)) (r: ref (scalar t))
: ST t
(pts_to r v)
(fun _ -> pts_to r v)
(exists v0 p. Ghost.reveal v == mk_fraction (scalar t) (mk_scalar v0) p)
(fun v1 -> forall v0 p. Ghost.reveal v == mk_fraction (scalar t) (mk_scalar v0) p ==> v0 == v1
) =
... | let v0 =
FStar.IndefiniteDescription.indefinite_description_tot _
(fun v0 -> exists p. Ghost.reveal v == mk_fraction (scalar t) (mk_scalar v0) p)
in
let p =
FStar.IndefiniteDescription.indefinite_description_tot _
(fun p -> Ghost.reveal v == mk_fraction (scalar t) (mk_scalar (Ghost.reveal v0)) p)
in
let prf... | false |
FStar.SizeT.fst | FStar.SizeT.uint_to_t | val uint_to_t (x: nat) : Pure t
(requires (fits x))
(ensures (fun y -> v y == x)) | val uint_to_t (x: nat) : Pure t
(requires (fits x))
(ensures (fun y -> v y == x)) | let uint_to_t x =
U64.uint_to_t x | {
"file_name": "ulib/FStar.SizeT.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 26,
"start_col": 0,
"start_line": 25
} | module FStar.SizeT
open FStar.Ghost
module I64 = FStar.Int64
(* This is only intended as a model, but will be extracted natively by Krml
with the correct C semantics *)
(* We assume the existence of some lower bound on the size,
where the bound is at least 2^16 *)
assume
val bound : x:erased nat { x >= pow2 16 ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Int64.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": true,
"source_file": "FS... | [
{
"abbrev": true,
"full_module": "FStar.Int64",
"short_module": "I64"
},
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Prims.nat -> Prims.Pure FStar.SizeT.t | Prims.Pure | [] | [] | [
"Prims.nat",
"FStar.UInt64.uint_to_t",
"FStar.SizeT.t"
] | [] | false | false | false | false | false | let uint_to_t x =
| U64.uint_to_t x | false |
Hacl.Impl.Frodo.Sample.fst | Hacl.Impl.Frodo.Sample.frodo_sample_matrix | val frodo_sample_matrix (a: FP.frodo_alg) : frodo_sample_matrix_st a | val frodo_sample_matrix (a: FP.frodo_alg) : frodo_sample_matrix_st a | let frodo_sample_matrix (a:FP.frodo_alg) : frodo_sample_matrix_st a =
match a with
| FP.Frodo64 -> frodo_sample_matrix64
| FP.Frodo640 -> frodo_sample_matrix640
| FP.Frodo976 -> frodo_sample_matrix976
| FP.Frodo1344 -> frodo_sample_matrix1344 | {
"file_name": "code/frodo/Hacl.Impl.Frodo.Sample.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 43,
"end_line": 178,
"start_col": 0,
"start_line": 173
} | module Hacl.Impl.Frodo.Sample
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Hacl.Impl.Matrix
open Hacl.Impl.Frodo.Params
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
module Lemmas = Spec.Frod... | {
"checked_file": "/",
"dependencies": [
"Spec.Frodo.Sample.fst.checked",
"Spec.Frodo.Params.fst.checked",
"Spec.Frodo.Lemmas.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.Loops.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Frodo.Params",
"short_module": "FP"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.Sample",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.Lemmas",
"short_module": "Lemmas"
},
{
"abbrev": true,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.Frodo.Params.frodo_alg -> Hacl.Impl.Frodo.Sample.frodo_sample_matrix_st a | Prims.Tot | [
"total"
] | [] | [
"Spec.Frodo.Params.frodo_alg",
"Hacl.Impl.Frodo.Sample.frodo_sample_matrix64",
"Hacl.Impl.Frodo.Sample.frodo_sample_matrix640",
"Hacl.Impl.Frodo.Sample.frodo_sample_matrix976",
"Hacl.Impl.Frodo.Sample.frodo_sample_matrix1344",
"Hacl.Impl.Frodo.Sample.frodo_sample_matrix_st"
] | [] | false | false | false | false | false | let frodo_sample_matrix (a: FP.frodo_alg) : frodo_sample_matrix_st a =
| match a with
| FP.Frodo64 -> frodo_sample_matrix64
| FP.Frodo640 -> frodo_sample_matrix640
| FP.Frodo976 -> frodo_sample_matrix976
| FP.Frodo1344 -> frodo_sample_matrix1344 | false |
FStar.SizeT.fst | FStar.SizeT.fits_u64 | val fits_u64 : prop | val fits_u64 : prop | let fits_u64 = (reveal bound == pow2 64) | {
"file_name": "ulib/FStar.SizeT.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 40,
"end_line": 36,
"start_col": 0,
"start_line": 36
} | module FStar.SizeT
open FStar.Ghost
module I64 = FStar.Int64
(* This is only intended as a model, but will be extracted natively by Krml
with the correct C semantics *)
(* We assume the existence of some lower bound on the size,
where the bound is at least 2^16 *)
assume
val bound : x:erased nat { x >= pow2 16 ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Int64.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": true,
"source_file": "FS... | [
{
"abbrev": true,
"full_module": "FStar.Int64",
"short_module": "I64"
},
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Prims.prop | Prims.Tot | [
"total"
] | [] | [
"Prims.eq2",
"Prims.int",
"Prims.l_or",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"Prims.op_GreaterThan",
"FStar.Ghost.reveal",
"Prims.nat",
"FStar.SizeT.bound",
"Prims.pow2"
] | [] | false | false | false | true | true | let fits_u64 =
| (reveal bound == pow2 64) | false |
Hacl.Impl.Frodo.Sample.fst | Hacl.Impl.Frodo.Sample.frodo_sample_matrix_ | val frodo_sample_matrix_:
a:FP.frodo_alg
-> frodo_sample:frodo_sample_st a
-> frodo_sample_matrix_st a | val frodo_sample_matrix_:
a:FP.frodo_alg
-> frodo_sample:frodo_sample_st a
-> frodo_sample_matrix_st a | let frodo_sample_matrix_ a frodo_sample n1 n2 r res =
memset res (u16 0) (n1 *! n2);
let h0 = ST.get () in
LSeq.eq_intro (LSeq.sub (as_seq h0 res) 0 (v n1 * v n2)) (as_seq h0 res);
[@ inline_let]
let spec h0 = S.frodo_sample_matrix1 a (v n1) (v n2) (as_seq h0 r) in
loop1 h0 n1 res spec
(fun i ->
Loop... | {
"file_name": "code/frodo/Hacl.Impl.Frodo.Sample.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 156,
"start_col": 0,
"start_line": 145
} | module Hacl.Impl.Frodo.Sample
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Hacl.Impl.Matrix
open Hacl.Impl.Frodo.Params
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module Loops = Lib.LoopCombinators
module Lemmas = Spec.Frod... | {
"checked_file": "/",
"dependencies": [
"Spec.Frodo.Sample.fst.checked",
"Spec.Frodo.Params.fst.checked",
"Spec.Frodo.Lemmas.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.Loops.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Frodo.Params",
"short_module": "FP"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.Sample",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.Lemmas",
"short_module": "Lemmas"
},
{
"abbrev": true,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.Frodo.Params.frodo_alg -> frodo_sample: Hacl.Impl.Frodo.Sample.frodo_sample_st a
-> Hacl.Impl.Frodo.Sample.frodo_sample_matrix_st a | Prims.Tot | [
"total"
] | [] | [
"Spec.Frodo.Params.frodo_alg",
"Hacl.Impl.Frodo.Sample.frodo_sample_st",
"Lib.IntTypes.size_t",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Mul.op_Star",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Prims.op_LessThanOrEqual",
"Lib.IntTypes.max_size_t",
"Hacl.Impl.Ma... | [] | false | false | false | false | false | let frodo_sample_matrix_ a frodo_sample n1 n2 r res =
| memset res (u16 0) (n1 *! n2);
let h0 = ST.get () in
LSeq.eq_intro (LSeq.sub (as_seq h0 res) 0 (v n1 * v n2)) (as_seq h0 res);
[@@ inline_let ]let spec h0 = S.frodo_sample_matrix1 a (v n1) (v n2) (as_seq h0 r) in
loop1 h0
n1
res
spec
(fun i ->
Loops.unfold_repeati (v n1) (spec h0) (as_seq h0 res) (v i);
... | false |
FStar.SizeT.fst | FStar.SizeT.of_u64 | val of_u64 (x: U64.t) : Pure t
(requires fits_u64)
(ensures (fun y -> v y == U64.v x)) | val of_u64 (x: U64.t) : Pure t
(requires fits_u64)
(ensures (fun y -> v y == U64.v x)) | let of_u64 (x: U64.t)
= uint_to_t (U64.v x) | {
"file_name": "ulib/FStar.SizeT.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 23,
"end_line": 60,
"start_col": 0,
"start_line": 59
} | module FStar.SizeT
open FStar.Ghost
module I64 = FStar.Int64
(* This is only intended as a model, but will be extracted natively by Krml
with the correct C semantics *)
(* We assume the existence of some lower bound on the size,
where the bound is at least 2^16 *)
assume
val bound : x:erased nat { x >= pow2 16 ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Int64.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": true,
"source_file": "FS... | [
{
"abbrev": true,
"full_module": "FStar.Int64",
"short_module": "I64"
},
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"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.UInt64.t -> Prims.Pure FStar.SizeT.t | Prims.Pure | [] | [] | [
"FStar.UInt64.t",
"FStar.SizeT.uint_to_t",
"FStar.UInt64.v",
"FStar.SizeT.t"
] | [] | false | false | false | false | false | let of_u64 (x: U64.t) =
| uint_to_t (U64.v x) | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.