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.X64.Print_Inline_s.fst | Vale.X64.Print_Inline_s.print_basetype | val print_basetype : t: Vale.Arch.HeapTypes_s.base_typ -> Prims.string | let print_basetype (t:base_typ) = match t with
| TUInt8 -> "uint8_t"
| TUInt16 -> "uint16_t"
| TUInt32 -> "uint32_t"
| TUInt64 -> "uint64_t"
| TUInt128 -> "ERROR" | {
"file_name": "vale/specs/hardware/Vale.X64.Print_Inline_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 23,
"end_line": 23,
"start_col": 0,
"start_line": 18
} | module Vale.X64.Print_Inline_s
open FStar.Mul
open FStar.List.Tot
open Vale.X64.Machine_s
open Vale.X64.Bytes_Code_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Instruction_s
open FStar.IO
open Vale.Interop.Base
open Vale.Interop.X64
module P = Vale.X64.Print_s
let print_rettype (ret_val:option string) = match re... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.check... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Vale.Interop.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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 | t: Vale.Arch.HeapTypes_s.base_typ -> Prims.string | Prims.Tot | [
"total"
] | [] | [
"Vale.Arch.HeapTypes_s.base_typ",
"Prims.string"
] | [] | false | false | false | true | false | let print_basetype (t: base_typ) =
| match t with
| TUInt8 -> "uint8_t"
| TUInt16 -> "uint16_t"
| TUInt32 -> "uint32_t"
| TUInt64 -> "uint64_t"
| TUInt128 -> "ERROR" | false | |
Vale.X64.Print_Inline_s.fst | Vale.X64.Print_Inline_s.print_ins | val print_ins (ins: ins) (p: P.printer) : string | val print_ins (ins: ins) (p: P.printer) : string | let print_ins (ins:ins) (p:P.printer) : string =
match ins with
| Instr _ _ (AnnotateComment s) -> " // " ^ s
| Instr _ _ (AnnotateLargeComment s) -> "\n /////// " ^ s ^ " ////// \n"
| Instr _ _ (AnnotateSpace n) -> print_spaces n
| _ -> " \"" ^ P.print_ins ins p ^ ";\"" | {
"file_name": "vale/specs/hardware/Vale.X64.Print_Inline_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 45,
"end_line": 256,
"start_col": 0,
"start_line": 251
} | module Vale.X64.Print_Inline_s
open FStar.Mul
open FStar.List.Tot
open Vale.X64.Machine_s
open Vale.X64.Bytes_Code_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Instruction_s
open FStar.IO
open Vale.Interop.Base
open Vale.Interop.X64
module P = Vale.X64.Print_s
let print_rettype (ret_val:option string) = match re... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.check... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Vale.Interop.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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 | ins: Vale.X64.Machine_Semantics_s.ins -> p: Vale.X64.Print_s.printer -> Prims.string | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Machine_Semantics_s.ins",
"Vale.X64.Print_s.printer",
"Vale.X64.Instruction_s.instr_t_record",
"Vale.X64.Instruction_s.instr_operands_t",
"Vale.X64.Instruction_s.__proj__InstrTypeRecord__item__outs",
"Vale.X64.Instruction_s.__proj__InstrTypeRecord__item__args",
"Prims.string",
"Prims.eq2",
... | [] | false | false | false | true | false | let print_ins (ins: ins) (p: P.printer) : string =
| match ins with
| Instr _ _ (AnnotateComment s) -> " // " ^ s
| Instr _ _ (AnnotateLargeComment s) -> "\n /////// " ^ s ^ " ////// \n"
| Instr _ _ (AnnotateSpace n) -> print_spaces n
| _ -> " \"" ^ P.print_ins ins p ^ ";\"" | false |
Vale.X64.Print_Inline_s.fst | Vale.X64.Print_Inline_s.build_reserved_args_outs | val build_reserved_args_outs (l: list instr_out) (reserved: (reg_64 -> bool))
: Tot (reg_64 -> bool) (decreases l) | val build_reserved_args_outs (l: list instr_out) (reserved: (reg_64 -> bool))
: Tot (reg_64 -> bool) (decreases l) | let rec build_reserved_args_outs (l:list instr_out) (reserved:reg_64 -> bool)
: Tot (reg_64 -> bool)
(decreases l) =
fun r ->
match l with
| [] -> reserved r
| hd::tl ->
let (_, op) = hd in
let reserved : (reg_64 -> bool) = (fun r ->
match op with
| IOpIm (IOp64One (OReg reg)) ->
... | {
"file_name": "vale/specs/hardware/Vale.X64.Print_Inline_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 45,
"end_line": 50,
"start_col": 0,
"start_line": 36
} | module Vale.X64.Print_Inline_s
open FStar.Mul
open FStar.List.Tot
open Vale.X64.Machine_s
open Vale.X64.Bytes_Code_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Instruction_s
open FStar.IO
open Vale.Interop.Base
open Vale.Interop.X64
module P = Vale.X64.Print_s
let print_rettype (ret_val:option string) = match re... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.check... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Vale.Interop.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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 |
l: Prims.list Vale.X64.Instruction_s.instr_out ->
reserved: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool)
-> Prims.Tot (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) | Prims.Tot | [
"total",
""
] | [] | [
"Prims.list",
"Vale.X64.Instruction_s.instr_out",
"Vale.X64.Machine_s.reg_64",
"Prims.bool",
"Vale.X64.Instruction_s.instr_operand_inout",
"Vale.X64.Instruction_s.instr_operand",
"Vale.X64.Print_Inline_s.build_reserved_args_outs",
"Prims.op_Equality"
] | [
"recursion"
] | false | false | false | false | false | let rec build_reserved_args_outs (l: list instr_out) (reserved: (reg_64 -> bool))
: Tot (reg_64 -> bool) (decreases l) =
| fun r ->
match l with
| [] -> reserved r
| hd :: tl ->
let _, op = hd in
let reserved:(reg_64 -> bool) =
(fun r ->
match op with
| IOpIm (IOp64One (OReg reg)) -> if r = reg then true else reserved r
| _ -> reserved r)
in
build_reserved_args_outs tl reserved r | false |
Steel.Effect.Atomic.fst | Steel.Effect.Atomic.elim_vdep | val elim_vdep (#opened:inames)
(v: vprop)
(p: (t_of v -> Tot vprop))
: SteelGhost (Ghost.erased (t_of v)) opened
(vdep v p)
(fun res -> v `star` p (Ghost.reveal res))
(requires (fun _ -> True))
(ensures (fun h res h' ->
let fs = h' v in
let sn : t_of (p (Ghost.reveal res)) = h' (p (Ghost.reveal ... | val elim_vdep (#opened:inames)
(v: vprop)
(p: (t_of v -> Tot vprop))
: SteelGhost (Ghost.erased (t_of v)) opened
(vdep v p)
(fun res -> v `star` p (Ghost.reveal res))
(requires (fun _ -> True))
(ensures (fun h res h' ->
let fs = h' v in
let sn : t_of (p (Ghost.reveal res)) = h' (p (Ghost.reveal ... | let elim_vdep
v p
= let r = gget (vdep v p) in
let res = Ghost.hide (dfst #(t_of v) #(vdep_payload v p) (Ghost.reveal r)) in
elim_vdep0 v p (p (Ghost.reveal res));
res | {
"file_name": "lib/steel/Steel.Effect.Atomic.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 5,
"end_line": 840,
"start_col": 0,
"start_line": 835
} | (*
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.Semantics.Hoare.MST.fst.checked",
"Steel.Memory.fsti.checked",
"Steel.Effect.fst.checked",
"Steel.Effect.fst.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.NMSTTotal.fst.che... | [
{
"abbrev": true,
"full_module": "FStar.Universe",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "Steel.Memory",
"short_module": "Mem"
},
{
"abbrev": true,
"full_module": "Steel... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | v: Steel.Effect.Common.vprop -> p: (_: Steel.Effect.Common.t_of v -> Steel.Effect.Common.vprop)
-> Steel.Effect.Atomic.SteelGhost (FStar.Ghost.erased (Steel.Effect.Common.t_of v)) | Steel.Effect.Atomic.SteelGhost | [] | [] | [
"Steel.Memory.inames",
"Steel.Effect.Common.vprop",
"Steel.Effect.Common.t_of",
"FStar.Ghost.erased",
"Prims.unit",
"Steel.Effect.Atomic.elim_vdep0",
"FStar.Ghost.reveal",
"FStar.Ghost.hide",
"FStar.Pervasives.dfst",
"Steel.Effect.Common.vdep_payload",
"Steel.Effect.Common.vdep",
"Steel.Effect... | [] | false | true | false | false | false | let elim_vdep v p =
| let r = gget (vdep v p) in
let res = Ghost.hide (dfst #(t_of v) #(vdep_payload v p) (Ghost.reveal r)) in
elim_vdep0 v p (p (Ghost.reveal res));
res | false |
Vale.X64.Print_Inline_s.fst | Vale.X64.Print_Inline_s.build_reserved_args_ins | val build_reserved_args_ins (l: list instr_operand) (reserved: (reg_64 -> bool))
: Tot (reg_64 -> bool) (decreases l) | val build_reserved_args_ins (l: list instr_operand) (reserved: (reg_64 -> bool))
: Tot (reg_64 -> bool) (decreases l) | let rec build_reserved_args_ins (l:list instr_operand) (reserved:reg_64 -> bool)
: Tot (reg_64 -> bool)
(decreases l) =
fun r ->
match l with
| [] -> reserved r
| hd::tl ->
let reserved : (reg_64 -> bool) = (fun r ->
match hd with
| IOpIm (IOp64One (OReg reg)) ->
// Implicit regist... | {
"file_name": "vale/specs/hardware/Vale.X64.Print_Inline_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 44,
"end_line": 65,
"start_col": 0,
"start_line": 52
} | module Vale.X64.Print_Inline_s
open FStar.Mul
open FStar.List.Tot
open Vale.X64.Machine_s
open Vale.X64.Bytes_Code_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Instruction_s
open FStar.IO
open Vale.Interop.Base
open Vale.Interop.X64
module P = Vale.X64.Print_s
let print_rettype (ret_val:option string) = match re... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.check... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Vale.Interop.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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 |
l: Prims.list Vale.X64.Instruction_s.instr_operand ->
reserved: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool)
-> Prims.Tot (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) | Prims.Tot | [
"total",
""
] | [] | [
"Prims.list",
"Vale.X64.Instruction_s.instr_operand",
"Vale.X64.Machine_s.reg_64",
"Prims.bool",
"Vale.X64.Print_Inline_s.build_reserved_args_ins",
"Prims.op_Equality"
] | [
"recursion"
] | false | false | false | false | false | let rec build_reserved_args_ins (l: list instr_operand) (reserved: (reg_64 -> bool))
: Tot (reg_64 -> bool) (decreases l) =
| fun r ->
match l with
| [] -> reserved r
| hd :: tl ->
let reserved:(reg_64 -> bool) =
(fun r ->
match hd with
| IOpIm (IOp64One (OReg reg)) -> if r = reg then true else reserved r
| _ -> reserved r)
in
build_reserved_args_ins tl reserved r | false |
Vale.X64.Print_Inline_s.fst | Vale.X64.Print_Inline_s.print_modified_input | val print_modified_input
(n: nat)
(a: td)
(i: nat{i < n})
(of_arg: (reg_nat n -> reg_64))
(regs_mod reserved_regs: (reg_64 -> bool))
(reg_names: (reg_64 -> string))
(counter: nat)
(arg_names: (nat -> string))
: list string & (reg_64 -> string) & nat | val print_modified_input
(n: nat)
(a: td)
(i: nat{i < n})
(of_arg: (reg_nat n -> reg_64))
(regs_mod reserved_regs: (reg_64 -> bool))
(reg_names: (reg_64 -> string))
(counter: nat)
(arg_names: (nat -> string))
: list string & (reg_64 -> string) & nat | let print_modified_input
(n:nat) (a:td) (i:nat{i < n}) (of_arg:reg_nat n -> reg_64) (regs_mod:reg_64 -> bool) (reserved_regs:reg_64 -> bool)
(reg_names:reg_64 -> string) (counter:nat) (arg_names:nat -> string) : list string & (reg_64 -> string) & nat =
if regs_mod (of_arg i) then
(["\"+&r\" (" ^ arg_names i ... | {
"file_name": "vale/specs/hardware/Vale.X64.Print_Inline_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 36,
"end_line": 117,
"start_col": 0,
"start_line": 110
} | module Vale.X64.Print_Inline_s
open FStar.Mul
open FStar.List.Tot
open Vale.X64.Machine_s
open Vale.X64.Bytes_Code_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Instruction_s
open FStar.IO
open Vale.Interop.Base
open Vale.Interop.X64
module P = Vale.X64.Print_s
let print_rettype (ret_val:option string) = match re... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.check... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Vale.Interop.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
n: Prims.nat ->
a: Vale.Interop.Base.td ->
i: Prims.nat{i < n} ->
of_arg: (_: Vale.Interop.X64.reg_nat n -> Vale.X64.Machine_s.reg_64) ->
regs_mod: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
reserved_regs: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
reg_names: (_: Vale.X64.Machine_... | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Vale.Interop.Base.td",
"Prims.b2t",
"Prims.op_LessThan",
"Vale.Interop.X64.reg_nat",
"Vale.X64.Machine_s.reg_64",
"Prims.bool",
"Prims.string",
"FStar.Pervasives.Native.Mktuple3",
"Prims.list",
"Prims.Cons",
"Prims.op_Hat",
"Prims.Nil",
"Prims.op_AmpAmp",
"Prims.op_Equality... | [] | false | false | false | false | false | let print_modified_input
(n: nat)
(a: td)
(i: nat{i < n})
(of_arg: (reg_nat n -> reg_64))
(regs_mod reserved_regs: (reg_64 -> bool))
(reg_names: (reg_64 -> string))
(counter: nat)
(arg_names: (nat -> string))
: list string & (reg_64 -> string) & nat =
| if regs_mod (of_arg i)
then
(["\"+&r\" (" ^ arg_names i ^ (if reserved_regs (of_arg i) then "_r)" else ")")],
(fun r -> if r = of_arg i && not (reserved_regs r) then string_of_int counter else reg_names r),
counter + 1)
else ([], reg_names, counter) | false |
Vale.X64.Print_Inline_s.fst | Vale.X64.Print_Inline_s.print_nonmodified_input | val print_nonmodified_input
(n: nat)
(of_arg: (reg_nat n -> reg_64))
(regs_mod reserved_regs: (reg_64 -> bool))
(a: td)
(i: nat{i < n})
(reg_names: (reg_64 -> string))
(counter: nat)
(arg_names: (nat -> string))
: list string & (reg_64 -> string) & nat | val print_nonmodified_input
(n: nat)
(of_arg: (reg_nat n -> reg_64))
(regs_mod reserved_regs: (reg_64 -> bool))
(a: td)
(i: nat{i < n})
(reg_names: (reg_64 -> string))
(counter: nat)
(arg_names: (nat -> string))
: list string & (reg_64 -> string) & nat | let print_nonmodified_input
(n:nat) (of_arg:reg_nat n -> reg_64) (regs_mod:reg_64 -> bool) (reserved_regs:reg_64 -> bool)
(a:td) (i:nat{i < n}) (reg_names:reg_64 -> string) (counter:nat) (arg_names:nat -> string) : list string & (reg_64 -> string) & nat =
if regs_mod (of_arg i) then ([], reg_names, counter) else... | {
"file_name": "vale/specs/hardware/Vale.X64.Print_Inline_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 17,
"end_line": 157,
"start_col": 0,
"start_line": 151
} | module Vale.X64.Print_Inline_s
open FStar.Mul
open FStar.List.Tot
open Vale.X64.Machine_s
open Vale.X64.Bytes_Code_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Instruction_s
open FStar.IO
open Vale.Interop.Base
open Vale.Interop.X64
module P = Vale.X64.Print_s
let print_rettype (ret_val:option string) = match re... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.check... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Vale.Interop.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
n: Prims.nat ->
of_arg: (_: Vale.Interop.X64.reg_nat n -> Vale.X64.Machine_s.reg_64) ->
regs_mod: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
reserved_regs: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
a: Vale.Interop.Base.td ->
i: Prims.nat{i < n} ->
reg_names: (_: Vale.X64.Machine_... | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Vale.Interop.X64.reg_nat",
"Vale.X64.Machine_s.reg_64",
"Prims.bool",
"Vale.Interop.Base.td",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.string",
"FStar.Pervasives.Native.Mktuple3",
"Prims.list",
"Prims.Nil",
"Prims.Cons",
"Prims.op_Hat",
"Prims.op_AmpAmp",
"Prims.op_Equality... | [] | false | false | false | false | false | let print_nonmodified_input
(n: nat)
(of_arg: (reg_nat n -> reg_64))
(regs_mod reserved_regs: (reg_64 -> bool))
(a: td)
(i: nat{i < n})
(reg_names: (reg_64 -> string))
(counter: nat)
(arg_names: (nat -> string))
: list string & (reg_64 -> string) & nat =
| if regs_mod (of_arg i)
then ([], reg_names, counter)
else
(["\"r\" (" ^ arg_names i ^ (if reserved_regs (of_arg i) then "_r)" else ")")],
(fun r -> if r = of_arg i && not (reserved_regs r) then string_of_int counter else reg_names r),
counter + 1) | false |
Vale.X64.Print_Inline_s.fst | Vale.X64.Print_Inline_s.print_modified_inputs | val print_modified_inputs : n: Prims.nat ->
of_arg: (_: Vale.Interop.X64.reg_nat n -> Vale.X64.Machine_s.reg_64) ->
regs_mod: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
reserved_regs: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
args: Prims.list Vale.Interop.Base.td {FStar.List.Tot.Base.length a... | let print_modified_inputs
(n:nat)
(of_arg:reg_nat n -> reg_64)
(regs_mod:reg_64 -> bool)
(reserved_regs:reg_64 -> bool)
(args:list td{List.Tot.length args <= n})
(ret_val:option string)
(reg_names:reg_64 -> string)
(counter:nat)
(arg_names:nat -> string) =
let rec aux = function
| [] -> "\n"
| [... | {
"file_name": "vale/specs/hardware/Vale.X64.Print_Inline_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 43,
"end_line": 148,
"start_col": 0,
"start_line": 132
} | module Vale.X64.Print_Inline_s
open FStar.Mul
open FStar.List.Tot
open Vale.X64.Machine_s
open Vale.X64.Bytes_Code_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Instruction_s
open FStar.IO
open Vale.Interop.Base
open Vale.Interop.X64
module P = Vale.X64.Print_s
let print_rettype (ret_val:option string) = match re... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.check... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Vale.Interop.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
n: Prims.nat ->
of_arg: (_: Vale.Interop.X64.reg_nat n -> Vale.X64.Machine_s.reg_64) ->
regs_mod: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
reserved_regs: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
args: Prims.list Vale.Interop.Base.td {FStar.List.Tot.Base.length args <= n} ->
ret_va... | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Vale.Interop.X64.reg_nat",
"Vale.X64.Machine_s.reg_64",
"Prims.bool",
"Prims.list",
"Vale.Interop.Base.td",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.List.Tot.Base.length",
"FStar.Pervasives.Native.option",
"Prims.string",
"FStar.Pervasives.Native.Mktuple3",
"FStar.Pervas... | [] | false | false | false | false | false | let print_modified_inputs
(n: nat)
(of_arg: (reg_nat n -> reg_64))
(regs_mod reserved_regs: (reg_64 -> bool))
(args: list td {List.Tot.length args <= n})
(ret_val: option string)
(reg_names: (reg_64 -> string))
(counter: nat)
(arg_names: (nat -> string))
=
| let rec aux =
function
| [] -> "\n"
| [a] -> a ^ "\n"
| a :: q -> a ^ ", " ^ aux q
in
let outputs, output_reg_names, output_nbr =
get_modified_input_strings n of_arg regs_mod reserved_regs args 0 ret_val reg_names counter
arg_names
in
aux outputs, output_reg_names, output_nbr | false | |
Vale.X64.Print_Inline_s.fst | Vale.X64.Print_Inline_s.build_reserved_args_block | val build_reserved_args_block (l: list code) (reserved: (reg_64 -> bool))
: Tot (reg_64 -> bool) (decreases l) | val build_reserved_args_block (l: list code) (reserved: (reg_64 -> bool))
: Tot (reg_64 -> bool) (decreases l) | let rec build_reserved_args (c:code) (reserved:reg_64 -> bool)
: Tot (reg_64 -> bool)
(decreases c) =
fun r ->
(match c with
| Ins ins -> begin
match ins with
| Instr i _ _ ->
let reserved = build_reserved_args_outs i.outs reserved in
let reserved = build_reserved_args_ins (I... | {
"file_name": "vale/specs/hardware/Vale.X64.Print_Inline_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 98,
"start_col": 0,
"start_line": 69
} | module Vale.X64.Print_Inline_s
open FStar.Mul
open FStar.List.Tot
open Vale.X64.Machine_s
open Vale.X64.Bytes_Code_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Instruction_s
open FStar.IO
open Vale.Interop.Base
open Vale.Interop.X64
module P = Vale.X64.Print_s
let print_rettype (ret_val:option string) = match re... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.check... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Vale.Interop.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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 |
l: Prims.list Vale.X64.Machine_Semantics_s.code ->
reserved: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool)
-> Prims.Tot (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) | Prims.Tot | [
"total",
""
] | [
"build_reserved_args",
"build_reserved_args_block"
] | [
"Prims.list",
"Vale.X64.Machine_Semantics_s.code",
"Vale.X64.Machine_s.reg_64",
"Prims.bool",
"Vale.X64.Print_Inline_s.build_reserved_args_block",
"Vale.X64.Print_Inline_s.build_reserved_args"
] | [
"mutual recursion"
] | false | false | false | false | false | let rec build_reserved_args_block (l: list code) (reserved: (reg_64 -> bool))
: Tot (reg_64 -> bool) (decreases l) =
| fun r ->
(match l with
| [] -> reserved r
| hd :: tl ->
let reserved = build_reserved_args hd reserved in
build_reserved_args_block tl reserved r) | false |
Vale.X64.Print_Inline_s.fst | Vale.X64.Print_Inline_s.get_modified_input_strings | val get_modified_input_strings
(n: nat)
(of_arg: (reg_nat n -> reg_64))
(regs_mod reserved_regs: (reg_64 -> bool))
(args: list td)
(i: nat{i + List.Tot.length args <= n})
(ret_val: option string)
(reg_names: (reg_64 -> string))
(counter: nat)
(arg_names: (nat -> str... | val get_modified_input_strings
(n: nat)
(of_arg: (reg_nat n -> reg_64))
(regs_mod reserved_regs: (reg_64 -> bool))
(args: list td)
(i: nat{i + List.Tot.length args <= n})
(ret_val: option string)
(reg_names: (reg_64 -> string))
(counter: nat)
(arg_names: (nat -> str... | let rec get_modified_input_strings
(n:nat) (of_arg:reg_nat n -> reg_64) (regs_mod:reg_64 -> bool) (reserved_regs:reg_64 -> bool)
(args:list td) (i:nat{i + List.Tot.length args <= n}) (ret_val:option string)
(reg_names:reg_64 -> string) (counter:nat) (arg_names:nat -> string) : list string & (reg_64 -> string) & n... | {
"file_name": "vale/specs/hardware/Vale.X64.Print_Inline_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 42,
"end_line": 129,
"start_col": 0,
"start_line": 120
} | module Vale.X64.Print_Inline_s
open FStar.Mul
open FStar.List.Tot
open Vale.X64.Machine_s
open Vale.X64.Bytes_Code_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Instruction_s
open FStar.IO
open Vale.Interop.Base
open Vale.Interop.X64
module P = Vale.X64.Print_s
let print_rettype (ret_val:option string) = match re... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.check... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Vale.Interop.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
n: Prims.nat ->
of_arg: (_: Vale.Interop.X64.reg_nat n -> Vale.X64.Machine_s.reg_64) ->
regs_mod: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
reserved_regs: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
args: Prims.list Vale.Interop.Base.td ->
i: Prims.nat{i + FStar.List.Tot.Base.length a... | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Vale.Interop.X64.reg_nat",
"Vale.X64.Machine_s.reg_64",
"Prims.bool",
"Prims.list",
"Vale.Interop.Base.td",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"FStar.List.Tot.Base.length",
"FStar.Pervasives.Native.option",
"Prims.string",
"Vale.X64.Print_Inline_s.pri... | [
"recursion"
] | false | false | false | false | false | let rec get_modified_input_strings
(n: nat)
(of_arg: (reg_nat n -> reg_64))
(regs_mod reserved_regs: (reg_64 -> bool))
(args: list td)
(i: nat{i + List.Tot.length args <= n})
(ret_val: option string)
(reg_names: (reg_64 -> string))
(counter: nat)
(arg_names: (nat ->... | match args with
| [] -> print_output_ret ret_val reg_names counter
| a :: q ->
let output, reg_names, counter =
print_modified_input n a i of_arg regs_mod reserved_regs reg_names counter arg_names
in
let outputs, reg_names, counter =
get_modified_input_strings n of_arg regs_mod reserved_regs q (i + 1) ret... | false |
Vale.X64.Print_Inline_s.fst | Vale.X64.Print_Inline_s.build_reserved_args | val build_reserved_args (c: code) (reserved: (reg_64 -> bool)) : Tot (reg_64 -> bool) (decreases c) | val build_reserved_args (c: code) (reserved: (reg_64 -> bool)) : Tot (reg_64 -> bool) (decreases c) | let rec build_reserved_args (c:code) (reserved:reg_64 -> bool)
: Tot (reg_64 -> bool)
(decreases c) =
fun r ->
(match c with
| Ins ins -> begin
match ins with
| Instr i _ _ ->
let reserved = build_reserved_args_outs i.outs reserved in
let reserved = build_reserved_args_ins (I... | {
"file_name": "vale/specs/hardware/Vale.X64.Print_Inline_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 98,
"start_col": 0,
"start_line": 69
} | module Vale.X64.Print_Inline_s
open FStar.Mul
open FStar.List.Tot
open Vale.X64.Machine_s
open Vale.X64.Bytes_Code_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Instruction_s
open FStar.IO
open Vale.Interop.Base
open Vale.Interop.X64
module P = Vale.X64.Print_s
let print_rettype (ret_val:option string) = match re... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.check... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Vale.Interop.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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 | c: Vale.X64.Machine_Semantics_s.code -> reserved: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool)
-> Prims.Tot (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) | Prims.Tot | [
"total",
""
] | [
"build_reserved_args",
"build_reserved_args_block"
] | [
"Vale.X64.Machine_Semantics_s.code",
"Vale.X64.Machine_s.reg_64",
"Prims.bool",
"Vale.X64.Bytes_Code_s.instruction_t",
"Vale.X64.Machine_Semantics_s.instr_annotation",
"Vale.X64.Instruction_s.instr_t_record",
"Vale.X64.Instruction_s.instr_operands_t",
"Vale.X64.Instruction_s.__proj__InstrTypeRecord__i... | [
"mutual recursion"
] | false | false | false | false | false | let rec build_reserved_args (c: code) (reserved: (reg_64 -> bool))
: Tot (reg_64 -> bool) (decreases c) =
| fun r ->
(match c with
| Ins ins ->
(match ins with
| Instr i _ _ ->
let reserved = build_reserved_args_outs i.outs reserved in
let reserved = build_reserved_args_ins (InstrTypeRecord?.args i) reserved in
reserved r
| _ -> reserved r)
| Block l -> (build_res... | false |
Hacl.P256.PrecompTable.fst | Hacl.P256.PrecompTable.precomp_g_pow2_64_table_list_w4 | val precomp_g_pow2_64_table_list_w4:x: list uint64 {FStar.List.Tot.length x = 192} | val precomp_g_pow2_64_table_list_w4:x: list uint64 {FStar.List.Tot.length x = 192} | let precomp_g_pow2_64_table_list_w4: x:list uint64{FStar.List.Tot.length x = 192} =
normalize_term (SPT.precomp_base_table_list mk_p256_precomp_base_table proj_g_pow2_64 15) | {
"file_name": "code/ecdsap256/Hacl.P256.PrecompTable.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 91,
"end_line": 220,
"start_col": 0,
"start_line": 219
} | module Hacl.P256.PrecompTable
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module SPT = Hacl.Spec.PrecompBaseTable
module SPT256 = Hacl.Spec.Pr... | {
"checked_file": "/",
"dependencies": [
"Spec.P256.Lemmas.fsti.checked",
"Spec.P256.fst.checked",
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hac... | [
{
"abbrev": false,
"full_module": "Hacl.Impl.P256.Group",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.P256.Point",
"short_module": null
},
{
"abbrev": true,
"full_module": "Spec.P256.Lemmas",
"short_module": "SL"
},
{
"abbrev": true,
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x:
Prims.list (Lib.IntTypes.int_t Lib.IntTypes.U64 Lib.IntTypes.SEC)
{FStar.List.Tot.Base.length x = 192} | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.normalize_term",
"Prims.list",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U64",
"Lib.IntTypes.SEC",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"FStar.List.Tot.Base.length",
"Hacl.Spec.PrecompBaseTable.precomp_base_table_list",
"Spec.P256.PointOps.proj_point",
"FStar.UInt32.uint_... | [] | false | false | false | false | false | let precomp_g_pow2_64_table_list_w4:x: list uint64 {FStar.List.Tot.length x = 192} =
| normalize_term (SPT.precomp_base_table_list mk_p256_precomp_base_table proj_g_pow2_64 15) | false |
Vale.X64.Print_Inline_s.fst | Vale.X64.Print_Inline_s.print_spaces | val print_spaces (n: nat) : string | val print_spaces (n: nat) : string | let rec print_spaces (n:nat) : string =
match n with
| 0 -> ""
| n -> " " ^ print_spaces (n-1) | {
"file_name": "vale/specs/hardware/Vale.X64.Print_Inline_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 33,
"end_line": 248,
"start_col": 0,
"start_line": 245
} | module Vale.X64.Print_Inline_s
open FStar.Mul
open FStar.List.Tot
open Vale.X64.Machine_s
open Vale.X64.Bytes_Code_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Instruction_s
open FStar.IO
open Vale.Interop.Base
open Vale.Interop.X64
module P = Vale.X64.Print_s
let print_rettype (ret_val:option string) = match re... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.check... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Vale.Interop.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | n: Prims.nat -> Prims.string | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.int",
"Prims.op_Hat",
"Vale.X64.Print_Inline_s.print_spaces",
"Prims.op_Subtraction",
"Prims.string"
] | [
"recursion"
] | false | false | false | true | false | let rec print_spaces (n: nat) : string =
| match n with
| 0 -> ""
| n -> " " ^ print_spaces (n - 1) | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.max | val max : x: Prims.int -> y: Prims.int -> z: Prims.int{(x >= y ==> z = x) /\ (x < y ==> z = y)} | let max = FStar.Math.Lib.max | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 35,
"end_line": 6,
"start_col": 7,
"start_line": 6
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 | x: Prims.int -> y: Prims.int -> z: Prims.int{(x >= y ==> z = x) /\ (x < y ==> z = y)} | Prims.Tot | [
"total"
] | [] | [
"FStar.Math.Lib.max"
] | [] | false | false | false | false | false | let max =
| FStar.Math.Lib.max | false | |
Vale.X64.Print_Inline_s.fst | Vale.X64.Print_Inline_s.get_nonmodified_input_strings | val get_nonmodified_input_strings : n: Prims.nat ->
of_arg: (_: Vale.Interop.X64.reg_nat n -> Vale.X64.Machine_s.reg_64) ->
regs_mod: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
reserved_regs: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
args: Prims.list Vale.Interop.Base.td ->
i: Prims.nat{F... | let rec get_nonmodified_input_strings
(n:nat) (of_arg:reg_nat n -> reg_64) (regs_mod:reg_64 -> bool) (reserved_regs:reg_64 -> bool)
(args:list td) (i:nat{List.Tot.length args + i <= n}) (reg_names:reg_64 -> string) (counter:nat) (arg_names:nat -> string)
= match args with
| [] -> [], reg_names, counter
| a::q... | {
"file_name": "vale/specs/hardware/Vale.X64.Print_Inline_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 38,
"end_line": 168,
"start_col": 0,
"start_line": 160
} | module Vale.X64.Print_Inline_s
open FStar.Mul
open FStar.List.Tot
open Vale.X64.Machine_s
open Vale.X64.Bytes_Code_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Instruction_s
open FStar.IO
open Vale.Interop.Base
open Vale.Interop.X64
module P = Vale.X64.Print_s
let print_rettype (ret_val:option string) = match re... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.check... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Vale.Interop.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
n: Prims.nat ->
of_arg: (_: Vale.Interop.X64.reg_nat n -> Vale.X64.Machine_s.reg_64) ->
regs_mod: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
reserved_regs: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
args: Prims.list Vale.Interop.Base.td ->
i: Prims.nat{FStar.List.Tot.Base.length args ... | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Vale.Interop.X64.reg_nat",
"Vale.X64.Machine_s.reg_64",
"Prims.bool",
"Prims.list",
"Vale.Interop.Base.td",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"FStar.List.Tot.Base.length",
"Prims.string",
"FStar.Pervasives.Native.Mktuple3",
"Prims.Nil",
"FStar.List... | [
"recursion"
] | false | false | false | false | false | let rec get_nonmodified_input_strings
(n: nat)
(of_arg: (reg_nat n -> reg_64))
(regs_mod reserved_regs: (reg_64 -> bool))
(args: list td)
(i: nat{List.Tot.length args + i <= n})
(reg_names: (reg_64 -> string))
(counter: nat)
(arg_names: (nat -> string))
=
| match args with
| [] -> [], reg_names, counter
| a :: q ->
let input, reg_names, counter =
print_nonmodified_input n of_arg regs_mod reserved_regs a i reg_names counter arg_names
in
let inputs, reg_names, counter =
get_nonmodified_input_strings n
of_arg
regs_mod
reserved_regs
q
... | false | |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.poly_equal | val poly_equal (a b: poly) : prop0 | val poly_equal (a b: poly) : prop0 | let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i]) | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 59,
"end_line": 11,
"start_col": 0,
"start_line": 10
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10" | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 | a: Vale.Math.Poly2.Defs_s.poly -> b: Vale.Math.Poly2.Defs_s.poly -> Vale.Def.Prop_s.prop0 | Prims.Tot | [
"total"
] | [] | [
"Vale.Math.Poly2.Defs_s.poly",
"Prims.l_Forall",
"Prims.nat",
"Prims.eq2",
"Prims.bool",
"Vale.Math.Poly2.Defs_s.op_String_Access",
"Vale.Def.Prop_s.prop0"
] | [] | false | false | false | true | false | let poly_equal (a b: poly) : prop0 =
| (forall (i: nat). {:pattern a.[ i ]\/b.[ i ]} a.[ i ] == b.[ i ]) | false |
Vale.X64.Print_Inline_s.fst | Vale.X64.Print_Inline_s.print_register_ret | val print_register_ret : reserved: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
_: FStar.Pervasives.Native.option Prims.string
-> Prims.string | let print_register_ret (reserved:reg_64 -> bool) = function
| None -> ""
| Some name -> if reserved rRax then " register uint64_t " ^ name ^ " __asm__(\"rax\");\n" else " uint64_t " ^ name ^ ";\n" | {
"file_name": "vale/specs/hardware/Vale.X64.Print_Inline_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 127,
"end_line": 228,
"start_col": 0,
"start_line": 226
} | module Vale.X64.Print_Inline_s
open FStar.Mul
open FStar.List.Tot
open Vale.X64.Machine_s
open Vale.X64.Bytes_Code_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Instruction_s
open FStar.IO
open Vale.Interop.Base
open Vale.Interop.X64
module P = Vale.X64.Print_s
let print_rettype (ret_val:option string) = match re... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.check... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Vale.Interop.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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 |
reserved: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
_: FStar.Pervasives.Native.option Prims.string
-> Prims.string | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Machine_s.reg_64",
"Prims.bool",
"FStar.Pervasives.Native.option",
"Prims.string",
"Vale.X64.Machine_s.rRax",
"Prims.op_Hat"
] | [] | false | false | false | true | false | let print_register_ret (reserved: (reg_64 -> bool)) =
| function
| None -> ""
| Some name ->
if reserved rRax
then " register uint64_t " ^ name ^ " __asm__(\"rax\");\n"
else " uint64_t " ^ name ^ ";\n" | false | |
Vale.X64.Print_Inline_s.fst | Vale.X64.Print_Inline_s.print_nonmodified_inputs | val print_nonmodified_inputs : n: Prims.nat ->
of_arg: (_: Vale.Interop.X64.reg_nat n -> Vale.X64.Machine_s.reg_64) ->
regs_mod: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
reserved_regs: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
args: Prims.list Vale.Interop.Base.td {FStar.List.Tot.Base.lengt... | let print_nonmodified_inputs
(n:nat) (of_arg:reg_nat n -> reg_64) (regs_mod:reg_64 -> bool) (reserved_regs:reg_64 -> bool)
(args:list td{List.Tot.length args <= n}) (reg_names:reg_64 -> string) (counter:nat) (arg_names:nat -> string) =
let rec aux = function
| [] -> "\n"
| [a] -> a ^ "\n"
| a :: q -> a ^ ",... | {
"file_name": "vale/specs/hardware/Vale.X64.Print_Inline_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 38,
"end_line": 179,
"start_col": 0,
"start_line": 170
} | module Vale.X64.Print_Inline_s
open FStar.Mul
open FStar.List.Tot
open Vale.X64.Machine_s
open Vale.X64.Bytes_Code_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Instruction_s
open FStar.IO
open Vale.Interop.Base
open Vale.Interop.X64
module P = Vale.X64.Print_s
let print_rettype (ret_val:option string) = match re... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.check... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Vale.Interop.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
n: Prims.nat ->
of_arg: (_: Vale.Interop.X64.reg_nat n -> Vale.X64.Machine_s.reg_64) ->
regs_mod: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
reserved_regs: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
args: Prims.list Vale.Interop.Base.td {FStar.List.Tot.Base.length args <= n} ->
reg_na... | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Vale.Interop.X64.reg_nat",
"Vale.X64.Machine_s.reg_64",
"Prims.bool",
"Prims.list",
"Vale.Interop.Base.td",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.List.Tot.Base.length",
"Prims.string",
"FStar.Pervasives.Native.Mktuple3",
"FStar.Pervasives.Native.tuple3",
"Vale.X64.Pri... | [] | false | false | false | false | false | let print_nonmodified_inputs
(n: nat)
(of_arg: (reg_nat n -> reg_64))
(regs_mod reserved_regs: (reg_64 -> bool))
(args: list td {List.Tot.length args <= n})
(reg_names: (reg_64 -> string))
(counter: nat)
(arg_names: (nat -> string))
=
| let rec aux =
function
| [] -> "\n"
| [a] -> a ^ "\n"
| a :: q -> a ^ ", " ^ aux q
in
let inputs, input_reg_names, counter =
get_nonmodified_input_strings n of_arg regs_mod reserved_regs args 0 reg_names counter arg_names
in
aux inputs, input_reg_names, counter | false | |
Vale.X64.Print_Inline_s.fst | Vale.X64.Print_Inline_s.print_explicit_register_args | val print_explicit_register_args : n: Prims.nat ->
args: Prims.list Vale.Interop.Base.td ->
i: Prims.nat{i + FStar.List.Tot.Base.length args = n} ->
of_arg: (_: Vale.Interop.X64.reg_nat n -> Vale.X64.Machine_s.reg_64) ->
reserved: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
names: (_: Prims.nat ... | let rec print_explicit_register_args (n:nat) (args:list td) (i:nat{i + List.length args = n}) (of_arg:reg_nat n -> reg_64) (reserved:reg_64 -> bool) (names:nat -> string) =
match args with
| [] -> false, ""
| a::q ->
let was_explicit, explicit_str = print_explicit_register_arg n a i of_arg reserved names in
... | {
"file_name": "vale/specs/hardware/Vale.X64.Print_Inline_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 57,
"end_line": 223,
"start_col": 0,
"start_line": 217
} | module Vale.X64.Print_Inline_s
open FStar.Mul
open FStar.List.Tot
open Vale.X64.Machine_s
open Vale.X64.Bytes_Code_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Instruction_s
open FStar.IO
open Vale.Interop.Base
open Vale.Interop.X64
module P = Vale.X64.Print_s
let print_rettype (ret_val:option string) = match re... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.check... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Vale.Interop.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
n: Prims.nat ->
args: Prims.list Vale.Interop.Base.td ->
i: Prims.nat{i + FStar.List.Tot.Base.length args = n} ->
of_arg: (_: Vale.Interop.X64.reg_nat n -> Vale.X64.Machine_s.reg_64) ->
reserved: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
names: (_: Prims.nat -> Prims.string)
-> Prims.bo... | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.list",
"Vale.Interop.Base.td",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Addition",
"FStar.List.Tot.Base.length",
"Vale.Interop.X64.reg_nat",
"Vale.X64.Machine_s.reg_64",
"Prims.bool",
"Prims.string",
"FStar.Pervasives.Native.Mktuple2",
"Prims.op_BarBar",... | [
"recursion"
] | false | false | false | false | false | let rec print_explicit_register_args
(n: nat)
(args: list td)
(i: nat{i + List.length args = n})
(of_arg: (reg_nat n -> reg_64))
(reserved: (reg_64 -> bool))
(names: (nat -> string))
=
| match args with
| [] -> false, ""
| a :: q ->
let was_explicit, explicit_str = print_explicit_register_arg n a i of_arg reserved names in
let are_explicit, rest_str = print_explicit_register_args n q (i + 1) of_arg reserved names in
was_explicit || are_explicit, explicit_str ^ rest_str | false | |
Vale.X64.Print_Inline_s.fst | Vale.X64.Print_Inline_s.print_modified_registers | val print_modified_registers : n: Prims.nat ->
ret_val: FStar.Pervasives.Native.option Prims.string ->
of_arg: (_: Vale.Interop.X64.reg_nat n -> Vale.X64.Machine_s.reg_64) ->
regs_mod: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
reserved_args: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
args... | let print_modified_registers
(n:nat)
(ret_val:option string)
(of_arg:reg_nat n -> reg_64)
(regs_mod:reg_64 -> bool)
(reserved_args:reg_64 -> bool)
(args:list td) =
// This register was already specified as output
let output_register a = Some? ret_val && a = rRax in
let rec input_register (i:nat) (a:re... | {
"file_name": "vale/specs/hardware/Vale.X64.Print_Inline_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 103,
"end_line": 204,
"start_col": 0,
"start_line": 182
} | module Vale.X64.Print_Inline_s
open FStar.Mul
open FStar.List.Tot
open Vale.X64.Machine_s
open Vale.X64.Bytes_Code_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Instruction_s
open FStar.IO
open Vale.Interop.Base
open Vale.Interop.X64
module P = Vale.X64.Print_s
let print_rettype (ret_val:option string) = match re... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.check... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Vale.Interop.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
n: Prims.nat ->
ret_val: FStar.Pervasives.Native.option Prims.string ->
of_arg: (_: Vale.Interop.X64.reg_nat n -> Vale.X64.Machine_s.reg_64) ->
regs_mod: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
reserved_args: (_: Vale.X64.Machine_s.reg_64 -> Prims.bool) ->
args: Prims.list Vale.Interop.... | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.Pervasives.Native.option",
"Prims.string",
"Vale.Interop.X64.reg_nat",
"Vale.X64.Machine_s.reg_64",
"Prims.bool",
"Prims.list",
"Vale.Interop.Base.td",
"Prims.Cons",
"Vale.X64.Machine_s.rRax",
"Vale.X64.Machine_s.rRbx",
"Vale.X64.Machine_s.rRcx",
"Vale.X64.Machine_s.rRdx"... | [] | false | false | false | false | false | let print_modified_registers
(n: nat)
(ret_val: option string)
(of_arg: (reg_nat n -> reg_64))
(regs_mod reserved_args: (reg_64 -> bool))
(args: list td)
=
| let output_register a = Some? ret_val && a = rRax in
let rec input_register (i: nat) (a: reg_64) : Tot bool (decreases (n - i)) =
if i >= n then false else a = of_arg i || input_register (i + 1) a
in
let rec aux =
function
| [] -> "\"memory\", \"cc\"\n"
| a :: q ->
if not (regs_mod a) || input_register 0 a ... | false | |
Vale.X64.Print_Inline_s.fst | Vale.X64.Print_Inline_s.print_fn_comments | val print_fn_comments : _: Prims.list Prims.string -> Prims.string | let rec print_fn_comments = function
| [] -> ""
| hd::tl -> "// " ^ hd ^ "\n" ^ print_fn_comments tl | {
"file_name": "vale/specs/hardware/Vale.X64.Print_Inline_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 54,
"end_line": 302,
"start_col": 0,
"start_line": 300
} | module Vale.X64.Print_Inline_s
open FStar.Mul
open FStar.List.Tot
open Vale.X64.Machine_s
open Vale.X64.Bytes_Code_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Instruction_s
open FStar.IO
open Vale.Interop.Base
open Vale.Interop.X64
module P = Vale.X64.Print_s
let print_rettype (ret_val:option string) = match re... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.check... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Vale.Interop.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.list Prims.string -> Prims.string | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"Prims.string",
"Prims.op_Hat",
"Vale.X64.Print_Inline_s.print_fn_comments"
] | [
"recursion"
] | false | false | false | true | false | let rec print_fn_comments =
| function
| [] -> ""
| hd :: tl -> "// " ^ hd ^ "\n" ^ print_fn_comments tl | false | |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_pointwise_equal | val lemma_pointwise_equal (a b: poly) (pf: (i: int -> Lemma (a.[ i ] == b.[ i ]))) : Lemma (a == b) | val lemma_pointwise_equal (a b: poly) (pf: (i: int -> Lemma (a.[ i ] == b.[ i ]))) : Lemma (a == b) | let lemma_pointwise_equal (a b:poly) (pf:(i:int -> Lemma (a.[i] == b.[i]))) : Lemma (a == b) =
FStar.Classical.forall_intro pf;
lemma_poly_equal_elim a b | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 27,
"end_line": 33,
"start_col": 0,
"start_line": 31
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 |
a: Vale.Math.Poly2.Defs_s.poly ->
b: Vale.Math.Poly2.Defs_s.poly ->
pf: (i: Prims.int -> FStar.Pervasives.Lemma (ensures a.[ i ] == b.[ i ]))
-> FStar.Pervasives.Lemma (ensures a == b) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Math.Poly2.Defs_s.poly",
"Prims.int",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"Prims.bool",
"Vale.Math.Poly2.Defs_s.op_String_Access",
"Prims.Nil",
"FStar.Pervasives.pattern",
"Vale.Math.Poly2.Defs.lemma_poly_equal_elim",
"FStar.Classical.forall_intro"
] | [] | false | false | true | false | false | let lemma_pointwise_equal (a b: poly) (pf: (i: int -> Lemma (a.[ i ] == b.[ i ]))) : Lemma (a == b) =
| FStar.Classical.forall_intro pf;
lemma_poly_equal_elim a b | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_sum_of_zero | val lemma_sum_of_zero (j k: int) (f: (int -> bool))
: Lemma (requires (forall (i: int). {:pattern (f i)} j <= i /\ i < k ==> not (f i)))
(ensures not (sum_of_bools j k f))
(decreases (k - j)) | val lemma_sum_of_zero (j k: int) (f: (int -> bool))
: Lemma (requires (forall (i: int). {:pattern (f i)} j <= i /\ i < k ==> not (f i)))
(ensures not (sum_of_bools j k f))
(decreases (k - j)) | let rec lemma_sum_of_zero (j k:int) (f:int -> bool) : Lemma
(requires (forall (i:int).{:pattern (f i)} j <= i /\ i < k ==> not (f i)))
(ensures not (sum_of_bools j k f))
(decreases (k - j))
=
if j < k then lemma_sum_of_zero j (k - 1) f | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 45,
"end_line": 64,
"start_col": 0,
"start_line": 59
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 | j: Prims.int -> k: Prims.int -> f: (_: Prims.int -> Prims.bool)
-> FStar.Pervasives.Lemma
(requires forall (i: Prims.int). {:pattern f i} j <= i /\ i < k ==> Prims.op_Negation (f i))
(ensures Prims.op_Negation (Vale.Math.Poly2.Defs_s.sum_of_bools j k f))
(decreases k - j) | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.int",
"Prims.bool",
"Prims.op_LessThan",
"Vale.Math.Poly2.Defs.lemma_sum_of_zero",
"Prims.op_Subtraction",
"Prims.unit",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Negation",
"Prims.squash",
"Vale.Math.Poly2.Defs_s.sum_of_bools... | [
"recursion"
] | false | false | true | false | false | let rec lemma_sum_of_zero (j k: int) (f: (int -> bool))
: Lemma (requires (forall (i: int). {:pattern (f i)} j <= i /\ i < k ==> not (f i)))
(ensures not (sum_of_bools j k f))
(decreases (k - j)) =
| if j < k then lemma_sum_of_zero j (k - 1) f | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_add_move | val lemma_add_move (a b: poly) : Lemma (ensures a == (a +. b) +. b) | val lemma_add_move (a b: poly) : Lemma (ensures a == (a +. b) +. b) | let lemma_add_move (a b:poly) : Lemma (ensures a == (a +. b) +. b) =
lemma_add_associate a b b;
lemma_add_cancel b;
lemma_add_zero a | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 18,
"end_line": 47,
"start_col": 0,
"start_line": 44
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 | a: Vale.Math.Poly2.Defs_s.poly -> b: Vale.Math.Poly2.Defs_s.poly
-> FStar.Pervasives.Lemma (ensures a == a +. b +. b) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Math.Poly2.Defs_s.poly",
"Vale.Math.Poly2.Defs.lemma_add_zero",
"Prims.unit",
"Vale.Math.Poly2.Defs.lemma_add_cancel",
"Vale.Math.Poly2.Defs.lemma_add_associate",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"Vale.Math.Poly2.Defs.op_Plus_Dot",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | true | false | true | false | false | let lemma_add_move (a b: poly) : Lemma (ensures a == (a +. b) +. b) =
| lemma_add_associate a b b;
lemma_add_cancel b;
lemma_add_zero a | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_poly_equal_elim | val lemma_poly_equal_elim (a b: poly)
: Lemma (requires a =. b)
(ensures a == b)
(decreases (length a + length b))
[SMTPat (poly_equal a b)] | val lemma_poly_equal_elim (a b: poly)
: Lemma (requires a =. b)
(ensures a == b)
(decreases (length a + length b))
[SMTPat (poly_equal a b)] | let lemma_poly_equal_elim (a b:poly) : Lemma
(requires a =. b)
(ensures a == b)
(decreases (length a + length b))
[SMTPat (poly_equal a b)]
=
let len = max (length a) (length b) in
assert (len > 0 ==> a.[len - 1] == b.[len - 1]);
assert (length a == length b);
assert (forall (i:nat).{:pattern (index a... | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 20,
"end_line": 29,
"start_col": 0,
"start_line": 19
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 | a: Vale.Math.Poly2.Defs_s.poly -> b: Vale.Math.Poly2.Defs_s.poly
-> FStar.Pervasives.Lemma (requires a =. b)
(ensures a == b)
(decreases FStar.Seq.Base.length a + FStar.Seq.Base.length b)
[SMTPat (Vale.Math.Poly2.Defs.poly_equal a b)] | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Vale.Math.Poly2.Defs_s.poly",
"Prims._assert",
"FStar.Seq.Base.equal",
"Prims.bool",
"Prims.unit",
"Prims.l_Forall",
"Prims.nat",
"Prims.eq2",
"Vale.Math.Poly2.Defs_s.op_String_Access",
"FStar.Seq.Base.index",
"FStar.Seq.Base.length",
"Prims.l_imp",
"Prims.b2t",
"Prims.op_GreaterThan",
... | [] | false | false | true | false | false | let lemma_poly_equal_elim (a b: poly)
: Lemma (requires a =. b)
(ensures a == b)
(decreases (length a + length b))
[SMTPat (poly_equal a b)] =
| let len = max (length a) (length b) in
assert (len > 0 ==> a.[ len - 1 ] == b.[ len - 1 ]);
assert (length a == length b);
assert (forall (i: nat). {:pattern (index a i)\/(index b i)} a.[ i ] == b.[ i ]);
assert (equal a b) | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_sum_join | val lemma_sum_join (i j k: int) (f: (int -> bool))
: Lemma (requires i <= j /\ j <= k)
(ensures sum_of_bools i k f == (sum_of_bools i j f <> sum_of_bools j k f))
(decreases (k - j)) | val lemma_sum_join (i j k: int) (f: (int -> bool))
: Lemma (requires i <= j /\ j <= k)
(ensures sum_of_bools i k f == (sum_of_bools i j f <> sum_of_bools j k f))
(decreases (k - j)) | let rec lemma_sum_join (i j k:int) (f:int -> bool) : Lemma
(requires i <= j /\ j <= k)
(ensures sum_of_bools i k f == (sum_of_bools i j f <> sum_of_bools j k f))
(decreases (k - j))
=
if j < k then lemma_sum_join i j (k - 1) f | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 44,
"end_line": 71,
"start_col": 0,
"start_line": 66
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 | i: Prims.int -> j: Prims.int -> k: Prims.int -> f: (_: Prims.int -> Prims.bool)
-> FStar.Pervasives.Lemma (requires i <= j /\ j <= k)
(ensures
Vale.Math.Poly2.Defs_s.sum_of_bools i k f ==
(Vale.Math.Poly2.Defs_s.sum_of_bools i j f <> Vale.Math.Poly2.Defs_s.sum_of_bools j k f))
(decreases k... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.int",
"Prims.bool",
"Prims.op_LessThan",
"Vale.Math.Poly2.Defs.lemma_sum_join",
"Prims.op_Subtraction",
"Prims.unit",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.squash",
"Prims.eq2",
"Vale.Math.Poly2.Defs_s.sum_of_bools",
"Prims.op_disEquality",
"Prims.Nil",
"F... | [
"recursion"
] | false | false | true | false | false | let rec lemma_sum_join (i j k: int) (f: (int -> bool))
: Lemma (requires i <= j /\ j <= k)
(ensures sum_of_bools i k f == (sum_of_bools i j f <> sum_of_bools j k f))
(decreases (k - j)) =
| if j < k then lemma_sum_join i j (k - 1) f | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_mul_commute | val lemma_mul_commute (a b: poly) : Lemma ((a *. b) =. (b *. a)) | val lemma_mul_commute (a b: poly) : Lemma ((a *. b) =. (b *. a)) | let lemma_mul_commute (a b:poly) : Lemma ((a *. b) =. (b *. a)) =
let f (k:nat) : Lemma (mul_element a b k == mul_element b a k) =
lemma_sum_reverse 0 (k + 1) (mul_element_fun a b k) (mul_element_fun b a k)
in
FStar.Classical.forall_intro f | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 32,
"end_line": 246,
"start_col": 0,
"start_line": 242
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 | a: Vale.Math.Poly2.Defs_s.poly -> b: Vale.Math.Poly2.Defs_s.poly
-> FStar.Pervasives.Lemma (ensures a *. b =. b *. a) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Math.Poly2.Defs_s.poly",
"FStar.Classical.forall_intro",
"Prims.nat",
"Prims.eq2",
"Prims.bool",
"Vale.Math.Poly2.Defs_s.mul_element",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasives.pattern",
"Vale.Math.Poly2.Defs.lemma_sum_reverse",
"Prims.op_Addition",
... | [] | false | false | true | false | false | let lemma_mul_commute (a b: poly) : Lemma ((a *. b) =. (b *. a)) =
| let f (k: nat) : Lemma (mul_element a b k == mul_element b a k) =
lemma_sum_reverse 0 (k + 1) (mul_element_fun a b k) (mul_element_fun b a k)
in
FStar.Classical.forall_intro f | false |
Vale.X64.Print_Inline_s.fst | Vale.X64.Print_Inline_s.print_cmp | val print_cmp (c: ocmp) (counter: int) (p: P.printer) : string | val print_cmp (c: ocmp) (counter: int) (p: P.printer) : string | let print_cmp (c:ocmp) (counter:int) (p:P.printer) : string =
let print_ops (o1:operand64) (o2:operand64) : string =
let first, second = p.P.op_order (P.print_operand o1 p) (P.print_operand o2 p) in
" cmp " ^ first ^ ", " ^ second ^ "\n"
in
match c with
| OEq o1 o2 -> " \"" ^ print_ops o1 o2 ^ " je... | {
"file_name": "vale/specs/hardware/Vale.X64.Print_Inline_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 93,
"end_line": 243,
"start_col": 0,
"start_line": 232
} | module Vale.X64.Print_Inline_s
open FStar.Mul
open FStar.List.Tot
open Vale.X64.Machine_s
open Vale.X64.Bytes_Code_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Instruction_s
open FStar.IO
open Vale.Interop.Base
open Vale.Interop.X64
module P = Vale.X64.Print_s
let print_rettype (ret_val:option string) = match re... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.check... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Vale.Interop.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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 | c: Vale.X64.Machine_Semantics_s.ocmp -> counter: Prims.int -> p: Vale.X64.Print_s.printer
-> Prims.string | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Machine_Semantics_s.ocmp",
"Prims.int",
"Vale.X64.Print_s.printer",
"Vale.X64.Machine_s.operand64",
"Prims.b2t",
"Prims.op_Negation",
"Prims.op_BarBar",
"Vale.X64.Machine_s.uu___is_OMem",
"Vale.X64.Machine_s.nat64",
"Vale.X64.Machine_s.reg_64",
"Vale.X64.Machine_s.uu___is_OStack",
"P... | [] | false | false | false | true | false | let print_cmp (c: ocmp) (counter: int) (p: P.printer) : string =
| let print_ops (o1 o2: operand64) : string =
let first, second = p.P.op_order (P.print_operand o1 p) (P.print_operand o2 p) in
" cmp " ^ first ^ ", " ^ second ^ "\n"
in
match c with
| OEq o1 o2 -> " \"" ^ print_ops o1 o2 ^ " je " ^ "L" ^ string_of_int counter ^ ";\"\n"
| ONe o1 o2 -> " \"" ^ print_ops o1 o2 ... | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_sum_extend | val lemma_sum_extend (j' j k k': int) (f: (int -> bool))
: Lemma
(requires
j' <= j /\ j <= k /\ k <= k' /\
(forall (i: int). {:pattern (f i)} j' <= i /\ i < j ==> not (f i)) /\
(forall (i: int). {:pattern (f i)} k <= i /\ i < k' ==> not (f i)))
(ensures sum_of_bools j' k' f == su... | val lemma_sum_extend (j' j k k': int) (f: (int -> bool))
: Lemma
(requires
j' <= j /\ j <= k /\ k <= k' /\
(forall (i: int). {:pattern (f i)} j' <= i /\ i < j ==> not (f i)) /\
(forall (i: int). {:pattern (f i)} k <= i /\ i < k' ==> not (f i)))
(ensures sum_of_bools j' k' f == su... | let lemma_sum_extend (j' j k k':int) (f:int -> bool) : Lemma
(requires
j' <= j /\ j <= k /\ k <= k' /\
(forall (i:int).{:pattern (f i)} j' <= i /\ i < j ==> not (f i)) /\
(forall (i:int).{:pattern (f i)} k <= i /\ i < k' ==> not (f i))
)
(ensures sum_of_bools j' k' f == sum_of_bools j k f)
=
lemma... | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 26,
"end_line": 84,
"start_col": 0,
"start_line": 73
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 | j': Prims.int -> j: Prims.int -> k: Prims.int -> k': Prims.int -> f: (_: Prims.int -> Prims.bool)
-> FStar.Pervasives.Lemma
(requires
j' <= j /\ j <= k /\ k <= k' /\
(forall (i: Prims.int). {:pattern f i} j' <= i /\ i < j ==> Prims.op_Negation (f i)) /\
(forall (i: Prims.int). {:pattern ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.bool",
"Vale.Math.Poly2.Defs.lemma_sum_join",
"Prims.unit",
"Vale.Math.Poly2.Defs.lemma_sum_of_zero",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.op_LessThan",
"Prims.op_Negation",
"Prims.squash",
"Prims.eq2",
"Vale.... | [] | true | false | true | false | false | let lemma_sum_extend (j' j k k': int) (f: (int -> bool))
: Lemma
(requires
j' <= j /\ j <= k /\ k <= k' /\
(forall (i: int). {:pattern (f i)} j' <= i /\ i < j ==> not (f i)) /\
(forall (i: int). {:pattern (f i)} k <= i /\ i < k' ==> not (f i)))
(ensures sum_of_bools j' k' f == su... | lemma_sum_of_zero j' j f;
lemma_sum_of_zero k k' f;
lemma_sum_join j' j k f;
lemma_sum_join j' k k' f | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_sum_shift | val lemma_sum_shift (j k shift: int) (f g: (int -> bool))
: Lemma (requires (forall (i: int). {:pattern (f i)} j <= i /\ i < k ==> f i == g (i + shift)))
(ensures sum_of_bools j k f == sum_of_bools (j + shift) (k + shift) g)
(decreases (k - j)) | val lemma_sum_shift (j k shift: int) (f g: (int -> bool))
: Lemma (requires (forall (i: int). {:pattern (f i)} j <= i /\ i < k ==> f i == g (i + shift)))
(ensures sum_of_bools j k f == sum_of_bools (j + shift) (k + shift) g)
(decreases (k - j)) | let rec lemma_sum_shift (j k:int) (shift:int) (f g:int -> bool) : Lemma
(requires (forall (i:int).{:pattern (f i)} j <= i /\ i < k ==> f i == g (i + shift)))
(ensures sum_of_bools j k f == sum_of_bools (j + shift) (k + shift) g)
(decreases (k - j))
=
if j < k then lemma_sum_shift j (k - 1) shift f g | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 51,
"end_line": 98,
"start_col": 0,
"start_line": 93
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 |
j: Prims.int ->
k: Prims.int ->
shift: Prims.int ->
f: (_: Prims.int -> Prims.bool) ->
g: (_: Prims.int -> Prims.bool)
-> FStar.Pervasives.Lemma
(requires forall (i: Prims.int). {:pattern f i} j <= i /\ i < k ==> f i == g (i + shift))
(ensures
Vale.Math.Poly2.Defs_s.sum_of_boo... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.int",
"Prims.bool",
"Prims.op_LessThan",
"Vale.Math.Poly2.Defs.lemma_sum_shift",
"Prims.op_Subtraction",
"Prims.unit",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.eq2",
"Prims.op_Addition",
"Prims.squash",
"Vale.Math.Poly2.Defs_s... | [
"recursion"
] | false | false | true | false | false | let rec lemma_sum_shift (j k shift: int) (f g: (int -> bool))
: Lemma (requires (forall (i: int). {:pattern (f i)} j <= i /\ i < k ==> f i == g (i + shift)))
(ensures sum_of_bools j k f == sum_of_bools (j + shift) (k + shift) g)
(decreases (k - j)) =
| if j < k then lemma_sum_shift j (k - 1) shift f g | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_sum_mul | val lemma_sum_mul (j k: int) (b: bool) (f g: (int -> bool))
: Lemma (requires (forall (i: int). {:pattern (f i)} j <= i /\ i < k ==> f i == (b && g i)))
(ensures sum_of_bools j k f == (b && sum_of_bools j k g))
(decreases (k - j)) | val lemma_sum_mul (j k: int) (b: bool) (f g: (int -> bool))
: Lemma (requires (forall (i: int). {:pattern (f i)} j <= i /\ i < k ==> f i == (b && g i)))
(ensures sum_of_bools j k f == (b && sum_of_bools j k g))
(decreases (k - j)) | let rec lemma_sum_mul (j k:int) (b:bool) (f g:int -> bool) : Lemma
(requires (forall (i:int).{:pattern (f i)} j <= i /\ i < k ==> f i == (b && g i)))
(ensures sum_of_bools j k f == (b && sum_of_bools j k g))
(decreases (k - j))
=
if j < k then lemma_sum_mul j (k - 1) b f g | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 45,
"end_line": 130,
"start_col": 0,
"start_line": 125
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 |
j: Prims.int ->
k: Prims.int ->
b: Prims.bool ->
f: (_: Prims.int -> Prims.bool) ->
g: (_: Prims.int -> Prims.bool)
-> FStar.Pervasives.Lemma
(requires forall (i: Prims.int). {:pattern f i} j <= i /\ i < k ==> f i == (b && g i))
(ensures
Vale.Math.Poly2.Defs_s.sum_of_bools j k... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.int",
"Prims.bool",
"Prims.op_LessThan",
"Vale.Math.Poly2.Defs.lemma_sum_mul",
"Prims.op_Subtraction",
"Prims.unit",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.eq2",
"Prims.op_AmpAmp",
"Prims.squash",
"Vale.Math.Poly2.Defs_s.sum... | [
"recursion"
] | false | false | true | false | false | let rec lemma_sum_mul (j k: int) (b: bool) (f g: (int -> bool))
: Lemma (requires (forall (i: int). {:pattern (f i)} j <= i /\ i < k ==> f i == (b && g i)))
(ensures sum_of_bools j k f == (b && sum_of_bools j k g))
(decreases (k - j)) =
| if j < k then lemma_sum_mul j (k - 1) b f g | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_sum_of_pairs | val lemma_sum_of_pairs (j k: int) (f g h: (int -> bool))
: Lemma (requires (forall (i: int). {:pattern (f i)} j <= i /\ i < k ==> f i == (g i <> h i)))
(ensures sum_of_bools j k f == (sum_of_bools j k g <> sum_of_bools j k h))
(decreases (k - j)) | val lemma_sum_of_pairs (j k: int) (f g h: (int -> bool))
: Lemma (requires (forall (i: int). {:pattern (f i)} j <= i /\ i < k ==> f i == (g i <> h i)))
(ensures sum_of_bools j k f == (sum_of_bools j k g <> sum_of_bools j k h))
(decreases (k - j)) | let rec lemma_sum_of_pairs (j k:int) (f g h:int -> bool) : Lemma
(requires (forall (i:int).{:pattern (f i)} j <= i /\ i < k ==> f i == (g i <> h i)))
(ensures sum_of_bools j k f == (sum_of_bools j k g <> sum_of_bools j k h))
(decreases (k - j))
=
if j < k then lemma_sum_of_pairs j (k - 1) f g h | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 50,
"end_line": 91,
"start_col": 0,
"start_line": 86
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 |
j: Prims.int ->
k: Prims.int ->
f: (_: Prims.int -> Prims.bool) ->
g: (_: Prims.int -> Prims.bool) ->
h: (_: Prims.int -> Prims.bool)
-> FStar.Pervasives.Lemma
(requires forall (i: Prims.int). {:pattern f i} j <= i /\ i < k ==> f i == (g i <> h i))
(ensures
Vale.Math.Poly2.Def... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.int",
"Prims.bool",
"Prims.op_LessThan",
"Vale.Math.Poly2.Defs.lemma_sum_of_pairs",
"Prims.op_Subtraction",
"Prims.unit",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.eq2",
"Prims.op_disEquality",
"Prims.squash",
"Vale.Math.Poly2.... | [
"recursion"
] | false | false | true | false | false | let rec lemma_sum_of_pairs (j k: int) (f g h: (int -> bool))
: Lemma (requires (forall (i: int). {:pattern (f i)} j <= i /\ i < k ==> f i == (g i <> h i)))
(ensures sum_of_bools j k f == (sum_of_bools j k g <> sum_of_bools j k h))
(decreases (k - j)) =
| if j < k then lemma_sum_of_pairs j (k - 1) f g h | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_mul_element | val lemma_mul_element (a b: poly) (k: int)
: Lemma (requires True) (ensures (a *. b).[ k ] == mul_element a b k) [SMTPat (a *. b).[ k ]] | val lemma_mul_element (a b: poly) (k: int)
: Lemma (requires True) (ensures (a *. b).[ k ] == mul_element a b k) [SMTPat (a *. b).[ k ]] | let lemma_mul_element (a b:poly) (k:int) : Lemma
(requires True)
(ensures (a *. b).[k] == mul_element a b k)
[SMTPat (a *. b).[k]]
=
if k >= length a + length b then lemma_sum_of_zero 0 (k + 1) (mul_element_fun a b k) | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 86,
"end_line": 228,
"start_col": 0,
"start_line": 223
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 | a: Vale.Math.Poly2.Defs_s.poly -> b: Vale.Math.Poly2.Defs_s.poly -> k: Prims.int
-> FStar.Pervasives.Lemma (ensures (a *. b).[ k ] == Vale.Math.Poly2.Defs_s.mul_element a b k)
[SMTPat (a *. b).[ k ]] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Math.Poly2.Defs_s.poly",
"Prims.int",
"Prims.op_GreaterThanOrEqual",
"Prims.op_Addition",
"FStar.Seq.Base.length",
"Prims.bool",
"Vale.Math.Poly2.Defs.lemma_sum_of_zero",
"Vale.Math.Poly2.Defs_s.mul_element_fun",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"Vale.Math.Pol... | [] | false | false | true | false | false | let lemma_mul_element (a b: poly) (k: int)
: Lemma (requires True) (ensures (a *. b).[ k ] == mul_element a b k) [SMTPat (a *. b).[ k ]] =
| if k >= length a + length b then lemma_sum_of_zero 0 (k + 1) (mul_element_fun a b k) | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_sum_invert | val lemma_sum_invert (j k: int) (f g: (int -> bool))
: Lemma (requires (forall (i: int). {:pattern (f i)} j <= i /\ i < k ==> f i == g (- i)))
(ensures sum_of_bools j k f == sum_of_bools (1 - k) (1 - j) g) | val lemma_sum_invert (j k: int) (f g: (int -> bool))
: Lemma (requires (forall (i: int). {:pattern (f i)} j <= i /\ i < k ==> f i == g (- i)))
(ensures sum_of_bools j k f == sum_of_bools (1 - k) (1 - j) g) | let lemma_sum_invert (j k:int) (f g:int -> bool) : Lemma
(requires (forall (i:int).{:pattern (f i)} j <= i /\ i < k ==> f i == g (-i)))
(ensures sum_of_bools j k f == sum_of_bools (1 - k) (1 - j) g)
=
if j < k then lemma_sum_invert_rec j k k f g | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 46,
"end_line": 115,
"start_col": 0,
"start_line": 111
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 | j: Prims.int -> k: Prims.int -> f: (_: Prims.int -> Prims.bool) -> g: (_: Prims.int -> Prims.bool)
-> FStar.Pervasives.Lemma
(requires forall (i: Prims.int). {:pattern f i} j <= i /\ i < k ==> f i == g (- i))
(ensures
Vale.Math.Poly2.Defs_s.sum_of_bools j k f ==
Vale.Math.Poly2.Defs_s.sum_... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.bool",
"Prims.op_LessThan",
"Vale.Math.Poly2.Defs.lemma_sum_invert_rec",
"Prims.unit",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.eq2",
"Prims.op_Minus",
"Prims.squash",
"Vale.Math.Poly2.Defs_s.sum_of_bools",
"Prims... | [] | false | false | true | false | false | let lemma_sum_invert (j k: int) (f g: (int -> bool))
: Lemma (requires (forall (i: int). {:pattern (f i)} j <= i /\ i < k ==> f i == g (- i)))
(ensures sum_of_bools j k f == sum_of_bools (1 - k) (1 - j) g) =
| if j < k then lemma_sum_invert_rec j k k f g | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_sum_invert_rec | val lemma_sum_invert_rec (j m k: int) (f g: (int -> bool))
: Lemma
(requires
j <= m /\ m <= k /\
sum_of_bools j k f == (sum_of_bools j m f <> sum_of_bools (1 - k) (1 - m) g) /\
(forall (i: int). {:pattern (f i)} j <= i /\ i < k ==> f i == g (- i)))
(ensures sum_of_bools j k f == ... | val lemma_sum_invert_rec (j m k: int) (f g: (int -> bool))
: Lemma
(requires
j <= m /\ m <= k /\
sum_of_bools j k f == (sum_of_bools j m f <> sum_of_bools (1 - k) (1 - m) g) /\
(forall (i: int). {:pattern (f i)} j <= i /\ i < k ==> f i == g (- i)))
(ensures sum_of_bools j k f == ... | let rec lemma_sum_invert_rec (j m k:int) (f g:int -> bool) : Lemma
(requires
j <= m /\ m <= k /\
sum_of_bools j k f == (sum_of_bools j m f <> sum_of_bools (1 - k) (1 - m) g) /\
(forall (i:int).{:pattern (f i)} j <= i /\ i < k ==> f i == g (-i))
)
(ensures sum_of_bools j k f == sum_of_bools (1 - k) (1 ... | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 52,
"end_line": 109,
"start_col": 0,
"start_line": 100
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 |
j: Prims.int ->
m: Prims.int ->
k: Prims.int ->
f: (_: Prims.int -> Prims.bool) ->
g: (_: Prims.int -> Prims.bool)
-> FStar.Pervasives.Lemma
(requires
j <= m /\ m <= k /\
Vale.Math.Poly2.Defs_s.sum_of_bools j k f ==
(Vale.Math.Poly2.Defs_s.sum_of_bools j m f <>
... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.int",
"Prims.bool",
"Prims.op_LessThan",
"Vale.Math.Poly2.Defs.lemma_sum_invert_rec",
"Prims.op_Subtraction",
"Prims.unit",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.eq2",
"Vale.Math.Poly2.Defs_s.sum_of_bools",
"Prims.op_disEquality",
"Prims.l_Forall",
"Prims.l_... | [
"recursion"
] | false | false | true | false | false | let rec lemma_sum_invert_rec (j m k: int) (f g: (int -> bool))
: Lemma
(requires
j <= m /\ m <= k /\
sum_of_bools j k f == (sum_of_bools j m f <> sum_of_bools (1 - k) (1 - m) g) /\
(forall (i: int). {:pattern (f i)} j <= i /\ i < k ==> f i == g (- i)))
(ensures sum_of_bools j k f... | if j < m then lemma_sum_invert_rec j (m - 1) k f g | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_sum_pointwise_equal | val lemma_sum_pointwise_equal (j k: int) (f g: (int -> bool)) (pf: (i: int -> Lemma (f i == g i)))
: Lemma (ensures sum_of_bools j k f == sum_of_bools j k g) (decreases (k - j)) | val lemma_sum_pointwise_equal (j k: int) (f g: (int -> bool)) (pf: (i: int -> Lemma (f i == g i)))
: Lemma (ensures sum_of_bools j k f == sum_of_bools j k g) (decreases (k - j)) | let rec lemma_sum_pointwise_equal (j k:int) (f g:int -> bool) (pf:(i:int -> Lemma (f i == g i))) : Lemma
(ensures sum_of_bools j k f == sum_of_bools j k g)
(decreases (k - j))
=
if j < k then
(
pf (k - 1);
lemma_sum_pointwise_equal j (k - 1) f g pf
) | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 218,
"start_col": 0,
"start_line": 210
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 |
j: Prims.int ->
k: Prims.int ->
f: (_: Prims.int -> Prims.bool) ->
g: (_: Prims.int -> Prims.bool) ->
pf: (i: Prims.int -> FStar.Pervasives.Lemma (ensures f i == g i))
-> FStar.Pervasives.Lemma
(ensures
Vale.Math.Poly2.Defs_s.sum_of_bools j k f == Vale.Math.Poly2.Defs_s.sum_of_bools... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.int",
"Prims.bool",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"Prims.Nil",
"FStar.Pervasives.pattern",
"Prims.op_LessThan",
"Vale.Math.Poly2.Defs.lemma_sum_pointwise_equal",
"Prims.op_Subtraction",
"Vale.Math.Poly2.Defs_s.sum_of_bools"
] | [
"recursion"
] | false | false | true | false | false | let rec lemma_sum_pointwise_equal
(j k: int)
(f g: (int -> bool))
(pf: (i: int -> Lemma (f i == g i)))
: Lemma (ensures sum_of_bools j k f == sum_of_bools j k g) (decreases (k - j)) =
| if j < k
then
(pf (k - 1);
lemma_sum_pointwise_equal j (k - 1) f g pf) | false |
Vale.X64.Print_Inline_s.fst | Vale.X64.Print_Inline_s.remove_blanks | val remove_blanks (b: codes) : codes | val remove_blanks (b: codes) : codes | let rec remove_blank (c:code) : code =
match c with
| Ins _ -> c
| Block b -> Block (remove_blanks b)
| IfElse cond ct cf -> IfElse cond (remove_blank ct) (remove_blank cf)
| While cond cb -> While cond (remove_blank cb)
and remove_blanks (b:codes) : codes =
match b with
| [] -> []
| Ins (Instr _ _ (Ann... | {
"file_name": "vale/specs/hardware/Vale.X64.Print_Inline_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 36,
"end_line": 320,
"start_col": 0,
"start_line": 304
} | module Vale.X64.Print_Inline_s
open FStar.Mul
open FStar.List.Tot
open Vale.X64.Machine_s
open Vale.X64.Bytes_Code_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Instruction_s
open FStar.IO
open Vale.Interop.Base
open Vale.Interop.X64
module P = Vale.X64.Print_s
let print_rettype (ret_val:option string) = match re... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.check... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Vale.Interop.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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 | b: Vale.X64.Machine_Semantics_s.codes -> Vale.X64.Machine_Semantics_s.codes | Prims.Tot | [
"total"
] | [
"remove_blank",
"remove_blanks"
] | [
"Vale.X64.Machine_Semantics_s.codes",
"Prims.Nil",
"Vale.X64.Bytes_Code_s.code_t",
"Vale.X64.Machine_Semantics_s.instr_annotation",
"Vale.X64.Instruction_s.instr_t_record",
"Vale.X64.Instruction_s.instr_operands_t",
"Vale.X64.Instruction_s.__proj__InstrTypeRecord__item__outs",
"Vale.X64.Instruction_s.... | [
"mutual recursion"
] | false | false | false | true | false | let rec remove_blanks (b: codes) : codes =
| match b with
| [] -> []
| Ins (Instr _ _ (AnnotateGhost _)) :: cs -> remove_blanks cs
| Block b :: cs ->
(match remove_blanks b with
| [] -> remove_blanks cs
| b -> Block b :: remove_blanks cs)
| c :: cs -> c :: remove_blanks cs | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_sum_swap_mul_associate | val lemma_sum_swap_mul_associate (k: int) (ff gg: (int -> int -> bool)) (f g: (int -> bool))
: Lemma
(requires
k > 0 /\ (forall (x: nat). {:pattern (f x)} f x == sum_of_bools 0 (x + 1) (ff x)) /\
(forall (y: nat). {:pattern (g y)} g y == sum_of_bools y k (gg y)) /\
(forall (x: int) (y:... | val lemma_sum_swap_mul_associate (k: int) (ff gg: (int -> int -> bool)) (f g: (int -> bool))
: Lemma
(requires
k > 0 /\ (forall (x: nat). {:pattern (f x)} f x == sum_of_bools 0 (x + 1) (ff x)) /\
(forall (y: nat). {:pattern (g y)} g y == sum_of_bools y k (gg y)) /\
(forall (x: int) (y:... | let lemma_sum_swap_mul_associate (k:int) (ff gg:int -> int -> bool) (f g:int -> bool) : Lemma
(requires
k > 0 /\
(forall (x:nat).{:pattern (f x)} f x == sum_of_bools 0 (x + 1) (ff x)) /\
(forall (y:nat).{:pattern (g y)} g y == sum_of_bools y k (gg y)) /\
(forall (x y:int).{:pattern (ff x y)} ff x y ==... | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 208,
"start_col": 0,
"start_line": 161
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 |
k: Prims.int ->
ff: (_: Prims.int -> _: Prims.int -> Prims.bool) ->
gg: (_: Prims.int -> _: Prims.int -> Prims.bool) ->
f: (_: Prims.int -> Prims.bool) ->
g: (_: Prims.int -> Prims.bool)
-> FStar.Pervasives.Lemma
(requires
k > 0 /\
(forall (x: Prims.nat). {:pattern f x}
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.bool",
"Prims.unit",
"Vale.Math.Poly2.Defs.lemma_sum_extend",
"Vale.Math.Poly2.Defs.lemma_sum_swap",
"FStar.Classical.forall_intro",
"Prims.nat",
"Prims.l_and",
"Prims.l_imp",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Negation",
"Prims.op_LessThan",
"Prims.eq2"... | [] | false | false | true | false | false | let lemma_sum_swap_mul_associate (k: int) (ff gg: (int -> int -> bool)) (f g: (int -> bool))
: Lemma
(requires
k > 0 /\ (forall (x: nat). {:pattern (f x)} f x == sum_of_bools 0 (x + 1) (ff x)) /\
(forall (y: nat). {:pattern (g y)} g y == sum_of_bools y k (gg y)) /\
(forall (x: int) (y:... | let k' = k + k - 1 in
let lemma_f (x: nat)
: Lemma (ensures (k <= x ==> not (f x)) /\ (x < k' ==> f x == sum_of_bools 0 (k' - x) (ff x))) =
(if k <= x then lemma_sum_of_zero 0 (x + 1) (ff x));
lemma_sum_of_zero (if x < k then x + 1 else 0) (k' - x) (ff x);
(if x < k then lemma_sum_join 0 (x + 1) (k' - x) (ff ... | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_mul_zero | val lemma_mul_zero (a: poly) : Lemma ((a *. zero) =. zero) | val lemma_mul_zero (a: poly) : Lemma ((a *. zero) =. zero) | let lemma_mul_zero (a:poly) : Lemma ((a *. zero) =. zero) =
let f (k:nat) : Lemma (not (mul_element a zero k)) =
lemma_sum_of_zero 0 (k + 1) (mul_element_fun a zero k)
in
FStar.Classical.forall_intro f | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 32,
"end_line": 234,
"start_col": 0,
"start_line": 230
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 | a: Vale.Math.Poly2.Defs_s.poly
-> FStar.Pervasives.Lemma
(ensures a *. Vale.Math.Poly2.Defs_s.zero =. Vale.Math.Poly2.Defs_s.zero) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Math.Poly2.Defs_s.poly",
"FStar.Classical.forall_intro",
"Prims.nat",
"Prims.b2t",
"Prims.op_Negation",
"Vale.Math.Poly2.Defs_s.mul_element",
"Vale.Math.Poly2.Defs_s.zero",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasives.pattern",
"Vale.Math.Poly2.Defs.lemm... | [] | false | false | true | false | false | let lemma_mul_zero (a: poly) : Lemma ((a *. zero) =. zero) =
| let f (k: nat) : Lemma (not (mul_element a zero k)) =
lemma_sum_of_zero 0 (k + 1) (mul_element_fun a zero k)
in
FStar.Classical.forall_intro f | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_sum_reverse | val lemma_sum_reverse (j k: int) (f g: (int -> bool))
: Lemma
(requires (forall (i: int). {:pattern (f i)} j <= i /\ i < k ==> f i == g (k + j - i - 1)))
(ensures sum_of_bools j k f == sum_of_bools j k g) | val lemma_sum_reverse (j k: int) (f g: (int -> bool))
: Lemma
(requires (forall (i: int). {:pattern (f i)} j <= i /\ i < k ==> f i == g (k + j - i - 1)))
(ensures sum_of_bools j k f == sum_of_bools j k g) | let lemma_sum_reverse (j k:int) (f g:int -> bool) : Lemma
(requires (forall (i:int).{:pattern (f i)} j <= i /\ i < k ==> f i == g (k + j - i - 1)))
(ensures sum_of_bools j k f == sum_of_bools j k g)
=
let f' (i:int) = f (-i) in
lemma_sum_invert j k f f';
lemma_sum_shift j k (1 - (k + j)) g f' | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 40,
"end_line": 123,
"start_col": 0,
"start_line": 117
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 | j: Prims.int -> k: Prims.int -> f: (_: Prims.int -> Prims.bool) -> g: (_: Prims.int -> Prims.bool)
-> FStar.Pervasives.Lemma
(requires forall (i: Prims.int). {:pattern f i} j <= i /\ i < k ==> f i == g (k + j - i - 1))
(ensures
Vale.Math.Poly2.Defs_s.sum_of_bools j k f == Vale.Math.Poly2.Defs_s.su... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.bool",
"Vale.Math.Poly2.Defs.lemma_sum_shift",
"Prims.op_Subtraction",
"Prims.op_Addition",
"Prims.unit",
"Vale.Math.Poly2.Defs.lemma_sum_invert",
"Prims.op_Minus",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_LessTh... | [] | false | false | true | false | false | let lemma_sum_reverse (j k: int) (f g: (int -> bool))
: Lemma
(requires (forall (i: int). {:pattern (f i)} j <= i /\ i < k ==> f i == g (k + j - i - 1)))
(ensures sum_of_bools j k f == sum_of_bools j k g) =
| let f' (i: int) = f (- i) in
lemma_sum_invert j k f f';
lemma_sum_shift j k (1 - (k + j)) g f' | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_mul_distribute | val lemma_mul_distribute (a b c: poly) : Lemma (a *. (b +. c) =. (a *. b) +. (a *. c)) | val lemma_mul_distribute (a b c: poly) : Lemma (a *. (b +. c) =. (a *. b) +. (a *. c)) | let lemma_mul_distribute (a b c:poly) : Lemma (a *. (b +. c) =. (a *. b) +. (a *. c)) =
let f (k:nat) : Lemma
(ensures mul_element a (b +. c) k == (mul_element a b k <> mul_element a c k))
=
lemma_sum_of_pairs 0 (k + 1)
(mul_element_fun a (b +. c) k)
(mul_element_fun a b k)
(mul_element_... | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 32,
"end_line": 291,
"start_col": 0,
"start_line": 282
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 | a: Vale.Math.Poly2.Defs_s.poly -> b: Vale.Math.Poly2.Defs_s.poly -> c: Vale.Math.Poly2.Defs_s.poly
-> FStar.Pervasives.Lemma (ensures a *. (b +. c) =. a *. b +. a *. c) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Math.Poly2.Defs_s.poly",
"FStar.Classical.forall_intro",
"Prims.nat",
"Prims.eq2",
"Prims.bool",
"Vale.Math.Poly2.Defs_s.mul_element",
"Vale.Math.Poly2.Defs.op_Plus_Dot",
"Prims.op_disEquality",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Vale.Math.Poly2.Defs_s.add",
"Prims.Nil",
... | [] | false | false | true | false | false | let lemma_mul_distribute (a b c: poly) : Lemma (a *. (b +. c) =. (a *. b) +. (a *. c)) =
| let f (k: nat)
: Lemma (ensures mul_element a (b +. c) k == (mul_element a b k <> mul_element a c k)) =
lemma_sum_of_pairs 0
(k + 1)
(mul_element_fun a (b +. c) k)
(mul_element_fun a b k)
(mul_element_fun a c k)
in
FStar.Classical.forall_intro f | false |
Vale.X64.Print_Inline_s.fst | Vale.X64.Print_Inline_s.print_block | val print_block (b: codes) (n: int) (p: P.printer) : string & int | val print_block (b: codes) (n: int) (p: P.printer) : string & int | let rec print_block (b:codes) (n:int) (p:P.printer) : string & int =
match b with
| Nil -> "", n
| Ins (Instr _ _ (AnnotateSpace spaces)) :: Ins (Instr _ _ (AnnotateComment s)) :: tail ->
let head_str = " // " ^ s ^ "\n" in
let rest, n' = print_block tail n p in
print_spaces spaces ^ head_str ^ re... | {
"file_name": "vale/specs/hardware/Vale.X64.Print_Inline_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 46,
"end_line": 298,
"start_col": 0,
"start_line": 258
} | module Vale.X64.Print_Inline_s
open FStar.Mul
open FStar.List.Tot
open Vale.X64.Machine_s
open Vale.X64.Bytes_Code_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Instruction_s
open FStar.IO
open Vale.Interop.Base
open Vale.Interop.X64
module P = Vale.X64.Print_s
let print_rettype (ret_val:option string) = match re... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.check... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Vale.Interop.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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 | b: Vale.X64.Machine_Semantics_s.codes -> n: Prims.int -> p: Vale.X64.Print_s.printer
-> Prims.string * Prims.int | Prims.Tot | [
"total"
] | [
"print_block",
"print_code"
] | [
"Vale.X64.Machine_Semantics_s.codes",
"Prims.int",
"Vale.X64.Print_s.printer",
"FStar.Pervasives.Native.Mktuple2",
"Prims.string",
"Vale.X64.Instruction_s.instr_t_record",
"Vale.X64.Instruction_s.instr_operands_t",
"Vale.X64.Instruction_s.__proj__InstrTypeRecord__item__outs",
"Vale.X64.Instruction_s... | [
"mutual recursion"
] | false | false | false | true | false | let rec print_block (b: codes) (n: int) (p: P.printer) : string & int =
| match b with
| Nil -> "", n
| Ins (Instr _ _ (AnnotateSpace spaces)) :: Ins (Instr _ _ (AnnotateComment s)) :: tail ->
let head_str = " // " ^ s ^ "\n" in
let rest, n' = print_block tail n p in
print_spaces spaces ^ head_str ^ rest, n'
| Ins (Instr _ _ (AnnotateSpace spaces)) :: Ins i :: tail ->
let head_str... | false |
Vale.X64.Print_Inline_s.fst | Vale.X64.Print_Inline_s.uses_rax | val uses_rax : args: Prims.list Vale.Interop.Base.td ->
i: Prims.nat{i + FStar.List.Tot.Base.length args = n} ->
of_arg: (_: Vale.Interop.X64.reg_nat n -> Vale.X64.Machine_s.reg_64)
-> Prims.bool | let rec uses_rax (#n:nat) (args:list td) (i:nat{i + List.length args = n}) (of_arg:reg_nat n -> reg_64) =
match args with
| [] -> false
| a::q -> if of_arg i = rRax then true else uses_rax q (i+1) of_arg | {
"file_name": "vale/specs/hardware/Vale.X64.Print_Inline_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 69,
"end_line": 326,
"start_col": 0,
"start_line": 323
} | module Vale.X64.Print_Inline_s
open FStar.Mul
open FStar.List.Tot
open Vale.X64.Machine_s
open Vale.X64.Bytes_Code_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Instruction_s
open FStar.IO
open Vale.Interop.Base
open Vale.Interop.X64
module P = Vale.X64.Print_s
let print_rettype (ret_val:option string) = match re... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.check... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Vale.Interop.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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 |
args: Prims.list Vale.Interop.Base.td ->
i: Prims.nat{i + FStar.List.Tot.Base.length args = n} ->
of_arg: (_: Vale.Interop.X64.reg_nat n -> Vale.X64.Machine_s.reg_64)
-> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.list",
"Vale.Interop.Base.td",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Addition",
"FStar.List.Tot.Base.length",
"Vale.Interop.X64.reg_nat",
"Vale.X64.Machine_s.reg_64",
"Vale.X64.Machine_s.rRax",
"Prims.bool",
"Vale.X64.Print_Inline_s.uses_rax"
] | [
"recursion"
] | false | false | false | false | false | let rec uses_rax
(#n: nat)
(args: list td)
(i: nat{i + List.length args = n})
(of_arg: (reg_nat n -> reg_64))
=
| match args with
| [] -> false
| a :: q -> if of_arg i = rRax then true else uses_rax q (i + 1) of_arg | false | |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_mul_one | val lemma_mul_one (a: poly) : Lemma ((a *. one) =. a) | val lemma_mul_one (a: poly) : Lemma ((a *. one) =. a) | let lemma_mul_one (a:poly) : Lemma ((a *. one) =. a) =
let f (k:nat) : Lemma (mul_element a one k == a.[k]) =
lemma_sum_of_zero 0 k (mul_element_fun a one k)
in
FStar.Classical.forall_intro f | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 32,
"end_line": 240,
"start_col": 0,
"start_line": 236
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 | a: Vale.Math.Poly2.Defs_s.poly
-> FStar.Pervasives.Lemma (ensures a *. Vale.Math.Poly2.Defs_s.one =. a) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Math.Poly2.Defs_s.poly",
"FStar.Classical.forall_intro",
"Prims.nat",
"Prims.eq2",
"Prims.bool",
"Vale.Math.Poly2.Defs_s.mul_element",
"Vale.Math.Poly2.Defs_s.one",
"Vale.Math.Poly2.Defs_s.op_String_Access",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Vale.Math.Poly2.Defs_s.poly_index... | [] | false | false | true | false | false | let lemma_mul_one (a: poly) : Lemma ((a *. one) =. a) =
| let f (k: nat) : Lemma (mul_element a one k == a.[ k ]) =
lemma_sum_of_zero 0 k (mul_element_fun a one k)
in
FStar.Classical.forall_intro f | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_div_degree | val lemma_div_degree (a b: poly)
: Lemma (requires length b > 0)
(ensures degree (a /. b) == (if degree a < degree b then - 1 else degree a - degree b))
(decreases (length a)) | val lemma_div_degree (a b: poly)
: Lemma (requires length b > 0)
(ensures degree (a /. b) == (if degree a < degree b then - 1 else degree a - degree b))
(decreases (length a)) | let rec lemma_div_degree (a b:poly) : Lemma
(requires length b > 0)
(ensures degree (a /. b) == (if degree a < degree b then -1 else degree a - degree b))
(decreases (length a))
=
if length a >= length b then
(
let _ = assert (a.[length a - 1]) in
let n = length a - length b in
let a' = add a (s... | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 418,
"start_col": 0,
"start_line": 405
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 | a: Vale.Math.Poly2.Defs_s.poly -> b: Vale.Math.Poly2.Defs_s.poly
-> FStar.Pervasives.Lemma (requires FStar.Seq.Base.length b > 0)
(ensures
Vale.Math.Poly2.Defs_s.degree (a /. b) ==
(match Vale.Math.Poly2.Defs_s.degree a < Vale.Math.Poly2.Defs_s.degree b with
| true -> - 1
| _... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Vale.Math.Poly2.Defs_s.poly",
"Prims.op_GreaterThanOrEqual",
"FStar.Seq.Base.length",
"Prims.bool",
"Prims.unit",
"Prims._assert",
"Prims.b2t",
"Vale.Math.Poly2.Defs_s.op_String_Access",
"Vale.Math.Poly2.Defs.op_Slash_Dot",
"Prims.op_Subtraction",
"Vale.Math.Poly2.Defs_s.degree",
"Vale.Math.P... | [
"recursion"
] | false | false | true | false | false | let rec lemma_div_degree (a b: poly)
: Lemma (requires length b > 0)
(ensures degree (a /. b) == (if degree a < degree b then - 1 else degree a - degree b))
(decreases (length a)) =
| if length a >= length b
then
(let _ = assert (a.[ length a - 1 ]) in
let n = length a - length b in
let a' = add a (shift b n) in
lemma_div_degree a' b;
assert ((a /. b).[ degree a - degree b ]);
()) | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_mul_degree | val lemma_mul_degree (a b: poly)
: Lemma
(degree (a *. b) == (if degree a >= 0 && degree b >= 0 then degree a + degree b else - 1)) | val lemma_mul_degree (a b: poly)
: Lemma
(degree (a *. b) == (if degree a >= 0 && degree b >= 0 then degree a + degree b else - 1)) | let lemma_mul_degree (a b:poly) : Lemma
(degree (a *. b) == (if degree a >= 0 && degree b >= 0 then degree a + degree b else -1))
=
if degree a >= 0 && degree b >= 0 then
(
let len = length a + length b in
lemma_sum_of_zero 0 len (mul_element_fun a b (len - 1));
lemma_sum_extend 0 (length a - 1) (le... | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 334,
"start_col": 0,
"start_line": 310
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 | a: Vale.Math.Poly2.Defs_s.poly -> b: Vale.Math.Poly2.Defs_s.poly
-> FStar.Pervasives.Lemma
(ensures
Vale.Math.Poly2.Defs_s.degree (a *. b) ==
(match Vale.Math.Poly2.Defs_s.degree a >= 0 && Vale.Math.Poly2.Defs_s.degree b >= 0 with
| true -> Vale.Math.Poly2.Defs_s.degree a + Vale.Math.Poly2.Def... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Math.Poly2.Defs_s.poly",
"Prims.op_AmpAmp",
"Prims.op_GreaterThanOrEqual",
"Vale.Math.Poly2.Defs_s.degree",
"Prims.unit",
"Prims._assert",
"Prims.b2t",
"Vale.Math.Poly2.Defs_s.op_String_Access",
"Vale.Math.Poly2.Defs.op_Star_Dot",
"Prims.op_Subtraction",
"Prims.op_Negation",
"Vale.Math.P... | [] | false | false | true | false | false | let lemma_mul_degree (a b: poly)
: Lemma
(degree (a *. b) == (if degree a >= 0 && degree b >= 0 then degree a + degree b else - 1)) =
| if degree a >= 0 && degree b >= 0
then
(let len = length a + length b in
lemma_sum_of_zero 0 len (mul_element_fun a b (len - 1));
lemma_sum_extend 0 (length a - 1) (length a) (len - 1) (mul_element_fun a b (len - 2));
assert (not (a *. b).[ len - 1 ]);
assert ((a *. b).[ len - 2 ]);
())
else
if ... | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_mul_associate | val lemma_mul_associate (a b c: poly) : Lemma (a *. (b *. c) =. (a *. b) *. c) | val lemma_mul_associate (a b c: poly) : Lemma (a *. (b *. c) =. (a *. b) *. c) | let lemma_mul_associate (a b c:poly) : Lemma (a *. (b *. c) =. (a *. b) *. c) =
let f (k:nat) : Lemma (mul_element a (b *. c) k == mul_element (a *. b) c k) =
let abc1 (i:int) (j:int) = a.[j] && b.[i - j] && c.[k - i] in
let abc2 (j:int) (i:int) = a.[j] && b.[i - j] && c.[k - i] in
let abc3 (j:int) (i:int... | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 32,
"end_line": 280,
"start_col": 0,
"start_line": 248
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 | a: Vale.Math.Poly2.Defs_s.poly -> b: Vale.Math.Poly2.Defs_s.poly -> c: Vale.Math.Poly2.Defs_s.poly
-> FStar.Pervasives.Lemma (ensures a *. (b *. c) =. a *. b *. c) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Math.Poly2.Defs_s.poly",
"FStar.Classical.forall_intro",
"Prims.nat",
"Prims.eq2",
"Prims.bool",
"Vale.Math.Poly2.Defs_s.mul_element",
"Vale.Math.Poly2.Defs.op_Star_Dot",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Vale.Math.Poly2.Defs_s.mul",
"Prims.Nil",
"FStar.Pervasives.pattern"... | [] | false | false | true | false | false | let lemma_mul_associate (a b c: poly) : Lemma (a *. (b *. c) =. (a *. b) *. c) =
| let f (k: nat) : Lemma (mul_element a (b *. c) k == mul_element (a *. b) c k) =
let abc1 (i j: int) = a.[ j ] && b.[ i - j ] && c.[ k - i ] in
let abc2 (j i: int) = a.[ j ] && b.[ i - j ] && c.[ k - i ] in
let abc3 (j i: int) = a.[ j ] && b.[ i ] && c.[ k - j - i ] in
let sum_abc1 (i: int) = sum_of_bools 0 (i +... | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_sum_swap | val lemma_sum_swap (j k: int) (ff gg: (int -> int -> bool)) (f g: (int -> bool))
: Lemma
(requires
(forall (x: int). {:pattern (f x)}
j <= x /\ x < k ==> f x == sum_of_bools j (j + k - x) (ff x)) /\
(forall (y: int). {:pattern (g y)}
j <= y /\ y < k ==> g y == sum_of_bo... | val lemma_sum_swap (j k: int) (ff gg: (int -> int -> bool)) (f g: (int -> bool))
: Lemma
(requires
(forall (x: int). {:pattern (f x)}
j <= x /\ x < k ==> f x == sum_of_bools j (j + k - x) (ff x)) /\
(forall (y: int). {:pattern (g y)}
j <= y /\ y < k ==> g y == sum_of_bo... | let rec lemma_sum_swap (j k:int) (ff gg:int -> int -> bool) (f g:int -> bool) : Lemma
(requires
(forall (x:int).{:pattern (f x)} j <= x /\ x < k ==> f x == sum_of_bools j (j + k - x) (ff x)) /\
(forall (y:int).{:pattern (g y)} j <= y /\ y < k ==> g y == sum_of_bools j (j + k - y) (gg y)) /\
(forall (x y:i... | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 158,
"start_col": 0,
"start_line": 132
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 |
j: Prims.int ->
k: Prims.int ->
ff: (_: Prims.int -> _: Prims.int -> Prims.bool) ->
gg: (_: Prims.int -> _: Prims.int -> Prims.bool) ->
f: (_: Prims.int -> Prims.bool) ->
g: (_: Prims.int -> Prims.bool)
-> FStar.Pervasives.Lemma
(requires
(forall (x: Prims.int). {:pattern f x}
... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.int",
"Prims.bool",
"Prims.op_LessThan",
"Vale.Math.Poly2.Defs.lemma_sum_of_pairs",
"Prims.unit",
"Vale.Math.Poly2.Defs.lemma_sum_swap",
"Vale.Math.Poly2.Defs.lemma_sum_reverse",
"Prims.op_Subtraction",
"Prims.op_Addition",
"Vale.Math.Poly2.Defs_s.sum_of_bools",
"Prims.l_and",
"Prims.l_... | [
"recursion"
] | false | false | true | false | false | let rec lemma_sum_swap (j k: int) (ff gg: (int -> int -> bool)) (f g: (int -> bool))
: Lemma
(requires
(forall (x: int). {:pattern (f x)}
j <= x /\ x < k ==> f x == sum_of_bools j (j + k - x) (ff x)) /\
(forall (y: int). {:pattern (g y)}
j <= y /\ y < k ==> g y == sum_o... | if (j < k)
then
(let k1 = k - 1 in
let f1 x = sum_of_bools j (j + k1 - x) (ff x) in
let g1 y = sum_of_bools j (j + k1 - y) (gg y) in
let f' x = ff x (j + k1 - x) in
let g' y = gg y (j + k1 - y) in
lemma_sum_reverse j k f' g';
lemma_sum_swap j k1 ff gg f1 g1;
lemma_sum_of_pairs j k1 f f1 f'... | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_mul_distribute_left | val lemma_mul_distribute_left (a b c: poly) : Lemma ((a +. b) *. c =. (a *. c) +. (b *. c)) | val lemma_mul_distribute_left (a b c: poly) : Lemma ((a +. b) *. c =. (a *. c) +. (b *. c)) | let lemma_mul_distribute_left (a b c:poly) : Lemma ((a +. b) *. c =. (a *. c) +. (b *. c)) =
lemma_mul_commute (a +. b) c;
lemma_mul_commute a c;
lemma_mul_commute b c;
lemma_mul_distribute c a b | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 28,
"end_line": 297,
"start_col": 0,
"start_line": 293
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 | a: Vale.Math.Poly2.Defs_s.poly -> b: Vale.Math.Poly2.Defs_s.poly -> c: Vale.Math.Poly2.Defs_s.poly
-> FStar.Pervasives.Lemma (ensures (a +. b) *. c =. a *. c +. b *. c) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Math.Poly2.Defs_s.poly",
"Vale.Math.Poly2.Defs.lemma_mul_distribute",
"Prims.unit",
"Vale.Math.Poly2.Defs.lemma_mul_commute",
"Vale.Math.Poly2.Defs.op_Plus_Dot",
"Prims.l_True",
"Prims.squash",
"Vale.Math.Poly2.Defs.op_Equals_Dot",
"Vale.Math.Poly2.Defs.op_Star_Dot",
"Prims.Nil",
"FStar.Pe... | [] | true | false | true | false | false | let lemma_mul_distribute_left (a b c: poly) : Lemma ((a +. b) *. c =. (a *. c) +. (b *. c)) =
| lemma_mul_commute (a +. b) c;
lemma_mul_commute a c;
lemma_mul_commute b c;
lemma_mul_distribute c a b | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_mod_degree | val lemma_mod_degree (a b: poly)
: Lemma (requires length b > 0) (ensures degree (a %. b) < degree b) (decreases (length a)) | val lemma_mod_degree (a b: poly)
: Lemma (requires length b > 0) (ensures degree (a %. b) < degree b) (decreases (length a)) | let rec lemma_mod_degree (a b:poly) : Lemma
(requires length b > 0)
(ensures degree (a %. b) < degree b)
(decreases (length a))
=
if length a >= length b then
(
let _ = assert (a.[length a - 1]) in
let n = length a - length b in
let a' = add a (shift b n) in
lemma_mod_degree a' b
) | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 431,
"start_col": 0,
"start_line": 420
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 | a: Vale.Math.Poly2.Defs_s.poly -> b: Vale.Math.Poly2.Defs_s.poly
-> FStar.Pervasives.Lemma (requires FStar.Seq.Base.length b > 0)
(ensures Vale.Math.Poly2.Defs_s.degree (a %. b) < Vale.Math.Poly2.Defs_s.degree b)
(decreases FStar.Seq.Base.length a) | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Vale.Math.Poly2.Defs_s.poly",
"Prims.op_GreaterThanOrEqual",
"FStar.Seq.Base.length",
"Prims.bool",
"Vale.Math.Poly2.Defs.lemma_mod_degree",
"Vale.Math.Poly2.Defs_s.add",
"Vale.Math.Poly2.Defs_s.shift",
"Prims.int",
"Prims.op_Subtraction",
"Prims.unit",
"Prims._assert",
"Prims.b2t",
"Vale.M... | [
"recursion"
] | false | false | true | false | false | let rec lemma_mod_degree (a b: poly)
: Lemma (requires length b > 0) (ensures degree (a %. b) < degree b) (decreases (length a)) =
| if length a >= length b
then
(let _ = assert (a.[ length a - 1 ]) in
let n = length a - length b in
let a' = add a (shift b n) in
lemma_mod_degree a' b) | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_shift_is_mul | val lemma_shift_is_mul (a: poly) (n: nat) : Lemma (shift a n =. a *. (monomial n)) | val lemma_shift_is_mul (a: poly) (n: nat) : Lemma (shift a n =. a *. (monomial n)) | let lemma_shift_is_mul (a:poly) (n:nat) : Lemma (shift a n =. a *. (monomial n)) =
let an = shift a n in
let b = monomial n in
let lem (k:nat) : Lemma (an.[k] == mul_element a b k) =
if k < n then
lemma_sum_of_zero 0 k (mul_element_fun a b k)
else
lemma_sum_extend 0 (k - n) (k - n + 1) (k + 1)... | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 34,
"end_line": 308,
"start_col": 0,
"start_line": 299
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 | a: Vale.Math.Poly2.Defs_s.poly -> n: Prims.nat
-> FStar.Pervasives.Lemma
(ensures Vale.Math.Poly2.Defs_s.shift a n =. a *. Vale.Math.Poly2.Defs_s.monomial n) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Math.Poly2.Defs_s.poly",
"Prims.nat",
"FStar.Classical.forall_intro",
"Prims.eq2",
"Prims.bool",
"Vale.Math.Poly2.Defs_s.op_String_Access",
"Vale.Math.Poly2.Defs_s.mul_element",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Vale.Math.Poly2.Defs_s.poly_index",
"Prims.Nil",
"FStar.Perva... | [] | false | false | true | false | false | let lemma_shift_is_mul (a: poly) (n: nat) : Lemma (shift a n =. a *. (monomial n)) =
| let an = shift a n in
let b = monomial n in
let lem (k: nat) : Lemma (an.[ k ] == mul_element a b k) =
if k < n
then lemma_sum_of_zero 0 k (mul_element_fun a b k)
else lemma_sum_extend 0 (k - n) (k - n + 1) (k + 1) (mul_element_fun a b k)
in
FStar.Classical.forall_intro lem | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_div_mod | val lemma_div_mod (a b: poly)
: Lemma (requires length b > 0) (ensures a =. (a /. b) *. b +. (a %. b)) (decreases (length a)) | val lemma_div_mod (a b: poly)
: Lemma (requires length b > 0) (ensures a =. (a /. b) *. b +. (a %. b)) (decreases (length a)) | let rec lemma_div_mod (a b:poly) : Lemma
(requires length b > 0)
(ensures a =. (a /. b) *. b +. (a %. b))
(decreases (length a))
=
if length a < length b then
(
lemma_mul_zero b;
lemma_mul_commute b zero;
()
)
else
(
let _ = assert (a.[length a - 1]) in
let n = length a - length b ... | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 403,
"start_col": 0,
"start_line": 373
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 | a: Vale.Math.Poly2.Defs_s.poly -> b: Vale.Math.Poly2.Defs_s.poly
-> FStar.Pervasives.Lemma (requires FStar.Seq.Base.length b > 0)
(ensures a =. a /. b *. b +. a %. b)
(decreases FStar.Seq.Base.length a) | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Vale.Math.Poly2.Defs_s.poly",
"Prims.op_LessThan",
"FStar.Seq.Base.length",
"Prims.bool",
"Prims.unit",
"Vale.Math.Poly2.Defs.lemma_mul_commute",
"Vale.Math.Poly2.Defs_s.zero",
"Vale.Math.Poly2.Defs.lemma_mul_zero",
"Vale.Math.Poly2.Defs.lemma_mul_distribute_left",
"Vale.Math.Poly2.Defs.op_Slash_... | [
"recursion"
] | false | false | true | false | false | let rec lemma_div_mod (a b: poly)
: Lemma (requires length b > 0) (ensures a =. (a /. b) *. b +. (a %. b)) (decreases (length a)) =
| if length a < length b
then
(lemma_mul_zero b;
lemma_mul_commute b zero;
())
else
(let _ = assert (a.[ length a - 1 ]) in
let n = length a - length b in
let a' = a +. (shift b n) in
let xn = monomial n in
lemma_shift_is_mul b n;
lemma_mul_commute b xn;
lemma_add_move (a' /. b) xn;
... | false |
Vale.Math.Poly2.Defs.fst | Vale.Math.Poly2.Defs.lemma_mul_reverse | val lemma_mul_reverse (a b: poly) (n: nat)
: Lemma (requires degree a <= n /\ degree b <= n)
(ensures reverse (a *. b) (n + n) =. reverse a n *. reverse b n) | val lemma_mul_reverse (a b: poly) (n: nat)
: Lemma (requires degree a <= n /\ degree b <= n)
(ensures reverse (a *. b) (n + n) =. reverse a n *. reverse b n) | let lemma_mul_reverse (a b:poly) (n:nat) : Lemma
(requires degree a <= n /\ degree b <= n)
(ensures reverse (a *. b) (n + n) =. reverse a n *. reverse b n)
=
let ab = a *. b in
let rab = reverse ab (n + n) in
let ra = reverse a n in
let rb = reverse b n in
lemma_mul_degree a b;
lemma_mul_degree ra rb;... | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 40,
"end_line": 367,
"start_col": 0,
"start_line": 336
} | module Vale.Math.Poly2.Defs
open FStar.Mul
open Vale.Def.Prop_s
open FStar.Seq
open Vale.Math.Poly2.Defs_s
unfold let max = FStar.Math.Lib.max
#reset-options "--z3rlimit 10"
let poly_equal (a b:poly) : prop0 =
(forall (i:nat).{:pattern a.[i] \/ b.[i]} a.[i] == b.[i])
unfold let ( =. ) = poly_equal
unfold let ( +. ... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Defs_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lib.fst.checked",
"FStar.Classical.fsti.checked"
],
"i... | [
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Defs_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Prop_s",
"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 | a: Vale.Math.Poly2.Defs_s.poly -> b: Vale.Math.Poly2.Defs_s.poly -> n: Prims.nat
-> FStar.Pervasives.Lemma
(requires Vale.Math.Poly2.Defs_s.degree a <= n /\ Vale.Math.Poly2.Defs_s.degree b <= n)
(ensures
Vale.Math.Poly2.Defs_s.reverse (a *. b) (n + n) =.
Vale.Math.Poly2.Defs_s.reverse a n ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Math.Poly2.Defs_s.poly",
"Prims.nat",
"Vale.Math.Poly2.Defs.lemma_pointwise_equal",
"Vale.Math.Poly2.Defs.op_Star_Dot",
"Prims.int",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"Prims.bool",
"Vale.Math.Poly2.Defs_s.poly_index",
"Vale.Math.Poly2.Defs_s.mul",
"Prims.Nil",
... | [] | false | false | true | false | false | let lemma_mul_reverse (a b: poly) (n: nat)
: Lemma (requires degree a <= n /\ degree b <= n)
(ensures reverse (a *. b) (n + n) =. reverse a n *. reverse b n) =
| let ab = a *. b in
let rab = reverse ab (n + n) in
let ra = reverse a n in
let rb = reverse b n in
lemma_mul_degree a b;
lemma_mul_degree ra rb;
let f (k: int) : Lemma (rab.[ k ] == (ra *. rb).[ k ]) =
if 0 <= k && k <= n + n
then
(let f0 = mul_element_fun ra rb k in
let f1 (i: int) : bool = a.[ n + i ] &... | false |
Vale.X64.Print_Inline_s.fst | Vale.X64.Print_Inline_s.print_code | val print_code (c: code) (n: int) (p: P.printer) : string & int | val print_code (c: code) (n: int) (p: P.printer) : string & int | let rec print_block (b:codes) (n:int) (p:P.printer) : string & int =
match b with
| Nil -> "", n
| Ins (Instr _ _ (AnnotateSpace spaces)) :: Ins (Instr _ _ (AnnotateComment s)) :: tail ->
let head_str = " // " ^ s ^ "\n" in
let rest, n' = print_block tail n p in
print_spaces spaces ^ head_str ^ re... | {
"file_name": "vale/specs/hardware/Vale.X64.Print_Inline_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 46,
"end_line": 298,
"start_col": 0,
"start_line": 258
} | module Vale.X64.Print_Inline_s
open FStar.Mul
open FStar.List.Tot
open Vale.X64.Machine_s
open Vale.X64.Bytes_Code_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Instruction_s
open FStar.IO
open Vale.Interop.Base
open Vale.Interop.X64
module P = Vale.X64.Print_s
let print_rettype (ret_val:option string) = match re... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.check... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Vale.Interop.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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 | c: Vale.X64.Machine_Semantics_s.code -> n: Prims.int -> p: Vale.X64.Print_s.printer
-> Prims.string * Prims.int | Prims.Tot | [
"total"
] | [
"print_block",
"print_code"
] | [
"Vale.X64.Machine_Semantics_s.code",
"Prims.int",
"Vale.X64.Print_s.printer",
"Vale.X64.Bytes_Code_s.instruction_t",
"Vale.X64.Machine_Semantics_s.instr_annotation",
"FStar.Pervasives.Native.Mktuple2",
"Prims.string",
"Prims.op_Hat",
"Vale.X64.Print_Inline_s.print_ins",
"Prims.list",
"Vale.X64.M... | [
"mutual recursion"
] | false | false | false | true | false | let rec print_code (c: code) (n: int) (p: P.printer) : string & int =
| match c with
| Ins ins -> (print_ins ins p ^ "\n", n)
| Block b -> print_block b n p
| IfElse cond true_code false_code ->
let n1 = n in
let n2 = n + 1 in
let cmp = print_cmp (P.cmp_not cond) n1 p in
let true_str, n' = print_code true_code (n + 2) p in
let jmp = " \" jmp L" ^ string_of_int n2 ^ ";\"\n" in... | false |
AuxPredicate.fst | AuxPredicate.my_inv | val my_inv (b: bool) (r: R.ref int) : vprop | val my_inv (b: bool) (r: R.ref int) : vprop | let my_inv (b:bool) (r:R.ref int) : vprop
= exists* v.
R.pts_to r v **
pure ( (v==0 \/ v == 1) /\ b == (v = 0) ) | {
"file_name": "share/steel/examples/pulse/AuxPredicate.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 47,
"end_line": 31,
"start_col": 0,
"start_line": 28
} | (*
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": [
"Pulse.Lib.Reference.fsti.checked",
"Pulse.Lib.Pervasives.fst.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "AuxPredicate.fst"
} | [
{
"abbrev": true,
"full_module": "Pulse.Lib.Reference",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Pulse.Lib.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"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 | b: Prims.bool -> r: Pulse.Lib.Reference.ref Prims.int -> Pulse.Lib.Core.vprop | Prims.Tot | [
"total"
] | [] | [
"Prims.bool",
"Pulse.Lib.Reference.ref",
"Prims.int",
"Pulse.Lib.Core.op_exists_Star",
"Pulse.Lib.Core.op_Star_Star",
"Pulse.Lib.Reference.pts_to",
"PulseCore.FractionalPermission.full_perm",
"Pulse.Lib.Core.pure",
"Prims.l_and",
"Prims.l_or",
"Prims.eq2",
"Prims.op_Equality",
"Pulse.Lib.Cor... | [] | false | false | false | true | false | let my_inv (b: bool) (r: R.ref int) : vprop =
| exists* v. R.pts_to r v ** pure ((v == 0 \/ v == 1) /\ b == (v = 0)) | false |
Hacl.Chacha20Poly1305_128.fst | Hacl.Chacha20Poly1305_128.poly1305_do_128 | val poly1305_do_128 : Hacl.Meta.Chacha20Poly1305.chacha20poly1305_poly1305_do_higher_t Prims.l_True | let poly1305_do_128 = chacha20poly1305_poly1305_do_higher #M128 True poly1305_finish poly1305_init poly1305_padded_128 | {
"file_name": "code/chacha20poly1305/Hacl.Chacha20Poly1305_128.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 118,
"end_line": 16,
"start_col": 0,
"start_line": 16
} | module Hacl.Chacha20Poly1305_128
open Hacl.Meta.Chacha20Poly1305
open Hacl.Impl.Chacha20Poly1305
open Hacl.Impl.Poly1305.Fields
open Hacl.Poly1305_128
#set-options "--z3rlimit 50 --max_fuel 0 --max_ifuel 0"
[@CInline]
private
let poly1305_padded_128 = Hacl.Impl.Chacha20Poly1305.PolyCore.poly1305_padded #M128
[@CInl... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Hacl.Poly1305_128.fsti.checked",
"Hacl.Meta.Chacha20Poly1305.fst.checked",
"Hacl.Impl.Poly1305.Fields.fst.checked",
"Hacl.Impl.Chacha20Poly1305.PolyCore.fst.checked",
"Hacl.Impl.Chacha20Poly1305.fst.checked",
"Hacl.Chacha20.V... | [
{
"abbrev": false,
"full_module": "Hacl.Poly1305_128",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Poly1305.Fields",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Chacha20Poly1305",
"short_module": null
},
{
"abbrev"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Meta.Chacha20Poly1305.chacha20poly1305_poly1305_do_higher_t Prims.l_True | Prims.Tot | [
"total"
] | [] | [
"Hacl.Meta.Chacha20Poly1305.chacha20poly1305_poly1305_do_higher",
"Hacl.Impl.Poly1305.Fields.M128",
"Prims.l_True",
"Hacl.Poly1305_128.poly1305_finish",
"Hacl.Poly1305_128.poly1305_init",
"Hacl.Chacha20Poly1305_128.poly1305_padded_128"
] | [] | false | false | false | true | false | let poly1305_do_128 =
| chacha20poly1305_poly1305_do_higher #M128 True poly1305_finish poly1305_init poly1305_padded_128 | false | |
Hacl.Chacha20Poly1305_128.fst | Hacl.Chacha20Poly1305_128.poly1305_padded_128 | val poly1305_padded_128 : Hacl.Impl.Chacha20Poly1305.PolyCore.poly1305_padded_st Hacl.Impl.Poly1305.Fields.M128 | let poly1305_padded_128 = Hacl.Impl.Chacha20Poly1305.PolyCore.poly1305_padded #M128 | {
"file_name": "code/chacha20poly1305/Hacl.Chacha20Poly1305_128.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 83,
"end_line": 13,
"start_col": 0,
"start_line": 13
} | module Hacl.Chacha20Poly1305_128
open Hacl.Meta.Chacha20Poly1305
open Hacl.Impl.Chacha20Poly1305
open Hacl.Impl.Poly1305.Fields
open Hacl.Poly1305_128
#set-options "--z3rlimit 50 --max_fuel 0 --max_ifuel 0"
[@CInline] | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Hacl.Poly1305_128.fsti.checked",
"Hacl.Meta.Chacha20Poly1305.fst.checked",
"Hacl.Impl.Poly1305.Fields.fst.checked",
"Hacl.Impl.Chacha20Poly1305.PolyCore.fst.checked",
"Hacl.Impl.Chacha20Poly1305.fst.checked",
"Hacl.Chacha20.V... | [
{
"abbrev": false,
"full_module": "Hacl.Poly1305_128",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Poly1305.Fields",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Chacha20Poly1305",
"short_module": null
},
{
"abbrev"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Impl.Chacha20Poly1305.PolyCore.poly1305_padded_st Hacl.Impl.Poly1305.Fields.M128 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Chacha20Poly1305.PolyCore.poly1305_padded",
"Hacl.Impl.Poly1305.Fields.M128"
] | [] | false | false | false | true | false | let poly1305_padded_128 =
| Hacl.Impl.Chacha20Poly1305.PolyCore.poly1305_padded #M128 | false | |
Vale.X64.Print_Inline_s.fst | Vale.X64.Print_Inline_s.remove_blank | val remove_blank (c: code) : code | val remove_blank (c: code) : code | let rec remove_blank (c:code) : code =
match c with
| Ins _ -> c
| Block b -> Block (remove_blanks b)
| IfElse cond ct cf -> IfElse cond (remove_blank ct) (remove_blank cf)
| While cond cb -> While cond (remove_blank cb)
and remove_blanks (b:codes) : codes =
match b with
| [] -> []
| Ins (Instr _ _ (Ann... | {
"file_name": "vale/specs/hardware/Vale.X64.Print_Inline_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 36,
"end_line": 320,
"start_col": 0,
"start_line": 304
} | module Vale.X64.Print_Inline_s
open FStar.Mul
open FStar.List.Tot
open Vale.X64.Machine_s
open Vale.X64.Bytes_Code_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Instruction_s
open FStar.IO
open Vale.Interop.Base
open Vale.Interop.X64
module P = Vale.X64.Print_s
let print_rettype (ret_val:option string) = match re... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.check... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Vale.Interop.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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 | c: Vale.X64.Machine_Semantics_s.code -> Vale.X64.Machine_Semantics_s.code | Prims.Tot | [
"total"
] | [
"remove_blank",
"remove_blanks"
] | [
"Vale.X64.Machine_Semantics_s.code",
"Vale.X64.Bytes_Code_s.instruction_t",
"Vale.X64.Machine_Semantics_s.instr_annotation",
"Prims.list",
"Vale.X64.Machine_s.precode",
"Vale.X64.Bytes_Code_s.ocmp",
"Vale.X64.Machine_s.Block",
"Vale.X64.Print_Inline_s.remove_blanks",
"Vale.X64.Machine_s.IfElse",
"... | [
"mutual recursion"
] | false | false | false | true | false | let rec remove_blank (c: code) : code =
| match c with
| Ins _ -> c
| Block b -> Block (remove_blanks b)
| IfElse cond ct cf -> IfElse cond (remove_blank ct) (remove_blank cf)
| While cond cb -> While cond (remove_blank cb) | false |
Hacl.Chacha20Poly1305_128.fst | Hacl.Chacha20Poly1305_128.decrypt | val decrypt:aead_decrypt_st M128 | val decrypt:aead_decrypt_st M128 | let decrypt : aead_decrypt_st M128 =
chacha20poly1305_aead_decrypt_higher #M128 True Hacl.Chacha20.Vec128.chacha20_encrypt_128 poly1305_do_128 | {
"file_name": "code/chacha20poly1305/Hacl.Chacha20Poly1305_128.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 107,
"end_line": 53,
"start_col": 0,
"start_line": 52
} | module Hacl.Chacha20Poly1305_128
open Hacl.Meta.Chacha20Poly1305
open Hacl.Impl.Chacha20Poly1305
open Hacl.Impl.Poly1305.Fields
open Hacl.Poly1305_128
#set-options "--z3rlimit 50 --max_fuel 0 --max_ifuel 0"
[@CInline]
private
let poly1305_padded_128 = Hacl.Impl.Chacha20Poly1305.PolyCore.poly1305_padded #M128
[@CInl... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Hacl.Poly1305_128.fsti.checked",
"Hacl.Meta.Chacha20Poly1305.fst.checked",
"Hacl.Impl.Poly1305.Fields.fst.checked",
"Hacl.Impl.Chacha20Poly1305.PolyCore.fst.checked",
"Hacl.Impl.Chacha20Poly1305.fst.checked",
"Hacl.Chacha20.V... | [
{
"abbrev": false,
"full_module": "Hacl.Poly1305_128",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Poly1305.Fields",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Chacha20Poly1305",
"short_module": null
},
{
"abbrev"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Impl.Chacha20Poly1305.aead_decrypt_st Hacl.Impl.Poly1305.Fields.M128 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Meta.Chacha20Poly1305.chacha20poly1305_aead_decrypt_higher",
"Hacl.Impl.Poly1305.Fields.M128",
"Prims.l_True",
"Hacl.Chacha20.Vec128.chacha20_encrypt_128",
"Hacl.Chacha20Poly1305_128.poly1305_do_128"
] | [] | false | false | false | true | false | let decrypt:aead_decrypt_st M128 =
| chacha20poly1305_aead_decrypt_higher #M128
True
Hacl.Chacha20.Vec128.chacha20_encrypt_128
poly1305_do_128 | false |
Vale.Arch.BufferFriend.fsti | Vale.Arch.BufferFriend.le_to_n_indexed | val le_to_n_indexed (b: FE.bytes) : nat | val le_to_n_indexed (b: FE.bytes) : nat | let le_to_n_indexed (b:FE.bytes) : nat =
le_to_n_indexed_rec b (length b) | {
"file_name": "vale/code/arch/Vale.Arch.BufferFriend.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 34,
"end_line": 89,
"start_col": 0,
"start_line": 88
} | module Vale.Arch.BufferFriend
module B = LowStar.Buffer
module LI = Lib.IntTypes
module BS = Lib.ByteSequence
module FE = FStar.Endianness
module HS = FStar.HyperStack
module DV = LowStar.BufferView.Down
module UV = LowStar.BufferView.Up
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Mul
open FStar.Seq.Base
... | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Views.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"prims.fst.checked",
"LowStar.BufferView.Up.fsti.checked",
"LowStar.... | [
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"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 | b: FStar.Endianness.bytes -> Prims.nat | Prims.Tot | [
"total"
] | [] | [
"FStar.Endianness.bytes",
"Vale.Arch.BufferFriend.le_to_n_indexed_rec",
"FStar.Seq.Base.length",
"FStar.UInt8.t",
"Prims.nat"
] | [] | false | false | false | true | false | let le_to_n_indexed (b: FE.bytes) : nat =
| le_to_n_indexed_rec b (length b) | false |
Vale.Arch.BufferFriend.fsti | Vale.Arch.BufferFriend.le_to_n_indexed_rec | val le_to_n_indexed_rec (b: FE.bytes) (i: nat{i <= length b}) : nat | val le_to_n_indexed_rec (b: FE.bytes) (i: nat{i <= length b}) : nat | let rec le_to_n_indexed_rec (b:FE.bytes) (i:nat{i <= length b}) : nat =
if i = 0 then 0
else UInt8.v (index b (length b - i)) + pow2 8 * le_to_n_indexed_rec b (i - 1) | {
"file_name": "vale/code/arch/Vale.Arch.BufferFriend.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 80,
"end_line": 86,
"start_col": 0,
"start_line": 84
} | module Vale.Arch.BufferFriend
module B = LowStar.Buffer
module LI = Lib.IntTypes
module BS = Lib.ByteSequence
module FE = FStar.Endianness
module HS = FStar.HyperStack
module DV = LowStar.BufferView.Down
module UV = LowStar.BufferView.Up
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Mul
open FStar.Seq.Base
... | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Views.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"prims.fst.checked",
"LowStar.BufferView.Up.fsti.checked",
"LowStar.... | [
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"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 | b: FStar.Endianness.bytes -> i: Prims.nat{i <= FStar.Seq.Base.length b} -> Prims.nat | Prims.Tot | [
"total"
] | [] | [
"FStar.Endianness.bytes",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Seq.Base.length",
"FStar.UInt8.t",
"Prims.op_Equality",
"Prims.int",
"Prims.bool",
"Prims.op_Addition",
"FStar.UInt8.v",
"FStar.Seq.Base.index",
"Prims.op_Subtraction",
"FStar.Mul.op_Star",
"Prims.pow2... | [
"recursion"
] | false | false | false | false | false | let rec le_to_n_indexed_rec (b: FE.bytes) (i: nat{i <= length b}) : nat =
| if i = 0 then 0 else UInt8.v (index b (length b - i)) + pow2 8 * le_to_n_indexed_rec b (i - 1) | false |
Hacl.Chacha20Poly1305_128.fst | Hacl.Chacha20Poly1305_128.encrypt | val encrypt:aead_encrypt_st M128 | val encrypt:aead_encrypt_st M128 | let encrypt : aead_encrypt_st M128 =
chacha20poly1305_aead_encrypt_higher #M128 True poly1305_do_128 Hacl.Chacha20.Vec128.chacha20_encrypt_128 | {
"file_name": "code/chacha20poly1305/Hacl.Chacha20Poly1305_128.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 107,
"end_line": 32,
"start_col": 0,
"start_line": 31
} | module Hacl.Chacha20Poly1305_128
open Hacl.Meta.Chacha20Poly1305
open Hacl.Impl.Chacha20Poly1305
open Hacl.Impl.Poly1305.Fields
open Hacl.Poly1305_128
#set-options "--z3rlimit 50 --max_fuel 0 --max_ifuel 0"
[@CInline]
private
let poly1305_padded_128 = Hacl.Impl.Chacha20Poly1305.PolyCore.poly1305_padded #M128
[@CInl... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Hacl.Poly1305_128.fsti.checked",
"Hacl.Meta.Chacha20Poly1305.fst.checked",
"Hacl.Impl.Poly1305.Fields.fst.checked",
"Hacl.Impl.Chacha20Poly1305.PolyCore.fst.checked",
"Hacl.Impl.Chacha20Poly1305.fst.checked",
"Hacl.Chacha20.V... | [
{
"abbrev": false,
"full_module": "Hacl.Poly1305_128",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Poly1305.Fields",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Chacha20Poly1305",
"short_module": null
},
{
"abbrev"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Impl.Chacha20Poly1305.aead_encrypt_st Hacl.Impl.Poly1305.Fields.M128 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Meta.Chacha20Poly1305.chacha20poly1305_aead_encrypt_higher",
"Hacl.Impl.Poly1305.Fields.M128",
"Prims.l_True",
"Hacl.Chacha20Poly1305_128.poly1305_do_128",
"Hacl.Chacha20.Vec128.chacha20_encrypt_128"
] | [] | false | false | false | true | false | let encrypt:aead_encrypt_st M128 =
| chacha20poly1305_aead_encrypt_higher #M128
True
poly1305_do_128
Hacl.Chacha20.Vec128.chacha20_encrypt_128 | false |
Vale.X64.Print_Inline_s.fst | Vale.X64.Print_Inline_s.print_inline | val print_inline
(name: string)
(label: int)
(ret_val: option string)
(n: nat)
(args: list td {List.length args = n})
(arg_names: (nat -> string))
(code: code)
(of_arg: (reg_nat (List.length args) -> reg_64))
(regs_mod: (reg_64 -> bool))
(fn_comments: list str... | val print_inline
(name: string)
(label: int)
(ret_val: option string)
(n: nat)
(args: list td {List.length args = n})
(arg_names: (nat -> string))
(code: code)
(of_arg: (reg_nat (List.length args) -> reg_64))
(regs_mod: (reg_64 -> bool))
(fn_comments: list str... | let print_inline
(name:string)
(label:int)
(ret_val:option string)
(n:nat)
(args:list td{List.length args = n})
(arg_names:nat -> string)
(code:code)
(of_arg:reg_nat (List.length args) -> reg_64)
(regs_mod:reg_64 -> bool)
(fn_comments:list string)
: FStar.All.ML int =
let comments = print_fn_com... | {
"file_name": "vale/specs/hardware/Vale.X64.Print_Inline_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 13,
"end_line": 407,
"start_col": 0,
"start_line": 328
} | module Vale.X64.Print_Inline_s
open FStar.Mul
open FStar.List.Tot
open Vale.X64.Machine_s
open Vale.X64.Bytes_Code_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Instruction_s
open FStar.IO
open Vale.Interop.Base
open Vale.Interop.X64
module P = Vale.X64.Print_s
let print_rettype (ret_val:option string) = match re... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.check... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Vale.Interop.X64",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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 |
name: Prims.string ->
label: Prims.int ->
ret_val: FStar.Pervasives.Native.option Prims.string ->
n: Prims.nat ->
args: Prims.list Vale.Interop.Base.td {FStar.List.Tot.Base.length args = n} ->
arg_names: (_: Prims.nat -> Prims.string) ->
code: Vale.X64.Machine_Semantics_s.code ->
of_arg... | FStar.All.ML | [
"ml"
] | [] | [
"Prims.string",
"Prims.int",
"FStar.Pervasives.Native.option",
"Prims.nat",
"Prims.list",
"Vale.Interop.Base.td",
"Prims.b2t",
"Prims.op_Equality",
"FStar.List.Tot.Base.length",
"Vale.X64.Machine_Semantics_s.code",
"Vale.Interop.X64.reg_nat",
"Vale.X64.Machine_s.reg_64",
"Prims.bool",
"Pri... | [] | false | true | false | false | false | let print_inline
(name: string)
(label: int)
(ret_val: option string)
(n: nat)
(args: list td {List.length args = n})
(arg_names: (nat -> string))
(code: code)
(of_arg: (reg_nat (List.length args) -> reg_64))
(regs_mod: (reg_64 -> bool))
(fn_comments: list str... | let comments = print_fn_comments fn_comments in
let reserved_regs = build_reserved_args code (fun _ -> false) in
let inputs_use_rax = uses_rax args 0 of_arg in
if reserved_regs rRax && Some? ret_val
then
FStar.All.failwith "We require the annotation register uint64_t result(rax), but it would be ignored by gcc < 9"
... | false |
Spec.RSAPSS.fst | Spec.RSAPSS.hash_is_supported | val hash_is_supported (a: Hash.hash_alg) : Tot bool | val hash_is_supported (a: Hash.hash_alg) : Tot bool | let hash_is_supported (a:Hash.hash_alg) : Tot bool =
match a with
| Hash.SHA2_256 -> true
| Hash.SHA2_384 -> true
| Hash.SHA2_512 -> true
| _ -> false | {
"file_name": "specs/Spec.RSAPSS.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 14,
"end_line": 36,
"start_col": 0,
"start_line": 31
} | module Spec.RSAPSS
open FStar.Mul
open Lib.IntTypes
open Lib.NatMod
open Lib.Sequence
open Lib.ByteSequence
open Lib.LoopCombinators
module Hash = Spec.Agile.Hash
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
RFC spec of RSA-PSS: https://tools.ietf.org/html/rfc8017#section-8.1
List of supported hash functi... | {
"checked_file": "/",
"dependencies": [
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.Hash",
"short_module": "Hash"
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"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.Hash.Definitions.hash_alg -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.hash_alg",
"Prims.bool"
] | [] | false | false | false | true | false | let hash_is_supported (a: Hash.hash_alg) : Tot bool =
| match a with
| Hash.SHA2_256 -> true
| Hash.SHA2_384 -> true
| Hash.SHA2_512 -> true
| _ -> false | false |
MiniParse.Impl.Int.fst | MiniParse.Impl.Int.parse_u16_impl | val parse_u16_impl:parser_impl parse_u16 | val parse_u16_impl:parser_impl parse_u16 | let parse_u16_impl : parser_impl parse_u16 = make_total_constant_size_parser_impl 2 2ul parse_u16_aux () (fun x ->
let lo = B.index x 0ul in
let hi = B.index x 1ul in
Aux.decode_u16 (lo, hi)
) | {
"file_name": "examples/miniparse/MiniParse.Impl.Int.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 1,
"end_line": 48,
"start_col": 0,
"start_line": 44
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MiniParse.Spec.Int.Aux.fst.checked",
"MiniParse.Spec.Int.fst.checked",
"MiniParse.Impl.Combinators.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.check... | [
{
"abbrev": true,
"full_module": "MiniParse.Spec.Int.Aux",
"short_module": "Aux"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"fu... | {
"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 | MiniParse.Impl.Base.parser_impl MiniParse.Spec.Int.parse_u16 | Prims.Tot | [
"total"
] | [] | [
"MiniParse.Impl.Combinators.make_total_constant_size_parser_impl",
"FStar.UInt32.__uint_to_t",
"FStar.UInt16.t",
"MiniParse.Spec.Int.parse_u16_aux",
"MiniParse.Impl.Base.buffer8",
"Prims.eq2",
"Prims.nat",
"LowStar.Monotonic.Buffer.length",
"FStar.UInt8.t",
"LowStar.Buffer.trivial_preorder",
"Mi... | [] | false | false | false | true | false | let parse_u16_impl:parser_impl parse_u16 =
| make_total_constant_size_parser_impl 2
2ul
parse_u16_aux
()
(fun x ->
let lo = B.index x 0ul in
let hi = B.index x 1ul in
Aux.decode_u16 (lo, hi)) | false |
MiniParse.Impl.Int.fst | MiniParse.Impl.Int.parse_u8_impl | val parse_u8_impl:parser_impl parse_u8 | val parse_u8_impl:parser_impl parse_u8 | let parse_u8_impl : parser_impl parse_u8 = make_total_constant_size_parser_impl 1 1ul (fun x -> Seq.index x 0) () (fun x -> B.index x 0ul) | {
"file_name": "examples/miniparse/MiniParse.Impl.Int.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 138,
"end_line": 27,
"start_col": 0,
"start_line": 27
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MiniParse.Spec.Int.Aux.fst.checked",
"MiniParse.Spec.Int.fst.checked",
"MiniParse.Impl.Combinators.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.check... | [
{
"abbrev": true,
"full_module": "MiniParse.Spec.Int.Aux",
"short_module": "Aux"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"fu... | {
"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 | MiniParse.Impl.Base.parser_impl MiniParse.Spec.Int.parse_u8 | Prims.Tot | [
"total"
] | [] | [
"MiniParse.Impl.Combinators.make_total_constant_size_parser_impl",
"FStar.UInt32.__uint_to_t",
"MiniParse.Spec.Base.byte",
"MiniParse.Spec.Base.bytes",
"Prims.eq2",
"Prims.nat",
"FStar.Seq.Base.length",
"FStar.Seq.Base.index",
"MiniParse.Impl.Base.buffer8",
"LowStar.Monotonic.Buffer.length",
"FS... | [] | false | false | false | true | false | let parse_u8_impl:parser_impl parse_u8 =
| make_total_constant_size_parser_impl 1 1ul (fun x -> Seq.index x 0) () (fun x -> B.index x 0ul) | false |
MiniParse.Impl.Int.fst | MiniParse.Impl.Int.serialize_bounded_u16_impl | val serialize_bounded_u16_impl (b: nat) : Tot (serializer_impl (serialize_bounded_u16 b)) | val serialize_bounded_u16_impl (b: nat) : Tot (serializer_impl (serialize_bounded_u16 b)) | let serialize_bounded_u16_impl (b: nat) : Tot (serializer_impl (serialize_bounded_u16 b)) =
fun output len x -> serialize_u16_impl output len x | {
"file_name": "examples/miniparse/MiniParse.Impl.Int.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 87,
"start_col": 0,
"start_line": 86
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MiniParse.Spec.Int.Aux.fst.checked",
"MiniParse.Spec.Int.fst.checked",
"MiniParse.Impl.Combinators.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.check... | [
{
"abbrev": true,
"full_module": "MiniParse.Spec.Int.Aux",
"short_module": "Aux"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"fu... | {
"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: Prims.nat -> MiniParse.Impl.Base.serializer_impl (MiniParse.Spec.Int.serialize_bounded_u16 b) | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"MiniParse.Impl.Base.buffer8",
"FStar.UInt32.t",
"Prims.eq2",
"LowStar.Monotonic.Buffer.len",
"FStar.UInt8.t",
"LowStar.Buffer.trivial_preorder",
"MiniParse.Spec.Int.bounded_u16",
"MiniParse.Impl.Int.serialize_u16_impl",
"FStar.Pervasives.Native.option",
"MiniParse.Impl.Base.seriali... | [] | false | false | false | false | false | let serialize_bounded_u16_impl (b: nat) : Tot (serializer_impl (serialize_bounded_u16 b)) =
| fun output len x -> serialize_u16_impl output len x | false |
Spec.RSAPSS.fst | Spec.RSAPSS.xor_bytes | val xor_bytes: #len:size_pos -> b1:lbytes len -> b2:lbytes len -> Tot (lbytes len) | val xor_bytes: #len:size_pos -> b1:lbytes len -> b2:lbytes len -> Tot (lbytes len) | let xor_bytes #len b1 b2 = map2 (fun x y -> x ^. y) b1 b2 | {
"file_name": "specs/Spec.RSAPSS.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 57,
"end_line": 29,
"start_col": 0,
"start_line": 29
} | module Spec.RSAPSS
open FStar.Mul
open Lib.IntTypes
open Lib.NatMod
open Lib.Sequence
open Lib.ByteSequence
open Lib.LoopCombinators
module Hash = Spec.Agile.Hash
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
RFC spec of RSA-PSS: https://tools.ietf.org/html/rfc8017#section-8.1
List of supported hash functi... | {
"checked_file": "/",
"dependencies": [
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.Hash",
"short_module": "Hash"
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"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 | b1: Lib.ByteSequence.lbytes len -> b2: Lib.ByteSequence.lbytes len -> Lib.ByteSequence.lbytes len | Prims.Tot | [
"total"
] | [] | [
"Lib.IntTypes.size_pos",
"Lib.ByteSequence.lbytes",
"Lib.Sequence.map2",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Lib.IntTypes.op_Hat_Dot"
] | [] | false | false | false | false | false | let xor_bytes #len b1 b2 =
| map2 (fun x y -> x ^. y) b1 b2 | false |
MiniParse.Impl.Int.fst | MiniParse.Impl.Int.serialize_u8_impl | val serialize_u8_impl:serializer_impl serialize_u8 | val serialize_u8_impl:serializer_impl serialize_u8 | let serialize_u8_impl : serializer_impl serialize_u8 =
(fun output (len: U32.t { len == B.len output } ) x ->
let h = HST.get () in
if len `U32.lt` 1ul
then None
else begin
let output' = B.sub output 0ul 1ul in
B.upd output' 0ul x;
let h' = HST.get () in
assert (B.as_seq h' out... | {
"file_name": "examples/miniparse/MiniParse.Impl.Int.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 8,
"end_line": 41,
"start_col": 0,
"start_line": 30
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MiniParse.Spec.Int.Aux.fst.checked",
"MiniParse.Spec.Int.fst.checked",
"MiniParse.Impl.Combinators.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.check... | [
{
"abbrev": true,
"full_module": "MiniParse.Spec.Int.Aux",
"short_module": "Aux"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"fu... | {
"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 | MiniParse.Impl.Base.serializer_impl MiniParse.Spec.Int.serialize_u8 | Prims.Tot | [
"total"
] | [] | [
"MiniParse.Impl.Base.buffer8",
"FStar.UInt32.t",
"Prims.eq2",
"LowStar.Monotonic.Buffer.len",
"FStar.UInt8.t",
"LowStar.Buffer.trivial_preorder",
"FStar.UInt32.lt",
"FStar.UInt32.__uint_to_t",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.option",
"Prims.bool",
"FStar.Pervasives.Nat... | [] | false | false | false | true | false | let serialize_u8_impl:serializer_impl serialize_u8 =
| (fun output (len: U32.t{len == B.len output}) x ->
let h = HST.get () in
if len `U32.lt` 1ul
then None
else
let output' = B.sub output 0ul 1ul in
B.upd output' 0ul x;
let h' = HST.get () in
assert ((B.as_seq h' output') `Seq.equal` (Seq.create 1 x));
Some 1ul) | false |
Spec.RSAPSS.fst | Spec.RSAPSS.mgf_hash_a | val mgf_hash_a : len: Lib.IntTypes.size_nat{len + 4 <= Lib.IntTypes.max_size_t} ->
n: Prims.pos ->
i: Prims.nat{i <= n}
-> Type0 | let mgf_hash_a (len:size_nat{len + 4 <= max_size_t}) (n:pos) (i:nat{i <= n}) = lbytes (len + 4) | {
"file_name": "specs/Spec.RSAPSS.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 95,
"end_line": 52,
"start_col": 0,
"start_line": 52
} | module Spec.RSAPSS
open FStar.Mul
open Lib.IntTypes
open Lib.NatMod
open Lib.Sequence
open Lib.ByteSequence
open Lib.LoopCombinators
module Hash = Spec.Agile.Hash
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
RFC spec of RSA-PSS: https://tools.ietf.org/html/rfc8017#section-8.1
List of supported hash functi... | {
"checked_file": "/",
"dependencies": [
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.Hash",
"short_module": "Hash"
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"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_nat{len + 4 <= Lib.IntTypes.max_size_t} ->
n: Prims.pos ->
i: Prims.nat{i <= n}
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"Lib.IntTypes.size_nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Lib.IntTypes.max_size_t",
"Prims.pos",
"Prims.nat",
"Lib.ByteSequence.lbytes"
] | [] | false | false | false | false | true | let mgf_hash_a (len: size_nat{len + 4 <= max_size_t}) (n: pos) (i: nat{i <= n}) =
| lbytes (len + 4) | false | |
Vale.Transformers.MovbeElim.fst | Vale.Transformers.MovbeElim.movbe_elim_ph | val movbe_elim_ph : Vale.Transformers.PeepHole.pre_peephole | let movbe_elim_ph = {
ph = (function
| [Instr i oprs (AnnotateMovbe64 proof_of_movbe)] ->
let oprs:normal (instr_operands_t [out op64] [op64]) =
coerce_to_normal #(instr_operands_t [out op64] [op64]) oprs in
let (dst, (src, ())) = oprs in
if OReg? dst then (
let mov =... | {
"file_name": "vale/code/lib/transformers/Vale.Transformers.MovbeElim.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 1,
"end_line": 27,
"start_col": 0,
"start_line": 14
} | module Vale.Transformers.MovbeElim
open Vale.X64.Bytes_Code_s
open Vale.X64.Instruction_s
open Vale.X64.Instructions_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Machine_s
open Vale.X64.Print_s
open Vale.Transformers.InstructionReorder
open Vale.X64.InsLemmas
open Vale.Transformers.PeepHole | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.InsLemmas.fsti.checked",
"Vale.X64.CPU_Features_... | [
{
"abbrev": false,
"full_module": "Vale.Transformers.PeepHole",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsLemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Transformers.InstructionReorder",
"short_module": null
},
{
... | {
"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 | Vale.Transformers.PeepHole.pre_peephole | Prims.Tot | [
"total"
] | [] | [
"Vale.Transformers.PeepHole.Mkpre_peephole",
"Prims.list",
"Vale.X64.Machine_Semantics_s.ins",
"Vale.X64.Instruction_s.instr_t_record",
"Vale.X64.Instruction_s.instr_operands_t",
"Vale.X64.Instruction_s.__proj__InstrTypeRecord__item__outs",
"Vale.X64.Instruction_s.__proj__InstrTypeRecord__item__args",
... | [] | false | false | false | true | false | let movbe_elim_ph =
| {
ph
=
(function
| [Instr i oprs (AnnotateMovbe64 proof_of_movbe)] ->
let oprs:normal (instr_operands_t [out op64] [op64]) =
coerce_to_normal #(instr_operands_t [out op64] [op64]) oprs
in
let dst, (src, ()) = oprs in
if OReg? dst
then
(let mov = make_instr ins_Mov... | false | |
Spec.RSAPSS.fst | Spec.RSAPSS.blocks | val blocks: x:size_pos -> m:size_pos -> Tot (r:size_pos{x <= m * r}) | val blocks: x:size_pos -> m:size_pos -> Tot (r:size_pos{x <= m * r}) | let blocks x m = (x - 1) / m + 1 | {
"file_name": "specs/Spec.RSAPSS.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 32,
"end_line": 26,
"start_col": 0,
"start_line": 26
} | module Spec.RSAPSS
open FStar.Mul
open Lib.IntTypes
open Lib.NatMod
open Lib.Sequence
open Lib.ByteSequence
open Lib.LoopCombinators
module Hash = Spec.Agile.Hash
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
RFC spec of RSA-PSS: https://tools.ietf.org/html/rfc8017#section-8.1
List of supported hash functi... | {
"checked_file": "/",
"dependencies": [
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.Hash",
"short_module": "Hash"
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Lib.IntTypes.size_pos -> m: Lib.IntTypes.size_pos -> r: Lib.IntTypes.size_pos{x <= m * r} | Prims.Tot | [
"total"
] | [] | [
"Lib.IntTypes.size_pos",
"Prims.op_Addition",
"Prims.op_Division",
"Prims.op_Subtraction",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star"
] | [] | false | false | false | false | false | let blocks x m =
| (x - 1) / m + 1 | false |
Spec.RSAPSS.fst | Spec.RSAPSS.i2osp | val i2osp: len:size_nat -> n:nat{n < pow2 (8 * len)} -> Tot (lbytes len) | val i2osp: len:size_nat -> n:nat{n < pow2 (8 * len)} -> Tot (lbytes len) | let i2osp len n = nat_to_intseq_be len n | {
"file_name": "specs/Spec.RSAPSS.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 40,
"end_line": 76,
"start_col": 0,
"start_line": 76
} | module Spec.RSAPSS
open FStar.Mul
open Lib.IntTypes
open Lib.NatMod
open Lib.Sequence
open Lib.ByteSequence
open Lib.LoopCombinators
module Hash = Spec.Agile.Hash
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
RFC spec of RSA-PSS: https://tools.ietf.org/html/rfc8017#section-8.1
List of supported hash functi... | {
"checked_file": "/",
"dependencies": [
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.Hash",
"short_module": "Hash"
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"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_nat -> n: Prims.nat{n < Prims.pow2 (8 * len)} -> Lib.ByteSequence.lbytes len | Prims.Tot | [
"total"
] | [] | [
"Lib.IntTypes.size_nat",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"FStar.Mul.op_Star",
"Lib.ByteSequence.nat_to_intseq_be",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Lib.ByteSequence.lbytes"
] | [] | false | false | false | false | false | let i2osp len n =
| nat_to_intseq_be len n | false |
MiniParse.Impl.Int.fst | MiniParse.Impl.Int.serialize_u16_impl | val serialize_u16_impl:serializer_impl serialize_u16 | val serialize_u16_impl:serializer_impl serialize_u16 | let serialize_u16_impl : serializer_impl serialize_u16 =
fun output (len: U32.t { len == B.len output } ) x ->
if len `U32.lt` 2ul
then None
else begin
let (lo, hi) = Aux.encode_u16 x in
let output' = B.sub output 0ul 2ul in
B.upd output' 0ul lo;
B.upd output' 1ul hi;
let h' ... | {
"file_name": "examples/miniparse/MiniParse.Impl.Int.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 7,
"end_line": 63,
"start_col": 0,
"start_line": 51
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MiniParse.Spec.Int.Aux.fst.checked",
"MiniParse.Spec.Int.fst.checked",
"MiniParse.Impl.Combinators.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.check... | [
{
"abbrev": true,
"full_module": "MiniParse.Spec.Int.Aux",
"short_module": "Aux"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"fu... | {
"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 | MiniParse.Impl.Base.serializer_impl MiniParse.Spec.Int.serialize_u16 | Prims.Tot | [
"total"
] | [] | [
"MiniParse.Impl.Base.buffer8",
"FStar.UInt32.t",
"Prims.eq2",
"LowStar.Monotonic.Buffer.len",
"FStar.UInt8.t",
"LowStar.Buffer.trivial_preorder",
"FStar.UInt16.t",
"FStar.UInt32.lt",
"FStar.UInt32.__uint_to_t",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.option",
"Prims.bool",
"... | [] | false | false | false | true | false | let serialize_u16_impl:serializer_impl serialize_u16 =
| fun output (len: U32.t{len == B.len output}) x ->
if len `U32.lt` 2ul
then None
else
let lo, hi = Aux.encode_u16 x in
let output' = B.sub output 0ul 2ul in
B.upd output' 0ul lo;
B.upd output' 1ul hi;
let h' = HST.get () in
assert ((B.as_seq h' output') `Seq.equal` (Seq.append (Seq.create 1... | false |
Spec.RSAPSS.fst | Spec.RSAPSS.os2ip | val os2ip: #len:size_nat -> b:lbytes len -> Tot (res:nat{res < pow2 (8 * len)}) | val os2ip: #len:size_nat -> b:lbytes len -> Tot (res:nat{res < pow2 (8 * len)}) | let os2ip #len b = nat_from_bytes_be b | {
"file_name": "specs/Spec.RSAPSS.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 38,
"end_line": 73,
"start_col": 0,
"start_line": 73
} | module Spec.RSAPSS
open FStar.Mul
open Lib.IntTypes
open Lib.NatMod
open Lib.Sequence
open Lib.ByteSequence
open Lib.LoopCombinators
module Hash = Spec.Agile.Hash
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
RFC spec of RSA-PSS: https://tools.ietf.org/html/rfc8017#section-8.1
List of supported hash functi... | {
"checked_file": "/",
"dependencies": [
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.Hash",
"short_module": "Hash"
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"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 | b: Lib.ByteSequence.lbytes len -> res: Prims.nat{res < Prims.pow2 (8 * len)} | Prims.Tot | [
"total"
] | [] | [
"Lib.IntTypes.size_nat",
"Lib.ByteSequence.lbytes",
"Lib.ByteSequence.nat_from_bytes_be",
"Lib.IntTypes.SEC",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"FStar.Mul.op_Star"
] | [] | false | false | false | false | false | let os2ip #len b =
| nat_from_bytes_be b | false |
Spec.RSAPSS.fst | Spec.RSAPSS.rsapss_verify | val rsapss_verify:
a:Hash.hash_alg{hash_is_supported a}
-> modBits:modBits_t
-> pkey:rsapss_pkey modBits
-> sLen:size_nat
-> k:size_nat
-> sgnt:lbytes k
-> msgLen:nat
-> msg:bytes{length msg == msgLen} ->
Tot bool | val rsapss_verify:
a:Hash.hash_alg{hash_is_supported a}
-> modBits:modBits_t
-> pkey:rsapss_pkey modBits
-> sLen:size_nat
-> k:size_nat
-> sgnt:lbytes k
-> msgLen:nat
-> msg:bytes{length msg == msgLen} ->
Tot bool | let rsapss_verify a modBits pkey sLen k sgnt msgLen msg =
let b =
sLen + Hash.hash_length a + 8 <= max_size_t &&
(sLen + Hash.hash_length a + 8) `Hash.less_than_max_input_length` a &&
msgLen `Hash.less_than_max_input_length` a &&
k = blocks modBits 8 in
if b then
rsapss_verify_ a modBits pkey s... | {
"file_name": "specs/Spec.RSAPSS.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 9,
"end_line": 359,
"start_col": 0,
"start_line": 349
} | module Spec.RSAPSS
open FStar.Mul
open Lib.IntTypes
open Lib.NatMod
open Lib.Sequence
open Lib.ByteSequence
open Lib.LoopCombinators
module Hash = Spec.Agile.Hash
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
RFC spec of RSA-PSS: https://tools.ietf.org/html/rfc8017#section-8.1
List of supported hash functi... | {
"checked_file": "/",
"dependencies": [
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.Hash",
"short_module": "Hash"
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"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.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} ->
modBits: Spec.RSAPSS.modBits_t ->
pkey: Spec.RSAPSS.rsapss_pkey modBits ->
sLen: Lib.IntTypes.size_nat ->
k: Lib.IntTypes.size_nat ->
sgnt: Lib.ByteSequence.lbytes k ->
msgLen: Prims.nat ->
msg: Lib.ByteSequence.bytes... | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.hash_alg",
"Prims.b2t",
"Spec.RSAPSS.hash_is_supported",
"Spec.RSAPSS.modBits_t",
"Spec.RSAPSS.rsapss_pkey",
"Lib.IntTypes.size_nat",
"Lib.ByteSequence.lbytes",
"Prims.nat",
"Lib.ByteSequence.bytes",
"Prims.eq2",
"Lib.Sequence.length",
"Lib.IntTypes.uint_t",
"Lib.IntTy... | [] | false | false | false | false | false | let rsapss_verify a modBits pkey sLen k sgnt msgLen msg =
| let b =
sLen + Hash.hash_length a + 8 <= max_size_t &&
(sLen + Hash.hash_length a + 8)
`Hash.less_than_max_input_length`
a &&
msgLen
`Hash.less_than_max_input_length`
a &&
k = blocks modBits 8
in
if b then rsapss_verify_ a modBits pkey sLen sgnt msgLen msg else false | false |
Vale.Transformers.MovbeElim.fst | Vale.Transformers.MovbeElim.lemma_movbe_is_mov_bswap | val lemma_movbe_is_mov_bswap (dst src: operand64) (s: machine_state)
: Lemma (requires (OReg? dst))
(ensures
(let movbe = make_instr_annotate ins_MovBe64 (AnnotateMovbe64 ()) dst src in
let mov = make_instr ins_Mov64 dst src in
let bswap = make_instr ins_Bswap64 dst in
le... | val lemma_movbe_is_mov_bswap (dst src: operand64) (s: machine_state)
: Lemma (requires (OReg? dst))
(ensures
(let movbe = make_instr_annotate ins_MovBe64 (AnnotateMovbe64 ()) dst src in
let mov = make_instr ins_Mov64 dst src in
let bswap = make_instr ins_Bswap64 dst in
le... | let lemma_movbe_is_mov_bswap (dst src:operand64) (s:machine_state) :
Lemma
(requires (OReg? dst))
(ensures (
let movbe = make_instr_annotate ins_MovBe64 (AnnotateMovbe64 ()) dst src in
let mov = make_instr ins_Mov64 dst src in
let bswap = make_instr ins_Bswap64 dst in
let s1 = ... | {
"file_name": "vale/code/lib/transformers/Vale.Transformers.MovbeElim.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 70,
"start_col": 0,
"start_line": 33
} | module Vale.Transformers.MovbeElim
open Vale.X64.Bytes_Code_s
open Vale.X64.Instruction_s
open Vale.X64.Instructions_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Machine_s
open Vale.X64.Print_s
open Vale.Transformers.InstructionReorder
open Vale.X64.InsLemmas
open Vale.Transformers.PeepHole
let movbe_elim_ph = ... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.InsLemmas.fsti.checked",
"Vale.X64.CPU_Features_... | [
{
"abbrev": true,
"full_module": "Vale.Arch.Heap",
"short_module": "H"
},
{
"abbrev": true,
"full_module": "Vale.Def.Types_s",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "Vale.Transformers.PeepHole",
"short_module": null
},
{
"abbrev": false,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 2,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
dst: Vale.X64.Machine_s.operand64 ->
src: Vale.X64.Machine_s.operand64 ->
s: Vale.X64.Machine_Semantics_s.machine_state
-> FStar.Pervasives.Lemma (requires OReg? dst)
(ensures
(let movbe =
Vale.X64.InsLemmas.make_instr_annotate Vale.X64.Instructions_s.ins_MovBe64
(... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.X64.Machine_s.operand64",
"Vale.X64.Machine_Semantics_s.machine_state",
"Prims.op_AmpAmp",
"Vale.X64.Machine_Semantics_s.valid_src_operand64_and_taint",
"Vale.X64.Machine_Semantics_s.valid_dst_operand64",
"Vale.X64.Machine_Semantics_s.__proj__Mkmachine_state__item__ms_ok",
"Vale.Transformers.PeepH... | [] | false | false | true | false | false | let lemma_movbe_is_mov_bswap (dst src: operand64) (s: machine_state)
: Lemma (requires (OReg? dst))
(ensures
(let movbe = make_instr_annotate ins_MovBe64 (AnnotateMovbe64 ()) dst src in
let mov = make_instr ins_Mov64 dst src in
let bswap = make_instr ins_Bswap64 dst in
le... | let movbe = make_instr_annotate ins_MovBe64 (AnnotateMovbe64 ()) dst src in
let mov = make_instr ins_Mov64 dst src in
let bswap = make_instr ins_Bswap64 dst in
let s_movbe = machine_eval_ins movbe s in
let s_mov = machine_eval_ins mov s in
let s_bswap = machine_eval_ins bswap s_mov in
if valid_src_operand64_and_taint s... | false |
Spec.RSAPSS.fst | Spec.RSAPSS.db_zero | val db_zero: #len:size_pos -> db:lbytes len -> emBits:size_nat ->
Pure (lbytes len)
(requires True)
(ensures fun res ->
(v res.[0] == (if emBits % 8 > 0 then v db.[0] % pow2 (emBits % 8) else v db.[0]))) | val db_zero: #len:size_pos -> db:lbytes len -> emBits:size_nat ->
Pure (lbytes len)
(requires True)
(ensures fun res ->
(v res.[0] == (if emBits % 8 > 0 then v db.[0] % pow2 (emBits % 8) else v db.[0]))) | let db_zero #len db emBits =
let msBits = emBits % 8 in
if msBits > 0 then begin
let r = db.[0] <- db.[0] &. (u8 0xff >>. size (8 - msBits)) in
Math.Lemmas.pow2_plus msBits (8 - msBits);
logand_mask db.[0] (u8 0xff >>. size (8 - msBits)) msBits;
r end
else db | {
"file_name": "specs/Spec.RSAPSS.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 9,
"end_line": 104,
"start_col": 0,
"start_line": 97
} | module Spec.RSAPSS
open FStar.Mul
open Lib.IntTypes
open Lib.NatMod
open Lib.Sequence
open Lib.ByteSequence
open Lib.LoopCombinators
module Hash = Spec.Agile.Hash
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
RFC spec of RSA-PSS: https://tools.ietf.org/html/rfc8017#section-8.1
List of supported hash functi... | {
"checked_file": "/",
"dependencies": [
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.Hash",
"short_module": "Hash"
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"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 | db: Lib.ByteSequence.lbytes len -> emBits: Lib.IntTypes.size_nat
-> Prims.Pure (Lib.ByteSequence.lbytes len) | Prims.Pure | [] | [] | [
"Lib.IntTypes.size_pos",
"Lib.ByteSequence.lbytes",
"Lib.IntTypes.size_nat",
"Prims.op_GreaterThan",
"Prims.unit",
"Lib.IntTypes.logand_mask",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Lib.Sequence.op_String_Access",
"Lib.IntTypes.uint_t",
"Lib.IntTypes.op_Greater_Greater_Dot",
"Lib.IntTypes.u8"... | [] | false | false | false | false | false | let db_zero #len db emBits =
| let msBits = emBits % 8 in
if msBits > 0
then
let r = db.[ 0 ] <- db.[ 0 ] &. (u8 0xff >>. size (8 - msBits)) in
Math.Lemmas.pow2_plus msBits (8 - msBits);
logand_mask db.[ 0 ] (u8 0xff >>. size (8 - msBits)) msBits;
r
else db | false |
Spec.RSAPSS.fst | Spec.RSAPSS.mgf_hash_f | val mgf_hash_f:
a:Hash.hash_alg{hash_is_supported a}
-> len:size_nat{len + 4 <= max_size_t /\ (len + 4) `Hash.less_than_max_input_length` a}
-> i:size_nat
-> mgfseed_counter:lbytes (len + 4) ->
lbytes (len + 4) & lbytes (Hash.hash_length a) | val mgf_hash_f:
a:Hash.hash_alg{hash_is_supported a}
-> len:size_nat{len + 4 <= max_size_t /\ (len + 4) `Hash.less_than_max_input_length` a}
-> i:size_nat
-> mgfseed_counter:lbytes (len + 4) ->
lbytes (len + 4) & lbytes (Hash.hash_length a) | let mgf_hash_f a len i mgfseed_counter =
let counter = nat_to_intseq_be 4 i in
let mgfseed_counter = update_sub mgfseed_counter len 4 counter in
let block = Hash.hash a mgfseed_counter in
mgfseed_counter, block | {
"file_name": "specs/Spec.RSAPSS.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 24,
"end_line": 50,
"start_col": 0,
"start_line": 46
} | module Spec.RSAPSS
open FStar.Mul
open Lib.IntTypes
open Lib.NatMod
open Lib.Sequence
open Lib.ByteSequence
open Lib.LoopCombinators
module Hash = Spec.Agile.Hash
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
RFC spec of RSA-PSS: https://tools.ietf.org/html/rfc8017#section-8.1
List of supported hash functi... | {
"checked_file": "/",
"dependencies": [
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.Hash",
"short_module": "Hash"
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"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.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} ->
len:
Lib.IntTypes.size_nat
{ len + 4 <= Lib.IntTypes.max_size_t /\
Spec.Hash.Definitions.less_than_max_input_length (len + 4) a } ->
i: Lib.IntTypes.size_nat ->
mgfseed_counter: Lib.ByteSequence.lbytes (len + ... | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.hash_alg",
"Prims.b2t",
"Spec.RSAPSS.hash_is_supported",
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Lib.IntTypes.max_size_t",
"Spec.Hash.Definitions.less_than_max_input_length",
"Lib.ByteSequence.lbytes",
"FStar.Pervasives.Nat... | [] | false | false | false | false | false | let mgf_hash_f a len i mgfseed_counter =
| let counter = nat_to_intseq_be 4 i in
let mgfseed_counter = update_sub mgfseed_counter len 4 counter in
let block = Hash.hash a mgfseed_counter in
mgfseed_counter, block | false |
Spec.RSAPSS.fst | Spec.RSAPSS.rsapss_sign | val rsapss_sign:
a:Hash.hash_alg{hash_is_supported a}
-> modBits:modBits_t
-> skey:rsapss_skey modBits
-> sLen:size_nat
-> salt:lbytes sLen
-> msgLen:nat
-> msg:bytes{length msg == msgLen} ->
option (lbytes (blocks modBits 8)) | val rsapss_sign:
a:Hash.hash_alg{hash_is_supported a}
-> modBits:modBits_t
-> skey:rsapss_skey modBits
-> sLen:size_nat
-> salt:lbytes sLen
-> msgLen:nat
-> msg:bytes{length msg == msgLen} ->
option (lbytes (blocks modBits 8)) | let rsapss_sign a modBits skey sLen salt msgLen msg =
let b =
sLen + Hash.hash_length a + 8 <= max_size_t &&
(sLen + Hash.hash_length a + 8) `Hash.less_than_max_input_length` a &&
msgLen `Hash.less_than_max_input_length` a &&
sLen + Hash.hash_length a + 2 <= blocks (modBits - 1) 8 in
if b then begi... | {
"file_name": "specs/Spec.RSAPSS.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 8,
"end_line": 304,
"start_col": 0,
"start_line": 293
} | module Spec.RSAPSS
open FStar.Mul
open Lib.IntTypes
open Lib.NatMod
open Lib.Sequence
open Lib.ByteSequence
open Lib.LoopCombinators
module Hash = Spec.Agile.Hash
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
RFC spec of RSA-PSS: https://tools.ietf.org/html/rfc8017#section-8.1
List of supported hash functi... | {
"checked_file": "/",
"dependencies": [
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.Hash",
"short_module": "Hash"
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"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.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} ->
modBits: Spec.RSAPSS.modBits_t ->
skey: Spec.RSAPSS.rsapss_skey modBits ->
sLen: Lib.IntTypes.size_nat ->
salt: Lib.ByteSequence.lbytes sLen ->
msgLen: Prims.nat ->
msg: Lib.ByteSequence.bytes{Lib.Sequence.length msg == m... | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.hash_alg",
"Prims.b2t",
"Spec.RSAPSS.hash_is_supported",
"Spec.RSAPSS.modBits_t",
"Spec.RSAPSS.rsapss_skey",
"Lib.IntTypes.size_nat",
"Lib.ByteSequence.lbytes",
"Prims.nat",
"Lib.ByteSequence.bytes",
"Prims.eq2",
"Lib.Sequence.length",
"Lib.IntTypes.uint_t",
"Lib.IntTy... | [] | false | false | false | false | false | let rsapss_sign a modBits skey sLen salt msgLen msg =
| let b =
sLen + Hash.hash_length a + 8 <= max_size_t &&
(sLen + Hash.hash_length a + 8)
`Hash.less_than_max_input_length`
a &&
msgLen
`Hash.less_than_max_input_length`
a &&
sLen + Hash.hash_length a + 2 <= blocks (modBits - 1) 8
in
if b
then
let eq_m, sgnt = rsapss_sign_ a modBits skey sLen salt msgLen... | false |
Vale.Transformers.MovbeElim.fst | Vale.Transformers.MovbeElim.movbe_elim_correct | val movbe_elim_correct (is: list ins) (s: machine_state)
: Lemma (peephole_correct movbe_elim_ph is s) [SMTPat (peephole_correct movbe_elim_ph is s)] | val movbe_elim_correct (is: list ins) (s: machine_state)
: Lemma (peephole_correct movbe_elim_ph is s) [SMTPat (peephole_correct movbe_elim_ph is s)] | let movbe_elim_correct (is:list ins) (s:machine_state) :
Lemma (peephole_correct movbe_elim_ph is s)
[SMTPat (peephole_correct movbe_elim_ph is s)] =
match is with
| [Instr i oprs (AnnotateMovbe64 proof_of_movbe)] ->
let oprs:normal (instr_operands_t [out op64] [op64]) =
coerce_to_normal #(instr_ope... | {
"file_name": "vale/code/lib/transformers/Vale.Transformers.MovbeElim.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 11,
"end_line": 86,
"start_col": 0,
"start_line": 74
} | module Vale.Transformers.MovbeElim
open Vale.X64.Bytes_Code_s
open Vale.X64.Instruction_s
open Vale.X64.Instructions_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Machine_s
open Vale.X64.Print_s
open Vale.Transformers.InstructionReorder
open Vale.X64.InsLemmas
open Vale.Transformers.PeepHole
let movbe_elim_ph = ... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.InsLemmas.fsti.checked",
"Vale.X64.CPU_Features_... | [
{
"abbrev": true,
"full_module": "Vale.Arch.Heap",
"short_module": "H"
},
{
"abbrev": true,
"full_module": "Vale.Def.Types_s",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "Vale.Transformers.PeepHole",
"short_module": null
},
{
"abbrev": false,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 3,
"initial_ifuel": 0,
"max_fuel": 3,
"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 | is: Prims.list Vale.X64.Machine_Semantics_s.ins -> s: Vale.X64.Machine_Semantics_s.machine_state
-> FStar.Pervasives.Lemma
(ensures
Vale.Transformers.PeepHole.peephole_correct Vale.Transformers.MovbeElim.movbe_elim_ph is s)
[
SMTPat (Vale.Transformers.PeepHole.peephole_correct Vale.Transfo... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"Vale.X64.Machine_Semantics_s.ins",
"Vale.X64.Machine_Semantics_s.machine_state",
"Vale.X64.Instruction_s.instr_t_record",
"Vale.X64.Instruction_s.instr_operands_t",
"Vale.X64.Instruction_s.__proj__InstrTypeRecord__item__outs",
"Vale.X64.Instruction_s.__proj__InstrTypeRecord__item__args",
... | [] | false | false | true | false | false | let movbe_elim_correct (is: list ins) (s: machine_state)
: Lemma (peephole_correct movbe_elim_ph is s) [SMTPat (peephole_correct movbe_elim_ph is s)] =
| match is with
| [Instr i oprs (AnnotateMovbe64 proof_of_movbe)] ->
let oprs:normal (instr_operands_t [out op64] [op64]) =
coerce_to_normal #(instr_operands_t [out op64] [op64]) oprs
in
let dst, (src, ()) = oprs in
if OReg? dst
then
(let Some is' = movbe_elim_ph.ph is in
lemma_movbe_is_mov_bswap ... | false |
Spec.RSAPSS.fst | Spec.RSAPSS.mgf_hash | val mgf_hash:
a:Hash.hash_alg{hash_is_supported a}
-> len:size_nat{len + 4 <= max_size_t /\ (len + 4) `Hash.less_than_max_input_length` a}
-> mgfseed:lbytes len
-> maskLen:size_pos{(blocks maskLen (Hash.hash_length a)) * Hash.hash_length a < pow2 32} ->
Tot (lbytes maskLen) | val mgf_hash:
a:Hash.hash_alg{hash_is_supported a}
-> len:size_nat{len + 4 <= max_size_t /\ (len + 4) `Hash.less_than_max_input_length` a}
-> mgfseed:lbytes len
-> maskLen:size_pos{(blocks maskLen (Hash.hash_length a)) * Hash.hash_length a < pow2 32} ->
Tot (lbytes maskLen) | let mgf_hash a len mgfseed maskLen =
let mgfseed_counter = create (len + 4) (u8 0) in
let mgfseed_counter = update_sub mgfseed_counter 0 len mgfseed in
let hLen = Hash.hash_length a in
let n = blocks maskLen hLen in
let _, acc = generate_blocks #uint8 hLen n n (mgf_hash_a len n) (mgf_hash_f a len) mgfseed_co... | {
"file_name": "specs/Spec.RSAPSS.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 38,
"end_line": 68,
"start_col": 0,
"start_line": 61
} | module Spec.RSAPSS
open FStar.Mul
open Lib.IntTypes
open Lib.NatMod
open Lib.Sequence
open Lib.ByteSequence
open Lib.LoopCombinators
module Hash = Spec.Agile.Hash
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
RFC spec of RSA-PSS: https://tools.ietf.org/html/rfc8017#section-8.1
List of supported hash functi... | {
"checked_file": "/",
"dependencies": [
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.Hash",
"short_module": "Hash"
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"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.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} ->
len:
Lib.IntTypes.size_nat
{ len + 4 <= Lib.IntTypes.max_size_t /\
Spec.Hash.Definitions.less_than_max_input_length (len + 4) a } ->
mgfseed: Lib.ByteSequence.lbytes len ->
maskLen:
Lib.IntTypes.size_pos... | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.hash_alg",
"Prims.b2t",
"Spec.RSAPSS.hash_is_supported",
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Lib.IntTypes.max_size_t",
"Spec.Hash.Definitions.less_than_max_input_length",
"Lib.ByteSequence.lbytes",
"Lib.IntTypes.size_po... | [] | false | false | false | false | false | let mgf_hash a len mgfseed maskLen =
| let mgfseed_counter = create (len + 4) (u8 0) in
let mgfseed_counter = update_sub mgfseed_counter 0 len mgfseed in
let hLen = Hash.hash_length a in
let n = blocks maskLen hLen in
let _, acc =
generate_blocks #uint8 hLen n n (mgf_hash_a len n) (mgf_hash_f a len) mgfseed_counter
in
sub #uint8 #(n * hLen) acc 0 maskLen | false |
Spec.RSAPSS.fst | Spec.RSAPSS.pss_verify | val pss_verify:
a:Hash.hash_alg{hash_is_supported a}
-> sLen:size_nat{sLen + Hash.hash_length a + 8 <= max_size_t /\
(sLen + Hash.hash_length a + 8) `Hash.less_than_max_input_length` a}
-> msgLen:nat{msgLen `Hash.less_than_max_input_length` a}
-> msg:bytes{length msg == msgLen}
-> emBits:size_pos
-> e... | val pss_verify:
a:Hash.hash_alg{hash_is_supported a}
-> sLen:size_nat{sLen + Hash.hash_length a + 8 <= max_size_t /\
(sLen + Hash.hash_length a + 8) `Hash.less_than_max_input_length` a}
-> msgLen:nat{msgLen `Hash.less_than_max_input_length` a}
-> msg:bytes{length msg == msgLen}
-> emBits:size_pos
-> e... | let pss_verify a sLen msgLen msg emBits em =
let emLen = blocks emBits 8 in
let msBits = emBits % 8 in
let em_0 = if msBits > 0 then em.[0] &. (u8 0xff <<. size msBits) else u8 0 in
let em_last = em.[emLen - 1] in
if (emLen < sLen + Hash.hash_length a + 2) then false
else begin
if not (FStar.UInt8.(Li... | {
"file_name": "specs/Spec.RSAPSS.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 52,
"end_line": 212,
"start_col": 0,
"start_line": 200
} | module Spec.RSAPSS
open FStar.Mul
open Lib.IntTypes
open Lib.NatMod
open Lib.Sequence
open Lib.ByteSequence
open Lib.LoopCombinators
module Hash = Spec.Agile.Hash
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
RFC spec of RSA-PSS: https://tools.ietf.org/html/rfc8017#section-8.1
List of supported hash functi... | {
"checked_file": "/",
"dependencies": [
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.Hash",
"short_module": "Hash"
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"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.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} ->
sLen:
Lib.IntTypes.size_nat
{ sLen + Spec.Hash.Definitions.hash_length a + 8 <= Lib.IntTypes.max_size_t /\
Spec.Hash.Definitions.less_than_max_input_length (sLen +
Spec.Hash.Definitions.hash_length a +
... | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.hash_alg",
"Prims.b2t",
"Spec.RSAPSS.hash_is_supported",
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Spec.Hash.Definitions.hash_length",
"Lib.IntTypes.max_size_t",
"Spec.Hash.Definitions.less_than_max_input_length",
"Prims.nat"... | [] | false | false | false | false | false | let pss_verify a sLen msgLen msg emBits em =
| let emLen = blocks emBits 8 in
let msBits = emBits % 8 in
let em_0 = if msBits > 0 then em.[ 0 ] &. (u8 0xff <<. size msBits) else u8 0 in
let em_last = em.[ emLen - 1 ] in
if (emLen < sLen + Hash.hash_length a + 2)
then false
else
if
not (FStar.UInt8.(Lib.RawIntTypes.u8_to_UInt8 em_last =^ 0xbcuy) &&
FSt... | false |
Spec.RSAPSS.fst | Spec.RSAPSS.rsapss_load_pkey | val rsapss_load_pkey:
modBits:modBits_t
-> eBits:size_pos
-> nb:lseq uint8 (blocks modBits 8)
-> eb:lseq uint8 (blocks eBits 8) ->
option (rsapss_pkey modBits) | val rsapss_load_pkey:
modBits:modBits_t
-> eBits:size_pos
-> nb:lseq uint8 (blocks modBits 8)
-> eb:lseq uint8 (blocks eBits 8) ->
option (rsapss_pkey modBits) | let rsapss_load_pkey modBits eBits nb eb =
let n = os2ip #(blocks modBits 8) nb in
let e = os2ip #(blocks eBits 8) eb in
//`n % 2 = 1` is needed to store `r2 = r * r % n` as a part of pkey
if (n % 2 = 1 && pow2 (modBits - 1) < n && n < pow2 modBits &&
0 < e && e < pow2 eBits) then
Some (Mk_rsapss_pke... | {
"file_name": "specs/Spec.RSAPSS.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 8,
"end_line": 378,
"start_col": 0,
"start_line": 369
} | module Spec.RSAPSS
open FStar.Mul
open Lib.IntTypes
open Lib.NatMod
open Lib.Sequence
open Lib.ByteSequence
open Lib.LoopCombinators
module Hash = Spec.Agile.Hash
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
RFC spec of RSA-PSS: https://tools.ietf.org/html/rfc8017#section-8.1
List of supported hash functi... | {
"checked_file": "/",
"dependencies": [
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.Hash",
"short_module": "Hash"
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"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 |
modBits: Spec.RSAPSS.modBits_t ->
eBits: Lib.IntTypes.size_pos ->
nb: Lib.Sequence.lseq Lib.IntTypes.uint8 (Spec.RSAPSS.blocks modBits 8) ->
eb: Lib.Sequence.lseq Lib.IntTypes.uint8 (Spec.RSAPSS.blocks eBits 8)
-> FStar.Pervasives.Native.option (Spec.RSAPSS.rsapss_pkey modBits) | Prims.Tot | [
"total"
] | [] | [
"Spec.RSAPSS.modBits_t",
"Lib.IntTypes.size_pos",
"Lib.Sequence.lseq",
"Lib.IntTypes.uint8",
"Spec.RSAPSS.blocks",
"Prims.op_AmpAmp",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Prims.op_LessThan",
"Prims.pow2",
"Prims.op_Subtraction",
"FStar.Pervasives.Native.Some",
"Spec.RSAPS... | [] | false | false | false | false | false | let rsapss_load_pkey modBits eBits nb eb =
| let n = os2ip #(blocks modBits 8) nb in
let e = os2ip #(blocks eBits 8) eb in
if (n % 2 = 1 && pow2 (modBits - 1) < n && n < pow2 modBits && 0 < e && e < pow2 eBits)
then Some (Mk_rsapss_pkey n e)
else None | false |
Spec.RSAPSS.fst | Spec.RSAPSS.rsapss_sign_ | val rsapss_sign_:
a:Hash.hash_alg{hash_is_supported a}
-> modBits:modBits_t
-> skey:rsapss_skey modBits
-> sLen:size_nat{
sLen + Hash.hash_length a + 8 <= max_size_t /\
(sLen + Hash.hash_length a + 8) `Hash.less_than_max_input_length` a /\
sLen + Hash.hash_length a + 2 <= blocks (modBits - 1) 8}
... | val rsapss_sign_:
a:Hash.hash_alg{hash_is_supported a}
-> modBits:modBits_t
-> skey:rsapss_skey modBits
-> sLen:size_nat{
sLen + Hash.hash_length a + 8 <= max_size_t /\
(sLen + Hash.hash_length a + 8) `Hash.less_than_max_input_length` a /\
sLen + Hash.hash_length a + 2 <= blocks (modBits - 1) 8}
... | let rsapss_sign_ a modBits skey sLen salt msgLen msg =
let pkey = Mk_rsapss_skey?.pkey skey in
let n = Mk_rsapss_pkey?.n pkey in
let e = Mk_rsapss_pkey?.e pkey in
let d = Mk_rsapss_skey?.d skey in
let k = blocks modBits 8 in
FStar.Math.Lemmas.pow2_le_compat (8 * k) modBits;
let emBits = modBits - 1 in
... | {
"file_name": "specs/Spec.RSAPSS.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 19,
"end_line": 280,
"start_col": 0,
"start_line": 261
} | module Spec.RSAPSS
open FStar.Mul
open Lib.IntTypes
open Lib.NatMod
open Lib.Sequence
open Lib.ByteSequence
open Lib.LoopCombinators
module Hash = Spec.Agile.Hash
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
RFC spec of RSA-PSS: https://tools.ietf.org/html/rfc8017#section-8.1
List of supported hash functi... | {
"checked_file": "/",
"dependencies": [
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.Hash",
"short_module": "Hash"
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"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.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} ->
modBits: Spec.RSAPSS.modBits_t ->
skey: Spec.RSAPSS.rsapss_skey modBits ->
sLen:
Lib.IntTypes.size_nat
{ sLen + Spec.Hash.Definitions.hash_length a + 8 <= Lib.IntTypes.max_size_t /\
Spec.Hash.Definitions.less_... | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.hash_alg",
"Prims.b2t",
"Spec.RSAPSS.hash_is_supported",
"Spec.RSAPSS.modBits_t",
"Spec.RSAPSS.rsapss_skey",
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Spec.Hash.Definitions.hash_length",
"Lib.IntTypes.max_size_t",
"Spec.Has... | [] | false | false | false | false | false | let rsapss_sign_ a modBits skey sLen salt msgLen msg =
| let pkey = Mk_rsapss_skey?.pkey skey in
let n = Mk_rsapss_pkey?.n pkey in
let e = Mk_rsapss_pkey?.e pkey in
let d = Mk_rsapss_skey?.d skey in
let k = blocks modBits 8 in
FStar.Math.Lemmas.pow2_le_compat (8 * k) modBits;
let emBits = modBits - 1 in
let emLen = blocks emBits 8 in
let em = pss_encode a sLen salt msgLen ms... | false |
Hacl.P256.PrecompTable.fst | Hacl.P256.PrecompTable.precomp_g_pow2_64_table_lemma_w4 | val precomp_g_pow2_64_table_lemma_w4: unit ->
Lemma (forall (i:nat{i < 16}). precomp_table_acc_inv g_pow2_64 16 precomp_g_pow2_64_table_lseq_w4 i) | val precomp_g_pow2_64_table_lemma_w4: unit ->
Lemma (forall (i:nat{i < 16}). precomp_table_acc_inv g_pow2_64 16 precomp_g_pow2_64_table_lseq_w4 i) | let precomp_g_pow2_64_table_lemma_w4 () =
normalize_term_spec (SPT.precomp_base_table_list mk_p256_precomp_base_table proj_g_pow2_64 15);
SPT.precomp_base_table_lemma mk_p256_precomp_base_table
proj_g_pow2_64 16 precomp_g_pow2_64_table_lseq_w4;
proj_g_pow2_64_lemma () | {
"file_name": "code/ecdsap256/Hacl.P256.PrecompTable.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 25,
"end_line": 230,
"start_col": 0,
"start_line": 226
} | module Hacl.P256.PrecompTable
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module SPT = Hacl.Spec.PrecompBaseTable
module SPT256 = Hacl.Spec.Pr... | {
"checked_file": "/",
"dependencies": [
"Spec.P256.Lemmas.fsti.checked",
"Spec.P256.fst.checked",
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hac... | [
{
"abbrev": true,
"full_module": "Spec.P256.Lemmas",
"short_module": "SL"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.P256.PrecompTable",
"short_module": "SPTK"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.PrecompBaseTable256",
"short_module": "SPT256"
},
{
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures
forall (i: Prims.nat{i < 16}).
Hacl.P256.PrecompTable.precomp_table_acc_inv Hacl.P256.PrecompTable.g_pow2_64
16
Hacl.P256.PrecompTable.precomp_g_pow2_64_table_lseq_w4
i) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.unit",
"Hacl.P256.PrecompTable.proj_g_pow2_64_lemma",
"Hacl.Spec.PrecompBaseTable.precomp_base_table_lemma",
"Spec.P256.PointOps.proj_point",
"Lib.IntTypes.U64",
"FStar.UInt32.uint_to_t",
"Hacl.P256.PrecompTable.mk_p256_precomp_base_table",
"Hacl.P256.PrecompTable.proj_g_pow2_64",
"Hacl.P256.... | [] | true | false | true | false | false | let precomp_g_pow2_64_table_lemma_w4 () =
| normalize_term_spec (SPT.precomp_base_table_list mk_p256_precomp_base_table proj_g_pow2_64 15);
SPT.precomp_base_table_lemma mk_p256_precomp_base_table
proj_g_pow2_64
16
precomp_g_pow2_64_table_lseq_w4;
proj_g_pow2_64_lemma () | false |
Spec.RSAPSS.fst | Spec.RSAPSS.rsapss_verify_ | val rsapss_verify_:
a:Hash.hash_alg{hash_is_supported a}
-> modBits:modBits_t
-> pkey:rsapss_pkey modBits
-> sLen:size_nat{
sLen + Hash.hash_length a + 8 <= max_size_t /\
(sLen + Hash.hash_length a + 8) `Hash.less_than_max_input_length` a}
-> sgnt:lbytes (blocks modBits 8)
-> msgLen:nat{msgLen `Ha... | val rsapss_verify_:
a:Hash.hash_alg{hash_is_supported a}
-> modBits:modBits_t
-> pkey:rsapss_pkey modBits
-> sLen:size_nat{
sLen + Hash.hash_length a + 8 <= max_size_t /\
(sLen + Hash.hash_length a + 8) `Hash.less_than_max_input_length` a}
-> sgnt:lbytes (blocks modBits 8)
-> msgLen:nat{msgLen `Ha... | let rsapss_verify_ a modBits pkey sLen sgnt msgLen msg =
let n = Mk_rsapss_pkey?.n pkey in
let e = Mk_rsapss_pkey?.e pkey in
let k = blocks modBits 8 in
FStar.Math.Lemmas.pow2_le_compat (8 * k) modBits;
let emBits = modBits - 1 in
let emLen = blocks emBits 8 in
let s = os2ip #k sgnt in
if s < n then b... | {
"file_name": "specs/Spec.RSAPSS.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 12,
"end_line": 335,
"start_col": 0,
"start_line": 319
} | module Spec.RSAPSS
open FStar.Mul
open Lib.IntTypes
open Lib.NatMod
open Lib.Sequence
open Lib.ByteSequence
open Lib.LoopCombinators
module Hash = Spec.Agile.Hash
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
RFC spec of RSA-PSS: https://tools.ietf.org/html/rfc8017#section-8.1
List of supported hash functi... | {
"checked_file": "/",
"dependencies": [
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.Hash",
"short_module": "Hash"
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"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.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} ->
modBits: Spec.RSAPSS.modBits_t ->
pkey: Spec.RSAPSS.rsapss_pkey modBits ->
sLen:
Lib.IntTypes.size_nat
{ sLen + Spec.Hash.Definitions.hash_length a + 8 <= Lib.IntTypes.max_size_t /\
Spec.Hash.Definitions.less_... | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.hash_alg",
"Prims.b2t",
"Spec.RSAPSS.hash_is_supported",
"Spec.RSAPSS.modBits_t",
"Spec.RSAPSS.rsapss_pkey",
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Spec.Hash.Definitions.hash_length",
"Lib.IntTypes.max_size_t",
"Spec.Has... | [] | false | false | false | false | false | let rsapss_verify_ a modBits pkey sLen sgnt msgLen msg =
| let n = Mk_rsapss_pkey?.n pkey in
let e = Mk_rsapss_pkey?.e pkey in
let k = blocks modBits 8 in
FStar.Math.Lemmas.pow2_le_compat (8 * k) modBits;
let emBits = modBits - 1 in
let emLen = blocks emBits 8 in
let s = os2ip #k sgnt in
if s < n
then
let m = pow_mod #n s e in
if m < pow2 (emLen * 8)
then
let em = i2... | false |
Bug2605.fst | Bug2605.g3 | val g3 (#a: Type) (i: int)
: Steel unit emp (fun _ -> emp) (requires fun _ -> phi i) (ensures fun _ _ _ -> True) | val g3 (#a: Type) (i: int)
: Steel unit emp (fun _ -> emp) (requires fun _ -> phi i) (ensures fun _ _ _ -> True) | let g3 (#a:Type) (i:int)
: Steel unit emp (λ _ → emp)
(requires λ _ → phi i)
(ensures λ _ _ _ → ⊤)
= f3 i | {
"file_name": "share/steel/tests/Bug2605.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 8,
"end_line": 19,
"start_col": 0,
"start_line": 15
} | module Bug2605
open Steel.Memory
open Steel.Effect.Atomic
open Steel.Effect
open Steel.ST.Util
open Steel.ST.Coercions
assume val phi : int -> Type0
assume
val f3 (i:int{phi i})
: STT unit emp (fun _ -> emp) | {
"checked_file": "/",
"dependencies": [
"Steel.ST.Util.fsti.checked",
"Steel.ST.Coercions.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"... | [
{
"abbrev": false,
"full_module": "Steel.ST.Coercions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.ST.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.Effect",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | i: Prims.int -> Steel.Effect.Steel Prims.unit | Steel.Effect.Steel | [] | [] | [
"Prims.int",
"Bug2605.f3",
"Prims.unit",
"Steel.Effect.Common.emp",
"Steel.Effect.Common.vprop",
"Steel.Effect.Common.rmem",
"Bug2605.phi",
"Prims.l_True"
] | [] | false | true | false | false | false | let g3 (#a: Type) (i: int)
: Steel unit emp (fun _ -> emp) (requires fun _ -> phi i) (ensures fun _ _ _ -> True) =
| f3 i | false |
Spec.RSAPSS.fst | Spec.RSAPSS.rsapss_load_skey | val rsapss_load_skey:
modBits:modBits_t
-> eBits:size_pos
-> dBits:size_pos
-> nb:lseq uint8 (blocks modBits 8)
-> eb:lseq uint8 (blocks eBits 8)
-> db:lseq uint8 (blocks dBits 8) ->
option (rsapss_skey modBits) | val rsapss_load_skey:
modBits:modBits_t
-> eBits:size_pos
-> dBits:size_pos
-> nb:lseq uint8 (blocks modBits 8)
-> eb:lseq uint8 (blocks eBits 8)
-> db:lseq uint8 (blocks dBits 8) ->
option (rsapss_skey modBits) | let rsapss_load_skey modBits eBits dBits nb eb db =
let pkey = rsapss_load_pkey modBits eBits nb eb in
let d = os2ip #(blocks dBits 8) db in
if (Some? pkey && 0 < d && d < pow2 dBits) then
Some (Mk_rsapss_skey (Some?.v pkey) d)
else
None | {
"file_name": "specs/Spec.RSAPSS.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 8,
"end_line": 397,
"start_col": 0,
"start_line": 390
} | module Spec.RSAPSS
open FStar.Mul
open Lib.IntTypes
open Lib.NatMod
open Lib.Sequence
open Lib.ByteSequence
open Lib.LoopCombinators
module Hash = Spec.Agile.Hash
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
RFC spec of RSA-PSS: https://tools.ietf.org/html/rfc8017#section-8.1
List of supported hash functi... | {
"checked_file": "/",
"dependencies": [
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.Hash",
"short_module": "Hash"
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"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 |
modBits: Spec.RSAPSS.modBits_t ->
eBits: Lib.IntTypes.size_pos ->
dBits: Lib.IntTypes.size_pos ->
nb: Lib.Sequence.lseq Lib.IntTypes.uint8 (Spec.RSAPSS.blocks modBits 8) ->
eb: Lib.Sequence.lseq Lib.IntTypes.uint8 (Spec.RSAPSS.blocks eBits 8) ->
db: Lib.Sequence.lseq Lib.IntTypes.uint8 (Spec.RS... | Prims.Tot | [
"total"
] | [] | [
"Spec.RSAPSS.modBits_t",
"Lib.IntTypes.size_pos",
"Lib.Sequence.lseq",
"Lib.IntTypes.uint8",
"Spec.RSAPSS.blocks",
"Prims.op_AmpAmp",
"FStar.Pervasives.Native.uu___is_Some",
"Spec.RSAPSS.rsapss_pkey",
"Prims.op_LessThan",
"Prims.pow2",
"FStar.Pervasives.Native.Some",
"Spec.RSAPSS.rsapss_skey",... | [] | false | false | false | false | false | let rsapss_load_skey modBits eBits dBits nb eb db =
| let pkey = rsapss_load_pkey modBits eBits nb eb in
let d = os2ip #(blocks dBits 8) db in
if (Some? pkey && 0 < d && d < pow2 dBits) then Some (Mk_rsapss_skey (Some?.v pkey) d) else None | false |
Spec.RSAPSS.fst | Spec.RSAPSS.rsapss_skey_sign | val rsapss_skey_sign:
a:Hash.hash_alg{hash_is_supported a}
-> modBits:modBits_t
-> eBits:size_pos
-> dBits:size_pos
-> nb:lseq uint8 (blocks modBits 8)
-> eb:lseq uint8 (blocks eBits 8)
-> db:lseq uint8 (blocks dBits 8)
-> sLen:size_nat
-> salt:lbytes sLen
-> msgLen:nat
-> msg:bytes{length msg =... | val rsapss_skey_sign:
a:Hash.hash_alg{hash_is_supported a}
-> modBits:modBits_t
-> eBits:size_pos
-> dBits:size_pos
-> nb:lseq uint8 (blocks modBits 8)
-> eb:lseq uint8 (blocks eBits 8)
-> db:lseq uint8 (blocks dBits 8)
-> sLen:size_nat
-> salt:lbytes sLen
-> msgLen:nat
-> msg:bytes{length msg =... | let rsapss_skey_sign a modBits eBits dBits nb eb db sLen salt msgLen msg =
let skey = rsapss_load_skey modBits eBits dBits nb eb db in
match skey with
| Some vskey -> rsapss_sign a modBits vskey sLen salt msgLen msg
| None -> None | {
"file_name": "specs/Spec.RSAPSS.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 418,
"start_col": 0,
"start_line": 414
} | module Spec.RSAPSS
open FStar.Mul
open Lib.IntTypes
open Lib.NatMod
open Lib.Sequence
open Lib.ByteSequence
open Lib.LoopCombinators
module Hash = Spec.Agile.Hash
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
RFC spec of RSA-PSS: https://tools.ietf.org/html/rfc8017#section-8.1
List of supported hash functi... | {
"checked_file": "/",
"dependencies": [
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.Hash",
"short_module": "Hash"
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"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.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} ->
modBits: Spec.RSAPSS.modBits_t ->
eBits: Lib.IntTypes.size_pos ->
dBits: Lib.IntTypes.size_pos ->
nb: Lib.Sequence.lseq Lib.IntTypes.uint8 (Spec.RSAPSS.blocks modBits 8) ->
eb: Lib.Sequence.lseq Lib.IntTypes.uint8 (Spec.RSAPS... | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.hash_alg",
"Prims.b2t",
"Spec.RSAPSS.hash_is_supported",
"Spec.RSAPSS.modBits_t",
"Lib.IntTypes.size_pos",
"Lib.Sequence.lseq",
"Lib.IntTypes.uint8",
"Spec.RSAPSS.blocks",
"Lib.IntTypes.size_nat",
"Lib.ByteSequence.lbytes",
"Prims.nat",
"Lib.ByteSequence.bytes",
"Prims... | [] | false | false | false | false | false | let rsapss_skey_sign a modBits eBits dBits nb eb db sLen salt msgLen msg =
| let skey = rsapss_load_skey modBits eBits dBits nb eb db in
match skey with
| Some vskey -> rsapss_sign a modBits vskey sLen salt msgLen msg
| None -> None | false |
Spec.RSAPSS.fst | Spec.RSAPSS.rsapss_pkey_verify | val rsapss_pkey_verify:
a:Hash.hash_alg{hash_is_supported a}
-> modBits:modBits_t
-> eBits:size_pos
-> nb:lseq uint8 (blocks modBits 8)
-> eb:lseq uint8 (blocks eBits 8)
-> sLen:size_nat
-> k:size_nat
-> sgnt:lbytes k
-> msgLen:nat
-> msg:bytes{length msg == msgLen} ->
Tot bool | val rsapss_pkey_verify:
a:Hash.hash_alg{hash_is_supported a}
-> modBits:modBits_t
-> eBits:size_pos
-> nb:lseq uint8 (blocks modBits 8)
-> eb:lseq uint8 (blocks eBits 8)
-> sLen:size_nat
-> k:size_nat
-> sgnt:lbytes k
-> msgLen:nat
-> msg:bytes{length msg == msgLen} ->
Tot bool | let rsapss_pkey_verify a modBits eBits nb eb sLen k sgnt msgLen msg =
let pkey = rsapss_load_pkey modBits eBits nb eb in
match pkey with
| Some vpkey -> rsapss_verify a modBits vpkey sLen k sgnt msgLen msg
| None -> false | {
"file_name": "specs/Spec.RSAPSS.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 17,
"end_line": 438,
"start_col": 0,
"start_line": 434
} | module Spec.RSAPSS
open FStar.Mul
open Lib.IntTypes
open Lib.NatMod
open Lib.Sequence
open Lib.ByteSequence
open Lib.LoopCombinators
module Hash = Spec.Agile.Hash
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
RFC spec of RSA-PSS: https://tools.ietf.org/html/rfc8017#section-8.1
List of supported hash functi... | {
"checked_file": "/",
"dependencies": [
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.Hash",
"short_module": "Hash"
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"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.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} ->
modBits: Spec.RSAPSS.modBits_t ->
eBits: Lib.IntTypes.size_pos ->
nb: Lib.Sequence.lseq Lib.IntTypes.uint8 (Spec.RSAPSS.blocks modBits 8) ->
eb: Lib.Sequence.lseq Lib.IntTypes.uint8 (Spec.RSAPSS.blocks eBits 8) ->
sLen: Lib.I... | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.hash_alg",
"Prims.b2t",
"Spec.RSAPSS.hash_is_supported",
"Spec.RSAPSS.modBits_t",
"Lib.IntTypes.size_pos",
"Lib.Sequence.lseq",
"Lib.IntTypes.uint8",
"Spec.RSAPSS.blocks",
"Lib.IntTypes.size_nat",
"Lib.ByteSequence.lbytes",
"Prims.nat",
"Lib.ByteSequence.bytes",
"Prims... | [] | false | false | false | false | false | let rsapss_pkey_verify a modBits eBits nb eb sLen k sgnt msgLen msg =
| let pkey = rsapss_load_pkey modBits eBits nb eb in
match pkey with
| Some vpkey -> rsapss_verify a modBits vpkey sLen k sgnt msgLen msg
| None -> false | false |
MiniParse.Impl.Int.fst | MiniParse.Impl.Int.parse_bounded_u16_impl | val parse_bounded_u16_impl (b: nat) : Tot (parser_impl (parse_bounded_u16 b)) | val parse_bounded_u16_impl (b: nat) : Tot (parser_impl (parse_bounded_u16 b)) | let parse_bounded_u16_impl
(b: nat)
: Tot (parser_impl (parse_bounded_u16 b)) =
if b >= 65536
then (fun input len -> parse_synth_impl parse_u16_impl (fun x -> x <: bounded_u16 b) (fun x -> x <: bounded_u16 b) (fun x -> x) () input len)
else
[@@inline_let]
let b' = U16.uint_to_t b in
parse_synth_impl... | {
"file_name": "examples/miniparse/MiniParse.Impl.Int.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 8,
"end_line": 81,
"start_col": 0,
"start_line": 68
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MiniParse.Spec.Int.Aux.fst.checked",
"MiniParse.Spec.Int.fst.checked",
"MiniParse.Impl.Combinators.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.check... | [
{
"abbrev": true,
"full_module": "MiniParse.Spec.Int.Aux",
"short_module": "Aux"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"fu... | {
"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: Prims.nat -> MiniParse.Impl.Base.parser_impl (MiniParse.Spec.Int.parse_bounded_u16 b) | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.op_GreaterThanOrEqual",
"MiniParse.Impl.Base.buffer8",
"FStar.UInt32.t",
"Prims.eq2",
"LowStar.Monotonic.Buffer.len",
"FStar.UInt8.t",
"LowStar.Buffer.trivial_preorder",
"MiniParse.Impl.Combinators.parse_synth_impl",
"FStar.UInt16.t",
"MiniParse.Spec.Int.bounded_u16",
"Mini... | [] | false | false | false | false | false | let parse_bounded_u16_impl (b: nat) : Tot (parser_impl (parse_bounded_u16 b)) =
| if b >= 65536
then
(fun input len ->
parse_synth_impl parse_u16_impl
(fun x -> x <: bounded_u16 b)
(fun x -> x <: bounded_u16 b)
(fun x -> x)
()
input
len)
else
[@@ inline_let ]let b' = U16.uint_to_t b in
parse_synth_impl (parse_filter_impl parse_u16_impl (fun... | false |
Spec.RSAPSS.fst | Spec.RSAPSS.pss_verify_ | val pss_verify_:
a:Hash.hash_alg{hash_is_supported a}
-> sLen:size_nat{sLen + Hash.hash_length a + 8 <= max_size_t /\
(sLen + Hash.hash_length a + 8) `Hash.less_than_max_input_length` a}
-> msgLen:nat{msgLen `Hash.less_than_max_input_length` a}
-> msg:bytes{length msg == msgLen}
-> emBits:size_pos{sLen ... | val pss_verify_:
a:Hash.hash_alg{hash_is_supported a}
-> sLen:size_nat{sLen + Hash.hash_length a + 8 <= max_size_t /\
(sLen + Hash.hash_length a + 8) `Hash.less_than_max_input_length` a}
-> msgLen:nat{msgLen `Hash.less_than_max_input_length` a}
-> msg:bytes{length msg == msgLen}
-> emBits:size_pos{sLen ... | let pss_verify_ a sLen msgLen msg emBits em =
let hLen = Hash.hash_length a in
let emLen = blocks emBits 8 in
let dbLen = emLen - hLen - 1 in
let maskedDB = sub em 0 dbLen in
let m1Hash = sub em dbLen hLen in
let dbMask = mgf_hash a hLen m1Hash dbLen in
let db = xor_bytes dbMask maskedDB in
let db = db... | {
"file_name": "specs/Spec.RSAPSS.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 5,
"end_line": 187,
"start_col": 0,
"start_line": 160
} | module Spec.RSAPSS
open FStar.Mul
open Lib.IntTypes
open Lib.NatMod
open Lib.Sequence
open Lib.ByteSequence
open Lib.LoopCombinators
module Hash = Spec.Agile.Hash
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
RFC spec of RSA-PSS: https://tools.ietf.org/html/rfc8017#section-8.1
List of supported hash functi... | {
"checked_file": "/",
"dependencies": [
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.Hash",
"short_module": "Hash"
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"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.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} ->
sLen:
Lib.IntTypes.size_nat
{ sLen + Spec.Hash.Definitions.hash_length a + 8 <= Lib.IntTypes.max_size_t /\
Spec.Hash.Definitions.less_than_max_input_length (sLen +
Spec.Hash.Definitions.hash_length a +
... | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.hash_alg",
"Prims.b2t",
"Spec.RSAPSS.hash_is_supported",
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Spec.Hash.Definitions.hash_length",
"Lib.IntTypes.max_size_t",
"Spec.Hash.Definitions.less_than_max_input_length",
"Prims.nat"... | [] | false | false | false | false | false | let pss_verify_ a sLen msgLen msg emBits em =
| let hLen = Hash.hash_length a in
let emLen = blocks emBits 8 in
let dbLen = emLen - hLen - 1 in
let maskedDB = sub em 0 dbLen in
let m1Hash = sub em dbLen hLen in
let dbMask = mgf_hash a hLen m1Hash dbLen in
let db = xor_bytes dbMask maskedDB in
let db = db_zero db emBits in
let padLen = emLen - sLen - hLen - 1 in
let ... | false |
Hacl.Spec.Curve25519.Field51.Lemmas.fst | Hacl.Spec.Curve25519.Field51.Lemmas.lemma_prime | val lemma_prime: unit ->
Lemma (pow2 255 % prime = 19) | val lemma_prime: unit ->
Lemma (pow2 255 % prime = 19) | let lemma_prime () =
assert_norm (pow2 255 % prime = 19 % prime);
assert_norm (19 < prime);
FStar.Math.Lemmas.modulo_lemma 19 prime | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 41,
"end_line": 73,
"start_col": 0,
"start_line": 70
} | module Hacl.Spec.Curve25519.Field51.Lemmas
open FStar.Mul
open Lib.Sequence
open Lib.IntTypes
open FStar.Tactics
open FStar.Tactics.Canon
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
module BSeq = Lib.ByteSequence
module LSeq = Lib.Sequence
#reset-options "--z3rlimit 50 --using_facts_from '* -... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"Hacl.Impl.Curve25519.Lemmas.fst.checked",
"F... | [
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "Lib.ByteSequence",
"short_module": "BSeq"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev... | {
"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.Pervasives.Lemma (ensures Prims.pow2 255 % Spec.Curve25519.prime = 19) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.unit",
"FStar.Math.Lemmas.modulo_lemma",
"Spec.Curve25519.prime",
"FStar.Pervasives.assert_norm",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Prims.pow2"
] | [] | true | false | true | false | false | let lemma_prime () =
| assert_norm (pow2 255 % prime = 19 % prime);
assert_norm (19 < prime);
FStar.Math.Lemmas.modulo_lemma 19 prime | false |
Hacl.Spec.Curve25519.Field51.Lemmas.fst | Hacl.Spec.Curve25519.Field51.Lemmas.lemma_mod_sub_distr | val lemma_mod_sub_distr: a:int -> b:int -> n:pos ->
Lemma ((a - b % n) % n = (a - b) % n) | val lemma_mod_sub_distr: a:int -> b:int -> n:pos ->
Lemma ((a - b % n) % n = (a - b) % n) | let lemma_mod_sub_distr a b n =
FStar.Math.Lemmas.lemma_div_mod b n;
FStar.Math.Lemmas.distributivity_sub_left 0 (b / n) n;
// (a - b) % n == (a - (b % n) - (b / n) * n) % n
FStar.Math.Lemmas.lemma_mod_plus (a - (b % n)) (-(b / n)) n | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 61,
"end_line": 24,
"start_col": 0,
"start_line": 20
} | module Hacl.Spec.Curve25519.Field51.Lemmas
open FStar.Mul
open Lib.Sequence
open Lib.IntTypes
open FStar.Tactics
open FStar.Tactics.Canon
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
module BSeq = Lib.ByteSequence
module LSeq = Lib.Sequence
#reset-options "--z3rlimit 50 --using_facts_from '* -... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"Hacl.Impl.Curve25519.Lemmas.fst.checked",
"F... | [
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "Lib.ByteSequence",
"short_module": "BSeq"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev... | {
"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: Prims.int -> b: Prims.int -> n: Prims.pos
-> FStar.Pervasives.Lemma (ensures (a - b % n) % n = (a - b) % n) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"Prims.pos",
"FStar.Math.Lemmas.lemma_mod_plus",
"Prims.op_Subtraction",
"Prims.op_Modulus",
"Prims.op_Minus",
"Prims.op_Division",
"Prims.unit",
"FStar.Math.Lemmas.distributivity_sub_left",
"FStar.Math.Lemmas.lemma_div_mod"
] | [] | true | false | true | false | false | let lemma_mod_sub_distr a b n =
| FStar.Math.Lemmas.lemma_div_mod b n;
FStar.Math.Lemmas.distributivity_sub_left 0 (b / n) n;
FStar.Math.Lemmas.lemma_mod_plus (a - (b % n)) (- (b / n)) n | false |
Spec.RSAPSS.fst | Spec.RSAPSS.pss_encode | val pss_encode:
a:Hash.hash_alg{hash_is_supported a}
-> sLen:size_nat{sLen + Hash.hash_length a + 8 <= max_size_t /\
(sLen + Hash.hash_length a + 8) `Hash.less_than_max_input_length` a}
-> salt:lbytes sLen
-> msgLen:nat{msgLen `Hash.less_than_max_input_length` a}
-> msg:bytes{length msg == msgLen}
-> ... | val pss_encode:
a:Hash.hash_alg{hash_is_supported a}
-> sLen:size_nat{sLen + Hash.hash_length a + 8 <= max_size_t /\
(sLen + Hash.hash_length a + 8) `Hash.less_than_max_input_length` a}
-> salt:lbytes sLen
-> msgLen:nat{msgLen `Hash.less_than_max_input_length` a}
-> msg:bytes{length msg == msgLen}
-> ... | let pss_encode a sLen salt msgLen msg emBits =
let mHash = Hash.hash a msg in
let hLen = Hash.hash_length a in
//m1 = [8 * 0x00; mHash; salt]
let m1Len = 8 + hLen + sLen in
let m1 = create m1Len (u8 0) in
let m1 = update_sub m1 8 hLen mHash in
let m1 = update_sub m1 (8 + hLen) sLen salt in
let m1Hash =... | {
"file_name": "specs/Spec.RSAPSS.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 27,
"end_line": 147,
"start_col": 0,
"start_line": 119
} | module Spec.RSAPSS
open FStar.Mul
open Lib.IntTypes
open Lib.NatMod
open Lib.Sequence
open Lib.ByteSequence
open Lib.LoopCombinators
module Hash = Spec.Agile.Hash
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(**
RFC spec of RSA-PSS: https://tools.ietf.org/html/rfc8017#section-8.1
List of supported hash functi... | {
"checked_file": "/",
"dependencies": [
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.Hash",
"short_module": "Hash"
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"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.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} ->
sLen:
Lib.IntTypes.size_nat
{ sLen + Spec.Hash.Definitions.hash_length a + 8 <= Lib.IntTypes.max_size_t /\
Spec.Hash.Definitions.less_than_max_input_length (sLen +
Spec.Hash.Definitions.hash_length a +
... | Prims.Pure | [] | [] | [
"Spec.Hash.Definitions.hash_alg",
"Prims.b2t",
"Spec.RSAPSS.hash_is_supported",
"Lib.IntTypes.size_nat",
"Prims.l_and",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Spec.Hash.Definitions.hash_length",
"Lib.IntTypes.max_size_t",
"Spec.Hash.Definitions.less_than_max_input_length",
"Lib.ByteSe... | [] | false | false | false | false | false | let pss_encode a sLen salt msgLen msg emBits =
| let mHash = Hash.hash a msg in
let hLen = Hash.hash_length a in
let m1Len = 8 + hLen + sLen in
let m1 = create m1Len (u8 0) in
let m1 = update_sub m1 8 hLen mHash in
let m1 = update_sub m1 (8 + hLen) sLen salt in
let m1Hash = Hash.hash a m1 in
let emLen = blocks emBits 8 in
let dbLen = emLen - hLen - 1 in
let db = crea... | false |
Hacl.Spec.Curve25519.Field51.Lemmas.fst | Hacl.Spec.Curve25519.Field51.Lemmas.lemma_add_zero | val lemma_add_zero:
f1:felem5{felem_fits5 f1 (1, 2, 1, 1, 1)}
-> Lemma (
let (f10, f11, f12, f13, f14) = f1 in
let o0 = f10 +! u64 0x3fffffffffff68 in
let o1 = f11 +! u64 0x3ffffffffffff8 in
let o2 = f12 +! u64 0x3ffffffffffff8 in
let o3 = f13 +! u64 0x3ffffffffffff8 in
let o4 = f14 +! u64 0... | val lemma_add_zero:
f1:felem5{felem_fits5 f1 (1, 2, 1, 1, 1)}
-> Lemma (
let (f10, f11, f12, f13, f14) = f1 in
let o0 = f10 +! u64 0x3fffffffffff68 in
let o1 = f11 +! u64 0x3ffffffffffff8 in
let o2 = f12 +! u64 0x3ffffffffffff8 in
let o3 = f13 +! u64 0x3ffffffffffff8 in
let o4 = f14 +! u64 0... | let lemma_add_zero f1 =
let (f10, f11, f12, f13, f14) = f1 in
let o0 = f10 +! u64 0x3fffffffffff68 in
let o1 = f11 +! u64 0x3ffffffffffff8 in
let o2 = f12 +! u64 0x3ffffffffffff8 in
let o3 = f13 +! u64 0x3ffffffffffff8 in
let o4 = f14 +! u64 0x3ffffffffffff8 in
let out = (o0, o1, o2, o3, o4) in
assert (... | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 51,
"end_line": 116,
"start_col": 0,
"start_line": 86
} | module Hacl.Spec.Curve25519.Field51.Lemmas
open FStar.Mul
open Lib.Sequence
open Lib.IntTypes
open FStar.Tactics
open FStar.Tactics.Canon
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
module BSeq = Lib.ByteSequence
module LSeq = Lib.Sequence
#reset-options "--z3rlimit 50 --using_facts_from '* -... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"Hacl.Impl.Curve25519.Lemmas.fst.checked",
"F... | [
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "Lib.ByteSequence",
"short_module": "BSeq"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev... | {
"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 |
f1:
Hacl.Spec.Curve25519.Field51.Definition.felem5
{Hacl.Spec.Curve25519.Field51.Definition.felem_fits5 f1 (1, 2, 1, 1, 1)}
-> FStar.Pervasives.Lemma
(ensures
(let _ = f1 in
(let FStar.Pervasives.Native.Mktuple5 #_ #_ #_ #_ #_ f10 f11 f12 f13 f14 = _ in
let o0 = f10 +! L... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.felem5",
"Hacl.Spec.Curve25519.Field51.Definition.felem_fits5",
"FStar.Pervasives.Native.Mktuple5",
"Prims.nat",
"Lib.IntTypes.uint64",
"Prims._assert",
"Prims.eq2",
"Prims.int",
"Hacl.Spec.Curve25519.Field51.Definition.feval",
"Prims.op_Modulus",
"Prims.... | [] | false | false | true | false | false | let lemma_add_zero f1 =
| let f10, f11, f12, f13, f14 = f1 in
let o0 = f10 +! u64 0x3fffffffffff68 in
let o1 = f11 +! u64 0x3ffffffffffff8 in
let o2 = f12 +! u64 0x3ffffffffffff8 in
let o3 = f13 +! u64 0x3ffffffffffff8 in
let o4 = f14 +! u64 0x3ffffffffffff8 in
let out = (o0, o1, o2, o3, o4) in
assert (feval out ==
(v f10 + 0x3fffffffffff68... | false |
Hacl.Spec.Curve25519.Field51.Lemmas.fst | Hacl.Spec.Curve25519.Field51.Lemmas.lemma_fmul5_pow51_pow51_pow51_pow51 | val lemma_fmul5_pow51_pow51_pow51_pow51: r:felem5
-> Lemma
(requires (let (r0, r1, r2, r3, r4) = r in
v r4 * 19 <= 190 * pow51 /\ v r3 * 19 <= 190 * pow51 /\
v r2 * 19 <= 190 * pow51 /\ v r1 * 19 <= 190 * pow51))
(ensures (let (r0, r1, r2, r3, r4) = r in
(pow51 * pow51 * pow51 * pow51 * as_n... | val lemma_fmul5_pow51_pow51_pow51_pow51: r:felem5
-> Lemma
(requires (let (r0, r1, r2, r3, r4) = r in
v r4 * 19 <= 190 * pow51 /\ v r3 * 19 <= 190 * pow51 /\
v r2 * 19 <= 190 * pow51 /\ v r1 * 19 <= 190 * pow51))
(ensures (let (r0, r1, r2, r3, r4) = r in
(pow51 * pow51 * pow51 * pow51 * as_n... | let lemma_fmul5_pow51_pow51_pow51_pow51 r =
let (r0, r1, r2, r3, r4) = r in
lemma_mul_assos_5 pow51 pow51 pow51 pow51 (as_nat5 r);
let p51p51p51r = pow51 * pow51 * pow51 * as_nat5 r in
FStar.Math.Lemmas.lemma_mod_mul_distr_r pow51 p51p51p51r prime;
assert ((pow51 * pow51 * pow51 * pow51 * as_nat5 r) % prime =... | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 124,
"end_line": 203,
"start_col": 0,
"start_line": 192
} | module Hacl.Spec.Curve25519.Field51.Lemmas
open FStar.Mul
open Lib.Sequence
open Lib.IntTypes
open FStar.Tactics
open FStar.Tactics.Canon
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
module BSeq = Lib.ByteSequence
module LSeq = Lib.Sequence
#reset-options "--z3rlimit 50 --using_facts_from '* -... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"Hacl.Impl.Curve25519.Lemmas.fst.checked",
"F... | [
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "Lib.ByteSequence",
"short_module": "BSeq"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev... | {
"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: Hacl.Spec.Curve25519.Field51.Definition.felem5
-> FStar.Pervasives.Lemma
(requires
(let _ = r in
(let FStar.Pervasives.Native.Mktuple5 #_ #_ #_ #_ #_ _ r1 r2 r3 r4 = _ in
Lib.IntTypes.v r4 * 19 <= 190 * Hacl.Spec.Curve25519.Field51.Definition.pow51 /\
Lib.IntTypes.v ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.felem5",
"Lib.IntTypes.uint64",
"FStar.Math.Lemmas.lemma_mod_mul_distr_r",
"Hacl.Spec.Curve25519.Field51.Definition.pow51",
"Hacl.Spec.Curve25519.Field51.Definition.as_nat5",
"FStar.Pervasives.Native.Mktuple5",
"Lib.IntTypes.op_Star_Bang",
"Lib.IntTypes.U64",
... | [] | false | false | true | false | false | let lemma_fmul5_pow51_pow51_pow51_pow51 r =
| let r0, r1, r2, r3, r4 = r in
lemma_mul_assos_5 pow51 pow51 pow51 pow51 (as_nat5 r);
let p51p51p51r = ((pow51 * pow51) * pow51) * as_nat5 r in
FStar.Math.Lemmas.lemma_mod_mul_distr_r pow51 p51p51p51r prime;
assert (((((pow51 * pow51) * pow51) * pow51) * as_nat5 r) % prime ==
(pow51 * (p51p51p51r % prime)) % prime);... | false |
Hacl.Spec.Curve25519.Field51.Lemmas.fst | Hacl.Spec.Curve25519.Field51.Lemmas.lemma_fmul5_pow51_pow51_pow51 | val lemma_fmul5_pow51_pow51_pow51: r:felem5
-> Lemma
(requires (let (r0, r1, r2, r3, r4) = r in
v r4 * 19 <= 190 * pow51 /\ v r3 * 19 <= 190 * pow51 /\
v r2 * 19 <= 190 * pow51))
(ensures (let (r0, r1, r2, r3, r4) = r in
(pow51 * pow51 * pow51 * as_nat5 r) % prime ==
as_nat5 (r2 *! u6... | val lemma_fmul5_pow51_pow51_pow51: r:felem5
-> Lemma
(requires (let (r0, r1, r2, r3, r4) = r in
v r4 * 19 <= 190 * pow51 /\ v r3 * 19 <= 190 * pow51 /\
v r2 * 19 <= 190 * pow51))
(ensures (let (r0, r1, r2, r3, r4) = r in
(pow51 * pow51 * pow51 * as_nat5 r) % prime ==
as_nat5 (r2 *! u6... | let lemma_fmul5_pow51_pow51_pow51 r =
let (r0, r1, r2, r3, r4) = r in
lemma_mul_assos_4 pow51 pow51 pow51 (as_nat5 r);
let p51p51r = pow51 * pow51 * as_nat5 r in
FStar.Math.Lemmas.lemma_mod_mul_distr_r pow51 p51p51r prime;
assert ((pow51 * pow51 * pow51 * as_nat5 r) % prime == (pow51 * (p51p51r % prime)) % pr... | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field51.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 114,
"end_line": 182,
"start_col": 0,
"start_line": 171
} | module Hacl.Spec.Curve25519.Field51.Lemmas
open FStar.Mul
open Lib.Sequence
open Lib.IntTypes
open FStar.Tactics
open FStar.Tactics.Canon
open Spec.Curve25519
open Hacl.Spec.Curve25519.Field51.Definition
module BSeq = Lib.ByteSequence
module LSeq = Lib.Sequence
#reset-options "--z3rlimit 50 --using_facts_from '* -... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Hacl.Spec.Curve25519.Field51.Definition.fst.checked",
"Hacl.Impl.Curve25519.Lemmas.fst.checked",
"F... | [
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "Lib.ByteSequence",
"short_module": "BSeq"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Curve25519.Field51.Definition",
"short_module": null
},
{
"abbrev... | {
"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: Hacl.Spec.Curve25519.Field51.Definition.felem5
-> FStar.Pervasives.Lemma
(requires
(let _ = r in
(let FStar.Pervasives.Native.Mktuple5 #_ #_ #_ #_ #_ _ _ r2 r3 r4 = _ in
Lib.IntTypes.v r4 * 19 <= 190 * Hacl.Spec.Curve25519.Field51.Definition.pow51 /\
Lib.IntTypes.v r... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Curve25519.Field51.Definition.felem5",
"Lib.IntTypes.uint64",
"FStar.Math.Lemmas.lemma_mod_mul_distr_r",
"Hacl.Spec.Curve25519.Field51.Definition.pow51",
"Hacl.Spec.Curve25519.Field51.Definition.as_nat5",
"FStar.Pervasives.Native.Mktuple5",
"Lib.IntTypes.op_Star_Bang",
"Lib.IntTypes.U64",
... | [] | false | false | true | false | false | let lemma_fmul5_pow51_pow51_pow51 r =
| let r0, r1, r2, r3, r4 = r in
lemma_mul_assos_4 pow51 pow51 pow51 (as_nat5 r);
let p51p51r = (pow51 * pow51) * as_nat5 r in
FStar.Math.Lemmas.lemma_mod_mul_distr_r pow51 p51p51r prime;
assert ((((pow51 * pow51) * pow51) * as_nat5 r) % prime == (pow51 * (p51p51r % prime)) % prime);
lemma_fmul5_pow51_pow51 r;
assert ((((... | false |
InterpreterTarget.fst | InterpreterTarget.index | val index : a: Type -> Type | let index a = option a | {
"file_name": "src/3d/InterpreterTarget.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 22,
"end_line": 43,
"start_col": 0,
"start_line": 43
} | (*
Copyright 2021 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": [
"Target.fsti.checked",
"prims.fst.checked",
"Hashtable.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Printf.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Lis... | [
{
"abbrev": true,
"full_module": "Hashtable",
"short_module": "H"
},
{
"abbrev": true,
"full_module": "Target",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "Ast",
"short_module": "A"
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short... | {
"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 -> Type | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.Native.option"
] | [] | false | false | false | true | true | let index a =
| option a | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.